width ){\\n speedX = speedX * -1 ;\\n }\\n\\n if( positionLeft < 0 ){\\n speedX = speedX * -1;\\n }\\n\\n if( positionTop > height ){\\n speedY = speedY * -1 ;\\n }\\n\\n if( positionTop < 0 ){\\n speedY = speedY * -1;\\n }\\n\\n //edit class\\n $('#shape').css(\\\"left\\\", positionLeft)\\n $('#shape').css(\\\"top\\\", positionTop)\\n\\n window.requestAnimationFrame(step);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54fc6d31e4cf2224a7853c07142b85ec\",\n \"score\": \"0.5922835\",\n \"text\": \"function shoot() {\\n var xPos = player.position().top;\\n\\n //create individual name for each bullet => bullet0, bullet1 etc..\\n var bulletName = \\\"bullet\\\" + bulletCount;\\n bulletCount++;\\n\\n //insert bullet\\n $( 'div#amo' ).append( '<div class=\\\"bullet\\\" id=\\\"' + bulletName + '\\\"></div>' );\\n\\n //attach indivdual bullets to player position //1600\\n $( 'div#' + bulletName ).css( {\\n 'top': xPos + 25 + 'px'\\n } ).animate( {\\n left: '489px'\\n }, {\\n duration: 1600,\\n done: function() {\\n this.remove(); //remove <div> it at the end of the animation (which is at the max width)\\n },\\n step: function() { //function to be called for EACH animated property\\n var bulletCords = $( this ).offset(); //to get actual position on the screen\\n var enemies = $( \\\".enemy\\\" );\\n for ( var i = 0; i < enemies.length; i++ ) { // loop through .enemy class\\n var enemyCords = enemies.eq( i ).offset(); // gets individual position\\n\\n if ( bulletCords.left + 10 >= enemyCords.left + 5 && bulletCords.top + 10 >= enemyCords.top + 1 && enemyCords.top + 35 >= bulletCords.top ) {\\n enemies.eq( i ).remove() // remove the .enemy elements to the one at the specified index\\n $( 'div#' + bulletName ).fadeOut( 1000 ).remove(); // removes the div\\n killCount += 1;\\n parseInt( $( 'span#score' ).html( killCount ) );\\n gameOver();\\n speedUp();\\n }\\n }\\n }\\n } );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7fd01099bf299ace97c14564fc3f467\",\n \"score\": \"0.59178627\",\n \"text\": \"shootBullet(time, delta){\\n if (this.input.activePointer.isDown) {\\n this.bullet = this.bullets.get();\\n\\n if (this.bullet)\\n {\\n this.bullet.shoot(this.player.x, this.player.y);\\n this.lastFired = time + 50;\\n this.music = this.sound.add(\\\"shootSound\\\");\\n this.music.play();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b6b4c1ed5ded004ba72a17adf538b49\",\n \"score\": \"0.5915812\",\n \"text\": \"function shoot() {\\n\\n if (!gameSettings.gameOver && !gameSettings.pause) {\\n var clone = cloneFbx(gameObjects.bullet.object);\\n clone.position.set(gameObjects.player.position.x, gameObjects.player.position.y, gameObjects.player.position.z);\\n clone.angle = gameObjects.player.rotation.y + Math.PI;\\n scene.add(clone);\\n clone.id = gameObjects.bullet.id++;\\n gameObjects.bullet.bullets.push(clone);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2855e53f22b74c806ff6f725bc626bcc\",\n \"score\": \"0.59113\",\n \"text\": \"function initializeBullets() {\\n var bullets = [];\\n var turrets = $('.turret')\\n for(var i = 0; i < 32; i++) {\\n var round = [0]\\n $(turrets[i]).attr('turret_id', i);\\n for(var j = 0; j < 4; j++) {\\n var bullet = document.createElement('div'); \\n $('#sky').append(bullet);\\n $(bullet).addClass('bullet');\\n $(bullet).hide();\\n round.push(bullet);\\n }\\n bullets.push(round);\\n }\\n $(document).attr('bullets', bullets);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae4c527205e55882538dc4bdc572f9f2\",\n \"score\": \"0.5896645\",\n \"text\": \"function Player_bullet() {\\n _super.call(this, \\\"player_bullet\\\", 8);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d96f9ce04169af1a2b3d6d36d308428\",\n \"score\": \"0.5885709\",\n \"text\": \"function repositionGameItem(){\\n gameItem.x += gameItem.speedX; // update the position of the circle along the x-axis\\n gameItem.y += gameItem.speedY; // update the position of the circle along the x-axis\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a59316f8abb8aa00650e68553aead38\",\n \"score\": \"0.5867752\",\n \"text\": \"function fireBullet(posX, posY) {\\n // Reset the bar hit or it will start throwing the rope\\n // ..instead of the bullet\\n barHit = false;\\n isActive = true;\\n\\n firedPointX = posX;\\n firedPointY = posY;\\n\\n // Get the positions relative to the current bot position\\n relFiredPointX = firedPointX - bot.posX;\\n relFiredPointY = firedPointY - bot.posY;\\n\\n // Relative angles to the fire position\\n relAngleX = relAngleY = Math.atan2(relFiredPointY, relFiredPointX) * 57.32;\\n\\n // Set the fired flag\\n bulletFired = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bfa13da2aa76c704604d285af4fa136\",\n \"score\": \"0.5849762\",\n \"text\": \"update() {\\n if (this.posX > L10_2.crc2New.canvas.width || this.posX < 0) {\\n this.velocityX = -this.velocityX;\\n }\\n if (this.posY > L10_2.crc2New.canvas.height * 0.20 || this.posY < 10) {\\n this.velocityY = -this.velocityY;\\n }\\n this.posX += this.velocityX;\\n this.posY += this.velocityY;\\n // this.draw();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"021460d1543ef051f1df1b11620a1254\",\n \"score\": \"0.5843079\",\n \"text\": \"function drawLives(){\\n let pos = 50;\\n for(i=0; i< 10; i++){\\n let temp = createSprite(pos, height - 20, 50, 50);\\n temp.addAnimation('run', 'images/heart/tile000.png', 'images/heart/tile007.png' )\\n temp.scale = 0.4;\\n append(lives, temp);\\n pos += 50;\\n }\\n return\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84657ec9319a759abf53e95085ca8289\",\n \"score\": \"0.5834915\",\n \"text\": \"function animatePlayer() {\\n\\n //mouvement du joueur \\n if(Keyboard.RIGHT){\\n player.x += player.speed;\\n \\n }\\n if(Keyboard.LEFT){\\n player.x -= player.speed;\\n \\n }\\n\\n //gestion du débordement de l'érand du joueur\\n if (player.x < 0) {\\n player.x = 0;\\n }\\nelse if (player.x + player.sprite.width > canvas.width) {\\n player.x = canvas.width - player.sprite.width;\\n}\\nif (Keyboard.SPACE) {\\n if ( player.bullet === null){\\n player.bullet = {\\n x : player.x + player.sprite.width / 2,\\n y : player.y,\\n width : 4,\\n height : 15,\\n color : '#0f0',\\n speed : 9,\\n };\\n }\\n}\\n\\nif(player.bullet !== null) {\\n player.bullet.y -= player.bullet.speed;\\n\\n if ( player.bullet.y + player.bullet.height < 0) {\\n player.bullet = null;\\n }\\n}\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"136afd3d2c1fe8a949680caf571d0c2b\",\n \"score\": \"0.5834542\",\n \"text\": \"updatePos() {\\n //find the changes in x and y\\n var yChange = this.speed * Math.sin(this.theta) ;\\n var xChange = this.speed * Math.cos(this.theta) ;\\n //update the positions\\n this.posX = this.posX + xChange ;\\n this.posY = this.posY + yChange ;\\n //update css\\n this.element.css(\\\"left\\\", this.posX) ;\\n this.element.css(\\\"top\\\", this.posY) ;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77f9528cf2f604a02f837e6dc095869e\",\n \"score\": \"0.5830519\",\n \"text\": \"updatePositions() {\\n for (const sprite of this.sprites) {\\n const { x, y } = this.state.position;\\n sprite.setPosition(x, y);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b854a025006f2aa3f3758febf4fcd95d\",\n \"score\": \"0.5825905\",\n \"text\": \"function bulletSwitch() {\\n $(\\\".slider__control-bullets-item--active\\\").removeClass(\\n \\\"slider__control-bullets-item--active\\\"\\n );\\n const slideActive = $(\\\".section-testimonials__box--active\\\");\\n const slideNumber = $(\\\".section-testimonials__box\\\").index(slideActive);\\n $(\\\".slider__control-bullets-item\\\")\\n .eq(slideNumber)\\n .addClass(\\\"slider__control-bullets-item--active\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17a01d8312bb4e2bcd4974e28f3e5aa5\",\n \"score\": \"0.5821419\",\n \"text\": \"constructor(_name, _size, _position) {\\n super(\\\"Bullet\\\", _size, _position);\\n this.velocity = fc.Vector3.ZERO();\\n //let cmpMaterial: fc.ComponentMaterial = new fc.ComponentMaterial(this.grey);\\n //this.addComponent(cmpMaterial); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d00e53619c6034915275fdcea328bbd\",\n \"score\": \"0.5817808\",\n \"text\": \"function bulletThumbs() {\\n\\t\\t\\tvar thumbs_markup = '';\\n\\n\\t\\t\\tfor(var i = 0; i < $slides.length; i++) {\\n\\t\\t\\t\\tthumbs_markup += '<a href=\\\"#\\\" class=\\\"mpc_ls_thumb\\\"><span class=\\\"mpc_ls_thumb_inside\\\"></span></a>'\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t$thumbs_container\\n\\t\\t\\t\\t.addClass(settings.uiStyle)\\n\\t\\t\\t\\t.append(thumbs_markup)\\n\\t\\t\\t\\t.height($thumbs_container.children().height());\\n\\n\\t\\t\\t$thumbs = $thumbs_container.children();\\n\\t\\t\\t$thumbs.eq(index).addClass('active');\\n\\n\\t\\t\\tif(settings.showBulletsTooltip)\\n\\t\\t\\t\\taddTooltip();\\n\\n\\t\\t\\tpositionThumbs();\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1364c49eb3a91585872dae733fe0734\",\n \"score\": \"0.5816051\",\n \"text\": \"function resetBullet() {\\n bullet.kill();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4f05564dc142d08581cfaf7a3a56cd8\",\n \"score\": \"0.5800204\",\n \"text\": \"function shootBullet() {\\n shootSound.currentTime = 0;\\n shootSound.play();\\n if (!cheatEnabled) {\\n remainingBulletsNode = remainingBulletsNodeSet;\\n let foundUse = false;\\n for (let i = 0; i < remainingBulletsNode.childNodes.length; i++) {\\n let node = remainingBulletsNode.childNodes.item(i);\\n if (node.nodeName == \\\"use\\\") {\\n node.parentNode.removeChild(node);\\n break;\\n }\\n else {\\n continue;\\n }\\n }\\n for (let i = 0; i < remainingBulletsNode.childNodes.length; i++) {\\n let node = remainingBulletsNode.childNodes.item(i);\\n if (node.nodeName == \\\"use\\\") {\\n foundUse = true;\\n break;\\n }\\n else {\\n continue;\\n }\\n }\\n\\n // Disable shooting for a short period of time\\n canShoot = false;\\n if (foundUse) {\\n setTimeout(\\\"canShoot = true\\\", SHOOT_INTERVAL);\\n }\\n }\\n else {\\n canShoot = false;\\n setTimeout(\\\"canShoot = true\\\", SHOOT_INTERVAL);\\n }\\n // Create the bullet using the use node\\n let bullet = new Bullet();\\n bullet.faceRight = player.faceRight;\\n bullet.node = document.createElementNS(\\\"http://www.w3.org/2000/svg\\\", \\\"use\\\");\\n bullet.node.setAttribute(\\\"x\\\", player.position.x + PLAYER_SIZE.w / 2 - BULLET_SIZE.w / 2);\\n bullet.node.setAttribute(\\\"y\\\", player.position.y + PLAYER_SIZE.h / 2 - BULLET_SIZE.h / 2);\\n bullet.node.setAttributeNS(\\\"http://www.w3.org/1999/xlink\\\", \\\"xlink:href\\\", \\\"#bullet\\\");\\n bulletsNodeSet.appendChild(bullet.node);\\n bulletsClass.push(bullet);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"018ad9f63cebeedf0abec69e98c3ac39\",\n \"score\": \"0.5799981\",\n \"text\": \"function update() {\\n for (var i = 0; i < balls.length; i += 1) {\\n ball = balls[i];\\n ball.nextX = (ball.x += ball.velocityX);\\n ball.nextY = (ball.y += ball.velocityY);\\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":62,"cells":{"query_id":{"kind":"string","value":"0bff74b8c2dabe4382660ce3cba03aa7"},"query":{"kind":"string","value":"For not moving after drag"},"positive_passages":{"kind":"list like","value":[{"docid":"8bff6c4cbfdc6f554f2d1ae5d1d60c51","score":"0.0","text":"function dblclick(d) {\n d3.select(this).classed(\"fixed\", d.fixed = false);\n }","title":""}],"string":"[\n {\n \"docid\": \"8bff6c4cbfdc6f554f2d1ae5d1d60c51\",\n \"score\": \"0.0\",\n \"text\": \"function dblclick(d) {\\n d3.select(this).classed(\\\"fixed\\\", d.fixed = false);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"ce0eefd035078ba7c176d47ceb320704","score":"0.7504444","text":"function dragMove (e) {\n var clientX = isTouch ? e.touches[0].pageX : e.clientX,\n clientY = isTouch ? e.touches[0].pageY : e.clientY,\n limitsX = self.limits.x,\n limitsY = self.limits.y;\n // Mouse movementin px\n movedX = clientX - posX;\n movedY = clientY - posY;\n\n // Based on the direction of the first px\n // disable drag if moving in opposite axis\n if(!isDragging && (self.restrict.y && Math.abs(movedY) > Math.abs(movedX)\n || self.restrict.x && Math.abs(movedX) > Math.abs(movedY))) {\n return dragEnd();\n }\n e.preventDefault();\n isDragging = true;\n ele.classList.add('isDragging');\n\n if (!self.restrict.x) {\n // New pixel value (x axis) of element\n newX = relativeX + movedX;\n if (newX >= limitsX[0] && newX <= limitsX[1]) {\n posX = clientX;\n relativeX = newX;\n }\n else if (newX < limitsX[0]) {\n relativeX = limitsX[0];\n }\n else if (newX > limitsX[1]) {\n relativeX = limitsX[1];\n }\n self.position.x = relativeX;\n }\n if (!self.restrict.y) {\n newY = relativeY + movedY;\n if (newY >= limitsY[0] && newY <= limitsY[1]) {\n posY = clientY;\n relativeY = newY;\n }\n else if (newY < limitsY[0]) {\n relativeY = limitsY[0];\n }\n else if (newY > limitsY[1]) {\n relativeY = limitsY[1];\n }\n self.position.y = relativeY;\n }\n util.rAF.call(window, function () {\n var use3d = self.config.use3d;\n ele.style[transformProp] = 'translate' + (use3d ? '3d' : '') + '(' + relativeX + 'px,' + relativeY + 'px' + (use3d ? ',0)' : ')');\n self.onDragMove.call(self, e, { x: movedX, y: movedY });\n });\n }","title":""},{"docid":"e40cac4bce3c19407fc38a223251a809","score":"0.7369043","text":"function finishDragging() {\n\tisDragged = false;\n}","title":""},{"docid":"1a329b23423a2127d518888bcc7cdec2","score":"0.7292748","text":"function dragended() {}","title":""},{"docid":"b80e93af272966b90099a5e9903135ea","score":"0.7266028","text":"function mouseDragged() {\n return false;\n}","title":""},{"docid":"b80e93af272966b90099a5e9903135ea","score":"0.7266028","text":"function mouseDragged() {\n return false;\n}","title":""},{"docid":"e0b2f0119a2ca61184e5190907d91386","score":"0.72450995","text":"function touchMoved() {\n return false;\n}","title":""},{"docid":"f47eb799a7c481c33b794b60c826077f","score":"0.7224969","text":"flowDragMove(e){\n let deltaX = e.clientX - this.dragX;\n let deltaY = e.clientY - this.dragY;\n\n this.dragX = e.clientX;\n this.dragY = e.clientY;\n\n this.updating.dragShift(deltaX, deltaY);\n e.preventDefault();\n }","title":""},{"docid":"af51755b20d3ce7f2b41884fc0b73920","score":"0.7211253","text":"function dontStart(){ return ( drag.dragging === false ); }","title":""},{"docid":"604cc116c09ce2a219fa487941bdd6f0","score":"0.7172535","text":"onMove(e) {\n const curr = this.currentWidget;\n\n if (curr) {\n let dx = e.offsetX - this.lastX;\n let dy = e.offsetY - this.lastY;\n\n curr.moveBy(dx, dy);\n\n if (!App.currentWorkzone.verticalLine.checkPosition(curr)) {\n this.lastX = e.offsetX;\n }\n\n if (!App.currentWorkzone.horizontalLine.checkPosition(curr)) {\n this.lastY = e.offsetY;\n }\n }\n }","title":""},{"docid":"d4e96d48216e60e7821d6f4407e86f02","score":"0.7157813","text":"function drag(event) { }","title":""},{"docid":"7a1758df4081213e93ca04388c1dcc40","score":"0.7143448","text":"function dragObj() {\n console.log(\"Manual Move\");\n if (mouseX - 30 > 0 && mouseX < 800 && mouseY - 30 > 0 && mouseY < 500) {\n objects[drag].pos = [mouseX - coords[0], mouseY - coords[1]];\n } \n setScene();\n \n}","title":""},{"docid":"448e735a16c0de4a783a84d4675c33cd","score":"0.71403396","text":"handleDragStart() {\n this.isDragging = true;\n }","title":""},{"docid":"b5b5acca69201c9dbd3a682ce8472374","score":"0.71189314","text":"function checkAndMove() {\n\n if (mouseDown && selected.move) {\n selected.move();\n }\n\n}","title":""},{"docid":"ba045b6ff53d1a05ff9ea52f584d93c4","score":"0.7116139","text":"function drag (move) {\n var start = new Vec2(mouse.x, mouse.y)\n var diff = new Vec2(0, 0)\n var onMove\n mouse.change(onMove = function () {\n //can easily disable the other axi\n //for draging in only one dimention.\n move(diff.set(mouse.x, mouse.y).subtract(start)) \n })\n window.addEventListener('mouseup', function () {\n mouse.ignore(onMove)\n diff.dropped = true\n move(diff)\n })\n move(diff.set(mouse.x, mouse.y).subtract(start)) \n}","title":""},{"docid":"a4a0987277eb23bf27ae6ef56ba91af8","score":"0.7087066","text":"static onUp(e, offset) { DragBar.dragStartDim = undefined; }","title":""},{"docid":"1b7615b346cfb99d7c07a574760a04a5","score":"0.70837045","text":"mouseDrag(prev, pt) {}","title":""},{"docid":"1b7615b346cfb99d7c07a574760a04a5","score":"0.70837045","text":"mouseDrag(prev, pt) {}","title":""},{"docid":"d113b2a3f3bef14c2e6ee2b6ecd7a004","score":"0.707795","text":"function mouseDragged() {\n\n // NIVEL 8\n //revisa si la posición del astronauta es cercana a la posicion de la luna\n if (dist(mouseX, mouseY, x1, y1) < tam1 / 2 + 20) {\n\n //actualiza la posicion de la elipse con la posición del mouse\n x1 = mouseX;\n y1 = mouseY;\n }\n\n\n // NIVEL 9\n //revisa si la posición del CIRCULO es cercana a la posicion del no cuadrado\n else if (dist(mouseX + 30, mouseY + 30, x2, y2) < tam2 / 2 + 20) {\n\n //actualiza la posicion de la elipse con la posición del mouse\n x2 = mouseX;\n y2 = mouseY;\n }\n}","title":""},{"docid":"f0fa326aec98a1727e306be62c410091","score":"0.70776165","text":"function dragStart(){\n setObserver(false);\n}","title":""},{"docid":"dfd1958f4c04a752b354649713b8a9aa","score":"0.7033407","text":"onStopDrag() {\n return;\n }","title":""},{"docid":"7752953e0cac656386dac12b0d18629a","score":"0.70297265","text":"drag() {\n this._container.drag();\n }","title":""},{"docid":"53e3f30683fb1f20bf984f7a56f19a03","score":"0.6999746","text":"function drag(e) {\n if (active == true && selectState == 0) {\n e.preventDefault();\n\n if (e.type === \"touchmove\") {\n currentX = e.touches[0].clientX - initialX;\n currentY = e.touches[0].clientY - initialY;\n } else {\n currentX = e.clientX - initialX;\n currentY = e.clientY - initialY;\n }\n xOffset = currentX;\n yOffset = currentY;\n\n setTranslate(currentX, currentY, dragItem);\n }\n}","title":""},{"docid":"1370128dd6199ade7472ed2d872a2a0e","score":"0.69988996","text":"function onDragMove() {\n if (this.dragging) {\n var newPosition = this.data.getLocalPosition(this.parent);\n this.x = newPosition.x;\n this.y = newPosition.y;\n }\n}","title":""},{"docid":"002a455db2f66c262b488e1237e047ff","score":"0.6994376","text":"function dragMove() {\r\n overwolf.windows.dragMove(windowID);\r\n }","title":""},{"docid":"16d6de44bba54a027a3a1b694f08359b","score":"0.69605863","text":"function moveDragOver(e){\n\te.preventDefault();\n}","title":""},{"docid":"09cea77de07cf67385177084a52156eb","score":"0.6928059","text":"dragComplete(){\n //does nothing\n }","title":""},{"docid":"a29e147a0ceb4ce16792ae374ddf802e","score":"0.68686014","text":"function onDragMove(event) {\n\t\tif (Event.dragTarget) {\n\t\t\tif (Event.dragTarget.isObserving(\"drag\")) Event.dragTarget.fire(\"drag\", event);\n\t\t\t\n\t\t} else if (Event.dragStart) {\n\t\t\tvar target = Event.dragStart.target;\n\n// TODO: figure out the dragOffset\t\t\t\n\t\t\tif (\tMath.abs(Event.x - Event.dragStart.x) >= target.dragStartDistance\n\t\t\t\t || Math.abs(Event.y - Event.dragStart.y) >= target.dragStartDistance) \n\t\t\t{\n\t\t\t\tEvent.dragTarget = target;\n\t\t\t\tif (Event.dragTarget.isObserving(\"dragstart\")) target.fire(\"dragstart\", event);\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"1c8ef254a53f373629000b4e040234d1","score":"0.6863913","text":"isDragAvailable() {\n return true;\n }","title":""},{"docid":"9fefcf4ea96ad6549f6e91922894f651","score":"0.6852177","text":"function touchMoved(){\n return false;\n}","title":""},{"docid":"4be28de72939c485f8cab2b949ea87cc","score":"0.68467593","text":"function mouseReleased() {\n\ndragging = 0;\n\n}","title":""},{"docid":"25f093d575709cb6091ac4ed31ac2223","score":"0.6842835","text":"function mouse_move_handler(e) {\n\tvar evn;\n\tevn = e || event;\n\tif (is_drag) {\n\t\tdrag_clone.style[\"visibility\"] = \"visible\";\n\t\tvar y = evn.clientY\n\t\t\t\t+ document.getElementsByTagName('html')[0].scrollTop;\n\n\t\tdrag_clone.style[\"top\"] = (y - 5) + \"px\";\n\t\tdrag_clone.style[\"left\"] = (evn.clientX - 5) + \"px\";\n\t}\n\treturn false;\n}","title":""},{"docid":"9ce77cfae25a03160acdd6faaecef1e5","score":"0.6840981","text":"function dragmove(d, i) {\r\n\t\td.px += d3.event.dx;\r\n\t\td.py += d3.event.dy;\r\n\t\td.x += d3.event.dx;\r\n\t\td.y += d3.event.dy; \r\n\t\ttick(); // this is the key to make it work together with updating both px,py,x,y on d !\r\n\t}","title":""},{"docid":"7c63f4de41709fc98144eafca342da54","score":"0.6835764","text":"function dragleave()\n{\n console.log(\"Dragged element left target zone\");\n}","title":""},{"docid":"bbec19e39ef3f7128195aec9aca00008","score":"0.68283755","text":"function moveHandler(e) {\n // Move the element to the current mouse position, adjusted by the\n // position of the scrollbars and the offset of the initial click.\n newX = (baseX + (e.clientX - clickX));\n newY = (baseY + (e.clientY - clickY));\n elementToDrag.setXY(newX, newY);\n\tworkspace.draw();\n\n // And don't let anyone else see this event.\n e.stopPropagation(); \n }","title":""},{"docid":"28735a1a0277b0390edfe2a1b232eab2","score":"0.682037","text":"function drag() {\r\n var dx, dy, moveout;\r\n var handle = $(\"#dBox\").find(\"#d_head>#d_title\").css('cursor', 'move');\r\n handle.mousedown(function (e) {\r\n dx = e.clientX - parseInt($(\"#dBox\").css(\"left\"));\r\n dy = e.clientY - parseInt($(\"#dBox\").css(\"top\"));\r\n $(\"#dBox\").mousemove(move).mouseout(out).css({\r\n \"opacity\": opts.opacity\r\n });\r\n handle.mouseup(up);\r\n });\r\n /*\r\n * move for a new position\r\n */\r\n move = function (e) {\r\n moveout = false;\r\n var x, y;\r\n if (e.clientX - dx < 0) {\r\n x = 0;\r\n } else {\r\n if (e.clientX - dx > ($(window).width() - $(\"#dBox\").width())) {\r\n x = $(window).width() - $(\"#dBox\").width();\r\n } else {\r\n x = e.clientX - dx;\r\n }\r\n }\r\n if (e.clientY - dy < 0) {\r\n y = 0;\r\n } else {\r\n y = e.clientY - dy;\r\n }\r\n $(\"#dBox\").css({\r\n left: x,\r\n top: y\r\n });\r\n }\r\n out = function (e) {\r\n moveout = true;\r\n setTimeout(function () {\r\n moveout && up(e);\r\n }, 5);\r\n }\r\n up = function (e) {\r\n $(\"#dBox\").unbind(\"mousemove\", move).unbind(\"mouseout\", out).css(\"opacity\", 1);\r\n handle.unbind(\"mouseup\", up);\r\n }\r\n }","title":""},{"docid":"2621a9dd134452c19d3c9ac5a9350665","score":"0.6814976","text":"function dragEnd(e) { }","title":""},{"docid":"e47603f26af8d5a5f47347d710029ff9","score":"0.68107295","text":"function noDragStart() {\n return false;\n}","title":""},{"docid":"e47603f26af8d5a5f47347d710029ff9","score":"0.68107295","text":"function noDragStart() {\n return false;\n}","title":""},{"docid":"e47603f26af8d5a5f47347d710029ff9","score":"0.68107295","text":"function noDragStart() {\n return false;\n}","title":""},{"docid":"8ea032f90f79cf605ff170a138d5e5ee","score":"0.6810449","text":"function noDragStart() {\r\n\t\t return false;\r\n\t\t}","title":""},{"docid":"bfa75ae0bea064e29b897bc4204e3f7e","score":"0.6801366","text":"function tmove(e) {\n\t\t\t\t\tif(isDrag==true)\n\t\t\t\t\t{\n\t\t\t\t\t\t//prevent default event\n\t\t\t\t\t\te.preventDefault();\n\t\t\t\t\t\t\n\t\t\t\t\t\t//to prevent display error dialog in ie11\n\t\t\t\t\t\tif(window.navigator.userAgent.indexOf(\"rv:11\")!=-1)$(obj).trigger('mouseup');\n\t\t\t\t\t\t\n\t\t\t\t\t\t//trace mouse\n\t\t\t\t\t\t$(this).css({\"top\":e.pageY - y + divY +\"px\",\"left\":e.pageX - x + divX + \"px\"});\n\t\t\t\t\t\teX=e.pageX;\n\t\t\t\t\t\teY=e.pageY;\n\t\t\t\t\t\t\n\t\t\t\t\t\t//mouse up or mouse leave event\n\t\t\t\t\t\t$(this).on(\"mouseup\",tup);\n\t\t\t\t\t\t$(frameBody).on(\"mouseleave\",\".divTable\",tup);\n\t\t\t\t\t}\n\t\t\t\t}","title":""},{"docid":"fd306af0c9f460085883bc95d1c471fd","score":"0.67977285","text":"function drag_start(d) {\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\n d.fx = d.x;\n d.fy = d.y;\n }","title":""},{"docid":"5081631ec814acbdd2f0624fdbe32643","score":"0.67942","text":"stopDragging() {\n if (this.mode === 'dragging') {\n this.checkMove();\n }\n this.mode = 'standBy';\n }","title":""},{"docid":"3ca31377f7abbb704af733c6abc82b78","score":"0.67886347","text":"function mouseDragged() {\n //prevent default\n\n return false;\n\n}","title":""},{"docid":"9b3734d95ad760076cdef86a55c2d348","score":"0.6785024","text":"function myMove(e)\n{\n\tvar curs = false;\n\n\tobj.forEach(function(item, i)\n\t{\n\t\tif (e.pageX < item.x + 50 + canvas1.offsetLeft && e.pageX > item.x - 50 +\n\t\t\tcanvas1.offsetLeft && e.pageY < item.y + 50 + canvas1.offsetTop &&\n\t\t\te.pageY > item.y - 50 + canvas1.offsetTop)\n\t\t\tcurs = true;\n\t\tcanvas1.style.cursor = curs ? 'pointer' : 'default';\n\t\tif (item.dragok)\n\t\t{\n\t\t\titem.x = e.pageX - canvas1.offsetLeft;\n\t\t\titem.y = e.pageY - canvas1.offsetTop;\n\t\t}\n\t});\n}","title":""},{"docid":"607ffc277f93511c4254de9df1078e44","score":"0.6783549","text":"drag(ev) {\n // console.log('drag')\n }","title":""},{"docid":"962cb2bb67cba1710bb5d06473f02a40","score":"0.67820966","text":"drag(bool) {\n this.enableDrag = bool;\n }","title":""},{"docid":"f31d7c1c2dcaca5f6bd254e47fab324d","score":"0.6773332","text":"function up_dragged(e) {\n\t//Si il y a un clone en cours de mouvement, on le supprime, on remet tout à zéro et on \n\t// appelle la fonction qui gère le drag si elle existe et qu'il y a un récepteur en dessous \n\tif (current_drag!=null) {\n\t\t//Y-a-t-il un récepteur en dessous du lâché ?\n\t\ttarget=is_on();\n\t\t//Appel de la fonction callback_after si elle existe\n\t\tif (dragged.getAttribute(\"callback_after\")) {\n\t\t\teval(dragged.getAttribute(\"callback_after\")+\"(dragged,e,'\"+target+\"')\");\n\t\t}\n\t\t//Remise à zero\n\t\tposxdown=0;\n\t\tposydown=0;\n\t\tis_down=false;\n\t\tif (current_drag) current_drag.parentNode.removeChild(current_drag);\n\t\tcurrent_drag=null;\n\t\t//Si il y a un récepteur : callback de la fonction d'association si elle existe \n\t\tif (target) {\n\t\t\tif (eval(\"typeof \"+dragged.getAttribute(\"dragtype\")+\"_\"+document.getElementById(target).getAttribute(\"recepttype\")+\"=='function'\")) {\n\t\t\t\teval(dragged.getAttribute(\"dragtype\")+\"_\"+document.getElementById(target).getAttribute(\"recepttype\")+\"(dragged,document.getElementById(target))\");\n\t\t\t}\n\t\t}\n\t\t//On nettoie la référence à l'élément d'origine\n\t\tdragged=null;\n\t}\n}","title":""},{"docid":"7ddbc94ee9d6c61e3d8b9a600cf42963","score":"0.6768285","text":"function Draggable(_latLng){\n this.latLng = _latLng;\n this.shape;\n this.size;\n this.moving = false;\n\n\t\n this.end_move = function(){\n if(this.moving){\n this.finalize_move();\n }\n this.moving = false;\n /* kludge ... consider another to figure this out */\n if(global.moving_component != null && global.moving_component != this){\n global.moving_component.end_move();\n }\n global.moving_component = null;\n return true;\n }\n\n this.start_move = function(){\n global.moving_component = this;\n this.moving = true;\n }\n\n this.move_click = function(){\n if(!this.moving && global.moving_component == null){\n this.start_move()\n }\n else{\n this.end_move();\n }\n }\n\n this.remove = function(){\n return;\n }\n\n this.mouse_move = function(event){ \n if(this.moving){\n this.move(event);\n }\t\t \n }\n\n this.move = function(event) {\n return;\n }\n\n this.finalize_move = function(){\n return;\n }\n\t\n this.get_pos = function(){\n return this.latLng;\n }\n\t\n this.draw = function(){\n if(typeof this.shape.setMap == 'function'){\n this.shape.setMap(objects.map);\n }\t\t\n }\n\n this.undraw = function(){\n if(typeof this.shape.setMap == 'function'){\n this.shape.setMap(null);\n if(global.selected_node == this){\n this.deselect();\n } \n }\n }\n\t\n this.show = function(){\n if(typeof this.shape.getVisible == 'function'){\n this.shape.setVisible(true);\n }\n }\n\n this.hide = function(){\n if(typeof this.shape.getVisible == 'function'){\n this.shape.setVisible(false);\n }\n }\t\n\t\n}","title":""},{"docid":"31a5a33d92e54919657a073618ca9bd9","score":"0.67635304","text":"isMoving() {\n return (\n this.isDragging ||\n this.isScrolling ||\n Math.abs(this.velocity.x) >= 0.01 ||\n Math.abs(this.velocity.y) >= 0.01\n );\n }","title":""},{"docid":"8616b692dfa7050ad3c98d55faab49a6","score":"0.6758402","text":"function dragstart(d, i) {\n force.stop(); // stops the force auto positioning before you start dragging\n}","title":""},{"docid":"1d6d0282cfc88bae3d357d5d4684c922","score":"0.6748975","text":"function editOnDragOver(editor,e){editor._internalDrag=false;editor.setMode('drag');e.preventDefault();}","title":""},{"docid":"be14fa3e5402955a827737fe1a3fa264","score":"0.6748805","text":"get isDragging() {\n return this._isDown;\n }","title":""},{"docid":"3a315fe428a56f2469a8d99d7f40e965","score":"0.6745044","text":"function drag(e) {\r\n draggedItem = e.target;\r\n dragging = true;\r\n}","title":""},{"docid":"3a315fe428a56f2469a8d99d7f40e965","score":"0.6745044","text":"function drag(e) {\r\n draggedItem = e.target;\r\n dragging = true;\r\n}","title":""},{"docid":"3a315fe428a56f2469a8d99d7f40e965","score":"0.6745044","text":"function drag(e) {\r\n draggedItem = e.target;\r\n dragging = true;\r\n}","title":""},{"docid":"cada5ca012a0c25a34fac0c476355633","score":"0.6743866","text":"function handleDrag(event){\n if(checkIfPieceAndTurnIsYours(event)) {\n event.target.x = (event.stageX / (container.width/720)) - 30;\n event.target.y = (event.stageY / (container.height/720)) - 50;\n }\n }","title":""},{"docid":"0391d4451f63f3b420d128a4aa16ede7","score":"0.6742888","text":"function drag_start(d) {\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\n d.fx = d.x;\n d.fy = d.y;\n }","title":""},{"docid":"c8df7301af03886f4350fdc3b0449483","score":"0.67362976","text":"isMoveable()\n {\n return true;\n }","title":""},{"docid":"b01fa9240eef813ef608f8d597297f0c","score":"0.6723526","text":"function drag_start(d) {\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\n d.fx = d.x;\n d.fy = d.y;\n }","title":""},{"docid":"57e1ad6c2172fd689ddb0f342a70e592","score":"0.67221355","text":"function drag(e) {\n draggedItem = e.target;\n dragging = true;\n}","title":""},{"docid":"77612238e1c833082b6269a861559ac9","score":"0.6721932","text":"toggle_drag(e) {\n let self = e.data.self;\n e.stopPropagation();\n e.preventDefault();\n self.dragging = e.type === \"mousedown\";\n if (self.dragging) {\n self.dragged = true; // just ensuring the user did this at least once\n self.origin.x = e.pageX;\n self.origin.y = e.pageY;\n self.reference.element.width.computed = Math.floor($(self.DOM.reference.box).outerWidth);\n self.reference.element.height.computed = Math.floor($(self.DOM.reference.box).outerHeight);\n }\n }","title":""},{"docid":"7174125c7c92465fbcd473674cfe2499","score":"0.6720337","text":"drag(e) {\n surface.map.updateMapLocation();\n }","title":""},{"docid":"c3f215601a50fed35f98d1cb86e9c415","score":"0.6709823","text":"function dragstarted(event, d) {\n if (!event.active) simulation.alphaTarget(0.3).restart()\n d.fx = d.x;\n d.fy = d.y;\n}","title":""},{"docid":"0c51df6cce976b81d5c6c87be9a3da9e","score":"0.6708653","text":"function draggedStart(d) {\n\tsimulation.alphaTarget(1.0).restart()\n\td.fixed = true\n\td.fx = d.x\n\td.fy = d.y\n}","title":""},{"docid":"5c1b0db8a193fb419537c8c198b1ebfe","score":"0.6707425","text":"function dragnode(e) {\n closeAllPopovers();\n\n var returnResult = true;\n if (e.pos[1] < 0) {\n e.e.preventDefault();\n e.el.style.top = '10px';\n returnResult = false;\n }\n if (e.pos[0] < 0) {\n e.e.preventDefault();\n e.el.style.left = '10px';\n returnResult = false;\n }\n MyAppDAGService.nodes[e.el.id].style = {top: e.el.style.top, left: e.el.style.left};\n return returnResult;\n }","title":""},{"docid":"2194620474563d992191b3cb70f92d5f","score":"0.670304","text":"function gestureMove(ev){if(!pointer||!typesMatch(ev,pointer))return;updatePointerState(ev,pointer);runHandlers('move',ev);}","title":""},{"docid":"0977292b7cc850d2c0550fbf25ee0282","score":"0.6699792","text":"function onMouseUp(event){\n\t\tdragging = false;\n\t\t}","title":""},{"docid":"2ed45c9a9c6bb4f5a0adb7cde538338a","score":"0.6694608","text":"function drag_start(d) {\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\n d.fx = d.x;\n d.fy = d.y;\n}","title":""},{"docid":"67519f0ed98f501e1eacd617bfd0c56c","score":"0.6691689","text":"function drag()\n{\n console.log(\"Dragging\");\n}","title":""},{"docid":"4837e32db738955a16a215e6cb5663db","score":"0.66914195","text":"function dragstarted(d) {\n\t d3.event.sourceEvent.stopPropagation();\n\t // d.fx = d.x;\n\t // d.fy = d.y;\n\t netLayout.velocityDecay(0);\n\t }","title":""},{"docid":"6a74565333458e9c40c55a4c42496b70","score":"0.66902417","text":"function stopDrag() {\n // snap to grid\n var left = parseInt(evt.clientX - that.offsetLeft);\n console.log('@@@@@@@@@@@@@ ', left)\n console.log('########### ', nearest(left, 5))\n that.style.left = nearest(left, 5) + 'px';\n console.log('%%%%%%%@@@@ ', that.style.left)\n\n document.removeEventListener('mousemove', moveAlong);\n document.removeEventListener('mouseup', stopDrag);\n }","title":""},{"docid":"762b4074298627ff739d7421944125cb","score":"0.66814405","text":"mousedragMove(mouseDraggedEvent, button)\r\n {\r\n // We click the mouseWheel button. event.buttons == 2 is right-click.\r\n if(mouseDraggedEvent.buttons == button)\r\n {\r\n let speed = Math.ceil(this.clicksPerPixel * 0.5);\r\n this.mapPosition.x -= mouseDraggedEvent.movementX * speed;\r\n this.mapPosition.y -= mouseDraggedEvent.movementY * speed;\r\n this.anchor = undefined;\r\n return false;\r\n }\r\n }","title":""},{"docid":"40d4af3f4249842180e3c55ca141c983","score":"0.6662312","text":"function out_box_dragmove() {\t \n var x = out_box_x + d3.event.dx;\n var y = out_box_y + d3.event.dy;\n \n \tout_box_x = Math.max(Math.min(x, width-out_box_w), 0);\n \tout_box_y = Math.max(Math.min(y, height-out_box_h), 0);\n\n\t\td3.select(this)\n\t\t .attr(\"transform\", \"translate(\" + out_box_x + \",\" + out_box_y + \")\");\t \n\t}","title":""},{"docid":"6e95531e70ba6b2d23c1bcd8ec290a97","score":"0.66584283","text":"get wantsMouseMove() {}","title":""},{"docid":"efb660b9d1a6739ffd17a5c260a105f1","score":"0.6657973","text":"isDragging() {\n return exports.Konva['DD'].isDragging;\n }","title":""},{"docid":"73800a69234a670baa39d31493933722","score":"0.6651596","text":"onMove(event) {\n if (this.active) { //<!>\n curPosX = (event.clientX - clickPosX);\n curPosY = (event.clientY - clickPosY);\n reDraw();\n }\n }","title":""},{"docid":"75c1b16b94a9da3d03820b1a581b20c0","score":"0.66395587","text":"function drag(e) {\n if (active) {\n //prevent default dragging behavior (like dragging screen)\n e.preventDefault();\n\n //If the device is mobile:\n if (e.type === \"touchmove\") {\n currentX = e.touches[0].clientX - initialX;\n } else {\n currentX = e.clientX - initialX;\n }\n\n //XOffset is delta in pixels from start drag event\n xOffset = currentX;\n\n //If Direction is 'right'\n if (xOffset < 0) {\n direction = -1;\n }\n else { //if direction is left\n direction = 1;\n }\n\n //If mouse/finger drags less than threshold don't direction //TBD - consider removing\n if (Math.abs(xOffset) < 30) {\n direction = 0;\n }\n\n if (direction == 1 && swiped == false) {\n //Draw right blue bar on master and send message to slave\n sendNav(0);\n swiped = true;\n } else if (direction == -1 && swiped == false) {\n //Draw left blue bar on master and send to slave\n sendNav(1);\n swiped = true;\n }\n\n /*if (swiped == false) {\n message.innerHTML = 'Started swiping';\n }*/\n\n click = false;\n }\n}","title":""},{"docid":"dc2781914a4f97ff4ce805782c7aa777","score":"0.6637801","text":"function dragstarted(d) {\n if(d.no_drag) return;\n hovertool.body.style(\"visibility\", \"hidden\");\n if (!d3.event.active) simulation.alphaTarget(1).restart();\n d.fx = d.x;\n d.fy = d.y;\n }","title":""},{"docid":"1f1c1c67ca215f5474d900634a4e4498","score":"0.66377395","text":"function editOnDragStart() {\n\t this._internalDrag = !0, this.setMode(\"drag\");\n\t }","title":""},{"docid":"96be75f2970b0cdbd1ef21eb10fed0dc","score":"0.663436","text":"function touchMoved() {\n // do some stuff\n return false;\n}","title":""},{"docid":"1dd2bbe96f98af88e32c3afa00d43208","score":"0.66307825","text":"function dragmove() {\n const x = d3.event.x;\n const y = d3.event.y;\n d3.select(this).attr('cx', x).attr('cy', y);\n}","title":""},{"docid":"3c58c59f8b0f1fb6ef5c2cc1150162f3","score":"0.66276217","text":"function drag(elem) {\n // store the object of the element that needs to be moved\n selected = elem;\n elemX = posX - selected.offsetLeft;\n elemY = posY - selected.offsetTop;\n}","title":""},{"docid":"70a8bdc91a9ed8bf311219194a6df204","score":"0.662489","text":"function dragEnter(event) {\n }","title":""},{"docid":"764b34d87451e73c54372cb0f4f1cd55","score":"0.6620207","text":"onMove() {\n }","title":""},{"docid":"d5d1c23ee0a457aea8d8673b787b6a6a","score":"0.6611638","text":"function dragstarted(d) {\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\n d.fx = d.x;\n d.fy = d.y;\n }","title":""},{"docid":"61fc71d130c179f9e9a833bd76f80cc4","score":"0.6610926","text":"function dragstarted(d) {\n if (!d3.event.active) simulation.alphaTarget(0.3).restart()\n d.fx = d.x;\n d.fy = d.y;\n }","title":""},{"docid":"f49aa1fcbf5f94eedd8f15e1e1fc0f9b","score":"0.66082627","text":"function dragstarted(d) {\n\tif (!d3.event.active) simulation.alphaTarget(0.3).restart();\n\td.fx = d.x;\n\td.fy = d.y;\n}","title":""},{"docid":"1986dbc17369afbe9d186751c6cbebfd","score":"0.660524","text":"function drag(evt) {\n var coord = getMousePosition(evt, container);\n debugText.textContent = coord.x + 'x' + coord.y;\n //evt.preventDefault();\n if (!offset) {\n offset = {\n s: 0\n };\n }\n var dt = parseInt(coord.x) - offset.s;\n handleDrag(coord, dt);\n offset.s = coord.x;\n }","title":""},{"docid":"c80b290ce905f71bdcc12edf746f45da","score":"0.6594078","text":"function editOnDragStart(editor){editor._internalDrag=true;editor.setMode('drag');}","title":""},{"docid":"1b9f3902ff6234a8b6686bc4657c73b3","score":"0.65902215","text":"function mouseReleased() {\r\n moveLeft = false;\r\n moveRight = false;\r\n}","title":""},{"docid":"d7a76188d1736958e7e2883c740d8976","score":"0.6588464","text":"function drag_start(){\n drag.draggable({\n containment:'parent',\n scroll:false,\n drag:function(){ dragging() },\n stop:function(){}\n });\n }","title":""},{"docid":"386db636bc34df565aa5946a1c6cff8a","score":"0.65810496","text":"function prepareDrag() {\n var that = this;\n\n stage.onContent('mousemove touchmove', function(evt) {\n var node = engine.drag.node;\n if (node) {\n var date = new Date();\n var time = date.getTime();\n\n if (time - engine.drag.lastDrawTime > engine.dragTimeInterval) {\n engine.drag.lastDrawTime = time;\n\n var pos = that.getUserPosition();\n var dc = node.dragConstraint;\n var db = node.dragBounds;\n var lastNodePos = {\n x: node.x,\n y: node.y\n };\n\n // default\n var newNodePos = {\n x: pos.x - engine.drag.offset.x,\n y: pos.y - engine.drag.offset.y\n };\n\n // bounds overrides\n if (db.left !== undefined && newNodePos.x < db.left) {\n newNodePos.x = db.left;\n }\n if (db.right !== undefined && newNodePos.x > db.right) {\n newNodePos.x = db.right;\n }\n if (db.top !== undefined && newNodePos.y < db.top) {\n newNodePos.y = db.top;\n }\n if (db.bottom !== undefined && newNodePos.y > db.bottom) {\n newNodePos.y = db.bottom;\n }\n\n node.setAbsolutePosition(newNodePos);\n\n // constraint overrides\n if (dc === 'horizontal') {\n node.y = lastNodePos.y;\n } else if (dc === 'vertical') {\n node.x = lastNodePos.x;\n }\n\n engine.drag.node.getLayer().draw();\n\n if (!engine.drag.moving) {\n engine.drag.moving = true;\n // execute dragstart events if defined\n engine.drag.node.handleEvents('ondragstart', evt);\n }\n\n // execute user defined ondragmove if defined\n engine.drag.node.handleEvents('ondragmove', evt);\n }\n }\n }, false);\n\n stage.onContent('mouseup touchend mouseout', function(evt) {\n that.endDrag(evt);\n });\n }","title":""},{"docid":"f662a7d29e8515cfe60c40c289c757a7","score":"0.65806484","text":"function dragstarted(d) {\n if (!d3.event.active) forceSimulation.alphaTarget(0).restart();\n d.fx = d.x;\n d.fy = d.y;\n }","title":""},{"docid":"f4589d12cc95ac15255662af067c1bc1","score":"0.65802085","text":"function dragstarted(d) {\n\t// if (!d3.event.active) simulation.alphaTarget(0.03).restart();\n\td.fx = d.x;\n\td.fy = d.y;\n}","title":""},{"docid":"c79e7359c21f07c1a926bb9c622936f4","score":"0.657575","text":"function dragstarted(d) {\n d3.select(this).raise().classed(\"active\", true); \n d3.select(this).attr(\"y\", d3.mouse(this)[1]); \n g.selectAll('#limit').remove()\n //g.selectAll('.divergence').remove()\n }","title":""},{"docid":"1af72d758d5feeeaf8575e0d0149a56c","score":"0.65721506","text":"function dragstart(event) { event.preventDefault(); }","title":""},{"docid":"0d92b52dec139d62e73aa2ab5dbcd365","score":"0.6570922","text":"isMoving() {\n return (\n this.isDragging ||\n this.isScrolling ||\n Math.abs(this.velocity.x) >= 0.01 ||\n Math.abs(this.velocity.y) >= 0.01\n );\n }","title":""},{"docid":"1dc523b03a6e1b54f576d2e1f90a11cf","score":"0.6569205","text":"function dragstarted(d) {\r\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\r\n d.fx = d.x;\r\n d.fy = d.y;\r\n }","title":""},{"docid":"6504e42e8e7e511a2c15f33e760843a2","score":"0.6563437","text":"function dragCheck(){\n\tif(clickInfo.length > 0)\n\t\tif((getMousePos() - clickInfo[5]).sqrMagnitude > 60) dragMode = true;\n}","title":""},{"docid":"8e16df1637c03111fb4011546f962d5d","score":"0.6563232","text":"doDragMove(element, x, y, event) {\n let dx = x - this._drag.last.x;\n let dy = y - this._drag.last.y;\n // get initial supports and move elements on glass without changing support.\n for (let selectedElement of this._dragSet) {\n Canvas.instance.moveElementOnGlass(selectedElement, null, x, y);\n }\n // get targets (using final positions of dragged elements)\n let targets = this.getTargets(this._dragSet);\n // Possible change of support...\n for (let selectedElement of this._dragSet) {\n let target = targets.get(selectedElement);\n // No target at all : element is outside viewport\n if (!target) {\n Canvas.instance.moveElementOnGlass(selectedElement, null,\n selectedElement._drag.last.x+selectedElement._drag.drag.x,\n selectedElement._drag.last.y+selectedElement._drag.drag.y);\n } else {\n /* support changed */\n if (target.effective!==selectedElement.support) {\n Canvas.instance.moveElementOnGlass(selectedElement, target.effective, x, y);\n }\n selectedElement._drag.last.x = selectedElement.gx;\n selectedElement._drag.last.y = selectedElement.gy;\n }\n }\n for (let selectedElement of this._dragSet) {\n let target = targets.get(selectedElement);\n if (target) {\n selectedElement._hoverOn(target.effective, this._dragSet, target.initial);\n }\n selectedElement._fire(Events.DRAG_MOVE);\n }\n this._drag.last.x = x;\n this._drag.last.y = y;\n this._doHover(dx, dy);\n Canvas.instance._fire(DragMoveSelectionOperation.DRAG_MOVE_MOVE, this._dragSet);\n for (let selectedElement of this._dragSet) {\n selectedElement.registerValidLocation();\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"ce0eefd035078ba7c176d47ceb320704\",\n \"score\": \"0.7504444\",\n \"text\": \"function dragMove (e) {\\n var clientX = isTouch ? e.touches[0].pageX : e.clientX,\\n clientY = isTouch ? e.touches[0].pageY : e.clientY,\\n limitsX = self.limits.x,\\n limitsY = self.limits.y;\\n // Mouse movementin px\\n movedX = clientX - posX;\\n movedY = clientY - posY;\\n\\n // Based on the direction of the first px\\n // disable drag if moving in opposite axis\\n if(!isDragging && (self.restrict.y && Math.abs(movedY) > Math.abs(movedX)\\n || self.restrict.x && Math.abs(movedX) > Math.abs(movedY))) {\\n return dragEnd();\\n }\\n e.preventDefault();\\n isDragging = true;\\n ele.classList.add('isDragging');\\n\\n if (!self.restrict.x) {\\n // New pixel value (x axis) of element\\n newX = relativeX + movedX;\\n if (newX >= limitsX[0] && newX <= limitsX[1]) {\\n posX = clientX;\\n relativeX = newX;\\n }\\n else if (newX < limitsX[0]) {\\n relativeX = limitsX[0];\\n }\\n else if (newX > limitsX[1]) {\\n relativeX = limitsX[1];\\n }\\n self.position.x = relativeX;\\n }\\n if (!self.restrict.y) {\\n newY = relativeY + movedY;\\n if (newY >= limitsY[0] && newY <= limitsY[1]) {\\n posY = clientY;\\n relativeY = newY;\\n }\\n else if (newY < limitsY[0]) {\\n relativeY = limitsY[0];\\n }\\n else if (newY > limitsY[1]) {\\n relativeY = limitsY[1];\\n }\\n self.position.y = relativeY;\\n }\\n util.rAF.call(window, function () {\\n var use3d = self.config.use3d;\\n ele.style[transformProp] = 'translate' + (use3d ? '3d' : '') + '(' + relativeX + 'px,' + relativeY + 'px' + (use3d ? ',0)' : ')');\\n self.onDragMove.call(self, e, { x: movedX, y: movedY });\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e40cac4bce3c19407fc38a223251a809\",\n \"score\": \"0.7369043\",\n \"text\": \"function finishDragging() {\\n\\tisDragged = false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a329b23423a2127d518888bcc7cdec2\",\n \"score\": \"0.7292748\",\n \"text\": \"function dragended() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b80e93af272966b90099a5e9903135ea\",\n \"score\": \"0.7266028\",\n \"text\": \"function mouseDragged() {\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b80e93af272966b90099a5e9903135ea\",\n \"score\": \"0.7266028\",\n \"text\": \"function mouseDragged() {\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0b2f0119a2ca61184e5190907d91386\",\n \"score\": \"0.72450995\",\n \"text\": \"function touchMoved() {\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f47eb799a7c481c33b794b60c826077f\",\n \"score\": \"0.7224969\",\n \"text\": \"flowDragMove(e){\\n let deltaX = e.clientX - this.dragX;\\n let deltaY = e.clientY - this.dragY;\\n\\n this.dragX = e.clientX;\\n this.dragY = e.clientY;\\n\\n this.updating.dragShift(deltaX, deltaY);\\n e.preventDefault();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af51755b20d3ce7f2b41884fc0b73920\",\n \"score\": \"0.7211253\",\n \"text\": \"function dontStart(){ return ( drag.dragging === false ); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"604cc116c09ce2a219fa487941bdd6f0\",\n \"score\": \"0.7172535\",\n \"text\": \"onMove(e) {\\n const curr = this.currentWidget;\\n\\n if (curr) {\\n let dx = e.offsetX - this.lastX;\\n let dy = e.offsetY - this.lastY;\\n\\n curr.moveBy(dx, dy);\\n\\n if (!App.currentWorkzone.verticalLine.checkPosition(curr)) {\\n this.lastX = e.offsetX;\\n }\\n\\n if (!App.currentWorkzone.horizontalLine.checkPosition(curr)) {\\n this.lastY = e.offsetY;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4e96d48216e60e7821d6f4407e86f02\",\n \"score\": \"0.7157813\",\n \"text\": \"function drag(event) { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a1758df4081213e93ca04388c1dcc40\",\n \"score\": \"0.7143448\",\n \"text\": \"function dragObj() {\\n console.log(\\\"Manual Move\\\");\\n if (mouseX - 30 > 0 && mouseX < 800 && mouseY - 30 > 0 && mouseY < 500) {\\n objects[drag].pos = [mouseX - coords[0], mouseY - coords[1]];\\n } \\n setScene();\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"448e735a16c0de4a783a84d4675c33cd\",\n \"score\": \"0.71403396\",\n \"text\": \"handleDragStart() {\\n this.isDragging = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5b5acca69201c9dbd3a682ce8472374\",\n \"score\": \"0.71189314\",\n \"text\": \"function checkAndMove() {\\n\\n if (mouseDown && selected.move) {\\n selected.move();\\n }\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba045b6ff53d1a05ff9ea52f584d93c4\",\n \"score\": \"0.7116139\",\n \"text\": \"function drag (move) {\\n var start = new Vec2(mouse.x, mouse.y)\\n var diff = new Vec2(0, 0)\\n var onMove\\n mouse.change(onMove = function () {\\n //can easily disable the other axi\\n //for draging in only one dimention.\\n move(diff.set(mouse.x, mouse.y).subtract(start)) \\n })\\n window.addEventListener('mouseup', function () {\\n mouse.ignore(onMove)\\n diff.dropped = true\\n move(diff)\\n })\\n move(diff.set(mouse.x, mouse.y).subtract(start)) \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4a0987277eb23bf27ae6ef56ba91af8\",\n \"score\": \"0.7087066\",\n \"text\": \"static onUp(e, offset) { DragBar.dragStartDim = undefined; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b7615b346cfb99d7c07a574760a04a5\",\n \"score\": \"0.70837045\",\n \"text\": \"mouseDrag(prev, pt) {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b7615b346cfb99d7c07a574760a04a5\",\n \"score\": \"0.70837045\",\n \"text\": \"mouseDrag(prev, pt) {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d113b2a3f3bef14c2e6ee2b6ecd7a004\",\n \"score\": \"0.707795\",\n \"text\": \"function mouseDragged() {\\n\\n // NIVEL 8\\n //revisa si la posición del astronauta es cercana a la posicion de la luna\\n if (dist(mouseX, mouseY, x1, y1) < tam1 / 2 + 20) {\\n\\n //actualiza la posicion de la elipse con la posición del mouse\\n x1 = mouseX;\\n y1 = mouseY;\\n }\\n\\n\\n // NIVEL 9\\n //revisa si la posición del CIRCULO es cercana a la posicion del no cuadrado\\n else if (dist(mouseX + 30, mouseY + 30, x2, y2) < tam2 / 2 + 20) {\\n\\n //actualiza la posicion de la elipse con la posición del mouse\\n x2 = mouseX;\\n y2 = mouseY;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0fa326aec98a1727e306be62c410091\",\n \"score\": \"0.70776165\",\n \"text\": \"function dragStart(){\\n setObserver(false);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfd1958f4c04a752b354649713b8a9aa\",\n \"score\": \"0.7033407\",\n \"text\": \"onStopDrag() {\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7752953e0cac656386dac12b0d18629a\",\n \"score\": \"0.70297265\",\n \"text\": \"drag() {\\n this._container.drag();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53e3f30683fb1f20bf984f7a56f19a03\",\n \"score\": \"0.6999746\",\n \"text\": \"function drag(e) {\\n if (active == true && selectState == 0) {\\n e.preventDefault();\\n\\n if (e.type === \\\"touchmove\\\") {\\n currentX = e.touches[0].clientX - initialX;\\n currentY = e.touches[0].clientY - initialY;\\n } else {\\n currentX = e.clientX - initialX;\\n currentY = e.clientY - initialY;\\n }\\n xOffset = currentX;\\n yOffset = currentY;\\n\\n setTranslate(currentX, currentY, dragItem);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1370128dd6199ade7472ed2d872a2a0e\",\n \"score\": \"0.69988996\",\n \"text\": \"function onDragMove() {\\n if (this.dragging) {\\n var newPosition = this.data.getLocalPosition(this.parent);\\n this.x = newPosition.x;\\n this.y = newPosition.y;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"002a455db2f66c262b488e1237e047ff\",\n \"score\": \"0.6994376\",\n \"text\": \"function dragMove() {\\r\\n overwolf.windows.dragMove(windowID);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16d6de44bba54a027a3a1b694f08359b\",\n \"score\": \"0.69605863\",\n \"text\": \"function moveDragOver(e){\\n\\te.preventDefault();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09cea77de07cf67385177084a52156eb\",\n \"score\": \"0.6928059\",\n \"text\": \"dragComplete(){\\n //does nothing\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a29e147a0ceb4ce16792ae374ddf802e\",\n \"score\": \"0.68686014\",\n \"text\": \"function onDragMove(event) {\\n\\t\\tif (Event.dragTarget) {\\n\\t\\t\\tif (Event.dragTarget.isObserving(\\\"drag\\\")) Event.dragTarget.fire(\\\"drag\\\", event);\\n\\t\\t\\t\\n\\t\\t} else if (Event.dragStart) {\\n\\t\\t\\tvar target = Event.dragStart.target;\\n\\n// TODO: figure out the dragOffset\\t\\t\\t\\n\\t\\t\\tif (\\tMath.abs(Event.x - Event.dragStart.x) >= target.dragStartDistance\\n\\t\\t\\t\\t || Math.abs(Event.y - Event.dragStart.y) >= target.dragStartDistance) \\n\\t\\t\\t{\\n\\t\\t\\t\\tEvent.dragTarget = target;\\n\\t\\t\\t\\tif (Event.dragTarget.isObserving(\\\"dragstart\\\")) target.fire(\\\"dragstart\\\", event);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c8ef254a53f373629000b4e040234d1\",\n \"score\": \"0.6863913\",\n \"text\": \"isDragAvailable() {\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fefcf4ea96ad6549f6e91922894f651\",\n \"score\": \"0.6852177\",\n \"text\": \"function touchMoved(){\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4be28de72939c485f8cab2b949ea87cc\",\n \"score\": \"0.68467593\",\n \"text\": \"function mouseReleased() {\\n\\ndragging = 0;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25f093d575709cb6091ac4ed31ac2223\",\n \"score\": \"0.6842835\",\n \"text\": \"function mouse_move_handler(e) {\\n\\tvar evn;\\n\\tevn = e || event;\\n\\tif (is_drag) {\\n\\t\\tdrag_clone.style[\\\"visibility\\\"] = \\\"visible\\\";\\n\\t\\tvar y = evn.clientY\\n\\t\\t\\t\\t+ document.getElementsByTagName('html')[0].scrollTop;\\n\\n\\t\\tdrag_clone.style[\\\"top\\\"] = (y - 5) + \\\"px\\\";\\n\\t\\tdrag_clone.style[\\\"left\\\"] = (evn.clientX - 5) + \\\"px\\\";\\n\\t}\\n\\treturn false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ce77cfae25a03160acdd6faaecef1e5\",\n \"score\": \"0.6840981\",\n \"text\": \"function dragmove(d, i) {\\r\\n\\t\\td.px += d3.event.dx;\\r\\n\\t\\td.py += d3.event.dy;\\r\\n\\t\\td.x += d3.event.dx;\\r\\n\\t\\td.y += d3.event.dy; \\r\\n\\t\\ttick(); // this is the key to make it work together with updating both px,py,x,y on d !\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c63f4de41709fc98144eafca342da54\",\n \"score\": \"0.6835764\",\n \"text\": \"function dragleave()\\n{\\n console.log(\\\"Dragged element left target zone\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bbec19e39ef3f7128195aec9aca00008\",\n \"score\": \"0.68283755\",\n \"text\": \"function moveHandler(e) {\\n // Move the element to the current mouse position, adjusted by the\\n // position of the scrollbars and the offset of the initial click.\\n newX = (baseX + (e.clientX - clickX));\\n newY = (baseY + (e.clientY - clickY));\\n elementToDrag.setXY(newX, newY);\\n\\tworkspace.draw();\\n\\n // And don't let anyone else see this event.\\n e.stopPropagation(); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28735a1a0277b0390edfe2a1b232eab2\",\n \"score\": \"0.682037\",\n \"text\": \"function drag() {\\r\\n var dx, dy, moveout;\\r\\n var handle = $(\\\"#dBox\\\").find(\\\"#d_head>#d_title\\\").css('cursor', 'move');\\r\\n handle.mousedown(function (e) {\\r\\n dx = e.clientX - parseInt($(\\\"#dBox\\\").css(\\\"left\\\"));\\r\\n dy = e.clientY - parseInt($(\\\"#dBox\\\").css(\\\"top\\\"));\\r\\n $(\\\"#dBox\\\").mousemove(move).mouseout(out).css({\\r\\n \\\"opacity\\\": opts.opacity\\r\\n });\\r\\n handle.mouseup(up);\\r\\n });\\r\\n /*\\r\\n * move for a new position\\r\\n */\\r\\n move = function (e) {\\r\\n moveout = false;\\r\\n var x, y;\\r\\n if (e.clientX - dx < 0) {\\r\\n x = 0;\\r\\n } else {\\r\\n if (e.clientX - dx > ($(window).width() - $(\\\"#dBox\\\").width())) {\\r\\n x = $(window).width() - $(\\\"#dBox\\\").width();\\r\\n } else {\\r\\n x = e.clientX - dx;\\r\\n }\\r\\n }\\r\\n if (e.clientY - dy < 0) {\\r\\n y = 0;\\r\\n } else {\\r\\n y = e.clientY - dy;\\r\\n }\\r\\n $(\\\"#dBox\\\").css({\\r\\n left: x,\\r\\n top: y\\r\\n });\\r\\n }\\r\\n out = function (e) {\\r\\n moveout = true;\\r\\n setTimeout(function () {\\r\\n moveout && up(e);\\r\\n }, 5);\\r\\n }\\r\\n up = function (e) {\\r\\n $(\\\"#dBox\\\").unbind(\\\"mousemove\\\", move).unbind(\\\"mouseout\\\", out).css(\\\"opacity\\\", 1);\\r\\n handle.unbind(\\\"mouseup\\\", up);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2621a9dd134452c19d3c9ac5a9350665\",\n \"score\": \"0.6814976\",\n \"text\": \"function dragEnd(e) { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e47603f26af8d5a5f47347d710029ff9\",\n \"score\": \"0.68107295\",\n \"text\": \"function noDragStart() {\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e47603f26af8d5a5f47347d710029ff9\",\n \"score\": \"0.68107295\",\n \"text\": \"function noDragStart() {\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e47603f26af8d5a5f47347d710029ff9\",\n \"score\": \"0.68107295\",\n \"text\": \"function noDragStart() {\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ea032f90f79cf605ff170a138d5e5ee\",\n \"score\": \"0.6810449\",\n \"text\": \"function noDragStart() {\\r\\n\\t\\t return false;\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfa75ae0bea064e29b897bc4204e3f7e\",\n \"score\": \"0.6801366\",\n \"text\": \"function tmove(e) {\\n\\t\\t\\t\\t\\tif(isDrag==true)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t//prevent default event\\n\\t\\t\\t\\t\\t\\te.preventDefault();\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t//to prevent display error dialog in ie11\\n\\t\\t\\t\\t\\t\\tif(window.navigator.userAgent.indexOf(\\\"rv:11\\\")!=-1)$(obj).trigger('mouseup');\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t//trace mouse\\n\\t\\t\\t\\t\\t\\t$(this).css({\\\"top\\\":e.pageY - y + divY +\\\"px\\\",\\\"left\\\":e.pageX - x + divX + \\\"px\\\"});\\n\\t\\t\\t\\t\\t\\teX=e.pageX;\\n\\t\\t\\t\\t\\t\\teY=e.pageY;\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t//mouse up or mouse leave event\\n\\t\\t\\t\\t\\t\\t$(this).on(\\\"mouseup\\\",tup);\\n\\t\\t\\t\\t\\t\\t$(frameBody).on(\\\"mouseleave\\\",\\\".divTable\\\",tup);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd306af0c9f460085883bc95d1c471fd\",\n \"score\": \"0.67977285\",\n \"text\": \"function drag_start(d) {\\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\\n d.fx = d.x;\\n d.fy = d.y;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5081631ec814acbdd2f0624fdbe32643\",\n \"score\": \"0.67942\",\n \"text\": \"stopDragging() {\\n if (this.mode === 'dragging') {\\n this.checkMove();\\n }\\n this.mode = 'standBy';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ca31377f7abbb704af733c6abc82b78\",\n \"score\": \"0.67886347\",\n \"text\": \"function mouseDragged() {\\n //prevent default\\n\\n return false;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b3734d95ad760076cdef86a55c2d348\",\n \"score\": \"0.6785024\",\n \"text\": \"function myMove(e)\\n{\\n\\tvar curs = false;\\n\\n\\tobj.forEach(function(item, i)\\n\\t{\\n\\t\\tif (e.pageX < item.x + 50 + canvas1.offsetLeft && e.pageX > item.x - 50 +\\n\\t\\t\\tcanvas1.offsetLeft && e.pageY < item.y + 50 + canvas1.offsetTop &&\\n\\t\\t\\te.pageY > item.y - 50 + canvas1.offsetTop)\\n\\t\\t\\tcurs = true;\\n\\t\\tcanvas1.style.cursor = curs ? 'pointer' : 'default';\\n\\t\\tif (item.dragok)\\n\\t\\t{\\n\\t\\t\\titem.x = e.pageX - canvas1.offsetLeft;\\n\\t\\t\\titem.y = e.pageY - canvas1.offsetTop;\\n\\t\\t}\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"607ffc277f93511c4254de9df1078e44\",\n \"score\": \"0.6783549\",\n \"text\": \"drag(ev) {\\n // console.log('drag')\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"962cb2bb67cba1710bb5d06473f02a40\",\n \"score\": \"0.67820966\",\n \"text\": \"drag(bool) {\\n this.enableDrag = bool;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f31d7c1c2dcaca5f6bd254e47fab324d\",\n \"score\": \"0.6773332\",\n \"text\": \"function up_dragged(e) {\\n\\t//Si il y a un clone en cours de mouvement, on le supprime, on remet tout à zéro et on \\n\\t// appelle la fonction qui gère le drag si elle existe et qu'il y a un récepteur en dessous \\n\\tif (current_drag!=null) {\\n\\t\\t//Y-a-t-il un récepteur en dessous du lâché ?\\n\\t\\ttarget=is_on();\\n\\t\\t//Appel de la fonction callback_after si elle existe\\n\\t\\tif (dragged.getAttribute(\\\"callback_after\\\")) {\\n\\t\\t\\teval(dragged.getAttribute(\\\"callback_after\\\")+\\\"(dragged,e,'\\\"+target+\\\"')\\\");\\n\\t\\t}\\n\\t\\t//Remise à zero\\n\\t\\tposxdown=0;\\n\\t\\tposydown=0;\\n\\t\\tis_down=false;\\n\\t\\tif (current_drag) current_drag.parentNode.removeChild(current_drag);\\n\\t\\tcurrent_drag=null;\\n\\t\\t//Si il y a un récepteur : callback de la fonction d'association si elle existe \\n\\t\\tif (target) {\\n\\t\\t\\tif (eval(\\\"typeof \\\"+dragged.getAttribute(\\\"dragtype\\\")+\\\"_\\\"+document.getElementById(target).getAttribute(\\\"recepttype\\\")+\\\"=='function'\\\")) {\\n\\t\\t\\t\\teval(dragged.getAttribute(\\\"dragtype\\\")+\\\"_\\\"+document.getElementById(target).getAttribute(\\\"recepttype\\\")+\\\"(dragged,document.getElementById(target))\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//On nettoie la référence à l'élément d'origine\\n\\t\\tdragged=null;\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ddbc94ee9d6c61e3d8b9a600cf42963\",\n \"score\": \"0.6768285\",\n \"text\": \"function Draggable(_latLng){\\n this.latLng = _latLng;\\n this.shape;\\n this.size;\\n this.moving = false;\\n\\n\\t\\n this.end_move = function(){\\n if(this.moving){\\n this.finalize_move();\\n }\\n this.moving = false;\\n /* kludge ... consider another to figure this out */\\n if(global.moving_component != null && global.moving_component != this){\\n global.moving_component.end_move();\\n }\\n global.moving_component = null;\\n return true;\\n }\\n\\n this.start_move = function(){\\n global.moving_component = this;\\n this.moving = true;\\n }\\n\\n this.move_click = function(){\\n if(!this.moving && global.moving_component == null){\\n this.start_move()\\n }\\n else{\\n this.end_move();\\n }\\n }\\n\\n this.remove = function(){\\n return;\\n }\\n\\n this.mouse_move = function(event){ \\n if(this.moving){\\n this.move(event);\\n }\\t\\t \\n }\\n\\n this.move = function(event) {\\n return;\\n }\\n\\n this.finalize_move = function(){\\n return;\\n }\\n\\t\\n this.get_pos = function(){\\n return this.latLng;\\n }\\n\\t\\n this.draw = function(){\\n if(typeof this.shape.setMap == 'function'){\\n this.shape.setMap(objects.map);\\n }\\t\\t\\n }\\n\\n this.undraw = function(){\\n if(typeof this.shape.setMap == 'function'){\\n this.shape.setMap(null);\\n if(global.selected_node == this){\\n this.deselect();\\n } \\n }\\n }\\n\\t\\n this.show = function(){\\n if(typeof this.shape.getVisible == 'function'){\\n this.shape.setVisible(true);\\n }\\n }\\n\\n this.hide = function(){\\n if(typeof this.shape.getVisible == 'function'){\\n this.shape.setVisible(false);\\n }\\n }\\t\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31a5a33d92e54919657a073618ca9bd9\",\n \"score\": \"0.67635304\",\n \"text\": \"isMoving() {\\n return (\\n this.isDragging ||\\n this.isScrolling ||\\n Math.abs(this.velocity.x) >= 0.01 ||\\n Math.abs(this.velocity.y) >= 0.01\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8616b692dfa7050ad3c98d55faab49a6\",\n \"score\": \"0.6758402\",\n \"text\": \"function dragstart(d, i) {\\n force.stop(); // stops the force auto positioning before you start dragging\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d6d0282cfc88bae3d357d5d4684c922\",\n \"score\": \"0.6748975\",\n \"text\": \"function editOnDragOver(editor,e){editor._internalDrag=false;editor.setMode('drag');e.preventDefault();}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be14fa3e5402955a827737fe1a3fa264\",\n \"score\": \"0.6748805\",\n \"text\": \"get isDragging() {\\n return this._isDown;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a315fe428a56f2469a8d99d7f40e965\",\n \"score\": \"0.6745044\",\n \"text\": \"function drag(e) {\\r\\n draggedItem = e.target;\\r\\n dragging = true;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a315fe428a56f2469a8d99d7f40e965\",\n \"score\": \"0.6745044\",\n \"text\": \"function drag(e) {\\r\\n draggedItem = e.target;\\r\\n dragging = true;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a315fe428a56f2469a8d99d7f40e965\",\n \"score\": \"0.6745044\",\n \"text\": \"function drag(e) {\\r\\n draggedItem = e.target;\\r\\n dragging = true;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cada5ca012a0c25a34fac0c476355633\",\n \"score\": \"0.6743866\",\n \"text\": \"function handleDrag(event){\\n if(checkIfPieceAndTurnIsYours(event)) {\\n event.target.x = (event.stageX / (container.width/720)) - 30;\\n event.target.y = (event.stageY / (container.height/720)) - 50;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0391d4451f63f3b420d128a4aa16ede7\",\n \"score\": \"0.6742888\",\n \"text\": \"function drag_start(d) {\\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\\n d.fx = d.x;\\n d.fy = d.y;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8df7301af03886f4350fdc3b0449483\",\n \"score\": \"0.67362976\",\n \"text\": \"isMoveable()\\n {\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b01fa9240eef813ef608f8d597297f0c\",\n \"score\": \"0.6723526\",\n \"text\": \"function drag_start(d) {\\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\\n d.fx = d.x;\\n d.fy = d.y;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57e1ad6c2172fd689ddb0f342a70e592\",\n \"score\": \"0.67221355\",\n \"text\": \"function drag(e) {\\n draggedItem = e.target;\\n dragging = true;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77612238e1c833082b6269a861559ac9\",\n \"score\": \"0.6721932\",\n \"text\": \"toggle_drag(e) {\\n let self = e.data.self;\\n e.stopPropagation();\\n e.preventDefault();\\n self.dragging = e.type === \\\"mousedown\\\";\\n if (self.dragging) {\\n self.dragged = true; // just ensuring the user did this at least once\\n self.origin.x = e.pageX;\\n self.origin.y = e.pageY;\\n self.reference.element.width.computed = Math.floor($(self.DOM.reference.box).outerWidth);\\n self.reference.element.height.computed = Math.floor($(self.DOM.reference.box).outerHeight);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7174125c7c92465fbcd473674cfe2499\",\n \"score\": \"0.6720337\",\n \"text\": \"drag(e) {\\n surface.map.updateMapLocation();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3f215601a50fed35f98d1cb86e9c415\",\n \"score\": \"0.6709823\",\n \"text\": \"function dragstarted(event, d) {\\n if (!event.active) simulation.alphaTarget(0.3).restart()\\n d.fx = d.x;\\n d.fy = d.y;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c51df6cce976b81d5c6c87be9a3da9e\",\n \"score\": \"0.6708653\",\n \"text\": \"function draggedStart(d) {\\n\\tsimulation.alphaTarget(1.0).restart()\\n\\td.fixed = true\\n\\td.fx = d.x\\n\\td.fy = d.y\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c1b0db8a193fb419537c8c198b1ebfe\",\n \"score\": \"0.6707425\",\n \"text\": \"function dragnode(e) {\\n closeAllPopovers();\\n\\n var returnResult = true;\\n if (e.pos[1] < 0) {\\n e.e.preventDefault();\\n e.el.style.top = '10px';\\n returnResult = false;\\n }\\n if (e.pos[0] < 0) {\\n e.e.preventDefault();\\n e.el.style.left = '10px';\\n returnResult = false;\\n }\\n MyAppDAGService.nodes[e.el.id].style = {top: e.el.style.top, left: e.el.style.left};\\n return returnResult;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2194620474563d992191b3cb70f92d5f\",\n \"score\": \"0.670304\",\n \"text\": \"function gestureMove(ev){if(!pointer||!typesMatch(ev,pointer))return;updatePointerState(ev,pointer);runHandlers('move',ev);}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0977292b7cc850d2c0550fbf25ee0282\",\n \"score\": \"0.6699792\",\n \"text\": \"function onMouseUp(event){\\n\\t\\tdragging = false;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ed45c9a9c6bb4f5a0adb7cde538338a\",\n \"score\": \"0.6694608\",\n \"text\": \"function drag_start(d) {\\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\\n d.fx = d.x;\\n d.fy = d.y;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67519f0ed98f501e1eacd617bfd0c56c\",\n \"score\": \"0.6691689\",\n \"text\": \"function drag()\\n{\\n console.log(\\\"Dragging\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4837e32db738955a16a215e6cb5663db\",\n \"score\": \"0.66914195\",\n \"text\": \"function dragstarted(d) {\\n\\t d3.event.sourceEvent.stopPropagation();\\n\\t // d.fx = d.x;\\n\\t // d.fy = d.y;\\n\\t netLayout.velocityDecay(0);\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a74565333458e9c40c55a4c42496b70\",\n \"score\": \"0.66902417\",\n \"text\": \"function stopDrag() {\\n // snap to grid\\n var left = parseInt(evt.clientX - that.offsetLeft);\\n console.log('@@@@@@@@@@@@@ ', left)\\n console.log('########### ', nearest(left, 5))\\n that.style.left = nearest(left, 5) + 'px';\\n console.log('%%%%%%%@@@@ ', that.style.left)\\n\\n document.removeEventListener('mousemove', moveAlong);\\n document.removeEventListener('mouseup', stopDrag);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"762b4074298627ff739d7421944125cb\",\n \"score\": \"0.66814405\",\n \"text\": \"mousedragMove(mouseDraggedEvent, button)\\r\\n {\\r\\n // We click the mouseWheel button. event.buttons == 2 is right-click.\\r\\n if(mouseDraggedEvent.buttons == button)\\r\\n {\\r\\n let speed = Math.ceil(this.clicksPerPixel * 0.5);\\r\\n this.mapPosition.x -= mouseDraggedEvent.movementX * speed;\\r\\n this.mapPosition.y -= mouseDraggedEvent.movementY * speed;\\r\\n this.anchor = undefined;\\r\\n return false;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40d4af3f4249842180e3c55ca141c983\",\n \"score\": \"0.6662312\",\n \"text\": \"function out_box_dragmove() {\\t \\n var x = out_box_x + d3.event.dx;\\n var y = out_box_y + d3.event.dy;\\n \\n \\tout_box_x = Math.max(Math.min(x, width-out_box_w), 0);\\n \\tout_box_y = Math.max(Math.min(y, height-out_box_h), 0);\\n\\n\\t\\td3.select(this)\\n\\t\\t .attr(\\\"transform\\\", \\\"translate(\\\" + out_box_x + \\\",\\\" + out_box_y + \\\")\\\");\\t \\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e95531e70ba6b2d23c1bcd8ec290a97\",\n \"score\": \"0.66584283\",\n \"text\": \"get wantsMouseMove() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efb660b9d1a6739ffd17a5c260a105f1\",\n \"score\": \"0.6657973\",\n \"text\": \"isDragging() {\\n return exports.Konva['DD'].isDragging;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73800a69234a670baa39d31493933722\",\n \"score\": \"0.6651596\",\n \"text\": \"onMove(event) {\\n if (this.active) { //<!>\\n curPosX = (event.clientX - clickPosX);\\n curPosY = (event.clientY - clickPosY);\\n reDraw();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75c1b16b94a9da3d03820b1a581b20c0\",\n \"score\": \"0.66395587\",\n \"text\": \"function drag(e) {\\n if (active) {\\n //prevent default dragging behavior (like dragging screen)\\n e.preventDefault();\\n\\n //If the device is mobile:\\n if (e.type === \\\"touchmove\\\") {\\n currentX = e.touches[0].clientX - initialX;\\n } else {\\n currentX = e.clientX - initialX;\\n }\\n\\n //XOffset is delta in pixels from start drag event\\n xOffset = currentX;\\n\\n //If Direction is 'right'\\n if (xOffset < 0) {\\n direction = -1;\\n }\\n else { //if direction is left\\n direction = 1;\\n }\\n\\n //If mouse/finger drags less than threshold don't direction //TBD - consider removing\\n if (Math.abs(xOffset) < 30) {\\n direction = 0;\\n }\\n\\n if (direction == 1 && swiped == false) {\\n //Draw right blue bar on master and send message to slave\\n sendNav(0);\\n swiped = true;\\n } else if (direction == -1 && swiped == false) {\\n //Draw left blue bar on master and send to slave\\n sendNav(1);\\n swiped = true;\\n }\\n\\n /*if (swiped == false) {\\n message.innerHTML = 'Started swiping';\\n }*/\\n\\n click = false;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc2781914a4f97ff4ce805782c7aa777\",\n \"score\": \"0.6637801\",\n \"text\": \"function dragstarted(d) {\\n if(d.no_drag) return;\\n hovertool.body.style(\\\"visibility\\\", \\\"hidden\\\");\\n if (!d3.event.active) simulation.alphaTarget(1).restart();\\n d.fx = d.x;\\n d.fy = d.y;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f1c1c67ca215f5474d900634a4e4498\",\n \"score\": \"0.66377395\",\n \"text\": \"function editOnDragStart() {\\n\\t this._internalDrag = !0, this.setMode(\\\"drag\\\");\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96be75f2970b0cdbd1ef21eb10fed0dc\",\n \"score\": \"0.663436\",\n \"text\": \"function touchMoved() {\\n // do some stuff\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd2bbe96f98af88e32c3afa00d43208\",\n \"score\": \"0.66307825\",\n \"text\": \"function dragmove() {\\n const x = d3.event.x;\\n const y = d3.event.y;\\n d3.select(this).attr('cx', x).attr('cy', y);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c58c59f8b0f1fb6ef5c2cc1150162f3\",\n \"score\": \"0.66276217\",\n \"text\": \"function drag(elem) {\\n // store the object of the element that needs to be moved\\n selected = elem;\\n elemX = posX - selected.offsetLeft;\\n elemY = posY - selected.offsetTop;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70a8bdc91a9ed8bf311219194a6df204\",\n \"score\": \"0.662489\",\n \"text\": \"function dragEnter(event) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"764b34d87451e73c54372cb0f4f1cd55\",\n \"score\": \"0.6620207\",\n \"text\": \"onMove() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5d1c23ee0a457aea8d8673b787b6a6a\",\n \"score\": \"0.6611638\",\n \"text\": \"function dragstarted(d) {\\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\\n d.fx = d.x;\\n d.fy = d.y;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61fc71d130c179f9e9a833bd76f80cc4\",\n \"score\": \"0.6610926\",\n \"text\": \"function dragstarted(d) {\\n if (!d3.event.active) simulation.alphaTarget(0.3).restart()\\n d.fx = d.x;\\n d.fy = d.y;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f49aa1fcbf5f94eedd8f15e1e1fc0f9b\",\n \"score\": \"0.66082627\",\n \"text\": \"function dragstarted(d) {\\n\\tif (!d3.event.active) simulation.alphaTarget(0.3).restart();\\n\\td.fx = d.x;\\n\\td.fy = d.y;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1986dbc17369afbe9d186751c6cbebfd\",\n \"score\": \"0.660524\",\n \"text\": \"function drag(evt) {\\n var coord = getMousePosition(evt, container);\\n debugText.textContent = coord.x + 'x' + coord.y;\\n //evt.preventDefault();\\n if (!offset) {\\n offset = {\\n s: 0\\n };\\n }\\n var dt = parseInt(coord.x) - offset.s;\\n handleDrag(coord, dt);\\n offset.s = coord.x;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c80b290ce905f71bdcc12edf746f45da\",\n \"score\": \"0.6594078\",\n \"text\": \"function editOnDragStart(editor){editor._internalDrag=true;editor.setMode('drag');}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b9f3902ff6234a8b6686bc4657c73b3\",\n \"score\": \"0.65902215\",\n \"text\": \"function mouseReleased() {\\r\\n moveLeft = false;\\r\\n moveRight = false;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7a76188d1736958e7e2883c740d8976\",\n \"score\": \"0.6588464\",\n \"text\": \"function drag_start(){\\n drag.draggable({\\n containment:'parent',\\n scroll:false,\\n drag:function(){ dragging() },\\n stop:function(){}\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"386db636bc34df565aa5946a1c6cff8a\",\n \"score\": \"0.65810496\",\n \"text\": \"function prepareDrag() {\\n var that = this;\\n\\n stage.onContent('mousemove touchmove', function(evt) {\\n var node = engine.drag.node;\\n if (node) {\\n var date = new Date();\\n var time = date.getTime();\\n\\n if (time - engine.drag.lastDrawTime > engine.dragTimeInterval) {\\n engine.drag.lastDrawTime = time;\\n\\n var pos = that.getUserPosition();\\n var dc = node.dragConstraint;\\n var db = node.dragBounds;\\n var lastNodePos = {\\n x: node.x,\\n y: node.y\\n };\\n\\n // default\\n var newNodePos = {\\n x: pos.x - engine.drag.offset.x,\\n y: pos.y - engine.drag.offset.y\\n };\\n\\n // bounds overrides\\n if (db.left !== undefined && newNodePos.x < db.left) {\\n newNodePos.x = db.left;\\n }\\n if (db.right !== undefined && newNodePos.x > db.right) {\\n newNodePos.x = db.right;\\n }\\n if (db.top !== undefined && newNodePos.y < db.top) {\\n newNodePos.y = db.top;\\n }\\n if (db.bottom !== undefined && newNodePos.y > db.bottom) {\\n newNodePos.y = db.bottom;\\n }\\n\\n node.setAbsolutePosition(newNodePos);\\n\\n // constraint overrides\\n if (dc === 'horizontal') {\\n node.y = lastNodePos.y;\\n } else if (dc === 'vertical') {\\n node.x = lastNodePos.x;\\n }\\n\\n engine.drag.node.getLayer().draw();\\n\\n if (!engine.drag.moving) {\\n engine.drag.moving = true;\\n // execute dragstart events if defined\\n engine.drag.node.handleEvents('ondragstart', evt);\\n }\\n\\n // execute user defined ondragmove if defined\\n engine.drag.node.handleEvents('ondragmove', evt);\\n }\\n }\\n }, false);\\n\\n stage.onContent('mouseup touchend mouseout', function(evt) {\\n that.endDrag(evt);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f662a7d29e8515cfe60c40c289c757a7\",\n \"score\": \"0.65806484\",\n \"text\": \"function dragstarted(d) {\\n if (!d3.event.active) forceSimulation.alphaTarget(0).restart();\\n d.fx = d.x;\\n d.fy = d.y;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4589d12cc95ac15255662af067c1bc1\",\n \"score\": \"0.65802085\",\n \"text\": \"function dragstarted(d) {\\n\\t// if (!d3.event.active) simulation.alphaTarget(0.03).restart();\\n\\td.fx = d.x;\\n\\td.fy = d.y;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c79e7359c21f07c1a926bb9c622936f4\",\n \"score\": \"0.657575\",\n \"text\": \"function dragstarted(d) {\\n d3.select(this).raise().classed(\\\"active\\\", true); \\n d3.select(this).attr(\\\"y\\\", d3.mouse(this)[1]); \\n g.selectAll('#limit').remove()\\n //g.selectAll('.divergence').remove()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1af72d758d5feeeaf8575e0d0149a56c\",\n \"score\": \"0.65721506\",\n \"text\": \"function dragstart(event) { event.preventDefault(); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d92b52dec139d62e73aa2ab5dbcd365\",\n \"score\": \"0.6570922\",\n \"text\": \"isMoving() {\\n return (\\n this.isDragging ||\\n this.isScrolling ||\\n Math.abs(this.velocity.x) >= 0.01 ||\\n Math.abs(this.velocity.y) >= 0.01\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dc523b03a6e1b54f576d2e1f90a11cf\",\n \"score\": \"0.6569205\",\n \"text\": \"function dragstarted(d) {\\r\\n if (!d3.event.active) simulation.alphaTarget(0.3).restart();\\r\\n d.fx = d.x;\\r\\n d.fy = d.y;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6504e42e8e7e511a2c15f33e760843a2\",\n \"score\": \"0.6563437\",\n \"text\": \"function dragCheck(){\\n\\tif(clickInfo.length > 0)\\n\\t\\tif((getMousePos() - clickInfo[5]).sqrMagnitude > 60) dragMode = true;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e16df1637c03111fb4011546f962d5d\",\n \"score\": \"0.6563232\",\n \"text\": \"doDragMove(element, x, y, event) {\\n let dx = x - this._drag.last.x;\\n let dy = y - this._drag.last.y;\\n // get initial supports and move elements on glass without changing support.\\n for (let selectedElement of this._dragSet) {\\n Canvas.instance.moveElementOnGlass(selectedElement, null, x, y);\\n }\\n // get targets (using final positions of dragged elements)\\n let targets = this.getTargets(this._dragSet);\\n // Possible change of support...\\n for (let selectedElement of this._dragSet) {\\n let target = targets.get(selectedElement);\\n // No target at all : element is outside viewport\\n if (!target) {\\n Canvas.instance.moveElementOnGlass(selectedElement, null,\\n selectedElement._drag.last.x+selectedElement._drag.drag.x,\\n selectedElement._drag.last.y+selectedElement._drag.drag.y);\\n } else {\\n /* support changed */\\n if (target.effective!==selectedElement.support) {\\n Canvas.instance.moveElementOnGlass(selectedElement, target.effective, x, y);\\n }\\n selectedElement._drag.last.x = selectedElement.gx;\\n selectedElement._drag.last.y = selectedElement.gy;\\n }\\n }\\n for (let selectedElement of this._dragSet) {\\n let target = targets.get(selectedElement);\\n if (target) {\\n selectedElement._hoverOn(target.effective, this._dragSet, target.initial);\\n }\\n selectedElement._fire(Events.DRAG_MOVE);\\n }\\n this._drag.last.x = x;\\n this._drag.last.y = y;\\n this._doHover(dx, dy);\\n Canvas.instance._fire(DragMoveSelectionOperation.DRAG_MOVE_MOVE, this._dragSet);\\n for (let selectedElement of this._dragSet) {\\n selectedElement.registerValidLocation();\\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":63,"cells":{"query_id":{"kind":"string","value":"619db4928fc7d4424dd32f9e199e7dbd"},"query":{"kind":"string","value":"Definition of the Portfolio class for the GFPortfolio gadget. Each instance of the class is used to store information about one stock."},"positive_passages":{"kind":"list like","value":[{"docid":"7614fb4a896d7ff9bff0ab1a08288fd4","score":"0.84471726","text":"function Portfolio()\n{\n\t// Create an empty array of stocks\n\tthis.stocks = new Array();\n\tthis.addPriceData = addPriceData;\n\tthis.displayPriceData = displayPriceData;\n\tthis.displaySymbols = displaySymbols;\n\tthis.makeDateEntry = makeDateEntry;\n}","title":""}],"string":"[\n {\n \"docid\": \"7614fb4a896d7ff9bff0ab1a08288fd4\",\n \"score\": \"0.84471726\",\n \"text\": \"function Portfolio()\\n{\\n\\t// Create an empty array of stocks\\n\\tthis.stocks = new Array();\\n\\tthis.addPriceData = addPriceData;\\n\\tthis.displayPriceData = displayPriceData;\\n\\tthis.displaySymbols = displaySymbols;\\n\\tthis.makeDateEntry = makeDateEntry;\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"eb1ee5d98dace17b357601e37e74999b","score":"0.6714322","text":"function Stock(symbol){\n // this.name = name;\n this.symbol = symbol;\n this.numShares = 0;\n this.data = this.lookupStock();\n this.name = name;\n this.price = price;\n\n}","title":""},{"docid":"6498e2efaad7a4cf413f7876e1e3c6fa","score":"0.6539987","text":"function Stock(symbol, price, shares) {\n this.symbol = symbol;\n this.price = price;\n this.shares = shares;\n}","title":""},{"docid":"80ce368aa7662f9439945512b2d30278","score":"0.62731886","text":"function Portfolio(defaultValues) {\n var privateState = {};\n context[\"field\"] = \"portfolioId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"portfolioId\"] : null);\n privateState.portfolioId = defaultValues ?\n (defaultValues[\"portfolioId\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"portfolioId\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"description\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"description\"] : null);\n privateState.description = defaultValues ?\n (defaultValues[\"description\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"description\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"holdingsType\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"holdingsType\"] : null);\n privateState.holdingsType = defaultValues ?\n (defaultValues[\"holdingsType\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"holdingsType\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"quantity\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"quantity\"] : null);\n privateState.quantity = defaultValues ?\n (defaultValues[\"quantity\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"quantity\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"marketPrice\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"marketPrice\"] : null);\n privateState.marketPrice = defaultValues ?\n (defaultValues[\"marketPrice\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"marketPrice\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"costPrice\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"costPrice\"] : null);\n privateState.costPrice = defaultValues ?\n (defaultValues[\"costPrice\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"costPrice\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"marketValue\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"marketValue\"] : null);\n privateState.marketValue = defaultValues ?\n (defaultValues[\"marketValue\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"marketValue\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"unrealPLMkt\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"unrealPLMkt\"] : null);\n privateState.unrealPLMkt = defaultValues ?\n (defaultValues[\"unrealPLMkt\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"unrealPLMkt\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"secCCy\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"secCCy\"] : null);\n privateState.secCCy = defaultValues ?\n (defaultValues[\"secCCy\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"secCCy\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"navPage\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"navPage\"] : null);\n privateState.navPage = defaultValues ?\n (defaultValues[\"navPage\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"navPage\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"ISIN\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"ISIN\"] : null);\n privateState.ISIN = defaultValues ?\n (defaultValues[\"ISIN\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"ISIN\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"sortBy\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"sortBy\"] : null);\n privateState.sortBy = defaultValues ?\n (defaultValues[\"sortBy\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"sortBy\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"searchByInstrumentName\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"searchByInstrumentName\"] : null);\n privateState.searchByInstrumentName = defaultValues ?\n (defaultValues[\"searchByInstrumentName\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"searchByInstrumentName\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"holdingsId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"holdingsId\"] : null);\n privateState.holdingsId = defaultValues ?\n (defaultValues[\"holdingsId\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"holdingsId\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"transactionId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"transactionId\"] : null);\n privateState.transactionId = defaultValues ?\n (defaultValues[\"transactionId\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"transactionId\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"orderType\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"orderType\"] : null);\n privateState.orderType = defaultValues ?\n (defaultValues[\"orderType\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"orderType\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"exchangeRate\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"exchangeRate\"] : null);\n privateState.exchangeRate = defaultValues ?\n (defaultValues[\"exchangeRate\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"exchangeRate\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"limitPrice\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"limitPrice\"] : null);\n privateState.limitPrice = defaultValues ?\n (defaultValues[\"limitPrice\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"limitPrice\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"netAmount\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"netAmount\"] : null);\n privateState.netAmount = defaultValues ?\n (defaultValues[\"netAmount\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"netAmount\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"tradeDate\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"tradeDate\"] : null);\n privateState.tradeDate = defaultValues ?\n (defaultValues[\"tradeDate\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"tradeDate\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"fees\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"fees\"] : null);\n privateState.fees = defaultValues ?\n (defaultValues[\"fees\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"fees\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"valueDate\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"valueDate\"] : null);\n privateState.valueDate = defaultValues ?\n (defaultValues[\"valueDate\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"valueDate\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"referenceCurrency\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"referenceCurrency\"] : null);\n privateState.referenceCurrency = defaultValues ?\n (defaultValues[\"referenceCurrency\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"referenceCurrency\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"startDate\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"startDate\"] : null);\n privateState.startDate = defaultValues ?\n (defaultValues[\"startDate\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"startDate\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"endDate\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"endDate\"] : null);\n privateState.endDate = defaultValues ?\n (defaultValues[\"endDate\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"endDate\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"instrumentId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"instrumentId\"] : null);\n privateState.instrumentId = defaultValues ?\n (defaultValues[\"instrumentId\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"instrumentId\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"RICCode\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"RICCode\"] : null);\n privateState.RICCode = defaultValues ?\n (defaultValues[\"RICCode\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"RICCode\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"customerId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"customerId\"] : null);\n privateState.customerId = defaultValues ?\n (defaultValues[\"customerId\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"customerId\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"instrumentCurrency\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"instrumentCurrency\"] : null);\n privateState.instrumentCurrency = defaultValues ?\n (defaultValues[\"instrumentCurrency\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"instrumentCurrency\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"instrumentAmount\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"instrumentAmount\"] : null);\n privateState.instrumentAmount = defaultValues ?\n (defaultValues[\"instrumentAmount\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"instrumentAmount\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"total\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"total\"] : null);\n privateState.total = defaultValues ?\n (defaultValues[\"total\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"total\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"sortType\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"sortType\"] : null);\n privateState.sortType = defaultValues ?\n (defaultValues[\"sortType\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"sortType\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"userId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"userId\"] : null);\n privateState.userId = defaultValues ?\n (defaultValues[\"userId\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"userId\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"fieldOrder\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"fieldOrder\"] : null);\n privateState.fieldOrder = defaultValues ?\n (defaultValues[\"fieldOrder\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"fieldOrder\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"limit\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"limit\"] : null);\n privateState.limit = defaultValues ?\n (defaultValues[\"limit\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"limit\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"offset\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"offset\"] : null);\n privateState.offset = defaultValues ?\n (defaultValues[\"offset\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"offset\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"sortOrder\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"sortOrder\"] : null);\n privateState.sortOrder = defaultValues ?\n (defaultValues[\"sortOrder\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"sortOrder\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"pageSize\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"pageSize\"] : null);\n privateState.pageSize = defaultValues ?\n (defaultValues[\"pageSize\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"pageSize\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"pageOffset\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"pageOffset\"] : null);\n privateState.pageOffset = defaultValues ?\n (defaultValues[\"pageOffset\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"pageOffset\"], context) :\n null) :\n null;\n\n context[\"field\"] = \"accountIds\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"accountIds\"] : null);\n privateState.accountIds = defaultValues ?\n (defaultValues[\"accountIds\"] ?\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\"accountIds\"], context) :\n null) :\n null;\n\n\n //Using parent constructor to create other properties req. to kony sdk\n BaseModel.call(this);\n\n //Defining Getter/Setters\n Object.defineProperties(this, {\n \"portfolioId\": {\n get: function() {\n context[\"field\"] = \"portfolioId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"portfolioId\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.portfolioId, context);\n },\n set: function(val) {\n setterFunctions['portfolioId'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"description\": {\n get: function() {\n context[\"field\"] = \"description\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"description\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.description, context);\n },\n set: function(val) {\n setterFunctions['description'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"holdingsType\": {\n get: function() {\n context[\"field\"] = \"holdingsType\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"holdingsType\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.holdingsType, context);\n },\n set: function(val) {\n setterFunctions['holdingsType'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"quantity\": {\n get: function() {\n context[\"field\"] = \"quantity\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"quantity\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.quantity, context);\n },\n set: function(val) {\n setterFunctions['quantity'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"marketPrice\": {\n get: function() {\n context[\"field\"] = \"marketPrice\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"marketPrice\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.marketPrice, context);\n },\n set: function(val) {\n setterFunctions['marketPrice'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"costPrice\": {\n get: function() {\n context[\"field\"] = \"costPrice\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"costPrice\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.costPrice, context);\n },\n set: function(val) {\n setterFunctions['costPrice'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"marketValue\": {\n get: function() {\n context[\"field\"] = \"marketValue\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"marketValue\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.marketValue, context);\n },\n set: function(val) {\n setterFunctions['marketValue'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"unrealPLMkt\": {\n get: function() {\n context[\"field\"] = \"unrealPLMkt\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"unrealPLMkt\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.unrealPLMkt, context);\n },\n set: function(val) {\n setterFunctions['unrealPLMkt'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"secCCy\": {\n get: function() {\n context[\"field\"] = \"secCCy\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"secCCy\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.secCCy, context);\n },\n set: function(val) {\n setterFunctions['secCCy'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"navPage\": {\n get: function() {\n context[\"field\"] = \"navPage\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"navPage\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.navPage, context);\n },\n set: function(val) {\n setterFunctions['navPage'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"ISIN\": {\n get: function() {\n context[\"field\"] = \"ISIN\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"ISIN\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.ISIN, context);\n },\n set: function(val) {\n setterFunctions['ISIN'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"sortBy\": {\n get: function() {\n context[\"field\"] = \"sortBy\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"sortBy\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.sortBy, context);\n },\n set: function(val) {\n setterFunctions['sortBy'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"searchByInstrumentName\": {\n get: function() {\n context[\"field\"] = \"searchByInstrumentName\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"searchByInstrumentName\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.searchByInstrumentName, context);\n },\n set: function(val) {\n setterFunctions['searchByInstrumentName'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"holdingsId\": {\n get: function() {\n context[\"field\"] = \"holdingsId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"holdingsId\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.holdingsId, context);\n },\n set: function(val) {\n setterFunctions['holdingsId'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"transactionId\": {\n get: function() {\n context[\"field\"] = \"transactionId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"transactionId\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.transactionId, context);\n },\n set: function(val) {\n setterFunctions['transactionId'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"orderType\": {\n get: function() {\n context[\"field\"] = \"orderType\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"orderType\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.orderType, context);\n },\n set: function(val) {\n setterFunctions['orderType'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"exchangeRate\": {\n get: function() {\n context[\"field\"] = \"exchangeRate\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"exchangeRate\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.exchangeRate, context);\n },\n set: function(val) {\n setterFunctions['exchangeRate'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"limitPrice\": {\n get: function() {\n context[\"field\"] = \"limitPrice\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"limitPrice\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.limitPrice, context);\n },\n set: function(val) {\n setterFunctions['limitPrice'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"netAmount\": {\n get: function() {\n context[\"field\"] = \"netAmount\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"netAmount\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.netAmount, context);\n },\n set: function(val) {\n setterFunctions['netAmount'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"tradeDate\": {\n get: function() {\n context[\"field\"] = \"tradeDate\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"tradeDate\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.tradeDate, context);\n },\n set: function(val) {\n setterFunctions['tradeDate'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"fees\": {\n get: function() {\n context[\"field\"] = \"fees\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"fees\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.fees, context);\n },\n set: function(val) {\n setterFunctions['fees'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"valueDate\": {\n get: function() {\n context[\"field\"] = \"valueDate\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"valueDate\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.valueDate, context);\n },\n set: function(val) {\n setterFunctions['valueDate'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"referenceCurrency\": {\n get: function() {\n context[\"field\"] = \"referenceCurrency\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"referenceCurrency\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.referenceCurrency, context);\n },\n set: function(val) {\n setterFunctions['referenceCurrency'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"startDate\": {\n get: function() {\n context[\"field\"] = \"startDate\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"startDate\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.startDate, context);\n },\n set: function(val) {\n setterFunctions['startDate'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"endDate\": {\n get: function() {\n context[\"field\"] = \"endDate\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"endDate\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.endDate, context);\n },\n set: function(val) {\n setterFunctions['endDate'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"instrumentId\": {\n get: function() {\n context[\"field\"] = \"instrumentId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"instrumentId\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.instrumentId, context);\n },\n set: function(val) {\n setterFunctions['instrumentId'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"RICCode\": {\n get: function() {\n context[\"field\"] = \"RICCode\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"RICCode\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.RICCode, context);\n },\n set: function(val) {\n setterFunctions['RICCode'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"customerId\": {\n get: function() {\n context[\"field\"] = \"customerId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"customerId\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.customerId, context);\n },\n set: function(val) {\n setterFunctions['customerId'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"instrumentCurrency\": {\n get: function() {\n context[\"field\"] = \"instrumentCurrency\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"instrumentCurrency\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.instrumentCurrency, context);\n },\n set: function(val) {\n setterFunctions['instrumentCurrency'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"instrumentAmount\": {\n get: function() {\n context[\"field\"] = \"instrumentAmount\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"instrumentAmount\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.instrumentAmount, context);\n },\n set: function(val) {\n setterFunctions['instrumentAmount'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"total\": {\n get: function() {\n context[\"field\"] = \"total\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"total\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.total, context);\n },\n set: function(val) {\n setterFunctions['total'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"sortType\": {\n get: function() {\n context[\"field\"] = \"sortType\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"sortType\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.sortType, context);\n },\n set: function(val) {\n setterFunctions['sortType'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"userId\": {\n get: function() {\n context[\"field\"] = \"userId\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"userId\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.userId, context);\n },\n set: function(val) {\n setterFunctions['userId'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"fieldOrder\": {\n get: function() {\n context[\"field\"] = \"fieldOrder\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"fieldOrder\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.fieldOrder, context);\n },\n set: function(val) {\n setterFunctions['fieldOrder'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"limit\": {\n get: function() {\n context[\"field\"] = \"limit\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"limit\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.limit, context);\n },\n set: function(val) {\n setterFunctions['limit'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"offset\": {\n get: function() {\n context[\"field\"] = \"offset\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"offset\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.offset, context);\n },\n set: function(val) {\n setterFunctions['offset'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"sortOrder\": {\n get: function() {\n context[\"field\"] = \"sortOrder\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"sortOrder\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.sortOrder, context);\n },\n set: function(val) {\n setterFunctions['sortOrder'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"pageSize\": {\n get: function() {\n context[\"field\"] = \"pageSize\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"pageSize\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.pageSize, context);\n },\n set: function(val) {\n setterFunctions['pageSize'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"pageOffset\": {\n get: function() {\n context[\"field\"] = \"pageOffset\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"pageOffset\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.pageOffset, context);\n },\n set: function(val) {\n setterFunctions['pageOffset'].call(this, val, privateState);\n },\n enumerable: true,\n },\n \"accountIds\": {\n get: function() {\n context[\"field\"] = \"accountIds\";\n context[\"metadata\"] = (objectMetadata ? objectMetadata[\"accountIds\"] : null);\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.accountIds, context);\n },\n set: function(val) {\n setterFunctions['accountIds'].call(this, val, privateState);\n },\n enumerable: true,\n },\n });\n\n //converts model object to json object.\n this.toJsonInternal = function() {\n return Object.assign({}, privateState);\n };\n\n //overwrites object state with provided json value in argument.\n this.fromJsonInternal = function(value) {\n privateState.portfolioId = value ? (value[\"portfolioId\"] ? value[\"portfolioId\"] : null) : null;\n privateState.description = value ? (value[\"description\"] ? value[\"description\"] : null) : null;\n privateState.holdingsType = value ? (value[\"holdingsType\"] ? value[\"holdingsType\"] : null) : null;\n privateState.quantity = value ? (value[\"quantity\"] ? value[\"quantity\"] : null) : null;\n privateState.marketPrice = value ? (value[\"marketPrice\"] ? value[\"marketPrice\"] : null) : null;\n privateState.costPrice = value ? (value[\"costPrice\"] ? value[\"costPrice\"] : null) : null;\n privateState.marketValue = value ? (value[\"marketValue\"] ? value[\"marketValue\"] : null) : null;\n privateState.unrealPLMkt = value ? (value[\"unrealPLMkt\"] ? value[\"unrealPLMkt\"] : null) : null;\n privateState.secCCy = value ? (value[\"secCCy\"] ? value[\"secCCy\"] : null) : null;\n privateState.navPage = value ? (value[\"navPage\"] ? value[\"navPage\"] : null) : null;\n privateState.ISIN = value ? (value[\"ISIN\"] ? value[\"ISIN\"] : null) : null;\n privateState.sortBy = value ? (value[\"sortBy\"] ? value[\"sortBy\"] : null) : null;\n privateState.searchByInstrumentName = value ? (value[\"searchByInstrumentName\"] ? value[\"searchByInstrumentName\"] : null) : null;\n privateState.holdingsId = value ? (value[\"holdingsId\"] ? value[\"holdingsId\"] : null) : null;\n privateState.transactionId = value ? (value[\"transactionId\"] ? value[\"transactionId\"] : null) : null;\n privateState.orderType = value ? (value[\"orderType\"] ? value[\"orderType\"] : null) : null;\n privateState.exchangeRate = value ? (value[\"exchangeRate\"] ? value[\"exchangeRate\"] : null) : null;\n privateState.limitPrice = value ? (value[\"limitPrice\"] ? value[\"limitPrice\"] : null) : null;\n privateState.netAmount = value ? (value[\"netAmount\"] ? value[\"netAmount\"] : null) : null;\n privateState.tradeDate = value ? (value[\"tradeDate\"] ? value[\"tradeDate\"] : null) : null;\n privateState.fees = value ? (value[\"fees\"] ? value[\"fees\"] : null) : null;\n privateState.valueDate = value ? (value[\"valueDate\"] ? value[\"valueDate\"] : null) : null;\n privateState.referenceCurrency = value ? (value[\"referenceCurrency\"] ? value[\"referenceCurrency\"] : null) : null;\n privateState.startDate = value ? (value[\"startDate\"] ? value[\"startDate\"] : null) : null;\n privateState.endDate = value ? (value[\"endDate\"] ? value[\"endDate\"] : null) : null;\n privateState.instrumentId = value ? (value[\"instrumentId\"] ? value[\"instrumentId\"] : null) : null;\n privateState.RICCode = value ? (value[\"RICCode\"] ? value[\"RICCode\"] : null) : null;\n privateState.customerId = value ? (value[\"customerId\"] ? value[\"customerId\"] : null) : null;\n privateState.instrumentCurrency = value ? (value[\"instrumentCurrency\"] ? value[\"instrumentCurrency\"] : null) : null;\n privateState.instrumentAmount = value ? (value[\"instrumentAmount\"] ? value[\"instrumentAmount\"] : null) : null;\n privateState.total = value ? (value[\"total\"] ? value[\"total\"] : null) : null;\n privateState.sortType = value ? (value[\"sortType\"] ? value[\"sortType\"] : null) : null;\n privateState.userId = value ? (value[\"userId\"] ? value[\"userId\"] : null) : null;\n privateState.fieldOrder = value ? (value[\"fieldOrder\"] ? value[\"fieldOrder\"] : null) : null;\n privateState.limit = value ? (value[\"limit\"] ? value[\"limit\"] : null) : null;\n privateState.offset = value ? (value[\"offset\"] ? value[\"offset\"] : null) : null;\n privateState.sortOrder = value ? (value[\"sortOrder\"] ? value[\"sortOrder\"] : null) : null;\n privateState.pageSize = value ? (value[\"pageSize\"] ? value[\"pageSize\"] : null) : null;\n privateState.pageOffset = value ? (value[\"pageOffset\"] ? value[\"pageOffset\"] : null) : null;\n privateState.accountIds = value ? (value[\"accountIds\"] ? value[\"accountIds\"] : null) : null;\n };\n }","title":""},{"docid":"cea8fef18aef67ff08afaa4ba8e5a902","score":"0.624087","text":"constructor(scope, id, props) {\n super(scope, id, { type: CfnPortfolio.CFN_RESOURCE_TYPE_NAME, properties: props });\n try {\n jsiiDeprecationWarnings.aws_cdk_lib_aws_servicecatalog_CfnPortfolioProps(props);\n }\n catch (error) {\n if (process.env.JSII_DEBUG !== \"1\" && error.name === \"DeprecationError\") {\n Error.captureStackTrace(error, CfnPortfolio);\n }\n throw error;\n }\n cdk.requireProperty(props, 'displayName', this);\n cdk.requireProperty(props, 'providerName', this);\n this.attrPortfolioName = cdk.Token.asString(this.getAtt('PortfolioName', cdk.ResolutionTypeHint.STRING));\n this.displayName = props.displayName;\n this.providerName = props.providerName;\n this.acceptLanguage = props.acceptLanguage;\n this.description = props.description;\n this.tags = new cdk.TagManager(cdk.TagType.STANDARD, \"AWS::ServiceCatalog::Portfolio\", props.tags, { tagPropertyName: 'tags' });\n }","title":""},{"docid":"cd6d60c5e3b2257e9947e7f9742553a6","score":"0.6208182","text":"constructor(name, stock) {\n this.name = name;\n this.stock = stock;\n this.revenue = 0;\n }","title":""},{"docid":"2bb62089ad3777c6c926201ca1648df8","score":"0.60977584","text":"function Project (portfolioDataObj) {\n this.name = portfolioDataObj.name;\n this.link = portfolioDataObj.link;\n this.description = portfolioDataObj.description;\n this.image = 'images/' + portfolioDataObj.image;\n}","title":""},{"docid":"cb50477cd42456141feed83b440bc9f4","score":"0.59967226","text":"function Portfolio (opts) {\n Object.keys(opts).forEach(function(e, index, keys) {\n this[e] = opts[e];\n },this);\n }","title":""},{"docid":"315b1f0a90a30f70b299b3f788ec84cd","score":"0.59666336","text":"function BuildPortfolio (projectTitle, image, githublink, liveSite, description, technology) {\n this.title = projectTitle;\n this.imagePath = image;\n this.gitLink = githublink;\n this.gitSite = liveSite;\n this.description = description;\n this.technology = technology;\n}","title":""},{"docid":"14203d6cc51e4c4943580d64ea143b35","score":"0.5834694","text":"function Stockitem()\n {\n this.type = 'stockpile';\n this.name = 'Unknown';\n this.attack = 0;\n this.defense = 0;\n this.upkeep = 0;\n this.price = 0;\n }","title":""},{"docid":"70a9213e03eda7a0c2a73f82be103c3e","score":"0.5686634","text":"function StockChart(options, element) {\n var _this = _super.call(this, options, element) || this;\n /** @private */\n _this.isSingleAxis = false;\n _this.chartid = 57723;\n /** @private */\n _this.tempDataSource = [];\n /** @private */\n _this.blazorDataSource = [];\n /** @private */\n _this.tempSeriesType = [];\n /** private */\n _this.zoomChange = false;\n /** @private */\n _this.allowPan = false;\n /** @private */\n _this.onPanning = false;\n /** @private */\n _this.trendlinetriggered = true;\n /** @private */\n _this.toolbarHeight = _this.enablePeriodSelector ? (Browser.isDevice ? 56 : 42) : 0;\n /** @private */\n _this.initialRender = true;\n return _this;\n }","title":""},{"docid":"46ee24c7b5f65102c37a1f0d968e4305","score":"0.5678524","text":"function getStock() {\n return {\n symbol: 'NLSN',\n price: 100,\n country: 'KEN',\n exchange: {\n name: 'NASDAQ',\n tradingHours: '9AM',\n },\n };\n}","title":""},{"docid":"f4c581fafb776d07f1734eafc643ed42","score":"0.5659926","text":"function Cookie(name, regularPrice, holidayPrice) {\n this.name = name;\n this.prices = [regularPrice, holidayPrice];\n this.prices = this.prices.map(a => a.toFixed(2));\n}","title":""},{"docid":"cacd1858b5d9e2fc27e19a497fab3b61","score":"0.564082","text":"constructor(scope, id, props) {\n super(scope, id, { type: CfnPortfolioShare.CFN_RESOURCE_TYPE_NAME, properties: props });\n try {\n jsiiDeprecationWarnings.aws_cdk_lib_aws_servicecatalog_CfnPortfolioShareProps(props);\n }\n catch (error) {\n if (process.env.JSII_DEBUG !== \"1\" && error.name === \"DeprecationError\") {\n Error.captureStackTrace(error, CfnPortfolioShare);\n }\n throw error;\n }\n cdk.requireProperty(props, 'accountId', this);\n cdk.requireProperty(props, 'portfolioId', this);\n this.accountId = props.accountId;\n this.portfolioId = props.portfolioId;\n this.acceptLanguage = props.acceptLanguage;\n this.shareTagOptions = props.shareTagOptions;\n }","title":""},{"docid":"ae9824fe5496f7bec122c6e155df9ad7","score":"0.56323653","text":"addPortfolio() {\n if (Object.keys(this.state.jsPortfolios).length >= 10) {\n alert(\"You can only have 10 portfolios\");\n return;\n }\n var name = prompt(\"Pick a name for the portfolio.\");\n if (name === null || name.trim() === \"\") {\n alert(\"The name cannot be empty.\");\n }\n else {\n //Get current list of portfolios, push this new portfolio to it and update the state and local storage.\n let portfolios = this.state.portfolios;\n let jsPortfolios = this.state.jsPortfolios;\n if (jsPortfolios === undefined) {\n jsPortfolios = {};\n }\n let state = this.state;\n let id = getGuid();\n let stocks = {};\n portfolios.push(<Portfolio key={id}\n id={id}\n name={name}\n setGraphApp={this.setGraph.bind(this)}\n updatePortfolio={this.updatePortfolio.bind(this)}\n deletePortfolio={this.deletePortfolio.bind(this)}\n setPrompt={this.setPrompt.bind(this)}\n />);\n state.portfolios = portfolios;\n jsPortfolios[id] = {\n key: id,\n id: id,\n name: name,\n currency: \"euro\",\n stocks: stocks\n };\n this.setState(state);\n this.updateLocalStorage();\n }\n }","title":""},{"docid":"4386c1f6d314dd6613a5c512b4aff388","score":"0.56312984","text":"function createPortfolio(data) {\n\tvar portfolioDisplay = \"\";\n\t//For each project generate an individual portfolio square\n\tdata.forEach(function createSquare(project,index) {\n\t\tportfolio[index].id = index;\n\t\tvar name = project.name,\n\t\t\tsnippet = project.snippet,\n\t\t\ttags = project.tags[0],\n\t\t\tdesc = project.description,\n\t\t\tlink = project.link,\n\t\t\tid = project.id;\n\t\t\timage = project.image;\n\n\t\t//Add additional tags\n\t\tfor (var i=1; i<project.tags.length; i++) {\n\t\t\ttags+= \" | \" + project.tags[i];\n\t\t}\n\n\t\tportfolioDisplay+= \"<div class='portfolio-square' id='\" +\n\t\tid + \n\t\t\"'><div><img src='../img/\" +\n\t\timage +\n\t\t\"'></div><div class='overlay'><h4>\" +\n\t\tname +\n\t\t\"</h4><p>\" +\n\t\t snippet +\n\t\t \"</p><a class='button read-more'>read more</a><span>\" +\n\t\t tags +\n\t\t \"</span></div></div>\";\n\n\t\t //Generate the html for the modal pop up\n\t\tportfolio[id].modal = \"<h1>\" + \n\t\tname +\n\t\t\"</h1><p>\" + \n\t\tdesc + \n\t\t\"</p><a href='\" +\n\t\tlink +\n\t\t\"' target='_blank' class='button'>view project</a>\";\n\t\t});\t\n\t\t//Affix each square to the main portfolio display\n\t\t$(\"#portfolio-display\").append(portfolioDisplay);\n}","title":""},{"docid":"6de7a2abe0ad0ecb5445c6feff508429","score":"0.55567294","text":"function init() {\n portfolioView = new app.views.PortfolioView(self);\n }","title":""},{"docid":"48ca76b450909bcbed7b521ff9ebf631","score":"0.5549783","text":"function Portfolio() {\n return (\n <div className=\"portfolio\" id=\"portfolio\">\n <div className=\"container\">\n <Title titleName=\"PORTFOLIO\" descriptionName=\"Magnam dolores commodi suscipit. Necessitatibus eius consequatur ex aliquid fuga eum quidem. Sit sint consectetur velit. Quisquam quos quisquam cupiditate. Et nemo qui impedit suscipit alias ea. Quia fugiat sit in iste officiis commodi quidem hic quas.\" />\n <PortfolioController />\n <PortfolioList />\n \n </div>\n </div>\n )\n}","title":""},{"docid":"5aef4a5202ab65da6ecf3d4a92e32a99","score":"0.5499764","text":"function Product(name, price, inStock){\n\n\tthis.prodName = name;\n\tthis.price = price;\n\tthis.inStock = inStock;\n\n\tthis.setStock = function (stock){\n\tthis.inStock = stock;\n\t};\n}","title":""},{"docid":"5aef4a5202ab65da6ecf3d4a92e32a99","score":"0.5499764","text":"function Product(name, price, inStock){\n\n\tthis.prodName = name;\n\tthis.price = price;\n\tthis.inStock = inStock;\n\n\tthis.setStock = function (stock){\n\tthis.inStock = stock;\n\t};\n}","title":""},{"docid":"48148b57889431d61ff95ede0aa67496","score":"0.5498229","text":"function calcPortfolio(quotes){\n\tlet price, changep, change, market;\n\tlet sum=0;\n\tlet sumchange=0;\n\tlet invested=0;\n\tlet chper=0;\n\tfunction getmarketprice(quote){\n\t\tif(quote.marketState==\"PRE\" && quote.preMarketPrice){\n\t\t\tprice= quote.preMarketPrice;\n\t\t\tchangep=quote.preMarketChangePercent;\n\t\t\tmarket=\"pre-market\";\n\t\t\tchange=quote.preMarketChange;\n\t\t}else if(quote.marketState==\"PRE\" && !quote.preMarketPrice){\n\t\t\tprice= quote.regularMarketPrice;\n\t\t\tchangep=0;\n\t\t\tmarket=\"pre-market\";\n\t\t\tchange=0;\n\t\t}else if([\"PREPRE\",\"POST\",\"POSTPOST\",\"CLOSED\"].includes(quote.marketState) && quote.postMarketPrice){\n\t\t\tprice= quote.postMarketPrice;\n\t\t\t//changep=quote.postMarketChangePercent;\n\t\t\tchangep=100*(quote.postMarketChange+quote.regularMarketChange)/quote.regularMarketPreviousClose;\n\t\t\tmarket=\"after hours trading\";\n\t\t\tchange=quote.postMarketChange+quote.regularMarketChange;\n\t\t}\n\t\telse{\n\t\t\tprice= quote.regularMarketPrice;\n\t\t\tchangep=quote.regularMarketChangePercent;\n\t\t\tmarket=\"regular session\";\n\t\t\tchange=quote.regularMarketChange;\n\t\t}\n\t}\n\t\n\tfor(q of quotes){\n\t\t//text+=q.displayName? q.displayName: q.shortName;\n\t\tgetmarketprice(q);\n\t\tsum=sum+price*getHolding(q.symbol).n;\n\t\tsumchange=sumchange+change*getHolding(q.symbol).n;\n\t\tchper=100*sumchange/(sum-sumchange);\n\t\tinvested=invested + getHolding(q.symbol).n*getHolding(q.symbol).p;\n\t}\n\tdocument.getElementById(\"portfolio\").innerHTML=\"Portfolio: \"+sum.toFixed(2)+\" Change: \"+sumchange.toFixed(2)+ \" \"+chper.toFixed(2)+\"% P/L: \"+(sum-invested).toFixed(2);\n\t\n\tskipcount++;\n\tif(pchart && skipcount>4){\n\tpchart.data[0].push((new Date()).getTime()/1000);\n\tpchart.data[1].push(sum);\n\tdocument.getElementById(\"costline\").checked ? pchart.data[4].push(invested):null;\n\tpchart.setData(pchart.data);\n\tskipcount=0;\n\t}\n\t\n}","title":""},{"docid":"86ef7b5d208f91ce03a4924928c1adae","score":"0.5404354","text":"function Product(id, name, prices, stock) {\n this.id = id;\n this.name = name;\n this.prices = prices;\n this.stock = stock\n}","title":""},{"docid":"ca97ee3db40c7e41b2869aa07e081ec3","score":"0.5396404","text":"function LoadNewPortfolioOverview() {\n var Catalog = {\n _id: 'New',\n portfolioid: '',\n description: '',\n coverage: '',\n org: '',\n publish: 0,\n status_data: [],\n status_label: '',\n repeated_data: [],\n repeated_label: '',\n risk_data: [],\n risk_label: '',\n audits: [],\n portfoliomap: []\n };\n return Catalog;\n}","title":""},{"docid":"07891ab6d12991673746c789f4484cc0","score":"0.53877676","text":"constructor() {\n this.headers = [];\n this.stocks = [];\n }","title":""},{"docid":"a820642d36b412c7e7cead443c184788","score":"0.53755647","text":"function formatStockDataForPortfolioUpdate (JSONdata) {\n\n var stock = {\n\n symbol: JSONdata.Symbol,\n currentPrice: parseFloat(JSONdata.LastTradePriceOnly), \n previousClose: parseFloat(JSONdata.PreviousClose) \n };\n\n return stock;\n}","title":""},{"docid":"d3ffc672781892203b9fafc3a2d8046d","score":"0.5357117","text":"function Finance(){\n\t\tvar self = this;\n\t\tself.cost = 0;\n\t\tself.revenue = {min: 0, max: 0};\n\t\tself.profit = {min: 0, max: 0};\n\t\t\n\t\tself.plantings = 0; // planting count\n\t\tself.harvests = {min: 0, max: 0}; // harvest count\n\t}","title":""},{"docid":"ea0a3550a018813e1b5a6340b988201b","score":"0.5348619","text":"static load() {\n const PORTFOLIO = require(DATA_PORTFOLIO);\n let funds = [];\n let total = 0;\n\n for (let portfund of PORTFOLIO) {\n let fund = Fund.find(portfund.symbol);\n let fundTotal = parseFloat(portfund.shares * fund.price);\n\n funds.push({ fund: fund, shares: portfund.shares, total: fundTotal });\n total += fundTotal;\n }\n\n return new Portfolio(funds, total);\n }","title":""},{"docid":"4242c5e2577249ff14de445f92de2d35","score":"0.5314188","text":"function Portfolio() {\n\n\treturn (<>\n\t\t\n\t\t\t<div className=\"container__titlePortfolio\">\n\t\t\t\t<a name=\"portfolio\">\n\t\t\t\t\t<h2 className=\"title\">Portfolio</h2>\n\t\t\t\t</a>\n\t\t\t</div>\n\t\t\t<div className=\"container__portfolio\">\n\t\t\t<div className=\"container__imgPortfolio\">\n\t\t\t\t<a href=\"https://eleonoradellamico.github.io/Cinema/\" target=\"_blank\">\n\t\t\t\t\t<img className=\"portfolioImg\" src={Photo} alt=\"Cinema\" />\n\t\t\t\t</a>\n\t\t\t\t<div className=\"info__imgPortfolio\">\n\t\t\t\t\t<p className=\"text textPortfolio\">Design&layout Html Css Netflix</p>\n\t\t\t\t\t<img className=\"link__portfolio\" src={GitHub} alt=\"gitHub\" />\n\t\t\t\t\t<img className=\"link__portfolio\" src={Enlace} alt=\"gitHub\" />\n\t\t\t\t</div>\n\t\t\t</div>\n\t\t\t<div className=\"container__imgPortfolio\">\n\t\t\t\t<a href=\"https://martreyz.github.io/project-promo-k-module-3-team-4/#/\" target=\"_blank\">\n\t\t\t\t\t<img className=\"portfolioImg\" src={PhotoOne} alt=\"Cards\" />\n\t\t\t\t</a>\n\t\t\t\t<div className=\"info__imgPortfolio\">\n\t\t\t\t\t<p className=\"text textPortfolio\">React project: Visting cards</p>\n\t\t\t\t\t<img className=\"link__portfolio\" src={GitHub} alt=\"gitHub\" />\n\t\t\t\t\t<img className=\"link__portfolio\" src={Enlace} alt=\"gitHub\" />\n\t\t\t\t</div>\n\t\t\t</div>\n\t\t\t<div className=\"container__imgPortfolio\">\n\t\t\t\t<a href=\"https://eleonoradellamico.github.io/LearnJavaScrip_MemoryGame/\" target=\"_blank\">\n\t\t\t\t\t{' '}\n\t\t\t\t\t<img className=\"portfolioImg\" src={PhotoTwo} alt=\"Laptop\" />\n\t\t\t\t</a>\n\t\t\t\t<div className=\"info__imgPortfolio\">\n\t\t\t\t\t<p className=\"text textPortfolio\">Play memory card with JS!</p>\n\t\t\t\t\t<img className=\"link__portfolio\" src={GitHub} alt=\"gitHub\" />\n\t\t\t\t\t<img className=\"link__portfolio\" src={Enlace} alt=\"gitHub\" />\n\t\t\t\t</div>\n\t\t\t</div>\n\t\t\t</div>\n\t\t\t{/* <div className=\"btn__experience\">\n\t\t\t\t<Link to=\"/moreProjects\">\n\t\t\t\t\t<Button variant=\"outlined\" color=\"secondary\">\n\t\t\t\t\t\tMore Projects\n\t\t\t\t\t</Button>\n\t\t\t\t</Link>\n\t\t\t</div> */}\n\t\t\t\n</>\n\t);\n}","title":""},{"docid":"230be658126e9f4169818adbbad755ed","score":"0.52702475","text":"render() {\n // console.log(\"portfolio stocks in render\", this.portfolioStocks)\n return (\n <div>\n <Header/>\n <MainContainer allStocks={this.state.allStocks} handleBuyStock={this.handleBuyStock} portfolioStocks={this.state.portfolioStocks} />\n </div>\n );\n }","title":""},{"docid":"1340902c9eac8940e3e5a4b8b8382ade","score":"0.52526456","text":"constructor(scope, id, props) {\n super(scope, id, { type: CfnAcceptedPortfolioShare.CFN_RESOURCE_TYPE_NAME, properties: props });\n try {\n jsiiDeprecationWarnings.aws_cdk_lib_aws_servicecatalog_CfnAcceptedPortfolioShareProps(props);\n }\n catch (error) {\n if (process.env.JSII_DEBUG !== \"1\" && error.name === \"DeprecationError\") {\n Error.captureStackTrace(error, CfnAcceptedPortfolioShare);\n }\n throw error;\n }\n cdk.requireProperty(props, 'portfolioId', this);\n this.portfolioId = props.portfolioId;\n this.acceptLanguage = props.acceptLanguage;\n }","title":""},{"docid":"423ce67c7503524c3b628935109d6adc","score":"0.52384794","text":"static createStock() {\n const itemNames = ['Camisa', 'Pantalon', 'Calcetines'];\n const itemPrices = [13, 27, 100];\n return itemNames.map((value, index) => new Item(itemNames[index], itemPrices[index]));\n }","title":""},{"docid":"a706241fff00a8a5c8c64b7c55350260","score":"0.52205","text":"constructor(name,stock = 1){\n\tif (typeof(name) == 'object') {\n\t\t// clone branch\n\t\tObject.keys(name).forEach(prop => this[prop] = clone(name[prop]));\n\t} else {\n\t\t// standard branch\n\t\tthis.id = \"_\" + (new Date().getTime() + Math.random() * 0x10000000000).toString(16);\n\t\tthis._name = name;\n\t\tif (this.usable.includes(\"inmenu\") && this.onUse === undefined) {\n\t\t\tconsole.log(`WARNING: item ${name} does not have an onUse`);\n\t\t}\n\t\tif (this.equippable && this.onEquip === undefined) {\n\t\t\tconsole.log(`WARNING: item ${name} does not have an onEquip`);\n\t\t}\n\t\tif (this.equippable && this.onRemove === undefined) {\n\t\t\tconsole.log(`WARNING: item ${name} does not have an onRemove`);\n\t\t}\n\t\tthis.stock = stock;\n\t\tif (this.itemData && Number.isInteger(this.itemData.uses)) {\n\t\t\tthis._uses = new FillStat(this.itemData.uses);\n\t\t} else {\n\t\t\tthis._uses = new FillStat(1);\n\t\t}\n\n\t\tif (this.equippable !== undefined) {\n\t\t\tthis.modID = {};\n\t\t}\n\t}\n\n\t}","title":""},{"docid":"e8df3ac77cbcc0d9da5ea1029beb923e","score":"0.51947796","text":"constructor(scope, id, props) {\n super(scope, id, { type: CfnPortfolioProductAssociation.CFN_RESOURCE_TYPE_NAME, properties: props });\n try {\n jsiiDeprecationWarnings.aws_cdk_lib_aws_servicecatalog_CfnPortfolioProductAssociationProps(props);\n }\n catch (error) {\n if (process.env.JSII_DEBUG !== \"1\" && error.name === \"DeprecationError\") {\n Error.captureStackTrace(error, CfnPortfolioProductAssociation);\n }\n throw error;\n }\n cdk.requireProperty(props, 'portfolioId', this);\n cdk.requireProperty(props, 'productId', this);\n this.portfolioId = props.portfolioId;\n this.productId = props.productId;\n this.acceptLanguage = props.acceptLanguage;\n this.sourcePortfolioId = props.sourcePortfolioId;\n }","title":""},{"docid":"f59f10a502bf65cc4aed5844ecfeb97c","score":"0.5190033","text":"function initPortfolio() {\n\t\t//We want to hide all images at first\n\t\tportfolioImages = $(\"#portfolio-images li img\").css(\"display\", \"none\");\n\t\t\n\t\t//Add the various mouse events to the grid overlay\n\t\tgridOverlay = $(\"#grid-overlay\").click(onGridClick).mousemove(onGridMouseMove).mouseout(onGridMouseOut);\n\t\t\n\t\tcurrentImageIndex = 0;\n\t\tnextImageIndex = 1;\n\t\t\n\t\t//We begin by displaying the first image in the list\n\t\tif (portfolioImages.length > 0) {\n\t\t\t$(portfolioImages[0]).css(\"display\", \"block\");\n\t\t}\n\t\t\n\t\tportfolioInfo = $(\"#portfolio-info\");\n\t\tportfolioTimerBar = $(\"#portfolio-timer\");\n\t\tportfolioTimerBar.data(\"originalOpacity\", portfolioTimerBar.css(\"opacity\"));\n\t\tportfolioNavigation = $(\"#portfolio-navigation\");\n\t\t\n\t\t//We store all the navigation buttons in a document fragment first before actually\n\t\t//appending them to the DOM. This gives us better performance since direct\n\t\t//DOM manipulation is processor expensive\n\t\tvar frag = document.createDocumentFragment();\n\t\tportfolioButtons = [];\n\t\t\n\t\t//Create a nav button for every image in the portfolio\n\t\tfor (var i = 0; i < portfolioImages.length; i++) {\n\t\t\tvar navButton = $(\"<div>\").addClass(\"portfolio-button\").data(\"index\", i);\n\t\t\t//Transition to the corresponding image on click\n\t\t\tnavButton.click(function() {\n\t\t\t\tvar thisIndex = $(this).data(\"index\");\n\t\t\t\tif(thisIndex !== currentImageIndex) {\n\t\t\t\t\tnextImageIndex = thisIndex;\n\t\t\t\t\timageTransition();\n\t\t\t\t}\n\t\t\t});\n\t\t\t//Highlight the current nav button\n\t\t\tif (i === currentImageIndex) {\n\t\t\t\taddHighlight(navButton);\n\t\t\t}\n\t\t\t\n\t\t\t//Add button to fragment and array\n\t\t\tfrag.appendChild(navButton[0]);\n\t\t\tportfolioButtons.push(navButton);\n\t\t}\n\t\t//Add to document\n\t\tportfolioNavigation.append(frag);\n\t}","title":""},{"docid":"2bbb7b4ed7b138fd15bcd5ab8eee8b1e","score":"0.51181763","text":"setPortfolioByDate(){}","title":""},{"docid":"453dabc86d9d913fd94164e1f9c589da","score":"0.5107213","text":"updatePortfolioState(portfolioId, stocks, name){\n let pfCopy = Object.assign([], this.state.portfolio);\n for(var i = 0; i<pfCopy.length; i++){\n if(pfCopy[i].id === portfolioId){\n pfCopy[i].name = name\n pfCopy[i].stocks = stocks\n }\n }\n this.setState({portfolio: pfCopy})\n this.onSetResult(pfCopy, 'portfolio')\n }","title":""},{"docid":"2654018d63efba2d5ee5e0b8340888f4","score":"0.5096993","text":"function setPortfolioInStorage(portfolio) {\n const name = portfolio.name;\n let portfolios = getPortfoliosFromStorage();\n let updated = false;\n\n /* Look for existing equivalent portfolio in local storage. */\n for (let i = 0; i < portfolios.length; i++) {\n if (portfolios[i].name === name) {\n // Update existing portfolio in local storage.\n portfolios[i] = portfolio;\n setPortfoliosInStorage(portfolios);\n updated = true;\n }\n }\n\n if (!updated) {\n // Add new portfolio.\n portfolios.push(portfolio);\n setPortfoliosInStorage(portfolios);\n }\n\n // Return the new list of portfolios in the storage.\n return portfolios;\n}","title":""},{"docid":"7ec6d7312add9fbbbac2768b67dacd5e","score":"0.50718343","text":"function Item(name, price, stock, image) {\n this.name = name;\n this.price = price;\n this.stock = stock;\n this.image = image;\n}","title":""},{"docid":"06814862639b2914d91a1e790ea59360","score":"0.50716645","text":"function Cart(){\n // check for existing instance\n if (typeof Cart._instance === 'Object'){\n return Cart._instance;\n }\n\n // default properties\n this.data = {};\n this.isReady = false;\n\n // store the instance\n Cart._instance = this;\n\n // 'this' is returned implicitly when called with new\n }","title":""},{"docid":"1cced5f7326d74ae5283085a176c2276","score":"0.50388515","text":"function calculatePortfolioValue (portfolio, completedPositions, pendingOrders) {\n\n var portfolioFreeCash = 0.0\n var portfolioCommittedCash = 0.0\n var portfolioEquityValue = 0.0\n var portfolioTodaysGainOrLoss = 0.0\n var portfolioPositionsTotalGainOrLoss = 0.0\n var portfolioTotalGainOrLoss = 0.0\n\n var portfolioTotalValue = 0.0\n var numberOfPositions = completedPositions.length\n var numberOfUniquePositions = 1 // Need to determine a formula for this\n\n\n for (i = 0; i < pendingOrders.length; i++) {\n\n var orderType = pendingOrders[i][\"orderType\"]\n\n // Will only increase pending cash if the ordertype is a \"buy\"\n if (orderType == \"buy\") {\n\n var numberOfShares = pendingOrders[i][\"numberOfShares\"]\n var purchasePrice = pendingOrders[i][\"purchasePrice\"]\n\n // Calculates how much cash is commited to open orders\n portfolioCommittedCash += (numberOfShares * purchasePrice) \n }\n }\n\n\n for (i = 0; i < completedPositions.length; i++) {\n\n // Numbers used to calculate the value of this holding as a part of the portfolio\n var numberOfShares = completedPositions[i][\"numberOfShares\"]\n var purchasePrice = completedPositions[i][\"purchasePrice\"]\n var todaysGainOrLoss = completedPositions[i][\"todaysGainOrLoss\"]\n var totalGainOrLoss = completedPositions[i][\"totalGainOrLoss\"]\n\n // The equity value of the position is it's value at purchase plus the total change in value\n var positionEquityValue = (numberOfShares * purchasePrice) + totalGainOrLoss\n\n // Update the aggregate portfolio values\n portfolioEquityValue += positionEquityValue\n portfolioTodaysGainOrLoss += todaysGainOrLoss\n // portfolioTodaysGainOrLoss += totalGainOrLoss\n portfolioPositionsTotalGainOrLoss += positionEquityValue\n }\n\n portfolioFreeCash = portfolio.get(\"cash\") - portfolioCommittedCash\n portfolioTotalValue = portfolioEquityValue + portfolioFreeCash + portfolioCommittedCash\n portfolioTotalGainOrLoss = portfolioTotalValue - portfolio.get(\"initialPortfolioValue\")\n\n var updatedPortfolioValues = {\n\n cash: parseFloat(portfolioFreeCash.toFixed(2)),\n committedCash: parseFloat(portfolioCommittedCash.toFixed(2)),\n equityValue: parseFloat(portfolioEquityValue.toFixed(2)),\n portfolioValue: parseFloat(portfolioTotalValue.toFixed(2)),\n todaysGainOrLoss: parseFloat(portfolioTodaysGainOrLoss.toFixed(2)),\n totalGainOrLoss: parseFloat(portfolioTotalGainOrLoss.toFixed(2)),\n numberOfPositions: numberOfPositions,\n numberOfUniquePositions: numberOfUniquePositions\n }\n\n return updatedPortfolioValues\n}","title":""},{"docid":"4f13a59818b0d14cfc045be567f7a10b","score":"0.5030876","text":"function updatePorfolio(quote, sales, callback) {\n\t// updating quote info\n\tif ( quote['ask'] === -1 ) {\n\t\tportfolio['ask'] = '-';\n\t\tportfolio['askSize'] = '-';\n\t} else {\n\t\tportfolio['ask'] = quote['ask'];\n\t\tportfolio['askSize'] = quote['askSize'];\n\t}\n\n\tif ( quote['bid'] === -1 ) {\n\t\tportfolio['bid'] = '-';\n\t\tportfolio['bidSize'] = '-';\n\t} else {\n\t\tportfolio['bid'] = quote['bid'];\n\t\tportfolio['bidSize'] = quote['bidSize'];\n\t}\n\n\taddAskBid(quote);\n\n\tif ( quote.hasOwnProperty('price') ) {\n\t\tportfolio['last'] = quote['price'];\n\t\tportfolio['volume'] = quote['volume'];\n\n\t\tif ( portfolio['high'] === '-' ) {\n\t\t\tportfolio['high'] = quote['price'];\n\t\t} else {\n\t\t\tportfolio['high'] = Math.max(quote['price'], portfolio['high']);\n\t\t}\n\t\tif ( portfolio['low'] === '-' ) {\n\t\t\tportfolio['low'] = quote['price'];\n\t\t} else {\n\t\t\tportfolio['low'] = Math.min(quote['price'], portfolio['low']);\n\t\t}\n\t}\n\n\tif (sales) {\n\n\t\taddSales(sales);\n\t\t// updating personal portfolio info\n\t\t// when a current order is altered, either partially or completely fulfilled, \n\t\t// it will be recorded in sales which will have buyer and seller ids\n\t\tfor ( var i = 0; i < sales.length; i++ ) {\n\t\t\tvar currentSale = sales[i];\n\t\t\t// client bought shares\n\t\t\tif ( currentSale['buyerId'] === email ) {\n\t\t\t\tportfolio['cashTotal'] -= currentSale['price'] * currentSale['amount'];\n\t\t\t\tportfolio['quantity'] += currentSale['amount'];\n\t\t\t\taddToTransaction(currentSale, 'buy');\n\t\t\t} \n\t\t\t// client sold shares\n\t\t\tif ( currentSale['sellerId'] === email ) {\n\t\t\t\tportfolio['cashTotal'] += currentSale['price'] * currentSale['amount'];\n\t\t\t\tportfolio['quantity'] -= currentSale['amount'];\n\t\t\t\taddToTransaction(currentSale, 'sell');\n\t\t\t}\n\t\t}\n\t\tcash = portfolio['cashTotal']\n\n\t\t// update the value of client's stocks\n\t\tportfolio['crlTotal'] = portfolio['last'] * portfolio['quantity'];\n\n\t\t// update the value of client's entire portfolio\n\t\tportfolio['total'] = portfolio['crlTotal'] + portfolio['cashTotal'];\n\n\t\tcallback();\n\t}\n}","title":""},{"docid":"c75675671856620d325ef55e6ea52ebc","score":"0.5026071","text":"function Inventory(){\r\n stock = []; \r\n \r\n //function name: calculateValue\r\n //inputs:\r\n //output: totalInventoryValue\r\n //brief description: this function calcuulates the total value of the inventory\r\n this.calculateValue = function(){ \r\n var inventoryValue = 0;\r\n //return (Product.price * Product.quantity);\r\n \r\n for (var i = 0; i < stock.length; i++){\r\n inventoryValue += ( stock[i].price * stock[i].quantity );\r\n }\r\n \r\n console.log( \"The value of this inventory is $\" + inventoryValue );\r\n return inventoryValue;\r\n }\r\n \r\n //function name: addStock\r\n //inputs: Product\r\n //brief description: this function adds a product to stock\r\n this.addStock = function(Product){\r\n stock.push(Product);\r\n }\r\n \r\n //function name: displayStock\r\n //inputs: \r\n //brief description: this function displays the items in stock\r\n this.displayStock = function(){\r\n\r\n if (stock.length > 0){\r\n for (var i = 0; i < stock.length; i++){\r\n console.log( stock[i] ); \r\n }\r\n } else { console.log(\"There are no items in the inventory\"); \r\n }\r\n }\r\n \r\n}","title":""},{"docid":"ace28b2a3a5b99612486577d937c41ff","score":"0.5021331","text":"function getChart(data, initialData) {\n\treturn isc.FacetChart.create({\n\t ID: \"stockQuotesChart\",\n\t facets: [{\n\t id: \"time\",\n\t title: \"Time\"\n\t }, {\n\t id: \"name\",\n\t title: \"Name\"\n\t }],\n\t data:data,\n\t initialData:initialData,\n\t valueProperty: \"lastValue\",\n\t chartType: \"Area\",\n\t title: \"Portfolio Value\"\n\t});\n}","title":""},{"docid":"b39637c391a1ce04e12840b8b43381fb","score":"0.49574605","text":"function getPortfolioPositions (portfolio) {\n\n // Function will not return until this promise is fulfilled\n var promiseToFindPortfolioPositions = new Parse.Promise();\n\n // Sets up the Parse query to find PortfolioPositions associated with this Portfolio \n var PortfolioPosition = Parse.Object.extend(\"PortfolioPosition\")\n var portfolioPositionQuery = new Parse.Query(PortfolioPosition)\n portfolioPositionQuery.equalTo(\"portfolioID\", portfolio)\n\n // Executes the query search\n promiseToFindPortfolioPositions = portfolioPositionQuery.find()\n\n return promiseToFindPortfolioPositions\n}","title":""},{"docid":"69fc671de627db143dbbce55a3d67c16","score":"0.49407157","text":"function Stock({ ticker }) {\n const result = ensureQuote.read(ticker);\n console.log(result);\n // Assume this is deeply nested (and that you don't want\n // import the cache into every component)...\n return (\n <div>\n {result.companyName} <small>({result.symbol})</small> {result.change}%\n </div>\n );\n}","title":""},{"docid":"f181d156166c58d4fdfb5fb37db7b492","score":"0.49396363","text":"function StockProvider(){\n /**\n * Maakt een nieuwe YahooAjaxHelper aan en zet dat in de variable yahoo.\n * @type {YahooAjaxHelper} : Geeft een YahooAjaxHelper \"class/object\".\n */\n yahoo = new YahooAjaxHelper();\n\n /**\n * Maakt een nieuwe LocalHelper aan en zet dat in de variable local.\n * @type {LocalHelper} : Geeft een LocalHelper \"class/object\".\n */\n local = new LocalHelper();\n\n /**\n * Dit is om bij te houden het aantal keer dat de methode getdata is aan geroepen,\n * zodat er om en om de yahoo en local helpers worden gereturnt\n * @type {Number} : count begint met 1.\n */\n var count = 1;\n\n /**\n * De functie getData is om een nieuwe yahoo of local helper te returnen .\n * Na elke keer dat de functie wordt aangeroepen gaat de count omhoog.\n * Dan wordt er een if en else gezet, wanneer de getdata 10 keer is aangeroepen (die local mee geeft) geeft hij de yahoo terug.\n * Nadat de functie 20 keer is aangeroepen wordt de count gereset en zo geeft de StockProvider factory om en om de local en yahoo en roept de getStockData functie aan.\n *\n * @param count : het aantal keer dat getdata is opgeroepen.\n */\n function getData(count) {\n /**\n * Eerst 10 keer dat data wordt opgeroepen voor de local;\n * @type {Number} : 10 keer.\n */\n var localCount = 10;\n /**\n * de volgende 10 keer (maximum is dan dus 20 keer) voor de yahoo;\n * @type {Number} : 20e keer.\n */\n var yahooCount = 20;\n /**\n * reset de count terug naar 1\n * @type {Number} : 1 (gereset weer naar het begin)\n */\n var resetCount = 1;\n /**\n * hier wordt de functie getdata aangeroepen voor het returnen van de local of yahoo helper.\n * @return {*} Het hang van de count af wat hij returnt, of de local.getStockData() of de yahoo.getStockData\n */\n this.getData = function () {\n count++;\n if (count <= localCount) {\n return local.getStockData();\n }\n else {\n if (count === yahooCount) {\n count = resetCount;\n }\n return yahoo.getStockData();\n }\n };\n }\n\n /**\n * Wanneer de functie getData wordt opgeroepen geeft hij de count mee.\n */\n getData.call(this, count);\n}","title":""},{"docid":"8a01c073c8072888f68901af83ddf613","score":"0.49349055","text":"function Product(product_name,department_name,price, stock_quantity){\n this.product_name= product_name;\n this.department_name= department_name;\n this.price=price;\n this.stock_quantity= stock_quantity;\n}","title":""},{"docid":"64054e7a0fbb87b5b964cb264ab9c781","score":"0.49323454","text":"function Portfolio() {\t\n\t\n\t\t\t\n\t\tif( $('.portfolio-wrap').length > 0 ){\t\t\t\n\t\t\t\n\t\t\t\n\t\t\tif ($(\"body\").hasClass(\"smooth-scroll\")) {\n\t\t\t\tvar elem = document.querySelector(\"#content-scroll\");\n\t\t\t\tvar scrollbar = Scrollbar.init(elem,\n\t\t\t\t{\n\t\t\t\t\trenderByPixels: true,\n\t\t\t\t\tdamping:0.05\n\t\t\t\t});\n\t\t\t}\n\t\t\t\n\t\t\tvar $container = $('.portfolio');\n\t\t\n\t\t\t$container.isotope({\n\t\t\t layoutMode: 'packery',\n\t\t\t itemSelector: '.item',\n\t\t\t gutter:0,\n\t\t\t transitionDuration: \"0.5s\"\n\t\t\t});\n\t\t\t\n\t\t\t$('#filters a').on('click', function() {\n\t\t\t\t$('#filters a').removeClass('active');\n\t\t\t\t$(this).addClass('active');\n\t\t\t\t$('.item').addClass('item-margins');\n\t\t\t\tvar selector = $(this).attr('data-filter');\n\t\t\t\t$container.isotope({ filter: selector }, function( $changedItems, instance ) {\n\t\t\t\t instance.$allAtoms.filter('.isotope-hidden').removeClass('is-filtered');\n\t\t\t\t instance.$filteredAtoms.addClass('is-filtered');\n\t\t\t\t});\t\t\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\t\n\t\t\t$(\"#all\").trigger('click');\n\t\t\t\t\n\t\t\t$('.item').each(function() {\n\t\t\t\tvar image = $(this).find('.item-image').data('src');\t\n\t\t\t\t$(this).find('.item-image').css({'background-image': 'url(' + image + ')'});\n\t\t\t});\n\t\t\t\n\t\t\t\n\t\t\t$(\".item-image\").mouseenter(function(e) {\t\n\t\t\t\tTweenMax.to('#ball', 0.3,{borderWidth: '2px', scale: 1, borderColor:'#fff'});\n\t\t\t\tTweenMax.to('#ball-loader', 0.2,{borderWidth: '2px', top: 2, left: 2});\n\t\t\t\t$( \"#ball\" ).addClass(\"with-icon\").append( '<i class=\"fa fa-plus\"></i>' );\n\t\t\t\t$(this).parent().find('video').each(function() {\n\t\t\t\t\t$(this).get(0).play();\n\t\t\t\t});\n\t\t\t});\n\t\t\t\t\t\t\t\n\t\t\t$(\".item-image\").mouseleave(function(e) {\n\t\t\t\tTweenMax.to('#ball', 0.2,{borderWidth: '4px', scale:0.5, borderColor:'#999999'});\n\t\t\t\tTweenMax.to('#ball-loader', 0.2,{borderWidth: '4px', top: 0, left: 0});\n\t\t\t\t$(\"#ball\").removeClass(\"with-icon\");\n\t\t\t\t$('#ball i').remove();\n\t\t\t\t$(this).parent().find('video').each(function() {\n\t\t\t\t\t$(this).get(0).pause();\n\t\t\t\t});\n\t\t\t});\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t//Show Filters On overlay\n\t\t\t$('#show-filters, #close-filters').on('click', function() {\t\t\t\n\t\t\t\t$('#filters-overlay').toggleClass('active');\n\t\t\t\tvar navtitleheight = $(\".hero-title\").height()\n\t\t\t\tvar navsubtitleheight = $(\".hero-subtitle\").height()\n\t\t\t\t\n\t\t\t\tsetTimeout( function(){\t\t\t\n\t\t\t\t\tif ($('#filters-overlay').hasClass(\"active\")) {\n\t\t\t\t\t\t\n\t\t\t\t\t\tTweenMax.to($(\".item-parallax\"), 0.6, {force3D:true, scale:0.9, opacity:0.3, delay:1.1, ease:Power2.easeInOut});\t\t\t\t\t\n\t\t\t\t\t\tTweenMax.to($(\".active .item-caption\"), 0.3, {opacity:0, ease:Power2.easeOut});\n\t\t\t\t\t\tTweenMax.to($(\"#show-filters, #counter-wrap\"), 0.3, {opacity:0, delay:0, ease:Power2.easeOut});\n\t\t\t\t\t\tTweenMax.to($(\"#show-filters, #counter-wrap\"), 0, {visibility:'hidden', delay:0.35, ease:Power2.easeOut}); \n\t\t\t\t\t\t\n\t\t\t\t\t\t//Fade In Navigation Lists\n\t\t\t\t\t\tTweenMax.set($(\".filters-info\"), {y:30, opacity:0});\n\t\t\t\t\t\tTweenMax.to($(\".filters-info\"), 0.4, {force3D:true, y:0, opacity:1, delay:0.7, ease:Power2.easeOut});\n\t\t\t\t\t\tvar tlMenu = new TimelineLite();\n\t\t\t\t\t\ttlMenu.set($(\".filters-timeline\"), {y:60, opacity:0});\n\t\t\t\t\t\t$(\".filters-timeline\").each(function(index, element) {\n\t\t\t\t\t\t\ttlMenu.to(element, 0.5, {y:0, opacity:1, delay:1.2, ease:Power3.easeOut}, index * 0.1)\n\t\t\t\t\t\t});\n\t\t\t\t\t\t\n\t\t\t\t\t\tvar heroheight = $(\"#hero\").height();\t\t\t\n\t\t\t\t\t\tif ($(\"body\").hasClass(\"smooth-scroll\")) {\n\t\t\t\t\t\t\tTweenLite.to(scrollbar, 1.5, {scrollTop:heroheight, ease:Power4.easeInOut});\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t$(\"html,body\").animate({scrollTop: heroheight}, 800);\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t} else {\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\tTweenMax.to($(\".item-parallax\"), 0.6, {force3D:true, scale: 1, opacity:1, delay:0.3, ease:Power2.easeInOut});\t\t\t\t\t\n\t\t\t\t\t\tTweenMax.to($(\".active .item-caption\"), 0.5, {opacity:1, delay:0.5, ease:Power2.easeOut});\n\t\t\t\t\t\tTweenMax.set($(\"#show-filters, #counter-wrap\"), {visibility:'visible', opacity:0});\n\t\t\t\t\t\tTweenMax.to($(\"#show-filters, #counter-wrap\"), 0.3, {opacity:1, delay:0.7, ease:Power2.easeOut});\n\t\t\t\t\t\t\n\t\t\t\t\t\t//Fade Out Navigation Lists\n\t\t\t\t\t\tTweenMax.to($(\".filters-info\"), 0.2, {force3D:true, y:-30, opacity:0, delay:0, ease:Power1.easeIn});\t\t\t\t\t\n\t\t\t\t\t\tvar tlMenu = new TimelineLite();\n\t\t\t\t\t\t$(\".filters-timeline, .jssocials-share\").each(function(index, element) {\n\t\t\t\t\t\t\ttlMenu.to(element, 0.25, {opacity:0, y:-60, delay:0.1, ease:Power1.easeIn }, index * 0.1)\n\t\t\t\t\t\t});\t\n\t\t\t\t\t\tTweenMax.to('#ball', 0.1,{borderWidth: '4px', scale:0.5,});\n\t\t\t\t\t\t$(\"#ball\").removeClass(\"close-icon\");\n\t\t\t\t\t\t$('#ball i').remove();\n\t\t\t\t\t\t\n\t\t\t\t\t}\t\t\t\t\t\t\t\n\t\t\t\t} , 20 );\n\t\t\t});\n\t\t\t\n\t\t\t\n\t\t\t$(\"#close-filters\").mouseenter(function(e) {\t\n\t\t\t\tTweenMax.to('#ball', 0.2,{borderWidth: '2px', scale: 1, borderColor:'#fff',});\n\t\t\t\tTweenMax.to('#ball-loader', 0.2,{borderWidth: '2px', top: 2, left: 2});\n\t\t\t\t$( \"#ball\" ).addClass(\"close-icon\").append( '<i class=\"fa fa-times\"></i>' );\n\t\t\t});\n\t\t\t\t\n\t\t\t$(\"#close-filters\").mouseleave(function(e) {\n\t\t\t\tTweenMax.to('#ball', 0.2,{borderWidth: '4px', scale:0.5, borderColor:'#999999',});\n\t\t\t\tTweenMax.to('#ball-loader', 0.2,{borderWidth: '4px', top: 0, left: 0});\n\t\t\t\t$(\"#ball\").removeClass(\"close-icon\");\n\t\t\t\t$('#ball i').remove();\n\t\t\t});\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\tsetTimeout( function(){\n\t\t\t\tvar controller = new ScrollMagic.Controller();\n\t\t\t\t$('.portfolio').each(function(){\n\t\t\t\t\tvar $this = $(this);\n\t\t\t\t\tvar $elheight = window.innerHeight*0.7;\n\t\t\t\t\tvar $thisHeight = $(this).outerHeight() - $elheight;\n\t\t\t\t\t\n\t\t\t\t\tvar scene = new ScrollMagic.Scene({triggerElement:$this[0],duration: $thisHeight})\n\t\t\t\t\t\t.addTo(controller)\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\tscene.triggerHook(0.3)\n\t\t\t\t\t\n\t\t\t\t\tscene.on('enter', function(){\t\t\t\t\n\t\t\t\t\t\tTweenMax.to($(\"#show-filters\"), 0.3, {opacity:1, delay:0, ease:Power2.easeOut});\n\t\t\t\t\t\t$(\"#show-filters\").addClass('enabled')\n\t\t\t\t\t});\n\t\t\t\t\t\n\t\t\t\t\tscene.on('leave', function(){\t\t\t\t\n\t\t\t\t\t\tTweenMax.to($(\"#show-filters\"), 0.15, {opacity:0, delay:0, ease:Power2.easeOut});\n\t\t\t\t\t\t$(\"#show-filters\").removeClass('enabled')\n\t\t\t\t\t});\n\t\t\t\t\t\n\t\t\t\t\tif ($(\"body\").hasClass(\"smooth-scroll\")) {\n\t\t\t\t\t\tscrollbar.addListener(() => {\n\t\t\t\t\t\t\tscene.refresh()\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t} , 2000 );\n\t\t\t\n\t\t\tTweenMax.to($(\"#show-filters\"), 0, {opacity:0, delay:0.05, ease:Power2.easeOut});\n\t\t\t\n\t\t}\n\t\n\t}","title":""},{"docid":"950159e5c9d700f57a9d3c1c8e2f53bd","score":"0.48994607","text":"constructor(name, price) {\n // invokes the setters\n this.name = name;\n this.price = price;\n }","title":""},{"docid":"7da544d546e22e6dee9e367ee6857c2e","score":"0.48876125","text":"static initialize(obj, portfolioDataField, portfolioIDField, portfolioNameField, resultField) { \n obj['PortfolioDataField'] = portfolioDataField;\n obj['PortfolioIDField'] = portfolioIDField;\n obj['PortfolioNameField'] = portfolioNameField;\n obj['ResultField'] = resultField;\n }","title":""},{"docid":"176f14c2ddee510f3731a890bf83f461","score":"0.4856577","text":"function Composition(axis) {\n this.axis = axis;\n this.stacks = {\n changed: false\n };\n }","title":""},{"docid":"9cd51e6667c770293b329904049705c9","score":"0.4850132","text":"function ClusterInventory(clusterName, data) {\n this.clusterName = clusterName;\n if (data) {\n Object.assign(this, data);\n }\n }","title":""},{"docid":"7f677646317f291759e157008e719dcc","score":"0.4848187","text":"function Position(p)\n{\n this.ticker = p[0];\n this.name = p[1];\n this.currency = p[2];\n this.FXrate = parseFloat(p[3]);\n this.position = parseFloat(p[4]);\n this.exposureNAV = parseFloat(p[5]) / 100;\n this.exposureGross = parseFloat(p[6]);\n this.exposureNet = parseFloat(p[7]);\n this.fundNAVbase = parseFloat(p[8]);\n this.EODprice = parseFloat(p[9]);\n this.stdPxChange = parseFloat(p[10]) / 100;\n this.custodian = p[11];\n}","title":""},{"docid":"5195b5cabce646fc3350e7c579a0abec","score":"0.4847761","text":"function Data() {\n this.data = {};\n this.orders = {};\n this.currentOrderNumber = 0;\n this.currentFavorites = [];\n}","title":""},{"docid":"c75db1b0e777610a8ccbf5e05c788bbb","score":"0.48271504","text":"constructor (_data, _quantidade, _valor) {\n\n Object.assign(this, {\n _quantidade,\n _valor \n });\n \n this._data = new Date(_data.getTime()), //criando uma nova referência\n Object.freeze(this); //congela para nao permitir alterações\n }","title":""},{"docid":"1a90d48fdb17e4551dcd8fdde00c6858","score":"0.48267812","text":"function getStockPortfolioData (arrayOfStockNames) {\n\n // var promiseToGetPortfolioData = new Parse.Promise();\n\n // Builds the Yahoo Stock API url for the JSON call\n var returnedURL = buildStockPortfolioURL(arrayOfStockNames);\n\n // This array will hold the final data to return to the client\n var arrayOfStockData = [];\n\n return new Promise(function(resolve, reject) {\n\n request({\n url: returnedURL,\n json: true\n }, function (error, response, returnedData) {\n\n if (!error && response.statusCode === 200) {\n\n var portfolioData = returnedData.query.results.quote\n\n // Filters out unnecesary information from JSON request for each stock in portfolio\n for (i = 0; i < portfolioData.length; i++) {\n\n var stockData = formatStockData(portfolioData[i]);\n arrayOfStockData[i] = stockData;\n }\n\n resolve (arrayOfStockData);\n\n } else {\n\n reject (error)\n }\n })\n });\n}","title":""},{"docid":"583280f8429113760631b3f7c2e1d365","score":"0.482013","text":"async changeRate(portfolio, currency) {\n var valueOfStocks = 0;\n var portfolios = this.state.listOfPortfolios;\n // Find the right portfolio\n for (var i=0; i<portfolios.length; i++){\n if (portfolios[i].name === portfolio) {\n var index = i;\n }\n }\n var data = await this.getCurrency();\n var changeRate = data[\"rates\"][\"EUR\"];\n if (currency === 'USD') {\n changeRate = 1 / changeRate;\n }\n portfolios[index].changeRate = changeRate;\n portfolios[index].currency = currency;\n // Update currency to all stocks\n for (var j=0; j<portfolios[index].stocks.length; j++) {\n const updatedStock = {\n \"id\": portfolios[index].stocks[j].id,\n \"unitValue\": (portfolios[index].stocks[j].unitValue * portfolios[index].changeRate).toFixed(2),\n \"quantity\": portfolios[index].stocks[j].quantity,\n \"totalValue\": (portfolios[index].stocks[j].unitValue * portfolios[index].stocks[j].quantity * portfolios[index].changeRate).toFixed(2)\n };\n valueOfStocks = (parseFloat(valueOfStocks) + parseFloat(updatedStock.totalValue)).toFixed(2);\n portfolios[index].stocks[j] = updatedStock;\n localStorage.setItem(\"portfolios\", \"\");\n localStorage.setItem(\"portfolios\", JSON.stringify(portfolios));\n this.setState({\n listOfPortfolios: portfolios});\n }\n portfolios[index].valueOfStocks = valueOfStocks;\n localStorage.setItem(\"portfolios\", \"\");\n localStorage.setItem(\"portfolios\", JSON.stringify(portfolios));\n this.setState({ listOfPortfolios: portfolios })\n }","title":""},{"docid":"00e2abda539a9f990dfdd5934c201286","score":"0.4819303","text":"static get tableName() {\n\t\treturn 'portfolio';\n\t}","title":""},{"docid":"003dbff6c27477143997dc6cbe7cbd10","score":"0.48167118","text":"function formatPortfolioPosition (currentPosition, calculatedTodaysGainOrLoss, calculatedTotalGainOrLoss) {\n\n var portfolioPosition = {\n\n objectId: currentPosition.id,\n name: currentPosition.get(\"name\"),\n ticker: currentPosition.get(\"ticker\"),\n numberOfShares: parseFloat(currentPosition.get(\"numberOfShares\")),\n purchasePrice: parseFloat(currentPosition.get(\"purchasePrice\")),\n dateOrderPlaced: currentPosition.createdAt,\n\n // Makes sure these numbers have only two decimal places\n todaysGainOrLoss: parseFloat(calculatedTodaysGainOrLoss.toFixed(2)),\n totalGainOrLoss: parseFloat(calculatedTotalGainOrLoss.toFixed(2))\n };\n\n return portfolioPosition;\n}","title":""},{"docid":"943a34941fc7116d5afc573e15e346de","score":"0.48136878","text":"function Cart(item, amount, price) { // <=== ça, c'est le nom de mon objet\n this.item = item; // <=== ceci est une propriété\n this.amount = amount;\n this.price = price;\n}","title":""},{"docid":"c8b5ec6a459bc99d51448138fcededc2","score":"0.4810876","text":"function createDefaultStock(defaultData, names, prices, changes, changeInPercentages) {\n for (var i = 0; i < names.length; i++) {\n defaultData[i] = new StockModel(names[i], prices[i], changes[i], changeInPercentages[i]);\n }\n }","title":""},{"docid":"309f79fecb8e4c374709f07bc94eedd9","score":"0.48061687","text":"constructor() {\n\n //the variables for this class...\n\n var foodStock,lastFed;\n var foodObj;\n\n \n \n}","title":""},{"docid":"f3c821d3062531669e246b76ecbc56b6","score":"0.47915336","text":"function Product(pid, pname, companyName, stock, area) {\n this.area = area;\n this.prodId = pid;\n this.proName = pname;\n this.compName = companyName;\n this.availableStock = stock;\n }","title":""},{"docid":"6c94f101f694a5e942747bbaca680b2f","score":"0.4790868","text":"function getPortfolioById( id ){\n \t\t\tvar i=portfolios.length;\n \t\t\twhile(i--){\n \t\t\t\tif( portfolios[i][\"id\"] == id){\n \t\t\t\t\treturn portfolios[i];\n \t\t\t\t}\n \t\t\t}\n \t\t\t\n \t\t\treturn null;\n \t\t}","title":""},{"docid":"f00110647c4457650aa69d20b8bd3ea1","score":"0.47886354","text":"function CookieStore(storeName, hourlyMin, hourlyMax, avgPerSale){\n this.storeName = storeName;\n this.hourlyMin = hourlyMin;\n this.hourlyMax = hourlyMax;\n this.avgPerSale = avgPerSale;\n this.hourlyCustomers = [];\n this.hourlyCookies = [];\n this.dailyTotal = 0;\n CookieStore.allStores.push(this);\n}","title":""},{"docid":"1dbba37e1f7a0b6d1fbc1c850d23685d","score":"0.478707","text":"function TicketPricing() {\r\n this.seniorPrice = 8.0;\r\n this.kidPrice = 7.0;\r\n this.adultPrice = 10.0;\r\n}","title":""},{"docid":"ab9cdf362d6fdd27c7d37ae934c3c86b","score":"0.47733554","text":"constructor(name, color) {\n this.name = name;\n this.color = color;\n this.position = 0;\n this.cash = 1000;\n }","title":""},{"docid":"7b2571f2a3e571c974f559a80227751a","score":"0.47705987","text":"function createPortfolio(id, name, value, risk) { \n if (risk === 0) {\n risk = 'Low';\n }\n if (risk === 1) {\n risk = 'Medium';\n }\n if (risk === 2) {\n risk = 'High';\n }\n return { id, name, value, risk };\n}","title":""},{"docid":"1e5480431470356c47e66adf1a5ae484","score":"0.4769364","text":"constructor (name, color) {\n this.name = name\n this.color = color\n this.position = 0\n this.cash = 1000\n }","title":""},{"docid":"9e2e5639a254af7cd49da4eb0cf6cfa4","score":"0.47550195","text":"function FinancialTrackOneData() {\n \"use strict\";\n /**\n * Contains the account number of the financial card.\n * @public\n * @instance\n * @type {string}\n */\n this.accountNumber = \"\";\n /**\n * Contains the first name of the card holder.\n * @public\n * @instance\n * @type {string}\n */\n this.firstName = \"\";\n /**\n * Contains the last name of the card holder\n * @public\n * @instance\n * @type {string}\n */\n this.lastName = \"\";\n /**\n * Contains the expiration date of the card.\n * @public\n * @instance\n * @type {Date}\n */\n this.expiration = false;\n /**\n * Contains the service code of the card.\n * @public\n * @instance\n * @type {string}\n */\n this.serviceCode = \"\";\n /**\n * Contains any other data the card issuer wanted to include on the first track.\n * @public\n * @instance\n * @type {string}\n */\n this.discretionaryData = \"\";\n}","title":""},{"docid":"b5a3c2e6d552bfe966e520836d776533","score":"0.4747795","text":"function updateArtistPortfolio(artistName) {\n currentArtistName = artistName;\n var $portfolio = $(\"#artist-portfolio\");\n _clearPortfolio();\n\n var url = '/miouzik/songs/' + currentCollection.id + \"/\" + encodeURIComponent(artistName);\n return ajax({\n type: 'GET',\n url: url,\n dataType: 'json',\n success: function(songs) {\n _clearPortfolio();\n\n for (var i=0; i<songs.length; i++) {\n var uuid = songs[i].uuid;\n currentPortfolio[uuid] = songs[i];\n }\n\n var albums = {}; // key = album name, value = list of songs\n var releases = {}; // key = release id, value = release\n for (var i=0; i<songs.length; i++) {\n var albumName = songs[i].album;\n var album = albums[albumName];\n if (album === undefined)\n albums[albumName] = album = { name:albumName, year:undefined, songs:[], releaseId:undefined };\n album.songs.push(songs[i]);\n if (songs[i].year !== null && songs[i].year !== undefined && album.year === undefined) album.year = songs[i].year;\n var releaseId = songs[i].discogs.release && songs[i].discogs.release.id;\n if (releaseId !== null && releaseId !== undefined && releaseId !== 0 && album.releaseId === undefined) album.releaseId = releaseId;\n if (releaseId !== null && releaseId !== undefined && releaseId !== 0) releases[releaseId] = songs[i].discogs.release;\n }\n var songCount = songs.length;\n var albumCount = Object.keys(albums).length;\n\n function newAlbum(album) {\n var albumSongIds = []; // song IDs in this album (ordered by track number)\n\n var $album = $('<div class=\"artist-portfolio-album\"></div>');\n var $header = $('<div class=\"artist-portfolio-album-header\"></div>').appendTo($album);\n var $cover = $('<div class=\"artist-portfolio-album-header-cover\"></div>').appendTo($header);\n var cover = \"/miouzik/cover/album/0\";\n if (album.releaseId) cover = \"/miouzik/cover/album/\" + album.releaseId;\n $('<img>').attr('src', cover).appendTo($cover);\n var $caption = $('<div class=\"artist-portfolio-album-header-caption\"></div>').appendTo($header);\n $('<h1>').text(album.name).appendTo($caption);\n var h2 = \"\";\n if (album.releaseId && releases[album.releaseId]) {\n var styles = releases[album.releaseId].style;\n if (styles && styles.length>0) {\n for (var i=0; i<styles.length; i++) {\n if (i>0) h2 = h2 + \", \";\n h2 = h2 + styles[i];\n }\n }\n }\n if (album.year !== null && album.year !== undefined && h2 !== \"\") h2 = h2 + \"\\xa0•\\xa0\";\n if (album.year !== null && album.year !== undefined) h2 = h2 + album.year;\n h2 = h2 + \"\\xa0\"; // \n $('<h2>').text(h2).appendTo($caption);\n\n function newSong(index, song) {\n var $song = $('<div class=\"artist-portfolio-album-song\"></div>').attr('id', song.uuid);\n var $like = $('<div class=\"artist-portfolio-album-song-like\"></div>').appendTo($song);\n var $trackNumber = $('<div class=\"artist-portfolio-album-song-trackNumber\"></div>').text(\"\" + song.trackNumber).appendTo($song);\n var $play = $('<div class=\"artist-portfolio-album-song-play\"></div>').appendTo($song);\n var $title = $('<div class=\"artist-portfolio-album-song-title\"></div>').text(song.title).appendTo($song);\n var $download = $('<div class=\"artist-portfolio-album-song-download\"></div>').appendTo($song);\n var $duration = $('<div class=\"artist-portfolio-album-song-duration\"></div>').appendTo($song);\n $album.append($song);\n $song.click(function() {\n $(\".artist-portfolio-album-song\", $portfolio).toggleClass(\"artist-portfolio-album-song--selected\", false);\n $song.toggleClass(\"artist-portfolio-album-song--selected\", true);\n });\n $play.click(function() {\n playSongs(albumSongIds.slice(index));\n });\n }\n\n var songs = album.songs.sort(function(a,b) {\n if (a.trackNumber && b.trackNumber) return a.trackNumber - b.trackNumber; \n });\n for (var i=0; i<album.songs.length; i++) {\n var song = album.songs[i];\n albumSongIds.push(song.uuid);\n newSong(i, song);\n }\n\n $album.appendTo($portfolio);\n }\n\n var $header = $('<div class=\"artist-portfolio-header\"></div>');\n $('<h1>').text(artistName).appendTo($header);\n var h2 = \"\" + albumCount;\n if (albumCount === 1) h2 = h2 + \" album, \"; else h2 = h2 + \" albums, \";\n h2 = h2 + songCount;\n if (songCount === 1) h2 = h2 + \" song, \"; else h2 = h2 + \" songs\";\n $('<h2>').text(h2).appendTo($header);\n $portfolio.append($header);\n\n for (var i=0; i<albumCount; i++) {\n var album = Object.keys(albums)[i];\n album = albums[album];\n newAlbum(album);\n }\n\n },\n error: function(jqxhr, textStatus, error) {\n flashError(\"Failed to load artists\", jqxhr.status);\n }\n });\n}","title":""},{"docid":"d05151920a9985f4d66a640bb9132cd6","score":"0.47473502","text":"function init_portfolio()\n{\n\t/* --- Hide portfolio excerpts --- */\n\t$('.portfolio .cycle .excerpt').css('display', 'none');\n\n\t/* --- Category filter --- */\n\tvar speed = 500;\n\tvar ease = 'easeOutQuart';\n\n\t$('#category_filter ul li a').click(function(){\n\t\tvar title = $(this).attr('title');\n\t\t$('#category_filter ul li').removeClass('active');\n\t\t$(this).parent('li').addClass('active');\n\t\t$('.portfolio .cycle .elem').each(function(){\n\t\t\tif(title == 'All') {\n\t\t\t\t$(this).removeClass('disable').animate({\n\t\t\t\t\t'opacity' : 1\n\t\t\t\t}, speed, ease);\n\t\t\t} else if(title == $(this).find('h4').text()) {\n\t\t\t\t$(this).removeClass('disable').animate({\n\t\t\t\t\t'opacity' : 1\n\t\t\t\t}, speed, ease);\n\t\t\t} else {\n\t\t\t\t$(this).addClass('disable').animate({\n\t\t\t\t\t'opacity' : 0.1\n\t\t\t\t}, speed, ease);\n\t\t\t}\n\t\t});\n\t});\n}","title":""},{"docid":"70ed640b52adcf94ff437c2220f7cfc0","score":"0.4735847","text":"constructor(scope, id, props) {\n super(scope, id, { type: CfnPortfolioPrincipalAssociation.CFN_RESOURCE_TYPE_NAME, properties: props });\n try {\n jsiiDeprecationWarnings.aws_cdk_lib_aws_servicecatalog_CfnPortfolioPrincipalAssociationProps(props);\n }\n catch (error) {\n if (process.env.JSII_DEBUG !== \"1\" && error.name === \"DeprecationError\") {\n Error.captureStackTrace(error, CfnPortfolioPrincipalAssociation);\n }\n throw error;\n }\n cdk.requireProperty(props, 'portfolioId', this);\n cdk.requireProperty(props, 'principalArn', this);\n cdk.requireProperty(props, 'principalType', this);\n this.portfolioId = props.portfolioId;\n this.principalArn = props.principalArn;\n this.principalType = props.principalType;\n this.acceptLanguage = props.acceptLanguage;\n }","title":""},{"docid":"5fccf2a15b6aa7f3604f23beb587b138","score":"0.47329685","text":"function portfolioToHTML( portfolio ){\n \t\t\t\n\t\t\tvar $portfolio = $('<div/>');\n\t\t\tvar $preload = $('<div class=\"preload\" />');\n\t\t\t$preload.html('loading images');\n\t\t\t$portfolio.append($preload);\n\t\t\t\n\t\t\t$portfolio.addClass(\"portfolio\");\n\t\t\t$portfolio.attr(\"id\",portfolio.id);\n\t\t\t$portfolio.attr(\"name\",portfolio.name);\n\t\t\t$portfolio.css(\"background-color\",portfolio.bgColor);\n\t\t\t$portfolio.css(\"height\",portfolio.height ? portfolio.height : cam.height);\n\t\t\t$portfolio.css(\"width\",portfolio.width ? portfolio.width : cam.width);\n\t\t\t\n\t\t\treturn $portfolio;\n\t\t\n \t\t}","title":""},{"docid":"7ae9f6bcee3e7ba581d32ea5848f4296","score":"0.47208723","text":"constructor(name, price, year){ //metodo contructor\n this.name= name;\n this.price= price;\n this.year= year;\n }","title":""},{"docid":"4549393a1619f32aa6f5009f705dbf72","score":"0.47169143","text":"function Cart() {\n this.items = [];\n this.currentindex = 0;\n this.total = 0;\n this.active = {};\n}","title":""},{"docid":"06de424a30ac709d1a5085d0e693b6b3","score":"0.4714786","text":"function getPortfolio() {\r\n spinner.show();\r\n return new Promise((resolve, reject) => {\r\n $.getJSON(\"portfolio.json\")\r\n .done(function (json) {\r\n spinner.hide();\r\n resolve(json);\r\n })\r\n .fail(function () {\r\n spinner.hide();\r\n reject(alert(`Failed to fetch user's portfolio`));\r\n });\r\n });\r\n }","title":""},{"docid":"d51d30c2d57a4994673927dcc29b7400","score":"0.47062087","text":"function getUserPortfolio(date = new Date().getTime()) {\n // get all of user's transactions\n return (async () => {\n const currentUser = await getCurrentUser();\n const transactions = currentUser.transactions;\n\n // loop through and aggregate data on stocks user owns, # of shares, cost basis, unrealized gains/ losses, % gain/ loss\n var transaction_length = transactions.length;\n var n = 0;\n var portfolio = {};\n for (n = 0; n < transaction_length; n++) {\n if (transactions[n]) {\n if (transactions[n].purchase_date <= date) {\n if (transactions[n].symbol in portfolio) {\n var quantity = transactions[n].num_shares;\n var cost = transactions[n].price * quantity;\n portfolio[transactions[n].symbol].quantity += quantity;\n portfolio[transactions[n].symbol].cost_basis += cost;\n } else {\n if (transactions[n].symbol != \"\") {\n const ticker = transactions[n].symbol;\n var quantity = transactions[n].num_shares;\n var cost = transactions[n].price * quantity;\n portfolio[ticker] = {\n quantity: quantity,\n cost_basis: cost,\n current_value: 0,\n gain: 0,\n return: 0,\n };\n }\n }\n }\n }\n }\n return portfolio;\n })();\n // auto-refresh the user account table after the account is made\n}","title":""},{"docid":"1e1db079bb4ee838351cd9f7c94340b0","score":"0.4704433","text":"function Store(name, minCustPerHour, maxCustPerHour, avgCookieSales){\n this.name = name;\n this.minCustPerHour = minCustPerHour;\n this.maxCustPerHour = maxCustPerHour;\n this.avgCookieSales = avgCookieSales;\n this.numOfCookiesProjection = [];\n stores.push(this);\n}","title":""},{"docid":"6a6de28c9d555f9eab01ebacd3918bbb","score":"0.46929225","text":"function createChart() {\n\n\t\t\t\t$('#highcharts-container').highcharts('StockChart', {\n\t\t\t\t\tchart: {\n\t\t\t\t\t},\n\t\t\t\t\t\n\t\t\t\t\trangeSelector: {\n\t\t\t\t\t\tselected: 4\n\t\t\t\t\t},\n\n\t\t\t\t\tyAxis: {\n\t\t\t\t\t\tlabels: {\n\t\t\t\t\t\t\tformatter: function() {\n\t\t\t\t\t\t\t\treturn (this.value > 0 ? '' : '') + this.value + ' USD / MMBtu';\n\t\t\t\t\t\t\t\t//return (this.value > 0 ? '+' : '') + this.value + '%';\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t},\n\t\t\t\t\t\tplotLines: [{\n\t\t\t\t\t\t\tvalue: 0,\n\t\t\t\t\t\t\twidth: 2,\n\t\t\t\t\t\t\tcolor: 'silver'\n\t\t\t\t\t\t}]\n\t\t\t\t\t},\n\t\t\t\t\t\n\t\t\t\t\tlegend: {\n\t\t\t\t\t\tenabled: true\n\t\t\t\t\t},\n\t\t\t\t\t\n\t\t\t\t\tplotOptions: {\n\t\t\t\t\t\tseries: {\n\t\t\t\t\t\t\t//compare: 'percent',\n\t\t\t\t\t\t\tmarker: {\n\t\t\t\t\t\t\t\tenabled: false,\n\t\t\t\t\t\t\t\tstates: {\n\t\t\t\t\t\t\t\t\thover: {\n\t\t\t\t\t\t\t\t\t\tenabled: true,\n\t\t\t\t\t\t\t\t\t\tradius: 3\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t},\n\t\t\t\t\t\n\t\t\t\t\ttooltip: {\n\t\t\t\t\t\t//pointFormat: '<span style=\"color:{series.color}\">{series.name}</span>: <b>{point.y}</b> ({point.change}%)<br/>',\n\t\t\t\t\t\tpointFormat: '<span style=\"color:{series.color}\">{series.name}</span>: <b>{point.y}</b><br/>',\n\t\t\t\t\t\tvalueDecimals: 2\n\t\t\t\t\t},\n\t\t\t\t\t\n\t\t\t\t\tseries: seriesOptions\n\t\t\t\t});\n\t\t\t}","title":""},{"docid":"5640657b6a3089e6ab1649c40638e21a","score":"0.46912032","text":"function Projector(universeName, dbOptions) {\n // in the absence of establishing db references in funds and actors,\n // nulling that out in toJSON override and providing a custom \n // inflater to lokijs, i will just force singleton pattern for now\n singletonContinuum = this;\n\n\tthis.universeName = universeName;\n \n this.enums = {\n BalanceType: BalanceTypeEnum,\n FundClass: FundClassEnum,\n ActorPeriodicity: ActorPeriodicityEnum,\n ActivityType: ActivityTypeEnum\n };\n \n this.MAX_DATE = MAX_DATE;\n this.MIN_DATE = MIN_DATE;\n\n this.AddDate = AddDate;\n\n dbOptions.actors = { proto: Actor };\n dbOptions.funds = { proto: Fund };\n\n\tthis.db = new loki(universeName, dbOptions); \n\tthis.vol = null;\n\tthis.activities = this.db.anonym([]);\n}","title":""},{"docid":"a292d74d479a6ac3345e7198677693ba","score":"0.46851695","text":"function getDetailedStockPortfolioData (arrayOfStockNames) {\n\n // var promiseToGetPortfolioData = new Parse.Promise();\n\n // Builds the Yahoo Stock API url for the JSON call\n var returnedURL = buildStockPortfolioURL(arrayOfStockNames);\n\n // This array will hold the final data to return to the client\n var arrayOfStockData = [];\n\n return new Promise(function(resolve, reject) {\n\n request({\n url: returnedURL,\n json: true\n }, function (error, response, returnedData) {\n\n if (!error && response.statusCode === 200) {\n\n var portfolioData = returnedData.query.results.quote\n\n // Filters out unnecesary information from JSON request for each stock in portfolio\n for (i = 0; i < portfolioData.length; i++) {\n\n var stockData = formatDetailedStockData(portfolioData[i]);\n arrayOfStockData[i] = stockData;\n }\n\n resolve (arrayOfStockData);\n\n } else {\n\n reject (error)\n }\n })\n });\n}","title":""},{"docid":"3a9de0d094b7568ba5a0fa32b0802d10","score":"0.46851173","text":"function Product(name, supplier, sku, priceObj, colors, sizes, financing, link) {\n this.Name = name;\n this.Supplier = supplier;\n this.SKU = sku;\n this.Pricing = priceObj;\n this.Colors = colors;\n this.Sizes = sizes;\n this.Financing = financing;\n this.Link = link;\n this.SearchDate = moment().format('MMMM Do YYYY');\n}","title":""},{"docid":"718b25a8ee9dafd33108ba0eabf1cf46","score":"0.4681373","text":"function Stockist(id, name, add1, add2, town, city, postcode, latitude, longitude) {\n this.id = id;\n this.name = name;\n this.address_line_one = add1;\n this.address_line_two = add2;\n this.town = town;\n this.city = city;\n this.postcode = postcode;\n this.latitude = latitude;\n this.longitude = longitude;\n this.latlng = new google.maps.LatLng(latitude, longitude);\n this.distance;\n this.distance_raw;\n this.duration;\n this.duration_raw;\n this.toString = function() {\n return \"id: \" + this.id + \" name: \" + this.name + \" latlng: \" + this.latlng.toUrlValue(2) + \" distance: \" + this.distance + \" (\" + this.distance_raw + \" meters) duration: \" + this.duration + \" (\" + this.duration_raw + \" secs)\";\n }\n}","title":""},{"docid":"5aea2d1bf181c770c47eca6ae6cf5b76","score":"0.46809337","text":"function Product(id,title,size,color,designId,price,url,quantity,inStock){\n\t//this.id = id,\n\tthis.title = title,\n\tthis.size = size,\n\tthis.color = color,\n\tthis.designId = designId,\n\tthis.price = price,\n\tthis.url = url,\n\tthis.quantity = quantity,\n\t//this.inStock = function(){\n\t//\treturn this.quantity > 0;\n\t//},\n\tcart.push(this)\n\t//products.push(this)\n}","title":""},{"docid":"c6fd75aab79eff4eb0c663f72d328067","score":"0.46781132","text":"static fromPortfolioArn(scope, id, portfolioArn) {\n const arn = cdk.Stack.of(scope).splitArn(portfolioArn, cdk.ArnFormat.SLASH_RESOURCE_NAME);\n const portfolioId = arn.resourceName;\n if (!portfolioId) {\n throw new Error('Missing required Portfolio ID from Portfolio ARN: ' + portfolioArn);\n }\n class Import extends PortfolioBase {\n constructor() {\n super(...arguments);\n this.portfolioArn = portfolioArn;\n this.portfolioId = portfolioId;\n }\n generateUniqueHash(value) {\n return (0, util_1.hashValues)(this.portfolioArn, value);\n }\n }\n return new Import(scope, id, {\n environmentFromArn: portfolioArn,\n });\n }","title":""},{"docid":"44d162847bd310dd59c99e5f0f317bfa","score":"0.46752867","text":"function formatStockData (JSONdata) {\n\n var stock = {\n\n name: JSONdata.Name,\n symbol: JSONdata.Symbol,\n currentPrice: parseFloat(JSONdata.LastTradePriceOnly),\n priceChange: parseFloat(JSONdata.Change),\n priceChangeInPercent: parseFloat(JSONdata.ChangeinPercent)\n };\n\n return stock;\n}","title":""},{"docid":"9858dbd789096d34511ab493147767d1","score":"0.46749732","text":"function oSeries() {\n var oSeries = {\n // ARRAYS OF FOOTPRINTS\n aAllEquipment: [],\n aComputingEquipment: [],\n aWorkstation: [],\n aDesktop: [],\n aIntergated: [],\n aNotebook: [],\n // TOTAL FOOTPRINTS\n iComputingEquipment: 0,\n iWorkstation: 0,\n iDesktop: 0,\n iIntergated: 0,\n iNotebook: 0,\n totalFootprint: 0,\n // QUANTITY OF EQUIPMENT BY CATEGORY\n iQtyComputingEquipment: 0,\n iQtyWorkstation: 0,\n iQtyDesktop: 0,\n iQtyIntergated: 0,\n iQtyNotebook: 0,\n // FLAG\n loaded: false,\n\t\t// factors\n\t\tconversion_factor: 0,\n\t\tconversion_factor_unit: \"N/A\"\n };\n return oSeries;\n}","title":""},{"docid":"49de15ec48fe54b9a6cc9332900a406f","score":"0.46668193","text":"function displayStockData(stock) {\n\n // Changes top-level display data.\n let stockHeaderInfo = d3.select('#stock-header-info').html('');\n stockHeaderInfo.append('h1').attr('id','stockTitle').text(stock);\n let currentPrice = stockHeaderInfo.append('p');\n let shares;\n zwazStocks.forEach(s => {\n if (s.symbol === stock) {\n shares = s.shares;\n }\n })\n\n // Calls API for the selected stock.\n d3.json(`${finnhubBaseLink}api/v1/quote?symbol=${stock}&token=${finnhub_API_KEY}`).then(stockCall => {\n let stockObject = {\n 'symbol': stock,\n 'prices': {\n 'open': stockCall.o,\n 'current': stockCall.c,\n 'high': stockCall.h,\n 'low': stockCall.l,\n 'previousClose': stockCall.pc\n },\n 'date': toHumanDate(stockCall.t),\n }\n if (stockObject.prices.current === 0) {\n currentPrice.text('There was an issue retrieving data for this stock.')\n } else {\n currentPrice.text(`Current Price: $${stockObject.prices.current}`);\n let sharesOwned = stockHeaderInfo.append('p').text(`Shares: ${shares}`);\n let investedSum;\n investedSum = stockHeaderInfo.append('p').text(`Total Invested: $${(stockObject.prices.current * shares).toFixed(2)}`);\n }\n }).catch(error => {\n fourTwentyNine();\n })\n}","title":""},{"docid":"7320b4a7db0aa2083c29b78e0eb2a081","score":"0.46625555","text":"function PFMPieChart(defaultValues){\n\t\tvar privateState = {};\n\t\t\tprivateState.cashSpent = defaultValues?(defaultValues[\"cashSpent\"]?defaultValues[\"cashSpent\"]:null):null;\n\t\t\tprivateState.cateforyId = defaultValues?(defaultValues[\"cateforyId\"]?defaultValues[\"cateforyId\"]:null):null;\n\t\t\tprivateState.categoryName = defaultValues?(defaultValues[\"categoryName\"]?defaultValues[\"categoryName\"]:null):null;\n\t\t\tprivateState.errmsg = defaultValues?(defaultValues[\"errmsg\"]?defaultValues[\"errmsg\"]:null):null;\n\t\t\tprivateState.monthId = defaultValues?(defaultValues[\"monthId\"]?defaultValues[\"monthId\"]:null):null;\n\t\t\tprivateState.monthName = defaultValues?(defaultValues[\"monthName\"]?defaultValues[\"monthName\"]:null):null;\n\t\t\tprivateState.totalCashSpent = defaultValues?(defaultValues[\"totalCashSpent\"]?defaultValues[\"totalCashSpent\"]:null):null;\n\t\t\tprivateState.year = defaultValues?(defaultValues[\"year\"]?defaultValues[\"year\"]:null):null;\n\t\t//Using parent contructor to create other properties req. to kony sdk\t\n\t\t\tBaseModel.call(this);\n\n\t\t//Defining Getter/Setters\n\t\t\tObject.defineProperties(this,{\n\t\t\t\t\"cashSpent\" : {\n\t\t\t\t\tget : function(){return privateState.cashSpent},\n\t\t\t\t\tset : function(val){\n\t\t\t\t\t\tsetterFunctions['cashSpent'].call(this,val,privateState);\n\t\t\t\t\t},\n\t\t\t\t\tenumerable : true,\n\t\t\t\t},\n\t\t\t\t\"cateforyId\" : {\n\t\t\t\t\tget : function(){return privateState.cateforyId},\n\t\t\t\t\tset : function(val){\n\t\t\t\t\t\tsetterFunctions['cateforyId'].call(this,val,privateState);\n\t\t\t\t\t},\n\t\t\t\t\tenumerable : true,\n\t\t\t\t},\n\t\t\t\t\"categoryName\" : {\n\t\t\t\t\tget : function(){return privateState.categoryName},\n\t\t\t\t\tset : function(val){\n\t\t\t\t\t\tsetterFunctions['categoryName'].call(this,val,privateState);\n\t\t\t\t\t},\n\t\t\t\t\tenumerable : true,\n\t\t\t\t},\n\t\t\t\t\"errmsg\" : {\n\t\t\t\t\tget : function(){return privateState.errmsg},\n\t\t\t\t\tset : function(val){\n\t\t\t\t\t\tsetterFunctions['errmsg'].call(this,val,privateState);\n\t\t\t\t\t},\n\t\t\t\t\tenumerable : true,\n\t\t\t\t},\n\t\t\t\t\"monthId\" : {\n\t\t\t\t\tget : function(){return privateState.monthId},\n\t\t\t\t\tset : function(val){\n\t\t\t\t\t\tsetterFunctions['monthId'].call(this,val,privateState);\n\t\t\t\t\t},\n\t\t\t\t\tenumerable : true,\n\t\t\t\t},\n\t\t\t\t\"monthName\" : {\n\t\t\t\t\tget : function(){return privateState.monthName},\n\t\t\t\t\tset : function(val){\n\t\t\t\t\t\tsetterFunctions['monthName'].call(this,val,privateState);\n\t\t\t\t\t},\n\t\t\t\t\tenumerable : true,\n\t\t\t\t},\n\t\t\t\t\"totalCashSpent\" : {\n\t\t\t\t\tget : function(){return privateState.totalCashSpent},\n\t\t\t\t\tset : function(val){\n\t\t\t\t\t\tsetterFunctions['totalCashSpent'].call(this,val,privateState);\n\t\t\t\t\t},\n\t\t\t\t\tenumerable : true,\n\t\t\t\t},\n\t\t\t\t\"year\" : {\n\t\t\t\t\tget : function(){return privateState.year},\n\t\t\t\t\tset : function(val){\n\t\t\t\t\t\tsetterFunctions['year'].call(this,val,privateState);\n\t\t\t\t\t},\n\t\t\t\t\tenumerable : true,\n\t\t\t\t},\n\t\t\t});\n\n\t}","title":""},{"docid":"dee40723b4c6d86d7fc30ceb6543d41c","score":"0.46616706","text":"function Cart(salesTax, deliveryFee) {\n this.pizzas = [],\n this.subTotal = 0,\n this.salesTax = salesTax,\n this.totalTax = 0,\n this.deliveryFee = deliveryFee,\n this.totalPrice = 0\n}","title":""},{"docid":"def67baa240a05989fbe40590f8e66c1","score":"0.4660901","text":"function formatDetailedStockData (JSONdata) {\n\n var stock = {\n\n // Basic information\n name: JSONdata.Name,\n symbol: JSONdata.Symbol,\n\n // Price Data\n currentPrice: parseFloat(JSONdata.LastTradePriceOnly),\n priceChange: parseFloat(JSONdata.Change),\n priceChangeInPercent: parseFloat(JSONdata.ChangeinPercent),\n marketCap: JSONdata.MarketCapitalization, // Convert this into the appropriate double value PLZ\n\n // Stock Details\n openPrice: parseFloat(JSONdata.Open),\n previousClose: parseFloat(JSONdata.PreviousClose),\n daysLowPrice: parseFloat(JSONdata.DaysLow),\n daysHighPrice: parseFloat(JSONdata.DaysHigh),\n volume: parseFloat(JSONdata.Volume),\n averageVolume: parseFloat(JSONdata.AverageDailyVolume),\n fiftyTwoWeekHigh: parseFloat(JSONdata.YearHigh),\n fiftyTwoWeekLow: parseFloat(JSONdata.YearLow),\n shortRatio: parseFloat(JSONdata.ShortRatio),\n\n // Stock Metrics\n earningsPerShare: parseFloat(JSONdata.EarningsShare),\n dividend: parseFloat(JSONdata.DividendShare),\n dividendYield: parseFloat(JSONdata.DividendYield),\n priceToEarnings: parseFloat(JSONdata.PERatio),\n priceToSales: parseFloat(JSONdata.PriceSales),\n priceToBook: parseFloat(JSONdata.PriceBook)\n };\n\n return stock;\n}","title":""},{"docid":"680382f87e19ec992c2ed32d3c553ec1","score":"0.4660335","text":"render () {\n const {\n id,\n heading=null,\n byline=null,\n content=null,\n modifiers=[],\n flourishes=[],\n segments=[],\n style=\"default\",\n children=null,\n } = this.props\n\n let styleModifiers = modifiers\n styleModifiers.push(style)\n let portfolioClassModifiers = styleModifiers.map(\n modifier => \"portfolio--\" + modifier\n ).join(\" \")\n let visibleSegments = segments.filter(segment => segment.visible !== false)\n\n return (\n <section id={id} className={`portfolio ${ portfolioClassModifiers }`}>\n {flourishes ? flourishes.map((flourish, i) => <Flourish key={i} category={flourish}/>) : \"\"}\n <div className=\"portfolio__header\">\n {heading ? <Heading level={1} modifiers={byline ? [\"leader\"] : [\"major\"]}>{heading}</Heading> : \"\"}\n {byline ? <Heading level={0} modifiers={[\"major\"]}>{byline}</Heading> : \"\"}\n {content ? content.split(\"\\n\\n\").map((para, i) => <p key={i}>{para}</p>) : \"\"}\n {children}\n </div>\n <div className=\"portfolio__content\">\n {\n visibleSegments.map((segment, index) => (\n <PortfolioSegment key={index} {...segment}/>\n ))\n }\n <PortfolioSegment\n heading=\"Interested in working with us?\"\n content=\"Send us a message to find out how we could help with your project\"\n isInfoBox={true}\n />\n </div>\n </section>\n )\n }","title":""},{"docid":"e67d840d1e95fb995d6c1e8c50658ccd","score":"0.465805","text":"function showPortfolio(request) {\n\t\t//first set it to a number (-1 because items start at 0)\n\t\tvar item = mapPortfolioItem(request[1]);\n\t\t\n\t\t$pleftA.eq(item).each(function(){\n\t\t\t$(this).addClass('current');\n\t\t\tvar t = getPortfolioItemHtml(item);\n\t\t\tsetPortfolioItemHtml(t);\n\t\t});\n\t\t$pright.css('opacity',0);\n\n\t\t\n\t\t$pleftDiv.each(function(i) {\n\t\t\t$(this).delay(i*speed/3).animate({opacity: 1}, speed);\n\t\t});\n\t\tfadeInPortfolioItem(speed*2);\n\t\t\n\t}","title":""},{"docid":"6c25e5c90f5a932e9b68b8a8bf73d21b","score":"0.4657995","text":"function Company (name) {\n this.company = name;\n this.creator = hrEmployee;\n}","title":""},{"docid":"275bfc2935aad492e004447267c233be","score":"0.4656228","text":"function createAndPushProjects () {\n // let trivia = new BuildPortfolio(\"The Office Trivia Game\", \"images/portimages/trivia.png\", \"https://github.com/901david/TriviaGame\", \"https://901david.github.io/TriviaGame/\", \"This is a basic trivia game app focused around the hit comedy series - The Office. As you navigate through trivia questions enjoying the hilarious associated animated gifs and sound bites, you will see the quiz is designed to automatically move the user through the quiz using Javascript. At the conclusion of the quiz the user is given a 'grade' on how they did which is based on how many questions they get right and wrong in addition to how much time they take. Can you get an Expert grade?\", \"Html, Css, Javascript, JQuery\");\n let centennial = new BuildPortfolio(\"The Centennial Charge\",\"images/portimages/charge.png\", \"https://github.com/901david/centennialCharge\", \"https://901david.github.io/centennialCharge/\", \"This was a group project I worked on mainly backend for. The idea was to present ironic Colorado news articles and Colorado styled solutions. My work on this project included creating the live comment system that allows users to interact with each other within the site. This includes re-arranging the comments based on how many likes and dislikes they have received. In addition, I was responsible for using the Ny Times API which was accessed using Ajax calls and then displaying Colorado based 'real' news articles underneath our ironic false ones. Lastly, I assisted in assuring that the site was mobile responsive.\", \"Html, Css, Javascript, Ajax, Api's, Animate Css, Firebase, JQuery\");\n // let flashCardGen = new BuildPortfolio(\"Flash-Card Generator\", \"images/portimages/flashgen.png\", \"https://github.com/901david/Flashcard-Generator\", \"https://901david.github.io/Flashcard-Generator/\", \"This is a Node based app using constructor functions to create two types of flash cards. User is allowed to create any number of flash cards and once created has the ability to 'study' the group created afterwards.\", \"Node, Javascript, Inquirer NPM Package\");\n let bamazon = new BuildPortfolio(\"Bamazon App\", \"images/portimages/bamazon.png\", \"https://github.com/901david/bamazon\", \"https://901david.github.io/bamazon/\", \"This is a storefront Node App that allows you to use three separate interfaces: Customer, Manager & Supervisor mode. In each mode you accomplish different tasks in the database. The idea is in each of these interfaces the client is able to purchase items that are listed in the database which updates the database. In other modes you are able to add inventory and products and/or manage departments and total sales.\", \"Node, Javascript, Inquirer, CLI-Table, MySQL\");\n let flashCardFun = new BuildPortfolio(\"FlashCard Fun\", \"images/portimages/flashfun.png\", \"https://github.com/901david/Flashcard-Fun\", \"https://901david.github.io/Flashcard-Fun/\",\"The inspiration for FlashCard Fun was the Node app I created FlashCard Generator. This web app uses Firebase Authorization to allow users to create usernames. When signed in the user can keep a running tab of Flash Cards they have created to study from. The Flash Cards are also able to be broken down by groups which alllows for maintaining several different subjects you can study. Then you are able to review the cards you have created for studying purposes.\", \"Html, Bootstrap, Css, Animate Css, Firebase, Javascript, Photoshop, JQuery\");\n let starWars = new BuildPortfolio(\"Star Wars Battle\", \"images/portimages/starwars.png\",\"https://github.com/901david/star-wars-Battle\",\"https://901david.github.io/star-wars-Battle/\",\"This is a Star Wars based JQuery game. It allows a user to choose a character and then with that character they must defeat all the other available chracters to assure victory. May the force be with you!\", \"Html, Css, Javascript, JQuery\");\n let rockPapSciss = new BuildPortfolio(\"Rock Paper Scissors - Multiplayer\", \"images/portimages/RPS.png\", \"https://github.com/901david/RPS-Multiplayer\", \"https://901david.github.io/RPS-Multiplayer/\", \"This web application is a basic rock, paper, scissors game that uses Firebase to allow to users to play each other. It also has a chat feature to it which allows users to chat with each other while battling it out.\", \"Html, Css, JQuery, Javascript, Firebase\");\n let liriNode = new BuildPortfolio(\"'LIRI' - Node Application\", \"images/portimages/lirinode.png\", \"https://github.com/901david/liri-node-app\", \"https://github.com/901david/liri-node-app\", \"This is a node application that is a language knock off of the popular SIRI. LIRI takes commands as well through the terminal. Send tweets, look up sounds through spotify and search for movies. This is a fun application that shows you how easily node will integrate with API's to create a fun application\", \"Node, Javascript, Ajax, Twitter npm, Spotify npm\" );\n\n portfolioProjects.push(centennial, rockPapSciss, liriNode, flashCardFun,starWars, bamazon);\n}","title":""},{"docid":"2ae5ecfbfd1c455921f8bf4fe94e5465","score":"0.46538395","text":"function Package(data) {\n this.name = data.name;\n this.width = data.width;\n this.height = data.height;\n this.weight = data.weight;\n this.location = data.location;\n this.price = data.price;\n this.selector = data.selector;\n\n\n }","title":""},{"docid":"98839c50fb3717b5fcff3609baafc2b0","score":"0.46533993","text":"function CandlestickSeriesDataItem() {\n var _this = _super.call(this) || this;\n\n _this.values.lowValueX = {};\n _this.values.lowValueY = {};\n _this.values.highValueX = {};\n _this.values.highValueY = {};\n _this.className = \"CandlestickSeriesDataItem\";\n\n _this.applyTheme();\n\n return _this;\n }","title":""},{"docid":"aeedefe5050c050b98b0b793808269ab","score":"0.46533188","text":"function collectData()\n {\n var stocks = [];\n var $topNodes = $(\"#knowledge-finance-wholepage__financial-entities-list\").children();\n var count =0;\n for(var ii=0; ii < $topNodes.length; ++ii)\n {\n var $topNode = $($topNodes[ii]);\n var elList = $topNode.find('span:not(:has(*))');\n\n if(elList.length == 0)\n continue;\n \n //For NIFTY --> there is no currency. So length is 7 instead of default 8\n if(elList.length == 7)\n {\n elList.splice(2,0,'');\n }\n var symbol = DOMUtils.getDomText(elList[0]);\n var lastPriceEl = elList[1];\n var currency = DOMUtils.getDomText(elList[2]);\n var stockCode = DOMUtils.getDomText(elList[3]);\n var currentState = DOMUtils.getDomText(elList[4]); //Closed:\n var timeEl = elList[5];\n var changeEl = elList[6];\n var percentChangeEl = elList[7];\n stocks.push(new Stock(symbol, lastPriceEl, stockCode, currency, timeEl, changeEl, percentChangeEl));\n }\n //window.stocks = stocks;\n// console.log(stocks);\n return stocks;\n }","title":""},{"docid":"3ce8dbfee767f129c826e2760a5e135a","score":"0.4647267","text":"function Figure(type, color, img, index) {\n this.type = type;\n this.color = color;\n this.img = img;\n if (index) this.index = index;\n}","title":""},{"docid":"636cff64c346092c4755800dc47033e0","score":"0.4631451","text":"function refreshPortfolio() {\n reloadPortfolio = true;\n loadPortfolio();\n }","title":""}],"string":"[\n {\n \"docid\": \"eb1ee5d98dace17b357601e37e74999b\",\n \"score\": \"0.6714322\",\n \"text\": \"function Stock(symbol){\\n // this.name = name;\\n this.symbol = symbol;\\n this.numShares = 0;\\n this.data = this.lookupStock();\\n this.name = name;\\n this.price = price;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6498e2efaad7a4cf413f7876e1e3c6fa\",\n \"score\": \"0.6539987\",\n \"text\": \"function Stock(symbol, price, shares) {\\n this.symbol = symbol;\\n this.price = price;\\n this.shares = shares;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80ce368aa7662f9439945512b2d30278\",\n \"score\": \"0.62731886\",\n \"text\": \"function Portfolio(defaultValues) {\\n var privateState = {};\\n context[\\\"field\\\"] = \\\"portfolioId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"portfolioId\\\"] : null);\\n privateState.portfolioId = defaultValues ?\\n (defaultValues[\\\"portfolioId\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"portfolioId\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"description\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"description\\\"] : null);\\n privateState.description = defaultValues ?\\n (defaultValues[\\\"description\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"description\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"holdingsType\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"holdingsType\\\"] : null);\\n privateState.holdingsType = defaultValues ?\\n (defaultValues[\\\"holdingsType\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"holdingsType\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"quantity\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"quantity\\\"] : null);\\n privateState.quantity = defaultValues ?\\n (defaultValues[\\\"quantity\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"quantity\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"marketPrice\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"marketPrice\\\"] : null);\\n privateState.marketPrice = defaultValues ?\\n (defaultValues[\\\"marketPrice\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"marketPrice\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"costPrice\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"costPrice\\\"] : null);\\n privateState.costPrice = defaultValues ?\\n (defaultValues[\\\"costPrice\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"costPrice\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"marketValue\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"marketValue\\\"] : null);\\n privateState.marketValue = defaultValues ?\\n (defaultValues[\\\"marketValue\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"marketValue\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"unrealPLMkt\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"unrealPLMkt\\\"] : null);\\n privateState.unrealPLMkt = defaultValues ?\\n (defaultValues[\\\"unrealPLMkt\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"unrealPLMkt\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"secCCy\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"secCCy\\\"] : null);\\n privateState.secCCy = defaultValues ?\\n (defaultValues[\\\"secCCy\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"secCCy\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"navPage\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"navPage\\\"] : null);\\n privateState.navPage = defaultValues ?\\n (defaultValues[\\\"navPage\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"navPage\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"ISIN\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"ISIN\\\"] : null);\\n privateState.ISIN = defaultValues ?\\n (defaultValues[\\\"ISIN\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"ISIN\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"sortBy\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"sortBy\\\"] : null);\\n privateState.sortBy = defaultValues ?\\n (defaultValues[\\\"sortBy\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"sortBy\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"searchByInstrumentName\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"searchByInstrumentName\\\"] : null);\\n privateState.searchByInstrumentName = defaultValues ?\\n (defaultValues[\\\"searchByInstrumentName\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"searchByInstrumentName\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"holdingsId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"holdingsId\\\"] : null);\\n privateState.holdingsId = defaultValues ?\\n (defaultValues[\\\"holdingsId\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"holdingsId\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"transactionId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"transactionId\\\"] : null);\\n privateState.transactionId = defaultValues ?\\n (defaultValues[\\\"transactionId\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"transactionId\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"orderType\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"orderType\\\"] : null);\\n privateState.orderType = defaultValues ?\\n (defaultValues[\\\"orderType\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"orderType\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"exchangeRate\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"exchangeRate\\\"] : null);\\n privateState.exchangeRate = defaultValues ?\\n (defaultValues[\\\"exchangeRate\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"exchangeRate\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"limitPrice\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"limitPrice\\\"] : null);\\n privateState.limitPrice = defaultValues ?\\n (defaultValues[\\\"limitPrice\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"limitPrice\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"netAmount\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"netAmount\\\"] : null);\\n privateState.netAmount = defaultValues ?\\n (defaultValues[\\\"netAmount\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"netAmount\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"tradeDate\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"tradeDate\\\"] : null);\\n privateState.tradeDate = defaultValues ?\\n (defaultValues[\\\"tradeDate\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"tradeDate\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"fees\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"fees\\\"] : null);\\n privateState.fees = defaultValues ?\\n (defaultValues[\\\"fees\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"fees\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"valueDate\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"valueDate\\\"] : null);\\n privateState.valueDate = defaultValues ?\\n (defaultValues[\\\"valueDate\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"valueDate\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"referenceCurrency\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"referenceCurrency\\\"] : null);\\n privateState.referenceCurrency = defaultValues ?\\n (defaultValues[\\\"referenceCurrency\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"referenceCurrency\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"startDate\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"startDate\\\"] : null);\\n privateState.startDate = defaultValues ?\\n (defaultValues[\\\"startDate\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"startDate\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"endDate\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"endDate\\\"] : null);\\n privateState.endDate = defaultValues ?\\n (defaultValues[\\\"endDate\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"endDate\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"instrumentId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"instrumentId\\\"] : null);\\n privateState.instrumentId = defaultValues ?\\n (defaultValues[\\\"instrumentId\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"instrumentId\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"RICCode\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"RICCode\\\"] : null);\\n privateState.RICCode = defaultValues ?\\n (defaultValues[\\\"RICCode\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"RICCode\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"customerId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"customerId\\\"] : null);\\n privateState.customerId = defaultValues ?\\n (defaultValues[\\\"customerId\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"customerId\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"instrumentCurrency\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"instrumentCurrency\\\"] : null);\\n privateState.instrumentCurrency = defaultValues ?\\n (defaultValues[\\\"instrumentCurrency\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"instrumentCurrency\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"instrumentAmount\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"instrumentAmount\\\"] : null);\\n privateState.instrumentAmount = defaultValues ?\\n (defaultValues[\\\"instrumentAmount\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"instrumentAmount\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"total\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"total\\\"] : null);\\n privateState.total = defaultValues ?\\n (defaultValues[\\\"total\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"total\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"sortType\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"sortType\\\"] : null);\\n privateState.sortType = defaultValues ?\\n (defaultValues[\\\"sortType\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"sortType\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"userId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"userId\\\"] : null);\\n privateState.userId = defaultValues ?\\n (defaultValues[\\\"userId\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"userId\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"fieldOrder\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"fieldOrder\\\"] : null);\\n privateState.fieldOrder = defaultValues ?\\n (defaultValues[\\\"fieldOrder\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"fieldOrder\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"limit\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"limit\\\"] : null);\\n privateState.limit = defaultValues ?\\n (defaultValues[\\\"limit\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"limit\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"offset\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"offset\\\"] : null);\\n privateState.offset = defaultValues ?\\n (defaultValues[\\\"offset\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"offset\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"sortOrder\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"sortOrder\\\"] : null);\\n privateState.sortOrder = defaultValues ?\\n (defaultValues[\\\"sortOrder\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"sortOrder\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"pageSize\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"pageSize\\\"] : null);\\n privateState.pageSize = defaultValues ?\\n (defaultValues[\\\"pageSize\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"pageSize\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"pageOffset\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"pageOffset\\\"] : null);\\n privateState.pageOffset = defaultValues ?\\n (defaultValues[\\\"pageOffset\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"pageOffset\\\"], context) :\\n null) :\\n null;\\n\\n context[\\\"field\\\"] = \\\"accountIds\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"accountIds\\\"] : null);\\n privateState.accountIds = defaultValues ?\\n (defaultValues[\\\"accountIds\\\"] ?\\n kony.mvc.util.ProcessorUtils.applyFunction(preProcessorCallback, defaultValues[\\\"accountIds\\\"], context) :\\n null) :\\n null;\\n\\n\\n //Using parent constructor to create other properties req. to kony sdk\\n BaseModel.call(this);\\n\\n //Defining Getter/Setters\\n Object.defineProperties(this, {\\n \\\"portfolioId\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"portfolioId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"portfolioId\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.portfolioId, context);\\n },\\n set: function(val) {\\n setterFunctions['portfolioId'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"description\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"description\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"description\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.description, context);\\n },\\n set: function(val) {\\n setterFunctions['description'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"holdingsType\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"holdingsType\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"holdingsType\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.holdingsType, context);\\n },\\n set: function(val) {\\n setterFunctions['holdingsType'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"quantity\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"quantity\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"quantity\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.quantity, context);\\n },\\n set: function(val) {\\n setterFunctions['quantity'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"marketPrice\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"marketPrice\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"marketPrice\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.marketPrice, context);\\n },\\n set: function(val) {\\n setterFunctions['marketPrice'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"costPrice\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"costPrice\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"costPrice\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.costPrice, context);\\n },\\n set: function(val) {\\n setterFunctions['costPrice'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"marketValue\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"marketValue\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"marketValue\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.marketValue, context);\\n },\\n set: function(val) {\\n setterFunctions['marketValue'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"unrealPLMkt\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"unrealPLMkt\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"unrealPLMkt\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.unrealPLMkt, context);\\n },\\n set: function(val) {\\n setterFunctions['unrealPLMkt'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"secCCy\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"secCCy\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"secCCy\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.secCCy, context);\\n },\\n set: function(val) {\\n setterFunctions['secCCy'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"navPage\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"navPage\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"navPage\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.navPage, context);\\n },\\n set: function(val) {\\n setterFunctions['navPage'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"ISIN\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"ISIN\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"ISIN\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.ISIN, context);\\n },\\n set: function(val) {\\n setterFunctions['ISIN'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"sortBy\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"sortBy\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"sortBy\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.sortBy, context);\\n },\\n set: function(val) {\\n setterFunctions['sortBy'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"searchByInstrumentName\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"searchByInstrumentName\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"searchByInstrumentName\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.searchByInstrumentName, context);\\n },\\n set: function(val) {\\n setterFunctions['searchByInstrumentName'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"holdingsId\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"holdingsId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"holdingsId\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.holdingsId, context);\\n },\\n set: function(val) {\\n setterFunctions['holdingsId'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"transactionId\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"transactionId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"transactionId\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.transactionId, context);\\n },\\n set: function(val) {\\n setterFunctions['transactionId'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"orderType\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"orderType\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"orderType\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.orderType, context);\\n },\\n set: function(val) {\\n setterFunctions['orderType'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"exchangeRate\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"exchangeRate\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"exchangeRate\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.exchangeRate, context);\\n },\\n set: function(val) {\\n setterFunctions['exchangeRate'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"limitPrice\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"limitPrice\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"limitPrice\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.limitPrice, context);\\n },\\n set: function(val) {\\n setterFunctions['limitPrice'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"netAmount\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"netAmount\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"netAmount\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.netAmount, context);\\n },\\n set: function(val) {\\n setterFunctions['netAmount'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"tradeDate\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"tradeDate\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"tradeDate\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.tradeDate, context);\\n },\\n set: function(val) {\\n setterFunctions['tradeDate'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"fees\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"fees\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"fees\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.fees, context);\\n },\\n set: function(val) {\\n setterFunctions['fees'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"valueDate\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"valueDate\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"valueDate\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.valueDate, context);\\n },\\n set: function(val) {\\n setterFunctions['valueDate'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"referenceCurrency\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"referenceCurrency\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"referenceCurrency\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.referenceCurrency, context);\\n },\\n set: function(val) {\\n setterFunctions['referenceCurrency'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"startDate\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"startDate\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"startDate\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.startDate, context);\\n },\\n set: function(val) {\\n setterFunctions['startDate'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"endDate\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"endDate\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"endDate\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.endDate, context);\\n },\\n set: function(val) {\\n setterFunctions['endDate'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"instrumentId\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"instrumentId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"instrumentId\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.instrumentId, context);\\n },\\n set: function(val) {\\n setterFunctions['instrumentId'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"RICCode\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"RICCode\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"RICCode\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.RICCode, context);\\n },\\n set: function(val) {\\n setterFunctions['RICCode'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"customerId\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"customerId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"customerId\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.customerId, context);\\n },\\n set: function(val) {\\n setterFunctions['customerId'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"instrumentCurrency\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"instrumentCurrency\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"instrumentCurrency\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.instrumentCurrency, context);\\n },\\n set: function(val) {\\n setterFunctions['instrumentCurrency'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"instrumentAmount\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"instrumentAmount\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"instrumentAmount\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.instrumentAmount, context);\\n },\\n set: function(val) {\\n setterFunctions['instrumentAmount'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"total\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"total\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"total\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.total, context);\\n },\\n set: function(val) {\\n setterFunctions['total'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"sortType\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"sortType\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"sortType\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.sortType, context);\\n },\\n set: function(val) {\\n setterFunctions['sortType'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"userId\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"userId\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"userId\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.userId, context);\\n },\\n set: function(val) {\\n setterFunctions['userId'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"fieldOrder\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"fieldOrder\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"fieldOrder\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.fieldOrder, context);\\n },\\n set: function(val) {\\n setterFunctions['fieldOrder'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"limit\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"limit\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"limit\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.limit, context);\\n },\\n set: function(val) {\\n setterFunctions['limit'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"offset\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"offset\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"offset\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.offset, context);\\n },\\n set: function(val) {\\n setterFunctions['offset'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"sortOrder\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"sortOrder\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"sortOrder\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.sortOrder, context);\\n },\\n set: function(val) {\\n setterFunctions['sortOrder'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"pageSize\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"pageSize\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"pageSize\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.pageSize, context);\\n },\\n set: function(val) {\\n setterFunctions['pageSize'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"pageOffset\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"pageOffset\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"pageOffset\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.pageOffset, context);\\n },\\n set: function(val) {\\n setterFunctions['pageOffset'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n \\\"accountIds\\\": {\\n get: function() {\\n context[\\\"field\\\"] = \\\"accountIds\\\";\\n context[\\\"metadata\\\"] = (objectMetadata ? objectMetadata[\\\"accountIds\\\"] : null);\\n return kony.mvc.util.ProcessorUtils.applyFunction(postProcessorCallback, privateState.accountIds, context);\\n },\\n set: function(val) {\\n setterFunctions['accountIds'].call(this, val, privateState);\\n },\\n enumerable: true,\\n },\\n });\\n\\n //converts model object to json object.\\n this.toJsonInternal = function() {\\n return Object.assign({}, privateState);\\n };\\n\\n //overwrites object state with provided json value in argument.\\n this.fromJsonInternal = function(value) {\\n privateState.portfolioId = value ? (value[\\\"portfolioId\\\"] ? value[\\\"portfolioId\\\"] : null) : null;\\n privateState.description = value ? (value[\\\"description\\\"] ? value[\\\"description\\\"] : null) : null;\\n privateState.holdingsType = value ? (value[\\\"holdingsType\\\"] ? value[\\\"holdingsType\\\"] : null) : null;\\n privateState.quantity = value ? (value[\\\"quantity\\\"] ? value[\\\"quantity\\\"] : null) : null;\\n privateState.marketPrice = value ? (value[\\\"marketPrice\\\"] ? value[\\\"marketPrice\\\"] : null) : null;\\n privateState.costPrice = value ? (value[\\\"costPrice\\\"] ? value[\\\"costPrice\\\"] : null) : null;\\n privateState.marketValue = value ? (value[\\\"marketValue\\\"] ? value[\\\"marketValue\\\"] : null) : null;\\n privateState.unrealPLMkt = value ? (value[\\\"unrealPLMkt\\\"] ? value[\\\"unrealPLMkt\\\"] : null) : null;\\n privateState.secCCy = value ? (value[\\\"secCCy\\\"] ? value[\\\"secCCy\\\"] : null) : null;\\n privateState.navPage = value ? (value[\\\"navPage\\\"] ? value[\\\"navPage\\\"] : null) : null;\\n privateState.ISIN = value ? (value[\\\"ISIN\\\"] ? value[\\\"ISIN\\\"] : null) : null;\\n privateState.sortBy = value ? (value[\\\"sortBy\\\"] ? value[\\\"sortBy\\\"] : null) : null;\\n privateState.searchByInstrumentName = value ? (value[\\\"searchByInstrumentName\\\"] ? value[\\\"searchByInstrumentName\\\"] : null) : null;\\n privateState.holdingsId = value ? (value[\\\"holdingsId\\\"] ? value[\\\"holdingsId\\\"] : null) : null;\\n privateState.transactionId = value ? (value[\\\"transactionId\\\"] ? value[\\\"transactionId\\\"] : null) : null;\\n privateState.orderType = value ? (value[\\\"orderType\\\"] ? value[\\\"orderType\\\"] : null) : null;\\n privateState.exchangeRate = value ? (value[\\\"exchangeRate\\\"] ? value[\\\"exchangeRate\\\"] : null) : null;\\n privateState.limitPrice = value ? (value[\\\"limitPrice\\\"] ? value[\\\"limitPrice\\\"] : null) : null;\\n privateState.netAmount = value ? (value[\\\"netAmount\\\"] ? value[\\\"netAmount\\\"] : null) : null;\\n privateState.tradeDate = value ? (value[\\\"tradeDate\\\"] ? value[\\\"tradeDate\\\"] : null) : null;\\n privateState.fees = value ? (value[\\\"fees\\\"] ? value[\\\"fees\\\"] : null) : null;\\n privateState.valueDate = value ? (value[\\\"valueDate\\\"] ? value[\\\"valueDate\\\"] : null) : null;\\n privateState.referenceCurrency = value ? (value[\\\"referenceCurrency\\\"] ? value[\\\"referenceCurrency\\\"] : null) : null;\\n privateState.startDate = value ? (value[\\\"startDate\\\"] ? value[\\\"startDate\\\"] : null) : null;\\n privateState.endDate = value ? (value[\\\"endDate\\\"] ? value[\\\"endDate\\\"] : null) : null;\\n privateState.instrumentId = value ? (value[\\\"instrumentId\\\"] ? value[\\\"instrumentId\\\"] : null) : null;\\n privateState.RICCode = value ? (value[\\\"RICCode\\\"] ? value[\\\"RICCode\\\"] : null) : null;\\n privateState.customerId = value ? (value[\\\"customerId\\\"] ? value[\\\"customerId\\\"] : null) : null;\\n privateState.instrumentCurrency = value ? (value[\\\"instrumentCurrency\\\"] ? value[\\\"instrumentCurrency\\\"] : null) : null;\\n privateState.instrumentAmount = value ? (value[\\\"instrumentAmount\\\"] ? value[\\\"instrumentAmount\\\"] : null) : null;\\n privateState.total = value ? (value[\\\"total\\\"] ? value[\\\"total\\\"] : null) : null;\\n privateState.sortType = value ? (value[\\\"sortType\\\"] ? value[\\\"sortType\\\"] : null) : null;\\n privateState.userId = value ? (value[\\\"userId\\\"] ? value[\\\"userId\\\"] : null) : null;\\n privateState.fieldOrder = value ? (value[\\\"fieldOrder\\\"] ? value[\\\"fieldOrder\\\"] : null) : null;\\n privateState.limit = value ? (value[\\\"limit\\\"] ? value[\\\"limit\\\"] : null) : null;\\n privateState.offset = value ? (value[\\\"offset\\\"] ? value[\\\"offset\\\"] : null) : null;\\n privateState.sortOrder = value ? (value[\\\"sortOrder\\\"] ? value[\\\"sortOrder\\\"] : null) : null;\\n privateState.pageSize = value ? (value[\\\"pageSize\\\"] ? value[\\\"pageSize\\\"] : null) : null;\\n privateState.pageOffset = value ? (value[\\\"pageOffset\\\"] ? value[\\\"pageOffset\\\"] : null) : null;\\n privateState.accountIds = value ? (value[\\\"accountIds\\\"] ? value[\\\"accountIds\\\"] : null) : null;\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cea8fef18aef67ff08afaa4ba8e5a902\",\n \"score\": \"0.624087\",\n \"text\": \"constructor(scope, id, props) {\\n super(scope, id, { type: CfnPortfolio.CFN_RESOURCE_TYPE_NAME, properties: props });\\n try {\\n jsiiDeprecationWarnings.aws_cdk_lib_aws_servicecatalog_CfnPortfolioProps(props);\\n }\\n catch (error) {\\n if (process.env.JSII_DEBUG !== \\\"1\\\" && error.name === \\\"DeprecationError\\\") {\\n Error.captureStackTrace(error, CfnPortfolio);\\n }\\n throw error;\\n }\\n cdk.requireProperty(props, 'displayName', this);\\n cdk.requireProperty(props, 'providerName', this);\\n this.attrPortfolioName = cdk.Token.asString(this.getAtt('PortfolioName', cdk.ResolutionTypeHint.STRING));\\n this.displayName = props.displayName;\\n this.providerName = props.providerName;\\n this.acceptLanguage = props.acceptLanguage;\\n this.description = props.description;\\n this.tags = new cdk.TagManager(cdk.TagType.STANDARD, \\\"AWS::ServiceCatalog::Portfolio\\\", props.tags, { tagPropertyName: 'tags' });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd6d60c5e3b2257e9947e7f9742553a6\",\n \"score\": \"0.6208182\",\n \"text\": \"constructor(name, stock) {\\n this.name = name;\\n this.stock = stock;\\n this.revenue = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bb62089ad3777c6c926201ca1648df8\",\n \"score\": \"0.60977584\",\n \"text\": \"function Project (portfolioDataObj) {\\n this.name = portfolioDataObj.name;\\n this.link = portfolioDataObj.link;\\n this.description = portfolioDataObj.description;\\n this.image = 'images/' + portfolioDataObj.image;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb50477cd42456141feed83b440bc9f4\",\n \"score\": \"0.59967226\",\n \"text\": \"function Portfolio (opts) {\\n Object.keys(opts).forEach(function(e, index, keys) {\\n this[e] = opts[e];\\n },this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"315b1f0a90a30f70b299b3f788ec84cd\",\n \"score\": \"0.59666336\",\n \"text\": \"function BuildPortfolio (projectTitle, image, githublink, liveSite, description, technology) {\\n this.title = projectTitle;\\n this.imagePath = image;\\n this.gitLink = githublink;\\n this.gitSite = liveSite;\\n this.description = description;\\n this.technology = technology;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14203d6cc51e4c4943580d64ea143b35\",\n \"score\": \"0.5834694\",\n \"text\": \"function Stockitem()\\n {\\n this.type = 'stockpile';\\n this.name = 'Unknown';\\n this.attack = 0;\\n this.defense = 0;\\n this.upkeep = 0;\\n this.price = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70a9213e03eda7a0c2a73f82be103c3e\",\n \"score\": \"0.5686634\",\n \"text\": \"function StockChart(options, element) {\\n var _this = _super.call(this, options, element) || this;\\n /** @private */\\n _this.isSingleAxis = false;\\n _this.chartid = 57723;\\n /** @private */\\n _this.tempDataSource = [];\\n /** @private */\\n _this.blazorDataSource = [];\\n /** @private */\\n _this.tempSeriesType = [];\\n /** private */\\n _this.zoomChange = false;\\n /** @private */\\n _this.allowPan = false;\\n /** @private */\\n _this.onPanning = false;\\n /** @private */\\n _this.trendlinetriggered = true;\\n /** @private */\\n _this.toolbarHeight = _this.enablePeriodSelector ? (Browser.isDevice ? 56 : 42) : 0;\\n /** @private */\\n _this.initialRender = true;\\n return _this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46ee24c7b5f65102c37a1f0d968e4305\",\n \"score\": \"0.5678524\",\n \"text\": \"function getStock() {\\n return {\\n symbol: 'NLSN',\\n price: 100,\\n country: 'KEN',\\n exchange: {\\n name: 'NASDAQ',\\n tradingHours: '9AM',\\n },\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4c581fafb776d07f1734eafc643ed42\",\n \"score\": \"0.5659926\",\n \"text\": \"function Cookie(name, regularPrice, holidayPrice) {\\n this.name = name;\\n this.prices = [regularPrice, holidayPrice];\\n this.prices = this.prices.map(a => a.toFixed(2));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cacd1858b5d9e2fc27e19a497fab3b61\",\n \"score\": \"0.564082\",\n \"text\": \"constructor(scope, id, props) {\\n super(scope, id, { type: CfnPortfolioShare.CFN_RESOURCE_TYPE_NAME, properties: props });\\n try {\\n jsiiDeprecationWarnings.aws_cdk_lib_aws_servicecatalog_CfnPortfolioShareProps(props);\\n }\\n catch (error) {\\n if (process.env.JSII_DEBUG !== \\\"1\\\" && error.name === \\\"DeprecationError\\\") {\\n Error.captureStackTrace(error, CfnPortfolioShare);\\n }\\n throw error;\\n }\\n cdk.requireProperty(props, 'accountId', this);\\n cdk.requireProperty(props, 'portfolioId', this);\\n this.accountId = props.accountId;\\n this.portfolioId = props.portfolioId;\\n this.acceptLanguage = props.acceptLanguage;\\n this.shareTagOptions = props.shareTagOptions;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae9824fe5496f7bec122c6e155df9ad7\",\n \"score\": \"0.56323653\",\n \"text\": \"addPortfolio() {\\n if (Object.keys(this.state.jsPortfolios).length >= 10) {\\n alert(\\\"You can only have 10 portfolios\\\");\\n return;\\n }\\n var name = prompt(\\\"Pick a name for the portfolio.\\\");\\n if (name === null || name.trim() === \\\"\\\") {\\n alert(\\\"The name cannot be empty.\\\");\\n }\\n else {\\n //Get current list of portfolios, push this new portfolio to it and update the state and local storage.\\n let portfolios = this.state.portfolios;\\n let jsPortfolios = this.state.jsPortfolios;\\n if (jsPortfolios === undefined) {\\n jsPortfolios = {};\\n }\\n let state = this.state;\\n let id = getGuid();\\n let stocks = {};\\n portfolios.push(<Portfolio key={id}\\n id={id}\\n name={name}\\n setGraphApp={this.setGraph.bind(this)}\\n updatePortfolio={this.updatePortfolio.bind(this)}\\n deletePortfolio={this.deletePortfolio.bind(this)}\\n setPrompt={this.setPrompt.bind(this)}\\n />);\\n state.portfolios = portfolios;\\n jsPortfolios[id] = {\\n key: id,\\n id: id,\\n name: name,\\n currency: \\\"euro\\\",\\n stocks: stocks\\n };\\n this.setState(state);\\n this.updateLocalStorage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4386c1f6d314dd6613a5c512b4aff388\",\n \"score\": \"0.56312984\",\n \"text\": \"function createPortfolio(data) {\\n\\tvar portfolioDisplay = \\\"\\\";\\n\\t//For each project generate an individual portfolio square\\n\\tdata.forEach(function createSquare(project,index) {\\n\\t\\tportfolio[index].id = index;\\n\\t\\tvar name = project.name,\\n\\t\\t\\tsnippet = project.snippet,\\n\\t\\t\\ttags = project.tags[0],\\n\\t\\t\\tdesc = project.description,\\n\\t\\t\\tlink = project.link,\\n\\t\\t\\tid = project.id;\\n\\t\\t\\timage = project.image;\\n\\n\\t\\t//Add additional tags\\n\\t\\tfor (var i=1; i<project.tags.length; i++) {\\n\\t\\t\\ttags+= \\\" | \\\" + project.tags[i];\\n\\t\\t}\\n\\n\\t\\tportfolioDisplay+= \\\"<div class='portfolio-square' id='\\\" +\\n\\t\\tid + \\n\\t\\t\\\"'><div><img src='../img/\\\" +\\n\\t\\timage +\\n\\t\\t\\\"'></div><div class='overlay'><h4>\\\" +\\n\\t\\tname +\\n\\t\\t\\\"</h4><p>\\\" +\\n\\t\\t snippet +\\n\\t\\t \\\"</p><a class='button read-more'>read more</a><span>\\\" +\\n\\t\\t tags +\\n\\t\\t \\\"</span></div></div>\\\";\\n\\n\\t\\t //Generate the html for the modal pop up\\n\\t\\tportfolio[id].modal = \\\"<h1>\\\" + \\n\\t\\tname +\\n\\t\\t\\\"</h1><p>\\\" + \\n\\t\\tdesc + \\n\\t\\t\\\"</p><a href='\\\" +\\n\\t\\tlink +\\n\\t\\t\\\"' target='_blank' class='button'>view project</a>\\\";\\n\\t\\t});\\t\\n\\t\\t//Affix each square to the main portfolio display\\n\\t\\t$(\\\"#portfolio-display\\\").append(portfolioDisplay);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6de7a2abe0ad0ecb5445c6feff508429\",\n \"score\": \"0.55567294\",\n \"text\": \"function init() {\\n portfolioView = new app.views.PortfolioView(self);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48ca76b450909bcbed7b521ff9ebf631\",\n \"score\": \"0.5549783\",\n \"text\": \"function Portfolio() {\\n return (\\n <div className=\\\"portfolio\\\" id=\\\"portfolio\\\">\\n <div className=\\\"container\\\">\\n <Title titleName=\\\"PORTFOLIO\\\" descriptionName=\\\"Magnam dolores commodi suscipit. Necessitatibus eius consequatur ex aliquid fuga eum quidem. Sit sint consectetur velit. Quisquam quos quisquam cupiditate. Et nemo qui impedit suscipit alias ea. Quia fugiat sit in iste officiis commodi quidem hic quas.\\\" />\\n <PortfolioController />\\n <PortfolioList />\\n \\n </div>\\n </div>\\n )\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5aef4a5202ab65da6ecf3d4a92e32a99\",\n \"score\": \"0.5499764\",\n \"text\": \"function Product(name, price, inStock){\\n\\n\\tthis.prodName = name;\\n\\tthis.price = price;\\n\\tthis.inStock = inStock;\\n\\n\\tthis.setStock = function (stock){\\n\\tthis.inStock = stock;\\n\\t};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5aef4a5202ab65da6ecf3d4a92e32a99\",\n \"score\": \"0.5499764\",\n \"text\": \"function Product(name, price, inStock){\\n\\n\\tthis.prodName = name;\\n\\tthis.price = price;\\n\\tthis.inStock = inStock;\\n\\n\\tthis.setStock = function (stock){\\n\\tthis.inStock = stock;\\n\\t};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48148b57889431d61ff95ede0aa67496\",\n \"score\": \"0.5498229\",\n \"text\": \"function calcPortfolio(quotes){\\n\\tlet price, changep, change, market;\\n\\tlet sum=0;\\n\\tlet sumchange=0;\\n\\tlet invested=0;\\n\\tlet chper=0;\\n\\tfunction getmarketprice(quote){\\n\\t\\tif(quote.marketState==\\\"PRE\\\" && quote.preMarketPrice){\\n\\t\\t\\tprice= quote.preMarketPrice;\\n\\t\\t\\tchangep=quote.preMarketChangePercent;\\n\\t\\t\\tmarket=\\\"pre-market\\\";\\n\\t\\t\\tchange=quote.preMarketChange;\\n\\t\\t}else if(quote.marketState==\\\"PRE\\\" && !quote.preMarketPrice){\\n\\t\\t\\tprice= quote.regularMarketPrice;\\n\\t\\t\\tchangep=0;\\n\\t\\t\\tmarket=\\\"pre-market\\\";\\n\\t\\t\\tchange=0;\\n\\t\\t}else if([\\\"PREPRE\\\",\\\"POST\\\",\\\"POSTPOST\\\",\\\"CLOSED\\\"].includes(quote.marketState) && quote.postMarketPrice){\\n\\t\\t\\tprice= quote.postMarketPrice;\\n\\t\\t\\t//changep=quote.postMarketChangePercent;\\n\\t\\t\\tchangep=100*(quote.postMarketChange+quote.regularMarketChange)/quote.regularMarketPreviousClose;\\n\\t\\t\\tmarket=\\\"after hours trading\\\";\\n\\t\\t\\tchange=quote.postMarketChange+quote.regularMarketChange;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tprice= quote.regularMarketPrice;\\n\\t\\t\\tchangep=quote.regularMarketChangePercent;\\n\\t\\t\\tmarket=\\\"regular session\\\";\\n\\t\\t\\tchange=quote.regularMarketChange;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tfor(q of quotes){\\n\\t\\t//text+=q.displayName? q.displayName: q.shortName;\\n\\t\\tgetmarketprice(q);\\n\\t\\tsum=sum+price*getHolding(q.symbol).n;\\n\\t\\tsumchange=sumchange+change*getHolding(q.symbol).n;\\n\\t\\tchper=100*sumchange/(sum-sumchange);\\n\\t\\tinvested=invested + getHolding(q.symbol).n*getHolding(q.symbol).p;\\n\\t}\\n\\tdocument.getElementById(\\\"portfolio\\\").innerHTML=\\\"Portfolio: \\\"+sum.toFixed(2)+\\\" Change: \\\"+sumchange.toFixed(2)+ \\\" \\\"+chper.toFixed(2)+\\\"% P/L: \\\"+(sum-invested).toFixed(2);\\n\\t\\n\\tskipcount++;\\n\\tif(pchart && skipcount>4){\\n\\tpchart.data[0].push((new Date()).getTime()/1000);\\n\\tpchart.data[1].push(sum);\\n\\tdocument.getElementById(\\\"costline\\\").checked ? pchart.data[4].push(invested):null;\\n\\tpchart.setData(pchart.data);\\n\\tskipcount=0;\\n\\t}\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86ef7b5d208f91ce03a4924928c1adae\",\n \"score\": \"0.5404354\",\n \"text\": \"function Product(id, name, prices, stock) {\\n this.id = id;\\n this.name = name;\\n this.prices = prices;\\n this.stock = stock\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca97ee3db40c7e41b2869aa07e081ec3\",\n \"score\": \"0.5396404\",\n \"text\": \"function LoadNewPortfolioOverview() {\\n var Catalog = {\\n _id: 'New',\\n portfolioid: '',\\n description: '',\\n coverage: '',\\n org: '',\\n publish: 0,\\n status_data: [],\\n status_label: '',\\n repeated_data: [],\\n repeated_label: '',\\n risk_data: [],\\n risk_label: '',\\n audits: [],\\n portfoliomap: []\\n };\\n return Catalog;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07891ab6d12991673746c789f4484cc0\",\n \"score\": \"0.53877676\",\n \"text\": \"constructor() {\\n this.headers = [];\\n this.stocks = [];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a820642d36b412c7e7cead443c184788\",\n \"score\": \"0.53755647\",\n \"text\": \"function formatStockDataForPortfolioUpdate (JSONdata) {\\n\\n var stock = {\\n\\n symbol: JSONdata.Symbol,\\n currentPrice: parseFloat(JSONdata.LastTradePriceOnly), \\n previousClose: parseFloat(JSONdata.PreviousClose) \\n };\\n\\n return stock;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3ffc672781892203b9fafc3a2d8046d\",\n \"score\": \"0.5357117\",\n \"text\": \"function Finance(){\\n\\t\\tvar self = this;\\n\\t\\tself.cost = 0;\\n\\t\\tself.revenue = {min: 0, max: 0};\\n\\t\\tself.profit = {min: 0, max: 0};\\n\\t\\t\\n\\t\\tself.plantings = 0; // planting count\\n\\t\\tself.harvests = {min: 0, max: 0}; // harvest count\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea0a3550a018813e1b5a6340b988201b\",\n \"score\": \"0.5348619\",\n \"text\": \"static load() {\\n const PORTFOLIO = require(DATA_PORTFOLIO);\\n let funds = [];\\n let total = 0;\\n\\n for (let portfund of PORTFOLIO) {\\n let fund = Fund.find(portfund.symbol);\\n let fundTotal = parseFloat(portfund.shares * fund.price);\\n\\n funds.push({ fund: fund, shares: portfund.shares, total: fundTotal });\\n total += fundTotal;\\n }\\n\\n return new Portfolio(funds, total);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4242c5e2577249ff14de445f92de2d35\",\n \"score\": \"0.5314188\",\n \"text\": \"function Portfolio() {\\n\\n\\treturn (<>\\n\\t\\t\\n\\t\\t\\t<div className=\\\"container__titlePortfolio\\\">\\n\\t\\t\\t\\t<a name=\\\"portfolio\\\">\\n\\t\\t\\t\\t\\t<h2 className=\\\"title\\\">Portfolio</h2>\\n\\t\\t\\t\\t</a>\\n\\t\\t\\t</div>\\n\\t\\t\\t<div className=\\\"container__portfolio\\\">\\n\\t\\t\\t<div className=\\\"container__imgPortfolio\\\">\\n\\t\\t\\t\\t<a href=\\\"https://eleonoradellamico.github.io/Cinema/\\\" target=\\\"_blank\\\">\\n\\t\\t\\t\\t\\t<img className=\\\"portfolioImg\\\" src={Photo} alt=\\\"Cinema\\\" />\\n\\t\\t\\t\\t</a>\\n\\t\\t\\t\\t<div className=\\\"info__imgPortfolio\\\">\\n\\t\\t\\t\\t\\t<p className=\\\"text textPortfolio\\\">Design&layout Html Css Netflix</p>\\n\\t\\t\\t\\t\\t<img className=\\\"link__portfolio\\\" src={GitHub} alt=\\\"gitHub\\\" />\\n\\t\\t\\t\\t\\t<img className=\\\"link__portfolio\\\" src={Enlace} alt=\\\"gitHub\\\" />\\n\\t\\t\\t\\t</div>\\n\\t\\t\\t</div>\\n\\t\\t\\t<div className=\\\"container__imgPortfolio\\\">\\n\\t\\t\\t\\t<a href=\\\"https://martreyz.github.io/project-promo-k-module-3-team-4/#/\\\" target=\\\"_blank\\\">\\n\\t\\t\\t\\t\\t<img className=\\\"portfolioImg\\\" src={PhotoOne} alt=\\\"Cards\\\" />\\n\\t\\t\\t\\t</a>\\n\\t\\t\\t\\t<div className=\\\"info__imgPortfolio\\\">\\n\\t\\t\\t\\t\\t<p className=\\\"text textPortfolio\\\">React project: Visting cards</p>\\n\\t\\t\\t\\t\\t<img className=\\\"link__portfolio\\\" src={GitHub} alt=\\\"gitHub\\\" />\\n\\t\\t\\t\\t\\t<img className=\\\"link__portfolio\\\" src={Enlace} alt=\\\"gitHub\\\" />\\n\\t\\t\\t\\t</div>\\n\\t\\t\\t</div>\\n\\t\\t\\t<div className=\\\"container__imgPortfolio\\\">\\n\\t\\t\\t\\t<a href=\\\"https://eleonoradellamico.github.io/LearnJavaScrip_MemoryGame/\\\" target=\\\"_blank\\\">\\n\\t\\t\\t\\t\\t{' '}\\n\\t\\t\\t\\t\\t<img className=\\\"portfolioImg\\\" src={PhotoTwo} alt=\\\"Laptop\\\" />\\n\\t\\t\\t\\t</a>\\n\\t\\t\\t\\t<div className=\\\"info__imgPortfolio\\\">\\n\\t\\t\\t\\t\\t<p className=\\\"text textPortfolio\\\">Play memory card with JS!</p>\\n\\t\\t\\t\\t\\t<img className=\\\"link__portfolio\\\" src={GitHub} alt=\\\"gitHub\\\" />\\n\\t\\t\\t\\t\\t<img className=\\\"link__portfolio\\\" src={Enlace} alt=\\\"gitHub\\\" />\\n\\t\\t\\t\\t</div>\\n\\t\\t\\t</div>\\n\\t\\t\\t</div>\\n\\t\\t\\t{/* <div className=\\\"btn__experience\\\">\\n\\t\\t\\t\\t<Link to=\\\"/moreProjects\\\">\\n\\t\\t\\t\\t\\t<Button variant=\\\"outlined\\\" color=\\\"secondary\\\">\\n\\t\\t\\t\\t\\t\\tMore Projects\\n\\t\\t\\t\\t\\t</Button>\\n\\t\\t\\t\\t</Link>\\n\\t\\t\\t</div> */}\\n\\t\\t\\t\\n</>\\n\\t);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"230be658126e9f4169818adbbad755ed\",\n \"score\": \"0.52702475\",\n \"text\": \"render() {\\n // console.log(\\\"portfolio stocks in render\\\", this.portfolioStocks)\\n return (\\n <div>\\n <Header/>\\n <MainContainer allStocks={this.state.allStocks} handleBuyStock={this.handleBuyStock} portfolioStocks={this.state.portfolioStocks} />\\n </div>\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1340902c9eac8940e3e5a4b8b8382ade\",\n \"score\": \"0.52526456\",\n \"text\": \"constructor(scope, id, props) {\\n super(scope, id, { type: CfnAcceptedPortfolioShare.CFN_RESOURCE_TYPE_NAME, properties: props });\\n try {\\n jsiiDeprecationWarnings.aws_cdk_lib_aws_servicecatalog_CfnAcceptedPortfolioShareProps(props);\\n }\\n catch (error) {\\n if (process.env.JSII_DEBUG !== \\\"1\\\" && error.name === \\\"DeprecationError\\\") {\\n Error.captureStackTrace(error, CfnAcceptedPortfolioShare);\\n }\\n throw error;\\n }\\n cdk.requireProperty(props, 'portfolioId', this);\\n this.portfolioId = props.portfolioId;\\n this.acceptLanguage = props.acceptLanguage;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"423ce67c7503524c3b628935109d6adc\",\n \"score\": \"0.52384794\",\n \"text\": \"static createStock() {\\n const itemNames = ['Camisa', 'Pantalon', 'Calcetines'];\\n const itemPrices = [13, 27, 100];\\n return itemNames.map((value, index) => new Item(itemNames[index], itemPrices[index]));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a706241fff00a8a5c8c64b7c55350260\",\n \"score\": \"0.52205\",\n \"text\": \"constructor(name,stock = 1){\\n\\tif (typeof(name) == 'object') {\\n\\t\\t// clone branch\\n\\t\\tObject.keys(name).forEach(prop => this[prop] = clone(name[prop]));\\n\\t} else {\\n\\t\\t// standard branch\\n\\t\\tthis.id = \\\"_\\\" + (new Date().getTime() + Math.random() * 0x10000000000).toString(16);\\n\\t\\tthis._name = name;\\n\\t\\tif (this.usable.includes(\\\"inmenu\\\") && this.onUse === undefined) {\\n\\t\\t\\tconsole.log(`WARNING: item ${name} does not have an onUse`);\\n\\t\\t}\\n\\t\\tif (this.equippable && this.onEquip === undefined) {\\n\\t\\t\\tconsole.log(`WARNING: item ${name} does not have an onEquip`);\\n\\t\\t}\\n\\t\\tif (this.equippable && this.onRemove === undefined) {\\n\\t\\t\\tconsole.log(`WARNING: item ${name} does not have an onRemove`);\\n\\t\\t}\\n\\t\\tthis.stock = stock;\\n\\t\\tif (this.itemData && Number.isInteger(this.itemData.uses)) {\\n\\t\\t\\tthis._uses = new FillStat(this.itemData.uses);\\n\\t\\t} else {\\n\\t\\t\\tthis._uses = new FillStat(1);\\n\\t\\t}\\n\\n\\t\\tif (this.equippable !== undefined) {\\n\\t\\t\\tthis.modID = {};\\n\\t\\t}\\n\\t}\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8df3ac77cbcc0d9da5ea1029beb923e\",\n \"score\": \"0.51947796\",\n \"text\": \"constructor(scope, id, props) {\\n super(scope, id, { type: CfnPortfolioProductAssociation.CFN_RESOURCE_TYPE_NAME, properties: props });\\n try {\\n jsiiDeprecationWarnings.aws_cdk_lib_aws_servicecatalog_CfnPortfolioProductAssociationProps(props);\\n }\\n catch (error) {\\n if (process.env.JSII_DEBUG !== \\\"1\\\" && error.name === \\\"DeprecationError\\\") {\\n Error.captureStackTrace(error, CfnPortfolioProductAssociation);\\n }\\n throw error;\\n }\\n cdk.requireProperty(props, 'portfolioId', this);\\n cdk.requireProperty(props, 'productId', this);\\n this.portfolioId = props.portfolioId;\\n this.productId = props.productId;\\n this.acceptLanguage = props.acceptLanguage;\\n this.sourcePortfolioId = props.sourcePortfolioId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f59f10a502bf65cc4aed5844ecfeb97c\",\n \"score\": \"0.5190033\",\n \"text\": \"function initPortfolio() {\\n\\t\\t//We want to hide all images at first\\n\\t\\tportfolioImages = $(\\\"#portfolio-images li img\\\").css(\\\"display\\\", \\\"none\\\");\\n\\t\\t\\n\\t\\t//Add the various mouse events to the grid overlay\\n\\t\\tgridOverlay = $(\\\"#grid-overlay\\\").click(onGridClick).mousemove(onGridMouseMove).mouseout(onGridMouseOut);\\n\\t\\t\\n\\t\\tcurrentImageIndex = 0;\\n\\t\\tnextImageIndex = 1;\\n\\t\\t\\n\\t\\t//We begin by displaying the first image in the list\\n\\t\\tif (portfolioImages.length > 0) {\\n\\t\\t\\t$(portfolioImages[0]).css(\\\"display\\\", \\\"block\\\");\\n\\t\\t}\\n\\t\\t\\n\\t\\tportfolioInfo = $(\\\"#portfolio-info\\\");\\n\\t\\tportfolioTimerBar = $(\\\"#portfolio-timer\\\");\\n\\t\\tportfolioTimerBar.data(\\\"originalOpacity\\\", portfolioTimerBar.css(\\\"opacity\\\"));\\n\\t\\tportfolioNavigation = $(\\\"#portfolio-navigation\\\");\\n\\t\\t\\n\\t\\t//We store all the navigation buttons in a document fragment first before actually\\n\\t\\t//appending them to the DOM. This gives us better performance since direct\\n\\t\\t//DOM manipulation is processor expensive\\n\\t\\tvar frag = document.createDocumentFragment();\\n\\t\\tportfolioButtons = [];\\n\\t\\t\\n\\t\\t//Create a nav button for every image in the portfolio\\n\\t\\tfor (var i = 0; i < portfolioImages.length; i++) {\\n\\t\\t\\tvar navButton = $(\\\"<div>\\\").addClass(\\\"portfolio-button\\\").data(\\\"index\\\", i);\\n\\t\\t\\t//Transition to the corresponding image on click\\n\\t\\t\\tnavButton.click(function() {\\n\\t\\t\\t\\tvar thisIndex = $(this).data(\\\"index\\\");\\n\\t\\t\\t\\tif(thisIndex !== currentImageIndex) {\\n\\t\\t\\t\\t\\tnextImageIndex = thisIndex;\\n\\t\\t\\t\\t\\timageTransition();\\n\\t\\t\\t\\t}\\n\\t\\t\\t});\\n\\t\\t\\t//Highlight the current nav button\\n\\t\\t\\tif (i === currentImageIndex) {\\n\\t\\t\\t\\taddHighlight(navButton);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t//Add button to fragment and array\\n\\t\\t\\tfrag.appendChild(navButton[0]);\\n\\t\\t\\tportfolioButtons.push(navButton);\\n\\t\\t}\\n\\t\\t//Add to document\\n\\t\\tportfolioNavigation.append(frag);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bbb7b4ed7b138fd15bcd5ab8eee8b1e\",\n \"score\": \"0.51181763\",\n \"text\": \"setPortfolioByDate(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"453dabc86d9d913fd94164e1f9c589da\",\n \"score\": \"0.5107213\",\n \"text\": \"updatePortfolioState(portfolioId, stocks, name){\\n let pfCopy = Object.assign([], this.state.portfolio);\\n for(var i = 0; i<pfCopy.length; i++){\\n if(pfCopy[i].id === portfolioId){\\n pfCopy[i].name = name\\n pfCopy[i].stocks = stocks\\n }\\n }\\n this.setState({portfolio: pfCopy})\\n this.onSetResult(pfCopy, 'portfolio')\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2654018d63efba2d5ee5e0b8340888f4\",\n \"score\": \"0.5096993\",\n \"text\": \"function setPortfolioInStorage(portfolio) {\\n const name = portfolio.name;\\n let portfolios = getPortfoliosFromStorage();\\n let updated = false;\\n\\n /* Look for existing equivalent portfolio in local storage. */\\n for (let i = 0; i < portfolios.length; i++) {\\n if (portfolios[i].name === name) {\\n // Update existing portfolio in local storage.\\n portfolios[i] = portfolio;\\n setPortfoliosInStorage(portfolios);\\n updated = true;\\n }\\n }\\n\\n if (!updated) {\\n // Add new portfolio.\\n portfolios.push(portfolio);\\n setPortfoliosInStorage(portfolios);\\n }\\n\\n // Return the new list of portfolios in the storage.\\n return portfolios;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ec6d7312add9fbbbac2768b67dacd5e\",\n \"score\": \"0.50718343\",\n \"text\": \"function Item(name, price, stock, image) {\\n this.name = name;\\n this.price = price;\\n this.stock = stock;\\n this.image = image;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06814862639b2914d91a1e790ea59360\",\n \"score\": \"0.50716645\",\n \"text\": \"function Cart(){\\n // check for existing instance\\n if (typeof Cart._instance === 'Object'){\\n return Cart._instance;\\n }\\n\\n // default properties\\n this.data = {};\\n this.isReady = false;\\n\\n // store the instance\\n Cart._instance = this;\\n\\n // 'this' is returned implicitly when called with new\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cced5f7326d74ae5283085a176c2276\",\n \"score\": \"0.50388515\",\n \"text\": \"function calculatePortfolioValue (portfolio, completedPositions, pendingOrders) {\\n\\n var portfolioFreeCash = 0.0\\n var portfolioCommittedCash = 0.0\\n var portfolioEquityValue = 0.0\\n var portfolioTodaysGainOrLoss = 0.0\\n var portfolioPositionsTotalGainOrLoss = 0.0\\n var portfolioTotalGainOrLoss = 0.0\\n\\n var portfolioTotalValue = 0.0\\n var numberOfPositions = completedPositions.length\\n var numberOfUniquePositions = 1 // Need to determine a formula for this\\n\\n\\n for (i = 0; i < pendingOrders.length; i++) {\\n\\n var orderType = pendingOrders[i][\\\"orderType\\\"]\\n\\n // Will only increase pending cash if the ordertype is a \\\"buy\\\"\\n if (orderType == \\\"buy\\\") {\\n\\n var numberOfShares = pendingOrders[i][\\\"numberOfShares\\\"]\\n var purchasePrice = pendingOrders[i][\\\"purchasePrice\\\"]\\n\\n // Calculates how much cash is commited to open orders\\n portfolioCommittedCash += (numberOfShares * purchasePrice) \\n }\\n }\\n\\n\\n for (i = 0; i < completedPositions.length; i++) {\\n\\n // Numbers used to calculate the value of this holding as a part of the portfolio\\n var numberOfShares = completedPositions[i][\\\"numberOfShares\\\"]\\n var purchasePrice = completedPositions[i][\\\"purchasePrice\\\"]\\n var todaysGainOrLoss = completedPositions[i][\\\"todaysGainOrLoss\\\"]\\n var totalGainOrLoss = completedPositions[i][\\\"totalGainOrLoss\\\"]\\n\\n // The equity value of the position is it's value at purchase plus the total change in value\\n var positionEquityValue = (numberOfShares * purchasePrice) + totalGainOrLoss\\n\\n // Update the aggregate portfolio values\\n portfolioEquityValue += positionEquityValue\\n portfolioTodaysGainOrLoss += todaysGainOrLoss\\n // portfolioTodaysGainOrLoss += totalGainOrLoss\\n portfolioPositionsTotalGainOrLoss += positionEquityValue\\n }\\n\\n portfolioFreeCash = portfolio.get(\\\"cash\\\") - portfolioCommittedCash\\n portfolioTotalValue = portfolioEquityValue + portfolioFreeCash + portfolioCommittedCash\\n portfolioTotalGainOrLoss = portfolioTotalValue - portfolio.get(\\\"initialPortfolioValue\\\")\\n\\n var updatedPortfolioValues = {\\n\\n cash: parseFloat(portfolioFreeCash.toFixed(2)),\\n committedCash: parseFloat(portfolioCommittedCash.toFixed(2)),\\n equityValue: parseFloat(portfolioEquityValue.toFixed(2)),\\n portfolioValue: parseFloat(portfolioTotalValue.toFixed(2)),\\n todaysGainOrLoss: parseFloat(portfolioTodaysGainOrLoss.toFixed(2)),\\n totalGainOrLoss: parseFloat(portfolioTotalGainOrLoss.toFixed(2)),\\n numberOfPositions: numberOfPositions,\\n numberOfUniquePositions: numberOfUniquePositions\\n }\\n\\n return updatedPortfolioValues\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f13a59818b0d14cfc045be567f7a10b\",\n \"score\": \"0.5030876\",\n \"text\": \"function updatePorfolio(quote, sales, callback) {\\n\\t// updating quote info\\n\\tif ( quote['ask'] === -1 ) {\\n\\t\\tportfolio['ask'] = '-';\\n\\t\\tportfolio['askSize'] = '-';\\n\\t} else {\\n\\t\\tportfolio['ask'] = quote['ask'];\\n\\t\\tportfolio['askSize'] = quote['askSize'];\\n\\t}\\n\\n\\tif ( quote['bid'] === -1 ) {\\n\\t\\tportfolio['bid'] = '-';\\n\\t\\tportfolio['bidSize'] = '-';\\n\\t} else {\\n\\t\\tportfolio['bid'] = quote['bid'];\\n\\t\\tportfolio['bidSize'] = quote['bidSize'];\\n\\t}\\n\\n\\taddAskBid(quote);\\n\\n\\tif ( quote.hasOwnProperty('price') ) {\\n\\t\\tportfolio['last'] = quote['price'];\\n\\t\\tportfolio['volume'] = quote['volume'];\\n\\n\\t\\tif ( portfolio['high'] === '-' ) {\\n\\t\\t\\tportfolio['high'] = quote['price'];\\n\\t\\t} else {\\n\\t\\t\\tportfolio['high'] = Math.max(quote['price'], portfolio['high']);\\n\\t\\t}\\n\\t\\tif ( portfolio['low'] === '-' ) {\\n\\t\\t\\tportfolio['low'] = quote['price'];\\n\\t\\t} else {\\n\\t\\t\\tportfolio['low'] = Math.min(quote['price'], portfolio['low']);\\n\\t\\t}\\n\\t}\\n\\n\\tif (sales) {\\n\\n\\t\\taddSales(sales);\\n\\t\\t// updating personal portfolio info\\n\\t\\t// when a current order is altered, either partially or completely fulfilled, \\n\\t\\t// it will be recorded in sales which will have buyer and seller ids\\n\\t\\tfor ( var i = 0; i < sales.length; i++ ) {\\n\\t\\t\\tvar currentSale = sales[i];\\n\\t\\t\\t// client bought shares\\n\\t\\t\\tif ( currentSale['buyerId'] === email ) {\\n\\t\\t\\t\\tportfolio['cashTotal'] -= currentSale['price'] * currentSale['amount'];\\n\\t\\t\\t\\tportfolio['quantity'] += currentSale['amount'];\\n\\t\\t\\t\\taddToTransaction(currentSale, 'buy');\\n\\t\\t\\t} \\n\\t\\t\\t// client sold shares\\n\\t\\t\\tif ( currentSale['sellerId'] === email ) {\\n\\t\\t\\t\\tportfolio['cashTotal'] += currentSale['price'] * currentSale['amount'];\\n\\t\\t\\t\\tportfolio['quantity'] -= currentSale['amount'];\\n\\t\\t\\t\\taddToTransaction(currentSale, 'sell');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcash = portfolio['cashTotal']\\n\\n\\t\\t// update the value of client's stocks\\n\\t\\tportfolio['crlTotal'] = portfolio['last'] * portfolio['quantity'];\\n\\n\\t\\t// update the value of client's entire portfolio\\n\\t\\tportfolio['total'] = portfolio['crlTotal'] + portfolio['cashTotal'];\\n\\n\\t\\tcallback();\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c75675671856620d325ef55e6ea52ebc\",\n \"score\": \"0.5026071\",\n \"text\": \"function Inventory(){\\r\\n stock = []; \\r\\n \\r\\n //function name: calculateValue\\r\\n //inputs:\\r\\n //output: totalInventoryValue\\r\\n //brief description: this function calcuulates the total value of the inventory\\r\\n this.calculateValue = function(){ \\r\\n var inventoryValue = 0;\\r\\n //return (Product.price * Product.quantity);\\r\\n \\r\\n for (var i = 0; i < stock.length; i++){\\r\\n inventoryValue += ( stock[i].price * stock[i].quantity );\\r\\n }\\r\\n \\r\\n console.log( \\\"The value of this inventory is $\\\" + inventoryValue );\\r\\n return inventoryValue;\\r\\n }\\r\\n \\r\\n //function name: addStock\\r\\n //inputs: Product\\r\\n //brief description: this function adds a product to stock\\r\\n this.addStock = function(Product){\\r\\n stock.push(Product);\\r\\n }\\r\\n \\r\\n //function name: displayStock\\r\\n //inputs: \\r\\n //brief description: this function displays the items in stock\\r\\n this.displayStock = function(){\\r\\n\\r\\n if (stock.length > 0){\\r\\n for (var i = 0; i < stock.length; i++){\\r\\n console.log( stock[i] ); \\r\\n }\\r\\n } else { console.log(\\\"There are no items in the inventory\\\"); \\r\\n }\\r\\n }\\r\\n \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ace28b2a3a5b99612486577d937c41ff\",\n \"score\": \"0.5021331\",\n \"text\": \"function getChart(data, initialData) {\\n\\treturn isc.FacetChart.create({\\n\\t ID: \\\"stockQuotesChart\\\",\\n\\t facets: [{\\n\\t id: \\\"time\\\",\\n\\t title: \\\"Time\\\"\\n\\t }, {\\n\\t id: \\\"name\\\",\\n\\t title: \\\"Name\\\"\\n\\t }],\\n\\t data:data,\\n\\t initialData:initialData,\\n\\t valueProperty: \\\"lastValue\\\",\\n\\t chartType: \\\"Area\\\",\\n\\t title: \\\"Portfolio Value\\\"\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b39637c391a1ce04e12840b8b43381fb\",\n \"score\": \"0.49574605\",\n \"text\": \"function getPortfolioPositions (portfolio) {\\n\\n // Function will not return until this promise is fulfilled\\n var promiseToFindPortfolioPositions = new Parse.Promise();\\n\\n // Sets up the Parse query to find PortfolioPositions associated with this Portfolio \\n var PortfolioPosition = Parse.Object.extend(\\\"PortfolioPosition\\\")\\n var portfolioPositionQuery = new Parse.Query(PortfolioPosition)\\n portfolioPositionQuery.equalTo(\\\"portfolioID\\\", portfolio)\\n\\n // Executes the query search\\n promiseToFindPortfolioPositions = portfolioPositionQuery.find()\\n\\n return promiseToFindPortfolioPositions\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69fc671de627db143dbbce55a3d67c16\",\n \"score\": \"0.49407157\",\n \"text\": \"function Stock({ ticker }) {\\n const result = ensureQuote.read(ticker);\\n console.log(result);\\n // Assume this is deeply nested (and that you don't want\\n // import the cache into every component)...\\n return (\\n <div>\\n {result.companyName} <small>({result.symbol})</small> {result.change}%\\n </div>\\n );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f181d156166c58d4fdfb5fb37db7b492\",\n \"score\": \"0.49396363\",\n \"text\": \"function StockProvider(){\\n /**\\n * Maakt een nieuwe YahooAjaxHelper aan en zet dat in de variable yahoo.\\n * @type {YahooAjaxHelper} : Geeft een YahooAjaxHelper \\\"class/object\\\".\\n */\\n yahoo = new YahooAjaxHelper();\\n\\n /**\\n * Maakt een nieuwe LocalHelper aan en zet dat in de variable local.\\n * @type {LocalHelper} : Geeft een LocalHelper \\\"class/object\\\".\\n */\\n local = new LocalHelper();\\n\\n /**\\n * Dit is om bij te houden het aantal keer dat de methode getdata is aan geroepen,\\n * zodat er om en om de yahoo en local helpers worden gereturnt\\n * @type {Number} : count begint met 1.\\n */\\n var count = 1;\\n\\n /**\\n * De functie getData is om een nieuwe yahoo of local helper te returnen .\\n * Na elke keer dat de functie wordt aangeroepen gaat de count omhoog.\\n * Dan wordt er een if en else gezet, wanneer de getdata 10 keer is aangeroepen (die local mee geeft) geeft hij de yahoo terug.\\n * Nadat de functie 20 keer is aangeroepen wordt de count gereset en zo geeft de StockProvider factory om en om de local en yahoo en roept de getStockData functie aan.\\n *\\n * @param count : het aantal keer dat getdata is opgeroepen.\\n */\\n function getData(count) {\\n /**\\n * Eerst 10 keer dat data wordt opgeroepen voor de local;\\n * @type {Number} : 10 keer.\\n */\\n var localCount = 10;\\n /**\\n * de volgende 10 keer (maximum is dan dus 20 keer) voor de yahoo;\\n * @type {Number} : 20e keer.\\n */\\n var yahooCount = 20;\\n /**\\n * reset de count terug naar 1\\n * @type {Number} : 1 (gereset weer naar het begin)\\n */\\n var resetCount = 1;\\n /**\\n * hier wordt de functie getdata aangeroepen voor het returnen van de local of yahoo helper.\\n * @return {*} Het hang van de count af wat hij returnt, of de local.getStockData() of de yahoo.getStockData\\n */\\n this.getData = function () {\\n count++;\\n if (count <= localCount) {\\n return local.getStockData();\\n }\\n else {\\n if (count === yahooCount) {\\n count = resetCount;\\n }\\n return yahoo.getStockData();\\n }\\n };\\n }\\n\\n /**\\n * Wanneer de functie getData wordt opgeroepen geeft hij de count mee.\\n */\\n getData.call(this, count);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a01c073c8072888f68901af83ddf613\",\n \"score\": \"0.49349055\",\n \"text\": \"function Product(product_name,department_name,price, stock_quantity){\\n this.product_name= product_name;\\n this.department_name= department_name;\\n this.price=price;\\n this.stock_quantity= stock_quantity;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64054e7a0fbb87b5b964cb264ab9c781\",\n \"score\": \"0.49323454\",\n \"text\": \"function Portfolio() {\\t\\n\\t\\n\\t\\t\\t\\n\\t\\tif( $('.portfolio-wrap').length > 0 ){\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\tif ($(\\\"body\\\").hasClass(\\\"smooth-scroll\\\")) {\\n\\t\\t\\t\\tvar elem = document.querySelector(\\\"#content-scroll\\\");\\n\\t\\t\\t\\tvar scrollbar = Scrollbar.init(elem,\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\trenderByPixels: true,\\n\\t\\t\\t\\t\\tdamping:0.05\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tvar $container = $('.portfolio');\\n\\t\\t\\n\\t\\t\\t$container.isotope({\\n\\t\\t\\t layoutMode: 'packery',\\n\\t\\t\\t itemSelector: '.item',\\n\\t\\t\\t gutter:0,\\n\\t\\t\\t transitionDuration: \\\"0.5s\\\"\\n\\t\\t\\t});\\n\\t\\t\\t\\n\\t\\t\\t$('#filters a').on('click', function() {\\n\\t\\t\\t\\t$('#filters a').removeClass('active');\\n\\t\\t\\t\\t$(this).addClass('active');\\n\\t\\t\\t\\t$('.item').addClass('item-margins');\\n\\t\\t\\t\\tvar selector = $(this).attr('data-filter');\\n\\t\\t\\t\\t$container.isotope({ filter: selector }, function( $changedItems, instance ) {\\n\\t\\t\\t\\t instance.$allAtoms.filter('.isotope-hidden').removeClass('is-filtered');\\n\\t\\t\\t\\t instance.$filteredAtoms.addClass('is-filtered');\\n\\t\\t\\t\\t});\\t\\t\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\t\\n\\t\\t\\t$(\\\"#all\\\").trigger('click');\\n\\t\\t\\t\\t\\n\\t\\t\\t$('.item').each(function() {\\n\\t\\t\\t\\tvar image = $(this).find('.item-image').data('src');\\t\\n\\t\\t\\t\\t$(this).find('.item-image').css({'background-image': 'url(' + image + ')'});\\n\\t\\t\\t});\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t$(\\\".item-image\\\").mouseenter(function(e) {\\t\\n\\t\\t\\t\\tTweenMax.to('#ball', 0.3,{borderWidth: '2px', scale: 1, borderColor:'#fff'});\\n\\t\\t\\t\\tTweenMax.to('#ball-loader', 0.2,{borderWidth: '2px', top: 2, left: 2});\\n\\t\\t\\t\\t$( \\\"#ball\\\" ).addClass(\\\"with-icon\\\").append( '<i class=\\\"fa fa-plus\\\"></i>' );\\n\\t\\t\\t\\t$(this).parent().find('video').each(function() {\\n\\t\\t\\t\\t\\t$(this).get(0).play();\\n\\t\\t\\t\\t});\\n\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t$(\\\".item-image\\\").mouseleave(function(e) {\\n\\t\\t\\t\\tTweenMax.to('#ball', 0.2,{borderWidth: '4px', scale:0.5, borderColor:'#999999'});\\n\\t\\t\\t\\tTweenMax.to('#ball-loader', 0.2,{borderWidth: '4px', top: 0, left: 0});\\n\\t\\t\\t\\t$(\\\"#ball\\\").removeClass(\\\"with-icon\\\");\\n\\t\\t\\t\\t$('#ball i').remove();\\n\\t\\t\\t\\t$(this).parent().find('video').each(function() {\\n\\t\\t\\t\\t\\t$(this).get(0).pause();\\n\\t\\t\\t\\t});\\n\\t\\t\\t});\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t//Show Filters On overlay\\n\\t\\t\\t$('#show-filters, #close-filters').on('click', function() {\\t\\t\\t\\n\\t\\t\\t\\t$('#filters-overlay').toggleClass('active');\\n\\t\\t\\t\\tvar navtitleheight = $(\\\".hero-title\\\").height()\\n\\t\\t\\t\\tvar navsubtitleheight = $(\\\".hero-subtitle\\\").height()\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tsetTimeout( function(){\\t\\t\\t\\n\\t\\t\\t\\t\\tif ($('#filters-overlay').hasClass(\\\"active\\\")) {\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tTweenMax.to($(\\\".item-parallax\\\"), 0.6, {force3D:true, scale:0.9, opacity:0.3, delay:1.1, ease:Power2.easeInOut});\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tTweenMax.to($(\\\".active .item-caption\\\"), 0.3, {opacity:0, ease:Power2.easeOut});\\n\\t\\t\\t\\t\\t\\tTweenMax.to($(\\\"#show-filters, #counter-wrap\\\"), 0.3, {opacity:0, delay:0, ease:Power2.easeOut});\\n\\t\\t\\t\\t\\t\\tTweenMax.to($(\\\"#show-filters, #counter-wrap\\\"), 0, {visibility:'hidden', delay:0.35, ease:Power2.easeOut}); \\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t//Fade In Navigation Lists\\n\\t\\t\\t\\t\\t\\tTweenMax.set($(\\\".filters-info\\\"), {y:30, opacity:0});\\n\\t\\t\\t\\t\\t\\tTweenMax.to($(\\\".filters-info\\\"), 0.4, {force3D:true, y:0, opacity:1, delay:0.7, ease:Power2.easeOut});\\n\\t\\t\\t\\t\\t\\tvar tlMenu = new TimelineLite();\\n\\t\\t\\t\\t\\t\\ttlMenu.set($(\\\".filters-timeline\\\"), {y:60, opacity:0});\\n\\t\\t\\t\\t\\t\\t$(\\\".filters-timeline\\\").each(function(index, element) {\\n\\t\\t\\t\\t\\t\\t\\ttlMenu.to(element, 0.5, {y:0, opacity:1, delay:1.2, ease:Power3.easeOut}, index * 0.1)\\n\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tvar heroheight = $(\\\"#hero\\\").height();\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tif ($(\\\"body\\\").hasClass(\\\"smooth-scroll\\\")) {\\n\\t\\t\\t\\t\\t\\t\\tTweenLite.to(scrollbar, 1.5, {scrollTop:heroheight, ease:Power4.easeInOut});\\n\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t$(\\\"html,body\\\").animate({scrollTop: heroheight}, 800);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t} else {\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tTweenMax.to($(\\\".item-parallax\\\"), 0.6, {force3D:true, scale: 1, opacity:1, delay:0.3, ease:Power2.easeInOut});\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tTweenMax.to($(\\\".active .item-caption\\\"), 0.5, {opacity:1, delay:0.5, ease:Power2.easeOut});\\n\\t\\t\\t\\t\\t\\tTweenMax.set($(\\\"#show-filters, #counter-wrap\\\"), {visibility:'visible', opacity:0});\\n\\t\\t\\t\\t\\t\\tTweenMax.to($(\\\"#show-filters, #counter-wrap\\\"), 0.3, {opacity:1, delay:0.7, ease:Power2.easeOut});\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t//Fade Out Navigation Lists\\n\\t\\t\\t\\t\\t\\tTweenMax.to($(\\\".filters-info\\\"), 0.2, {force3D:true, y:-30, opacity:0, delay:0, ease:Power1.easeIn});\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tvar tlMenu = new TimelineLite();\\n\\t\\t\\t\\t\\t\\t$(\\\".filters-timeline, .jssocials-share\\\").each(function(index, element) {\\n\\t\\t\\t\\t\\t\\t\\ttlMenu.to(element, 0.25, {opacity:0, y:-60, delay:0.1, ease:Power1.easeIn }, index * 0.1)\\n\\t\\t\\t\\t\\t\\t});\\t\\n\\t\\t\\t\\t\\t\\tTweenMax.to('#ball', 0.1,{borderWidth: '4px', scale:0.5,});\\n\\t\\t\\t\\t\\t\\t$(\\\"#ball\\\").removeClass(\\\"close-icon\\\");\\n\\t\\t\\t\\t\\t\\t$('#ball i').remove();\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t} , 20 );\\n\\t\\t\\t});\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t$(\\\"#close-filters\\\").mouseenter(function(e) {\\t\\n\\t\\t\\t\\tTweenMax.to('#ball', 0.2,{borderWidth: '2px', scale: 1, borderColor:'#fff',});\\n\\t\\t\\t\\tTweenMax.to('#ball-loader', 0.2,{borderWidth: '2px', top: 2, left: 2});\\n\\t\\t\\t\\t$( \\\"#ball\\\" ).addClass(\\\"close-icon\\\").append( '<i class=\\\"fa fa-times\\\"></i>' );\\n\\t\\t\\t});\\n\\t\\t\\t\\t\\n\\t\\t\\t$(\\\"#close-filters\\\").mouseleave(function(e) {\\n\\t\\t\\t\\tTweenMax.to('#ball', 0.2,{borderWidth: '4px', scale:0.5, borderColor:'#999999',});\\n\\t\\t\\t\\tTweenMax.to('#ball-loader', 0.2,{borderWidth: '4px', top: 0, left: 0});\\n\\t\\t\\t\\t$(\\\"#ball\\\").removeClass(\\\"close-icon\\\");\\n\\t\\t\\t\\t$('#ball i').remove();\\n\\t\\t\\t});\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\tsetTimeout( function(){\\n\\t\\t\\t\\tvar controller = new ScrollMagic.Controller();\\n\\t\\t\\t\\t$('.portfolio').each(function(){\\n\\t\\t\\t\\t\\tvar $this = $(this);\\n\\t\\t\\t\\t\\tvar $elheight = window.innerHeight*0.7;\\n\\t\\t\\t\\t\\tvar $thisHeight = $(this).outerHeight() - $elheight;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tvar scene = new ScrollMagic.Scene({triggerElement:$this[0],duration: $thisHeight})\\n\\t\\t\\t\\t\\t\\t.addTo(controller)\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tscene.triggerHook(0.3)\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tscene.on('enter', function(){\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tTweenMax.to($(\\\"#show-filters\\\"), 0.3, {opacity:1, delay:0, ease:Power2.easeOut});\\n\\t\\t\\t\\t\\t\\t$(\\\"#show-filters\\\").addClass('enabled')\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tscene.on('leave', function(){\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tTweenMax.to($(\\\"#show-filters\\\"), 0.15, {opacity:0, delay:0, ease:Power2.easeOut});\\n\\t\\t\\t\\t\\t\\t$(\\\"#show-filters\\\").removeClass('enabled')\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif ($(\\\"body\\\").hasClass(\\\"smooth-scroll\\\")) {\\n\\t\\t\\t\\t\\t\\tscrollbar.addListener(() => {\\n\\t\\t\\t\\t\\t\\t\\tscene.refresh()\\n\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t})\\n\\t\\t\\t} , 2000 );\\n\\t\\t\\t\\n\\t\\t\\tTweenMax.to($(\\\"#show-filters\\\"), 0, {opacity:0, delay:0.05, ease:Power2.easeOut});\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"950159e5c9d700f57a9d3c1c8e2f53bd\",\n \"score\": \"0.48994607\",\n \"text\": \"constructor(name, price) {\\n // invokes the setters\\n this.name = name;\\n this.price = price;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7da544d546e22e6dee9e367ee6857c2e\",\n \"score\": \"0.48876125\",\n \"text\": \"static initialize(obj, portfolioDataField, portfolioIDField, portfolioNameField, resultField) { \\n obj['PortfolioDataField'] = portfolioDataField;\\n obj['PortfolioIDField'] = portfolioIDField;\\n obj['PortfolioNameField'] = portfolioNameField;\\n obj['ResultField'] = resultField;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"176f14c2ddee510f3731a890bf83f461\",\n \"score\": \"0.4856577\",\n \"text\": \"function Composition(axis) {\\n this.axis = axis;\\n this.stacks = {\\n changed: false\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9cd51e6667c770293b329904049705c9\",\n \"score\": \"0.4850132\",\n \"text\": \"function ClusterInventory(clusterName, data) {\\n this.clusterName = clusterName;\\n if (data) {\\n Object.assign(this, data);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f677646317f291759e157008e719dcc\",\n \"score\": \"0.4848187\",\n \"text\": \"function Position(p)\\n{\\n this.ticker = p[0];\\n this.name = p[1];\\n this.currency = p[2];\\n this.FXrate = parseFloat(p[3]);\\n this.position = parseFloat(p[4]);\\n this.exposureNAV = parseFloat(p[5]) / 100;\\n this.exposureGross = parseFloat(p[6]);\\n this.exposureNet = parseFloat(p[7]);\\n this.fundNAVbase = parseFloat(p[8]);\\n this.EODprice = parseFloat(p[9]);\\n this.stdPxChange = parseFloat(p[10]) / 100;\\n this.custodian = p[11];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5195b5cabce646fc3350e7c579a0abec\",\n \"score\": \"0.4847761\",\n \"text\": \"function Data() {\\n this.data = {};\\n this.orders = {};\\n this.currentOrderNumber = 0;\\n this.currentFavorites = [];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c75db1b0e777610a8ccbf5e05c788bbb\",\n \"score\": \"0.48271504\",\n \"text\": \"constructor (_data, _quantidade, _valor) {\\n\\n Object.assign(this, {\\n _quantidade,\\n _valor \\n });\\n \\n this._data = new Date(_data.getTime()), //criando uma nova referência\\n Object.freeze(this); //congela para nao permitir alterações\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a90d48fdb17e4551dcd8fdde00c6858\",\n \"score\": \"0.48267812\",\n \"text\": \"function getStockPortfolioData (arrayOfStockNames) {\\n\\n // var promiseToGetPortfolioData = new Parse.Promise();\\n\\n // Builds the Yahoo Stock API url for the JSON call\\n var returnedURL = buildStockPortfolioURL(arrayOfStockNames);\\n\\n // This array will hold the final data to return to the client\\n var arrayOfStockData = [];\\n\\n return new Promise(function(resolve, reject) {\\n\\n request({\\n url: returnedURL,\\n json: true\\n }, function (error, response, returnedData) {\\n\\n if (!error && response.statusCode === 200) {\\n\\n var portfolioData = returnedData.query.results.quote\\n\\n // Filters out unnecesary information from JSON request for each stock in portfolio\\n for (i = 0; i < portfolioData.length; i++) {\\n\\n var stockData = formatStockData(portfolioData[i]);\\n arrayOfStockData[i] = stockData;\\n }\\n\\n resolve (arrayOfStockData);\\n\\n } else {\\n\\n reject (error)\\n }\\n })\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"583280f8429113760631b3f7c2e1d365\",\n \"score\": \"0.482013\",\n \"text\": \"async changeRate(portfolio, currency) {\\n var valueOfStocks = 0;\\n var portfolios = this.state.listOfPortfolios;\\n // Find the right portfolio\\n for (var i=0; i<portfolios.length; i++){\\n if (portfolios[i].name === portfolio) {\\n var index = i;\\n }\\n }\\n var data = await this.getCurrency();\\n var changeRate = data[\\\"rates\\\"][\\\"EUR\\\"];\\n if (currency === 'USD') {\\n changeRate = 1 / changeRate;\\n }\\n portfolios[index].changeRate = changeRate;\\n portfolios[index].currency = currency;\\n // Update currency to all stocks\\n for (var j=0; j<portfolios[index].stocks.length; j++) {\\n const updatedStock = {\\n \\\"id\\\": portfolios[index].stocks[j].id,\\n \\\"unitValue\\\": (portfolios[index].stocks[j].unitValue * portfolios[index].changeRate).toFixed(2),\\n \\\"quantity\\\": portfolios[index].stocks[j].quantity,\\n \\\"totalValue\\\": (portfolios[index].stocks[j].unitValue * portfolios[index].stocks[j].quantity * portfolios[index].changeRate).toFixed(2)\\n };\\n valueOfStocks = (parseFloat(valueOfStocks) + parseFloat(updatedStock.totalValue)).toFixed(2);\\n portfolios[index].stocks[j] = updatedStock;\\n localStorage.setItem(\\\"portfolios\\\", \\\"\\\");\\n localStorage.setItem(\\\"portfolios\\\", JSON.stringify(portfolios));\\n this.setState({\\n listOfPortfolios: portfolios});\\n }\\n portfolios[index].valueOfStocks = valueOfStocks;\\n localStorage.setItem(\\\"portfolios\\\", \\\"\\\");\\n localStorage.setItem(\\\"portfolios\\\", JSON.stringify(portfolios));\\n this.setState({ listOfPortfolios: portfolios })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00e2abda539a9f990dfdd5934c201286\",\n \"score\": \"0.4819303\",\n \"text\": \"static get tableName() {\\n\\t\\treturn 'portfolio';\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"003dbff6c27477143997dc6cbe7cbd10\",\n \"score\": \"0.48167118\",\n \"text\": \"function formatPortfolioPosition (currentPosition, calculatedTodaysGainOrLoss, calculatedTotalGainOrLoss) {\\n\\n var portfolioPosition = {\\n\\n objectId: currentPosition.id,\\n name: currentPosition.get(\\\"name\\\"),\\n ticker: currentPosition.get(\\\"ticker\\\"),\\n numberOfShares: parseFloat(currentPosition.get(\\\"numberOfShares\\\")),\\n purchasePrice: parseFloat(currentPosition.get(\\\"purchasePrice\\\")),\\n dateOrderPlaced: currentPosition.createdAt,\\n\\n // Makes sure these numbers have only two decimal places\\n todaysGainOrLoss: parseFloat(calculatedTodaysGainOrLoss.toFixed(2)),\\n totalGainOrLoss: parseFloat(calculatedTotalGainOrLoss.toFixed(2))\\n };\\n\\n return portfolioPosition;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"943a34941fc7116d5afc573e15e346de\",\n \"score\": \"0.48136878\",\n \"text\": \"function Cart(item, amount, price) { // <=== ça, c'est le nom de mon objet\\n this.item = item; // <=== ceci est une propriété\\n this.amount = amount;\\n this.price = price;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8b5ec6a459bc99d51448138fcededc2\",\n \"score\": \"0.4810876\",\n \"text\": \"function createDefaultStock(defaultData, names, prices, changes, changeInPercentages) {\\n for (var i = 0; i < names.length; i++) {\\n defaultData[i] = new StockModel(names[i], prices[i], changes[i], changeInPercentages[i]);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"309f79fecb8e4c374709f07bc94eedd9\",\n \"score\": \"0.48061687\",\n \"text\": \"constructor() {\\n\\n //the variables for this class...\\n\\n var foodStock,lastFed;\\n var foodObj;\\n\\n \\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3c821d3062531669e246b76ecbc56b6\",\n \"score\": \"0.47915336\",\n \"text\": \"function Product(pid, pname, companyName, stock, area) {\\n this.area = area;\\n this.prodId = pid;\\n this.proName = pname;\\n this.compName = companyName;\\n this.availableStock = stock;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c94f101f694a5e942747bbaca680b2f\",\n \"score\": \"0.4790868\",\n \"text\": \"function getPortfolioById( id ){\\n \\t\\t\\tvar i=portfolios.length;\\n \\t\\t\\twhile(i--){\\n \\t\\t\\t\\tif( portfolios[i][\\\"id\\\"] == id){\\n \\t\\t\\t\\t\\treturn portfolios[i];\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t\\treturn null;\\n \\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f00110647c4457650aa69d20b8bd3ea1\",\n \"score\": \"0.47886354\",\n \"text\": \"function CookieStore(storeName, hourlyMin, hourlyMax, avgPerSale){\\n this.storeName = storeName;\\n this.hourlyMin = hourlyMin;\\n this.hourlyMax = hourlyMax;\\n this.avgPerSale = avgPerSale;\\n this.hourlyCustomers = [];\\n this.hourlyCookies = [];\\n this.dailyTotal = 0;\\n CookieStore.allStores.push(this);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dbba37e1f7a0b6d1fbc1c850d23685d\",\n \"score\": \"0.478707\",\n \"text\": \"function TicketPricing() {\\r\\n this.seniorPrice = 8.0;\\r\\n this.kidPrice = 7.0;\\r\\n this.adultPrice = 10.0;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab9cdf362d6fdd27c7d37ae934c3c86b\",\n \"score\": \"0.47733554\",\n \"text\": \"constructor(name, color) {\\n this.name = name;\\n this.color = color;\\n this.position = 0;\\n this.cash = 1000;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b2571f2a3e571c974f559a80227751a\",\n \"score\": \"0.47705987\",\n \"text\": \"function createPortfolio(id, name, value, risk) { \\n if (risk === 0) {\\n risk = 'Low';\\n }\\n if (risk === 1) {\\n risk = 'Medium';\\n }\\n if (risk === 2) {\\n risk = 'High';\\n }\\n return { id, name, value, risk };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e5480431470356c47e66adf1a5ae484\",\n \"score\": \"0.4769364\",\n \"text\": \"constructor (name, color) {\\n this.name = name\\n this.color = color\\n this.position = 0\\n this.cash = 1000\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e2e5639a254af7cd49da4eb0cf6cfa4\",\n \"score\": \"0.47550195\",\n \"text\": \"function FinancialTrackOneData() {\\n \\\"use strict\\\";\\n /**\\n * Contains the account number of the financial card.\\n * @public\\n * @instance\\n * @type {string}\\n */\\n this.accountNumber = \\\"\\\";\\n /**\\n * Contains the first name of the card holder.\\n * @public\\n * @instance\\n * @type {string}\\n */\\n this.firstName = \\\"\\\";\\n /**\\n * Contains the last name of the card holder\\n * @public\\n * @instance\\n * @type {string}\\n */\\n this.lastName = \\\"\\\";\\n /**\\n * Contains the expiration date of the card.\\n * @public\\n * @instance\\n * @type {Date}\\n */\\n this.expiration = false;\\n /**\\n * Contains the service code of the card.\\n * @public\\n * @instance\\n * @type {string}\\n */\\n this.serviceCode = \\\"\\\";\\n /**\\n * Contains any other data the card issuer wanted to include on the first track.\\n * @public\\n * @instance\\n * @type {string}\\n */\\n this.discretionaryData = \\\"\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5a3c2e6d552bfe966e520836d776533\",\n \"score\": \"0.4747795\",\n \"text\": \"function updateArtistPortfolio(artistName) {\\n currentArtistName = artistName;\\n var $portfolio = $(\\\"#artist-portfolio\\\");\\n _clearPortfolio();\\n\\n var url = '/miouzik/songs/' + currentCollection.id + \\\"/\\\" + encodeURIComponent(artistName);\\n return ajax({\\n type: 'GET',\\n url: url,\\n dataType: 'json',\\n success: function(songs) {\\n _clearPortfolio();\\n\\n for (var i=0; i<songs.length; i++) {\\n var uuid = songs[i].uuid;\\n currentPortfolio[uuid] = songs[i];\\n }\\n\\n var albums = {}; // key = album name, value = list of songs\\n var releases = {}; // key = release id, value = release\\n for (var i=0; i<songs.length; i++) {\\n var albumName = songs[i].album;\\n var album = albums[albumName];\\n if (album === undefined)\\n albums[albumName] = album = { name:albumName, year:undefined, songs:[], releaseId:undefined };\\n album.songs.push(songs[i]);\\n if (songs[i].year !== null && songs[i].year !== undefined && album.year === undefined) album.year = songs[i].year;\\n var releaseId = songs[i].discogs.release && songs[i].discogs.release.id;\\n if (releaseId !== null && releaseId !== undefined && releaseId !== 0 && album.releaseId === undefined) album.releaseId = releaseId;\\n if (releaseId !== null && releaseId !== undefined && releaseId !== 0) releases[releaseId] = songs[i].discogs.release;\\n }\\n var songCount = songs.length;\\n var albumCount = Object.keys(albums).length;\\n\\n function newAlbum(album) {\\n var albumSongIds = []; // song IDs in this album (ordered by track number)\\n\\n var $album = $('<div class=\\\"artist-portfolio-album\\\"></div>');\\n var $header = $('<div class=\\\"artist-portfolio-album-header\\\"></div>').appendTo($album);\\n var $cover = $('<div class=\\\"artist-portfolio-album-header-cover\\\"></div>').appendTo($header);\\n var cover = \\\"/miouzik/cover/album/0\\\";\\n if (album.releaseId) cover = \\\"/miouzik/cover/album/\\\" + album.releaseId;\\n $('<img>').attr('src', cover).appendTo($cover);\\n var $caption = $('<div class=\\\"artist-portfolio-album-header-caption\\\"></div>').appendTo($header);\\n $('<h1>').text(album.name).appendTo($caption);\\n var h2 = \\\"\\\";\\n if (album.releaseId && releases[album.releaseId]) {\\n var styles = releases[album.releaseId].style;\\n if (styles && styles.length>0) {\\n for (var i=0; i<styles.length; i++) {\\n if (i>0) h2 = h2 + \\\", \\\";\\n h2 = h2 + styles[i];\\n }\\n }\\n }\\n if (album.year !== null && album.year !== undefined && h2 !== \\\"\\\") h2 = h2 + \\\"\\\\xa0•\\\\xa0\\\";\\n if (album.year !== null && album.year !== undefined) h2 = h2 + album.year;\\n h2 = h2 + \\\"\\\\xa0\\\"; // \\n $('<h2>').text(h2).appendTo($caption);\\n\\n function newSong(index, song) {\\n var $song = $('<div class=\\\"artist-portfolio-album-song\\\"></div>').attr('id', song.uuid);\\n var $like = $('<div class=\\\"artist-portfolio-album-song-like\\\"></div>').appendTo($song);\\n var $trackNumber = $('<div class=\\\"artist-portfolio-album-song-trackNumber\\\"></div>').text(\\\"\\\" + song.trackNumber).appendTo($song);\\n var $play = $('<div class=\\\"artist-portfolio-album-song-play\\\"></div>').appendTo($song);\\n var $title = $('<div class=\\\"artist-portfolio-album-song-title\\\"></div>').text(song.title).appendTo($song);\\n var $download = $('<div class=\\\"artist-portfolio-album-song-download\\\"></div>').appendTo($song);\\n var $duration = $('<div class=\\\"artist-portfolio-album-song-duration\\\"></div>').appendTo($song);\\n $album.append($song);\\n $song.click(function() {\\n $(\\\".artist-portfolio-album-song\\\", $portfolio).toggleClass(\\\"artist-portfolio-album-song--selected\\\", false);\\n $song.toggleClass(\\\"artist-portfolio-album-song--selected\\\", true);\\n });\\n $play.click(function() {\\n playSongs(albumSongIds.slice(index));\\n });\\n }\\n\\n var songs = album.songs.sort(function(a,b) {\\n if (a.trackNumber && b.trackNumber) return a.trackNumber - b.trackNumber; \\n });\\n for (var i=0; i<album.songs.length; i++) {\\n var song = album.songs[i];\\n albumSongIds.push(song.uuid);\\n newSong(i, song);\\n }\\n\\n $album.appendTo($portfolio);\\n }\\n\\n var $header = $('<div class=\\\"artist-portfolio-header\\\"></div>');\\n $('<h1>').text(artistName).appendTo($header);\\n var h2 = \\\"\\\" + albumCount;\\n if (albumCount === 1) h2 = h2 + \\\" album, \\\"; else h2 = h2 + \\\" albums, \\\";\\n h2 = h2 + songCount;\\n if (songCount === 1) h2 = h2 + \\\" song, \\\"; else h2 = h2 + \\\" songs\\\";\\n $('<h2>').text(h2).appendTo($header);\\n $portfolio.append($header);\\n\\n for (var i=0; i<albumCount; i++) {\\n var album = Object.keys(albums)[i];\\n album = albums[album];\\n newAlbum(album);\\n }\\n\\n },\\n error: function(jqxhr, textStatus, error) {\\n flashError(\\\"Failed to load artists\\\", jqxhr.status);\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d05151920a9985f4d66a640bb9132cd6\",\n \"score\": \"0.47473502\",\n \"text\": \"function init_portfolio()\\n{\\n\\t/* --- Hide portfolio excerpts --- */\\n\\t$('.portfolio .cycle .excerpt').css('display', 'none');\\n\\n\\t/* --- Category filter --- */\\n\\tvar speed = 500;\\n\\tvar ease = 'easeOutQuart';\\n\\n\\t$('#category_filter ul li a').click(function(){\\n\\t\\tvar title = $(this).attr('title');\\n\\t\\t$('#category_filter ul li').removeClass('active');\\n\\t\\t$(this).parent('li').addClass('active');\\n\\t\\t$('.portfolio .cycle .elem').each(function(){\\n\\t\\t\\tif(title == 'All') {\\n\\t\\t\\t\\t$(this).removeClass('disable').animate({\\n\\t\\t\\t\\t\\t'opacity' : 1\\n\\t\\t\\t\\t}, speed, ease);\\n\\t\\t\\t} else if(title == $(this).find('h4').text()) {\\n\\t\\t\\t\\t$(this).removeClass('disable').animate({\\n\\t\\t\\t\\t\\t'opacity' : 1\\n\\t\\t\\t\\t}, speed, ease);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t$(this).addClass('disable').animate({\\n\\t\\t\\t\\t\\t'opacity' : 0.1\\n\\t\\t\\t\\t}, speed, ease);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70ed640b52adcf94ff437c2220f7cfc0\",\n \"score\": \"0.4735847\",\n \"text\": \"constructor(scope, id, props) {\\n super(scope, id, { type: CfnPortfolioPrincipalAssociation.CFN_RESOURCE_TYPE_NAME, properties: props });\\n try {\\n jsiiDeprecationWarnings.aws_cdk_lib_aws_servicecatalog_CfnPortfolioPrincipalAssociationProps(props);\\n }\\n catch (error) {\\n if (process.env.JSII_DEBUG !== \\\"1\\\" && error.name === \\\"DeprecationError\\\") {\\n Error.captureStackTrace(error, CfnPortfolioPrincipalAssociation);\\n }\\n throw error;\\n }\\n cdk.requireProperty(props, 'portfolioId', this);\\n cdk.requireProperty(props, 'principalArn', this);\\n cdk.requireProperty(props, 'principalType', this);\\n this.portfolioId = props.portfolioId;\\n this.principalArn = props.principalArn;\\n this.principalType = props.principalType;\\n this.acceptLanguage = props.acceptLanguage;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5fccf2a15b6aa7f3604f23beb587b138\",\n \"score\": \"0.47329685\",\n \"text\": \"function portfolioToHTML( portfolio ){\\n \\t\\t\\t\\n\\t\\t\\tvar $portfolio = $('<div/>');\\n\\t\\t\\tvar $preload = $('<div class=\\\"preload\\\" />');\\n\\t\\t\\t$preload.html('loading images');\\n\\t\\t\\t$portfolio.append($preload);\\n\\t\\t\\t\\n\\t\\t\\t$portfolio.addClass(\\\"portfolio\\\");\\n\\t\\t\\t$portfolio.attr(\\\"id\\\",portfolio.id);\\n\\t\\t\\t$portfolio.attr(\\\"name\\\",portfolio.name);\\n\\t\\t\\t$portfolio.css(\\\"background-color\\\",portfolio.bgColor);\\n\\t\\t\\t$portfolio.css(\\\"height\\\",portfolio.height ? portfolio.height : cam.height);\\n\\t\\t\\t$portfolio.css(\\\"width\\\",portfolio.width ? portfolio.width : cam.width);\\n\\t\\t\\t\\n\\t\\t\\treturn $portfolio;\\n\\t\\t\\n \\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ae9f6bcee3e7ba581d32ea5848f4296\",\n \"score\": \"0.47208723\",\n \"text\": \"constructor(name, price, year){ //metodo contructor\\n this.name= name;\\n this.price= price;\\n this.year= year;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4549393a1619f32aa6f5009f705dbf72\",\n \"score\": \"0.47169143\",\n \"text\": \"function Cart() {\\n this.items = [];\\n this.currentindex = 0;\\n this.total = 0;\\n this.active = {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06de424a30ac709d1a5085d0e693b6b3\",\n \"score\": \"0.4714786\",\n \"text\": \"function getPortfolio() {\\r\\n spinner.show();\\r\\n return new Promise((resolve, reject) => {\\r\\n $.getJSON(\\\"portfolio.json\\\")\\r\\n .done(function (json) {\\r\\n spinner.hide();\\r\\n resolve(json);\\r\\n })\\r\\n .fail(function () {\\r\\n spinner.hide();\\r\\n reject(alert(`Failed to fetch user's portfolio`));\\r\\n });\\r\\n });\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d51d30c2d57a4994673927dcc29b7400\",\n \"score\": \"0.47062087\",\n \"text\": \"function getUserPortfolio(date = new Date().getTime()) {\\n // get all of user's transactions\\n return (async () => {\\n const currentUser = await getCurrentUser();\\n const transactions = currentUser.transactions;\\n\\n // loop through and aggregate data on stocks user owns, # of shares, cost basis, unrealized gains/ losses, % gain/ loss\\n var transaction_length = transactions.length;\\n var n = 0;\\n var portfolio = {};\\n for (n = 0; n < transaction_length; n++) {\\n if (transactions[n]) {\\n if (transactions[n].purchase_date <= date) {\\n if (transactions[n].symbol in portfolio) {\\n var quantity = transactions[n].num_shares;\\n var cost = transactions[n].price * quantity;\\n portfolio[transactions[n].symbol].quantity += quantity;\\n portfolio[transactions[n].symbol].cost_basis += cost;\\n } else {\\n if (transactions[n].symbol != \\\"\\\") {\\n const ticker = transactions[n].symbol;\\n var quantity = transactions[n].num_shares;\\n var cost = transactions[n].price * quantity;\\n portfolio[ticker] = {\\n quantity: quantity,\\n cost_basis: cost,\\n current_value: 0,\\n gain: 0,\\n return: 0,\\n };\\n }\\n }\\n }\\n }\\n }\\n return portfolio;\\n })();\\n // auto-refresh the user account table after the account is made\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e1db079bb4ee838351cd9f7c94340b0\",\n \"score\": \"0.4704433\",\n \"text\": \"function Store(name, minCustPerHour, maxCustPerHour, avgCookieSales){\\n this.name = name;\\n this.minCustPerHour = minCustPerHour;\\n this.maxCustPerHour = maxCustPerHour;\\n this.avgCookieSales = avgCookieSales;\\n this.numOfCookiesProjection = [];\\n stores.push(this);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a6de28c9d555f9eab01ebacd3918bbb\",\n \"score\": \"0.46929225\",\n \"text\": \"function createChart() {\\n\\n\\t\\t\\t\\t$('#highcharts-container').highcharts('StockChart', {\\n\\t\\t\\t\\t\\tchart: {\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\trangeSelector: {\\n\\t\\t\\t\\t\\t\\tselected: 4\\n\\t\\t\\t\\t\\t},\\n\\n\\t\\t\\t\\t\\tyAxis: {\\n\\t\\t\\t\\t\\t\\tlabels: {\\n\\t\\t\\t\\t\\t\\t\\tformatter: function() {\\n\\t\\t\\t\\t\\t\\t\\t\\treturn (this.value > 0 ? '' : '') + this.value + ' USD / MMBtu';\\n\\t\\t\\t\\t\\t\\t\\t\\t//return (this.value > 0 ? '+' : '') + this.value + '%';\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\t\\tplotLines: [{\\n\\t\\t\\t\\t\\t\\t\\tvalue: 0,\\n\\t\\t\\t\\t\\t\\t\\twidth: 2,\\n\\t\\t\\t\\t\\t\\t\\tcolor: 'silver'\\n\\t\\t\\t\\t\\t\\t}]\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tlegend: {\\n\\t\\t\\t\\t\\t\\tenabled: true\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tplotOptions: {\\n\\t\\t\\t\\t\\t\\tseries: {\\n\\t\\t\\t\\t\\t\\t\\t//compare: 'percent',\\n\\t\\t\\t\\t\\t\\t\\tmarker: {\\n\\t\\t\\t\\t\\t\\t\\t\\tenabled: false,\\n\\t\\t\\t\\t\\t\\t\\t\\tstates: {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\thover: {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tenabled: true,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tradius: 3\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\ttooltip: {\\n\\t\\t\\t\\t\\t\\t//pointFormat: '<span style=\\\"color:{series.color}\\\">{series.name}</span>: <b>{point.y}</b> ({point.change}%)<br/>',\\n\\t\\t\\t\\t\\t\\tpointFormat: '<span style=\\\"color:{series.color}\\\">{series.name}</span>: <b>{point.y}</b><br/>',\\n\\t\\t\\t\\t\\t\\tvalueDecimals: 2\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tseries: seriesOptions\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5640657b6a3089e6ab1649c40638e21a\",\n \"score\": \"0.46912032\",\n \"text\": \"function Projector(universeName, dbOptions) {\\n // in the absence of establishing db references in funds and actors,\\n // nulling that out in toJSON override and providing a custom \\n // inflater to lokijs, i will just force singleton pattern for now\\n singletonContinuum = this;\\n\\n\\tthis.universeName = universeName;\\n \\n this.enums = {\\n BalanceType: BalanceTypeEnum,\\n FundClass: FundClassEnum,\\n ActorPeriodicity: ActorPeriodicityEnum,\\n ActivityType: ActivityTypeEnum\\n };\\n \\n this.MAX_DATE = MAX_DATE;\\n this.MIN_DATE = MIN_DATE;\\n\\n this.AddDate = AddDate;\\n\\n dbOptions.actors = { proto: Actor };\\n dbOptions.funds = { proto: Fund };\\n\\n\\tthis.db = new loki(universeName, dbOptions); \\n\\tthis.vol = null;\\n\\tthis.activities = this.db.anonym([]);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a292d74d479a6ac3345e7198677693ba\",\n \"score\": \"0.46851695\",\n \"text\": \"function getDetailedStockPortfolioData (arrayOfStockNames) {\\n\\n // var promiseToGetPortfolioData = new Parse.Promise();\\n\\n // Builds the Yahoo Stock API url for the JSON call\\n var returnedURL = buildStockPortfolioURL(arrayOfStockNames);\\n\\n // This array will hold the final data to return to the client\\n var arrayOfStockData = [];\\n\\n return new Promise(function(resolve, reject) {\\n\\n request({\\n url: returnedURL,\\n json: true\\n }, function (error, response, returnedData) {\\n\\n if (!error && response.statusCode === 200) {\\n\\n var portfolioData = returnedData.query.results.quote\\n\\n // Filters out unnecesary information from JSON request for each stock in portfolio\\n for (i = 0; i < portfolioData.length; i++) {\\n\\n var stockData = formatDetailedStockData(portfolioData[i]);\\n arrayOfStockData[i] = stockData;\\n }\\n\\n resolve (arrayOfStockData);\\n\\n } else {\\n\\n reject (error)\\n }\\n })\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a9de0d094b7568ba5a0fa32b0802d10\",\n \"score\": \"0.46851173\",\n \"text\": \"function Product(name, supplier, sku, priceObj, colors, sizes, financing, link) {\\n this.Name = name;\\n this.Supplier = supplier;\\n this.SKU = sku;\\n this.Pricing = priceObj;\\n this.Colors = colors;\\n this.Sizes = sizes;\\n this.Financing = financing;\\n this.Link = link;\\n this.SearchDate = moment().format('MMMM Do YYYY');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"718b25a8ee9dafd33108ba0eabf1cf46\",\n \"score\": \"0.4681373\",\n \"text\": \"function Stockist(id, name, add1, add2, town, city, postcode, latitude, longitude) {\\n this.id = id;\\n this.name = name;\\n this.address_line_one = add1;\\n this.address_line_two = add2;\\n this.town = town;\\n this.city = city;\\n this.postcode = postcode;\\n this.latitude = latitude;\\n this.longitude = longitude;\\n this.latlng = new google.maps.LatLng(latitude, longitude);\\n this.distance;\\n this.distance_raw;\\n this.duration;\\n this.duration_raw;\\n this.toString = function() {\\n return \\\"id: \\\" + this.id + \\\" name: \\\" + this.name + \\\" latlng: \\\" + this.latlng.toUrlValue(2) + \\\" distance: \\\" + this.distance + \\\" (\\\" + this.distance_raw + \\\" meters) duration: \\\" + this.duration + \\\" (\\\" + this.duration_raw + \\\" secs)\\\";\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5aea2d1bf181c770c47eca6ae6cf5b76\",\n \"score\": \"0.46809337\",\n \"text\": \"function Product(id,title,size,color,designId,price,url,quantity,inStock){\\n\\t//this.id = id,\\n\\tthis.title = title,\\n\\tthis.size = size,\\n\\tthis.color = color,\\n\\tthis.designId = designId,\\n\\tthis.price = price,\\n\\tthis.url = url,\\n\\tthis.quantity = quantity,\\n\\t//this.inStock = function(){\\n\\t//\\treturn this.quantity > 0;\\n\\t//},\\n\\tcart.push(this)\\n\\t//products.push(this)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6fd75aab79eff4eb0c663f72d328067\",\n \"score\": \"0.46781132\",\n \"text\": \"static fromPortfolioArn(scope, id, portfolioArn) {\\n const arn = cdk.Stack.of(scope).splitArn(portfolioArn, cdk.ArnFormat.SLASH_RESOURCE_NAME);\\n const portfolioId = arn.resourceName;\\n if (!portfolioId) {\\n throw new Error('Missing required Portfolio ID from Portfolio ARN: ' + portfolioArn);\\n }\\n class Import extends PortfolioBase {\\n constructor() {\\n super(...arguments);\\n this.portfolioArn = portfolioArn;\\n this.portfolioId = portfolioId;\\n }\\n generateUniqueHash(value) {\\n return (0, util_1.hashValues)(this.portfolioArn, value);\\n }\\n }\\n return new Import(scope, id, {\\n environmentFromArn: portfolioArn,\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44d162847bd310dd59c99e5f0f317bfa\",\n \"score\": \"0.46752867\",\n \"text\": \"function formatStockData (JSONdata) {\\n\\n var stock = {\\n\\n name: JSONdata.Name,\\n symbol: JSONdata.Symbol,\\n currentPrice: parseFloat(JSONdata.LastTradePriceOnly),\\n priceChange: parseFloat(JSONdata.Change),\\n priceChangeInPercent: parseFloat(JSONdata.ChangeinPercent)\\n };\\n\\n return stock;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9858dbd789096d34511ab493147767d1\",\n \"score\": \"0.46749732\",\n \"text\": \"function oSeries() {\\n var oSeries = {\\n // ARRAYS OF FOOTPRINTS\\n aAllEquipment: [],\\n aComputingEquipment: [],\\n aWorkstation: [],\\n aDesktop: [],\\n aIntergated: [],\\n aNotebook: [],\\n // TOTAL FOOTPRINTS\\n iComputingEquipment: 0,\\n iWorkstation: 0,\\n iDesktop: 0,\\n iIntergated: 0,\\n iNotebook: 0,\\n totalFootprint: 0,\\n // QUANTITY OF EQUIPMENT BY CATEGORY\\n iQtyComputingEquipment: 0,\\n iQtyWorkstation: 0,\\n iQtyDesktop: 0,\\n iQtyIntergated: 0,\\n iQtyNotebook: 0,\\n // FLAG\\n loaded: false,\\n\\t\\t// factors\\n\\t\\tconversion_factor: 0,\\n\\t\\tconversion_factor_unit: \\\"N/A\\\"\\n };\\n return oSeries;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49de15ec48fe54b9a6cc9332900a406f\",\n \"score\": \"0.46668193\",\n \"text\": \"function displayStockData(stock) {\\n\\n // Changes top-level display data.\\n let stockHeaderInfo = d3.select('#stock-header-info').html('');\\n stockHeaderInfo.append('h1').attr('id','stockTitle').text(stock);\\n let currentPrice = stockHeaderInfo.append('p');\\n let shares;\\n zwazStocks.forEach(s => {\\n if (s.symbol === stock) {\\n shares = s.shares;\\n }\\n })\\n\\n // Calls API for the selected stock.\\n d3.json(`${finnhubBaseLink}api/v1/quote?symbol=${stock}&token=${finnhub_API_KEY}`).then(stockCall => {\\n let stockObject = {\\n 'symbol': stock,\\n 'prices': {\\n 'open': stockCall.o,\\n 'current': stockCall.c,\\n 'high': stockCall.h,\\n 'low': stockCall.l,\\n 'previousClose': stockCall.pc\\n },\\n 'date': toHumanDate(stockCall.t),\\n }\\n if (stockObject.prices.current === 0) {\\n currentPrice.text('There was an issue retrieving data for this stock.')\\n } else {\\n currentPrice.text(`Current Price: $${stockObject.prices.current}`);\\n let sharesOwned = stockHeaderInfo.append('p').text(`Shares: ${shares}`);\\n let investedSum;\\n investedSum = stockHeaderInfo.append('p').text(`Total Invested: $${(stockObject.prices.current * shares).toFixed(2)}`);\\n }\\n }).catch(error => {\\n fourTwentyNine();\\n })\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7320b4a7db0aa2083c29b78e0eb2a081\",\n \"score\": \"0.46625555\",\n \"text\": \"function PFMPieChart(defaultValues){\\n\\t\\tvar privateState = {};\\n\\t\\t\\tprivateState.cashSpent = defaultValues?(defaultValues[\\\"cashSpent\\\"]?defaultValues[\\\"cashSpent\\\"]:null):null;\\n\\t\\t\\tprivateState.cateforyId = defaultValues?(defaultValues[\\\"cateforyId\\\"]?defaultValues[\\\"cateforyId\\\"]:null):null;\\n\\t\\t\\tprivateState.categoryName = defaultValues?(defaultValues[\\\"categoryName\\\"]?defaultValues[\\\"categoryName\\\"]:null):null;\\n\\t\\t\\tprivateState.errmsg = defaultValues?(defaultValues[\\\"errmsg\\\"]?defaultValues[\\\"errmsg\\\"]:null):null;\\n\\t\\t\\tprivateState.monthId = defaultValues?(defaultValues[\\\"monthId\\\"]?defaultValues[\\\"monthId\\\"]:null):null;\\n\\t\\t\\tprivateState.monthName = defaultValues?(defaultValues[\\\"monthName\\\"]?defaultValues[\\\"monthName\\\"]:null):null;\\n\\t\\t\\tprivateState.totalCashSpent = defaultValues?(defaultValues[\\\"totalCashSpent\\\"]?defaultValues[\\\"totalCashSpent\\\"]:null):null;\\n\\t\\t\\tprivateState.year = defaultValues?(defaultValues[\\\"year\\\"]?defaultValues[\\\"year\\\"]:null):null;\\n\\t\\t//Using parent contructor to create other properties req. to kony sdk\\t\\n\\t\\t\\tBaseModel.call(this);\\n\\n\\t\\t//Defining Getter/Setters\\n\\t\\t\\tObject.defineProperties(this,{\\n\\t\\t\\t\\t\\\"cashSpent\\\" : {\\n\\t\\t\\t\\t\\tget : function(){return privateState.cashSpent},\\n\\t\\t\\t\\t\\tset : function(val){\\n\\t\\t\\t\\t\\t\\tsetterFunctions['cashSpent'].call(this,val,privateState);\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\tenumerable : true,\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\\"cateforyId\\\" : {\\n\\t\\t\\t\\t\\tget : function(){return privateState.cateforyId},\\n\\t\\t\\t\\t\\tset : function(val){\\n\\t\\t\\t\\t\\t\\tsetterFunctions['cateforyId'].call(this,val,privateState);\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\tenumerable : true,\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\\"categoryName\\\" : {\\n\\t\\t\\t\\t\\tget : function(){return privateState.categoryName},\\n\\t\\t\\t\\t\\tset : function(val){\\n\\t\\t\\t\\t\\t\\tsetterFunctions['categoryName'].call(this,val,privateState);\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\tenumerable : true,\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\\"errmsg\\\" : {\\n\\t\\t\\t\\t\\tget : function(){return privateState.errmsg},\\n\\t\\t\\t\\t\\tset : function(val){\\n\\t\\t\\t\\t\\t\\tsetterFunctions['errmsg'].call(this,val,privateState);\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\tenumerable : true,\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\\"monthId\\\" : {\\n\\t\\t\\t\\t\\tget : function(){return privateState.monthId},\\n\\t\\t\\t\\t\\tset : function(val){\\n\\t\\t\\t\\t\\t\\tsetterFunctions['monthId'].call(this,val,privateState);\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\tenumerable : true,\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\\"monthName\\\" : {\\n\\t\\t\\t\\t\\tget : function(){return privateState.monthName},\\n\\t\\t\\t\\t\\tset : function(val){\\n\\t\\t\\t\\t\\t\\tsetterFunctions['monthName'].call(this,val,privateState);\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\tenumerable : true,\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\\"totalCashSpent\\\" : {\\n\\t\\t\\t\\t\\tget : function(){return privateState.totalCashSpent},\\n\\t\\t\\t\\t\\tset : function(val){\\n\\t\\t\\t\\t\\t\\tsetterFunctions['totalCashSpent'].call(this,val,privateState);\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\tenumerable : true,\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\\"year\\\" : {\\n\\t\\t\\t\\t\\tget : function(){return privateState.year},\\n\\t\\t\\t\\t\\tset : function(val){\\n\\t\\t\\t\\t\\t\\tsetterFunctions['year'].call(this,val,privateState);\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\tenumerable : true,\\n\\t\\t\\t\\t},\\n\\t\\t\\t});\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dee40723b4c6d86d7fc30ceb6543d41c\",\n \"score\": \"0.46616706\",\n \"text\": \"function Cart(salesTax, deliveryFee) {\\n this.pizzas = [],\\n this.subTotal = 0,\\n this.salesTax = salesTax,\\n this.totalTax = 0,\\n this.deliveryFee = deliveryFee,\\n this.totalPrice = 0\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"def67baa240a05989fbe40590f8e66c1\",\n \"score\": \"0.4660901\",\n \"text\": \"function formatDetailedStockData (JSONdata) {\\n\\n var stock = {\\n\\n // Basic information\\n name: JSONdata.Name,\\n symbol: JSONdata.Symbol,\\n\\n // Price Data\\n currentPrice: parseFloat(JSONdata.LastTradePriceOnly),\\n priceChange: parseFloat(JSONdata.Change),\\n priceChangeInPercent: parseFloat(JSONdata.ChangeinPercent),\\n marketCap: JSONdata.MarketCapitalization, // Convert this into the appropriate double value PLZ\\n\\n // Stock Details\\n openPrice: parseFloat(JSONdata.Open),\\n previousClose: parseFloat(JSONdata.PreviousClose),\\n daysLowPrice: parseFloat(JSONdata.DaysLow),\\n daysHighPrice: parseFloat(JSONdata.DaysHigh),\\n volume: parseFloat(JSONdata.Volume),\\n averageVolume: parseFloat(JSONdata.AverageDailyVolume),\\n fiftyTwoWeekHigh: parseFloat(JSONdata.YearHigh),\\n fiftyTwoWeekLow: parseFloat(JSONdata.YearLow),\\n shortRatio: parseFloat(JSONdata.ShortRatio),\\n\\n // Stock Metrics\\n earningsPerShare: parseFloat(JSONdata.EarningsShare),\\n dividend: parseFloat(JSONdata.DividendShare),\\n dividendYield: parseFloat(JSONdata.DividendYield),\\n priceToEarnings: parseFloat(JSONdata.PERatio),\\n priceToSales: parseFloat(JSONdata.PriceSales),\\n priceToBook: parseFloat(JSONdata.PriceBook)\\n };\\n\\n return stock;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"680382f87e19ec992c2ed32d3c553ec1\",\n \"score\": \"0.4660335\",\n \"text\": \"render () {\\n const {\\n id,\\n heading=null,\\n byline=null,\\n content=null,\\n modifiers=[],\\n flourishes=[],\\n segments=[],\\n style=\\\"default\\\",\\n children=null,\\n } = this.props\\n\\n let styleModifiers = modifiers\\n styleModifiers.push(style)\\n let portfolioClassModifiers = styleModifiers.map(\\n modifier => \\\"portfolio--\\\" + modifier\\n ).join(\\\" \\\")\\n let visibleSegments = segments.filter(segment => segment.visible !== false)\\n\\n return (\\n <section id={id} className={`portfolio ${ portfolioClassModifiers }`}>\\n {flourishes ? flourishes.map((flourish, i) => <Flourish key={i} category={flourish}/>) : \\\"\\\"}\\n <div className=\\\"portfolio__header\\\">\\n {heading ? <Heading level={1} modifiers={byline ? [\\\"leader\\\"] : [\\\"major\\\"]}>{heading}</Heading> : \\\"\\\"}\\n {byline ? <Heading level={0} modifiers={[\\\"major\\\"]}>{byline}</Heading> : \\\"\\\"}\\n {content ? content.split(\\\"\\\\n\\\\n\\\").map((para, i) => <p key={i}>{para}</p>) : \\\"\\\"}\\n {children}\\n </div>\\n <div className=\\\"portfolio__content\\\">\\n {\\n visibleSegments.map((segment, index) => (\\n <PortfolioSegment key={index} {...segment}/>\\n ))\\n }\\n <PortfolioSegment\\n heading=\\\"Interested in working with us?\\\"\\n content=\\\"Send us a message to find out how we could help with your project\\\"\\n isInfoBox={true}\\n />\\n </div>\\n </section>\\n )\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e67d840d1e95fb995d6c1e8c50658ccd\",\n \"score\": \"0.465805\",\n \"text\": \"function showPortfolio(request) {\\n\\t\\t//first set it to a number (-1 because items start at 0)\\n\\t\\tvar item = mapPortfolioItem(request[1]);\\n\\t\\t\\n\\t\\t$pleftA.eq(item).each(function(){\\n\\t\\t\\t$(this).addClass('current');\\n\\t\\t\\tvar t = getPortfolioItemHtml(item);\\n\\t\\t\\tsetPortfolioItemHtml(t);\\n\\t\\t});\\n\\t\\t$pright.css('opacity',0);\\n\\n\\t\\t\\n\\t\\t$pleftDiv.each(function(i) {\\n\\t\\t\\t$(this).delay(i*speed/3).animate({opacity: 1}, speed);\\n\\t\\t});\\n\\t\\tfadeInPortfolioItem(speed*2);\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c25e5c90f5a932e9b68b8a8bf73d21b\",\n \"score\": \"0.4657995\",\n \"text\": \"function Company (name) {\\n this.company = name;\\n this.creator = hrEmployee;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"275bfc2935aad492e004447267c233be\",\n \"score\": \"0.4656228\",\n \"text\": \"function createAndPushProjects () {\\n // let trivia = new BuildPortfolio(\\\"The Office Trivia Game\\\", \\\"images/portimages/trivia.png\\\", \\\"https://github.com/901david/TriviaGame\\\", \\\"https://901david.github.io/TriviaGame/\\\", \\\"This is a basic trivia game app focused around the hit comedy series - The Office. As you navigate through trivia questions enjoying the hilarious associated animated gifs and sound bites, you will see the quiz is designed to automatically move the user through the quiz using Javascript. At the conclusion of the quiz the user is given a 'grade' on how they did which is based on how many questions they get right and wrong in addition to how much time they take. Can you get an Expert grade?\\\", \\\"Html, Css, Javascript, JQuery\\\");\\n let centennial = new BuildPortfolio(\\\"The Centennial Charge\\\",\\\"images/portimages/charge.png\\\", \\\"https://github.com/901david/centennialCharge\\\", \\\"https://901david.github.io/centennialCharge/\\\", \\\"This was a group project I worked on mainly backend for. The idea was to present ironic Colorado news articles and Colorado styled solutions. My work on this project included creating the live comment system that allows users to interact with each other within the site. This includes re-arranging the comments based on how many likes and dislikes they have received. In addition, I was responsible for using the Ny Times API which was accessed using Ajax calls and then displaying Colorado based 'real' news articles underneath our ironic false ones. Lastly, I assisted in assuring that the site was mobile responsive.\\\", \\\"Html, Css, Javascript, Ajax, Api's, Animate Css, Firebase, JQuery\\\");\\n // let flashCardGen = new BuildPortfolio(\\\"Flash-Card Generator\\\", \\\"images/portimages/flashgen.png\\\", \\\"https://github.com/901david/Flashcard-Generator\\\", \\\"https://901david.github.io/Flashcard-Generator/\\\", \\\"This is a Node based app using constructor functions to create two types of flash cards. User is allowed to create any number of flash cards and once created has the ability to 'study' the group created afterwards.\\\", \\\"Node, Javascript, Inquirer NPM Package\\\");\\n let bamazon = new BuildPortfolio(\\\"Bamazon App\\\", \\\"images/portimages/bamazon.png\\\", \\\"https://github.com/901david/bamazon\\\", \\\"https://901david.github.io/bamazon/\\\", \\\"This is a storefront Node App that allows you to use three separate interfaces: Customer, Manager & Supervisor mode. In each mode you accomplish different tasks in the database. The idea is in each of these interfaces the client is able to purchase items that are listed in the database which updates the database. In other modes you are able to add inventory and products and/or manage departments and total sales.\\\", \\\"Node, Javascript, Inquirer, CLI-Table, MySQL\\\");\\n let flashCardFun = new BuildPortfolio(\\\"FlashCard Fun\\\", \\\"images/portimages/flashfun.png\\\", \\\"https://github.com/901david/Flashcard-Fun\\\", \\\"https://901david.github.io/Flashcard-Fun/\\\",\\\"The inspiration for FlashCard Fun was the Node app I created FlashCard Generator. This web app uses Firebase Authorization to allow users to create usernames. When signed in the user can keep a running tab of Flash Cards they have created to study from. The Flash Cards are also able to be broken down by groups which alllows for maintaining several different subjects you can study. Then you are able to review the cards you have created for studying purposes.\\\", \\\"Html, Bootstrap, Css, Animate Css, Firebase, Javascript, Photoshop, JQuery\\\");\\n let starWars = new BuildPortfolio(\\\"Star Wars Battle\\\", \\\"images/portimages/starwars.png\\\",\\\"https://github.com/901david/star-wars-Battle\\\",\\\"https://901david.github.io/star-wars-Battle/\\\",\\\"This is a Star Wars based JQuery game. It allows a user to choose a character and then with that character they must defeat all the other available chracters to assure victory. May the force be with you!\\\", \\\"Html, Css, Javascript, JQuery\\\");\\n let rockPapSciss = new BuildPortfolio(\\\"Rock Paper Scissors - Multiplayer\\\", \\\"images/portimages/RPS.png\\\", \\\"https://github.com/901david/RPS-Multiplayer\\\", \\\"https://901david.github.io/RPS-Multiplayer/\\\", \\\"This web application is a basic rock, paper, scissors game that uses Firebase to allow to users to play each other. It also has a chat feature to it which allows users to chat with each other while battling it out.\\\", \\\"Html, Css, JQuery, Javascript, Firebase\\\");\\n let liriNode = new BuildPortfolio(\\\"'LIRI' - Node Application\\\", \\\"images/portimages/lirinode.png\\\", \\\"https://github.com/901david/liri-node-app\\\", \\\"https://github.com/901david/liri-node-app\\\", \\\"This is a node application that is a language knock off of the popular SIRI. LIRI takes commands as well through the terminal. Send tweets, look up sounds through spotify and search for movies. This is a fun application that shows you how easily node will integrate with API's to create a fun application\\\", \\\"Node, Javascript, Ajax, Twitter npm, Spotify npm\\\" );\\n\\n portfolioProjects.push(centennial, rockPapSciss, liriNode, flashCardFun,starWars, bamazon);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ae5ecfbfd1c455921f8bf4fe94e5465\",\n \"score\": \"0.46538395\",\n \"text\": \"function Package(data) {\\n this.name = data.name;\\n this.width = data.width;\\n this.height = data.height;\\n this.weight = data.weight;\\n this.location = data.location;\\n this.price = data.price;\\n this.selector = data.selector;\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98839c50fb3717b5fcff3609baafc2b0\",\n \"score\": \"0.46533993\",\n \"text\": \"function CandlestickSeriesDataItem() {\\n var _this = _super.call(this) || this;\\n\\n _this.values.lowValueX = {};\\n _this.values.lowValueY = {};\\n _this.values.highValueX = {};\\n _this.values.highValueY = {};\\n _this.className = \\\"CandlestickSeriesDataItem\\\";\\n\\n _this.applyTheme();\\n\\n return _this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aeedefe5050c050b98b0b793808269ab\",\n \"score\": \"0.46533188\",\n \"text\": \"function collectData()\\n {\\n var stocks = [];\\n var $topNodes = $(\\\"#knowledge-finance-wholepage__financial-entities-list\\\").children();\\n var count =0;\\n for(var ii=0; ii < $topNodes.length; ++ii)\\n {\\n var $topNode = $($topNodes[ii]);\\n var elList = $topNode.find('span:not(:has(*))');\\n\\n if(elList.length == 0)\\n continue;\\n \\n //For NIFTY --> there is no currency. So length is 7 instead of default 8\\n if(elList.length == 7)\\n {\\n elList.splice(2,0,'');\\n }\\n var symbol = DOMUtils.getDomText(elList[0]);\\n var lastPriceEl = elList[1];\\n var currency = DOMUtils.getDomText(elList[2]);\\n var stockCode = DOMUtils.getDomText(elList[3]);\\n var currentState = DOMUtils.getDomText(elList[4]); //Closed:\\n var timeEl = elList[5];\\n var changeEl = elList[6];\\n var percentChangeEl = elList[7];\\n stocks.push(new Stock(symbol, lastPriceEl, stockCode, currency, timeEl, changeEl, percentChangeEl));\\n }\\n //window.stocks = stocks;\\n// console.log(stocks);\\n return stocks;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ce8dbfee767f129c826e2760a5e135a\",\n \"score\": \"0.4647267\",\n \"text\": \"function Figure(type, color, img, index) {\\n this.type = type;\\n this.color = color;\\n this.img = img;\\n if (index) this.index = index;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"636cff64c346092c4755800dc47033e0\",\n \"score\": \"0.4631451\",\n \"text\": \"function refreshPortfolio() {\\n reloadPortfolio = true;\\n loadPortfolio();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":64,"cells":{"query_id":{"kind":"string","value":"317e65450c842cbc416219808b6bac50"},"query":{"kind":"string","value":"Get/Read e.g. get(\" \"_design/viewByName/_view/viewByNames\"); This is the only func that (optionally) takes two parts of a URL. Inconsistent, but it makes the other files neater."},"positive_passages":{"kind":"list like","value":[{"docid":"1ba4cc860f1fe3acd824786290fe9aaf","score":"0.5513797","text":"function get(url, path) {\n // Will join URL and path if two arguments, or just use a single full URL if only one argument.\n if (path) {\n url += path;\n }\n\n return fetch(url)\n .then(function (response) {\n return response.json();\n }).then(function (body) {\n return body;\n });\n}","title":""}],"string":"[\n {\n \"docid\": \"1ba4cc860f1fe3acd824786290fe9aaf\",\n \"score\": \"0.5513797\",\n \"text\": \"function get(url, path) {\\n // Will join URL and path if two arguments, or just use a single full URL if only one argument.\\n if (path) {\\n url += path;\\n }\\n\\n return fetch(url)\\n .then(function (response) {\\n return response.json();\\n }).then(function (body) {\\n return body;\\n });\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"26a6f0203cdd58039d6af52f04a81599","score":"0.59865975","text":"get(uri){\n\n }","title":""},{"docid":"9d7ad6d3ad9b76bb045d3f6aec02f3d5","score":"0.59822434","text":"get(path) {\n if (path && typeof path === \"string\") {\n const split = Page.splitPath(path);\n if (split.pageId) return this.getPage(split.projectId, split.sectionId, split.pageId);\n if (split.sectionId) return this.getSection(split.projectId, split.sectionId);\n if (split.projectId) return this.getProject(split.projectId);\n }\n console.warn(`oak.get(${path}): path not understood`);\n return undefined;\n }","title":""},{"docid":"f7bc7c481b4fd0b87553d9bf8b868352","score":"0.58520037","text":"function doGet( request, response ) {\n var split\n , op\n , arg\n ;\n split = request.url.split('?');\n op = split[0];\n arg = split[1];\n try {\n switch( op ) {\n case '/Materias':\n getSubjects( response );\n break;\n case '/Examenes':\n getExams( qs.parse( arg ), response );\n break;\n case '/Examen':\n getExam( qs.parse( arg ), response );\n break;\n case '/Apuntes':\n getNotes( qs.parse( arg ), response );\n break;\n case '/Apunte':\n getNote( qs.parse( arg ), response );\n break;\n default:\n http.badRequest( response, request.url );\n }\n } catch ( e ) {\n http.internalError( response, e );\n console.log( e );\n }\n}","title":""},{"docid":"a38f8e66d6a3ae4b1dd1919e44f69987","score":"0.58015513","text":"function doGet() {}","title":""},{"docid":"74f0c08d61a08099f28f14b226f28673","score":"0.5793562","text":"function get(name){\n if(name=(new RegExp('[?&]'+encodeURIComponent(name)+'=([^&]*)')).exec(location.search))\n return decodeURIComponent(name[1]);\n}","title":""},{"docid":"a7b0c490c4beee2cdf0569e03a3b2c20","score":"0.5726002","text":"function get(name)\n{\n if(name=(new RegExp('[?&]'+encodeURIComponent(name)+'=([^&]*)')).exec(location.search))\n return decodeURIComponent(name[1]);\n}","title":""},{"docid":"26af61a28ac701be5cb9b620253677e6","score":"0.5626659","text":"function eval_getURLandName() {\n\tvar theArr = [];\n\t\n\ttheArr[0] = 'file:///Volumes' + app.activeDocument.fullName.fullName;\n\ttheArr[1] = app.activeDocument.name;\n\t\n\t//return value must be string...\n\treturn JSON.stringify(theArr);\n}","title":""},{"docid":"65414c8947ec7bdb972e568a191546b4","score":"0.56110686","text":"function getGET( name )\r\n\r\n{\r\n\r\n name = name.replace(/[\\[]/,\"\\\\\\[\").replace(/[\\]]/,\"\\\\\\]\");\r\n\r\n var regexS = \"[\\\\?&]\"+name+\"=([^&#]*)\";\r\n\r\n var regex = new RegExp( regexS );\r\n\r\n var results = regex.exec( window.location.href );\r\n\r\n if( results == null )\r\n\r\n return \"\";\r\n\r\n else\r\n\r\n return results[1];\r\n\r\n}","title":""},{"docid":"d1c119b057c469b28f2fbe06f66fddfb","score":"0.560746","text":"function __GET(parameterName) {return $_GET(parameterName);}","title":""},{"docid":"9fc5999a4a2cdc210a0bbfda82fcfbeb","score":"0.55889875","text":"function superstar_get(robot,path,on_success,on_error)\n{\n\tsuperstar_generic(robot,path,\"?get\",\n\t\tfunction(str) {\n\t\t\tvar json=null;\n\t\t\tif(str!=\"\") json=JSON.parse(str);\n\t\t\ton_success(json);\n\t\t}\n\t,on_error);\n}","title":""},{"docid":"78c1e17423d411ba0070a55c89968d56","score":"0.5534868","text":"function get(name) {\n if (name = (new RegExp('[?&]' + encodeURIComponent(name) + '=([^&]*)')).exec(location.search))\n return decodeURIComponent(name[1]);\n}","title":""},{"docid":"53f9ba97a8a64be871532ad9e78d1984","score":"0.5455785","text":"function get(...args) {\n return request('GET', ...args);\n}","title":""},{"docid":"882b42cf2a2877f3185f28b7e887cc95","score":"0.5448936","text":"function processGET() {\n\tvar parameters = location.search.substring(1).split(\"&\");\n\tvar temp = parameters[0].split(\"=\");\n\tvar name = unescape(temp[1]);\n\treturn name;\n}","title":""},{"docid":"1d6e74b654fc30f0a8215066e4d59ba6","score":"0.5436473","text":"get(path)\n {\n return this.request(path, null, 'GET');\n }","title":""},{"docid":"fb6c19dacc1208d7b4772c3c86f8b4d3","score":"0.54237646","text":"get(url, opt = {}) {\n opt.method = 'GET';\n return this.request(url, opt);\n }","title":""},{"docid":"ab2983bae07715b1d556f666d3ad52fc","score":"0.5348511","text":"function get_url(path, args){\n return args.u || args.url || path\n}","title":""},{"docid":"c5c4e3a2ba9e6ed723e4c9311647dbdc","score":"0.52987504","text":"function get(url) { return request(\"GET\")(url)(null)([\"Nil\"]); }","title":""},{"docid":"5bb70b200d0d5d3faa94d7aec97b1db0","score":"0.5267617","text":"async getDataFromApiForOneField (myUrl,myField){\n\n }","title":""},{"docid":"378089650abaf601f3f545483f59bc6e","score":"0.52581763","text":"function getUrl() {\n var query = window.location.pathname.split(\"/\");\n return \"/editor/\" + query[2] + \"/\" + query[3];\n}","title":""},{"docid":"7901dd69aa93a7a6e432fcde4a2fec75","score":"0.5224757","text":"getDataFromUrl() {\n var aux = location.search.substr(2).split('+');\n\n for (var i = 0; i < aux.length - 1; i++) {\n var aux2 = { id: aux[i], name: aux[++i] }\n this.types.push(aux2);\n }\n this.title = aux[aux.length - 1].split('_').join(' ');\n document.title = this.title;\n }","title":""},{"docid":"22e018320a77b68517f96460f095ef21","score":"0.52245146","text":"static get(url, paramsDict) {\n const processedUrl = NetworkFunc.generateApiUrlPrefix(url);\n\n if (!paramsDict || Object.keys(paramsDict).length == 0) {\n return fetch(processedUrl, {\n credentials: 'same-origin',\n });\n }\n const concatenated = processedUrl + \"?\" + NetworkFunc.mapToSortedQueryParams(paramsDict);\n return fetch(concatenated, {\n credentials: 'same-origin',\n });\n }","title":""},{"docid":"ec3aaea3f8ab5b12b0b95aea75593b56","score":"0.5224465","text":"function getqv(url, name) {\n\t\tvar vars = url.replace(/^[^?]*\\?/, '').split('&'); \n\t\tfor (var i = 0; i < vars.length; i++) {\n\t\t\tvar kv = vars[i].split('=');\n\t\t\tif (decodeURIComponent(kv[0]) == name)\n\t\t\t\treturn decodeURIComponent(kv[1]);\n\t\t}\n\t}","title":""},{"docid":"b4711affacda7dfd1cdd6a396693cc24","score":"0.51845735","text":"function getData (url){\n\t\tlet request=$.get(url);\n\t\treturn request;\n\t}","title":""},{"docid":"0bf962a3ff831ad74826dce5639cd729","score":"0.51772875","text":"function getpage(url) {\n fetch(url).then(response => response.json()).\n then(data => displayNames(data));\n}","title":""},{"docid":"37bd6a43468276c10b6c983310a26b60","score":"0.5140782","text":"getDesignFromUrl( url ){\n let design;\n let expression = /\\/([A-Za-z0-9-]*)-a-/;\n let designArray = expression.exec( url );\n\n if( designArray ){\n design = designArray[1];\n }\n\n return design;\n }","title":""},{"docid":"28e3f7afbd8ff26267e84943e298c6ab","score":"0.5139617","text":"get (url) {\n return this.makeRequest(url)\n }","title":""},{"docid":"65773bf823dc751f1f51aea240156a4d","score":"0.5120198","text":"function loadGedcomRec(recType, recId) {\n var urlPref = \"http://localhost:8080/gedcom-web/rest/\";\n // sample: \"http://localhost:8080/gedcom-web/rest/person/1/xml\";\n var url = urlPref+recType+\"/\"+recId+\"/xml\";\n //alert(\"url: \" + url);\n loadXMLDoc(url);\n}","title":""},{"docid":"9e5d29a5faa82a1548659c85488f6dea","score":"0.511212","text":"function getFromurl(Name, Def) {\n if (arguments.length < 2 ) Def=false;\n var search = Name + \"=\"\n var surl = new String(document.URL);\n \n if (surl.length > 0) { \t// if there are any Url\n offset = surl.indexOf(search)\n if (offset != -1) { \t\t\t// if var exists\n offset += search.length\n\t\t\t\t\t\t\t // set index of beginning of value\n end = surl.indexOf(\"&\", offset)\n\t\t\t\t\t\t // set index of end of cookie value\n if (end == -1)\n end = surl.length;\n return unescape(surl.substring(offset, end))\n }\n }\n return Def;\n}","title":""},{"docid":"bc00e43572eab8e3cc6822ec40047172","score":"0.51102126","text":"get(url, options) {\n return this.fetch(...arguments, {\n method: \"GET\",\n });\n }","title":""},{"docid":"f032b66ccf857fa266c3287b201f6de3","score":"0.5101368","text":"get(url, options = {}) {\n return this.request('GET', url, options);\n }","title":""},{"docid":"f032b66ccf857fa266c3287b201f6de3","score":"0.5101368","text":"get(url, options = {}) {\n return this.request('GET', url, options);\n }","title":""},{"docid":"f032b66ccf857fa266c3287b201f6de3","score":"0.5101368","text":"get(url, options = {}) {\n return this.request('GET', url, options);\n }","title":""},{"docid":"f032b66ccf857fa266c3287b201f6de3","score":"0.5101368","text":"get(url, options = {}) {\n return this.request('GET', url, options);\n }","title":""},{"docid":"0f5cb035dea0415e7d438854a2776695","score":"0.5100324","text":"static get(g, a=true) {\n if (a === true) a = location.href\n if (!a) return null\n a = Url.url2a(a)\n let i, gets = {}\n const args = a.search ? a.search.replace(/^\\?/, '').split('&') : []\n for (i=0; i<args.length; i++) {\n const v = args[i].split('=')\n gets[v[0]] = decodeURIComponent(v[1].replace(/\\+/g, ' '))\n }\n return g === true ? gets : gets[g]\n //protocol, host (hostname, port), pathname, search, hash\n }","title":""},{"docid":"346a41a74ff38b2196cb965c7fe2a98e","score":"0.50973976","text":"_getUrl(path)\n{\n return `${this._baseUri}/${path}`\n}","title":""},{"docid":"81b69010998c7fcb6fe571bc2a82f20b","score":"0.5092243","text":"getAccess(id1, id2) {\n return http.get(`/employee-service/employee/checkvalid/${id1}/${id2}`);\n }","title":""},{"docid":"ce4c18f16b86a6b63dc647f851eb317c","score":"0.5086703","text":"function readURL() {\n\n\t\tvar hash = window.location.hash;\n\n\t\t// Attempt to parse the hash as either an index or name\n\t\tvar bits = hash.slice( 2 ).split( '/' ),\n\t\t\tname = hash.replace( /#|\\//gi, '' );\n\n\t\t// If the first bit is invalid and there is a name we can\n\t\t// assume that this is a named link\n\t\tif( isNaN( parseInt( bits[0], 10 ) ) && name.length ) {\n\t\t\t// Find the slide with the specified name\n\t\t\tvar element = document.querySelector( '#' + name );\n\n\t\t\tif( element ) {\n\t\t\t\t// Find the position of the named slide and navigate to it\n\t\t\t\tvar indices = Reveal.getIndices( element );\n\t\t\t\tslide( indices.h, indices.v );\n\t\t\t}\n\t\t\t// If the slide doesn't exist, navigate to the current slide\n\t\t\telse {\n\t\t\t\tslide( indexh || 0, indexv || 0 );\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\t// Read the index components of the hash\n\t\t\tvar h = parseInt( bits[0], 10 ) || 0,\n\t\t\t\tv = parseInt( bits[1], 10 ) || 0;\n\n\t\t\tif( h !== indexh || v !== indexv ) {\n\t\t\t\tslide( h, v );\n\t\t\t}\n\t\t}\n\n\t}","title":""},{"docid":"b3f0016321d43783b45d1ed156712b46","score":"0.507615","text":"function getSetfromURL(){\n console.log(\"entered get set url\");\n var path = window.location.pathname;\n var pathParts = path.split('/');\n return pathParts[1];\n}","title":""},{"docid":"2793c26e62e434c9a74339f12fa3c175","score":"0.5075483","text":"get(uri) {\r\n return this._documents[uri];\r\n }","title":""},{"docid":"2793c26e62e434c9a74339f12fa3c175","score":"0.5075483","text":"get(uri) {\r\n return this._documents[uri];\r\n }","title":""},{"docid":"99f84ca032161f50bf518550b67f0adb","score":"0.5055773","text":"get(name, locals) {\n\n }","title":""},{"docid":"02f8d1c5657ccd6d8fe945d5ab60ec10","score":"0.5054413","text":"Get() {}","title":""},{"docid":"35ccdca7b3b9f245ae98265d68c44121","score":"0.50536376","text":"@Get('/:name(@[\\\\w\\\\-\\\\.]+\\/[\\\\w\\\\-\\\\.]+)/:d(download|\\-)/:filename(.+)')\n @Middleware('limit')\n @Middleware('download')\n async dowload_with_scope(ctx, next) {\n console.log('get i', ctx.params)\n return 1;\n }","title":""},{"docid":"f96af45a780e837a4e9c1119d980aa63","score":"0.50478333","text":"function urlRequest(paras) //获取url参数方法\n{\n var url = location.href;\n var paraString = url.substring(url.indexOf(\"?\") + 1, url.length).split(\"&\");\n var paraObj = {}\n for (i = 0; j = paraString[i]; i++) {\n paraObj[j.substring(0, j.indexOf(\"=\")).toLowerCase()] = j.substring(j.indexOf(\"=\") + 1, j.length);\n }\n var returnValue = paraObj[paras.toLowerCase()];\n if (typeof(returnValue) == \"undefined\") {\n return \"\";\n } else {\n return returnValue;\n }\n}","title":""},{"docid":"8bcca7a4884a21fa73960f632ebf044c","score":"0.5045588","text":"getUrl(fileName){\n DB.GetPostUrl(fileName)\n}","title":""},{"docid":"a4e9cb774659d63ce114754392a5eb8f","score":"0.50448334","text":"get(id) {\r\n return http.get(`/id/${id}`);\r\n }","title":""},{"docid":"ca3ed8929f93d477271c375aa5f6da87","score":"0.50444514","text":"function httpGet(theUrl) {\n var xmlHttp = new XMLHttpRequest();\n xmlHttp.open(\"GET\", theUrl, false);\n xmlHttp.send(null);\n return xmlHttp.responseText;\n }","title":""},{"docid":"fc932a22beb0c4961fb750dd0bf23a96","score":"0.50395703","text":"async get (id, params) {\r\n\r\n\t}","title":""},{"docid":"8ff34cb7f5335720d18e7a28f81a99d9","score":"0.50284314","text":"function UrlUtil() {}","title":""},{"docid":"ed1213238129f13678739bfe6d6448da","score":"0.5016573","text":"function get(url) {\n return resourceCache[url];\n }","title":""},{"docid":"e5891b6ab3bd4532345ff4490e5fcac3","score":"0.5012619","text":"get(url) {\n if (arguments.length > 1 || url.indexOf('/') !== -1) {\n throw new Ember.Error('It seems you tried to use `.get` to make a request! Use the `.request` method instead.');\n }\n return this._super(...arguments);\n }","title":""},{"docid":"d4313b03c43396a3d822e4b85ece3431","score":"0.5011723","text":"static _get(url, body, success, failure) {\n let ajax = {\n method: 'GET'\n };\n let path = url;\n if (body) {\n let params = Object.keys(body).map((key) => {\n return key + \"=\" + body[key];\n });\n path += '?' + params.join('&');\n }\n\n this._request(path, ajax, success, failure);\n }","title":""},{"docid":"fb68f86014a410c209374869b4d89f84","score":"0.5004891","text":"function getOverload() {\n\n\t\t/**\n\t\t * Overload Cldr.prototype.get().\n\t\t */\n\t\tsuperGet = Cldr.prototype.get;\n\t\tCldr.prototype.get = function( path ) {\n\t\t\tvar value = superGet.apply( this, arguments );\n\t\t\tpath = pathNormalize( path, this.attributes ).join( \"/\" );\n\t\t\tglobalEe.trigger( \"get\", [ path, value ] );\n\t\t\tthis.ee.trigger( \"get\", [ path, value ] );\n\t\t\treturn value;\n\t\t};\n\t}","title":""},{"docid":"da1c381a859343b92d86eea17b534511","score":"0.4996298","text":"get(url) {\n if (arguments.length > 1 || url.indexOf('/') !== -1) {\n throw new Ember.Error('It seems you tried to use `.get` to make a request! Use the `.request` method instead.');\n }\n return this._super(...arguments);\n }","title":""},{"docid":"75781162629b94e56eede95fa91c68d1","score":"0.4990979","text":"function GET(v)\n{\n if (!HTTP_GET_VARS[v]) {\n return 'undefined';\n }\n return HTTP_GET_VARS[v];\n}","title":""},{"docid":"7ff03a8b7a24677abbee493539d1df6c","score":"0.49840558","text":"async function GET(url){\n return await global.client.fetch( url, {method:\"GET\"} )\n}","title":""},{"docid":"1ab3f9f4ee35f6814c1e1ac2ba7c0302","score":"0.49746946","text":"function getOverload() {\n \t /**\n \t * Overload Cldr.prototype.get().\n \t */\n \t superGet = Cldr.prototype.get;\n \t Cldr.prototype.get = function (path) {\n \t var value = superGet.apply(this, arguments);\n \t path = pathNormalize(path, this.attributes).join(\"/\");\n \t globalEe.trigger(\"get\", [path, value]);\n \t this.ee.trigger(\"get\", [path, value]);\n \t return value;\n \t };\n \t }","title":""},{"docid":"9dc1be4c1991c118e0d959c80c5fc91a","score":"0.4971064","text":"function Url(){}","title":""},{"docid":"e8c7ea03d3d55cc2b1df98c46e6d33e5","score":"0.4951248","text":"function get(url, data, callback) { request(\"GET\", url, data, callback) }","title":""},{"docid":"df196a3fce2de7cdd69c3f836d67e1ba","score":"0.49492663","text":"static get(...args) {\n let url = this.getItemUrl(...args);\n\n // Must be caught later\n return this.fetcher.get(url).then(({ response, headers, status }) => {\n let ret = this.fromJSON(response);\n ret.__meta = { headers, status, response };\n return ret;\n });\n }","title":""},{"docid":"089f4af7e32c43e7cb0b3863422304fc","score":"0.4942577","text":"function httpGet(theUrl) {\n\tvar xmlHttp = new XMLHttpRequest();\n\txmlHttp.open(\"GET\", theUrl, false); // false for synchronous request\n\txmlHttp.send(null);\n\treturn xmlHttp.responseText;\n}","title":""},{"docid":"f7601dc135c26e5e7db651ac8e8ffcd1","score":"0.49368176","text":"get(uri) {\n return this._documents[uri];\n }","title":""},{"docid":"8a3c7569eba6f38fd5feb2be4cfb49b2","score":"0.4935438","text":"function backwardCompat_get(opt, path) {\r\n var pathArr = path.split(',')\r\n var obj = opt\r\n\r\n for (var i = 0; i < pathArr.length; i++) {\r\n obj = obj && obj[pathArr[i]]\r\n\r\n if (obj == null) {\r\n break\r\n }\r\n }\r\n\r\n return obj\r\n }","title":""},{"docid":"4593077efdf22daa183328c78d5ec5fa","score":"0.4908732","text":"function getPeople(url) {\n return getJSON(url);\n}","title":""},{"docid":"6ad4d69506f3b36382814bdfadab5d24","score":"0.4905097","text":"async get(uri, opts){\n let req = {\n method: 'GET'\n };\n try{\n let qstring = qs.stringify(opts);\n req.uri = `${uri}${qstring?'?'+qstring:''}`;\n debug(`GET ${req.uri}`);\n\n let resp = await this.baseRequest(req);\n return this.handleResponse(resp, null, req);\n\n }catch(ex){\n return this.handleResponse(ex, null, req);\n }\n }","title":""},{"docid":"001b5496e65ac471f7224ab9481b28d5","score":"0.48965928","text":"function resolve(url, urls) {\n // Match a url\n // Return a url, or undefined\n if (url.indexOf('?') != -1)\n url = url.split('?')[0];\n for(var i=0; i<urls.length; i++) {\n var regex = new RegExp(urls[i][0]);\n var view = urls[i][1];\n var match = url.match(regex);\n if (match != null) {\n return view;\n }\n }\n return undefined;\n}","title":""},{"docid":"ee27e33a7b6da2108f8cb352aa6d50d8","score":"0.48953038","text":"function requestGet(url, params) {\n\t\t\treturn handleResponse($http.get(url, { params: params }));\n\t\t}","title":""},{"docid":"2aee530c2b2ef3ac7fdf261c1afa57bc","score":"0.48921746","text":"get (request, response, name) {\n return this._host.get(name).then(repr => {\n response.setHeader('Content-Type', 'application/json')\n response.end(JSON.stringify(repr))\n })\n }","title":""},{"docid":"59f7039748e900e5b05e866ad0c34068","score":"0.4891896","text":"function fetchData(url) {\n var option = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n return model.dataAccessHelper.fetchText(publicAPI, url, option);\n }","title":""},{"docid":"59f7039748e900e5b05e866ad0c34068","score":"0.4891896","text":"function fetchData(url) {\n var option = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n return model.dataAccessHelper.fetchText(publicAPI, url, option);\n }","title":""},{"docid":"59f7039748e900e5b05e866ad0c34068","score":"0.4891896","text":"function fetchData(url) {\n var option = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n return model.dataAccessHelper.fetchText(publicAPI, url, option);\n }","title":""},{"docid":"c2f9769c5c47c07efbf5582bc3c91d5d","score":"0.48783162","text":"function get(param){\n var value = expand.get(param);\n return value;\n}","title":""},{"docid":"f8ca20f13c84ad545e7cc5d692226f26","score":"0.48781118","text":"function redirectGet(entry) {\n if( entry !== 'error.2.0.json') {\n entry = 'redfish-1.0/' + entry;\n }\n return fs.readFileAsync(__dirname + '/../../../../data/views/' + entry, 'utf-8')\n .then(function(contents) {\n return { contents: contents };\n });\n }","title":""},{"docid":"bf51a51195679a1b08725d5aa40eb874","score":"0.48737764","text":"function _api_get(path, format, values, callback) {\n self.consumer.get(\n self.options.api_url + path + \".\" + format + \"?\" + (util.isArray(values) ? values.join('&') : values.toString()),\n self.token.access.token,\n self.token.access.secret,\n function (error, data) {\n if (error) {\n console.error(error);\n callback(error, null);\n } else {\n callback(null, data);\n }\n }\n );\n }","title":""},{"docid":"3408865092d1a4bdc0c7619aeef57755","score":"0.4869115","text":"async get(path, setShowLoading) {\n return doRequest(path, setShowLoading, 'GET');\n }","title":""},{"docid":"3811c94a8157e6cbdd501bc6f5330d06","score":"0.48668364","text":"function get(opt, path) {\n var pathArr = path.split(',');\n var obj = opt;\n\n for (var i = 0; i < pathArr.length; i++) {\n obj = obj && obj[pathArr[i]];\n\n if (obj == null) {\n break;\n }\n }\n\n return obj;\n}","title":""},{"docid":"3811c94a8157e6cbdd501bc6f5330d06","score":"0.48668364","text":"function get(opt, path) {\n var pathArr = path.split(',');\n var obj = opt;\n\n for (var i = 0; i < pathArr.length; i++) {\n obj = obj && obj[pathArr[i]];\n\n if (obj == null) {\n break;\n }\n }\n\n return obj;\n}","title":""},{"docid":"00d67daa1812627001b5c6376f3951d7","score":"0.48599187","text":"function get(opt, path) {\n path = path.split(',');\n var obj = opt;\n for (var i = 0; i < path.length; i++) {\n obj = obj && obj[path[i]];\n if (obj == null) {\n break;\n }\n }\n return obj;\n}","title":""},{"docid":"cbbfb985049be60f6ced76ed1e593db6","score":"0.48566434","text":"function Get(yourUrl) {\n\tvar Httpreq = new XMLHttpRequest(); // a new request\n\tHttpreq.open(\"GET\", yourUrl, false);\n\tHttpreq.send(null);\n\treturn Httpreq.responseText;\n}","title":""},{"docid":"e63931318f576addb6b2d1004f1efce1","score":"0.4850001","text":"function httpGet(theUrl) {\r\n var xmlHttp = new XMLHttpRequest();\r\n xmlHttp.open( \"GET\", theUrl, false); // false for synchronous request\r\n xmlHttp.send(null);\r\n return xmlHttp.responseText;\r\n}","title":""},{"docid":"bddd1b963ad2261a74cd3178a3b7bbbb","score":"0.48490855","text":"function _getParam(url,key){\n\n\t\t\tkey = key.replace(/[\\[]/,\"\\\\\\[\").replace(/[\\]]/,\"\\\\\\]\");\n\t\t\tvar regexS = \"[\\\\?&]\"+key+\"=([^&#]*)\";\n\t\t\tvar regex = new RegExp( regexS );\n\t\t\tvar results = regex.exec( url );\n\t\t\treturn ( results == null ) ? \"\" : results[1];\n\n\t\t}","title":""},{"docid":"9d706a92a12b572c65223bd588f54e74","score":"0.4845832","text":"function aGet(uri) {\r\n var request = Url.parse(uri);\r\n request.headers = {\r\n 'Authorization': 'Bearer ' + auth.credentials.access_token\r\n }\r\n request.method = \"GET\"\r\n var bits = new Stream.PassThrough();\r\n https.request(request, function(res) {\r\n console.error(\"[LOG] Fetching Document\", res.statusCode)\r\n res.pipe(bits);\r\n }).on('error', function(err) {\r\n console.error(\"[ERROR]\",err);\r\n }).end();\r\n return bits;\r\n}","title":""},{"docid":"cd275c40088a77c8edbbab0046dee22d","score":"0.48456573","text":"function doGet(e) {}","title":""},{"docid":"c38128c0c96fa9c4f182c560f9b7bff5","score":"0.4845432","text":"static getItemUrl(...args) {\n let params = args[0];\n if (!params.id) {\n throw new ArgumentError(`[Model][${this.constructor.name}] id is mandatory`);\n }\n\n let query = args[1];\n let queryString = this.getQueryString(query);\n\n return `${this.getListUrl(args[0])}/${params.id}${queryString}`;\n }","title":""},{"docid":"77ed523a9e5b75071c7945c406627935","score":"0.48380244","text":"get(path, query = {}, options = {}) {\n return this.request(`${path}?${!isBlank(query) ? new URLSearchParams(query).toString() : ''}`, 'GET', options);\n }","title":""},{"docid":"da0e879460cfbf80190f42ae764128f0","score":"0.48347116","text":"function searchName(request) {\n let miURL = url.parse(request.url, true);\n var mod = modelSearch();\n\n //Con For\n for (i = 0; i < mod.length; i++) {\n if (miURL.query.n === mod[i].nombre) {\n var n = mod[i].nombre\n var aP = mod[i].apellido_paterno\n var aM = mod[i].apellido_materno\n return n + \" \" + aP + \" \" + aM;\n\n }\n }\n}","title":""},{"docid":"82bc598fefdfe8d400c008d2bda896eb","score":"0.48344198","text":"function loadContextFromUrl()\n {\n var querystring = $.deparam.querystring();\n site = querystring.site;\n view = querystring.view;\n mode = querystring.mode;\n path = querystring.path;\n id = querystring.id;\n name = querystring.name;\n debug = querystring.debug;\n autoTest = querystring.at;\n pathType = querystring.pathType;\n warningMessage = querystring.warningMessage;\n\n javascriptOff = (querystring.disableJS === \"true\" ? true : false);\n if(typeof(querystring.memento) != \"undefined\")\n {\n memento = JSON.parse(decodeURIComponent(querystring.memento));\n }\n }","title":""},{"docid":"0a3f40aeeb25eff5f37a8e75ee292ea3","score":"0.4832804","text":"function get_gets() {\n function transformToAssocArray(prmstr) {\n var params = {};\n var prmarr = prmstr.split(\"&\");\n for (var i = 0; i < prmarr.length; i++) {\n var tmparr = prmarr[i].split(\"=\");\n params[tmparr[0]] = tmparr[1];\n }\n return params;\n }\n var prmstr = window.location.search.substr(1);\n Project.get_vars =\n prmstr !== null && prmstr !== \"\" ? transformToAssocArray(prmstr) : {};\n\n // maybe the following is left over from the simulator?\n if (typeof Project.get_vars.name !== \"undefined\") {\n exp_condition = Project.get_vars.name;\n } else {\n exp_condition = \"\";\n }\n if (Project.get_vars.platform === \"preview\") {\n online_data_obj.finished_and_stored = true;\n }\n Project.activate_pipe();\n}","title":""},{"docid":"b7bcbaea2249d79669ab6fa25ba03f17","score":"0.48315832","text":"function httpGet(theUrl) {\n var xmlHttp = null;\n xmlHttp = new XMLHttpRequest();\n xmlHttp.open( \"GET\", theUrl, false );\n xmlHttp.send( null );\n return xmlHttp.responseText;\n}","title":""},{"docid":"fe0b93a998a4d74fed862361c6c02591","score":"0.48237243","text":"get(params, callback) {\n\n this.client.get(params, function (err, response) {\n if (err) {\n this._logger.error(err);\n return callback(err);\n }\n\n if (!response._source) {\n return callback(new Error('404 - error')); // TODO\n }\n\n callback(err, response._source);\n }.bind(this));\n }","title":""},{"docid":"996bfcbccd2878b3070cbb7d5cdbb42a","score":"0.4823664","text":"function getUrlArg(name, def, url) {\n if (!url) url = window.location.href;\n name = name.replace(/[\\[\\]]/g, '\\\\$&');\n var regex = new RegExp('[?&]' + name + '(=([^&#]*)|&|#|$)'),\n results = regex.exec(url);\n if (!results) return def;\n if (!results[2]) return def;\n return decodeURIComponent(results[2].replace(/\\+/g, ' '));\n}","title":""},{"docid":"474430c47d7ef2d3b232c1d50d38738c","score":"0.48151428","text":"function url(){\n return \"https://en.wikipedia.org/w/api.php?action=query&format=json&list=search&utf8=1&srsearch=Albert+Einstein\";\n}","title":""},{"docid":"47c2f791bfee1930953d1d095f4161d2","score":"0.4813976","text":"function selectedPath () { \ntry { \nvar ref = new ActionReference(); \nref.putEnumerated( charIDToTypeID(\"Path\"), charIDToTypeID(\"Ordn\"), charIDToTypeID(\"Trgt\") ); \nvar desc = executeActionGet(ref); \nvar theName = desc.getString(charIDToTypeID(\"PthN\")); \nreturn app.activeDocument.pathItems.getByName(theName) \n} \ncatch (e) { \nreturn undefined \n} \n}","title":""},{"docid":"d0e1933387f6a3729dc8741f7143bbf5","score":"0.4809196","text":"function getUrl() {\n let query = new URLSearchParams(window.location.search).get('v');\n if (typeof query === \"string\") {\n return query;\n }\n return undefined;\n}","title":""},{"docid":"427dd32d7d9e8b384af5dff8afd57af3","score":"0.48074207","text":"function httpGet(theUrl) {\n var xmlHttp = null;\n xmlHttp = new XMLHttpRequest();\n xmlHttp.open(\"GET\", theUrl, false);\n xmlHttp.send(null);\n return xmlHttp.responseText;\n}","title":""},{"docid":"6fee1897210589f6ce3daca327a38642","score":"0.48045653","text":"function getIndexFromUrl(url){\n return url.split(\"/\").slice(-2);\n }","title":""},{"docid":"607c25a5730739cbf4edd300293255dc","score":"0.47989756","text":"function secondPart(value) {\n var request = new XMLHttpRequest();\n request.open('GET', value);\n request.responseType = 'json';\n request.send();\n request.onload = function () {\n controller(request.response);\n }\n }","title":""},{"docid":"21b51e3d94c10f43943e7b6bee51fe4e","score":"0.4798565","text":"async function getAPI(page, getContents) {\n\t\tif (page.title && page.properties && page.id && page.tags && (!getContents || page.content))\n\t\t\treturn page;\n\t\telse if (typeof page === 'string')\n\t\t\tpage = {\n\t\t\t\turl: page\n\t\t\t};\n\t\tpage.url = page.url.replace('?contentOnly', '');\n\t\t\n\t\tlet [subdomain, path] = parseURL(page.url);\n\t\t// console.log(page.url);\n\t\tlet response = await authenticatedFetch(path, `?dream.out.format=json${getContents ? '&include=contents' : ''}`, subdomain);\n\t\tif (response.ok) {\n\t\t\tresponse = await response.json();\n\t\t\tlet {properties, tags, files} = response;\n\t\t\tif (properties['@count'] !== '0' && properties.property) {\n\t\t\t\tproperties = properties.property.length ? properties.property : [properties.property]\n\t\t\t\tproperties = properties.map((prop) => {\n\t\t\t\t\tif (prop['@revision']) return {name: prop['@name'], value: prop.contents['#text']};\n\t\t\t\t\telse return prop\n\t\t\t\t});\n\t\t\t}\n\t\t\telse {\n\t\t\t\tproperties = [];\n\t\t\t}\n\t\t\tif (tags.tag) {\n\t\t\t\ttags = tags.tag.length ? tags.tag : [tags.tag];\n\t\t\t}\n\t\t\telse {\n\t\t\t\ttags = []\n\t\t\t}\n\t\t\tif (files.file) {\n\t\t\t\tfiles = files.file.length ? files.file : [files.file];\n\t\t\t\tfiles = files.map((file) => {\n\t\t\t\t\treturn {\n\t\t\t\t\t\t'id': file['@id'],\n\t\t\t\t\t\t'revision': file['@revision'],\n\t\t\t\t\t\t'href': file['@href'],\n\t\t\t\t\t\t'contents': file['contents'],\n\t\t\t\t\t\t'created': file['date.created'],\n\t\t\t\t\t\t'filename': file['filename']\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfiles = []\n\t\t\t}\n\t\t\ttags = tags.map((elem) => elem.title);\n\t\t\tpage.id = parseInt(response['@id']);\n\t\t\tpage.title = page.title || response.title;\n\t\t\tpage.tags = page.tags || tags;\n\t\t\tpage.properties = page.properties || properties;\n\t\t\tpage.subdomain = subdomain;\n\t\t\tpage.files = page.files || files;\n\t\t\tpage.path = response.path['#text'];\n\t\t\tpage.modified = new Date(response['date.modified']);\n\t\t\tpage.content = response.content;\n\t\t\tif (response['page.parent'])\n\t\t\t\tpage.parentID = parseInt(response['page.parent']['@id']);\n\t\t\tif (response.security && response.security['permissions.effective']) {\n\t\t\t\tlet permissions = response.security['permissions.effective'].operations['#text'];\n\t\t\t\tif (permissions.includes('CHANGEPERMISSIONS'))\n\t\t\t\t\tpage.security = 'Editor';\n\t\t\t\telse if (permissions.includes('UPDATE'))\n\t\t\t\t\tpage.security = 'Author';\n\t\t\t\telse if (permissions.includes('READ'))\n\t\t\t\t\tpage.security = 'Viewer';\n\t\t\t}\n\t\t\t\n\t\t}\n\t\telse {\n\t\t\tlet error = await response.json();\n\t\t\t// console.error(`Can't get ${page.url}`);\n\t\t\tpage.subdomain = subdomain;\n\t\t\tpage.path = path;\n\t\t\tpage.modified = 'restricted';\n\t\t\tpage.error = error;\n\t\t}\n\t\treturn page;\n\t}","title":""},{"docid":"6ed1ce3ed474b3191fed76acf74cdc9b","score":"0.47927576","text":"function get(query) {\n\treturn request(\"GET\", query);\n}","title":""},{"docid":"b9414dba3dd73086449c690f8e6d0ca3","score":"0.4785656","text":"function Get(Url) {\n var XMLHttpRequest = require(\"xmlhttprequest\").XMLHttpRequest;\n var xhr = new XMLHttpRequest();\n xhr.open(\"GET\", Url, false);\n xhr.send(null);\n return xhr.responseText;\n}","title":""}],"string":"[\n {\n \"docid\": \"26a6f0203cdd58039d6af52f04a81599\",\n \"score\": \"0.59865975\",\n \"text\": \"get(uri){\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d7ad6d3ad9b76bb045d3f6aec02f3d5\",\n \"score\": \"0.59822434\",\n \"text\": \"get(path) {\\n if (path && typeof path === \\\"string\\\") {\\n const split = Page.splitPath(path);\\n if (split.pageId) return this.getPage(split.projectId, split.sectionId, split.pageId);\\n if (split.sectionId) return this.getSection(split.projectId, split.sectionId);\\n if (split.projectId) return this.getProject(split.projectId);\\n }\\n console.warn(`oak.get(${path}): path not understood`);\\n return undefined;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7bc7c481b4fd0b87553d9bf8b868352\",\n \"score\": \"0.58520037\",\n \"text\": \"function doGet( request, response ) {\\n var split\\n , op\\n , arg\\n ;\\n split = request.url.split('?');\\n op = split[0];\\n arg = split[1];\\n try {\\n switch( op ) {\\n case '/Materias':\\n getSubjects( response );\\n break;\\n case '/Examenes':\\n getExams( qs.parse( arg ), response );\\n break;\\n case '/Examen':\\n getExam( qs.parse( arg ), response );\\n break;\\n case '/Apuntes':\\n getNotes( qs.parse( arg ), response );\\n break;\\n case '/Apunte':\\n getNote( qs.parse( arg ), response );\\n break;\\n default:\\n http.badRequest( response, request.url );\\n }\\n } catch ( e ) {\\n http.internalError( response, e );\\n console.log( e );\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a38f8e66d6a3ae4b1dd1919e44f69987\",\n \"score\": \"0.58015513\",\n \"text\": \"function doGet() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74f0c08d61a08099f28f14b226f28673\",\n \"score\": \"0.5793562\",\n \"text\": \"function get(name){\\n if(name=(new RegExp('[?&]'+encodeURIComponent(name)+'=([^&]*)')).exec(location.search))\\n return decodeURIComponent(name[1]);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7b0c490c4beee2cdf0569e03a3b2c20\",\n \"score\": \"0.5726002\",\n \"text\": \"function get(name)\\n{\\n if(name=(new RegExp('[?&]'+encodeURIComponent(name)+'=([^&]*)')).exec(location.search))\\n return decodeURIComponent(name[1]);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26af61a28ac701be5cb9b620253677e6\",\n \"score\": \"0.5626659\",\n \"text\": \"function eval_getURLandName() {\\n\\tvar theArr = [];\\n\\t\\n\\ttheArr[0] = 'file:///Volumes' + app.activeDocument.fullName.fullName;\\n\\ttheArr[1] = app.activeDocument.name;\\n\\t\\n\\t//return value must be string...\\n\\treturn JSON.stringify(theArr);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65414c8947ec7bdb972e568a191546b4\",\n \"score\": \"0.56110686\",\n \"text\": \"function getGET( name )\\r\\n\\r\\n{\\r\\n\\r\\n name = name.replace(/[\\\\[]/,\\\"\\\\\\\\\\\\[\\\").replace(/[\\\\]]/,\\\"\\\\\\\\\\\\]\\\");\\r\\n\\r\\n var regexS = \\\"[\\\\\\\\?&]\\\"+name+\\\"=([^&#]*)\\\";\\r\\n\\r\\n var regex = new RegExp( regexS );\\r\\n\\r\\n var results = regex.exec( window.location.href );\\r\\n\\r\\n if( results == null )\\r\\n\\r\\n return \\\"\\\";\\r\\n\\r\\n else\\r\\n\\r\\n return results[1];\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1c119b057c469b28f2fbe06f66fddfb\",\n \"score\": \"0.560746\",\n \"text\": \"function __GET(parameterName) {return $_GET(parameterName);}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fc5999a4a2cdc210a0bbfda82fcfbeb\",\n \"score\": \"0.55889875\",\n \"text\": \"function superstar_get(robot,path,on_success,on_error)\\n{\\n\\tsuperstar_generic(robot,path,\\\"?get\\\",\\n\\t\\tfunction(str) {\\n\\t\\t\\tvar json=null;\\n\\t\\t\\tif(str!=\\\"\\\") json=JSON.parse(str);\\n\\t\\t\\ton_success(json);\\n\\t\\t}\\n\\t,on_error);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78c1e17423d411ba0070a55c89968d56\",\n \"score\": \"0.5534868\",\n \"text\": \"function get(name) {\\n if (name = (new RegExp('[?&]' + encodeURIComponent(name) + '=([^&]*)')).exec(location.search))\\n return decodeURIComponent(name[1]);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53f9ba97a8a64be871532ad9e78d1984\",\n \"score\": \"0.5455785\",\n \"text\": \"function get(...args) {\\n return request('GET', ...args);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"882b42cf2a2877f3185f28b7e887cc95\",\n \"score\": \"0.5448936\",\n \"text\": \"function processGET() {\\n\\tvar parameters = location.search.substring(1).split(\\\"&\\\");\\n\\tvar temp = parameters[0].split(\\\"=\\\");\\n\\tvar name = unescape(temp[1]);\\n\\treturn name;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d6e74b654fc30f0a8215066e4d59ba6\",\n \"score\": \"0.5436473\",\n \"text\": \"get(path)\\n {\\n return this.request(path, null, 'GET');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb6c19dacc1208d7b4772c3c86f8b4d3\",\n \"score\": \"0.54237646\",\n \"text\": \"get(url, opt = {}) {\\n opt.method = 'GET';\\n return this.request(url, opt);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab2983bae07715b1d556f666d3ad52fc\",\n \"score\": \"0.5348511\",\n \"text\": \"function get_url(path, args){\\n return args.u || args.url || path\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5c4e3a2ba9e6ed723e4c9311647dbdc\",\n \"score\": \"0.52987504\",\n \"text\": \"function get(url) { return request(\\\"GET\\\")(url)(null)([\\\"Nil\\\"]); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bb70b200d0d5d3faa94d7aec97b1db0\",\n \"score\": \"0.5267617\",\n \"text\": \"async getDataFromApiForOneField (myUrl,myField){\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"378089650abaf601f3f545483f59bc6e\",\n \"score\": \"0.52581763\",\n \"text\": \"function getUrl() {\\n var query = window.location.pathname.split(\\\"/\\\");\\n return \\\"/editor/\\\" + query[2] + \\\"/\\\" + query[3];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7901dd69aa93a7a6e432fcde4a2fec75\",\n \"score\": \"0.5224757\",\n \"text\": \"getDataFromUrl() {\\n var aux = location.search.substr(2).split('+');\\n\\n for (var i = 0; i < aux.length - 1; i++) {\\n var aux2 = { id: aux[i], name: aux[++i] }\\n this.types.push(aux2);\\n }\\n this.title = aux[aux.length - 1].split('_').join(' ');\\n document.title = this.title;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22e018320a77b68517f96460f095ef21\",\n \"score\": \"0.52245146\",\n \"text\": \"static get(url, paramsDict) {\\n const processedUrl = NetworkFunc.generateApiUrlPrefix(url);\\n\\n if (!paramsDict || Object.keys(paramsDict).length == 0) {\\n return fetch(processedUrl, {\\n credentials: 'same-origin',\\n });\\n }\\n const concatenated = processedUrl + \\\"?\\\" + NetworkFunc.mapToSortedQueryParams(paramsDict);\\n return fetch(concatenated, {\\n credentials: 'same-origin',\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec3aaea3f8ab5b12b0b95aea75593b56\",\n \"score\": \"0.5224465\",\n \"text\": \"function getqv(url, name) {\\n\\t\\tvar vars = url.replace(/^[^?]*\\\\?/, '').split('&'); \\n\\t\\tfor (var i = 0; i < vars.length; i++) {\\n\\t\\t\\tvar kv = vars[i].split('=');\\n\\t\\t\\tif (decodeURIComponent(kv[0]) == name)\\n\\t\\t\\t\\treturn decodeURIComponent(kv[1]);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4711affacda7dfd1cdd6a396693cc24\",\n \"score\": \"0.51845735\",\n \"text\": \"function getData (url){\\n\\t\\tlet request=$.get(url);\\n\\t\\treturn request;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bf962a3ff831ad74826dce5639cd729\",\n \"score\": \"0.51772875\",\n \"text\": \"function getpage(url) {\\n fetch(url).then(response => response.json()).\\n then(data => displayNames(data));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37bd6a43468276c10b6c983310a26b60\",\n \"score\": \"0.5140782\",\n \"text\": \"getDesignFromUrl( url ){\\n let design;\\n let expression = /\\\\/([A-Za-z0-9-]*)-a-/;\\n let designArray = expression.exec( url );\\n\\n if( designArray ){\\n design = designArray[1];\\n }\\n\\n return design;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28e3f7afbd8ff26267e84943e298c6ab\",\n \"score\": \"0.5139617\",\n \"text\": \"get (url) {\\n return this.makeRequest(url)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65773bf823dc751f1f51aea240156a4d\",\n \"score\": \"0.5120198\",\n \"text\": \"function loadGedcomRec(recType, recId) {\\n var urlPref = \\\"http://localhost:8080/gedcom-web/rest/\\\";\\n // sample: \\\"http://localhost:8080/gedcom-web/rest/person/1/xml\\\";\\n var url = urlPref+recType+\\\"/\\\"+recId+\\\"/xml\\\";\\n //alert(\\\"url: \\\" + url);\\n loadXMLDoc(url);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e5d29a5faa82a1548659c85488f6dea\",\n \"score\": \"0.511212\",\n \"text\": \"function getFromurl(Name, Def) {\\n if (arguments.length < 2 ) Def=false;\\n var search = Name + \\\"=\\\"\\n var surl = new String(document.URL);\\n \\n if (surl.length > 0) { \\t// if there are any Url\\n offset = surl.indexOf(search)\\n if (offset != -1) { \\t\\t\\t// if var exists\\n offset += search.length\\n\\t\\t\\t\\t\\t\\t\\t // set index of beginning of value\\n end = surl.indexOf(\\\"&\\\", offset)\\n\\t\\t\\t\\t\\t\\t // set index of end of cookie value\\n if (end == -1)\\n end = surl.length;\\n return unescape(surl.substring(offset, end))\\n }\\n }\\n return Def;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc00e43572eab8e3cc6822ec40047172\",\n \"score\": \"0.51102126\",\n \"text\": \"get(url, options) {\\n return this.fetch(...arguments, {\\n method: \\\"GET\\\",\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f032b66ccf857fa266c3287b201f6de3\",\n \"score\": \"0.5101368\",\n \"text\": \"get(url, options = {}) {\\n return this.request('GET', url, options);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f032b66ccf857fa266c3287b201f6de3\",\n \"score\": \"0.5101368\",\n \"text\": \"get(url, options = {}) {\\n return this.request('GET', url, options);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f032b66ccf857fa266c3287b201f6de3\",\n \"score\": \"0.5101368\",\n \"text\": \"get(url, options = {}) {\\n return this.request('GET', url, options);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f032b66ccf857fa266c3287b201f6de3\",\n \"score\": \"0.5101368\",\n \"text\": \"get(url, options = {}) {\\n return this.request('GET', url, options);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f5cb035dea0415e7d438854a2776695\",\n \"score\": \"0.5100324\",\n \"text\": \"static get(g, a=true) {\\n if (a === true) a = location.href\\n if (!a) return null\\n a = Url.url2a(a)\\n let i, gets = {}\\n const args = a.search ? a.search.replace(/^\\\\?/, '').split('&') : []\\n for (i=0; i<args.length; i++) {\\n const v = args[i].split('=')\\n gets[v[0]] = decodeURIComponent(v[1].replace(/\\\\+/g, ' '))\\n }\\n return g === true ? gets : gets[g]\\n //protocol, host (hostname, port), pathname, search, hash\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"346a41a74ff38b2196cb965c7fe2a98e\",\n \"score\": \"0.50973976\",\n \"text\": \"_getUrl(path)\\n{\\n return `${this._baseUri}/${path}`\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81b69010998c7fcb6fe571bc2a82f20b\",\n \"score\": \"0.5092243\",\n \"text\": \"getAccess(id1, id2) {\\n return http.get(`/employee-service/employee/checkvalid/${id1}/${id2}`);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce4c18f16b86a6b63dc647f851eb317c\",\n \"score\": \"0.5086703\",\n \"text\": \"function readURL() {\\n\\n\\t\\tvar hash = window.location.hash;\\n\\n\\t\\t// Attempt to parse the hash as either an index or name\\n\\t\\tvar bits = hash.slice( 2 ).split( '/' ),\\n\\t\\t\\tname = hash.replace( /#|\\\\//gi, '' );\\n\\n\\t\\t// If the first bit is invalid and there is a name we can\\n\\t\\t// assume that this is a named link\\n\\t\\tif( isNaN( parseInt( bits[0], 10 ) ) && name.length ) {\\n\\t\\t\\t// Find the slide with the specified name\\n\\t\\t\\tvar element = document.querySelector( '#' + name );\\n\\n\\t\\t\\tif( element ) {\\n\\t\\t\\t\\t// Find the position of the named slide and navigate to it\\n\\t\\t\\t\\tvar indices = Reveal.getIndices( element );\\n\\t\\t\\t\\tslide( indices.h, indices.v );\\n\\t\\t\\t}\\n\\t\\t\\t// If the slide doesn't exist, navigate to the current slide\\n\\t\\t\\telse {\\n\\t\\t\\t\\tslide( indexh || 0, indexv || 0 );\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\t// Read the index components of the hash\\n\\t\\t\\tvar h = parseInt( bits[0], 10 ) || 0,\\n\\t\\t\\t\\tv = parseInt( bits[1], 10 ) || 0;\\n\\n\\t\\t\\tif( h !== indexh || v !== indexv ) {\\n\\t\\t\\t\\tslide( h, v );\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3f0016321d43783b45d1ed156712b46\",\n \"score\": \"0.507615\",\n \"text\": \"function getSetfromURL(){\\n console.log(\\\"entered get set url\\\");\\n var path = window.location.pathname;\\n var pathParts = path.split('/');\\n return pathParts[1];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2793c26e62e434c9a74339f12fa3c175\",\n \"score\": \"0.5075483\",\n \"text\": \"get(uri) {\\r\\n return this._documents[uri];\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2793c26e62e434c9a74339f12fa3c175\",\n \"score\": \"0.5075483\",\n \"text\": \"get(uri) {\\r\\n return this._documents[uri];\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99f84ca032161f50bf518550b67f0adb\",\n \"score\": \"0.5055773\",\n \"text\": \"get(name, locals) {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02f8d1c5657ccd6d8fe945d5ab60ec10\",\n \"score\": \"0.5054413\",\n \"text\": \"Get() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35ccdca7b3b9f245ae98265d68c44121\",\n \"score\": \"0.50536376\",\n \"text\": \"@Get('/:name(@[\\\\\\\\w\\\\\\\\-\\\\\\\\.]+\\\\/[\\\\\\\\w\\\\\\\\-\\\\\\\\.]+)/:d(download|\\\\-)/:filename(.+)')\\n @Middleware('limit')\\n @Middleware('download')\\n async dowload_with_scope(ctx, next) {\\n console.log('get i', ctx.params)\\n return 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f96af45a780e837a4e9c1119d980aa63\",\n \"score\": \"0.50478333\",\n \"text\": \"function urlRequest(paras) //获取url参数方法\\n{\\n var url = location.href;\\n var paraString = url.substring(url.indexOf(\\\"?\\\") + 1, url.length).split(\\\"&\\\");\\n var paraObj = {}\\n for (i = 0; j = paraString[i]; i++) {\\n paraObj[j.substring(0, j.indexOf(\\\"=\\\")).toLowerCase()] = j.substring(j.indexOf(\\\"=\\\") + 1, j.length);\\n }\\n var returnValue = paraObj[paras.toLowerCase()];\\n if (typeof(returnValue) == \\\"undefined\\\") {\\n return \\\"\\\";\\n } else {\\n return returnValue;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bcca7a4884a21fa73960f632ebf044c\",\n \"score\": \"0.5045588\",\n \"text\": \"getUrl(fileName){\\n DB.GetPostUrl(fileName)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4e9cb774659d63ce114754392a5eb8f\",\n \"score\": \"0.50448334\",\n \"text\": \"get(id) {\\r\\n return http.get(`/id/${id}`);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca3ed8929f93d477271c375aa5f6da87\",\n \"score\": \"0.50444514\",\n \"text\": \"function httpGet(theUrl) {\\n var xmlHttp = new XMLHttpRequest();\\n xmlHttp.open(\\\"GET\\\", theUrl, false);\\n xmlHttp.send(null);\\n return xmlHttp.responseText;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc932a22beb0c4961fb750dd0bf23a96\",\n \"score\": \"0.50395703\",\n \"text\": \"async get (id, params) {\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ff34cb7f5335720d18e7a28f81a99d9\",\n \"score\": \"0.50284314\",\n \"text\": \"function UrlUtil() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed1213238129f13678739bfe6d6448da\",\n \"score\": \"0.5016573\",\n \"text\": \"function get(url) {\\n return resourceCache[url];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5891b6ab3bd4532345ff4490e5fcac3\",\n \"score\": \"0.5012619\",\n \"text\": \"get(url) {\\n if (arguments.length > 1 || url.indexOf('/') !== -1) {\\n throw new Ember.Error('It seems you tried to use `.get` to make a request! Use the `.request` method instead.');\\n }\\n return this._super(...arguments);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4313b03c43396a3d822e4b85ece3431\",\n \"score\": \"0.5011723\",\n \"text\": \"static _get(url, body, success, failure) {\\n let ajax = {\\n method: 'GET'\\n };\\n let path = url;\\n if (body) {\\n let params = Object.keys(body).map((key) => {\\n return key + \\\"=\\\" + body[key];\\n });\\n path += '?' + params.join('&');\\n }\\n\\n this._request(path, ajax, success, failure);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb68f86014a410c209374869b4d89f84\",\n \"score\": \"0.5004891\",\n \"text\": \"function getOverload() {\\n\\n\\t\\t/**\\n\\t\\t * Overload Cldr.prototype.get().\\n\\t\\t */\\n\\t\\tsuperGet = Cldr.prototype.get;\\n\\t\\tCldr.prototype.get = function( path ) {\\n\\t\\t\\tvar value = superGet.apply( this, arguments );\\n\\t\\t\\tpath = pathNormalize( path, this.attributes ).join( \\\"/\\\" );\\n\\t\\t\\tglobalEe.trigger( \\\"get\\\", [ path, value ] );\\n\\t\\t\\tthis.ee.trigger( \\\"get\\\", [ path, value ] );\\n\\t\\t\\treturn value;\\n\\t\\t};\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da1c381a859343b92d86eea17b534511\",\n \"score\": \"0.4996298\",\n \"text\": \"get(url) {\\n if (arguments.length > 1 || url.indexOf('/') !== -1) {\\n throw new Ember.Error('It seems you tried to use `.get` to make a request! Use the `.request` method instead.');\\n }\\n return this._super(...arguments);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75781162629b94e56eede95fa91c68d1\",\n \"score\": \"0.4990979\",\n \"text\": \"function GET(v)\\n{\\n if (!HTTP_GET_VARS[v]) {\\n return 'undefined';\\n }\\n return HTTP_GET_VARS[v];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ff03a8b7a24677abbee493539d1df6c\",\n \"score\": \"0.49840558\",\n \"text\": \"async function GET(url){\\n return await global.client.fetch( url, {method:\\\"GET\\\"} )\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ab3f9f4ee35f6814c1e1ac2ba7c0302\",\n \"score\": \"0.49746946\",\n \"text\": \"function getOverload() {\\n \\t /**\\n \\t * Overload Cldr.prototype.get().\\n \\t */\\n \\t superGet = Cldr.prototype.get;\\n \\t Cldr.prototype.get = function (path) {\\n \\t var value = superGet.apply(this, arguments);\\n \\t path = pathNormalize(path, this.attributes).join(\\\"/\\\");\\n \\t globalEe.trigger(\\\"get\\\", [path, value]);\\n \\t this.ee.trigger(\\\"get\\\", [path, value]);\\n \\t return value;\\n \\t };\\n \\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dc1be4c1991c118e0d959c80c5fc91a\",\n \"score\": \"0.4971064\",\n \"text\": \"function Url(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8c7ea03d3d55cc2b1df98c46e6d33e5\",\n \"score\": \"0.4951248\",\n \"text\": \"function get(url, data, callback) { request(\\\"GET\\\", url, data, callback) }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df196a3fce2de7cdd69c3f836d67e1ba\",\n \"score\": \"0.49492663\",\n \"text\": \"static get(...args) {\\n let url = this.getItemUrl(...args);\\n\\n // Must be caught later\\n return this.fetcher.get(url).then(({ response, headers, status }) => {\\n let ret = this.fromJSON(response);\\n ret.__meta = { headers, status, response };\\n return ret;\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"089f4af7e32c43e7cb0b3863422304fc\",\n \"score\": \"0.4942577\",\n \"text\": \"function httpGet(theUrl) {\\n\\tvar xmlHttp = new XMLHttpRequest();\\n\\txmlHttp.open(\\\"GET\\\", theUrl, false); // false for synchronous request\\n\\txmlHttp.send(null);\\n\\treturn xmlHttp.responseText;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7601dc135c26e5e7db651ac8e8ffcd1\",\n \"score\": \"0.49368176\",\n \"text\": \"get(uri) {\\n return this._documents[uri];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a3c7569eba6f38fd5feb2be4cfb49b2\",\n \"score\": \"0.4935438\",\n \"text\": \"function backwardCompat_get(opt, path) {\\r\\n var pathArr = path.split(',')\\r\\n var obj = opt\\r\\n\\r\\n for (var i = 0; i < pathArr.length; i++) {\\r\\n obj = obj && obj[pathArr[i]]\\r\\n\\r\\n if (obj == null) {\\r\\n break\\r\\n }\\r\\n }\\r\\n\\r\\n return obj\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4593077efdf22daa183328c78d5ec5fa\",\n \"score\": \"0.4908732\",\n \"text\": \"function getPeople(url) {\\n return getJSON(url);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ad4d69506f3b36382814bdfadab5d24\",\n \"score\": \"0.4905097\",\n \"text\": \"async get(uri, opts){\\n let req = {\\n method: 'GET'\\n };\\n try{\\n let qstring = qs.stringify(opts);\\n req.uri = `${uri}${qstring?'?'+qstring:''}`;\\n debug(`GET ${req.uri}`);\\n\\n let resp = await this.baseRequest(req);\\n return this.handleResponse(resp, null, req);\\n\\n }catch(ex){\\n return this.handleResponse(ex, null, req);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"001b5496e65ac471f7224ab9481b28d5\",\n \"score\": \"0.48965928\",\n \"text\": \"function resolve(url, urls) {\\n // Match a url\\n // Return a url, or undefined\\n if (url.indexOf('?') != -1)\\n url = url.split('?')[0];\\n for(var i=0; i<urls.length; i++) {\\n var regex = new RegExp(urls[i][0]);\\n var view = urls[i][1];\\n var match = url.match(regex);\\n if (match != null) {\\n return view;\\n }\\n }\\n return undefined;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee27e33a7b6da2108f8cb352aa6d50d8\",\n \"score\": \"0.48953038\",\n \"text\": \"function requestGet(url, params) {\\n\\t\\t\\treturn handleResponse($http.get(url, { params: params }));\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2aee530c2b2ef3ac7fdf261c1afa57bc\",\n \"score\": \"0.48921746\",\n \"text\": \"get (request, response, name) {\\n return this._host.get(name).then(repr => {\\n response.setHeader('Content-Type', 'application/json')\\n response.end(JSON.stringify(repr))\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59f7039748e900e5b05e866ad0c34068\",\n \"score\": \"0.4891896\",\n \"text\": \"function fetchData(url) {\\n var option = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\\n\\n return model.dataAccessHelper.fetchText(publicAPI, url, option);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59f7039748e900e5b05e866ad0c34068\",\n \"score\": \"0.4891896\",\n \"text\": \"function fetchData(url) {\\n var option = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\\n\\n return model.dataAccessHelper.fetchText(publicAPI, url, option);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59f7039748e900e5b05e866ad0c34068\",\n \"score\": \"0.4891896\",\n \"text\": \"function fetchData(url) {\\n var option = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\\n\\n return model.dataAccessHelper.fetchText(publicAPI, url, option);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2f9769c5c47c07efbf5582bc3c91d5d\",\n \"score\": \"0.48783162\",\n \"text\": \"function get(param){\\n var value = expand.get(param);\\n return value;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8ca20f13c84ad545e7cc5d692226f26\",\n \"score\": \"0.48781118\",\n \"text\": \"function redirectGet(entry) {\\n if( entry !== 'error.2.0.json') {\\n entry = 'redfish-1.0/' + entry;\\n }\\n return fs.readFileAsync(__dirname + '/../../../../data/views/' + entry, 'utf-8')\\n .then(function(contents) {\\n return { contents: contents };\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf51a51195679a1b08725d5aa40eb874\",\n \"score\": \"0.48737764\",\n \"text\": \"function _api_get(path, format, values, callback) {\\n self.consumer.get(\\n self.options.api_url + path + \\\".\\\" + format + \\\"?\\\" + (util.isArray(values) ? values.join('&') : values.toString()),\\n self.token.access.token,\\n self.token.access.secret,\\n function (error, data) {\\n if (error) {\\n console.error(error);\\n callback(error, null);\\n } else {\\n callback(null, data);\\n }\\n }\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3408865092d1a4bdc0c7619aeef57755\",\n \"score\": \"0.4869115\",\n \"text\": \"async get(path, setShowLoading) {\\n return doRequest(path, setShowLoading, 'GET');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3811c94a8157e6cbdd501bc6f5330d06\",\n \"score\": \"0.48668364\",\n \"text\": \"function get(opt, path) {\\n var pathArr = path.split(',');\\n var obj = opt;\\n\\n for (var i = 0; i < pathArr.length; i++) {\\n obj = obj && obj[pathArr[i]];\\n\\n if (obj == null) {\\n break;\\n }\\n }\\n\\n return obj;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3811c94a8157e6cbdd501bc6f5330d06\",\n \"score\": \"0.48668364\",\n \"text\": \"function get(opt, path) {\\n var pathArr = path.split(',');\\n var obj = opt;\\n\\n for (var i = 0; i < pathArr.length; i++) {\\n obj = obj && obj[pathArr[i]];\\n\\n if (obj == null) {\\n break;\\n }\\n }\\n\\n return obj;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00d67daa1812627001b5c6376f3951d7\",\n \"score\": \"0.48599187\",\n \"text\": \"function get(opt, path) {\\n path = path.split(',');\\n var obj = opt;\\n for (var i = 0; i < path.length; i++) {\\n obj = obj && obj[path[i]];\\n if (obj == null) {\\n break;\\n }\\n }\\n return obj;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbbfb985049be60f6ced76ed1e593db6\",\n \"score\": \"0.48566434\",\n \"text\": \"function Get(yourUrl) {\\n\\tvar Httpreq = new XMLHttpRequest(); // a new request\\n\\tHttpreq.open(\\\"GET\\\", yourUrl, false);\\n\\tHttpreq.send(null);\\n\\treturn Httpreq.responseText;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e63931318f576addb6b2d1004f1efce1\",\n \"score\": \"0.4850001\",\n \"text\": \"function httpGet(theUrl) {\\r\\n var xmlHttp = new XMLHttpRequest();\\r\\n xmlHttp.open( \\\"GET\\\", theUrl, false); // false for synchronous request\\r\\n xmlHttp.send(null);\\r\\n return xmlHttp.responseText;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bddd1b963ad2261a74cd3178a3b7bbbb\",\n \"score\": \"0.48490855\",\n \"text\": \"function _getParam(url,key){\\n\\n\\t\\t\\tkey = key.replace(/[\\\\[]/,\\\"\\\\\\\\\\\\[\\\").replace(/[\\\\]]/,\\\"\\\\\\\\\\\\]\\\");\\n\\t\\t\\tvar regexS = \\\"[\\\\\\\\?&]\\\"+key+\\\"=([^&#]*)\\\";\\n\\t\\t\\tvar regex = new RegExp( regexS );\\n\\t\\t\\tvar results = regex.exec( url );\\n\\t\\t\\treturn ( results == null ) ? \\\"\\\" : results[1];\\n\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d706a92a12b572c65223bd588f54e74\",\n \"score\": \"0.4845832\",\n \"text\": \"function aGet(uri) {\\r\\n var request = Url.parse(uri);\\r\\n request.headers = {\\r\\n 'Authorization': 'Bearer ' + auth.credentials.access_token\\r\\n }\\r\\n request.method = \\\"GET\\\"\\r\\n var bits = new Stream.PassThrough();\\r\\n https.request(request, function(res) {\\r\\n console.error(\\\"[LOG] Fetching Document\\\", res.statusCode)\\r\\n res.pipe(bits);\\r\\n }).on('error', function(err) {\\r\\n console.error(\\\"[ERROR]\\\",err);\\r\\n }).end();\\r\\n return bits;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd275c40088a77c8edbbab0046dee22d\",\n \"score\": \"0.48456573\",\n \"text\": \"function doGet(e) {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c38128c0c96fa9c4f182c560f9b7bff5\",\n \"score\": \"0.4845432\",\n \"text\": \"static getItemUrl(...args) {\\n let params = args[0];\\n if (!params.id) {\\n throw new ArgumentError(`[Model][${this.constructor.name}] id is mandatory`);\\n }\\n\\n let query = args[1];\\n let queryString = this.getQueryString(query);\\n\\n return `${this.getListUrl(args[0])}/${params.id}${queryString}`;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77ed523a9e5b75071c7945c406627935\",\n \"score\": \"0.48380244\",\n \"text\": \"get(path, query = {}, options = {}) {\\n return this.request(`${path}?${!isBlank(query) ? new URLSearchParams(query).toString() : ''}`, 'GET', options);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da0e879460cfbf80190f42ae764128f0\",\n \"score\": \"0.48347116\",\n \"text\": \"function searchName(request) {\\n let miURL = url.parse(request.url, true);\\n var mod = modelSearch();\\n\\n //Con For\\n for (i = 0; i < mod.length; i++) {\\n if (miURL.query.n === mod[i].nombre) {\\n var n = mod[i].nombre\\n var aP = mod[i].apellido_paterno\\n var aM = mod[i].apellido_materno\\n return n + \\\" \\\" + aP + \\\" \\\" + aM;\\n\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82bc598fefdfe8d400c008d2bda896eb\",\n \"score\": \"0.48344198\",\n \"text\": \"function loadContextFromUrl()\\n {\\n var querystring = $.deparam.querystring();\\n site = querystring.site;\\n view = querystring.view;\\n mode = querystring.mode;\\n path = querystring.path;\\n id = querystring.id;\\n name = querystring.name;\\n debug = querystring.debug;\\n autoTest = querystring.at;\\n pathType = querystring.pathType;\\n warningMessage = querystring.warningMessage;\\n\\n javascriptOff = (querystring.disableJS === \\\"true\\\" ? true : false);\\n if(typeof(querystring.memento) != \\\"undefined\\\")\\n {\\n memento = JSON.parse(decodeURIComponent(querystring.memento));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a3f40aeeb25eff5f37a8e75ee292ea3\",\n \"score\": \"0.4832804\",\n \"text\": \"function get_gets() {\\n function transformToAssocArray(prmstr) {\\n var params = {};\\n var prmarr = prmstr.split(\\\"&\\\");\\n for (var i = 0; i < prmarr.length; i++) {\\n var tmparr = prmarr[i].split(\\\"=\\\");\\n params[tmparr[0]] = tmparr[1];\\n }\\n return params;\\n }\\n var prmstr = window.location.search.substr(1);\\n Project.get_vars =\\n prmstr !== null && prmstr !== \\\"\\\" ? transformToAssocArray(prmstr) : {};\\n\\n // maybe the following is left over from the simulator?\\n if (typeof Project.get_vars.name !== \\\"undefined\\\") {\\n exp_condition = Project.get_vars.name;\\n } else {\\n exp_condition = \\\"\\\";\\n }\\n if (Project.get_vars.platform === \\\"preview\\\") {\\n online_data_obj.finished_and_stored = true;\\n }\\n Project.activate_pipe();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7bcbaea2249d79669ab6fa25ba03f17\",\n \"score\": \"0.48315832\",\n \"text\": \"function httpGet(theUrl) {\\n var xmlHttp = null;\\n xmlHttp = new XMLHttpRequest();\\n xmlHttp.open( \\\"GET\\\", theUrl, false );\\n xmlHttp.send( null );\\n return xmlHttp.responseText;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe0b93a998a4d74fed862361c6c02591\",\n \"score\": \"0.48237243\",\n \"text\": \"get(params, callback) {\\n\\n this.client.get(params, function (err, response) {\\n if (err) {\\n this._logger.error(err);\\n return callback(err);\\n }\\n\\n if (!response._source) {\\n return callback(new Error('404 - error')); // TODO\\n }\\n\\n callback(err, response._source);\\n }.bind(this));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"996bfcbccd2878b3070cbb7d5cdbb42a\",\n \"score\": \"0.4823664\",\n \"text\": \"function getUrlArg(name, def, url) {\\n if (!url) url = window.location.href;\\n name = name.replace(/[\\\\[\\\\]]/g, '\\\\\\\\$&');\\n var regex = new RegExp('[?&]' + name + '(=([^&#]*)|&|#|$)'),\\n results = regex.exec(url);\\n if (!results) return def;\\n if (!results[2]) return def;\\n return decodeURIComponent(results[2].replace(/\\\\+/g, ' '));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"474430c47d7ef2d3b232c1d50d38738c\",\n \"score\": \"0.48151428\",\n \"text\": \"function url(){\\n return \\\"https://en.wikipedia.org/w/api.php?action=query&format=json&list=search&utf8=1&srsearch=Albert+Einstein\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47c2f791bfee1930953d1d095f4161d2\",\n \"score\": \"0.4813976\",\n \"text\": \"function selectedPath () { \\ntry { \\nvar ref = new ActionReference(); \\nref.putEnumerated( charIDToTypeID(\\\"Path\\\"), charIDToTypeID(\\\"Ordn\\\"), charIDToTypeID(\\\"Trgt\\\") ); \\nvar desc = executeActionGet(ref); \\nvar theName = desc.getString(charIDToTypeID(\\\"PthN\\\")); \\nreturn app.activeDocument.pathItems.getByName(theName) \\n} \\ncatch (e) { \\nreturn undefined \\n} \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0e1933387f6a3729dc8741f7143bbf5\",\n \"score\": \"0.4809196\",\n \"text\": \"function getUrl() {\\n let query = new URLSearchParams(window.location.search).get('v');\\n if (typeof query === \\\"string\\\") {\\n return query;\\n }\\n return undefined;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"427dd32d7d9e8b384af5dff8afd57af3\",\n \"score\": \"0.48074207\",\n \"text\": \"function httpGet(theUrl) {\\n var xmlHttp = null;\\n xmlHttp = new XMLHttpRequest();\\n xmlHttp.open(\\\"GET\\\", theUrl, false);\\n xmlHttp.send(null);\\n return xmlHttp.responseText;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fee1897210589f6ce3daca327a38642\",\n \"score\": \"0.48045653\",\n \"text\": \"function getIndexFromUrl(url){\\n return url.split(\\\"/\\\").slice(-2);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"607c25a5730739cbf4edd300293255dc\",\n \"score\": \"0.47989756\",\n \"text\": \"function secondPart(value) {\\n var request = new XMLHttpRequest();\\n request.open('GET', value);\\n request.responseType = 'json';\\n request.send();\\n request.onload = function () {\\n controller(request.response);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21b51e3d94c10f43943e7b6bee51fe4e\",\n \"score\": \"0.4798565\",\n \"text\": \"async function getAPI(page, getContents) {\\n\\t\\tif (page.title && page.properties && page.id && page.tags && (!getContents || page.content))\\n\\t\\t\\treturn page;\\n\\t\\telse if (typeof page === 'string')\\n\\t\\t\\tpage = {\\n\\t\\t\\t\\turl: page\\n\\t\\t\\t};\\n\\t\\tpage.url = page.url.replace('?contentOnly', '');\\n\\t\\t\\n\\t\\tlet [subdomain, path] = parseURL(page.url);\\n\\t\\t// console.log(page.url);\\n\\t\\tlet response = await authenticatedFetch(path, `?dream.out.format=json${getContents ? '&include=contents' : ''}`, subdomain);\\n\\t\\tif (response.ok) {\\n\\t\\t\\tresponse = await response.json();\\n\\t\\t\\tlet {properties, tags, files} = response;\\n\\t\\t\\tif (properties['@count'] !== '0' && properties.property) {\\n\\t\\t\\t\\tproperties = properties.property.length ? properties.property : [properties.property]\\n\\t\\t\\t\\tproperties = properties.map((prop) => {\\n\\t\\t\\t\\t\\tif (prop['@revision']) return {name: prop['@name'], value: prop.contents['#text']};\\n\\t\\t\\t\\t\\telse return prop\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tproperties = [];\\n\\t\\t\\t}\\n\\t\\t\\tif (tags.tag) {\\n\\t\\t\\t\\ttags = tags.tag.length ? tags.tag : [tags.tag];\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\ttags = []\\n\\t\\t\\t}\\n\\t\\t\\tif (files.file) {\\n\\t\\t\\t\\tfiles = files.file.length ? files.file : [files.file];\\n\\t\\t\\t\\tfiles = files.map((file) => {\\n\\t\\t\\t\\t\\treturn {\\n\\t\\t\\t\\t\\t\\t'id': file['@id'],\\n\\t\\t\\t\\t\\t\\t'revision': file['@revision'],\\n\\t\\t\\t\\t\\t\\t'href': file['@href'],\\n\\t\\t\\t\\t\\t\\t'contents': file['contents'],\\n\\t\\t\\t\\t\\t\\t'created': file['date.created'],\\n\\t\\t\\t\\t\\t\\t'filename': file['filename']\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tfiles = []\\n\\t\\t\\t}\\n\\t\\t\\ttags = tags.map((elem) => elem.title);\\n\\t\\t\\tpage.id = parseInt(response['@id']);\\n\\t\\t\\tpage.title = page.title || response.title;\\n\\t\\t\\tpage.tags = page.tags || tags;\\n\\t\\t\\tpage.properties = page.properties || properties;\\n\\t\\t\\tpage.subdomain = subdomain;\\n\\t\\t\\tpage.files = page.files || files;\\n\\t\\t\\tpage.path = response.path['#text'];\\n\\t\\t\\tpage.modified = new Date(response['date.modified']);\\n\\t\\t\\tpage.content = response.content;\\n\\t\\t\\tif (response['page.parent'])\\n\\t\\t\\t\\tpage.parentID = parseInt(response['page.parent']['@id']);\\n\\t\\t\\tif (response.security && response.security['permissions.effective']) {\\n\\t\\t\\t\\tlet permissions = response.security['permissions.effective'].operations['#text'];\\n\\t\\t\\t\\tif (permissions.includes('CHANGEPERMISSIONS'))\\n\\t\\t\\t\\t\\tpage.security = 'Editor';\\n\\t\\t\\t\\telse if (permissions.includes('UPDATE'))\\n\\t\\t\\t\\t\\tpage.security = 'Author';\\n\\t\\t\\t\\telse if (permissions.includes('READ'))\\n\\t\\t\\t\\t\\tpage.security = 'Viewer';\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tlet error = await response.json();\\n\\t\\t\\t// console.error(`Can't get ${page.url}`);\\n\\t\\t\\tpage.subdomain = subdomain;\\n\\t\\t\\tpage.path = path;\\n\\t\\t\\tpage.modified = 'restricted';\\n\\t\\t\\tpage.error = error;\\n\\t\\t}\\n\\t\\treturn page;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ed1ce3ed474b3191fed76acf74cdc9b\",\n \"score\": \"0.47927576\",\n \"text\": \"function get(query) {\\n\\treturn request(\\\"GET\\\", query);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9414dba3dd73086449c690f8e6d0ca3\",\n \"score\": \"0.4785656\",\n \"text\": \"function Get(Url) {\\n var XMLHttpRequest = require(\\\"xmlhttprequest\\\").XMLHttpRequest;\\n var xhr = new XMLHttpRequest();\\n xhr.open(\\\"GET\\\", Url, false);\\n xhr.send(null);\\n return xhr.responseText;\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":65,"cells":{"query_id":{"kind":"string","value":"a7aac160b02ad30dcec88e3e1a1b3d65"},"query":{"kind":"string","value":"Create and return a new ReactElement of the given type. See"},"positive_passages":{"kind":"list like","value":[{"docid":"f757810746c7780c0e0ed361e5f40335","score":"0.0","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n }","title":""}],"string":"[\n {\n \"docid\": \"f757810746c7780c0e0ed361e5f40335\",\n \"score\": \"0.0\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"ba89f7470e9f759722c6a227e170b58d","score":"0.7050864","text":"function CreateType (props) {\n const {as, children, ...remainder} = props\n return React.createElement(as || 'span', remainder, children)\n}","title":""},{"docid":"8d9f98312fc7c5eb18bccc8b52e7b155","score":"0.6777204","text":"createPageElement(gmctx, type, props) {\n return React.createElement(type, props);\n }","title":""},{"docid":"82322eacdc46123b6730de55ce7c08be","score":"0.674537","text":"function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","title":""},{"docid":"82322eacdc46123b6730de55ce7c08be","score":"0.674537","text":"function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","title":""},{"docid":"82322eacdc46123b6730de55ce7c08be","score":"0.674537","text":"function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","title":""},{"docid":"82322eacdc46123b6730de55ce7c08be","score":"0.674537","text":"function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","title":""},{"docid":"82322eacdc46123b6730de55ce7c08be","score":"0.674537","text":"function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","title":""},{"docid":"82322eacdc46123b6730de55ce7c08be","score":"0.674537","text":"function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","title":""},{"docid":"82322eacdc46123b6730de55ce7c08be","score":"0.674537","text":"function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","title":""},{"docid":"82322eacdc46123b6730de55ce7c08be","score":"0.674537","text":"function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","title":""},{"docid":"82322eacdc46123b6730de55ce7c08be","score":"0.674537","text":"function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","title":""},{"docid":"82322eacdc46123b6730de55ce7c08be","score":"0.674537","text":"function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","title":""},{"docid":"bc9e90284790cc09e4b12a270bd3f05b","score":"0.65219396","text":"static create(type, properties, ...children) {\n if (type instanceof Function) {\n return new type(properties, children).element;\n }\n else if (typeof type === 'string') {\n const attributes = this.getProperties(properties);\n const content = this.getChildren(children);\n if (content.length) {\n return `<${type}${attributes.length ? ` ${attributes}` : ''}>${content}</${type}>`;\n }\n else {\n return `<${type}${attributes.length ? ` ${attributes}` : ''}/>`;\n }\n }\n else {\n throw new TypeError(`Unsupported element or component type \"${type}\"`);\n }\n }","title":""},{"docid":"3ef97776bbac63712a54ae48f724ca14","score":"0.6444101","text":"function createElement(type, props, ...children) {\n return {\n type,\n props: {\n ...props,\n children: children.map(child =>\n typeof child === \"object\" ? child : createTextElement(child)\n )\n }\n };\n}","title":""},{"docid":"03b94fbb31ed47c7d6acd368d4173095","score":"0.6415681","text":"function createElement(type, props, ...children) {\n\treturn {\n\t\ttype,\n\t\tprops: {\n\t\t\t...props, // use the spread operator for the props\n\t\t\tchildren,\n\t\t},\n\t};\n}","title":""},{"docid":"9f1171d208f5565c43cf12483625f77e","score":"0.64079314","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"9f1171d208f5565c43cf12483625f77e","score":"0.64079314","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"9f1171d208f5565c43cf12483625f77e","score":"0.64079314","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"64b5399f145433e9b2a3509d59099b3d","score":"0.63947004","text":"function createElement (type, props, ...children) {\n return {\n type,\n props: {\n ...props,\n children: children.length <= 1 ? children[0] : children\n }\n }\n}","title":""},{"docid":"455808d1a3e8125255262e30cfc2c2c6","score":"0.63826317","text":"function createElement(type, attributes, ...children) {\n if (Assert.isPlainType(type)) {\n return createPlainElement(type, attributes, children);\n }\n else if (Assert.isClassType(type)) {\n return createClassElement(type, attributes, children);\n }\n else {\n throw new TypeError(`Element type isn't supported.`);\n }\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"cad887747e0a1ccaa163cd589a4bfd0b","score":"0.6372984","text":"function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"8bf881c42a6c5ea5d1e05c5c8a5a9379","score":"0.634562","text":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"f158520e2f2e2fd7890557ce0b412227","score":"0.6334784","text":"function createElement (type, props, ...children) {\n const dom = document.createElement(type)\n if (props) Object.assign(dom, props)\n for (const child of children) {\n if (typeof child !== 'string') dom.appendChild(child)\n else dom.appendChild(document.createTextNode(child))\n }\n return dom\n}","title":""},{"docid":"db41dfea0c31044015006adbec743b9f","score":"0.6334656","text":"function elt(type) {\n var node = document.createElement(type);\n for (var i = 1; i < arguments.length; i++) {\n var child = arguments[i];\n if (typeof child == \"string\")\n child = document.createTextNode(child);\n node.appendChild(child);\n }\n return node;\n}","title":""},{"docid":"37967011f4f682f8c26e10460efb91eb","score":"0.63005865","text":"function createElement(type, config, children) {\n\t var propName;\n\n\t // Reserved names are extracted\n\t var props = {};\n\n\t var key = null;\n\t var ref = null;\n\t var self = null;\n\t var source = null;\n\n\t if (config != null) {\n\t if (hasValidRef(config)) {\n\t ref = config.ref;\n\t }\n\t if (hasValidKey(config)) {\n\t key = '' + config.key;\n\t }\n\n\t self = config.__self === undefined ? null : config.__self;\n\t source = config.__source === undefined ? null : config.__source;\n\t // Remaining properties are added to a new props object\n\t for (propName in config) {\n\t if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n\t props[propName] = config[propName];\n\t }\n\t }\n\t }\n\n\t // Children can be more than one argument, and those are transferred onto\n\t // the newly allocated props object.\n\t var childrenLength = arguments.length - 2;\n\t if (childrenLength === 1) {\n\t props.children = children;\n\t } else if (childrenLength > 1) {\n\t var childArray = Array(childrenLength);\n\t for (var i = 0; i < childrenLength; i++) {\n\t childArray[i] = arguments[i + 2];\n\t }\n\t {\n\t if (Object.freeze) {\n\t Object.freeze(childArray);\n\t }\n\t }\n\t props.children = childArray;\n\t }\n\n\t // Resolve default props\n\t if (type && type.defaultProps) {\n\t var defaultProps = type.defaultProps;\n\t for (propName in defaultProps) {\n\t if (props[propName] === undefined) {\n\t props[propName] = defaultProps[propName];\n\t }\n\t }\n\t }\n\t {\n\t if (key || ref) {\n\t if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\n\t var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\t if (key) {\n\t defineKeyPropWarningGetter(props, displayName);\n\t }\n\t if (ref) {\n\t defineRefPropWarningGetter(props, displayName);\n\t }\n\t }\n\t }\n\t }\n\t return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n\t}","title":""},{"docid":"3a797e31dcc007c00564065b410819ac","score":"0.6277755","text":"function createElement(type, config, children) {\n\t var propName; // Reserved names are extracted\n\n\t var props = {};\n\t var key = null;\n\t var ref = null;\n\t var self = null;\n\t var source = null;\n\n\t if (config != null) {\n\t if (hasValidRef(config)) {\n\t ref = config.ref;\n\t {\n\t warnIfStringRefCannotBeAutoConverted(config);\n\t }\n\t }\n\n\t if (hasValidKey(config)) {\n\t key = '' + config.key;\n\t }\n\n\t self = config.__self === undefined ? null : config.__self;\n\t source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n\t for (propName in config) {\n\t if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n\t props[propName] = config[propName];\n\t }\n\t }\n\t } // Children can be more than one argument, and those are transferred onto\n\t // the newly allocated props object.\n\n\n\t var childrenLength = arguments.length - 2;\n\n\t if (childrenLength === 1) {\n\t props.children = children;\n\t } else if (childrenLength > 1) {\n\t var childArray = Array(childrenLength);\n\n\t for (var i = 0; i < childrenLength; i++) {\n\t childArray[i] = arguments[i + 2];\n\t }\n\n\t {\n\t if (Object.freeze) {\n\t Object.freeze(childArray);\n\t }\n\t }\n\t props.children = childArray;\n\t } // Resolve default props\n\n\n\t if (type && type.defaultProps) {\n\t var defaultProps = type.defaultProps;\n\n\t for (propName in defaultProps) {\n\t if (props[propName] === undefined) {\n\t props[propName] = defaultProps[propName];\n\t }\n\t }\n\t }\n\n\t {\n\t if (key || ref) {\n\t var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n\t if (key) {\n\t defineKeyPropWarningGetter(props, displayName);\n\t }\n\n\t if (ref) {\n\t defineRefPropWarningGetter(props, displayName);\n\t }\n\t }\n\t }\n\t return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n\t }","title":""},{"docid":"f143fa0a14bfd57a80332f89897f4173","score":"0.6255302","text":"function createElement(type, props) {\n var COMPONENTS = {\n ROOT: function ROOT() {\n return new _components.Root();\n },\n APP: function APP() {\n return new _components.App(props);\n },\n VIEW: function VIEW() {\n return new _components.View(props);\n },\n WINDOW: function WINDOW() {\n return new _components.Window(props);\n },\n VIRTUALTEXT: function VIRTUALTEXT() {\n return new _components.VirtualText(props);\n },\n ROOTTEXT: function ROOTTEXT() {\n return new _components.RootText(props);\n },\n IMAGE: function IMAGE() {\n return new _components.Image(props);\n },\n TEXTINPUT: function TEXTINPUT() {\n return new _components.TextInput(props);\n },\n PICKERINTERNAL: function PICKERINTERNAL() {\n return new _components.PickerInternal(props);\n },\n \"default\": undefined\n };\n return COMPONENTS[type]() || COMPONENTS[\"default\"];\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""},{"docid":"bc4a7026c1939cb82ff1cfd1f298ae66","score":"0.6230725","text":"function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","title":""}],"string":"[\n {\n \"docid\": \"ba89f7470e9f759722c6a227e170b58d\",\n \"score\": \"0.7050864\",\n \"text\": \"function CreateType (props) {\\n const {as, children, ...remainder} = props\\n return React.createElement(as || 'span', remainder, children)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d9f98312fc7c5eb18bccc8b52e7b155\",\n \"score\": \"0.6777204\",\n \"text\": \"createPageElement(gmctx, type, props) {\\n return React.createElement(type, props);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82322eacdc46123b6730de55ce7c08be\",\n \"score\": \"0.674537\",\n \"text\": \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82322eacdc46123b6730de55ce7c08be\",\n \"score\": \"0.674537\",\n \"text\": \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82322eacdc46123b6730de55ce7c08be\",\n \"score\": \"0.674537\",\n \"text\": \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82322eacdc46123b6730de55ce7c08be\",\n \"score\": \"0.674537\",\n \"text\": \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82322eacdc46123b6730de55ce7c08be\",\n \"score\": \"0.674537\",\n \"text\": \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82322eacdc46123b6730de55ce7c08be\",\n \"score\": \"0.674537\",\n \"text\": \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82322eacdc46123b6730de55ce7c08be\",\n \"score\": \"0.674537\",\n \"text\": \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82322eacdc46123b6730de55ce7c08be\",\n \"score\": \"0.674537\",\n \"text\": \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82322eacdc46123b6730de55ce7c08be\",\n \"score\": \"0.674537\",\n \"text\": \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82322eacdc46123b6730de55ce7c08be\",\n \"score\": \"0.674537\",\n \"text\": \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc9e90284790cc09e4b12a270bd3f05b\",\n \"score\": \"0.65219396\",\n \"text\": \"static create(type, properties, ...children) {\\n if (type instanceof Function) {\\n return new type(properties, children).element;\\n }\\n else if (typeof type === 'string') {\\n const attributes = this.getProperties(properties);\\n const content = this.getChildren(children);\\n if (content.length) {\\n return `<${type}${attributes.length ? ` ${attributes}` : ''}>${content}</${type}>`;\\n }\\n else {\\n return `<${type}${attributes.length ? ` ${attributes}` : ''}/>`;\\n }\\n }\\n else {\\n throw new TypeError(`Unsupported element or component type \\\"${type}\\\"`);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ef97776bbac63712a54ae48f724ca14\",\n \"score\": \"0.6444101\",\n \"text\": \"function createElement(type, props, ...children) {\\n return {\\n type,\\n props: {\\n ...props,\\n children: children.map(child =>\\n typeof child === \\\"object\\\" ? child : createTextElement(child)\\n )\\n }\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03b94fbb31ed47c7d6acd368d4173095\",\n \"score\": \"0.6415681\",\n \"text\": \"function createElement(type, props, ...children) {\\n\\treturn {\\n\\t\\ttype,\\n\\t\\tprops: {\\n\\t\\t\\t...props, // use the spread operator for the props\\n\\t\\t\\tchildren,\\n\\t\\t},\\n\\t};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f1171d208f5565c43cf12483625f77e\",\n \"score\": \"0.64079314\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f1171d208f5565c43cf12483625f77e\",\n \"score\": \"0.64079314\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f1171d208f5565c43cf12483625f77e\",\n \"score\": \"0.64079314\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64b5399f145433e9b2a3509d59099b3d\",\n \"score\": \"0.63947004\",\n \"text\": \"function createElement (type, props, ...children) {\\n return {\\n type,\\n props: {\\n ...props,\\n children: children.length <= 1 ? children[0] : children\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"455808d1a3e8125255262e30cfc2c2c6\",\n \"score\": \"0.63826317\",\n \"text\": \"function createElement(type, attributes, ...children) {\\n if (Assert.isPlainType(type)) {\\n return createPlainElement(type, attributes, children);\\n }\\n else if (Assert.isClassType(type)) {\\n return createClassElement(type, attributes, children);\\n }\\n else {\\n throw new TypeError(`Element type isn't supported.`);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad887747e0a1ccaa163cd589a4bfd0b\",\n \"score\": \"0.6372984\",\n \"text\": \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf881c42a6c5ea5d1e05c5c8a5a9379\",\n \"score\": \"0.634562\",\n \"text\": \"function createElement(type, config, children) {\\n var propName = void 0;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f158520e2f2e2fd7890557ce0b412227\",\n \"score\": \"0.6334784\",\n \"text\": \"function createElement (type, props, ...children) {\\n const dom = document.createElement(type)\\n if (props) Object.assign(dom, props)\\n for (const child of children) {\\n if (typeof child !== 'string') dom.appendChild(child)\\n else dom.appendChild(document.createTextNode(child))\\n }\\n return dom\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db41dfea0c31044015006adbec743b9f\",\n \"score\": \"0.6334656\",\n \"text\": \"function elt(type) {\\n var node = document.createElement(type);\\n for (var i = 1; i < arguments.length; i++) {\\n var child = arguments[i];\\n if (typeof child == \\\"string\\\")\\n child = document.createTextNode(child);\\n node.appendChild(child);\\n }\\n return node;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37967011f4f682f8c26e10460efb91eb\",\n \"score\": \"0.63005865\",\n \"text\": \"function createElement(type, config, children) {\\n\\t var propName;\\n\\n\\t // Reserved names are extracted\\n\\t var props = {};\\n\\n\\t var key = null;\\n\\t var ref = null;\\n\\t var self = null;\\n\\t var source = null;\\n\\n\\t if (config != null) {\\n\\t if (hasValidRef(config)) {\\n\\t ref = config.ref;\\n\\t }\\n\\t if (hasValidKey(config)) {\\n\\t key = '' + config.key;\\n\\t }\\n\\n\\t self = config.__self === undefined ? null : config.__self;\\n\\t source = config.__source === undefined ? null : config.__source;\\n\\t // Remaining properties are added to a new props object\\n\\t for (propName in config) {\\n\\t if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n\\t props[propName] = config[propName];\\n\\t }\\n\\t }\\n\\t }\\n\\n\\t // Children can be more than one argument, and those are transferred onto\\n\\t // the newly allocated props object.\\n\\t var childrenLength = arguments.length - 2;\\n\\t if (childrenLength === 1) {\\n\\t props.children = children;\\n\\t } else if (childrenLength > 1) {\\n\\t var childArray = Array(childrenLength);\\n\\t for (var i = 0; i < childrenLength; i++) {\\n\\t childArray[i] = arguments[i + 2];\\n\\t }\\n\\t {\\n\\t if (Object.freeze) {\\n\\t Object.freeze(childArray);\\n\\t }\\n\\t }\\n\\t props.children = childArray;\\n\\t }\\n\\n\\t // Resolve default props\\n\\t if (type && type.defaultProps) {\\n\\t var defaultProps = type.defaultProps;\\n\\t for (propName in defaultProps) {\\n\\t if (props[propName] === undefined) {\\n\\t props[propName] = defaultProps[propName];\\n\\t }\\n\\t }\\n\\t }\\n\\t {\\n\\t if (key || ref) {\\n\\t if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\\n\\t var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\t if (key) {\\n\\t defineKeyPropWarningGetter(props, displayName);\\n\\t }\\n\\t if (ref) {\\n\\t defineRefPropWarningGetter(props, displayName);\\n\\t }\\n\\t }\\n\\t }\\n\\t }\\n\\t return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a797e31dcc007c00564065b410819ac\",\n \"score\": \"0.6277755\",\n \"text\": \"function createElement(type, config, children) {\\n\\t var propName; // Reserved names are extracted\\n\\n\\t var props = {};\\n\\t var key = null;\\n\\t var ref = null;\\n\\t var self = null;\\n\\t var source = null;\\n\\n\\t if (config != null) {\\n\\t if (hasValidRef(config)) {\\n\\t ref = config.ref;\\n\\t {\\n\\t warnIfStringRefCannotBeAutoConverted(config);\\n\\t }\\n\\t }\\n\\n\\t if (hasValidKey(config)) {\\n\\t key = '' + config.key;\\n\\t }\\n\\n\\t self = config.__self === undefined ? null : config.__self;\\n\\t source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n\\t for (propName in config) {\\n\\t if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n\\t props[propName] = config[propName];\\n\\t }\\n\\t }\\n\\t } // Children can be more than one argument, and those are transferred onto\\n\\t // the newly allocated props object.\\n\\n\\n\\t var childrenLength = arguments.length - 2;\\n\\n\\t if (childrenLength === 1) {\\n\\t props.children = children;\\n\\t } else if (childrenLength > 1) {\\n\\t var childArray = Array(childrenLength);\\n\\n\\t for (var i = 0; i < childrenLength; i++) {\\n\\t childArray[i] = arguments[i + 2];\\n\\t }\\n\\n\\t {\\n\\t if (Object.freeze) {\\n\\t Object.freeze(childArray);\\n\\t }\\n\\t }\\n\\t props.children = childArray;\\n\\t } // Resolve default props\\n\\n\\n\\t if (type && type.defaultProps) {\\n\\t var defaultProps = type.defaultProps;\\n\\n\\t for (propName in defaultProps) {\\n\\t if (props[propName] === undefined) {\\n\\t props[propName] = defaultProps[propName];\\n\\t }\\n\\t }\\n\\t }\\n\\n\\t {\\n\\t if (key || ref) {\\n\\t var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n\\t if (key) {\\n\\t defineKeyPropWarningGetter(props, displayName);\\n\\t }\\n\\n\\t if (ref) {\\n\\t defineRefPropWarningGetter(props, displayName);\\n\\t }\\n\\t }\\n\\t }\\n\\t return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f143fa0a14bfd57a80332f89897f4173\",\n \"score\": \"0.6255302\",\n \"text\": \"function createElement(type, props) {\\n var COMPONENTS = {\\n ROOT: function ROOT() {\\n return new _components.Root();\\n },\\n APP: function APP() {\\n return new _components.App(props);\\n },\\n VIEW: function VIEW() {\\n return new _components.View(props);\\n },\\n WINDOW: function WINDOW() {\\n return new _components.Window(props);\\n },\\n VIRTUALTEXT: function VIRTUALTEXT() {\\n return new _components.VirtualText(props);\\n },\\n ROOTTEXT: function ROOTTEXT() {\\n return new _components.RootText(props);\\n },\\n IMAGE: function IMAGE() {\\n return new _components.Image(props);\\n },\\n TEXTINPUT: function TEXTINPUT() {\\n return new _components.TextInput(props);\\n },\\n PICKERINTERNAL: function PICKERINTERNAL() {\\n return new _components.PickerInternal(props);\\n },\\n \\\"default\\\": undefined\\n };\\n return COMPONENTS[type]() || COMPONENTS[\\\"default\\\"];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4a7026c1939cb82ff1cfd1f298ae66\",\n \"score\": \"0.6230725\",\n \"text\": \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":66,"cells":{"query_id":{"kind":"string","value":"85e327b2462f0467d086481a85e554f2"},"query":{"kind":"string","value":"For IE8 and IE9."},"positive_passages":{"kind":"list like","value":[{"docid":"b6a82c40de3522753cd3152728ca92aa","score":"0.0","text":"function getTargetIDForInputEventIE(topLevelType, topLevelTarget, topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topSelectionChange || topLevelType === topLevelTypes.topKeyUp || topLevelType === topLevelTypes.topKeyDown) {\n\t // On the selectionchange event, the target is just document which isn't\n\t // helpful for us so just check activeElement instead.\n\t //\n\t // 99% of the time, keydown and keyup aren't necessary. IE8 fails to fire\n\t // propertychange on the first input event after setting `value` from a\n\t // script and fires only keydown, keypress, keyup. Catching keyup usually\n\t // gets it and catching keydown lets us fire an event for the first\n\t // keystroke if user does a key repeat (it'll be a little delayed: right\n\t // before the second keystroke). Other input methods (e.g., paste) seem to\n\t // fire selectionchange normally.\n\t if (activeElement && activeElement.value !== activeElementValue) {\n\t activeElementValue = activeElement.value;\n\t return activeElementID;\n\t }\n\t }\n\t}","title":""}],"string":"[\n {\n \"docid\": \"b6a82c40de3522753cd3152728ca92aa\",\n \"score\": \"0.0\",\n \"text\": \"function getTargetIDForInputEventIE(topLevelType, topLevelTarget, topLevelTargetID) {\\n\\t if (topLevelType === topLevelTypes.topSelectionChange || topLevelType === topLevelTypes.topKeyUp || topLevelType === topLevelTypes.topKeyDown) {\\n\\t // On the selectionchange event, the target is just document which isn't\\n\\t // helpful for us so just check activeElement instead.\\n\\t //\\n\\t // 99% of the time, keydown and keyup aren't necessary. IE8 fails to fire\\n\\t // propertychange on the first input event after setting `value` from a\\n\\t // script and fires only keydown, keypress, keyup. Catching keyup usually\\n\\t // gets it and catching keydown lets us fire an event for the first\\n\\t // keystroke if user does a key repeat (it'll be a little delayed: right\\n\\t // before the second keystroke). Other input methods (e.g., paste) seem to\\n\\t // fire selectionchange normally.\\n\\t if (activeElement && activeElement.value !== activeElementValue) {\\n\\t activeElementValue = activeElement.value;\\n\\t return activeElementID;\\n\\t }\\n\\t }\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"152ae9bc1417f8a0e5996a8772fc212a","score":"0.729394","text":"function isIE9or8(){\n\t\tvar version = getInternetExplorerVersion();\n\t\treturn(version != -1 && version <= 9 && version >= 7);\n\t\t\n\t\t//return ($.browser.msie && $.browser.version <= 9 && window.XDomainRequest);\n\t}","title":""},{"docid":"9dd08fab2832d4c96d6a6496e0eed673","score":"0.6967555","text":"get ie9() {\n return isIE(9);\n }","title":""},{"docid":"677aa9f28e2d8781d3eff09c17b2758d","score":"0.68580246","text":"function is_lt_ie9() {\n\tie_v = parseFloat(navigator.userAgent.match(/MSIE (\\d+\\.\\d+);/));\n\tif(ie_v && ie_v[1] < 9) { return true; } else { return false; };\n}","title":""},{"docid":"dcb3a8814057a19f5ff81cc93d020c03","score":"0.6834211","text":"function patchMSIE() {\r\n\r\n }","title":""},{"docid":"1a44a23db40d5c141279298ea8d160ed","score":"0.6702816","text":"function isIE8(){ \r\nreturn pDocument.getElementById(\"ie8\"); \r\n}","title":""},{"docid":"608598a1ac132fa128b43743c58c26b6","score":"0.6689359","text":"function isIE8() {\n if (window.attachEvent && !window.addEventListener) {\n return true;\n } else {\n return false;\n }\n }","title":""},{"docid":"9cf1e0ff6440ddc7fd4d7bdb69e88d88","score":"0.6531783","text":"function isIE7OrIE8(){\n\tvar version = $.browser.version;\n\tvar idx7 = version.indexOf(\"7.\"); //e' = a 0 se la versione e' un 7.x\n\tvar idx8 = version.indexOf(\"8.\"); //e' = a 0 se la versione e' un 8.x\n\treturn (idx7 == 0 || idx8 == 0 );\n}","title":""},{"docid":"25efbf82b4a0f9660a64b3cd5458c441","score":"0.6493873","text":"function nonResIE() {\n if (navigator.sayswho[0].match('MSIE') && navigator.sayswho[1].substring(0,1) < '9') {\n return true;\n }\n return false;\n}","title":""},{"docid":"ba03d852276188c4848f0002b0f34beb","score":"0.63906777","text":"function ie() {\n var ua = window.navigator.userAgent;\n var msie = ua.indexOf(\"MSIE \");\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\:11\\./)) return true;else return false;\n}","title":""},{"docid":"6d02ed54017e9ebd7a3f023529650b8a","score":"0.6377287","text":"function iecompattest(){\nreturn (document.compatMode && document.compatMode!=\"BackCompat\")? document.documentElement : document.body\n}","title":""},{"docid":"cbd752301b41605164bbd54c999408eb","score":"0.63751185","text":"function IEFix(){\n\tif ($.browser.msie && $.browser.version == 7.0) {\n\t\t$('.b-form-holder select').closest('.b-form-line').find('label').addClass('m-label-for-select');\n\t\t$('.b-btn + .b-btn').addClass('m-ml');\n\t}\n}","title":""},{"docid":"753cbb12952f799dc58dad4b0ab33ca0","score":"0.6229552","text":"isBrowserIE () {\n\t\treturn !!(document.documentMode && document.documentMode >= 9)\n\t}","title":""},{"docid":"fc917289d55624d8d0e26719c3746f5f","score":"0.6224928","text":"function checkIE() {\n return !(msie > 0);\n}","title":""},{"docid":"6849ff8d0b5fa8da51f1ff83462baa6b","score":"0.62007254","text":"function PieInIE(){\n\tif ($.browser.msie && $.browser.version <= 8.0) {\n\t\t$('.l-header .b-second-bar li.m-logged .b-flyout, .b-pagination li a, .b-contact-us .b-col2 .b-icon, .b-efficacy-chart .b-col, .l-header .b-second-bar li.m-contact-btn a, .b-btn, .b-manufacturing .b-icon').each(function() {\n\t\t\tPIE.detach(this);\n\t\t\tPIE.attach(this);\n\t\t});\n\t}\n}","title":""},{"docid":"09d7f8f2e0258025bc337f58b6e060bd","score":"0.61332244","text":"function ___IE_global_fix___() { }","title":""},{"docid":"26d5d01fefa4dda7eb0cfe4ddd1c247b","score":"0.61118186","text":"function msieversion() {\r\n var ua = window.navigator.userAgent;\r\n var msie = ua.indexOf(\"MSIE \");\r\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\:11\\./)) { \r\n var ieVersion = parseInt(ua.substring(msie + 5, ua.indexOf(\".\", msie)));\r\n if (ieVersion === 9) {$('body').addClass('no-js ie' + ieVersion);}\r\n return ieVersion;\r\n }\r\n else { return false; }\r\n }","title":""},{"docid":"50d9c43bdc41b03531c4d330c54b52ab","score":"0.60704446","text":"function msieversion() {\n var ua = window.navigator.userAgent;\n var msie = ua.indexOf(\"MSIE \");\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\:11\\./)) {\n var ieVersion = parseInt(ua.substring(msie + 5, ua.indexOf(\".\", msie)));\n if (ieVersion === 9) { $('body').addClass('no-js ie' + ieVersion); }\n return ieVersion;\n }\n else { return false; }\n }","title":""},{"docid":"7c79038479f08e3ca53f72f53cbb1374","score":"0.6040397","text":"function isIE() {\n var myNav = navigator.userAgent.toLowerCase();\n return (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1]) : false;\n}","title":""},{"docid":"d9410e2686d6ffdd0eda3ce159681b99","score":"0.6030998","text":"get ie() {\n return getInternetExplorerVersion() !== -1;\n }","title":""},{"docid":"33d953755561cb9a70a33186afe84592","score":"0.60235125","text":"function isIE () {\n var myNav = navigator.userAgent.toLowerCase();\n return (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1]) : false;\n}","title":""},{"docid":"a014984976011951eb20b05ea6369e0b","score":"0.60194343","text":"function isIE () {\n var myNav = navigator.userAgent.toLowerCase();\n return (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1], 10) : false;\n }","title":""},{"docid":"2de515d5010197d6bc4399f0306b6676","score":"0.600236","text":"function IsIE() \r\n{\r\n\t\r\n\tif (navigator.userAgent.indexOf('MSIE')>-1)\r\n\t\treturn true;\r\n\telse\r\n\t\treturn false;\r\n}","title":""},{"docid":"3092d2a36c48eff11df773e2d98a6949","score":"0.5975352","text":"function isIE() {\r\n\treturn navigator.appName != \"Netscape\";\r\n}","title":""},{"docid":"29b1ebe4670d87e7bd76e7e11c7c011d","score":"0.5968318","text":"function isBrowserIE() {\n\t if (window.navigator && window.navigator.userAgent) {\n\t var ua = window.navigator.userAgent;\n\t\n\t return ua.indexOf('Trident/7.0') > 0 || ua.indexOf('Trident/6.0') > 0;\n\t }\n\t\n\t return false;\n\t}","title":""},{"docid":"eb24954dc0abdd76ad67683c9fd4fcd2","score":"0.5961604","text":"function msieversion()\n\t {\n\t var ua = window.navigator.userAgent\n\t var msie = ua.indexOf ( \"MSIE \" )\n\n\t if ( msie > 0 ) { // If Internet Explorer, return version number\n\t \tvar version = parseInt (ua.substring (msie+5, ua.indexOf (\".\", msie )));\n\t \tif(version <= 8){\n\t \t$('html').addClass(\"lt-ie9\");\n\t \t$('#FINRA_header, #FINRA_footer, #FINRA_responsive').css('font-size', '14px').addClass(\"finra_normalize_prefix\");\n\t \t$('#FINRA_header').append('<link rel=\"stylesheet\" href=\"/finra-theme.no-query.css\"/>');\n\n\n\t \t}\n\t return parseInt (ua.substring (msie+5, ua.indexOf (\".\", msie )))\n\t }\n\t else // If another browser, return 0\n\t return 0\n\t }","title":""},{"docid":"c9239d6f259aadef0c521f4ddbca688d","score":"0.59483665","text":"function isIE() {\r\n var ua = window.navigator.userAgent;\r\n var msie = ua.indexOf(\"MSIE \");\r\n\r\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\:11\\./)) {\r\n return true;\r\n }\r\n\r\n return false;\r\n }","title":""},{"docid":"d04d1871b31da43327f469c8f88e2adc","score":"0.5943452","text":"function isIE() {\n var myNav = navigator.userAgent.toLowerCase();\n return myNav.indexOf(\"msie\") != -1\n ? parseInt(myNav.split(\"msie\")[1], 10)\n : false;\n }","title":""},{"docid":"eb1a0b72f1a2913f1c1c6653469cd6b8","score":"0.59195244","text":"function NiftyCheck()\n{\nif(!document.getElementById || !document.createElement)\n return(false);\nvar b=navigator.userAgent.toLowerCase();\nif(b.indexOf(\"msie 5\")>0 && b.indexOf(\"opera\")==-1)\n return(false);\nreturn(true);\n}","title":""},{"docid":"1f7327f0058987c3387dced049bbc545","score":"0.58856195","text":"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}","title":""},{"docid":"1f7327f0058987c3387dced049bbc545","score":"0.58856195","text":"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}","title":""},{"docid":"1f7327f0058987c3387dced049bbc545","score":"0.58856195","text":"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}","title":""},{"docid":"1f7327f0058987c3387dced049bbc545","score":"0.58856195","text":"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}","title":""},{"docid":"1f7327f0058987c3387dced049bbc545","score":"0.58856195","text":"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}","title":""},{"docid":"1f7327f0058987c3387dced049bbc545","score":"0.58856195","text":"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}","title":""},{"docid":"1f7327f0058987c3387dced049bbc545","score":"0.58856195","text":"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}","title":""},{"docid":"1f7327f0058987c3387dced049bbc545","score":"0.58856195","text":"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}","title":""},{"docid":"1f7327f0058987c3387dced049bbc545","score":"0.58856195","text":"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}","title":""},{"docid":"1f7327f0058987c3387dced049bbc545","score":"0.58856195","text":"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}","title":""},{"docid":"1f7327f0058987c3387dced049bbc545","score":"0.58856195","text":"function isIE() {\n\t\treturn typeof attachEvent !== \"undefined\" && typeof addEventListener === \"undefined\";\n\t}","title":""},{"docid":"0f7ceb5423adace2c2fb5dc072682be4","score":"0.5870658","text":"function isIE( version ) {\n return getInternetExplorerVersion() === version;\n}","title":""},{"docid":"2c73b0cd17e3bfbb0b986e34e36069a3","score":"0.5861358","text":"function isIE() {\n var ua = window.navigator.userAgent;\n // MSIE: ie <= 10, Trident: ie 11+\n return ua.indexOf('Trident/') > 0 || ua.indexOf('MSIE ') > 0;\n}","title":""},{"docid":"cf2ab5f24e2a7e57a507764681586836","score":"0.58583283","text":"function ieVersion() {\n if (navigator.appName == \"Microsoft Internet Explorer\") {\n if (navigator.appVersion.indexOf(\"MSIE 8.0\") > 0) { return 8; }\n else if (navigator.appVersion.indexOf(\"MSIE 7.0\") > 0) { return 7; }\n else if (navigator.appVersion.indexOf(\"MSIE 6.0\") > 0) { return 6; }\n } else { return 8; }\n}","title":""},{"docid":"ad9642597dc9685a00dfe297a2a9728c","score":"0.582267","text":"function lessThanIE9(element) {\n\t\t\tvar fileName = element.val().split(/\\\\/).pop();\n\n\t\t\tif (!fileName == '') {\n\n\t\t\t\tvar fileExtension = fileName.split('.').pop().toLowerCase(),\n\t\t\t\t\textensions = element.data('extensions'),\n\t\t\t\t\tparent = element.parent(),\n\t\t\t\t\tuploadFeedback = parent.find('.customfile-feedback'),\n\t\t\t\t\tuploadButton = parent.find('.customfile-button'),\n\t\t\t\t\tprogressionBar = parent.find('.customfile-progress'),\n\t\t\t\t\tfileExtClass = 'customfile-ext-' + fileExtension;\n\n\t\t\t\tvar validExtension = fileExtValidation(extensions, [fileExtension]);\n\n\t\t\t\tif (validExtension) {\n\t\t\t\t\tuploadFeedback.text(fileName);\n\n\t\t\t\t\tdidValidate(uploadFeedback, uploadButton, fileExtClass);\n\n\t\t\t\t} else {\n\n\t\t\t\t\tdidNotValidate(element, uploadFeedback, uploadButton);\n\n\t\t\t\t}\n\n\t\t\t}\n\t\t}","title":""},{"docid":"41f3ebd066dd18bb9fb4b86629e624ba","score":"0.58156276","text":"function isIE() {\n\t//Create var for userAgent\n\tuserAg = navigator.userAgent;\n\t//Create var to store return of index of strings\n\tvar is_ie = userAg.indexOf(\"MSIE \") > -1 || userAg.indexOf(\"Trident/\") > -1 || userAg.indexOf(\"Edge\") > -1;\n\t//return result\n\treturn is_ie;\n}","title":""},{"docid":"04c8c833b9afa91a2a8bcf2ac808f816","score":"0.5814825","text":"function isIE() {\n var ua = navigator.userAgent;\n var is_ie = ua.indexOf(\"MSIE \") > -1 || ua.indexOf(\"Trident/\") > -1;\n\n return is_ie;\n}","title":""},{"docid":"a9a8aad3e3d5a93c5af27f54faaf00b3","score":"0.58119226","text":"function isExplorer()\n{\n var ua = window.navigator.userAgent;\n var msie = ua.indexOf(\"MSIE\");\n\n if (msie > 0)\n {\n return true;\n }\n else\n {\n return false;\n }\n}","title":""},{"docid":"42b7710376ff578f010789cec5b0ccd7","score":"0.5795958","text":"static isIEorEdge() {\n return LuxUtil.isIE() || LuxUtil.isEdge();\n }","title":""},{"docid":"be4ccfd0f0e7c8a803d6cbf9cc69516a","score":"0.5771936","text":"function initFixCompatibility() {\n (0, _ie11helper2.default)();\n}","title":""},{"docid":"9acc93f0e5fe31e6a38eba9b140bbf73","score":"0.57718396","text":"function is_ie() {\n\n var ua = window.navigator.userAgent;\n var msie = ua.indexOf(\"MSIE \");\n\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\:11\\./)) {\n return true;\n }\n else {\n return false;\n }\n }","title":""},{"docid":"6ab0de16ce268c57251ff718a4cfb48c","score":"0.5770083","text":"static isIE() {\n const msie = window.document['documentMode'];\n return msie && msie <= 11;\n }","title":""},{"docid":"9a74be172f66219ea5d2ab71293d7a08","score":"0.57423097","text":"function isSupported()\r\n{\r\n\treturn (isIE || isMoz);\r\n}","title":""},{"docid":"24fc3c7cd9f06636ca3e46b194e8acdd","score":"0.57413286","text":"function InitBrowserSettings() {\n if (/msie/.test(navigator.userAgent.toLowerCase())) { // Identify browser for IE9-IE10.\n document.onselectstart = function () { return false; };\n } else if (!!window.ActiveXObject || \"ActiveXObject\" in window) { // Identify browser for IE11.\n document.onselectstart = function () { return false; };\n }\n}","title":""},{"docid":"657a6ea60bbb7557ee3502a1a6327a54","score":"0.57395566","text":"function isIE() {\n var ua = window.navigator.userAgent; //Check the userAgent property of the window.navigator object\n var msie = ua.indexOf('MSIE '); // IE 10 or older\n var trident = ua.indexOf('Trident/'); //IE 11\n\n return (msie > 0 || trident > 0);\n }","title":""},{"docid":"2211943686f3e395bbdbf68cbe3b3e6a","score":"0.5718534","text":"function isInternetExplorer() {\n\t if (typeof navigator === 'undefined') {\n\t return false;\n\t }\n\t\n\t var rv = -1; // Return value assumes failure.\n\t var ua = navigator.userAgent;\n\t if (navigator.appName === 'Microsoft Internet Explorer') {\n\t var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n\t if (re.exec(ua) != null)\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t // IE > 11\n\t else if (ua.indexOf(\"Trident\") > -1) {\n\t var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n\t if (re.exec(ua) !== null) {\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t }\n\t\n\t return rv >= 8;\n\t }","title":""},{"docid":"01725ab9ec4ee5ba2b6bf5dfb1602333","score":"0.56781083","text":"function isIE(version) {\n return getInternetExplorerVersion() === version;\n }","title":""},{"docid":"8b205e0308ebe3bc711b997bbdbbeeff","score":"0.5676731","text":"function isInternetExplorer() {\n\t var rv = -1; // Return value assumes failure.\n\t var ua = navigator.userAgent;\n\t if (navigator.appName === 'Microsoft Internet Explorer') {\n\t var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n\t if (re.exec(ua) != null)\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t // IE > 11\n\t else if (ua.indexOf(\"Trident\") > -1) {\n\t var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n\t if (re.exec(ua) !== null) {\n\t rv = parseFloat(RegExp.$1);\n\t }\n\t }\n\t\n\t return rv >= 8;\n\t }","title":""},{"docid":"5aab2c26dbe38c15780440b11bb307eb","score":"0.5670071","text":"function msieversion() {\n\n var ua = window.navigator.userAgent;\n var msie = ua.indexOf(\"MSIE \");\n\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\:11\\./)) {\n //alert(parseInt(ua.substring(msie + 5, ua.indexOf(\".\", msie))));\n var retval = 1;\n }\n else {\n retval = '';\n }\n\n return retval;\n}","title":""},{"docid":"58c5f7c8eb1ee55df0626b4ac0029b0f","score":"0.5661578","text":"function isIe() {\n\tvar ie\n\tif(typeof(Promise)==='undefined') {\n\t\tie = true\n\t} else {\n\t\tie = false\n\t}\n\treturn ie;\n}","title":""},{"docid":"861233e9096a869ea272a865a2ee513a","score":"0.56463116","text":"function isIE () {\n // Check if IE/Edge using 'console.log(navigator.userAgent.toLowerCase())'\n return (ua.indexOf('msie') != -1 || ua.indexOf('trident') != -1 || ua.indexOf('edge') != -1) ? true : false;\n }","title":""},{"docid":"51f57acd5162a848e53a734e05384443","score":"0.5638144","text":"function mlib_is_ie() {\n var myNav = navigator.userAgent.toLowerCase();\n return (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1]) : 1000;\n}","title":""},{"docid":"db5137322cea48e852374ca3c11a76da","score":"0.5637232","text":"function ietruebody(){\nreturn (document.compatMode && document.compatMode!=\"BackCompat\")? document.documentElement : document.body\n}","title":""},{"docid":"4545d33b89fb0d7548b12e583c5412fc","score":"0.5604213","text":"function IsInternetExplorer () {\n var ua = window.navigator.userAgent;\n var msie = ua.indexOf(\"MSIE \");\n\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\:11\\./)) { // If Internet Explorer, return true\n return true;\n } else { // If another browser, return false\n return false;\n }\n}","title":""},{"docid":"053dc7d1eca8ef5d81348c783f9b73c4","score":"0.559814","text":"function isInternetExplorer() {\n var rv = -1; // Return value assumes failure.\n var ua = navigator.userAgent;\n if (navigator.appName === 'Microsoft Internet Explorer') {\n var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n if (re.exec(ua) != null)\n rv = parseFloat(RegExp.$1);\n }\n // IE > 11\n else if (ua.indexOf(\"Trident\") > -1) {\n var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n if (re.exec(ua) !== null) {\n rv = parseFloat(RegExp.$1);\n }\n }\n\n return rv >= 8;\n }","title":""},{"docid":"d71e3e2e2b344ea1ee7d8b8a6d278526","score":"0.55922335","text":"function isIE( version, comparison ){\r\n\t\t var $div = jQuery('<div style=\"display:none;\"/>').appendTo(jQuery('body'));\r\n\t\t $div.html('<!--[if '+(comparison||'')+' IE '+(version||'')+']><a> </a><![endif]-->');\r\n\t\t var ieTest = $div.find('a').length;\r\n\t\t $div.remove();\r\n\t\t return ieTest;\r\n\t\t}","title":""},{"docid":"50b2fc686474841757f9c16b490114cb","score":"0.55850303","text":"function isIE6() {\n return /msie|MSIE 6/.test(navigator.userAgent);\n}","title":""},{"docid":"6f67218fe3342bce87d859f4f65d8eb1","score":"0.55803746","text":"function isInternetExplorer() {\n if (typeof navigator === 'undefined') {\n return false;\n }\n\n var rv = -1; // Return value assumes failure.\n var ua = navigator.userAgent;\n if (navigator.appName === 'Microsoft Internet Explorer') {\n var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n if (re.exec(ua) != null)\n rv = parseFloat(RegExp.$1);\n }\n // IE > 11\n else if (ua.indexOf(\"Trident\") > -1) {\n var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n if (re.exec(ua) !== null) {\n rv = parseFloat(RegExp.$1);\n }\n }\n\n return rv >= 8;\n }","title":""},{"docid":"6f67218fe3342bce87d859f4f65d8eb1","score":"0.55803746","text":"function isInternetExplorer() {\n if (typeof navigator === 'undefined') {\n return false;\n }\n\n var rv = -1; // Return value assumes failure.\n var ua = navigator.userAgent;\n if (navigator.appName === 'Microsoft Internet Explorer') {\n var re = new RegExp(\"MSIE ([0-9]{1,}[\\.0-9]{0,})\");\n if (re.exec(ua) != null)\n rv = parseFloat(RegExp.$1);\n }\n // IE > 11\n else if (ua.indexOf(\"Trident\") > -1) {\n var re = new RegExp(\"rv:([0-9]{2,2}[\\.0-9]{0,})\");\n if (re.exec(ua) !== null) {\n rv = parseFloat(RegExp.$1);\n }\n }\n\n return rv >= 8;\n }","title":""},{"docid":"31bc7ebcb86e0cd2ccec0c2b44b31205","score":"0.5579846","text":"function isIE() {\n\t\tvar isNetscape = navigator.appName == 'Netscape';\n\t\tvar isTrident = new RegExp(\"Trident/.*rv:([0-9]{1,}[\\.0-9]{0,})\").exec(navigator.userAgent) != null;\n\t\treturn ((navigator.appName == 'Microsoft Internet Explorer') || (isNetscape && isTrident));\n\t}","title":""},{"docid":"2df7d3feaf9f39033ea743d6656cc76f","score":"0.55766374","text":"function isIE() {\n ua = navigator.userAgent;\n\n /* MSIE used to detect old browsers and Trident used to newer ones*/\n var is_ie = ua.indexOf(\"MSIE \") > -1 || ua.indexOf(\"Trident/\") > -1;\n\n return is_ie;\n }","title":""},{"docid":"efbea42f85f2fbfff6c2769a38fe1561","score":"0.55621237","text":"function isIE() {\n for (var v = 3, el = document.createElement('b'), all = el.all || []; el.innerHTML = '<!--[if gt IE ' + (++v) + ']><i><![endif]-->', all[0];);\n return v > 4 ? v : !!document.documentMode;\n }","title":""},{"docid":"402448850a7d2c521880e5e1652fec8c","score":"0.55601966","text":"function isIE6() {\n\t\treturn $.browser.msie && /msie 6\\.0/i.test(navigator.userAgent);\n\t} // isIE6","title":""},{"docid":"c30af8e2c39febb0774b3a657919d00b","score":"0.5559786","text":"function isIe()\n// Returns the version of Windows Internet Explorer or a -1\n// (indicating the use of another browser).\n{\n\tvar rv = -1; // Return value assumes failure.\n\tif (navigator.appName == 'Microsoft Internet Explorer') { return true; }\n\treturn false;\n}","title":""},{"docid":"3bf1787b441762dfdcf724f4d657bc35","score":"0.555916","text":"function browserCheck(){\n\t\tif(Globals.s.isIE === false || Globals.s.ieVersion >= 10){\n\t\t\ts.browserOk = true;\n\t\t}\n\t\telse{\n\t\t\ts.browserOk = false;\n\t\t}\n\t}","title":""},{"docid":"00041206bfa21b850274241be03f085b","score":"0.5547592","text":"function fixIeBug(string) {\n\t\t\t\tif ($.browser.msie) {\n\t\t\t\t\treturn string.length - string.replace(/\\r/g, '').length;\n\t\t\t\t}\n\t\t\t\treturn 0;\n\t\t\t}","title":""},{"docid":"ee6d3913e9735540272a2ab053617422","score":"0.5533861","text":"function isIE( version, comparison ){\n\t\t var $div = jQuery('<div style=\"display:none;\"/>').appendTo(jQuery('body'));\n\t\t $div.html('<!--[if '+(comparison||'')+' IE '+(version||'')+']><a> </a><![endif]-->');\n\t\t var ieTest = $div.find('a').length;\n\t\t $div.remove();\n\t\t return ieTest;\n\t\t}","title":""},{"docid":"19dfb02b2f0f4874072568075cb15de9","score":"0.5518443","text":"function usingIE() {\n return navigator.appVersion.match(/\\.NET/i) !== null;\n}","title":""},{"docid":"587bf33a052b2e3174a3381e381d768a","score":"0.55045223","text":"function fixIeBug(string) {\n\t\t\t\tif (browser.msie) {\n\t\t\t\t\treturn string.length - string.replace(/\\r*/g, '').length;\n\t\t\t\t}\n\t\t\t\treturn 0;\n\t\t\t}","title":""},{"docid":"2635793ca2c5a6bf1a718134cadf50b5","score":"0.55023104","text":"function fixIeBug(string) {\n\t\t\t\tif ($.browser.msie) {\n\t\t\t\t\treturn string.length - string.replace(/\\r*/g, '').length;\n\t\t\t\t}\n\t\t\t\treturn 0;\n\t\t\t}","title":""},{"docid":"6f7e348aa5857c63259f6972bab6c358","score":"0.54956174","text":"function ie8SafePreventEvent(event) \n{\n (event.preventDefault) ? event.preventDefault() : event.returnValue = false;\n}","title":""},{"docid":"31a61fd07a4ea33776983c2afc69f2c9","score":"0.5464117","text":"function isIE() {\n var s = navigator.userAgent.toLowerCase();\n console.log(s);\n //ie10 information:\n //mozilla/5.0 (compatible; msie 10.0; windows nt 6.2; trident/6.0)\n //ie11 information:\n //mozilla/5.0 (windows nt 6.1; trident/7.0; slcc2; .net clr 2.0.50727; .net clr 3.5.30729; .net clr 3.0.30729; media center pc 6.0; .net4.0c; .net4.0e; infopath.2; rv:11.0) like gecko\n var ie = s.match(/rv:([\\d.]+)/) || s.match(/msie ([\\d.]+)/);\n if (ie) {\n return ie[1];\n } else {\n return -1;\n }\n}","title":""},{"docid":"076c31708531353861783e21ab61ee80","score":"0.54590315","text":"function ieFixes(override){\r\n\t\tvar ieClass = 'ie-';\r\n\t\tif(s.ieVersion === 99){\r\n\t\t\tieClass+='11+';\r\n\t\t}\r\n\t\telse if(s.ieVersion < 9){\r\n\t\t\tieClass+='old';\r\n\t\t}\r\n\t\telse{\r\n\t\t\tieClass+=s.ieVersion;\r\n\t\t}\r\n\t\t$('html').addClass(ieClass);\r\n\t\t\r\n\r\n\t\t/**********************************\r\n\t\tFix for IE9's css selector limit\r\n\r\n\t\tInfo\r\n\t\t\tIE9 has a per-file css selector limit of 4096. To deal with this, grunt makes a copy of the wc-styles.css file\r\n\t\t\tand breaks it into chunks that are smaller than that. Then we use this JS to link to those files in the \r\n\t\t\thead if the browser is IE9 or below.\r\n\r\n\t\tNotes\r\n\t\t[1]\t\tIf we ever need more files than 2 *shudder*, update this array with the new file names. \r\n\t\t[2] \tFirst check to see if the split CSS files are there\r\n\t\t[3] \t...if they are then remove the original css file\r\n\t\t[4] \t...and add the new ones.\r\n\t\t**********************************/\r\n\t\tif (s.ieVersion < 10 || override === true){\r\n\t\t\tvar ieCSSFiles = [\r\n\t\t\t\t'wc-style_part_1.css',/*[1]*/\r\n\t\t\t\t'wc-style_part_2.css'\r\n\t\t\t];\r\n\t\t\tcheckUrl(s.cssFolderPath + ieCSSFiles[1], function(m){/*[2]*/\r\n\t\t\t\tif(m === 'success'){\r\n\t\t\t\t\t$(mainCSSLink).remove(); /*[3]*/\r\n\t\t\t\t\tfor (var i = 0; i < ieCSSFiles.length; i++) {/*[4]*/\r\n\t\t\t\t\t\tvar path \t= s.cssFolderPath + ieCSSFiles[i];\r\n\t\t\t\t\t\tvar link \t= document.createElement('link');\r\n\t\t\t\t\t\tlink.rel \t= 'stylesheet';\r\n\t\t\t\t\t\tlink.type \t= 'text/css';\r\n\t\t\t\t\t\tlink.href \t= path;\r\n\t\t\t\t\t\tlink.media \t= 'all';\r\n\t\t\t\t\t\tdocument.getElementsByTagName('head')[0].appendChild(link);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t});\r\n\t\t}\r\n\t}","title":""},{"docid":"076c31708531353861783e21ab61ee80","score":"0.54590315","text":"function ieFixes(override){\r\n\t\tvar ieClass = 'ie-';\r\n\t\tif(s.ieVersion === 99){\r\n\t\t\tieClass+='11+';\r\n\t\t}\r\n\t\telse if(s.ieVersion < 9){\r\n\t\t\tieClass+='old';\r\n\t\t}\r\n\t\telse{\r\n\t\t\tieClass+=s.ieVersion;\r\n\t\t}\r\n\t\t$('html').addClass(ieClass);\r\n\t\t\r\n\r\n\t\t/**********************************\r\n\t\tFix for IE9's css selector limit\r\n\r\n\t\tInfo\r\n\t\t\tIE9 has a per-file css selector limit of 4096. To deal with this, grunt makes a copy of the wc-styles.css file\r\n\t\t\tand breaks it into chunks that are smaller than that. Then we use this JS to link to those files in the \r\n\t\t\thead if the browser is IE9 or below.\r\n\r\n\t\tNotes\r\n\t\t[1]\t\tIf we ever need more files than 2 *shudder*, update this array with the new file names. \r\n\t\t[2] \tFirst check to see if the split CSS files are there\r\n\t\t[3] \t...if they are then remove the original css file\r\n\t\t[4] \t...and add the new ones.\r\n\t\t**********************************/\r\n\t\tif (s.ieVersion < 10 || override === true){\r\n\t\t\tvar ieCSSFiles = [\r\n\t\t\t\t'wc-style_part_1.css',/*[1]*/\r\n\t\t\t\t'wc-style_part_2.css'\r\n\t\t\t];\r\n\t\t\tcheckUrl(s.cssFolderPath + ieCSSFiles[1], function(m){/*[2]*/\r\n\t\t\t\tif(m === 'success'){\r\n\t\t\t\t\t$(mainCSSLink).remove(); /*[3]*/\r\n\t\t\t\t\tfor (var i = 0; i < ieCSSFiles.length; i++) {/*[4]*/\r\n\t\t\t\t\t\tvar path \t= s.cssFolderPath + ieCSSFiles[i];\r\n\t\t\t\t\t\tvar link \t= document.createElement('link');\r\n\t\t\t\t\t\tlink.rel \t= 'stylesheet';\r\n\t\t\t\t\t\tlink.type \t= 'text/css';\r\n\t\t\t\t\t\tlink.href \t= path;\r\n\t\t\t\t\t\tlink.media \t= 'all';\r\n\t\t\t\t\t\tdocument.getElementsByTagName('head')[0].appendChild(link);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t});\r\n\t\t}\r\n\t}","title":""},{"docid":"001b16ca1efd64c8cf0d7bad88c83e2d","score":"0.54462504","text":"function ieimgposition(nextsh,opt) {\r\n\r\n\t\t\tif (isIE(8)) {\r\n\t\t\t\t\tvar ie8img = nextsh.find('.ieeightfallbackimage');\r\n\t\t\t\t\tif (opt.startwidth/opt.startheight <nextsh.data('owidth')/nextsh.data('oheight'))\r\n\t\t\t\t\t\tie8img.css({width:\"auto\",height:\"100%\"})\r\n\t\t\t\t\telse\r\n\t\t\t\t\t\tie8img.css({width:\"100%\",height:\"auto\"})\r\n\r\n\r\n\r\n\t\t\t\t\tvar ie8w = ie8img.width(),\r\n\t\t\t\t\t ie8h = ie8img.height();\r\n\r\n\t\t\t\t\tif (nextsh.data('bgposition')==\"center center\")\r\n\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", left:opt.width/2-ie8w/2+\"px\"});\r\n\r\n\t\t\t\t\tif (nextsh.data('bgposition')==\"center top\" || nextsh.data('bgposition')==\"top center\")\r\n\t\t\t\t\t\tie8img.css({position:\"absolute\",top:\"0px\", left:opt.width/2-ie8w/2+\"px\"});\r\n\r\n\t\t\t\t\tif (nextsh.data('bgposition')==\"center bottom\" || nextsh.data('bgposition')==\"bottom center\")\r\n\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", left:opt.width/2-ie8w/2+\"px\"});\r\n\r\n\r\n\t\t\t\t\tif (nextsh.data('bgposition')==\"right top\" || nextsh.data('bgposition')==\"top right\")\r\n\t\t\t\t\t\tie8img.css({position:\"absolute\",top:\"0px\", right:\"0px\"});\r\n\r\n\t\t\t\t\tif (nextsh.data('bgposition')==\"right bottom\" || nextsh.data('bgposition')==\"bottom right\")\r\n\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", right:\"0px\"});\r\n\r\n\t\t\t\t\tif (nextsh.data('bgposition')==\"right center\" || nextsh.data('bgposition')==\"center right\")\r\n\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", right:\"0px\"});\r\n\r\n\t\t\t\t\tif (nextsh.data('bgposition')==\"left bottom\" || nextsh.data('bgposition')==\"bottom left\")\r\n\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", left:\"0px\"});\r\n\r\n\t\t\t\t\tif (nextsh.data('bgposition')==\"left center\" || nextsh.data('bgposition')==\"center left\")\r\n\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", left:\"0px\"});\r\n\t\t\t\t}\r\n\t\t}","title":""},{"docid":"71c44777b5ca40c1205387e13fef4cf0","score":"0.54429466","text":"function ieimgposition(nextsh,opt) {\n\n\t\t\tif (isIE(8)) {\n\t\t\t\t\tvar ie8img = nextsh.find('.ieeightfallbackimage');\n\t\t\t\t\tif (opt.startwidth/opt.startheight <nextsh.data('owidth')/nextsh.data('oheight'))\n\t\t\t\t\t\tie8img.css({width:\"auto\",height:\"100%\"})\n\t\t\t\t\telse\n\t\t\t\t\t\tie8img.css({width:\"100%\",height:\"auto\"})\n\n\n\n\t\t\t\t\tvar ie8w = ie8img.width(),\n\t\t\t\t\t ie8h = ie8img.height();\n\n\t\t\t\t\tif (nextsh.data('bgposition')==\"center center\")\n\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", left:opt.width/2-ie8w/2+\"px\"});\n\n\t\t\t\t\tif (nextsh.data('bgposition')==\"center top\" || nextsh.data('bgposition')==\"top center\")\n\t\t\t\t\t\tie8img.css({position:\"absolute\",top:\"0px\", left:opt.width/2-ie8w/2+\"px\"});\n\n\t\t\t\t\tif (nextsh.data('bgposition')==\"center bottom\" || nextsh.data('bgposition')==\"bottom center\")\n\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", left:opt.width/2-ie8w/2+\"px\"});\n\n\n\t\t\t\t\tif (nextsh.data('bgposition')==\"right top\" || nextsh.data('bgposition')==\"top right\")\n\t\t\t\t\t\tie8img.css({position:\"absolute\",top:\"0px\", right:\"0px\"});\n\n\t\t\t\t\tif (nextsh.data('bgposition')==\"right bottom\" || nextsh.data('bgposition')==\"bottom right\")\n\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", right:\"0px\"});\n\n\t\t\t\t\tif (nextsh.data('bgposition')==\"right center\" || nextsh.data('bgposition')==\"center right\")\n\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", right:\"0px\"});\n\n\t\t\t\t\tif (nextsh.data('bgposition')==\"left bottom\" || nextsh.data('bgposition')==\"bottom left\")\n\t\t\t\t\t\tie8img.css({position:\"absolute\",bottom:\"0px\", left:\"0px\"});\n\n\t\t\t\t\tif (nextsh.data('bgposition')==\"left center\" || nextsh.data('bgposition')==\"center left\")\n\t\t\t\t\t\tie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", left:\"0px\"});\n\t\t\t\t}\n\t\t}","title":""},{"docid":"9c23bad8cd0d447bb2c9ec763dbd1dd1","score":"0.5429612","text":"function ieimgposition(nextsh,opt) {\n\n if (isIE(8)) {\n var ie8img = nextsh.find('.ieeightfallbackimage');\n if (opt.startwidth/opt.startheight <nextsh.data('owidth')/nextsh.data('oheight'))\n ie8img.css({width:\"auto\",height:\"100%\"})\n else\n ie8img.css({width:\"100%\",height:\"auto\"})\n\n\n\n var ie8w = ie8img.width(),\n ie8h = ie8img.height();\n\n if (nextsh.data('bgposition')==\"center center\")\n ie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", left:opt.width/2-ie8w/2+\"px\"});\n\n if (nextsh.data('bgposition')==\"center top\" || nextsh.data('bgposition')==\"top center\")\n ie8img.css({position:\"absolute\",top:\"0px\", left:opt.width/2-ie8w/2+\"px\"});\n\n if (nextsh.data('bgposition')==\"center bottom\" || nextsh.data('bgposition')==\"bottom center\")\n ie8img.css({position:\"absolute\",bottom:\"0px\", left:opt.width/2-ie8w/2+\"px\"});\n\n\n if (nextsh.data('bgposition')==\"right top\" || nextsh.data('bgposition')==\"top right\")\n ie8img.css({position:\"absolute\",top:\"0px\", right:\"0px\"});\n\n if (nextsh.data('bgposition')==\"right bottom\" || nextsh.data('bgposition')==\"bottom right\")\n ie8img.css({position:\"absolute\",bottom:\"0px\", right:\"0px\"});\n\n if (nextsh.data('bgposition')==\"right center\" || nextsh.data('bgposition')==\"center right\")\n ie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", right:\"0px\"});\n\n if (nextsh.data('bgposition')==\"left bottom\" || nextsh.data('bgposition')==\"bottom left\")\n ie8img.css({position:\"absolute\",bottom:\"0px\", left:\"0px\"});\n\n if (nextsh.data('bgposition')==\"left center\" || nextsh.data('bgposition')==\"center left\")\n ie8img.css({position:\"absolute\",top:opt.height/2 - ie8h/2+\"px\", left:\"0px\"});\n }\n }","title":""},{"docid":"d314f840e0381e31cb5dfe1d305d5f76","score":"0.5418099","text":"function browserDetect(){\r\n\t\tvar ua = window.navigator.userAgent;\r\n\t\ts.isFirefox = ua.toLowerCase().indexOf('firefox') > -1; /*[1]*/\r\n\t\tif (s.isFirefox){\r\n\t\t\t$('html').addClass('firefox');\r\n\t\t}\r\n\r\n\t\tvar msIEIndex \t\t= ua.toLowerCase().indexOf(\"msie\");\r\n\t\tvar tridentIndex \t= ua.toLowerCase().indexOf(\"trident\");\r\n\t\tif (msIEIndex > -1 || tridentIndex > -1){\r\n\t\t\ts.isIE = true;\r\n\t\t\t$('html').addClass('ie-yes');\r\n\t\t\tif (msIEIndex > -1){\r\n\t\t\t\ts.ieVersion = parseInt(ua.substring(msIEIndex + 5, ua.indexOf(\".\", msIEIndex)));\r\n\t\t\t}\r\n\t\t\telse{\r\n\t\t\t\ts.ieVersion = 99;\r\n\t\t\t}\r\n\t\t\tieFixes();\r\n\t\t}\r\n\t\telse{\r\n\t\t\ts.isIE = false;\r\n\t\t}\r\n\t}","title":""},{"docid":"d314f840e0381e31cb5dfe1d305d5f76","score":"0.5418099","text":"function browserDetect(){\r\n\t\tvar ua = window.navigator.userAgent;\r\n\t\ts.isFirefox = ua.toLowerCase().indexOf('firefox') > -1; /*[1]*/\r\n\t\tif (s.isFirefox){\r\n\t\t\t$('html').addClass('firefox');\r\n\t\t}\r\n\r\n\t\tvar msIEIndex \t\t= ua.toLowerCase().indexOf(\"msie\");\r\n\t\tvar tridentIndex \t= ua.toLowerCase().indexOf(\"trident\");\r\n\t\tif (msIEIndex > -1 || tridentIndex > -1){\r\n\t\t\ts.isIE = true;\r\n\t\t\t$('html').addClass('ie-yes');\r\n\t\t\tif (msIEIndex > -1){\r\n\t\t\t\ts.ieVersion = parseInt(ua.substring(msIEIndex + 5, ua.indexOf(\".\", msIEIndex)));\r\n\t\t\t}\r\n\t\t\telse{\r\n\t\t\t\ts.ieVersion = 99;\r\n\t\t\t}\r\n\t\t\tieFixes();\r\n\t\t}\r\n\t\telse{\r\n\t\t\ts.isIE = false;\r\n\t\t}\r\n\t}","title":""},{"docid":"f2438fdb3a4cd76dab1f2f3fcf1800c7","score":"0.54125375","text":"function MSIEVersion() {\n var ua = window.navigator.userAgent;\n var msie = ua.indexOf(\"MSIE \");\n\n if (msie > 0) // If Internet Explorer, return version number\n //alert(parseInt(ua.substring(msie + 5, ua.indexOf(\".\", msie))));\n return true;\n else // If another browser, return 0\n return false;\n\n //return false;\n}","title":""},{"docid":"ab0eaea1aaa528160deb92d35b3856d4","score":"0.54122365","text":"function m(){return-1===window.navigator.userAgent.indexOf(\"Trident\")}","title":""},{"docid":"4e1b55e93a8658a120bc43cc7443a926","score":"0.53990734","text":"function browserDetection() {\n \n // Determine the browser type\n // Browser Types:\n // 0 - Not supported\n // 1 - Netscape Communicator 4.x\n // 2 - IE\n // 3 - Opera\n // 4 - NS6\n\n\nvar thebrowser;\n\nvar foropera = window.navigator.userAgent.toLowerCase();\n//alert(foropera);\n\nvar itsopera = foropera.indexOf(\"opera\",0) + 1;\nvar itsgecko = foropera.indexOf(\"gecko\",0) + 1;\nvar itsmozillacompat = foropera.indexOf(\"mozilla\",0) + 1;\nvar itsmsie = foropera.indexOf(\"msie\",0) + 1;\n\n\n\n if (itsopera > 0){\n /******* Identify Opera as IE for static tree to show up *****/\n //thebrowser = 2\n thebrowser = 3;\n //alert(\"its opera\");\n //isNav4 = true\n document.all = document.getElementsByTagName(\"*\")\n\n }\n\n\n if (itsmozillacompat > 0){ \n //alert(\"its mozilla compatible\");\n if (itsgecko > 0) {\n thebrowser = 4\n // alert(\"its gecko\");\n //isNav4 = true\n document.all = document.getElementsByTagName(\"*\")\n\n \n }\n else if (itsmsie > 0) {\n // alert(\"its msie\");\n thebrowser = 2\n //isIE = true\n }\n else {\n // alert(\"its ns4.x\")\n thebrowser = 1\n // isNav4 = true\n }\n } \n\n\nreturn thebrowser;\n\n}","title":""},{"docid":"91f068580bf502a31924764f2b369a60","score":"0.5396355","text":"function isThisIE() {\n // Pre-version 11, this was sufficient.\n if (Prototype.Browser.IE) { return true; }\n\n var ua = navigator.userAgent;\n\n // With IE 11, the string 'Trident' appears in this.\n if (ua.indexOf('Trident') > 0) { return true; }\n\n // With Microsoft Edge...\n if (ua.indexOf('Edge') > 0) { return true; }\n\n // Safari... oddly enough, the userAgent for Chrome includes 'Safari'\n if ((ua.indexOf('Safari') > 0)\n && (ua.indexOf('Chrome') < 0)) { return true; }\n\n return false;\n}","title":""},{"docid":"57e0956f686496c1d7da22314d6fd428","score":"0.53905964","text":"function browserCheck()\n{\nvar check=navigator.appName;\nif (check==\"Microsoft Internet Explorer\")\n{\nbrowserInfo=\"bad\";\n}\n}","title":""},{"docid":"c6e6d16d4975d4548ff6a14569d199b9","score":"0.5390306","text":"function hasTransparentBug(browser) {\n return ~[\"ie 8\", \"ie 9\"].indexOf(browser);\n}","title":""},{"docid":"3ae32a6369487cbb1f94d7dea5693a2d","score":"0.53848743","text":"function setCompatibility()\n {\n if (typeof String.prototype.trim !== 'function') {\n String.prototype.trim = function() {\n return this.replace(/^\\s+|\\s+$/g, '');\n }\n }\n\n if (typeof document.hasFocus !== 'function') {\n // Opera lacks hasFocus support. Simply default to true.\n document.hasFocus = function() {\n return true;\n }\n }\n }","title":""},{"docid":"17bd114deacdbec983a11e98fcf8265a","score":"0.5384539","text":"function ie6Ptach(containerVal) {\n if (IEVersion <= 7) {\n var iframes = containerVal.getElementsByTagName(\"iframe\");\n if (iframes != null && iframes.length > 0) {\n return;\n }\n var ieMat = document.createElement(\"iframe\");\n if (document.location.protocol == \"https:\") {\n ieMat.src = \"/images/spacer.gif\";\n } else if (window.opera != \"undefined\") {\n ieMat.src = \"\";\n } else {\n ieMat.src = \"javascript:false\";\n }\n ieMat.scrolling = \"no\";\n ieMat.frameBorder = \"0\";\n ieMat.style.width = containerVal.offsetWidth + \"px\";\n ieMat.style.height = containerVal.offsetHeight + \"px\";\n ieMat.style.zIndex = \"-1\";\n containerVal.insertBefore(ieMat, containerVal.childNodes[0]);\n containerVal.style.zIndex = \"100\";\n }\n}","title":""},{"docid":"55e7b27e88e92567331928e67164fb12","score":"0.5379555","text":"function detectIE() {\n var ua = window.navigator.userAgent;\n\n var msie = ua.indexOf(\"MSIE \");\n if (msie > 0) {\n return parseInt(ua.substring(msie + 5, ua.indexOf(\".\", msie)), 10);\n }\n\n var trident = ua.indexOf(\"Trident/\");\n if (trident > 0) {\n var rv = ua.indexOf(\"rv:\");\n return parseInt(ua.substring(rv + 3, ua.indexOf(\".\", rv)), 10);\n }\n\n var edge = ua.indexOf(\"Edge/\");\n if (edge > 0) {\n return parseInt(ua.substring(edge + 5, ua.indexOf(\".\", edge)), 10);\n }\n\n return false;\n }","title":""},{"docid":"2c5a31320d4ffe0f8f592ca38ba7e6ea","score":"0.53760356","text":"function detectIE() {\n\t\tvar ua = window.navigator.userAgent;\n\t\tvar msie = ua.indexOf('MSIE ');\n\t\tif (msie > 0) {\n\t\t\t// IE 10 or older => return version number\n\t\t\treturn parseInt(ua.substring(msie + 5, ua.indexOf('.', msie)), 10);\n\t\t}\n\t\tvar trident = ua.indexOf('Trident/');\n\t\tif (trident > 0) {\n\t\t\t// IE 11 => return version number\n\t\t\tvar rv = ua.indexOf('rv:');\n\t\t\treturn parseInt(ua.substring(rv + 3, ua.indexOf('.', rv)), 10);\n\t\t}\n\t\tvar edge = ua.indexOf('Edge/');\n\t\tif (edge > 0) {\n\t\t // IE 12 => return version number\n\t\t return parseInt(ua.substring(edge + 5, ua.indexOf('.', edge)), 10);\n\t\t}\n\t\t// other browser\n\t\treturn false;\n\t}","title":""},{"docid":"fd1ee68a9068da6e769542f9779e1906","score":"0.53739357","text":"function isEDGE(){\n return /Edge\\/\\d./i.test(navigator.userAgent)\n }","title":""},{"docid":"7aeccdc52d02192e5135a752f9a6f6a3","score":"0.53739107","text":"function detectIE() {\n var ua = window.navigator.userAgent;\n\n var msie = ua.indexOf('MSIE ');\n if (msie > 0) {\n return parseInt(ua.substring(msie + 5, ua.indexOf('.', msie)), 10);\n }\n\n var trident = ua.indexOf('Trident/');\n if (trident > 0) {\n var rv = ua.indexOf('rv:');\n return parseInt(ua.substring(rv + 3, ua.indexOf('.', rv)), 10);\n }\n\n var edge = ua.indexOf('Edge/');\n if (edge > 0) {\n return parseInt(ua.substring(edge + 5, ua.indexOf('.', edge)), 10);\n }\n\n return false;\n}","title":""},{"docid":"7aeccdc52d02192e5135a752f9a6f6a3","score":"0.53739107","text":"function detectIE() {\n var ua = window.navigator.userAgent;\n\n var msie = ua.indexOf('MSIE ');\n if (msie > 0) {\n return parseInt(ua.substring(msie + 5, ua.indexOf('.', msie)), 10);\n }\n\n var trident = ua.indexOf('Trident/');\n if (trident > 0) {\n var rv = ua.indexOf('rv:');\n return parseInt(ua.substring(rv + 3, ua.indexOf('.', rv)), 10);\n }\n\n var edge = ua.indexOf('Edge/');\n if (edge > 0) {\n return parseInt(ua.substring(edge + 5, ua.indexOf('.', edge)), 10);\n }\n\n return false;\n}","title":""},{"docid":"21d97a6bb5a3c1f9c6118402b724feef","score":"0.53725725","text":"function clickreturnvalue(){\nif (ie4||ns6) return false\nelse return true\n}","title":""}],"string":"[\n {\n \"docid\": \"152ae9bc1417f8a0e5996a8772fc212a\",\n \"score\": \"0.729394\",\n \"text\": \"function isIE9or8(){\\n\\t\\tvar version = getInternetExplorerVersion();\\n\\t\\treturn(version != -1 && version <= 9 && version >= 7);\\n\\t\\t\\n\\t\\t//return ($.browser.msie && $.browser.version <= 9 && window.XDomainRequest);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dd08fab2832d4c96d6a6496e0eed673\",\n \"score\": \"0.6967555\",\n \"text\": \"get ie9() {\\n return isIE(9);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"677aa9f28e2d8781d3eff09c17b2758d\",\n \"score\": \"0.68580246\",\n \"text\": \"function is_lt_ie9() {\\n\\tie_v = parseFloat(navigator.userAgent.match(/MSIE (\\\\d+\\\\.\\\\d+);/));\\n\\tif(ie_v && ie_v[1] < 9) { return true; } else { return false; };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dcb3a8814057a19f5ff81cc93d020c03\",\n \"score\": \"0.6834211\",\n \"text\": \"function patchMSIE() {\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a44a23db40d5c141279298ea8d160ed\",\n \"score\": \"0.6702816\",\n \"text\": \"function isIE8(){ \\r\\nreturn pDocument.getElementById(\\\"ie8\\\"); \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"608598a1ac132fa128b43743c58c26b6\",\n \"score\": \"0.6689359\",\n \"text\": \"function isIE8() {\\n if (window.attachEvent && !window.addEventListener) {\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9cf1e0ff6440ddc7fd4d7bdb69e88d88\",\n \"score\": \"0.6531783\",\n \"text\": \"function isIE7OrIE8(){\\n\\tvar version = $.browser.version;\\n\\tvar idx7 = version.indexOf(\\\"7.\\\"); //e' = a 0 se la versione e' un 7.x\\n\\tvar idx8 = version.indexOf(\\\"8.\\\"); //e' = a 0 se la versione e' un 8.x\\n\\treturn (idx7 == 0 || idx8 == 0 );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25efbf82b4a0f9660a64b3cd5458c441\",\n \"score\": \"0.6493873\",\n \"text\": \"function nonResIE() {\\n if (navigator.sayswho[0].match('MSIE') && navigator.sayswho[1].substring(0,1) < '9') {\\n return true;\\n }\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba03d852276188c4848f0002b0f34beb\",\n \"score\": \"0.63906777\",\n \"text\": \"function ie() {\\n var ua = window.navigator.userAgent;\\n var msie = ua.indexOf(\\\"MSIE \\\");\\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\\\:11\\\\./)) return true;else return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d02ed54017e9ebd7a3f023529650b8a\",\n \"score\": \"0.6377287\",\n \"text\": \"function iecompattest(){\\nreturn (document.compatMode && document.compatMode!=\\\"BackCompat\\\")? document.documentElement : document.body\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbd752301b41605164bbd54c999408eb\",\n \"score\": \"0.63751185\",\n \"text\": \"function IEFix(){\\n\\tif ($.browser.msie && $.browser.version == 7.0) {\\n\\t\\t$('.b-form-holder select').closest('.b-form-line').find('label').addClass('m-label-for-select');\\n\\t\\t$('.b-btn + .b-btn').addClass('m-ml');\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"753cbb12952f799dc58dad4b0ab33ca0\",\n \"score\": \"0.6229552\",\n \"text\": \"isBrowserIE () {\\n\\t\\treturn !!(document.documentMode && document.documentMode >= 9)\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc917289d55624d8d0e26719c3746f5f\",\n \"score\": \"0.6224928\",\n \"text\": \"function checkIE() {\\n return !(msie > 0);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6849ff8d0b5fa8da51f1ff83462baa6b\",\n \"score\": \"0.62007254\",\n \"text\": \"function PieInIE(){\\n\\tif ($.browser.msie && $.browser.version <= 8.0) {\\n\\t\\t$('.l-header .b-second-bar li.m-logged .b-flyout, .b-pagination li a, .b-contact-us .b-col2 .b-icon, .b-efficacy-chart .b-col, .l-header .b-second-bar li.m-contact-btn a, .b-btn, .b-manufacturing .b-icon').each(function() {\\n\\t\\t\\tPIE.detach(this);\\n\\t\\t\\tPIE.attach(this);\\n\\t\\t});\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09d7f8f2e0258025bc337f58b6e060bd\",\n \"score\": \"0.61332244\",\n \"text\": \"function ___IE_global_fix___() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26d5d01fefa4dda7eb0cfe4ddd1c247b\",\n \"score\": \"0.61118186\",\n \"text\": \"function msieversion() {\\r\\n var ua = window.navigator.userAgent;\\r\\n var msie = ua.indexOf(\\\"MSIE \\\");\\r\\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\\\:11\\\\./)) { \\r\\n var ieVersion = parseInt(ua.substring(msie + 5, ua.indexOf(\\\".\\\", msie)));\\r\\n if (ieVersion === 9) {$('body').addClass('no-js ie' + ieVersion);}\\r\\n return ieVersion;\\r\\n }\\r\\n else { return false; }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50d9c43bdc41b03531c4d330c54b52ab\",\n \"score\": \"0.60704446\",\n \"text\": \"function msieversion() {\\n var ua = window.navigator.userAgent;\\n var msie = ua.indexOf(\\\"MSIE \\\");\\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\\\:11\\\\./)) {\\n var ieVersion = parseInt(ua.substring(msie + 5, ua.indexOf(\\\".\\\", msie)));\\n if (ieVersion === 9) { $('body').addClass('no-js ie' + ieVersion); }\\n return ieVersion;\\n }\\n else { return false; }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c79038479f08e3ca53f72f53cbb1374\",\n \"score\": \"0.6040397\",\n \"text\": \"function isIE() {\\n var myNav = navigator.userAgent.toLowerCase();\\n return (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1]) : false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9410e2686d6ffdd0eda3ce159681b99\",\n \"score\": \"0.6030998\",\n \"text\": \"get ie() {\\n return getInternetExplorerVersion() !== -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33d953755561cb9a70a33186afe84592\",\n \"score\": \"0.60235125\",\n \"text\": \"function isIE () {\\n var myNav = navigator.userAgent.toLowerCase();\\n return (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1]) : false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a014984976011951eb20b05ea6369e0b\",\n \"score\": \"0.60194343\",\n \"text\": \"function isIE () {\\n var myNav = navigator.userAgent.toLowerCase();\\n return (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1], 10) : false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2de515d5010197d6bc4399f0306b6676\",\n \"score\": \"0.600236\",\n \"text\": \"function IsIE() \\r\\n{\\r\\n\\t\\r\\n\\tif (navigator.userAgent.indexOf('MSIE')>-1)\\r\\n\\t\\treturn true;\\r\\n\\telse\\r\\n\\t\\treturn false;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3092d2a36c48eff11df773e2d98a6949\",\n \"score\": \"0.5975352\",\n \"text\": \"function isIE() {\\r\\n\\treturn navigator.appName != \\\"Netscape\\\";\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29b1ebe4670d87e7bd76e7e11c7c011d\",\n \"score\": \"0.5968318\",\n \"text\": \"function isBrowserIE() {\\n\\t if (window.navigator && window.navigator.userAgent) {\\n\\t var ua = window.navigator.userAgent;\\n\\t\\n\\t return ua.indexOf('Trident/7.0') > 0 || ua.indexOf('Trident/6.0') > 0;\\n\\t }\\n\\t\\n\\t return false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb24954dc0abdd76ad67683c9fd4fcd2\",\n \"score\": \"0.5961604\",\n \"text\": \"function msieversion()\\n\\t {\\n\\t var ua = window.navigator.userAgent\\n\\t var msie = ua.indexOf ( \\\"MSIE \\\" )\\n\\n\\t if ( msie > 0 ) { // If Internet Explorer, return version number\\n\\t \\tvar version = parseInt (ua.substring (msie+5, ua.indexOf (\\\".\\\", msie )));\\n\\t \\tif(version <= 8){\\n\\t \\t$('html').addClass(\\\"lt-ie9\\\");\\n\\t \\t$('#FINRA_header, #FINRA_footer, #FINRA_responsive').css('font-size', '14px').addClass(\\\"finra_normalize_prefix\\\");\\n\\t \\t$('#FINRA_header').append('<link rel=\\\"stylesheet\\\" href=\\\"/finra-theme.no-query.css\\\"/>');\\n\\n\\n\\t \\t}\\n\\t return parseInt (ua.substring (msie+5, ua.indexOf (\\\".\\\", msie )))\\n\\t }\\n\\t else // If another browser, return 0\\n\\t return 0\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9239d6f259aadef0c521f4ddbca688d\",\n \"score\": \"0.59483665\",\n \"text\": \"function isIE() {\\r\\n var ua = window.navigator.userAgent;\\r\\n var msie = ua.indexOf(\\\"MSIE \\\");\\r\\n\\r\\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\\\:11\\\\./)) {\\r\\n return true;\\r\\n }\\r\\n\\r\\n return false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d04d1871b31da43327f469c8f88e2adc\",\n \"score\": \"0.5943452\",\n \"text\": \"function isIE() {\\n var myNav = navigator.userAgent.toLowerCase();\\n return myNav.indexOf(\\\"msie\\\") != -1\\n ? parseInt(myNav.split(\\\"msie\\\")[1], 10)\\n : false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb1a0b72f1a2913f1c1c6653469cd6b8\",\n \"score\": \"0.59195244\",\n \"text\": \"function NiftyCheck()\\n{\\nif(!document.getElementById || !document.createElement)\\n return(false);\\nvar b=navigator.userAgent.toLowerCase();\\nif(b.indexOf(\\\"msie 5\\\")>0 && b.indexOf(\\\"opera\\\")==-1)\\n return(false);\\nreturn(true);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7327f0058987c3387dced049bbc545\",\n \"score\": \"0.58856195\",\n \"text\": \"function isIE() {\\n\\t\\treturn typeof attachEvent !== \\\"undefined\\\" && typeof addEventListener === \\\"undefined\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7327f0058987c3387dced049bbc545\",\n \"score\": \"0.58856195\",\n \"text\": \"function isIE() {\\n\\t\\treturn typeof attachEvent !== \\\"undefined\\\" && typeof addEventListener === \\\"undefined\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7327f0058987c3387dced049bbc545\",\n \"score\": \"0.58856195\",\n \"text\": \"function isIE() {\\n\\t\\treturn typeof attachEvent !== \\\"undefined\\\" && typeof addEventListener === \\\"undefined\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7327f0058987c3387dced049bbc545\",\n \"score\": \"0.58856195\",\n \"text\": \"function isIE() {\\n\\t\\treturn typeof attachEvent !== \\\"undefined\\\" && typeof addEventListener === \\\"undefined\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7327f0058987c3387dced049bbc545\",\n \"score\": \"0.58856195\",\n \"text\": \"function isIE() {\\n\\t\\treturn typeof attachEvent !== \\\"undefined\\\" && typeof addEventListener === \\\"undefined\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7327f0058987c3387dced049bbc545\",\n \"score\": \"0.58856195\",\n \"text\": \"function isIE() {\\n\\t\\treturn typeof attachEvent !== \\\"undefined\\\" && typeof addEventListener === \\\"undefined\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7327f0058987c3387dced049bbc545\",\n \"score\": \"0.58856195\",\n \"text\": \"function isIE() {\\n\\t\\treturn typeof attachEvent !== \\\"undefined\\\" && typeof addEventListener === \\\"undefined\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7327f0058987c3387dced049bbc545\",\n \"score\": \"0.58856195\",\n \"text\": \"function isIE() {\\n\\t\\treturn typeof attachEvent !== \\\"undefined\\\" && typeof addEventListener === \\\"undefined\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7327f0058987c3387dced049bbc545\",\n \"score\": \"0.58856195\",\n \"text\": \"function isIE() {\\n\\t\\treturn typeof attachEvent !== \\\"undefined\\\" && typeof addEventListener === \\\"undefined\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7327f0058987c3387dced049bbc545\",\n \"score\": \"0.58856195\",\n \"text\": \"function isIE() {\\n\\t\\treturn typeof attachEvent !== \\\"undefined\\\" && typeof addEventListener === \\\"undefined\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7327f0058987c3387dced049bbc545\",\n \"score\": \"0.58856195\",\n \"text\": \"function isIE() {\\n\\t\\treturn typeof attachEvent !== \\\"undefined\\\" && typeof addEventListener === \\\"undefined\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f7ceb5423adace2c2fb5dc072682be4\",\n \"score\": \"0.5870658\",\n \"text\": \"function isIE( version ) {\\n return getInternetExplorerVersion() === version;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c73b0cd17e3bfbb0b986e34e36069a3\",\n \"score\": \"0.5861358\",\n \"text\": \"function isIE() {\\n var ua = window.navigator.userAgent;\\n // MSIE: ie <= 10, Trident: ie 11+\\n return ua.indexOf('Trident/') > 0 || ua.indexOf('MSIE ') > 0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf2ab5f24e2a7e57a507764681586836\",\n \"score\": \"0.58583283\",\n \"text\": \"function ieVersion() {\\n if (navigator.appName == \\\"Microsoft Internet Explorer\\\") {\\n if (navigator.appVersion.indexOf(\\\"MSIE 8.0\\\") > 0) { return 8; }\\n else if (navigator.appVersion.indexOf(\\\"MSIE 7.0\\\") > 0) { return 7; }\\n else if (navigator.appVersion.indexOf(\\\"MSIE 6.0\\\") > 0) { return 6; }\\n } else { return 8; }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad9642597dc9685a00dfe297a2a9728c\",\n \"score\": \"0.582267\",\n \"text\": \"function lessThanIE9(element) {\\n\\t\\t\\tvar fileName = element.val().split(/\\\\\\\\/).pop();\\n\\n\\t\\t\\tif (!fileName == '') {\\n\\n\\t\\t\\t\\tvar fileExtension = fileName.split('.').pop().toLowerCase(),\\n\\t\\t\\t\\t\\textensions = element.data('extensions'),\\n\\t\\t\\t\\t\\tparent = element.parent(),\\n\\t\\t\\t\\t\\tuploadFeedback = parent.find('.customfile-feedback'),\\n\\t\\t\\t\\t\\tuploadButton = parent.find('.customfile-button'),\\n\\t\\t\\t\\t\\tprogressionBar = parent.find('.customfile-progress'),\\n\\t\\t\\t\\t\\tfileExtClass = 'customfile-ext-' + fileExtension;\\n\\n\\t\\t\\t\\tvar validExtension = fileExtValidation(extensions, [fileExtension]);\\n\\n\\t\\t\\t\\tif (validExtension) {\\n\\t\\t\\t\\t\\tuploadFeedback.text(fileName);\\n\\n\\t\\t\\t\\t\\tdidValidate(uploadFeedback, uploadButton, fileExtClass);\\n\\n\\t\\t\\t\\t} else {\\n\\n\\t\\t\\t\\t\\tdidNotValidate(element, uploadFeedback, uploadButton);\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41f3ebd066dd18bb9fb4b86629e624ba\",\n \"score\": \"0.58156276\",\n \"text\": \"function isIE() {\\n\\t//Create var for userAgent\\n\\tuserAg = navigator.userAgent;\\n\\t//Create var to store return of index of strings\\n\\tvar is_ie = userAg.indexOf(\\\"MSIE \\\") > -1 || userAg.indexOf(\\\"Trident/\\\") > -1 || userAg.indexOf(\\\"Edge\\\") > -1;\\n\\t//return result\\n\\treturn is_ie;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04c8c833b9afa91a2a8bcf2ac808f816\",\n \"score\": \"0.5814825\",\n \"text\": \"function isIE() {\\n var ua = navigator.userAgent;\\n var is_ie = ua.indexOf(\\\"MSIE \\\") > -1 || ua.indexOf(\\\"Trident/\\\") > -1;\\n\\n return is_ie;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9a8aad3e3d5a93c5af27f54faaf00b3\",\n \"score\": \"0.58119226\",\n \"text\": \"function isExplorer()\\n{\\n var ua = window.navigator.userAgent;\\n var msie = ua.indexOf(\\\"MSIE\\\");\\n\\n if (msie > 0)\\n {\\n return true;\\n }\\n else\\n {\\n return false;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42b7710376ff578f010789cec5b0ccd7\",\n \"score\": \"0.5795958\",\n \"text\": \"static isIEorEdge() {\\n return LuxUtil.isIE() || LuxUtil.isEdge();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be4ccfd0f0e7c8a803d6cbf9cc69516a\",\n \"score\": \"0.5771936\",\n \"text\": \"function initFixCompatibility() {\\n (0, _ie11helper2.default)();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9acc93f0e5fe31e6a38eba9b140bbf73\",\n \"score\": \"0.57718396\",\n \"text\": \"function is_ie() {\\n\\n var ua = window.navigator.userAgent;\\n var msie = ua.indexOf(\\\"MSIE \\\");\\n\\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\\\:11\\\\./)) {\\n return true;\\n }\\n else {\\n return false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ab0de16ce268c57251ff718a4cfb48c\",\n \"score\": \"0.5770083\",\n \"text\": \"static isIE() {\\n const msie = window.document['documentMode'];\\n return msie && msie <= 11;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a74be172f66219ea5d2ab71293d7a08\",\n \"score\": \"0.57423097\",\n \"text\": \"function isSupported()\\r\\n{\\r\\n\\treturn (isIE || isMoz);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24fc3c7cd9f06636ca3e46b194e8acdd\",\n \"score\": \"0.57413286\",\n \"text\": \"function InitBrowserSettings() {\\n if (/msie/.test(navigator.userAgent.toLowerCase())) { // Identify browser for IE9-IE10.\\n document.onselectstart = function () { return false; };\\n } else if (!!window.ActiveXObject || \\\"ActiveXObject\\\" in window) { // Identify browser for IE11.\\n document.onselectstart = function () { return false; };\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"657a6ea60bbb7557ee3502a1a6327a54\",\n \"score\": \"0.57395566\",\n \"text\": \"function isIE() {\\n var ua = window.navigator.userAgent; //Check the userAgent property of the window.navigator object\\n var msie = ua.indexOf('MSIE '); // IE 10 or older\\n var trident = ua.indexOf('Trident/'); //IE 11\\n\\n return (msie > 0 || trident > 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2211943686f3e395bbdbf68cbe3b3e6a\",\n \"score\": \"0.5718534\",\n \"text\": \"function isInternetExplorer() {\\n\\t if (typeof navigator === 'undefined') {\\n\\t return false;\\n\\t }\\n\\t\\n\\t var rv = -1; // Return value assumes failure.\\n\\t var ua = navigator.userAgent;\\n\\t if (navigator.appName === 'Microsoft Internet Explorer') {\\n\\t var re = new RegExp(\\\"MSIE ([0-9]{1,}[\\\\.0-9]{0,})\\\");\\n\\t if (re.exec(ua) != null)\\n\\t rv = parseFloat(RegExp.$1);\\n\\t }\\n\\t // IE > 11\\n\\t else if (ua.indexOf(\\\"Trident\\\") > -1) {\\n\\t var re = new RegExp(\\\"rv:([0-9]{2,2}[\\\\.0-9]{0,})\\\");\\n\\t if (re.exec(ua) !== null) {\\n\\t rv = parseFloat(RegExp.$1);\\n\\t }\\n\\t }\\n\\t\\n\\t return rv >= 8;\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01725ab9ec4ee5ba2b6bf5dfb1602333\",\n \"score\": \"0.56781083\",\n \"text\": \"function isIE(version) {\\n return getInternetExplorerVersion() === version;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b205e0308ebe3bc711b997bbdbbeeff\",\n \"score\": \"0.5676731\",\n \"text\": \"function isInternetExplorer() {\\n\\t var rv = -1; // Return value assumes failure.\\n\\t var ua = navigator.userAgent;\\n\\t if (navigator.appName === 'Microsoft Internet Explorer') {\\n\\t var re = new RegExp(\\\"MSIE ([0-9]{1,}[\\\\.0-9]{0,})\\\");\\n\\t if (re.exec(ua) != null)\\n\\t rv = parseFloat(RegExp.$1);\\n\\t }\\n\\t // IE > 11\\n\\t else if (ua.indexOf(\\\"Trident\\\") > -1) {\\n\\t var re = new RegExp(\\\"rv:([0-9]{2,2}[\\\\.0-9]{0,})\\\");\\n\\t if (re.exec(ua) !== null) {\\n\\t rv = parseFloat(RegExp.$1);\\n\\t }\\n\\t }\\n\\t\\n\\t return rv >= 8;\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5aab2c26dbe38c15780440b11bb307eb\",\n \"score\": \"0.5670071\",\n \"text\": \"function msieversion() {\\n\\n var ua = window.navigator.userAgent;\\n var msie = ua.indexOf(\\\"MSIE \\\");\\n\\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\\\:11\\\\./)) {\\n //alert(parseInt(ua.substring(msie + 5, ua.indexOf(\\\".\\\", msie))));\\n var retval = 1;\\n }\\n else {\\n retval = '';\\n }\\n\\n return retval;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58c5f7c8eb1ee55df0626b4ac0029b0f\",\n \"score\": \"0.5661578\",\n \"text\": \"function isIe() {\\n\\tvar ie\\n\\tif(typeof(Promise)==='undefined') {\\n\\t\\tie = true\\n\\t} else {\\n\\t\\tie = false\\n\\t}\\n\\treturn ie;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"861233e9096a869ea272a865a2ee513a\",\n \"score\": \"0.56463116\",\n \"text\": \"function isIE () {\\n // Check if IE/Edge using 'console.log(navigator.userAgent.toLowerCase())'\\n return (ua.indexOf('msie') != -1 || ua.indexOf('trident') != -1 || ua.indexOf('edge') != -1) ? true : false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51f57acd5162a848e53a734e05384443\",\n \"score\": \"0.5638144\",\n \"text\": \"function mlib_is_ie() {\\n var myNav = navigator.userAgent.toLowerCase();\\n return (myNav.indexOf('msie') != -1) ? parseInt(myNav.split('msie')[1]) : 1000;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db5137322cea48e852374ca3c11a76da\",\n \"score\": \"0.5637232\",\n \"text\": \"function ietruebody(){\\nreturn (document.compatMode && document.compatMode!=\\\"BackCompat\\\")? document.documentElement : document.body\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4545d33b89fb0d7548b12e583c5412fc\",\n \"score\": \"0.5604213\",\n \"text\": \"function IsInternetExplorer () {\\n var ua = window.navigator.userAgent;\\n var msie = ua.indexOf(\\\"MSIE \\\");\\n\\n if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\\\\:11\\\\./)) { // If Internet Explorer, return true\\n return true;\\n } else { // If another browser, return false\\n return false;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"053dc7d1eca8ef5d81348c783f9b73c4\",\n \"score\": \"0.559814\",\n \"text\": \"function isInternetExplorer() {\\n var rv = -1; // Return value assumes failure.\\n var ua = navigator.userAgent;\\n if (navigator.appName === 'Microsoft Internet Explorer') {\\n var re = new RegExp(\\\"MSIE ([0-9]{1,}[\\\\.0-9]{0,})\\\");\\n if (re.exec(ua) != null)\\n rv = parseFloat(RegExp.$1);\\n }\\n // IE > 11\\n else if (ua.indexOf(\\\"Trident\\\") > -1) {\\n var re = new RegExp(\\\"rv:([0-9]{2,2}[\\\\.0-9]{0,})\\\");\\n if (re.exec(ua) !== null) {\\n rv = parseFloat(RegExp.$1);\\n }\\n }\\n\\n return rv >= 8;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d71e3e2e2b344ea1ee7d8b8a6d278526\",\n \"score\": \"0.55922335\",\n \"text\": \"function isIE( version, comparison ){\\r\\n\\t\\t var $div = jQuery('<div style=\\\"display:none;\\\"/>').appendTo(jQuery('body'));\\r\\n\\t\\t $div.html('<!--[if '+(comparison||'')+' IE '+(version||'')+']><a> </a><![endif]-->');\\r\\n\\t\\t var ieTest = $div.find('a').length;\\r\\n\\t\\t $div.remove();\\r\\n\\t\\t return ieTest;\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50b2fc686474841757f9c16b490114cb\",\n \"score\": \"0.55850303\",\n \"text\": \"function isIE6() {\\n return /msie|MSIE 6/.test(navigator.userAgent);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f67218fe3342bce87d859f4f65d8eb1\",\n \"score\": \"0.55803746\",\n \"text\": \"function isInternetExplorer() {\\n if (typeof navigator === 'undefined') {\\n return false;\\n }\\n\\n var rv = -1; // Return value assumes failure.\\n var ua = navigator.userAgent;\\n if (navigator.appName === 'Microsoft Internet Explorer') {\\n var re = new RegExp(\\\"MSIE ([0-9]{1,}[\\\\.0-9]{0,})\\\");\\n if (re.exec(ua) != null)\\n rv = parseFloat(RegExp.$1);\\n }\\n // IE > 11\\n else if (ua.indexOf(\\\"Trident\\\") > -1) {\\n var re = new RegExp(\\\"rv:([0-9]{2,2}[\\\\.0-9]{0,})\\\");\\n if (re.exec(ua) !== null) {\\n rv = parseFloat(RegExp.$1);\\n }\\n }\\n\\n return rv >= 8;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f67218fe3342bce87d859f4f65d8eb1\",\n \"score\": \"0.55803746\",\n \"text\": \"function isInternetExplorer() {\\n if (typeof navigator === 'undefined') {\\n return false;\\n }\\n\\n var rv = -1; // Return value assumes failure.\\n var ua = navigator.userAgent;\\n if (navigator.appName === 'Microsoft Internet Explorer') {\\n var re = new RegExp(\\\"MSIE ([0-9]{1,}[\\\\.0-9]{0,})\\\");\\n if (re.exec(ua) != null)\\n rv = parseFloat(RegExp.$1);\\n }\\n // IE > 11\\n else if (ua.indexOf(\\\"Trident\\\") > -1) {\\n var re = new RegExp(\\\"rv:([0-9]{2,2}[\\\\.0-9]{0,})\\\");\\n if (re.exec(ua) !== null) {\\n rv = parseFloat(RegExp.$1);\\n }\\n }\\n\\n return rv >= 8;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31bc7ebcb86e0cd2ccec0c2b44b31205\",\n \"score\": \"0.5579846\",\n \"text\": \"function isIE() {\\n\\t\\tvar isNetscape = navigator.appName == 'Netscape';\\n\\t\\tvar isTrident = new RegExp(\\\"Trident/.*rv:([0-9]{1,}[\\\\.0-9]{0,})\\\").exec(navigator.userAgent) != null;\\n\\t\\treturn ((navigator.appName == 'Microsoft Internet Explorer') || (isNetscape && isTrident));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2df7d3feaf9f39033ea743d6656cc76f\",\n \"score\": \"0.55766374\",\n \"text\": \"function isIE() {\\n ua = navigator.userAgent;\\n\\n /* MSIE used to detect old browsers and Trident used to newer ones*/\\n var is_ie = ua.indexOf(\\\"MSIE \\\") > -1 || ua.indexOf(\\\"Trident/\\\") > -1;\\n\\n return is_ie;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efbea42f85f2fbfff6c2769a38fe1561\",\n \"score\": \"0.55621237\",\n \"text\": \"function isIE() {\\n for (var v = 3, el = document.createElement('b'), all = el.all || []; el.innerHTML = '<!--[if gt IE ' + (++v) + ']><i><![endif]-->', all[0];);\\n return v > 4 ? v : !!document.documentMode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"402448850a7d2c521880e5e1652fec8c\",\n \"score\": \"0.55601966\",\n \"text\": \"function isIE6() {\\n\\t\\treturn $.browser.msie && /msie 6\\\\.0/i.test(navigator.userAgent);\\n\\t} // isIE6\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c30af8e2c39febb0774b3a657919d00b\",\n \"score\": \"0.5559786\",\n \"text\": \"function isIe()\\n// Returns the version of Windows Internet Explorer or a -1\\n// (indicating the use of another browser).\\n{\\n\\tvar rv = -1; // Return value assumes failure.\\n\\tif (navigator.appName == 'Microsoft Internet Explorer') { return true; }\\n\\treturn false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3bf1787b441762dfdcf724f4d657bc35\",\n \"score\": \"0.555916\",\n \"text\": \"function browserCheck(){\\n\\t\\tif(Globals.s.isIE === false || Globals.s.ieVersion >= 10){\\n\\t\\t\\ts.browserOk = true;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\ts.browserOk = false;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00041206bfa21b850274241be03f085b\",\n \"score\": \"0.5547592\",\n \"text\": \"function fixIeBug(string) {\\n\\t\\t\\t\\tif ($.browser.msie) {\\n\\t\\t\\t\\t\\treturn string.length - string.replace(/\\\\r/g, '').length;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee6d3913e9735540272a2ab053617422\",\n \"score\": \"0.5533861\",\n \"text\": \"function isIE( version, comparison ){\\n\\t\\t var $div = jQuery('<div style=\\\"display:none;\\\"/>').appendTo(jQuery('body'));\\n\\t\\t $div.html('<!--[if '+(comparison||'')+' IE '+(version||'')+']><a> </a><![endif]-->');\\n\\t\\t var ieTest = $div.find('a').length;\\n\\t\\t $div.remove();\\n\\t\\t return ieTest;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19dfb02b2f0f4874072568075cb15de9\",\n \"score\": \"0.5518443\",\n \"text\": \"function usingIE() {\\n return navigator.appVersion.match(/\\\\.NET/i) !== null;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"587bf33a052b2e3174a3381e381d768a\",\n \"score\": \"0.55045223\",\n \"text\": \"function fixIeBug(string) {\\n\\t\\t\\t\\tif (browser.msie) {\\n\\t\\t\\t\\t\\treturn string.length - string.replace(/\\\\r*/g, '').length;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2635793ca2c5a6bf1a718134cadf50b5\",\n \"score\": \"0.55023104\",\n \"text\": \"function fixIeBug(string) {\\n\\t\\t\\t\\tif ($.browser.msie) {\\n\\t\\t\\t\\t\\treturn string.length - string.replace(/\\\\r*/g, '').length;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f7e348aa5857c63259f6972bab6c358\",\n \"score\": \"0.54956174\",\n \"text\": \"function ie8SafePreventEvent(event) \\n{\\n (event.preventDefault) ? event.preventDefault() : event.returnValue = false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31a61fd07a4ea33776983c2afc69f2c9\",\n \"score\": \"0.5464117\",\n \"text\": \"function isIE() {\\n var s = navigator.userAgent.toLowerCase();\\n console.log(s);\\n //ie10 information:\\n //mozilla/5.0 (compatible; msie 10.0; windows nt 6.2; trident/6.0)\\n //ie11 information:\\n //mozilla/5.0 (windows nt 6.1; trident/7.0; slcc2; .net clr 2.0.50727; .net clr 3.5.30729; .net clr 3.0.30729; media center pc 6.0; .net4.0c; .net4.0e; infopath.2; rv:11.0) like gecko\\n var ie = s.match(/rv:([\\\\d.]+)/) || s.match(/msie ([\\\\d.]+)/);\\n if (ie) {\\n return ie[1];\\n } else {\\n return -1;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"076c31708531353861783e21ab61ee80\",\n \"score\": \"0.54590315\",\n \"text\": \"function ieFixes(override){\\r\\n\\t\\tvar ieClass = 'ie-';\\r\\n\\t\\tif(s.ieVersion === 99){\\r\\n\\t\\t\\tieClass+='11+';\\r\\n\\t\\t}\\r\\n\\t\\telse if(s.ieVersion < 9){\\r\\n\\t\\t\\tieClass+='old';\\r\\n\\t\\t}\\r\\n\\t\\telse{\\r\\n\\t\\t\\tieClass+=s.ieVersion;\\r\\n\\t\\t}\\r\\n\\t\\t$('html').addClass(ieClass);\\r\\n\\t\\t\\r\\n\\r\\n\\t\\t/**********************************\\r\\n\\t\\tFix for IE9's css selector limit\\r\\n\\r\\n\\t\\tInfo\\r\\n\\t\\t\\tIE9 has a per-file css selector limit of 4096. To deal with this, grunt makes a copy of the wc-styles.css file\\r\\n\\t\\t\\tand breaks it into chunks that are smaller than that. Then we use this JS to link to those files in the \\r\\n\\t\\t\\thead if the browser is IE9 or below.\\r\\n\\r\\n\\t\\tNotes\\r\\n\\t\\t[1]\\t\\tIf we ever need more files than 2 *shudder*, update this array with the new file names. \\r\\n\\t\\t[2] \\tFirst check to see if the split CSS files are there\\r\\n\\t\\t[3] \\t...if they are then remove the original css file\\r\\n\\t\\t[4] \\t...and add the new ones.\\r\\n\\t\\t**********************************/\\r\\n\\t\\tif (s.ieVersion < 10 || override === true){\\r\\n\\t\\t\\tvar ieCSSFiles = [\\r\\n\\t\\t\\t\\t'wc-style_part_1.css',/*[1]*/\\r\\n\\t\\t\\t\\t'wc-style_part_2.css'\\r\\n\\t\\t\\t];\\r\\n\\t\\t\\tcheckUrl(s.cssFolderPath + ieCSSFiles[1], function(m){/*[2]*/\\r\\n\\t\\t\\t\\tif(m === 'success'){\\r\\n\\t\\t\\t\\t\\t$(mainCSSLink).remove(); /*[3]*/\\r\\n\\t\\t\\t\\t\\tfor (var i = 0; i < ieCSSFiles.length; i++) {/*[4]*/\\r\\n\\t\\t\\t\\t\\t\\tvar path \\t= s.cssFolderPath + ieCSSFiles[i];\\r\\n\\t\\t\\t\\t\\t\\tvar link \\t= document.createElement('link');\\r\\n\\t\\t\\t\\t\\t\\tlink.rel \\t= 'stylesheet';\\r\\n\\t\\t\\t\\t\\t\\tlink.type \\t= 'text/css';\\r\\n\\t\\t\\t\\t\\t\\tlink.href \\t= path;\\r\\n\\t\\t\\t\\t\\t\\tlink.media \\t= 'all';\\r\\n\\t\\t\\t\\t\\t\\tdocument.getElementsByTagName('head')[0].appendChild(link);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t});\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"076c31708531353861783e21ab61ee80\",\n \"score\": \"0.54590315\",\n \"text\": \"function ieFixes(override){\\r\\n\\t\\tvar ieClass = 'ie-';\\r\\n\\t\\tif(s.ieVersion === 99){\\r\\n\\t\\t\\tieClass+='11+';\\r\\n\\t\\t}\\r\\n\\t\\telse if(s.ieVersion < 9){\\r\\n\\t\\t\\tieClass+='old';\\r\\n\\t\\t}\\r\\n\\t\\telse{\\r\\n\\t\\t\\tieClass+=s.ieVersion;\\r\\n\\t\\t}\\r\\n\\t\\t$('html').addClass(ieClass);\\r\\n\\t\\t\\r\\n\\r\\n\\t\\t/**********************************\\r\\n\\t\\tFix for IE9's css selector limit\\r\\n\\r\\n\\t\\tInfo\\r\\n\\t\\t\\tIE9 has a per-file css selector limit of 4096. To deal with this, grunt makes a copy of the wc-styles.css file\\r\\n\\t\\t\\tand breaks it into chunks that are smaller than that. Then we use this JS to link to those files in the \\r\\n\\t\\t\\thead if the browser is IE9 or below.\\r\\n\\r\\n\\t\\tNotes\\r\\n\\t\\t[1]\\t\\tIf we ever need more files than 2 *shudder*, update this array with the new file names. \\r\\n\\t\\t[2] \\tFirst check to see if the split CSS files are there\\r\\n\\t\\t[3] \\t...if they are then remove the original css file\\r\\n\\t\\t[4] \\t...and add the new ones.\\r\\n\\t\\t**********************************/\\r\\n\\t\\tif (s.ieVersion < 10 || override === true){\\r\\n\\t\\t\\tvar ieCSSFiles = [\\r\\n\\t\\t\\t\\t'wc-style_part_1.css',/*[1]*/\\r\\n\\t\\t\\t\\t'wc-style_part_2.css'\\r\\n\\t\\t\\t];\\r\\n\\t\\t\\tcheckUrl(s.cssFolderPath + ieCSSFiles[1], function(m){/*[2]*/\\r\\n\\t\\t\\t\\tif(m === 'success'){\\r\\n\\t\\t\\t\\t\\t$(mainCSSLink).remove(); /*[3]*/\\r\\n\\t\\t\\t\\t\\tfor (var i = 0; i < ieCSSFiles.length; i++) {/*[4]*/\\r\\n\\t\\t\\t\\t\\t\\tvar path \\t= s.cssFolderPath + ieCSSFiles[i];\\r\\n\\t\\t\\t\\t\\t\\tvar link \\t= document.createElement('link');\\r\\n\\t\\t\\t\\t\\t\\tlink.rel \\t= 'stylesheet';\\r\\n\\t\\t\\t\\t\\t\\tlink.type \\t= 'text/css';\\r\\n\\t\\t\\t\\t\\t\\tlink.href \\t= path;\\r\\n\\t\\t\\t\\t\\t\\tlink.media \\t= 'all';\\r\\n\\t\\t\\t\\t\\t\\tdocument.getElementsByTagName('head')[0].appendChild(link);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t});\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"001b16ca1efd64c8cf0d7bad88c83e2d\",\n \"score\": \"0.54462504\",\n \"text\": \"function ieimgposition(nextsh,opt) {\\r\\n\\r\\n\\t\\t\\tif (isIE(8)) {\\r\\n\\t\\t\\t\\t\\tvar ie8img = nextsh.find('.ieeightfallbackimage');\\r\\n\\t\\t\\t\\t\\tif (opt.startwidth/opt.startheight <nextsh.data('owidth')/nextsh.data('oheight'))\\r\\n\\t\\t\\t\\t\\t\\tie8img.css({width:\\\"auto\\\",height:\\\"100%\\\"})\\r\\n\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\tie8img.css({width:\\\"100%\\\",height:\\\"auto\\\"})\\r\\n\\r\\n\\r\\n\\r\\n\\t\\t\\t\\t\\tvar ie8w = ie8img.width(),\\r\\n\\t\\t\\t\\t\\t ie8h = ie8img.height();\\r\\n\\r\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"center center\\\")\\r\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",top:opt.height/2 - ie8h/2+\\\"px\\\", left:opt.width/2-ie8w/2+\\\"px\\\"});\\r\\n\\r\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"center top\\\" || nextsh.data('bgposition')==\\\"top center\\\")\\r\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",top:\\\"0px\\\", left:opt.width/2-ie8w/2+\\\"px\\\"});\\r\\n\\r\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"center bottom\\\" || nextsh.data('bgposition')==\\\"bottom center\\\")\\r\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",bottom:\\\"0px\\\", left:opt.width/2-ie8w/2+\\\"px\\\"});\\r\\n\\r\\n\\r\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"right top\\\" || nextsh.data('bgposition')==\\\"top right\\\")\\r\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",top:\\\"0px\\\", right:\\\"0px\\\"});\\r\\n\\r\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"right bottom\\\" || nextsh.data('bgposition')==\\\"bottom right\\\")\\r\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",bottom:\\\"0px\\\", right:\\\"0px\\\"});\\r\\n\\r\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"right center\\\" || nextsh.data('bgposition')==\\\"center right\\\")\\r\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",top:opt.height/2 - ie8h/2+\\\"px\\\", right:\\\"0px\\\"});\\r\\n\\r\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"left bottom\\\" || nextsh.data('bgposition')==\\\"bottom left\\\")\\r\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",bottom:\\\"0px\\\", left:\\\"0px\\\"});\\r\\n\\r\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"left center\\\" || nextsh.data('bgposition')==\\\"center left\\\")\\r\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",top:opt.height/2 - ie8h/2+\\\"px\\\", left:\\\"0px\\\"});\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71c44777b5ca40c1205387e13fef4cf0\",\n \"score\": \"0.54429466\",\n \"text\": \"function ieimgposition(nextsh,opt) {\\n\\n\\t\\t\\tif (isIE(8)) {\\n\\t\\t\\t\\t\\tvar ie8img = nextsh.find('.ieeightfallbackimage');\\n\\t\\t\\t\\t\\tif (opt.startwidth/opt.startheight <nextsh.data('owidth')/nextsh.data('oheight'))\\n\\t\\t\\t\\t\\t\\tie8img.css({width:\\\"auto\\\",height:\\\"100%\\\"})\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tie8img.css({width:\\\"100%\\\",height:\\\"auto\\\"})\\n\\n\\n\\n\\t\\t\\t\\t\\tvar ie8w = ie8img.width(),\\n\\t\\t\\t\\t\\t ie8h = ie8img.height();\\n\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"center center\\\")\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",top:opt.height/2 - ie8h/2+\\\"px\\\", left:opt.width/2-ie8w/2+\\\"px\\\"});\\n\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"center top\\\" || nextsh.data('bgposition')==\\\"top center\\\")\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",top:\\\"0px\\\", left:opt.width/2-ie8w/2+\\\"px\\\"});\\n\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"center bottom\\\" || nextsh.data('bgposition')==\\\"bottom center\\\")\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",bottom:\\\"0px\\\", left:opt.width/2-ie8w/2+\\\"px\\\"});\\n\\n\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"right top\\\" || nextsh.data('bgposition')==\\\"top right\\\")\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",top:\\\"0px\\\", right:\\\"0px\\\"});\\n\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"right bottom\\\" || nextsh.data('bgposition')==\\\"bottom right\\\")\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",bottom:\\\"0px\\\", right:\\\"0px\\\"});\\n\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"right center\\\" || nextsh.data('bgposition')==\\\"center right\\\")\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",top:opt.height/2 - ie8h/2+\\\"px\\\", right:\\\"0px\\\"});\\n\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"left bottom\\\" || nextsh.data('bgposition')==\\\"bottom left\\\")\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",bottom:\\\"0px\\\", left:\\\"0px\\\"});\\n\\n\\t\\t\\t\\t\\tif (nextsh.data('bgposition')==\\\"left center\\\" || nextsh.data('bgposition')==\\\"center left\\\")\\n\\t\\t\\t\\t\\t\\tie8img.css({position:\\\"absolute\\\",top:opt.height/2 - ie8h/2+\\\"px\\\", left:\\\"0px\\\"});\\n\\t\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c23bad8cd0d447bb2c9ec763dbd1dd1\",\n \"score\": \"0.5429612\",\n \"text\": \"function ieimgposition(nextsh,opt) {\\n\\n if (isIE(8)) {\\n var ie8img = nextsh.find('.ieeightfallbackimage');\\n if (opt.startwidth/opt.startheight <nextsh.data('owidth')/nextsh.data('oheight'))\\n ie8img.css({width:\\\"auto\\\",height:\\\"100%\\\"})\\n else\\n ie8img.css({width:\\\"100%\\\",height:\\\"auto\\\"})\\n\\n\\n\\n var ie8w = ie8img.width(),\\n ie8h = ie8img.height();\\n\\n if (nextsh.data('bgposition')==\\\"center center\\\")\\n ie8img.css({position:\\\"absolute\\\",top:opt.height/2 - ie8h/2+\\\"px\\\", left:opt.width/2-ie8w/2+\\\"px\\\"});\\n\\n if (nextsh.data('bgposition')==\\\"center top\\\" || nextsh.data('bgposition')==\\\"top center\\\")\\n ie8img.css({position:\\\"absolute\\\",top:\\\"0px\\\", left:opt.width/2-ie8w/2+\\\"px\\\"});\\n\\n if (nextsh.data('bgposition')==\\\"center bottom\\\" || nextsh.data('bgposition')==\\\"bottom center\\\")\\n ie8img.css({position:\\\"absolute\\\",bottom:\\\"0px\\\", left:opt.width/2-ie8w/2+\\\"px\\\"});\\n\\n\\n if (nextsh.data('bgposition')==\\\"right top\\\" || nextsh.data('bgposition')==\\\"top right\\\")\\n ie8img.css({position:\\\"absolute\\\",top:\\\"0px\\\", right:\\\"0px\\\"});\\n\\n if (nextsh.data('bgposition')==\\\"right bottom\\\" || nextsh.data('bgposition')==\\\"bottom right\\\")\\n ie8img.css({position:\\\"absolute\\\",bottom:\\\"0px\\\", right:\\\"0px\\\"});\\n\\n if (nextsh.data('bgposition')==\\\"right center\\\" || nextsh.data('bgposition')==\\\"center right\\\")\\n ie8img.css({position:\\\"absolute\\\",top:opt.height/2 - ie8h/2+\\\"px\\\", right:\\\"0px\\\"});\\n\\n if (nextsh.data('bgposition')==\\\"left bottom\\\" || nextsh.data('bgposition')==\\\"bottom left\\\")\\n ie8img.css({position:\\\"absolute\\\",bottom:\\\"0px\\\", left:\\\"0px\\\"});\\n\\n if (nextsh.data('bgposition')==\\\"left center\\\" || nextsh.data('bgposition')==\\\"center left\\\")\\n ie8img.css({position:\\\"absolute\\\",top:opt.height/2 - ie8h/2+\\\"px\\\", left:\\\"0px\\\"});\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d314f840e0381e31cb5dfe1d305d5f76\",\n \"score\": \"0.5418099\",\n \"text\": \"function browserDetect(){\\r\\n\\t\\tvar ua = window.navigator.userAgent;\\r\\n\\t\\ts.isFirefox = ua.toLowerCase().indexOf('firefox') > -1; /*[1]*/\\r\\n\\t\\tif (s.isFirefox){\\r\\n\\t\\t\\t$('html').addClass('firefox');\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tvar msIEIndex \\t\\t= ua.toLowerCase().indexOf(\\\"msie\\\");\\r\\n\\t\\tvar tridentIndex \\t= ua.toLowerCase().indexOf(\\\"trident\\\");\\r\\n\\t\\tif (msIEIndex > -1 || tridentIndex > -1){\\r\\n\\t\\t\\ts.isIE = true;\\r\\n\\t\\t\\t$('html').addClass('ie-yes');\\r\\n\\t\\t\\tif (msIEIndex > -1){\\r\\n\\t\\t\\t\\ts.ieVersion = parseInt(ua.substring(msIEIndex + 5, ua.indexOf(\\\".\\\", msIEIndex)));\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse{\\r\\n\\t\\t\\t\\ts.ieVersion = 99;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tieFixes();\\r\\n\\t\\t}\\r\\n\\t\\telse{\\r\\n\\t\\t\\ts.isIE = false;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d314f840e0381e31cb5dfe1d305d5f76\",\n \"score\": \"0.5418099\",\n \"text\": \"function browserDetect(){\\r\\n\\t\\tvar ua = window.navigator.userAgent;\\r\\n\\t\\ts.isFirefox = ua.toLowerCase().indexOf('firefox') > -1; /*[1]*/\\r\\n\\t\\tif (s.isFirefox){\\r\\n\\t\\t\\t$('html').addClass('firefox');\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tvar msIEIndex \\t\\t= ua.toLowerCase().indexOf(\\\"msie\\\");\\r\\n\\t\\tvar tridentIndex \\t= ua.toLowerCase().indexOf(\\\"trident\\\");\\r\\n\\t\\tif (msIEIndex > -1 || tridentIndex > -1){\\r\\n\\t\\t\\ts.isIE = true;\\r\\n\\t\\t\\t$('html').addClass('ie-yes');\\r\\n\\t\\t\\tif (msIEIndex > -1){\\r\\n\\t\\t\\t\\ts.ieVersion = parseInt(ua.substring(msIEIndex + 5, ua.indexOf(\\\".\\\", msIEIndex)));\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse{\\r\\n\\t\\t\\t\\ts.ieVersion = 99;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tieFixes();\\r\\n\\t\\t}\\r\\n\\t\\telse{\\r\\n\\t\\t\\ts.isIE = false;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2438fdb3a4cd76dab1f2f3fcf1800c7\",\n \"score\": \"0.54125375\",\n \"text\": \"function MSIEVersion() {\\n var ua = window.navigator.userAgent;\\n var msie = ua.indexOf(\\\"MSIE \\\");\\n\\n if (msie > 0) // If Internet Explorer, return version number\\n //alert(parseInt(ua.substring(msie + 5, ua.indexOf(\\\".\\\", msie))));\\n return true;\\n else // If another browser, return 0\\n return false;\\n\\n //return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab0eaea1aaa528160deb92d35b3856d4\",\n \"score\": \"0.54122365\",\n \"text\": \"function m(){return-1===window.navigator.userAgent.indexOf(\\\"Trident\\\")}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e1b55e93a8658a120bc43cc7443a926\",\n \"score\": \"0.53990734\",\n \"text\": \"function browserDetection() {\\n \\n // Determine the browser type\\n // Browser Types:\\n // 0 - Not supported\\n // 1 - Netscape Communicator 4.x\\n // 2 - IE\\n // 3 - Opera\\n // 4 - NS6\\n\\n\\nvar thebrowser;\\n\\nvar foropera = window.navigator.userAgent.toLowerCase();\\n//alert(foropera);\\n\\nvar itsopera = foropera.indexOf(\\\"opera\\\",0) + 1;\\nvar itsgecko = foropera.indexOf(\\\"gecko\\\",0) + 1;\\nvar itsmozillacompat = foropera.indexOf(\\\"mozilla\\\",0) + 1;\\nvar itsmsie = foropera.indexOf(\\\"msie\\\",0) + 1;\\n\\n\\n\\n if (itsopera > 0){\\n /******* Identify Opera as IE for static tree to show up *****/\\n //thebrowser = 2\\n thebrowser = 3;\\n //alert(\\\"its opera\\\");\\n //isNav4 = true\\n document.all = document.getElementsByTagName(\\\"*\\\")\\n\\n }\\n\\n\\n if (itsmozillacompat > 0){ \\n //alert(\\\"its mozilla compatible\\\");\\n if (itsgecko > 0) {\\n thebrowser = 4\\n // alert(\\\"its gecko\\\");\\n //isNav4 = true\\n document.all = document.getElementsByTagName(\\\"*\\\")\\n\\n \\n }\\n else if (itsmsie > 0) {\\n // alert(\\\"its msie\\\");\\n thebrowser = 2\\n //isIE = true\\n }\\n else {\\n // alert(\\\"its ns4.x\\\")\\n thebrowser = 1\\n // isNav4 = true\\n }\\n } \\n\\n\\nreturn thebrowser;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91f068580bf502a31924764f2b369a60\",\n \"score\": \"0.5396355\",\n \"text\": \"function isThisIE() {\\n // Pre-version 11, this was sufficient.\\n if (Prototype.Browser.IE) { return true; }\\n\\n var ua = navigator.userAgent;\\n\\n // With IE 11, the string 'Trident' appears in this.\\n if (ua.indexOf('Trident') > 0) { return true; }\\n\\n // With Microsoft Edge...\\n if (ua.indexOf('Edge') > 0) { return true; }\\n\\n // Safari... oddly enough, the userAgent for Chrome includes 'Safari'\\n if ((ua.indexOf('Safari') > 0)\\n && (ua.indexOf('Chrome') < 0)) { return true; }\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57e0956f686496c1d7da22314d6fd428\",\n \"score\": \"0.53905964\",\n \"text\": \"function browserCheck()\\n{\\nvar check=navigator.appName;\\nif (check==\\\"Microsoft Internet Explorer\\\")\\n{\\nbrowserInfo=\\\"bad\\\";\\n}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6e6d16d4975d4548ff6a14569d199b9\",\n \"score\": \"0.5390306\",\n \"text\": \"function hasTransparentBug(browser) {\\n return ~[\\\"ie 8\\\", \\\"ie 9\\\"].indexOf(browser);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ae32a6369487cbb1f94d7dea5693a2d\",\n \"score\": \"0.53848743\",\n \"text\": \"function setCompatibility()\\n {\\n if (typeof String.prototype.trim !== 'function') {\\n String.prototype.trim = function() {\\n return this.replace(/^\\\\s+|\\\\s+$/g, '');\\n }\\n }\\n\\n if (typeof document.hasFocus !== 'function') {\\n // Opera lacks hasFocus support. Simply default to true.\\n document.hasFocus = function() {\\n return true;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17bd114deacdbec983a11e98fcf8265a\",\n \"score\": \"0.5384539\",\n \"text\": \"function ie6Ptach(containerVal) {\\n if (IEVersion <= 7) {\\n var iframes = containerVal.getElementsByTagName(\\\"iframe\\\");\\n if (iframes != null && iframes.length > 0) {\\n return;\\n }\\n var ieMat = document.createElement(\\\"iframe\\\");\\n if (document.location.protocol == \\\"https:\\\") {\\n ieMat.src = \\\"/images/spacer.gif\\\";\\n } else if (window.opera != \\\"undefined\\\") {\\n ieMat.src = \\\"\\\";\\n } else {\\n ieMat.src = \\\"javascript:false\\\";\\n }\\n ieMat.scrolling = \\\"no\\\";\\n ieMat.frameBorder = \\\"0\\\";\\n ieMat.style.width = containerVal.offsetWidth + \\\"px\\\";\\n ieMat.style.height = containerVal.offsetHeight + \\\"px\\\";\\n ieMat.style.zIndex = \\\"-1\\\";\\n containerVal.insertBefore(ieMat, containerVal.childNodes[0]);\\n containerVal.style.zIndex = \\\"100\\\";\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55e7b27e88e92567331928e67164fb12\",\n \"score\": \"0.5379555\",\n \"text\": \"function detectIE() {\\n var ua = window.navigator.userAgent;\\n\\n var msie = ua.indexOf(\\\"MSIE \\\");\\n if (msie > 0) {\\n return parseInt(ua.substring(msie + 5, ua.indexOf(\\\".\\\", msie)), 10);\\n }\\n\\n var trident = ua.indexOf(\\\"Trident/\\\");\\n if (trident > 0) {\\n var rv = ua.indexOf(\\\"rv:\\\");\\n return parseInt(ua.substring(rv + 3, ua.indexOf(\\\".\\\", rv)), 10);\\n }\\n\\n var edge = ua.indexOf(\\\"Edge/\\\");\\n if (edge > 0) {\\n return parseInt(ua.substring(edge + 5, ua.indexOf(\\\".\\\", edge)), 10);\\n }\\n\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c5a31320d4ffe0f8f592ca38ba7e6ea\",\n \"score\": \"0.53760356\",\n \"text\": \"function detectIE() {\\n\\t\\tvar ua = window.navigator.userAgent;\\n\\t\\tvar msie = ua.indexOf('MSIE ');\\n\\t\\tif (msie > 0) {\\n\\t\\t\\t// IE 10 or older => return version number\\n\\t\\t\\treturn parseInt(ua.substring(msie + 5, ua.indexOf('.', msie)), 10);\\n\\t\\t}\\n\\t\\tvar trident = ua.indexOf('Trident/');\\n\\t\\tif (trident > 0) {\\n\\t\\t\\t// IE 11 => return version number\\n\\t\\t\\tvar rv = ua.indexOf('rv:');\\n\\t\\t\\treturn parseInt(ua.substring(rv + 3, ua.indexOf('.', rv)), 10);\\n\\t\\t}\\n\\t\\tvar edge = ua.indexOf('Edge/');\\n\\t\\tif (edge > 0) {\\n\\t\\t // IE 12 => return version number\\n\\t\\t return parseInt(ua.substring(edge + 5, ua.indexOf('.', edge)), 10);\\n\\t\\t}\\n\\t\\t// other browser\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd1ee68a9068da6e769542f9779e1906\",\n \"score\": \"0.53739357\",\n \"text\": \"function isEDGE(){\\n return /Edge\\\\/\\\\d./i.test(navigator.userAgent)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7aeccdc52d02192e5135a752f9a6f6a3\",\n \"score\": \"0.53739107\",\n \"text\": \"function detectIE() {\\n var ua = window.navigator.userAgent;\\n\\n var msie = ua.indexOf('MSIE ');\\n if (msie > 0) {\\n return parseInt(ua.substring(msie + 5, ua.indexOf('.', msie)), 10);\\n }\\n\\n var trident = ua.indexOf('Trident/');\\n if (trident > 0) {\\n var rv = ua.indexOf('rv:');\\n return parseInt(ua.substring(rv + 3, ua.indexOf('.', rv)), 10);\\n }\\n\\n var edge = ua.indexOf('Edge/');\\n if (edge > 0) {\\n return parseInt(ua.substring(edge + 5, ua.indexOf('.', edge)), 10);\\n }\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7aeccdc52d02192e5135a752f9a6f6a3\",\n \"score\": \"0.53739107\",\n \"text\": \"function detectIE() {\\n var ua = window.navigator.userAgent;\\n\\n var msie = ua.indexOf('MSIE ');\\n if (msie > 0) {\\n return parseInt(ua.substring(msie + 5, ua.indexOf('.', msie)), 10);\\n }\\n\\n var trident = ua.indexOf('Trident/');\\n if (trident > 0) {\\n var rv = ua.indexOf('rv:');\\n return parseInt(ua.substring(rv + 3, ua.indexOf('.', rv)), 10);\\n }\\n\\n var edge = ua.indexOf('Edge/');\\n if (edge > 0) {\\n return parseInt(ua.substring(edge + 5, ua.indexOf('.', edge)), 10);\\n }\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21d97a6bb5a3c1f9c6118402b724feef\",\n \"score\": \"0.53725725\",\n \"text\": \"function clickreturnvalue(){\\nif (ie4||ns6) return false\\nelse return true\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":67,"cells":{"query_id":{"kind":"string","value":"197d7f16daaffd456012310f5598f214"},"query":{"kind":"string","value":"Creates a new Node with `attributes`, resolving with the new record"},"positive_passages":{"kind":"list like","value":[{"docid":"b09e88ffa5f1fa8ead95edd57b2b1176","score":"0.6254221","text":"create(attributes) {\n return new Promise((resolve, reject) => {\n // Add the new record to the IDB store, then resolve with the newly\n // allocated localId on the record\n this.objectStore.put(attributes)\n .then(localId => {\n attributes.localId = localId;\n resolve(attributes);\n })\n .catch(reject);\n });\n }","title":""}],"string":"[\n {\n \"docid\": \"b09e88ffa5f1fa8ead95edd57b2b1176\",\n \"score\": \"0.6254221\",\n \"text\": \"create(attributes) {\\n return new Promise((resolve, reject) => {\\n // Add the new record to the IDB store, then resolve with the newly\\n // allocated localId on the record\\n this.objectStore.put(attributes)\\n .then(localId => {\\n attributes.localId = localId;\\n resolve(attributes);\\n })\\n .catch(reject);\\n });\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"795d0183456139f8cfda0754c39c5c94","score":"0.59545773","text":"function newTag() //E Create a new node\n {const parameters = Array.from(arguments);\n const tag = parameters.shift(); // Tag for new node\n\n return objectifyTree({\"tag\": tag, \"contents\":[], \"attributes\":{}});\n }","title":""},{"docid":"4e3054c0952e61600b9f8e5e35de15d0","score":"0.58274657","text":"create(attributes, relationships) {\n var _this = this;\n var headers = new Headers();\n var data = { data: { type: _this.type, attributes, relationships } };\n var body = JSON.stringify(data);\n var fetchOptions = { method: 'POST', body, headers };\n\n headers.append('Content-Type', 'application/json');\n\n return rest(`${_this.type}`, fetchOptions)\n .then(handleFetchResponse)\n .then(_this.buildFromJson.bind(_this))\n .catch(handleFetchError);\n }","title":""},{"docid":"2af018b7db156e7cd5cb5d84c3fd8c0f","score":"0.57145363","text":"node(name, attributes, text) {\n var child;\n if (name != null) {\n name = name.valueOf();\n }\n attributes || (attributes = {});\n attributes = attributes.valueOf();\n // swap argument order: text <-> attributes\n if (!isObject(attributes)) {\n [text, attributes] = [attributes, text];\n }\n child = new XMLElement(this, name, attributes);\n if (text != null) {\n child.text(text);\n }\n this.children.push(child);\n return child;\n }","title":""},{"docid":"6cf4e47377b76b254ebdbe371deab7f8","score":"0.5674517","text":"function unsafeAddNode(graph, node, attributes) {\n var data = new graph.NodeDataClass(node, attributes);\n\n graph._nodes.set(node, data);\n\n graph.emit('nodeAdded', {\n key: node,\n attributes: attributes\n });\n return data;\n }","title":""},{"docid":"e916c30eeaf31ccfdc84222ecf710423","score":"0.55973554","text":"node(name, attributes, text) {\n var child;\n if (name != null) {\n name = getValue(name);\n }\n attributes || (attributes = {});\n attributes = getValue(attributes);\n // swap argument order: text <-> attributes\n if (!isObject(attributes)) {\n [text, attributes] = [attributes, text];\n }\n child = new XMLElement(this, name, attributes);\n if (text != null) {\n child.text(text);\n }\n this.children.push(child);\n return child;\n }","title":""},{"docid":"75da759ad668a7521a88c79aaf5c5a48","score":"0.55085915","text":"create (scope) {\n return this.createNode(scope, this.creationArgs)\n }","title":""},{"docid":"de402d718f29f3505208e522e375cf8a","score":"0.5506842","text":"function unsafeAddNode(graph, node, attributes) {\n const data = new graph.NodeDataClass(node, attributes);\n\n graph._nodes.set(node, data);\n\n graph.emit('nodeAdded', {\n key: node,\n attributes\n });\n\n return data;\n}","title":""},{"docid":"2cd28657ab46720f5f79bd8c3b77c3af","score":"0.54925936","text":"function createNode(node, success, failure, headers) {\n\n\tmakeAuthenticatedRequest({\n\t\t\tservicePath : \"node\",\n\t\t\thttpMethod : \"POST\",\n\t\n\t\t\tparams : JSON.stringify({\n\t\t\t\tnode : node\n\t\t\t})\n\t\t}, function(response) {\n\t\t\tTi.API.trace(JSON.stringify(response));\n\t\t\tsuccess(response);\n\t\t}, function(response) {\n\t\t\tfailure(response);\n\t\t}, \n\t\theaders\n\t);\n}","title":""},{"docid":"090e10340343c0f4ceb1b9ef5e3a1322","score":"0.53931797","text":"update(localId, updatedAttributes) {\n return new Promise((resolve, reject) => {\n // Lock the DB before performing the update so we don't have problems\n // with race conditions and lose data\n this.objectStore.db.transaction('readwrite', ['nodes'], (err, tx) => {\n const store = tx.objectStore('nodes');\n\n // Fetch the existing record\n store.get(localId).onsuccess = (evt) => {\n let node = evt.target.result;\n\n // Apply the new attributes to the node\n Object.assign(node, updatedAttributes);\n\n // Save it\n store.put(node);\n\n // When we're done saving, resolve the promise with the new record\n tx.oncomplete = evt => resolve(evt.target.result);\n\n // Let the caller be aware of any errors during the transaction\n tx.onerror = reject;\n };\n });\n });\n }","title":""},{"docid":"d4785041c0ce0f4607b8ea9c04f2acc5","score":"0.53454465","text":"function reformNode(rawNode) {\n if (!rawNode || typeof rawNode !== 'object') { return rawNode }\n\n const copy = Object.assign({}, rawNode)\n\n if (copy.properties && copy.properties.id) {\n copy.id = copy.properties.id\n }\n\n const decodedProps = utils.decodeProps(copy.properties)\n delete copy.properties\n\n return Object.assign({}, copy, { data: decodedProps })\n }","title":""},{"docid":"466a215c154e31eb091c3552aead1f6b","score":"0.5304529","text":"node(name, attributes, text) {\n if (name == null) {\n throw new Error(\"Missing node name\");\n }\n if (this.root && this.currentLevel === -1) {\n throw new Error(\"Document can only have one root node\");\n }\n this.openCurrent();\n name = name.valueOf();\n if (attributes == null) {\n attributes = {};\n }\n attributes = attributes.valueOf();\n // swap argument order: text <-> attributes\n if (!isObject(attributes)) {\n [text, attributes] = [attributes, text];\n }\n this.currentNode = new XMLElement(this, name, attributes);\n this.currentNode.children = false;\n this.currentLevel++;\n this.openTags[this.currentLevel] = this.currentNode;\n if (text != null) {\n this.text(text);\n }\n return this;\n }","title":""},{"docid":"37947654410eb882ebfcee15a4a9eab4","score":"0.53040445","text":"constructor(attributes) {\n super(attributes);\n }","title":""},{"docid":"f43af23f530e93523a0b0f7291401491","score":"0.5285265","text":"function createNode(id) {\n removeHighlight()\n id = id || 'new' + Math.round( Math.random() * 100 );\n cy.add({\n classes: 'node',\n data: { id: id},\n position: {\n x: realClickCoordsX,\n y: realClickCoordsY\n }\n });\n console.log(`Node created. Id: ${id}`);\n}","title":""},{"docid":"f199906a3754253d96e3f3b379f2471e","score":"0.5282673","text":"node(name, attributes, text) {\n if (name == null) {\n throw new Error(\"Missing node name.\");\n }\n if (this.root && this.currentLevel === -1) {\n throw new Error(\"Document can only have one root node. \" + this.debugInfo(name));\n }\n this.openCurrent();\n name = getValue(name);\n if (attributes == null) {\n attributes = {};\n }\n attributes = getValue(attributes);\n // swap argument order: text <-> attributes\n if (!isObject(attributes)) {\n [text, attributes] = [attributes, text];\n }\n this.currentNode = new XMLElement(this, name, attributes);\n this.currentNode.children = false;\n this.currentLevel++;\n this.openTags[this.currentLevel] = this.currentNode;\n if (text != null) {\n this.text(text);\n }\n return this;\n }","title":""},{"docid":"f199906a3754253d96e3f3b379f2471e","score":"0.5282673","text":"node(name, attributes, text) {\n if (name == null) {\n throw new Error(\"Missing node name.\");\n }\n if (this.root && this.currentLevel === -1) {\n throw new Error(\"Document can only have one root node. \" + this.debugInfo(name));\n }\n this.openCurrent();\n name = getValue(name);\n if (attributes == null) {\n attributes = {};\n }\n attributes = getValue(attributes);\n // swap argument order: text <-> attributes\n if (!isObject(attributes)) {\n [text, attributes] = [attributes, text];\n }\n this.currentNode = new XMLElement(this, name, attributes);\n this.currentNode.children = false;\n this.currentLevel++;\n this.openTags[this.currentLevel] = this.currentNode;\n if (text != null) {\n this.text(text);\n }\n return this;\n }","title":""},{"docid":"adffddca9473761d85a8e37fdbe7bed2","score":"0.528236","text":"function Node(tag, attrs, children, text, parentNode) {\n this.tag = tag;\n this.text = text;\n this.attrs = attrs;\n this.children = children;\n this.parentNode = parentNode;\n\n // Capture a quick reference to a key if the Node has one.\n this.key = attrs.key;\n\n // Once the virtual node is built into a real node, we'll\n // store a reference to that node here so we never have to\n // find it again.\n this.node = null;\n }","title":""},{"docid":"52f30ccaa2c88cd4c12bbf706facfb63","score":"0.527473","text":"function createNode(type, attributes, props, evls) {\r\n\r\n\tvar node = document.createElement(type);\r\n\r\n\tif (attributes) {\r\n\t\tfor (var attr in attributes) {\r\n\t\t\tif (attributes.hasOwnProperty(attr)) node.setAttribute(attr, attributes[attr]);\r\n\t\t}\r\n\t}\r\n\r\n\tif (props) {\r\n\t\tfor (var prop in props) {\r\n\t\t\tif ((props.hasOwnProperty(prop)) && (prop in node)) node[prop] = props[prop];\r\n\t\t}\r\n\t}\r\n\r\n\tif (Array.isArray(evls)) {\r\n\t\tevls.forEach(function(evl) {\r\n\t\t\tif (Array.isArray(evl)) node.addEventListener.apply(node, evl);\r\n\t\t});\r\n\t}\r\n\r\n\treturn node;\r\n\r\n}","title":""},{"docid":"402829d3191666162f7c37854c43f685","score":"0.5235628","text":"function createAndAddAttribute(node, attributeName, attributeValue) {\n if (!node) {\n console.error('Node is null, cannot add attribute.');\n return;\n }\n\n if (!node.hasAttribute(attributeName)) {\n var attr = document.createAttribute(attributeName);\n attr.value = attributeValue;\n node.setAttributeNode(attr);\n }\n if (!!attributeValue) {\n node.setAttribute(attributeName, attributeValue);\n }\n}","title":""},{"docid":"e00c4f97ff451eb8d81377719f89562b","score":"0.52304095","text":"function createNode(name, value) {\n Nodes.push({\n name,\n value,\n links: []\n });\n}","title":""},{"docid":"c222667621438ffc958beab2ba7d999e","score":"0.5227256","text":"constructor (attributes = {}, options = {}) {\n this.isNew = !attributes[this.idAttribute]\n this.options = options\n\n this.attributes = attributes\n }","title":""},{"docid":"b545ae9c918841bcf88259eb30f8b18c","score":"0.5224004","text":"createNewNode(data){\n const newNode = new node(data);\n return newNode;\n }","title":""},{"docid":"4f37d8a8121d222b8b9af4c10dbdb0e0","score":"0.5215291","text":"creating(newObj, attr, options) { // eslint-disable-line\n }","title":""},{"docid":"62b22debde55362e143c835c2995a2be","score":"0.51921606","text":"function createNode$$1(type, parent, subpath, environment, initialValue, createNewInstance, finalizeNewInstance) {\n if (createNewInstance === void 0) { createNewInstance = identity; }\n if (finalizeNewInstance === void 0) { finalizeNewInstance = noop; }\n if (isStateTreeNode$$1(initialValue)) {\n var targetNode = initialValue.$treenode;\n if (!targetNode.isRoot)\n fail(\"Cannot add an object to a state tree if it is already part of the same or another state tree. Tried to assign an object to '\" + (parent\n ? parent.path\n : \"\") + \"/\" + subpath + \"', but it lives already at '\" + targetNode.path + \"'\");\n targetNode.setParent(parent, subpath);\n return targetNode;\n }\n var storedValue = createNewInstance(initialValue);\n if (type.shouldAttachNode) {\n var node = new ObjectNode$$1(type, parent, subpath, environment, initialValue, storedValue, type.shouldAttachNode, finalizeNewInstance);\n node.finalizeCreation();\n return node;\n }\n return new ScalarNode$$1(type, parent, subpath, environment, initialValue, storedValue, type.shouldAttachNode, finalizeNewInstance);\n}","title":""},{"docid":"a178add1cd1e626eff375a3a0112c140","score":"0.51624376","text":"function newElement(tag, attributes, parent) {\n\tvar element = document.createElement(tag);\n\tif(attributes != undefined) {\n\t\tif(attributes.class != undefined) { attributes.className = attributes.class; attributes.class = undefined; }\n\t\tif(attributes.inner != undefined) { attributes.innerHTML = attributes.inner; attributes.inner = undefined; }\n\t\tfor(var key in attributes) {\n\t\t\telement[key] = attributes[key];\n\t\t}\n\t}\n\tif(parent != undefined) parent.appendChild(element);\n\treturn element;\n}","title":""},{"docid":"178c83baf36ce4665ae027765a7fc19b","score":"0.5154761","text":"function createNode(text,el,nodeId){\n var node = document.createElement(el);\n //node.id = nodeId + String(tracking);\n node.id = nodeId;\n var line = document.createTextNode(text);\n node.appendChild(line);\n {debugger}\n return node;\n}","title":""},{"docid":"f7813a92c9afe330096c4414099bf419","score":"0.514533","text":"constructor() {\n this.attributes = {};\n }","title":""},{"docid":"a45d3febb337ad08917c8716d48f1e07","score":"0.5129704","text":"function createNode(vnode, children, element) {\n var type = vnode.type;\n var node = void 0;\n\n if (!element) {\n if (type === '#text') {\n vnode.element = document.createTextNode(vnode.props.nodeValue);\n return vnode;\n }\n\n node = vnode.element = (0, _createElement2.default)(type);\n } else {\n node = vnode.element = element;\n }\n\n (0, _foreach2.default)(function (child) {\n return node.appendChild(child.element);\n }, children);\n (0, _foreach2.default)(function (value, name) {\n return (0, _setAttribute2.default)(node, name, value);\n }, vnode.props);\n return vnode;\n}","title":""},{"docid":"89512fe78b11b8090b86ac8913a41701","score":"0.511946","text":"function createAndAppend(typ, parent, attributes = {}) {\n const elem = document.createElement(typ);\n parent.appendChild(elem);\n for (const key in attributes) elem[key] = attributes[key]\n return elem\n}","title":""},{"docid":"9208a3b8a3a8bb533762834a22bc0918","score":"0.51174605","text":"function createNode(transform, render, sibling, child){\n var node = {\n transform: transform,\n render: render,\n sibling: sibling,\n child: child,\n }\n return node;\n}","title":""},{"docid":"b24b7a2900b74af275bd2943e184ac33","score":"0.5105846","text":"@action(constants.CREATE_NODE_SUCCESS)\n handleCreateNodeSuccess(payload) {\n logger.info('handleCreateNodeSuccess', { payload: payload });\n this.db.nodes.get(payload.localId).then((node) => {\n if (node.assignmentId) {\n this.flux.actions.persistNode(node.localId);\n }\n });\n }","title":""},{"docid":"bf09f7a8b455d76bb192b2d06d570297","score":"0.50962627","text":"build(attributes) {\n attributes = attributes || {}\n\n // Strike displaced nodes from index, they should already have been deleted\n let changedKeys = Object.keys(attributes)\n let toDelete = this.getPathsToDelete(attributes)\n toDelete.forEach((path) => {\n delete this.i[path]\n })\n\n // Add new keys to index, write new\n changedKeys.forEach((path) => {\n \n // If this path does not yet have an index node, create one\n if (!this.i[path]) {\n this.i[path] = new IndexEntry(path)\n }\n this.i[path].size(u.getSize(attributes[path])) \n })\n \n // Add intermediate nodes, including the top level\n this.updateMetaNodes()\n this.loaded = true\n return this.i\n }","title":""},{"docid":"ea6d5a19e40fdff1160cb719178be953","score":"0.50863117","text":"function createElement(tag, node, text, attr1, attrValue1, attr2, attrValue2, attr3, attrValue3, attr4, attrValue4) {\n\tlet element = document.createElement(tag);\n\tif (attr1 != undefined) {\n\t\telement.setAttribute(attr1, attrValue1);\n\t\tif (attr2 != undefined) {\n\t\t\telement.setAttribute(attr2, attrValue2);\n\t\t\tif (attr3 != undefined) {\n\t\t\t\telement.setAttribute(attr3, attrValue3);\n\t\t\t\tif (attr4 != undefined)\n\t\t\t\t\telement.setAttribute(attr4, attrValue4);\n\t\t\t}\n\t\t}\n\t}\n\tif (text != null) {\n\t\tlet string = document.createTextNode(text);\n\t\telement.appendChild(string);\n\t}\n\tnode.appendChild(element);\n\treturn element;\n}","title":""},{"docid":"d057397ef2f21266f565c07c22f2e898","score":"0.5084984","text":"createNewNode(type, depth){\n\n let newNode;\n\n newNode = new Node(this.numNodes, type, depth);\n\n this.numNodes += 1;\n\n return newNode;\n }","title":""},{"docid":"94f7b58525ae9c92def99c0d10bfde16","score":"0.50826985","text":"function addNode(prop, timestamp = new Date().toJSON()) {\n var query = `MERGE (a${filterize(prop)}) ON CREATE SET a={prop}, a.created_at=${JSON.stringify(timestamp)}, a.updated_at=${JSON.stringify(timestamp)} ON MATCH SET a += {prop}, a.updated_at=${JSON.stringify(timestamp)} RETURN a`\n return {\n query: query,\n params: { prop: prop }\n }\n}","title":""},{"docid":"1cc456461bb3a5274c6dc7b4e89ff171","score":"0.5071021","text":"createPlainObject(name, id = undefined, attributes = {}) {\n return {\n attributes,\n childNodes: [],\n id,\n name,\n textLength: 0,\n };\n }","title":""},{"docid":"b9517fe41ded9fd8988b7f4f8c982dda","score":"0.5069636","text":"function node (name, attr, event) {\n // create and add command\n var cmd = {node: name},\n attrDef = addToDefs('node', cmd);\n // set defaults and optional params\n if (/innerHTML|innerText|class/.test(attr)) {\n cmd.type = attr;\n }\n else {\n cmd.type = 'attribute';\n cmd.attribute = attr || currAttr;\n }\n if (event) {\n cmd.event = event;\n // record if this command is bidirectional\n attrDef.bidi = [].concat(attrDef.bidi, cmd);\n }\n // return fully-decorated chain\n return chainWithSubMethods;\n }","title":""},{"docid":"e4563bdd1ac76d12bc2fc36d608c9319","score":"0.50665414","text":"function createNodeAndLink(data, fromnode) {\n var diagram = fromnode.diagram;\n var model = diagram.model;\n var nodedata = model.copyNodeData(data);\n model.addNodeData(nodedata);\n var newnode = diagram.findNodeForData(nodedata);\n var linkdata = model.copyLinkData({text:\"Relation\"}); //mujtabachang: Added default link text of \"relation\"\n model.setFromKeyForLinkData(linkdata, model.getKeyForNodeData(fromnode.data));\n model.setToKeyForLinkData(linkdata, model.getKeyForNodeData(newnode.data));\n model.addLinkData(linkdata);\n diagram.select(newnode);\n return newnode;\n }","title":""},{"docid":"e37fdc6dca84ee82415c3c7f84065dd1","score":"0.506605","text":"function create(metadata, item) {\n var key = getKeyByValue(metadata, item);\n var nodeTree = [];\n\n var node = {\n key: key,\n siblings: [],\n parent: null\n };\n nodeTree.push(node);\n return parseMetadataToObject(metadata, key, nodeTree, node);\n }","title":""},{"docid":"ee156e1b49a9f7cf42cd64fdb7bbd728","score":"0.505584","text":"async create(attributes) {\n let data = {};\n\n\n // add # before conditions string (`#` representing `intent`);\n if (attributes.conditions) {\n attributes.conditions = `#${attributes.conditions}`;\n }\n\n attributes.dialogNode = slugify(attributes.title);\n \n data.result = await this._createResource(attributes)\n\n data.result = this._mapAttributes(data.result);\n\n\n return data;\n }","title":""},{"docid":"e1f19ddbe48b0f78244f1b784b181d6d","score":"0.50534505","text":"function create(contents) {\n // Using the current timestamp in place of a real id.\n var id = Date.now();\n _root[id] = {\n id: id,\n selector: '.foo',\n properties: {},\n contents: contents\n };\n}","title":""},{"docid":"4e35662f0550386207aa5ec155c7a1fd","score":"0.5051518","text":"function hc_documentcreateattribute() {\n var success;\n var doc;\n var newAttrNode;\n var attrValue;\n var attrName;\n var attrType;\n doc = load(\"hc_staff\");\n newAttrNode = doc.createAttribute(\"title\");\n attrValue = newAttrNode.nodeValue;\n\n assertEquals(\"value\",\"\",attrValue);\n attrName = newAttrNode.nodeName;\n\n assertEqualsAutoCase(\"attribute\", \"name\",\"title\",attrName);\n attrType = newAttrNode.nodeType;\n\n assertEquals(\"type\",2,attrType);\n \n}","title":""},{"docid":"cc7c1ff34e1a013b8690929e7f69c10a","score":"0.5044747","text":"function createNode () {\n const name = \"q\" + nodeCounter;\n nodeCounter++;\n return {name, transitions: [], targetOf: []};\n}","title":""},{"docid":"824955529b4b241f058f4d3d1dcfbbd1","score":"0.5025627","text":"constructor(node) {\n this._node = node;\n }","title":""},{"docid":"824955529b4b241f058f4d3d1dcfbbd1","score":"0.5025627","text":"constructor(node) {\n this._node = node;\n }","title":""},{"docid":"824955529b4b241f058f4d3d1dcfbbd1","score":"0.5025627","text":"constructor(node) {\n this._node = node;\n }","title":""},{"docid":"8a8accab6e13e0d8661ba80ebf172c0b","score":"0.50223696","text":"create ( props ) {\n props.slug = util.string.sluggify( props.name );\n props.fid = util.helper.generateId();\n\n var createQuery = [\n // Validate the Invitation\n 'MATCH (invite:FeisInvite {id: {id}})-[:FOR]->(account:Account {id:{account_id}})',\n 'WHERE ( invite.invalid IS NULL OR invite.invalid = 0 )',\n ' AND (invite.used IS NULL OR invite.used = 0 )',\n\n // Create the Feis\n 'CREATE invite<-[:FROM]-(feis:Feis {',\n ' name: { name },',\n ' slug: { slug },',\n ' tz: { tz },',\n ' is_public: 0,',\n ' id: {fid}',\n '})<-[:ON]-(:Grant { role: \"chair\" })-[:FOR]->account',\n 'SET invite.used = 1',\n \n // Return the feis\n 'RETURN feis as node'\n ];\n\n var copySyllabusQuery = [\n 'MATCH (feis:Feis {id:{fid}})',\n 'MATCH (:FeisTemplate {id:{tid}})<-[:OF]-(tpl:Event)',\n 'CREATE feis<-[:OF]-(event:Event)',\n 'SET event = tpl',\n 'SET event.id = event.id + \":\" + feis.id',\n \n // Return the feis\n 'RETURN feis as node'\n ];\n\n return this._db.queryOne( createQuery, props )\n .map( ( feis ) => {\n if ( props.template_id ) {\n return this._db.queryOne( copySyllabusQuery, { fid: props.fid, tid: props.template_id } )\n } else {\n return [ feis ];\n }\n })\n .flatten()\n .head();\n }","title":""},{"docid":"8b2539686569033129a9aeb07c5225fa","score":"0.5008572","text":"function $makeNode(tag, className, attrs, children) {\n /* Allow omitting parameters */\n if (Array.isArray(className)) {\n if (! attrs && ! children) {\n children = className;\n attrs = null;\n className = null;\n }\n } else if (typeof className == 'object' && className != null) {\n if (! children) {\n children = attrs;\n attrs = className;\n className = null;\n }\n } else if (Array.isArray(attrs) || typeof attrs == 'string') {\n if (! children) {\n children = attrs;\n attrs = null;\n }\n }\n /* Create node */\n var ret = document.createElement(tag);\n /* Set classes */\n if (className) ret.className = className;\n /* Set additional attributes */\n if (attrs) {\n for (var name in attrs) {\n if (! attrs.hasOwnProperty(name)) continue;\n ret.setAttribute(name, attrs[name]);\n }\n }\n /* Add children */\n if (children) {\n if (typeof children == 'string') children = [children];\n for (var i = 0; i < children.length; i++) {\n var e = children[i];\n if (! e) {\n /* Allow conditional node omission */\n } else if (typeof e == 'string') {\n /* Strings become text nodes */\n ret.appendChild(document.createTextNode(e));\n } else if (typeof e != 'object') {\n /* Other primitive types are not allowed */\n throw new Error('Bad child encountered during DOM node creation');\n } else if (Array.isArray(e)) {\n /* Arrays are handled recursively */\n ret.appendChild($makeNode.apply(null, e));\n } else {\n /* Everything else is assumed to be a DOM node */\n ret.appendChild(e);\n }\n }\n }\n return ret;\n}","title":""},{"docid":"e17566b82b944e6647e40f47a073bf37","score":"0.5003522","text":"addNode() {\n function randomArg(... args) {\n return args[Math.floor(Math.random() * args.length)];\n }\n\n const nodeData = {\n renderedPosition: { x: 60 + Math.round(Math.random() * 70), y: 60 + Math.round(Math.random() * 70) },\n data: {\n attr1: Math.random(), // betwen 0 and 1\n attr2: Math.random() * 2.0 - 1.0, // between -1 and 1\n attr3: randomArg(\"A\", \"B\", \"C\")\n }\n };\n const node = this.cy.add(nodeData);\n this.bus.emit('addNode', node);\n }","title":""},{"docid":"f98a5a61242a1d4a2bed10d663c7097c","score":"0.50012577","text":"createNode(\n graphComponent,\n newName,\n newShort,\n newImgurl,\n newColor,\n posX,\n posY\n ) {\n // get cytoscape instance\n let cy = graphComponent.getCytoGraph();\n\n // get current id counter\n let count = cy.data(\"IDCount\");\n let doneonce = false;\n // add element\n cy.add({\n data: {\n id: parseInt(count),\n name: newName,\n short: newShort,\n imgUrl: newImgurl,\n color: newColor\n },\n style: {\n \"background-color\": \"#\" + newColor\n },\n position: { x: posX, y: posY }\n });\n\n let node = cy.getElementById(count);\n console.log(\"added node: \", node);\n\n node.addClass(\"nodelabel\");\n\n if (doneonce==false){\n // update position if conflict occurs\n this.moveNodesInConflict(graphComponent, node)\n doneonce=true;\n }\n // increment id counter\n count++;\n cy.data(\"IDCount\", count);\n }","title":""},{"docid":"5f623230d5d39e301d7f77a08c6e68e2","score":"0.5000144","text":"openNode(type, attrs) {\n this.stack.push({type: type, attrs: attrs, content: []});\n }","title":""},{"docid":"b33480948fe55c97798359053566edcc","score":"0.49931282","text":"function addNode(id, label, href)\n{\n\tvar newIndex = this.m_subNodes.length;\n\tvar newNode = new NavNode(id, label, href, this);\n\n\tvar argValues = addNode.arguments;\n\tvar argCount = addNode.arguments.length;\n\n\tfor (i = 3 ; i < argCount ; i++)\n\t{\n\t\tvar eqPos = argValues[i].indexOf(\"==\");\n\t\tvar attrName = argValues[i].substring(0,eqPos);\n\t\tvar attrValue = argValues[i].substring(eqPos+2);\n\n\t\teval(\"newNode.cp_\" + attrName + \" = '\" + attrValue + \"';\");\n\t}\n\n\tthis.m_subNodes[newIndex] = newNode;\n\treturn newNode;\n}","title":""},{"docid":"ed730092c0f5f066aca0ecf5e814104d","score":"0.4967696","text":"function makeNode(dom_parent, tag_name, value_element) {\n dom_parent.append($(document.createElement('div')).addClass('node')\n .append($(document.createElement('div')).addClass('tag_name closed').html(tag_name))\n .append(value_element)\n );\n}","title":""},{"docid":"bfb5dc2987f57f139d2c8c74758444da","score":"0.49671948","text":"injectAttributes() {\n\t const newAttributes = {};\n\n\t newAttributes[this.foreignKey] = _.defaults({}, this.foreignKeyAttribute, {\n\t type: this.options.keyType || this.target.rawAttributes[this.targetKey].type,\n\t allowNull: true\n\t });\n\n\t if (this.options.constraints !== false) {\n\t const source = this.source.rawAttributes[this.foreignKey] || newAttributes[this.foreignKey];\n\t this.options.onDelete = this.options.onDelete || (source.allowNull ? 'SET NULL' : 'NO ACTION');\n\t this.options.onUpdate = this.options.onUpdate || 'CASCADE';\n\t }\n\n\t Helpers.addForeignKeyConstraints(newAttributes[this.foreignKey], this.target, this.source, this.options, this.targetKeyField);\n\t Utils.mergeDefaults(this.source.rawAttributes, newAttributes);\n\n\t this.identifierField = this.source.rawAttributes[this.foreignKey].field || this.foreignKey;\n\n\t this.source.refreshAttributes();\n\n\t Helpers.checkNamingCollision(this);\n\n\t return this;\n\t }","title":""},{"docid":"2ccc8941be2cd6e53058ed260f84ffee","score":"0.4964904","text":"function createNode(el, attr) {\n\t// html comment is not currently supported by virtual-dom\n\tif (el.nodeType === 3) {\n\t\treturn createVirtualTextNode(el);\n\n\t// cdata or doctype is not currently supported by virtual-dom\n\t} else if (el.nodeType === 1 || el.nodeType === 9) {\n\t\treturn createVirtualDomNode(el, attr);\n\t}\n\n\t// default to empty text node\n\treturn new VText('');\n}","title":""},{"docid":"96bb2814134a015bb07b2cf7e6a24c1b","score":"0.49552593","text":"function makeNode(name, children = [], state = validResultValues.not_built, completePercent) {\n completePercent = completePercent || ((state == validResultValues.running) ? Math.floor(Math.random() * 60 + 20) : 50);\n const id = __id++;\n return {name, children, state, completePercent, id};\n}","title":""},{"docid":"e4cba510cdfc00799210157f28e0b2d3","score":"0.4947515","text":"function Node() {}","title":""},{"docid":"283d98ef56e44af5e3d01a4b2779f941","score":"0.4938277","text":"function makeNode(name, children = [], state = validResultValues.not_built, completePercent) {\n completePercent = completePercent || ((state == validResultValues.running) ? Math.floor(Math.random() * 60 + 20) : 50);\n const id = __id++;\n return { name, children, state, completePercent, id };\n}","title":""},{"docid":"6153cda15c768bc366addeb23f39f15f","score":"0.49375194","text":"function factory(type, attributes, text) {\r\n const el = document.createElement(type);\r\n for (let key in attributes) {\r\n el.setAttribute(key, attributes[key]);\r\n }\r\n if (text) {\r\n el.textContent = text;\r\n }\r\n return el;\r\n }","title":""},{"docid":"8babe7b178655054965416e790cd7e53","score":"0.4921049","text":"function createNodes(data_nodes) {\n\tvar node = {};\n\tfor (id in data_nodes) {\n\t\tnode[id] = db.createNode(data_nodes[id]); //this create the node\n\t\t//save into the DB\t\t\n\t\tnode[id].save();\n\t}\n\treturn node;\n}","title":""},{"docid":"1590c90f57f0d33c3ebbf7c0f3f9ac58","score":"0.49146238","text":"function createNode(link, depth) {\n return {\n link,\n depth,\n children: []\n };\n}","title":""},{"docid":"c2d22c6e6fb0e49409d9efb8eb8db0b3","score":"0.49135214","text":"createChildNode(node) {\n var att, attName, attributes, child, i, len, ref, ref1;\n switch (node.type) {\n case NodeType.CData:\n this.cdata(node.value);\n break;\n case NodeType.Comment:\n this.comment(node.value);\n break;\n case NodeType.Element:\n attributes = {};\n ref = node.attribs;\n for (attName in ref) {\n if (!hasProp.call(ref, attName)) continue;\n att = ref[attName];\n attributes[attName] = att.value;\n }\n this.node(node.name, attributes);\n break;\n case NodeType.Dummy:\n this.dummy();\n break;\n case NodeType.Raw:\n this.raw(node.value);\n break;\n case NodeType.Text:\n this.text(node.value);\n break;\n case NodeType.ProcessingInstruction:\n this.instruction(node.target, node.value);\n break;\n default:\n throw new Error(\"This XML node type is not supported in a JS object: \" + node.constructor.name);\n }\n ref1 = node.children;\n // write child nodes recursively\n for (i = 0, len = ref1.length; i < len; i++) {\n child = ref1[i];\n this.createChildNode(child);\n if (child.type === NodeType.Element) {\n this.up();\n }\n }\n return this;\n }","title":""},{"docid":"c2d22c6e6fb0e49409d9efb8eb8db0b3","score":"0.49135214","text":"createChildNode(node) {\n var att, attName, attributes, child, i, len, ref, ref1;\n switch (node.type) {\n case NodeType.CData:\n this.cdata(node.value);\n break;\n case NodeType.Comment:\n this.comment(node.value);\n break;\n case NodeType.Element:\n attributes = {};\n ref = node.attribs;\n for (attName in ref) {\n if (!hasProp.call(ref, attName)) continue;\n att = ref[attName];\n attributes[attName] = att.value;\n }\n this.node(node.name, attributes);\n break;\n case NodeType.Dummy:\n this.dummy();\n break;\n case NodeType.Raw:\n this.raw(node.value);\n break;\n case NodeType.Text:\n this.text(node.value);\n break;\n case NodeType.ProcessingInstruction:\n this.instruction(node.target, node.value);\n break;\n default:\n throw new Error(\"This XML node type is not supported in a JS object: \" + node.constructor.name);\n }\n ref1 = node.children;\n // write child nodes recursively\n for (i = 0, len = ref1.length; i < len; i++) {\n child = ref1[i];\n this.createChildNode(child);\n if (child.type === NodeType.Element) {\n this.up();\n }\n }\n return this;\n }","title":""},{"docid":"bf9f60a365e59e4f294fed5e4408370c","score":"0.49118373","text":"function newNode(locator, userId, label, details, language,\r\n largeImagePath, smallImagePath, isPrivate) {\r\n var result = {};\r\n if (null !== locator && '' !== locator) {\r\n result.lox = locator;\r\n }\r\n result.uId = userId;\r\n if (null !== language) {\r\n result.Lang = language;\r\n } else {\r\n result.Lang = 'en'; // default\r\n }\r\n //TODO MUST deal with language codes other than english\r\n // this means cloning the language2label system\r\n if (null !== label) {\r\n result.label = label;\r\n }\r\n //TODO same issue with language\r\n if (null !== details) {\r\n result.details = details;\r\n }\r\n if (null !== largeImagePath) {\r\n result.lIco = largeImagePath;\r\n }\r\n if (null !== smallImagePath) {\r\n result.sIco = smallImagePath;\r\n }\r\n var p = \"F\";\r\n if (isPrivate) {\r\n p = \"T\";\r\n }\r\n result.isPrv = p;\r\n console.log(\"NEWNODE \"+JSON.stringify(result));\r\n return result;\r\n }","title":""},{"docid":"11d4f8e47fedc329e78e39ff0147d240","score":"0.4901542","text":"function createNode (tag, text, parent, id, clazz, value){\n\tvar newElement = document.createElement (tag);\n\tif (text) newElement.innerHTML = text;\n\tif (clazz) newElement.className = clazz;\n\tif (id) newElement.id = id;\n\tif (value) newElement.value = value;\n\tif (parent){\n\t\tparent.appendChild (newElement);\n\t\treturn parent.children [parent.children.length -1];\n\t}\n\telse return newElement;\n}","title":""},{"docid":"30c5dbffc554f07f9f069f7e46a4aefc","score":"0.48950875","text":"createElement(type, attributes) {\n let element = document.createElement(type);\n // Sets the element attributes (if any).\n if(attributes !== undefined) {\n for(let key in attributes) {\n\t// Ensures that key is not a method/function.\n\tif(typeof attributes[key] !== 'function') {\n\t element.setAttribute(key, attributes[key]);\n\t}\n }\n }\n\n return element;\n }","title":""},{"docid":"ca16903aa7fce8045c69a7fd4dac11ba","score":"0.48950338","text":"constructor(attributes = []) {\n this.attributes = attributes;\n }","title":""},{"docid":"afe8f1333fed50c2a97c45c607710e16","score":"0.48944798","text":"function newNews(){\n\tfor (attr in allNewsAttributes){\n\t\tif (allNewsAttributes[attr]['caster']){\n\t\t\tcodeAttributes[allNewsAttributes[attr]['path']] = [];\n\t\t}\n\t\telse if (allNewsAttributes[attr]['path'] == 'date'){\n\t\t\tnewsAttributes['TimeStamp'] = {'isOpen':false, 'value':undefined};\n\t\t}\n\t\telse if (['_id', '__v'].indexOf(allNewsAttributes[attr]['path']) == -1){\n\t\t\tnewsAttributes[allNewsAttributes[attr]['path']] = {'isOpen':false, 'value':''};\n\t\t}\n\t}\n}","title":""},{"docid":"d5e4db87eda616f2c01df0073a958149","score":"0.48928484","text":"function createNode(name)\n {\n return {\n name: name,\n edges: [],\n module: {}\n };\n }","title":""},{"docid":"a7ef606afc2d03afef944ebb1131728d","score":"0.48908725","text":"insert(value) {\n let node = new Node(value);\n }","title":""},{"docid":"5ce0eb3fefbde4bd39027805ef7d309d","score":"0.48879695","text":"function Node(opts) {\n this.after = opts.after;\n this.before = opts.before;\n this.type = opts.type;\n this.value = opts.value;\n this.sourceIndex = opts.sourceIndex;\n }","title":""},{"docid":"f923639f534f3c1c0f39226549c7514b","score":"0.48827377","text":"injectAttributes() {\n\t const newAttributes = {};\n\t const keyType = this.source.rawAttributes[this.source.primaryKeyAttribute].type;\n\n\t newAttributes[this.foreignKey] = _.defaults({}, this.foreignKeyAttribute, {\n\t type: this.options.keyType || keyType,\n\t allowNull: true\n\t });\n\t Utils.mergeDefaults(this.target.rawAttributes, newAttributes);\n\n\t this.identifierField = this.target.rawAttributes[this.foreignKey].field || this.foreignKey;\n\n\t if (this.options.constraints !== false) {\n\t const target = this.target.rawAttributes[this.foreignKey] || newAttributes[this.foreignKey];\n\t this.options.onDelete = this.options.onDelete || (target.allowNull ? 'SET NULL' : 'CASCADE');\n\t this.options.onUpdate = this.options.onUpdate || 'CASCADE';\n\t }\n\n\t Helpers.addForeignKeyConstraints(this.target.rawAttributes[this.foreignKey], this.source, this.target, this.options);\n\n\t // Sync attributes and setters/getters to Model prototype\n\t this.target.refreshAttributes();\n\n\t Helpers.checkNamingCollision(this);\n\n\t return this;\n\t }","title":""},{"docid":"d47deb45305da2be85db9d984dff8035","score":"0.4882098","text":"function addNode() {\n // veryLastNodeId = lastCreatedNodeId;\n veryLastNodeId = \"1\"; //Family node\n nodeGenerated = generateBox();\n // createNode(nodeGenerated.node.type, nodeGenerated.node);\n\n createNode(\"Member\", nodeGenerated.node);\n\n if(veryLastNodeId != undefined) {\n edgeGenerated = \n { \"edge\" : {\n \"id\" : nodeGenerated.node.id + \"Edge\",\n \"type\" : \"default\",\n \"origin\" : veryLastNodeId,\n \"target\" : nodeGenerated.node.id,\n \"editorOptions\" : { \"movable\" : false,\"editable\" : false} \n }\n };\n createEdge(edgeGenerated.edge.type, edgeGenerated.edge);\n }\n}","title":""},{"docid":"75fb0db60792fd296141c1ba6f90aeb3","score":"0.48696604","text":"static create(attributes) {\n // synchronous version\n // let product = new Product(attributes)\n // this.collection.push(product)\n // return product\n // asynchronous version with fetch \n return fetch(\"http://localhost:3000/products\", {\n method: 'POST',\n headers: {\n 'Content-Type': 'application/json'\n },\n body: JSON.stringify(attributes)\n })\n .then(response => response.json())\n .then(productAttributes => {\n let product = new Product(productAttributes)\n this.collection.push(product)\n return product\n })\n }","title":""},{"docid":"f8933dba92ab8be2f42a765ffe1a1d2c","score":"0.48681355","text":"async create (modelName, newContents, creator, parent) {\n const bare = Object.assign(Object.assign({}, newContents), {\n creator,\n createdOn: new Date(),\n acl: {}, // TODO: add initial\n parent\n })\n\n const out = Pandemonica(bare, abs, await resolveModel(modelName))\n await out.save()\n return out\n }","title":""},{"docid":"fe2c9c2410fb8188005c7cb0291b9343","score":"0.48622322","text":"connectNode(node, command, args) {\n node.setAttribute(`data-${COMMAND_ATTR}`, command);\n if (args !== void 0) {\n node.setAttribute(`data-${ARGS_ATTR}`, JSON.stringify(args));\n }\n return node;\n }","title":""},{"docid":"ce9fd373992fc269ffc10a85f488aee9","score":"0.4856173","text":"function new_article_category_tree_node(){\n return {\n id:[],\n tag:{},\n children: {},\n }\n}","title":""},{"docid":"f3dc7b54e128c3abc857623289a090e3","score":"0.4855798","text":"function NodeWrapper() {\n this._node = this.constructor.createNode();\n }","title":""},{"docid":"014ba3258148002dc4fe195844bfe7bb","score":"0.48533535","text":"function ajaxDSSchemaNode(nsname, nodename, nodetype, nodeForAttr)\n{\n\tthis.nsname = nsname;\n\tthis.nodename = nodename;\n\tthis.nodetype = nodetype;\n\tthis.nodeForAttr = nodeForAttr;\n}","title":""},{"docid":"2435373c447a60533026a308f1cc1d24","score":"0.48523983","text":"function create(uri, languageId, version, text) {\n return {\n uri: uri,\n languageId: languageId,\n version: version,\n text: text\n };\n }","title":""},{"docid":"963ad4d258751aa1b7f542835178c9d6","score":"0.4851821","text":"function createTNode(type, adjustedIndex, tagName, attrs, parent, tViews) {\n ngDevMode && ngDevMode.tNode++;\n return {\n type: type,\n index: adjustedIndex,\n flags: 0,\n tagName: tagName,\n attrs: attrs,\n localNames: null,\n initialInputs: undefined,\n inputs: undefined,\n outputs: undefined,\n tViews: tViews,\n next: null,\n child: null,\n parent: parent,\n dynamicContainerNode: null,\n detached: null,\n stylingTemplate: null,\n projection: null\n };\n}","title":""},{"docid":"963ad4d258751aa1b7f542835178c9d6","score":"0.4851821","text":"function createTNode(type, adjustedIndex, tagName, attrs, parent, tViews) {\n ngDevMode && ngDevMode.tNode++;\n return {\n type: type,\n index: adjustedIndex,\n flags: 0,\n tagName: tagName,\n attrs: attrs,\n localNames: null,\n initialInputs: undefined,\n inputs: undefined,\n outputs: undefined,\n tViews: tViews,\n next: null,\n child: null,\n parent: parent,\n dynamicContainerNode: null,\n detached: null,\n stylingTemplate: null,\n projection: null\n };\n}","title":""},{"docid":"963ad4d258751aa1b7f542835178c9d6","score":"0.4851821","text":"function createTNode(type, adjustedIndex, tagName, attrs, parent, tViews) {\n ngDevMode && ngDevMode.tNode++;\n return {\n type: type,\n index: adjustedIndex,\n flags: 0,\n tagName: tagName,\n attrs: attrs,\n localNames: null,\n initialInputs: undefined,\n inputs: undefined,\n outputs: undefined,\n tViews: tViews,\n next: null,\n child: null,\n parent: parent,\n dynamicContainerNode: null,\n detached: null,\n stylingTemplate: null,\n projection: null\n };\n}","title":""},{"docid":"963ad4d258751aa1b7f542835178c9d6","score":"0.4851821","text":"function createTNode(type, adjustedIndex, tagName, attrs, parent, tViews) {\n ngDevMode && ngDevMode.tNode++;\n return {\n type: type,\n index: adjustedIndex,\n flags: 0,\n tagName: tagName,\n attrs: attrs,\n localNames: null,\n initialInputs: undefined,\n inputs: undefined,\n outputs: undefined,\n tViews: tViews,\n next: null,\n child: null,\n parent: parent,\n dynamicContainerNode: null,\n detached: null,\n stylingTemplate: null,\n projection: null\n };\n}","title":""},{"docid":"963ad4d258751aa1b7f542835178c9d6","score":"0.4851821","text":"function createTNode(type, adjustedIndex, tagName, attrs, parent, tViews) {\n ngDevMode && ngDevMode.tNode++;\n return {\n type: type,\n index: adjustedIndex,\n flags: 0,\n tagName: tagName,\n attrs: attrs,\n localNames: null,\n initialInputs: undefined,\n inputs: undefined,\n outputs: undefined,\n tViews: tViews,\n next: null,\n child: null,\n parent: parent,\n dynamicContainerNode: null,\n detached: null,\n stylingTemplate: null,\n projection: null\n };\n}","title":""},{"docid":"c70cf63370fa276a3685e8a8f12ed801","score":"0.4847024","text":"@action create(data = null, options = { wait: false }) {\n let originalAttributes = this.attributes.toJS();\n let originalRelationships = toJS(this.relationships);\n let resourceObject = {\n data: {\n type: this.type\n }\n };\n\n if (data && data.attributes) {\n resourceObject.data.attributes = Object.assign(\n {},\n originalAttributes,\n data.attributes\n );\n } else {\n resourceObject.data.attributes = Object.assign(\n {}, \n originalAttributes\n );\n }\n\n if (data && data.relationships) {\n resourceObject.data.relationships = Object.assign(\n {},\n originalRelationships,\n data.relationships\n );\n } else {\n resourceObject.data.relationships = Object.assign(\n {}, \n originalRelationships\n );\n }\n\n if (!options.wait) {\n if (data && data.attributes) {\n this.setAttributes(data.attributes);\n }\n\n if (data && data.relationships) {\n this.setRelationships(data.relationships);\n }\n } else {\n this.setRequestLabel('saving', true);\n }\n\n return new Promise((resolve, reject) => {\n request.post(\n options.url ? options.url : this.url(), \n resourceObject\n )\n .then((response) => {\n this.set(response.data);\n this.setRequestLabel('saving', false);\n resolve(this, response);\n })\n .catch((error) => {\n if (!options.wait) {\n this.setAttributes(originalAttributes);\n this.setRelationships(originalRelationships);\n }\n \n this.setRequestLabel('saving', false);\n reject(error);\n });\n });\n }","title":""},{"docid":"99ec6eadef257e20ddd4abaabff85423","score":"0.48469225","text":"function makeElement(name, attributes, dest = scene) {\n const e = document.createElement(`a-${name}`);\n Object.entries(attributes).forEach(([key, value]) => {\n e.setAttribute(key, value);\n });\n\n dest.appendChild(e);\n return e;\n}","title":""},{"docid":"aeb54ff88240e357f7792503dc2c08df","score":"0.48392108","text":"createNode(value) {\n return {\n value: value,\n next: null\n }\n }","title":""},{"docid":"be0d732bd1b398312853f3e0e78ee54c","score":"0.48389804","text":"function NodeWrapper() {\r\n\t this._node = this.constructor.createNode();\r\n\t }","title":""},{"docid":"4444a68a01c62985e0b70418cdda95e9","score":"0.48352927","text":"function create(name, detail, kind, range, selectionRange, children) {\n var result = {\n name: name,\n detail: detail,\n kind: kind,\n range: range,\n selectionRange: selectionRange\n };\n if (children !== undefined) {\n result.children = children;\n }\n return result;\n }","title":""},{"docid":"9020b809b7fc902d94233152c91039fa","score":"0.48267782","text":"nodify(data) {\n return Object.assign(data, this.nodeFactory())\n }","title":""},{"docid":"b6e5aac4edb901051e7bfa7054e8f2b5","score":"0.48260713","text":"function Node(opts) {\n this.after = opts.after;\n this.before = opts.before;\n this.type = opts.type;\n this.value = opts.value;\n this.sourceIndex = opts.sourceIndex;\n}","title":""},{"docid":"210f56feca6694a391cd35d18710ba53","score":"0.48076925","text":"function Node(xml){\r\n var _this = this;\r\n this.id = xml.getAttribute(\"id\");\r\n this.name = xml.getAttribute(\"name\");\r\n \r\n var translate = xml.getElementsByTagName(\"translate\")[0];\r\n if (translate) {\r\n this.translate = parseFloatArray(translate.firstChild.nodeValue);\r\n }\r\n var rotates = xml.getElementsByTagName(\"rotate\");\r\n for (var i = 0; i < rotates.length; i++) {\r\n var rotate = rotates[i];\r\n var sid = rotate.getAttribute(\"sid\");\r\n if (sid == \"rotateZ\") {\r\n this.rotateZ = parseFloatArray(rotate.firstChild.nodeValue);\r\n }else if (sid == \"rotateY\") {\r\n this.rotateY = parseFloatArray(rotate.firstChild.nodeValue);\r\n }else if (sid == \"rotateX\") {\r\n this.rotateX = parseFloatArray(rotate.firstChild.nodeValue);\r\n }\r\n }\r\n var scale = xml.getElementsByTagName(\"scale\")[0];\r\n if (scale) {\r\n this.scale = parseFloatArray(scale.firstChild.nodeValue);\r\n }\r\n \r\n var instance_geometry = xml.getElementsByTagName(\"instance_geometry\")[0];\r\n if (instance_geometry) {\r\n var url = instance_geometry.getAttribute(\"url\");\r\n if (url) {\r\n this.url = url.replace(\"#\", \"\");\r\n }\r\n }\r\n }","title":""},{"docid":"cf24d264c10c9849553db155bb284f2a","score":"0.48022276","text":"assignNodes(node) {\n if (Class.resolve(this) !== Class.resolve(node)) {\n if (node.leftNode !== void 0) {\n this.attachLeft(node.leftNode);\n }\n if (node.nextNode !== void 0) {\n this.attachNext(node.nextNode);\n }\n if (node.rightNode !== void 0) {\n this.attachRight(node.rightNode);\n }\n this.nodeData = {\n ...node.nodeData,\n ...this.nodeData\n };\n }\n return this;\n }","title":""},{"docid":"e480af399aefc33b8375be2348bd2d25","score":"0.47940102","text":"setAttributes(attributes) {\n for (const key of Object.keys(attributes)) {\n this.attributes[key] = attributes[key];\n }\n return this;\n }","title":""},{"docid":"f87e98f5ce956e4aa850aa969d16fcca","score":"0.47880667","text":"function createAttribute(doc, node, type, val){\n\tvar attribute = doc.createAttribute(type);\n\tattribute.nodeValue = val;\n\tnode.setAttributeNode(attribute);\n}","title":""},{"docid":"8313d9774b39d98dffb82b8d1ceb2b3c","score":"0.4782088","text":"function cl(node){\r\n\t\tvar element = document.createElement(node.tagName);\r\n\t\telement.id = node.id + \"-clone\";\r\n\t\telement.className = node.className;\r\n\t\tfor (var j = 0; j < node.attributes.length; j++) {\r\n\t\t\tif (node.attributes[j].specified) {\r\n\t\t\t\tif (node.attributes[j].nodeName.toLowerCase() != \"style\" \r\n\t\t\t\t\t&& node.attributes[j].nodeName.toLowerCase() != \"edited\" \r\n\t\t\t\t\t&& node.attributes[j].nodeName.toLowerCase() != \"contenteditable\"\r\n\t\t\t\t\t&& node.attributes[j].nodeName.toLowerCase() != \"id\"\r\n\t\t\t\t\t&& node.attributes[j].nodeName.toLowerCase() != \"class\"\r\n\t\t\t\t){\r\n\t\t\t\t\telement.setAttribute(node.attributes[j].nodeName.toLowerCase(), node.attributes[j].nodeValue);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn element;\r\n\t}","title":""},{"docid":"8313d9774b39d98dffb82b8d1ceb2b3c","score":"0.4782088","text":"function cl(node){\r\n\t\tvar element = document.createElement(node.tagName);\r\n\t\telement.id = node.id + \"-clone\";\r\n\t\telement.className = node.className;\r\n\t\tfor (var j = 0; j < node.attributes.length; j++) {\r\n\t\t\tif (node.attributes[j].specified) {\r\n\t\t\t\tif (node.attributes[j].nodeName.toLowerCase() != \"style\" \r\n\t\t\t\t\t&& node.attributes[j].nodeName.toLowerCase() != \"edited\" \r\n\t\t\t\t\t&& node.attributes[j].nodeName.toLowerCase() != \"contenteditable\"\r\n\t\t\t\t\t&& node.attributes[j].nodeName.toLowerCase() != \"id\"\r\n\t\t\t\t\t&& node.attributes[j].nodeName.toLowerCase() != \"class\"\r\n\t\t\t\t){\r\n\t\t\t\t\telement.setAttribute(node.attributes[j].nodeName.toLowerCase(), node.attributes[j].nodeValue);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn element;\r\n\t}","title":""},{"docid":"571157dbcc45626e6eb6d9e159322d51","score":"0.4773645","text":"function dom(name, attributes) {\n\tvar node = document.createElement(name);\n\tif (attributes) {\n\t\tforEachIn(attributes, function(name, value) {\n\t\t\tsetNodeAttribute(node, name, value);\n\t\t\t/**\n\t\t\t * the forEachIn function uses attributes as object and calls the action\n\t\t\t * using object and object[property], so object[property] is where the value of the\n\t\t\t * attribute to set comes from.\n\t\t\t * Furthermore the forEachIn function is able to use the second argument of the dom function an \n\t\t\t * object containing the attributes of the node.\n\t\t\t * */\n\n\t\t});\n\t}\n\tfor (var i = 2; i < arguments.length; i++) {\n\t\tvar child = arguments[i];\n\t\tif (typeof child == \"string\")\n\t\t\tchild = document.createTextNode(child);\n\t\tnode.appendChild(child);\n\t}\n\treturn node;\n}","title":""},{"docid":"bc8e08d49526e95f5585371bf0db1e90","score":"0.477162","text":"function changeXmlNodeType(node, tag, attributes)\n{\n\t// Find the root (actually the document, not the root node. Who's counting?)\n\t// We create based on this XML document to ensure we have the right namespace\n\tvar root = rootNode(node);\n\tvar ns = namespace(node);\n\n\t// Create a new node of the desired type\n\tvar newNode = root.createElementNS(ns, tag);\n\n\t// Set the desired attributes on the new node\n\tattributes && _.each(attributes, function(val, key) {\n\t\tnewNode.setAttribute(key, val);\n\t});\n\n\t// Transfer all children from the old node to the new\n\twhile(node.childNodes.length)\n\t\tnewNode.appendChild(node.childNodes[0]);\n\n\t// Replace the old node with the new\n\tnode.parentNode.replaceChild(newNode, node);\n\n\t// Return the new node in case the caller needs to perform further operations on it\n\treturn newNode;\n}","title":""},{"docid":"e29df195c1d4168c4468e274c3c3adf2","score":"0.4767753","text":"createInstance (resourceName, attrs, options) {\n let definition = this.definitions[resourceName]\n let item\n\n attrs = attrs || {}\n\n if (!definition) {\n throw new NER(resourceName)\n } else if (attrs && !DSUtils.isObject(attrs)) {\n throw new IA('\"attrs\" must be an object!')\n }\n\n options = DSUtils._(definition, options)\n\n const relationList = definition.relationList || []\n if (relationList.length) {\n DSUtils.forEach(relationList, function (def) {\n const relationData = DSUtils.get(attrs, def.localField)\n if (relationData) {\n if (DSUtils.isArray(relationData)) {\n const array = []\n const Resource = definition.getResource(def.relation)\n const _options = options.orig()\n DSUtils.forEach(relationData, function (relationDataItem) {\n array.push(Resource.createInstance(relationDataItem, _options))\n })\n DSUtils.set(attrs, def.localField, array)\n } else if (DSUtils.isObject(relationData)) {\n DSUtils.set(attrs, def.localField, definition.getResource(def.relation).createInstance(relationData, options.orig()))\n }\n }\n })\n }\n\n options.logFn('createInstance', attrs, options)\n\n // lifecycle\n options.beforeCreateInstance(options, attrs)\n\n // grab instance constructor function from Resource definition\n let Constructor = definition[definition.class]\n\n // create instance\n item = new Constructor()\n\n if (definition.instanceEvents) {\n DSUtils.Events(item)\n }\n\n // add default values\n if (options.defaultValues) {\n DSUtils.deepMixIn(item, DSUtils.copy(options.defaultValues))\n }\n DSUtils.deepMixIn(item, attrs)\n\n // compute computed properties\n if (definition.computed) {\n definition.compute(item)\n }\n // lifecycle\n options.afterCreateInstance(options, item)\n return item\n }","title":""}],"string":"[\n {\n \"docid\": \"795d0183456139f8cfda0754c39c5c94\",\n \"score\": \"0.59545773\",\n \"text\": \"function newTag() //E Create a new node\\n {const parameters = Array.from(arguments);\\n const tag = parameters.shift(); // Tag for new node\\n\\n return objectifyTree({\\\"tag\\\": tag, \\\"contents\\\":[], \\\"attributes\\\":{}});\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e3054c0952e61600b9f8e5e35de15d0\",\n \"score\": \"0.58274657\",\n \"text\": \"create(attributes, relationships) {\\n var _this = this;\\n var headers = new Headers();\\n var data = { data: { type: _this.type, attributes, relationships } };\\n var body = JSON.stringify(data);\\n var fetchOptions = { method: 'POST', body, headers };\\n\\n headers.append('Content-Type', 'application/json');\\n\\n return rest(`${_this.type}`, fetchOptions)\\n .then(handleFetchResponse)\\n .then(_this.buildFromJson.bind(_this))\\n .catch(handleFetchError);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2af018b7db156e7cd5cb5d84c3fd8c0f\",\n \"score\": \"0.57145363\",\n \"text\": \"node(name, attributes, text) {\\n var child;\\n if (name != null) {\\n name = name.valueOf();\\n }\\n attributes || (attributes = {});\\n attributes = attributes.valueOf();\\n // swap argument order: text <-> attributes\\n if (!isObject(attributes)) {\\n [text, attributes] = [attributes, text];\\n }\\n child = new XMLElement(this, name, attributes);\\n if (text != null) {\\n child.text(text);\\n }\\n this.children.push(child);\\n return child;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6cf4e47377b76b254ebdbe371deab7f8\",\n \"score\": \"0.5674517\",\n \"text\": \"function unsafeAddNode(graph, node, attributes) {\\n var data = new graph.NodeDataClass(node, attributes);\\n\\n graph._nodes.set(node, data);\\n\\n graph.emit('nodeAdded', {\\n key: node,\\n attributes: attributes\\n });\\n return data;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e916c30eeaf31ccfdc84222ecf710423\",\n \"score\": \"0.55973554\",\n \"text\": \"node(name, attributes, text) {\\n var child;\\n if (name != null) {\\n name = getValue(name);\\n }\\n attributes || (attributes = {});\\n attributes = getValue(attributes);\\n // swap argument order: text <-> attributes\\n if (!isObject(attributes)) {\\n [text, attributes] = [attributes, text];\\n }\\n child = new XMLElement(this, name, attributes);\\n if (text != null) {\\n child.text(text);\\n }\\n this.children.push(child);\\n return child;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75da759ad668a7521a88c79aaf5c5a48\",\n \"score\": \"0.55085915\",\n \"text\": \"create (scope) {\\n return this.createNode(scope, this.creationArgs)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de402d718f29f3505208e522e375cf8a\",\n \"score\": \"0.5506842\",\n \"text\": \"function unsafeAddNode(graph, node, attributes) {\\n const data = new graph.NodeDataClass(node, attributes);\\n\\n graph._nodes.set(node, data);\\n\\n graph.emit('nodeAdded', {\\n key: node,\\n attributes\\n });\\n\\n return data;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cd28657ab46720f5f79bd8c3b77c3af\",\n \"score\": \"0.54925936\",\n \"text\": \"function createNode(node, success, failure, headers) {\\n\\n\\tmakeAuthenticatedRequest({\\n\\t\\t\\tservicePath : \\\"node\\\",\\n\\t\\t\\thttpMethod : \\\"POST\\\",\\n\\t\\n\\t\\t\\tparams : JSON.stringify({\\n\\t\\t\\t\\tnode : node\\n\\t\\t\\t})\\n\\t\\t}, function(response) {\\n\\t\\t\\tTi.API.trace(JSON.stringify(response));\\n\\t\\t\\tsuccess(response);\\n\\t\\t}, function(response) {\\n\\t\\t\\tfailure(response);\\n\\t\\t}, \\n\\t\\theaders\\n\\t);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"090e10340343c0f4ceb1b9ef5e3a1322\",\n \"score\": \"0.53931797\",\n \"text\": \"update(localId, updatedAttributes) {\\n return new Promise((resolve, reject) => {\\n // Lock the DB before performing the update so we don't have problems\\n // with race conditions and lose data\\n this.objectStore.db.transaction('readwrite', ['nodes'], (err, tx) => {\\n const store = tx.objectStore('nodes');\\n\\n // Fetch the existing record\\n store.get(localId).onsuccess = (evt) => {\\n let node = evt.target.result;\\n\\n // Apply the new attributes to the node\\n Object.assign(node, updatedAttributes);\\n\\n // Save it\\n store.put(node);\\n\\n // When we're done saving, resolve the promise with the new record\\n tx.oncomplete = evt => resolve(evt.target.result);\\n\\n // Let the caller be aware of any errors during the transaction\\n tx.onerror = reject;\\n };\\n });\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4785041c0ce0f4607b8ea9c04f2acc5\",\n \"score\": \"0.53454465\",\n \"text\": \"function reformNode(rawNode) {\\n if (!rawNode || typeof rawNode !== 'object') { return rawNode }\\n\\n const copy = Object.assign({}, rawNode)\\n\\n if (copy.properties && copy.properties.id) {\\n copy.id = copy.properties.id\\n }\\n\\n const decodedProps = utils.decodeProps(copy.properties)\\n delete copy.properties\\n\\n return Object.assign({}, copy, { data: decodedProps })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"466a215c154e31eb091c3552aead1f6b\",\n \"score\": \"0.5304529\",\n \"text\": \"node(name, attributes, text) {\\n if (name == null) {\\n throw new Error(\\\"Missing node name\\\");\\n }\\n if (this.root && this.currentLevel === -1) {\\n throw new Error(\\\"Document can only have one root node\\\");\\n }\\n this.openCurrent();\\n name = name.valueOf();\\n if (attributes == null) {\\n attributes = {};\\n }\\n attributes = attributes.valueOf();\\n // swap argument order: text <-> attributes\\n if (!isObject(attributes)) {\\n [text, attributes] = [attributes, text];\\n }\\n this.currentNode = new XMLElement(this, name, attributes);\\n this.currentNode.children = false;\\n this.currentLevel++;\\n this.openTags[this.currentLevel] = this.currentNode;\\n if (text != null) {\\n this.text(text);\\n }\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37947654410eb882ebfcee15a4a9eab4\",\n \"score\": \"0.53040445\",\n \"text\": \"constructor(attributes) {\\n super(attributes);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f43af23f530e93523a0b0f7291401491\",\n \"score\": \"0.5285265\",\n \"text\": \"function createNode(id) {\\n removeHighlight()\\n id = id || 'new' + Math.round( Math.random() * 100 );\\n cy.add({\\n classes: 'node',\\n data: { id: id},\\n position: {\\n x: realClickCoordsX,\\n y: realClickCoordsY\\n }\\n });\\n console.log(`Node created. Id: ${id}`);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f199906a3754253d96e3f3b379f2471e\",\n \"score\": \"0.5282673\",\n \"text\": \"node(name, attributes, text) {\\n if (name == null) {\\n throw new Error(\\\"Missing node name.\\\");\\n }\\n if (this.root && this.currentLevel === -1) {\\n throw new Error(\\\"Document can only have one root node. \\\" + this.debugInfo(name));\\n }\\n this.openCurrent();\\n name = getValue(name);\\n if (attributes == null) {\\n attributes = {};\\n }\\n attributes = getValue(attributes);\\n // swap argument order: text <-> attributes\\n if (!isObject(attributes)) {\\n [text, attributes] = [attributes, text];\\n }\\n this.currentNode = new XMLElement(this, name, attributes);\\n this.currentNode.children = false;\\n this.currentLevel++;\\n this.openTags[this.currentLevel] = this.currentNode;\\n if (text != null) {\\n this.text(text);\\n }\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f199906a3754253d96e3f3b379f2471e\",\n \"score\": \"0.5282673\",\n \"text\": \"node(name, attributes, text) {\\n if (name == null) {\\n throw new Error(\\\"Missing node name.\\\");\\n }\\n if (this.root && this.currentLevel === -1) {\\n throw new Error(\\\"Document can only have one root node. \\\" + this.debugInfo(name));\\n }\\n this.openCurrent();\\n name = getValue(name);\\n if (attributes == null) {\\n attributes = {};\\n }\\n attributes = getValue(attributes);\\n // swap argument order: text <-> attributes\\n if (!isObject(attributes)) {\\n [text, attributes] = [attributes, text];\\n }\\n this.currentNode = new XMLElement(this, name, attributes);\\n this.currentNode.children = false;\\n this.currentLevel++;\\n this.openTags[this.currentLevel] = this.currentNode;\\n if (text != null) {\\n this.text(text);\\n }\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"adffddca9473761d85a8e37fdbe7bed2\",\n \"score\": \"0.528236\",\n \"text\": \"function Node(tag, attrs, children, text, parentNode) {\\n this.tag = tag;\\n this.text = text;\\n this.attrs = attrs;\\n this.children = children;\\n this.parentNode = parentNode;\\n\\n // Capture a quick reference to a key if the Node has one.\\n this.key = attrs.key;\\n\\n // Once the virtual node is built into a real node, we'll\\n // store a reference to that node here so we never have to\\n // find it again.\\n this.node = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52f30ccaa2c88cd4c12bbf706facfb63\",\n \"score\": \"0.527473\",\n \"text\": \"function createNode(type, attributes, props, evls) {\\r\\n\\r\\n\\tvar node = document.createElement(type);\\r\\n\\r\\n\\tif (attributes) {\\r\\n\\t\\tfor (var attr in attributes) {\\r\\n\\t\\t\\tif (attributes.hasOwnProperty(attr)) node.setAttribute(attr, attributes[attr]);\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\r\\n\\tif (props) {\\r\\n\\t\\tfor (var prop in props) {\\r\\n\\t\\t\\tif ((props.hasOwnProperty(prop)) && (prop in node)) node[prop] = props[prop];\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\r\\n\\tif (Array.isArray(evls)) {\\r\\n\\t\\tevls.forEach(function(evl) {\\r\\n\\t\\t\\tif (Array.isArray(evl)) node.addEventListener.apply(node, evl);\\r\\n\\t\\t});\\r\\n\\t}\\r\\n\\r\\n\\treturn node;\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"402829d3191666162f7c37854c43f685\",\n \"score\": \"0.5235628\",\n \"text\": \"function createAndAddAttribute(node, attributeName, attributeValue) {\\n if (!node) {\\n console.error('Node is null, cannot add attribute.');\\n return;\\n }\\n\\n if (!node.hasAttribute(attributeName)) {\\n var attr = document.createAttribute(attributeName);\\n attr.value = attributeValue;\\n node.setAttributeNode(attr);\\n }\\n if (!!attributeValue) {\\n node.setAttribute(attributeName, attributeValue);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e00c4f97ff451eb8d81377719f89562b\",\n \"score\": \"0.52304095\",\n \"text\": \"function createNode(name, value) {\\n Nodes.push({\\n name,\\n value,\\n links: []\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c222667621438ffc958beab2ba7d999e\",\n \"score\": \"0.5227256\",\n \"text\": \"constructor (attributes = {}, options = {}) {\\n this.isNew = !attributes[this.idAttribute]\\n this.options = options\\n\\n this.attributes = attributes\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b545ae9c918841bcf88259eb30f8b18c\",\n \"score\": \"0.5224004\",\n \"text\": \"createNewNode(data){\\n const newNode = new node(data);\\n return newNode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f37d8a8121d222b8b9af4c10dbdb0e0\",\n \"score\": \"0.5215291\",\n \"text\": \"creating(newObj, attr, options) { // eslint-disable-line\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62b22debde55362e143c835c2995a2be\",\n \"score\": \"0.51921606\",\n \"text\": \"function createNode$$1(type, parent, subpath, environment, initialValue, createNewInstance, finalizeNewInstance) {\\n if (createNewInstance === void 0) { createNewInstance = identity; }\\n if (finalizeNewInstance === void 0) { finalizeNewInstance = noop; }\\n if (isStateTreeNode$$1(initialValue)) {\\n var targetNode = initialValue.$treenode;\\n if (!targetNode.isRoot)\\n fail(\\\"Cannot add an object to a state tree if it is already part of the same or another state tree. Tried to assign an object to '\\\" + (parent\\n ? parent.path\\n : \\\"\\\") + \\\"/\\\" + subpath + \\\"', but it lives already at '\\\" + targetNode.path + \\\"'\\\");\\n targetNode.setParent(parent, subpath);\\n return targetNode;\\n }\\n var storedValue = createNewInstance(initialValue);\\n if (type.shouldAttachNode) {\\n var node = new ObjectNode$$1(type, parent, subpath, environment, initialValue, storedValue, type.shouldAttachNode, finalizeNewInstance);\\n node.finalizeCreation();\\n return node;\\n }\\n return new ScalarNode$$1(type, parent, subpath, environment, initialValue, storedValue, type.shouldAttachNode, finalizeNewInstance);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a178add1cd1e626eff375a3a0112c140\",\n \"score\": \"0.51624376\",\n \"text\": \"function newElement(tag, attributes, parent) {\\n\\tvar element = document.createElement(tag);\\n\\tif(attributes != undefined) {\\n\\t\\tif(attributes.class != undefined) { attributes.className = attributes.class; attributes.class = undefined; }\\n\\t\\tif(attributes.inner != undefined) { attributes.innerHTML = attributes.inner; attributes.inner = undefined; }\\n\\t\\tfor(var key in attributes) {\\n\\t\\t\\telement[key] = attributes[key];\\n\\t\\t}\\n\\t}\\n\\tif(parent != undefined) parent.appendChild(element);\\n\\treturn element;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"178c83baf36ce4665ae027765a7fc19b\",\n \"score\": \"0.5154761\",\n \"text\": \"function createNode(text,el,nodeId){\\n var node = document.createElement(el);\\n //node.id = nodeId + String(tracking);\\n node.id = nodeId;\\n var line = document.createTextNode(text);\\n node.appendChild(line);\\n {debugger}\\n return node;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7813a92c9afe330096c4414099bf419\",\n \"score\": \"0.514533\",\n \"text\": \"constructor() {\\n this.attributes = {};\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a45d3febb337ad08917c8716d48f1e07\",\n \"score\": \"0.5129704\",\n \"text\": \"function createNode(vnode, children, element) {\\n var type = vnode.type;\\n var node = void 0;\\n\\n if (!element) {\\n if (type === '#text') {\\n vnode.element = document.createTextNode(vnode.props.nodeValue);\\n return vnode;\\n }\\n\\n node = vnode.element = (0, _createElement2.default)(type);\\n } else {\\n node = vnode.element = element;\\n }\\n\\n (0, _foreach2.default)(function (child) {\\n return node.appendChild(child.element);\\n }, children);\\n (0, _foreach2.default)(function (value, name) {\\n return (0, _setAttribute2.default)(node, name, value);\\n }, vnode.props);\\n return vnode;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89512fe78b11b8090b86ac8913a41701\",\n \"score\": \"0.511946\",\n \"text\": \"function createAndAppend(typ, parent, attributes = {}) {\\n const elem = document.createElement(typ);\\n parent.appendChild(elem);\\n for (const key in attributes) elem[key] = attributes[key]\\n return elem\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9208a3b8a3a8bb533762834a22bc0918\",\n \"score\": \"0.51174605\",\n \"text\": \"function createNode(transform, render, sibling, child){\\n var node = {\\n transform: transform,\\n render: render,\\n sibling: sibling,\\n child: child,\\n }\\n return node;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b24b7a2900b74af275bd2943e184ac33\",\n \"score\": \"0.5105846\",\n \"text\": \"@action(constants.CREATE_NODE_SUCCESS)\\n handleCreateNodeSuccess(payload) {\\n logger.info('handleCreateNodeSuccess', { payload: payload });\\n this.db.nodes.get(payload.localId).then((node) => {\\n if (node.assignmentId) {\\n this.flux.actions.persistNode(node.localId);\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf09f7a8b455d76bb192b2d06d570297\",\n \"score\": \"0.50962627\",\n \"text\": \"build(attributes) {\\n attributes = attributes || {}\\n\\n // Strike displaced nodes from index, they should already have been deleted\\n let changedKeys = Object.keys(attributes)\\n let toDelete = this.getPathsToDelete(attributes)\\n toDelete.forEach((path) => {\\n delete this.i[path]\\n })\\n\\n // Add new keys to index, write new\\n changedKeys.forEach((path) => {\\n \\n // If this path does not yet have an index node, create one\\n if (!this.i[path]) {\\n this.i[path] = new IndexEntry(path)\\n }\\n this.i[path].size(u.getSize(attributes[path])) \\n })\\n \\n // Add intermediate nodes, including the top level\\n this.updateMetaNodes()\\n this.loaded = true\\n return this.i\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea6d5a19e40fdff1160cb719178be953\",\n \"score\": \"0.50863117\",\n \"text\": \"function createElement(tag, node, text, attr1, attrValue1, attr2, attrValue2, attr3, attrValue3, attr4, attrValue4) {\\n\\tlet element = document.createElement(tag);\\n\\tif (attr1 != undefined) {\\n\\t\\telement.setAttribute(attr1, attrValue1);\\n\\t\\tif (attr2 != undefined) {\\n\\t\\t\\telement.setAttribute(attr2, attrValue2);\\n\\t\\t\\tif (attr3 != undefined) {\\n\\t\\t\\t\\telement.setAttribute(attr3, attrValue3);\\n\\t\\t\\t\\tif (attr4 != undefined)\\n\\t\\t\\t\\t\\telement.setAttribute(attr4, attrValue4);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (text != null) {\\n\\t\\tlet string = document.createTextNode(text);\\n\\t\\telement.appendChild(string);\\n\\t}\\n\\tnode.appendChild(element);\\n\\treturn element;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d057397ef2f21266f565c07c22f2e898\",\n \"score\": \"0.5084984\",\n \"text\": \"createNewNode(type, depth){\\n\\n let newNode;\\n\\n newNode = new Node(this.numNodes, type, depth);\\n\\n this.numNodes += 1;\\n\\n return newNode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"94f7b58525ae9c92def99c0d10bfde16\",\n \"score\": \"0.50826985\",\n \"text\": \"function addNode(prop, timestamp = new Date().toJSON()) {\\n var query = `MERGE (a${filterize(prop)}) ON CREATE SET a={prop}, a.created_at=${JSON.stringify(timestamp)}, a.updated_at=${JSON.stringify(timestamp)} ON MATCH SET a += {prop}, a.updated_at=${JSON.stringify(timestamp)} RETURN a`\\n return {\\n query: query,\\n params: { prop: prop }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cc456461bb3a5274c6dc7b4e89ff171\",\n \"score\": \"0.5071021\",\n \"text\": \"createPlainObject(name, id = undefined, attributes = {}) {\\n return {\\n attributes,\\n childNodes: [],\\n id,\\n name,\\n textLength: 0,\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9517fe41ded9fd8988b7f4f8c982dda\",\n \"score\": \"0.5069636\",\n \"text\": \"function node (name, attr, event) {\\n // create and add command\\n var cmd = {node: name},\\n attrDef = addToDefs('node', cmd);\\n // set defaults and optional params\\n if (/innerHTML|innerText|class/.test(attr)) {\\n cmd.type = attr;\\n }\\n else {\\n cmd.type = 'attribute';\\n cmd.attribute = attr || currAttr;\\n }\\n if (event) {\\n cmd.event = event;\\n // record if this command is bidirectional\\n attrDef.bidi = [].concat(attrDef.bidi, cmd);\\n }\\n // return fully-decorated chain\\n return chainWithSubMethods;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4563bdd1ac76d12bc2fc36d608c9319\",\n \"score\": \"0.50665414\",\n \"text\": \"function createNodeAndLink(data, fromnode) {\\n var diagram = fromnode.diagram;\\n var model = diagram.model;\\n var nodedata = model.copyNodeData(data);\\n model.addNodeData(nodedata);\\n var newnode = diagram.findNodeForData(nodedata);\\n var linkdata = model.copyLinkData({text:\\\"Relation\\\"}); //mujtabachang: Added default link text of \\\"relation\\\"\\n model.setFromKeyForLinkData(linkdata, model.getKeyForNodeData(fromnode.data));\\n model.setToKeyForLinkData(linkdata, model.getKeyForNodeData(newnode.data));\\n model.addLinkData(linkdata);\\n diagram.select(newnode);\\n return newnode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e37fdc6dca84ee82415c3c7f84065dd1\",\n \"score\": \"0.506605\",\n \"text\": \"function create(metadata, item) {\\n var key = getKeyByValue(metadata, item);\\n var nodeTree = [];\\n\\n var node = {\\n key: key,\\n siblings: [],\\n parent: null\\n };\\n nodeTree.push(node);\\n return parseMetadataToObject(metadata, key, nodeTree, node);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee156e1b49a9f7cf42cd64fdb7bbd728\",\n \"score\": \"0.505584\",\n \"text\": \"async create(attributes) {\\n let data = {};\\n\\n\\n // add # before conditions string (`#` representing `intent`);\\n if (attributes.conditions) {\\n attributes.conditions = `#${attributes.conditions}`;\\n }\\n\\n attributes.dialogNode = slugify(attributes.title);\\n \\n data.result = await this._createResource(attributes)\\n\\n data.result = this._mapAttributes(data.result);\\n\\n\\n return data;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1f19ddbe48b0f78244f1b784b181d6d\",\n \"score\": \"0.50534505\",\n \"text\": \"function create(contents) {\\n // Using the current timestamp in place of a real id.\\n var id = Date.now();\\n _root[id] = {\\n id: id,\\n selector: '.foo',\\n properties: {},\\n contents: contents\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e35662f0550386207aa5ec155c7a1fd\",\n \"score\": \"0.5051518\",\n \"text\": \"function hc_documentcreateattribute() {\\n var success;\\n var doc;\\n var newAttrNode;\\n var attrValue;\\n var attrName;\\n var attrType;\\n doc = load(\\\"hc_staff\\\");\\n newAttrNode = doc.createAttribute(\\\"title\\\");\\n attrValue = newAttrNode.nodeValue;\\n\\n assertEquals(\\\"value\\\",\\\"\\\",attrValue);\\n attrName = newAttrNode.nodeName;\\n\\n assertEqualsAutoCase(\\\"attribute\\\", \\\"name\\\",\\\"title\\\",attrName);\\n attrType = newAttrNode.nodeType;\\n\\n assertEquals(\\\"type\\\",2,attrType);\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc7c1ff34e1a013b8690929e7f69c10a\",\n \"score\": \"0.5044747\",\n \"text\": \"function createNode () {\\n const name = \\\"q\\\" + nodeCounter;\\n nodeCounter++;\\n return {name, transitions: [], targetOf: []};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"824955529b4b241f058f4d3d1dcfbbd1\",\n \"score\": \"0.5025627\",\n \"text\": \"constructor(node) {\\n this._node = node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"824955529b4b241f058f4d3d1dcfbbd1\",\n \"score\": \"0.5025627\",\n \"text\": \"constructor(node) {\\n this._node = node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"824955529b4b241f058f4d3d1dcfbbd1\",\n \"score\": \"0.5025627\",\n \"text\": \"constructor(node) {\\n this._node = node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a8accab6e13e0d8661ba80ebf172c0b\",\n \"score\": \"0.50223696\",\n \"text\": \"create ( props ) {\\n props.slug = util.string.sluggify( props.name );\\n props.fid = util.helper.generateId();\\n\\n var createQuery = [\\n // Validate the Invitation\\n 'MATCH (invite:FeisInvite {id: {id}})-[:FOR]->(account:Account {id:{account_id}})',\\n 'WHERE ( invite.invalid IS NULL OR invite.invalid = 0 )',\\n ' AND (invite.used IS NULL OR invite.used = 0 )',\\n\\n // Create the Feis\\n 'CREATE invite<-[:FROM]-(feis:Feis {',\\n ' name: { name },',\\n ' slug: { slug },',\\n ' tz: { tz },',\\n ' is_public: 0,',\\n ' id: {fid}',\\n '})<-[:ON]-(:Grant { role: \\\"chair\\\" })-[:FOR]->account',\\n 'SET invite.used = 1',\\n \\n // Return the feis\\n 'RETURN feis as node'\\n ];\\n\\n var copySyllabusQuery = [\\n 'MATCH (feis:Feis {id:{fid}})',\\n 'MATCH (:FeisTemplate {id:{tid}})<-[:OF]-(tpl:Event)',\\n 'CREATE feis<-[:OF]-(event:Event)',\\n 'SET event = tpl',\\n 'SET event.id = event.id + \\\":\\\" + feis.id',\\n \\n // Return the feis\\n 'RETURN feis as node'\\n ];\\n\\n return this._db.queryOne( createQuery, props )\\n .map( ( feis ) => {\\n if ( props.template_id ) {\\n return this._db.queryOne( copySyllabusQuery, { fid: props.fid, tid: props.template_id } )\\n } else {\\n return [ feis ];\\n }\\n })\\n .flatten()\\n .head();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b2539686569033129a9aeb07c5225fa\",\n \"score\": \"0.5008572\",\n \"text\": \"function $makeNode(tag, className, attrs, children) {\\n /* Allow omitting parameters */\\n if (Array.isArray(className)) {\\n if (! attrs && ! children) {\\n children = className;\\n attrs = null;\\n className = null;\\n }\\n } else if (typeof className == 'object' && className != null) {\\n if (! children) {\\n children = attrs;\\n attrs = className;\\n className = null;\\n }\\n } else if (Array.isArray(attrs) || typeof attrs == 'string') {\\n if (! children) {\\n children = attrs;\\n attrs = null;\\n }\\n }\\n /* Create node */\\n var ret = document.createElement(tag);\\n /* Set classes */\\n if (className) ret.className = className;\\n /* Set additional attributes */\\n if (attrs) {\\n for (var name in attrs) {\\n if (! attrs.hasOwnProperty(name)) continue;\\n ret.setAttribute(name, attrs[name]);\\n }\\n }\\n /* Add children */\\n if (children) {\\n if (typeof children == 'string') children = [children];\\n for (var i = 0; i < children.length; i++) {\\n var e = children[i];\\n if (! e) {\\n /* Allow conditional node omission */\\n } else if (typeof e == 'string') {\\n /* Strings become text nodes */\\n ret.appendChild(document.createTextNode(e));\\n } else if (typeof e != 'object') {\\n /* Other primitive types are not allowed */\\n throw new Error('Bad child encountered during DOM node creation');\\n } else if (Array.isArray(e)) {\\n /* Arrays are handled recursively */\\n ret.appendChild($makeNode.apply(null, e));\\n } else {\\n /* Everything else is assumed to be a DOM node */\\n ret.appendChild(e);\\n }\\n }\\n }\\n return ret;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e17566b82b944e6647e40f47a073bf37\",\n \"score\": \"0.5003522\",\n \"text\": \"addNode() {\\n function randomArg(... args) {\\n return args[Math.floor(Math.random() * args.length)];\\n }\\n\\n const nodeData = {\\n renderedPosition: { x: 60 + Math.round(Math.random() * 70), y: 60 + Math.round(Math.random() * 70) },\\n data: {\\n attr1: Math.random(), // betwen 0 and 1\\n attr2: Math.random() * 2.0 - 1.0, // between -1 and 1\\n attr3: randomArg(\\\"A\\\", \\\"B\\\", \\\"C\\\")\\n }\\n };\\n const node = this.cy.add(nodeData);\\n this.bus.emit('addNode', node);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f98a5a61242a1d4a2bed10d663c7097c\",\n \"score\": \"0.50012577\",\n \"text\": \"createNode(\\n graphComponent,\\n newName,\\n newShort,\\n newImgurl,\\n newColor,\\n posX,\\n posY\\n ) {\\n // get cytoscape instance\\n let cy = graphComponent.getCytoGraph();\\n\\n // get current id counter\\n let count = cy.data(\\\"IDCount\\\");\\n let doneonce = false;\\n // add element\\n cy.add({\\n data: {\\n id: parseInt(count),\\n name: newName,\\n short: newShort,\\n imgUrl: newImgurl,\\n color: newColor\\n },\\n style: {\\n \\\"background-color\\\": \\\"#\\\" + newColor\\n },\\n position: { x: posX, y: posY }\\n });\\n\\n let node = cy.getElementById(count);\\n console.log(\\\"added node: \\\", node);\\n\\n node.addClass(\\\"nodelabel\\\");\\n\\n if (doneonce==false){\\n // update position if conflict occurs\\n this.moveNodesInConflict(graphComponent, node)\\n doneonce=true;\\n }\\n // increment id counter\\n count++;\\n cy.data(\\\"IDCount\\\", count);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f623230d5d39e301d7f77a08c6e68e2\",\n \"score\": \"0.5000144\",\n \"text\": \"openNode(type, attrs) {\\n this.stack.push({type: type, attrs: attrs, content: []});\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b33480948fe55c97798359053566edcc\",\n \"score\": \"0.49931282\",\n \"text\": \"function addNode(id, label, href)\\n{\\n\\tvar newIndex = this.m_subNodes.length;\\n\\tvar newNode = new NavNode(id, label, href, this);\\n\\n\\tvar argValues = addNode.arguments;\\n\\tvar argCount = addNode.arguments.length;\\n\\n\\tfor (i = 3 ; i < argCount ; i++)\\n\\t{\\n\\t\\tvar eqPos = argValues[i].indexOf(\\\"==\\\");\\n\\t\\tvar attrName = argValues[i].substring(0,eqPos);\\n\\t\\tvar attrValue = argValues[i].substring(eqPos+2);\\n\\n\\t\\teval(\\\"newNode.cp_\\\" + attrName + \\\" = '\\\" + attrValue + \\\"';\\\");\\n\\t}\\n\\n\\tthis.m_subNodes[newIndex] = newNode;\\n\\treturn newNode;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed730092c0f5f066aca0ecf5e814104d\",\n \"score\": \"0.4967696\",\n \"text\": \"function makeNode(dom_parent, tag_name, value_element) {\\n dom_parent.append($(document.createElement('div')).addClass('node')\\n .append($(document.createElement('div')).addClass('tag_name closed').html(tag_name))\\n .append(value_element)\\n );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfb5dc2987f57f139d2c8c74758444da\",\n \"score\": \"0.49671948\",\n \"text\": \"injectAttributes() {\\n\\t const newAttributes = {};\\n\\n\\t newAttributes[this.foreignKey] = _.defaults({}, this.foreignKeyAttribute, {\\n\\t type: this.options.keyType || this.target.rawAttributes[this.targetKey].type,\\n\\t allowNull: true\\n\\t });\\n\\n\\t if (this.options.constraints !== false) {\\n\\t const source = this.source.rawAttributes[this.foreignKey] || newAttributes[this.foreignKey];\\n\\t this.options.onDelete = this.options.onDelete || (source.allowNull ? 'SET NULL' : 'NO ACTION');\\n\\t this.options.onUpdate = this.options.onUpdate || 'CASCADE';\\n\\t }\\n\\n\\t Helpers.addForeignKeyConstraints(newAttributes[this.foreignKey], this.target, this.source, this.options, this.targetKeyField);\\n\\t Utils.mergeDefaults(this.source.rawAttributes, newAttributes);\\n\\n\\t this.identifierField = this.source.rawAttributes[this.foreignKey].field || this.foreignKey;\\n\\n\\t this.source.refreshAttributes();\\n\\n\\t Helpers.checkNamingCollision(this);\\n\\n\\t return this;\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ccc8941be2cd6e53058ed260f84ffee\",\n \"score\": \"0.4964904\",\n \"text\": \"function createNode(el, attr) {\\n\\t// html comment is not currently supported by virtual-dom\\n\\tif (el.nodeType === 3) {\\n\\t\\treturn createVirtualTextNode(el);\\n\\n\\t// cdata or doctype is not currently supported by virtual-dom\\n\\t} else if (el.nodeType === 1 || el.nodeType === 9) {\\n\\t\\treturn createVirtualDomNode(el, attr);\\n\\t}\\n\\n\\t// default to empty text node\\n\\treturn new VText('');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96bb2814134a015bb07b2cf7e6a24c1b\",\n \"score\": \"0.49552593\",\n \"text\": \"function makeNode(name, children = [], state = validResultValues.not_built, completePercent) {\\n completePercent = completePercent || ((state == validResultValues.running) ? Math.floor(Math.random() * 60 + 20) : 50);\\n const id = __id++;\\n return {name, children, state, completePercent, id};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4cba510cdfc00799210157f28e0b2d3\",\n \"score\": \"0.4947515\",\n \"text\": \"function Node() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"283d98ef56e44af5e3d01a4b2779f941\",\n \"score\": \"0.4938277\",\n \"text\": \"function makeNode(name, children = [], state = validResultValues.not_built, completePercent) {\\n completePercent = completePercent || ((state == validResultValues.running) ? Math.floor(Math.random() * 60 + 20) : 50);\\n const id = __id++;\\n return { name, children, state, completePercent, id };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6153cda15c768bc366addeb23f39f15f\",\n \"score\": \"0.49375194\",\n \"text\": \"function factory(type, attributes, text) {\\r\\n const el = document.createElement(type);\\r\\n for (let key in attributes) {\\r\\n el.setAttribute(key, attributes[key]);\\r\\n }\\r\\n if (text) {\\r\\n el.textContent = text;\\r\\n }\\r\\n return el;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8babe7b178655054965416e790cd7e53\",\n \"score\": \"0.4921049\",\n \"text\": \"function createNodes(data_nodes) {\\n\\tvar node = {};\\n\\tfor (id in data_nodes) {\\n\\t\\tnode[id] = db.createNode(data_nodes[id]); //this create the node\\n\\t\\t//save into the DB\\t\\t\\n\\t\\tnode[id].save();\\n\\t}\\n\\treturn node;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1590c90f57f0d33c3ebbf7c0f3f9ac58\",\n \"score\": \"0.49146238\",\n \"text\": \"function createNode(link, depth) {\\n return {\\n link,\\n depth,\\n children: []\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2d22c6e6fb0e49409d9efb8eb8db0b3\",\n \"score\": \"0.49135214\",\n \"text\": \"createChildNode(node) {\\n var att, attName, attributes, child, i, len, ref, ref1;\\n switch (node.type) {\\n case NodeType.CData:\\n this.cdata(node.value);\\n break;\\n case NodeType.Comment:\\n this.comment(node.value);\\n break;\\n case NodeType.Element:\\n attributes = {};\\n ref = node.attribs;\\n for (attName in ref) {\\n if (!hasProp.call(ref, attName)) continue;\\n att = ref[attName];\\n attributes[attName] = att.value;\\n }\\n this.node(node.name, attributes);\\n break;\\n case NodeType.Dummy:\\n this.dummy();\\n break;\\n case NodeType.Raw:\\n this.raw(node.value);\\n break;\\n case NodeType.Text:\\n this.text(node.value);\\n break;\\n case NodeType.ProcessingInstruction:\\n this.instruction(node.target, node.value);\\n break;\\n default:\\n throw new Error(\\\"This XML node type is not supported in a JS object: \\\" + node.constructor.name);\\n }\\n ref1 = node.children;\\n // write child nodes recursively\\n for (i = 0, len = ref1.length; i < len; i++) {\\n child = ref1[i];\\n this.createChildNode(child);\\n if (child.type === NodeType.Element) {\\n this.up();\\n }\\n }\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2d22c6e6fb0e49409d9efb8eb8db0b3\",\n \"score\": \"0.49135214\",\n \"text\": \"createChildNode(node) {\\n var att, attName, attributes, child, i, len, ref, ref1;\\n switch (node.type) {\\n case NodeType.CData:\\n this.cdata(node.value);\\n break;\\n case NodeType.Comment:\\n this.comment(node.value);\\n break;\\n case NodeType.Element:\\n attributes = {};\\n ref = node.attribs;\\n for (attName in ref) {\\n if (!hasProp.call(ref, attName)) continue;\\n att = ref[attName];\\n attributes[attName] = att.value;\\n }\\n this.node(node.name, attributes);\\n break;\\n case NodeType.Dummy:\\n this.dummy();\\n break;\\n case NodeType.Raw:\\n this.raw(node.value);\\n break;\\n case NodeType.Text:\\n this.text(node.value);\\n break;\\n case NodeType.ProcessingInstruction:\\n this.instruction(node.target, node.value);\\n break;\\n default:\\n throw new Error(\\\"This XML node type is not supported in a JS object: \\\" + node.constructor.name);\\n }\\n ref1 = node.children;\\n // write child nodes recursively\\n for (i = 0, len = ref1.length; i < len; i++) {\\n child = ref1[i];\\n this.createChildNode(child);\\n if (child.type === NodeType.Element) {\\n this.up();\\n }\\n }\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf9f60a365e59e4f294fed5e4408370c\",\n \"score\": \"0.49118373\",\n \"text\": \"function newNode(locator, userId, label, details, language,\\r\\n largeImagePath, smallImagePath, isPrivate) {\\r\\n var result = {};\\r\\n if (null !== locator && '' !== locator) {\\r\\n result.lox = locator;\\r\\n }\\r\\n result.uId = userId;\\r\\n if (null !== language) {\\r\\n result.Lang = language;\\r\\n } else {\\r\\n result.Lang = 'en'; // default\\r\\n }\\r\\n //TODO MUST deal with language codes other than english\\r\\n // this means cloning the language2label system\\r\\n if (null !== label) {\\r\\n result.label = label;\\r\\n }\\r\\n //TODO same issue with language\\r\\n if (null !== details) {\\r\\n result.details = details;\\r\\n }\\r\\n if (null !== largeImagePath) {\\r\\n result.lIco = largeImagePath;\\r\\n }\\r\\n if (null !== smallImagePath) {\\r\\n result.sIco = smallImagePath;\\r\\n }\\r\\n var p = \\\"F\\\";\\r\\n if (isPrivate) {\\r\\n p = \\\"T\\\";\\r\\n }\\r\\n result.isPrv = p;\\r\\n console.log(\\\"NEWNODE \\\"+JSON.stringify(result));\\r\\n return result;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11d4f8e47fedc329e78e39ff0147d240\",\n \"score\": \"0.4901542\",\n \"text\": \"function createNode (tag, text, parent, id, clazz, value){\\n\\tvar newElement = document.createElement (tag);\\n\\tif (text) newElement.innerHTML = text;\\n\\tif (clazz) newElement.className = clazz;\\n\\tif (id) newElement.id = id;\\n\\tif (value) newElement.value = value;\\n\\tif (parent){\\n\\t\\tparent.appendChild (newElement);\\n\\t\\treturn parent.children [parent.children.length -1];\\n\\t}\\n\\telse return newElement;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30c5dbffc554f07f9f069f7e46a4aefc\",\n \"score\": \"0.48950875\",\n \"text\": \"createElement(type, attributes) {\\n let element = document.createElement(type);\\n // Sets the element attributes (if any).\\n if(attributes !== undefined) {\\n for(let key in attributes) {\\n\\t// Ensures that key is not a method/function.\\n\\tif(typeof attributes[key] !== 'function') {\\n\\t element.setAttribute(key, attributes[key]);\\n\\t}\\n }\\n }\\n\\n return element;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca16903aa7fce8045c69a7fd4dac11ba\",\n \"score\": \"0.48950338\",\n \"text\": \"constructor(attributes = []) {\\n this.attributes = attributes;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afe8f1333fed50c2a97c45c607710e16\",\n \"score\": \"0.48944798\",\n \"text\": \"function newNews(){\\n\\tfor (attr in allNewsAttributes){\\n\\t\\tif (allNewsAttributes[attr]['caster']){\\n\\t\\t\\tcodeAttributes[allNewsAttributes[attr]['path']] = [];\\n\\t\\t}\\n\\t\\telse if (allNewsAttributes[attr]['path'] == 'date'){\\n\\t\\t\\tnewsAttributes['TimeStamp'] = {'isOpen':false, 'value':undefined};\\n\\t\\t}\\n\\t\\telse if (['_id', '__v'].indexOf(allNewsAttributes[attr]['path']) == -1){\\n\\t\\t\\tnewsAttributes[allNewsAttributes[attr]['path']] = {'isOpen':false, 'value':''};\\n\\t\\t}\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5e4db87eda616f2c01df0073a958149\",\n \"score\": \"0.48928484\",\n \"text\": \"function createNode(name)\\n {\\n return {\\n name: name,\\n edges: [],\\n module: {}\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7ef606afc2d03afef944ebb1131728d\",\n \"score\": \"0.48908725\",\n \"text\": \"insert(value) {\\n let node = new Node(value);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ce0eb3fefbde4bd39027805ef7d309d\",\n \"score\": \"0.48879695\",\n \"text\": \"function Node(opts) {\\n this.after = opts.after;\\n this.before = opts.before;\\n this.type = opts.type;\\n this.value = opts.value;\\n this.sourceIndex = opts.sourceIndex;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f923639f534f3c1c0f39226549c7514b\",\n \"score\": \"0.48827377\",\n \"text\": \"injectAttributes() {\\n\\t const newAttributes = {};\\n\\t const keyType = this.source.rawAttributes[this.source.primaryKeyAttribute].type;\\n\\n\\t newAttributes[this.foreignKey] = _.defaults({}, this.foreignKeyAttribute, {\\n\\t type: this.options.keyType || keyType,\\n\\t allowNull: true\\n\\t });\\n\\t Utils.mergeDefaults(this.target.rawAttributes, newAttributes);\\n\\n\\t this.identifierField = this.target.rawAttributes[this.foreignKey].field || this.foreignKey;\\n\\n\\t if (this.options.constraints !== false) {\\n\\t const target = this.target.rawAttributes[this.foreignKey] || newAttributes[this.foreignKey];\\n\\t this.options.onDelete = this.options.onDelete || (target.allowNull ? 'SET NULL' : 'CASCADE');\\n\\t this.options.onUpdate = this.options.onUpdate || 'CASCADE';\\n\\t }\\n\\n\\t Helpers.addForeignKeyConstraints(this.target.rawAttributes[this.foreignKey], this.source, this.target, this.options);\\n\\n\\t // Sync attributes and setters/getters to Model prototype\\n\\t this.target.refreshAttributes();\\n\\n\\t Helpers.checkNamingCollision(this);\\n\\n\\t return this;\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d47deb45305da2be85db9d984dff8035\",\n \"score\": \"0.4882098\",\n \"text\": \"function addNode() {\\n // veryLastNodeId = lastCreatedNodeId;\\n veryLastNodeId = \\\"1\\\"; //Family node\\n nodeGenerated = generateBox();\\n // createNode(nodeGenerated.node.type, nodeGenerated.node);\\n\\n createNode(\\\"Member\\\", nodeGenerated.node);\\n\\n if(veryLastNodeId != undefined) {\\n edgeGenerated = \\n { \\\"edge\\\" : {\\n \\\"id\\\" : nodeGenerated.node.id + \\\"Edge\\\",\\n \\\"type\\\" : \\\"default\\\",\\n \\\"origin\\\" : veryLastNodeId,\\n \\\"target\\\" : nodeGenerated.node.id,\\n \\\"editorOptions\\\" : { \\\"movable\\\" : false,\\\"editable\\\" : false} \\n }\\n };\\n createEdge(edgeGenerated.edge.type, edgeGenerated.edge);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75fb0db60792fd296141c1ba6f90aeb3\",\n \"score\": \"0.48696604\",\n \"text\": \"static create(attributes) {\\n // synchronous version\\n // let product = new Product(attributes)\\n // this.collection.push(product)\\n // return product\\n // asynchronous version with fetch \\n return fetch(\\\"http://localhost:3000/products\\\", {\\n method: 'POST',\\n headers: {\\n 'Content-Type': 'application/json'\\n },\\n body: JSON.stringify(attributes)\\n })\\n .then(response => response.json())\\n .then(productAttributes => {\\n let product = new Product(productAttributes)\\n this.collection.push(product)\\n return product\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8933dba92ab8be2f42a765ffe1a1d2c\",\n \"score\": \"0.48681355\",\n \"text\": \"async create (modelName, newContents, creator, parent) {\\n const bare = Object.assign(Object.assign({}, newContents), {\\n creator,\\n createdOn: new Date(),\\n acl: {}, // TODO: add initial\\n parent\\n })\\n\\n const out = Pandemonica(bare, abs, await resolveModel(modelName))\\n await out.save()\\n return out\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe2c9c2410fb8188005c7cb0291b9343\",\n \"score\": \"0.48622322\",\n \"text\": \"connectNode(node, command, args) {\\n node.setAttribute(`data-${COMMAND_ATTR}`, command);\\n if (args !== void 0) {\\n node.setAttribute(`data-${ARGS_ATTR}`, JSON.stringify(args));\\n }\\n return node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce9fd373992fc269ffc10a85f488aee9\",\n \"score\": \"0.4856173\",\n \"text\": \"function new_article_category_tree_node(){\\n return {\\n id:[],\\n tag:{},\\n children: {},\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3dc7b54e128c3abc857623289a090e3\",\n \"score\": \"0.4855798\",\n \"text\": \"function NodeWrapper() {\\n this._node = this.constructor.createNode();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"014ba3258148002dc4fe195844bfe7bb\",\n \"score\": \"0.48533535\",\n \"text\": \"function ajaxDSSchemaNode(nsname, nodename, nodetype, nodeForAttr)\\n{\\n\\tthis.nsname = nsname;\\n\\tthis.nodename = nodename;\\n\\tthis.nodetype = nodetype;\\n\\tthis.nodeForAttr = nodeForAttr;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2435373c447a60533026a308f1cc1d24\",\n \"score\": \"0.48523983\",\n \"text\": \"function create(uri, languageId, version, text) {\\n return {\\n uri: uri,\\n languageId: languageId,\\n version: version,\\n text: text\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"963ad4d258751aa1b7f542835178c9d6\",\n \"score\": \"0.4851821\",\n \"text\": \"function createTNode(type, adjustedIndex, tagName, attrs, parent, tViews) {\\n ngDevMode && ngDevMode.tNode++;\\n return {\\n type: type,\\n index: adjustedIndex,\\n flags: 0,\\n tagName: tagName,\\n attrs: attrs,\\n localNames: null,\\n initialInputs: undefined,\\n inputs: undefined,\\n outputs: undefined,\\n tViews: tViews,\\n next: null,\\n child: null,\\n parent: parent,\\n dynamicContainerNode: null,\\n detached: null,\\n stylingTemplate: null,\\n projection: null\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"963ad4d258751aa1b7f542835178c9d6\",\n \"score\": \"0.4851821\",\n \"text\": \"function createTNode(type, adjustedIndex, tagName, attrs, parent, tViews) {\\n ngDevMode && ngDevMode.tNode++;\\n return {\\n type: type,\\n index: adjustedIndex,\\n flags: 0,\\n tagName: tagName,\\n attrs: attrs,\\n localNames: null,\\n initialInputs: undefined,\\n inputs: undefined,\\n outputs: undefined,\\n tViews: tViews,\\n next: null,\\n child: null,\\n parent: parent,\\n dynamicContainerNode: null,\\n detached: null,\\n stylingTemplate: null,\\n projection: null\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"963ad4d258751aa1b7f542835178c9d6\",\n \"score\": \"0.4851821\",\n \"text\": \"function createTNode(type, adjustedIndex, tagName, attrs, parent, tViews) {\\n ngDevMode && ngDevMode.tNode++;\\n return {\\n type: type,\\n index: adjustedIndex,\\n flags: 0,\\n tagName: tagName,\\n attrs: attrs,\\n localNames: null,\\n initialInputs: undefined,\\n inputs: undefined,\\n outputs: undefined,\\n tViews: tViews,\\n next: null,\\n child: null,\\n parent: parent,\\n dynamicContainerNode: null,\\n detached: null,\\n stylingTemplate: null,\\n projection: null\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"963ad4d258751aa1b7f542835178c9d6\",\n \"score\": \"0.4851821\",\n \"text\": \"function createTNode(type, adjustedIndex, tagName, attrs, parent, tViews) {\\n ngDevMode && ngDevMode.tNode++;\\n return {\\n type: type,\\n index: adjustedIndex,\\n flags: 0,\\n tagName: tagName,\\n attrs: attrs,\\n localNames: null,\\n initialInputs: undefined,\\n inputs: undefined,\\n outputs: undefined,\\n tViews: tViews,\\n next: null,\\n child: null,\\n parent: parent,\\n dynamicContainerNode: null,\\n detached: null,\\n stylingTemplate: null,\\n projection: null\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"963ad4d258751aa1b7f542835178c9d6\",\n \"score\": \"0.4851821\",\n \"text\": \"function createTNode(type, adjustedIndex, tagName, attrs, parent, tViews) {\\n ngDevMode && ngDevMode.tNode++;\\n return {\\n type: type,\\n index: adjustedIndex,\\n flags: 0,\\n tagName: tagName,\\n attrs: attrs,\\n localNames: null,\\n initialInputs: undefined,\\n inputs: undefined,\\n outputs: undefined,\\n tViews: tViews,\\n next: null,\\n child: null,\\n parent: parent,\\n dynamicContainerNode: null,\\n detached: null,\\n stylingTemplate: null,\\n projection: null\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c70cf63370fa276a3685e8a8f12ed801\",\n \"score\": \"0.4847024\",\n \"text\": \"@action create(data = null, options = { wait: false }) {\\n let originalAttributes = this.attributes.toJS();\\n let originalRelationships = toJS(this.relationships);\\n let resourceObject = {\\n data: {\\n type: this.type\\n }\\n };\\n\\n if (data && data.attributes) {\\n resourceObject.data.attributes = Object.assign(\\n {},\\n originalAttributes,\\n data.attributes\\n );\\n } else {\\n resourceObject.data.attributes = Object.assign(\\n {}, \\n originalAttributes\\n );\\n }\\n\\n if (data && data.relationships) {\\n resourceObject.data.relationships = Object.assign(\\n {},\\n originalRelationships,\\n data.relationships\\n );\\n } else {\\n resourceObject.data.relationships = Object.assign(\\n {}, \\n originalRelationships\\n );\\n }\\n\\n if (!options.wait) {\\n if (data && data.attributes) {\\n this.setAttributes(data.attributes);\\n }\\n\\n if (data && data.relationships) {\\n this.setRelationships(data.relationships);\\n }\\n } else {\\n this.setRequestLabel('saving', true);\\n }\\n\\n return new Promise((resolve, reject) => {\\n request.post(\\n options.url ? options.url : this.url(), \\n resourceObject\\n )\\n .then((response) => {\\n this.set(response.data);\\n this.setRequestLabel('saving', false);\\n resolve(this, response);\\n })\\n .catch((error) => {\\n if (!options.wait) {\\n this.setAttributes(originalAttributes);\\n this.setRelationships(originalRelationships);\\n }\\n \\n this.setRequestLabel('saving', false);\\n reject(error);\\n });\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99ec6eadef257e20ddd4abaabff85423\",\n \"score\": \"0.48469225\",\n \"text\": \"function makeElement(name, attributes, dest = scene) {\\n const e = document.createElement(`a-${name}`);\\n Object.entries(attributes).forEach(([key, value]) => {\\n e.setAttribute(key, value);\\n });\\n\\n dest.appendChild(e);\\n return e;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aeb54ff88240e357f7792503dc2c08df\",\n \"score\": \"0.48392108\",\n \"text\": \"createNode(value) {\\n return {\\n value: value,\\n next: null\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be0d732bd1b398312853f3e0e78ee54c\",\n \"score\": \"0.48389804\",\n \"text\": \"function NodeWrapper() {\\r\\n\\t this._node = this.constructor.createNode();\\r\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4444a68a01c62985e0b70418cdda95e9\",\n \"score\": \"0.48352927\",\n \"text\": \"function create(name, detail, kind, range, selectionRange, children) {\\n var result = {\\n name: name,\\n detail: detail,\\n kind: kind,\\n range: range,\\n selectionRange: selectionRange\\n };\\n if (children !== undefined) {\\n result.children = children;\\n }\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9020b809b7fc902d94233152c91039fa\",\n \"score\": \"0.48267782\",\n \"text\": \"nodify(data) {\\n return Object.assign(data, this.nodeFactory())\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6e5aac4edb901051e7bfa7054e8f2b5\",\n \"score\": \"0.48260713\",\n \"text\": \"function Node(opts) {\\n this.after = opts.after;\\n this.before = opts.before;\\n this.type = opts.type;\\n this.value = opts.value;\\n this.sourceIndex = opts.sourceIndex;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"210f56feca6694a391cd35d18710ba53\",\n \"score\": \"0.48076925\",\n \"text\": \"function Node(xml){\\r\\n var _this = this;\\r\\n this.id = xml.getAttribute(\\\"id\\\");\\r\\n this.name = xml.getAttribute(\\\"name\\\");\\r\\n \\r\\n var translate = xml.getElementsByTagName(\\\"translate\\\")[0];\\r\\n if (translate) {\\r\\n this.translate = parseFloatArray(translate.firstChild.nodeValue);\\r\\n }\\r\\n var rotates = xml.getElementsByTagName(\\\"rotate\\\");\\r\\n for (var i = 0; i < rotates.length; i++) {\\r\\n var rotate = rotates[i];\\r\\n var sid = rotate.getAttribute(\\\"sid\\\");\\r\\n if (sid == \\\"rotateZ\\\") {\\r\\n this.rotateZ = parseFloatArray(rotate.firstChild.nodeValue);\\r\\n }else if (sid == \\\"rotateY\\\") {\\r\\n this.rotateY = parseFloatArray(rotate.firstChild.nodeValue);\\r\\n }else if (sid == \\\"rotateX\\\") {\\r\\n this.rotateX = parseFloatArray(rotate.firstChild.nodeValue);\\r\\n }\\r\\n }\\r\\n var scale = xml.getElementsByTagName(\\\"scale\\\")[0];\\r\\n if (scale) {\\r\\n this.scale = parseFloatArray(scale.firstChild.nodeValue);\\r\\n }\\r\\n \\r\\n var instance_geometry = xml.getElementsByTagName(\\\"instance_geometry\\\")[0];\\r\\n if (instance_geometry) {\\r\\n var url = instance_geometry.getAttribute(\\\"url\\\");\\r\\n if (url) {\\r\\n this.url = url.replace(\\\"#\\\", \\\"\\\");\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf24d264c10c9849553db155bb284f2a\",\n \"score\": \"0.48022276\",\n \"text\": \"assignNodes(node) {\\n if (Class.resolve(this) !== Class.resolve(node)) {\\n if (node.leftNode !== void 0) {\\n this.attachLeft(node.leftNode);\\n }\\n if (node.nextNode !== void 0) {\\n this.attachNext(node.nextNode);\\n }\\n if (node.rightNode !== void 0) {\\n this.attachRight(node.rightNode);\\n }\\n this.nodeData = {\\n ...node.nodeData,\\n ...this.nodeData\\n };\\n }\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e480af399aefc33b8375be2348bd2d25\",\n \"score\": \"0.47940102\",\n \"text\": \"setAttributes(attributes) {\\n for (const key of Object.keys(attributes)) {\\n this.attributes[key] = attributes[key];\\n }\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f87e98f5ce956e4aa850aa969d16fcca\",\n \"score\": \"0.47880667\",\n \"text\": \"function createAttribute(doc, node, type, val){\\n\\tvar attribute = doc.createAttribute(type);\\n\\tattribute.nodeValue = val;\\n\\tnode.setAttributeNode(attribute);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8313d9774b39d98dffb82b8d1ceb2b3c\",\n \"score\": \"0.4782088\",\n \"text\": \"function cl(node){\\r\\n\\t\\tvar element = document.createElement(node.tagName);\\r\\n\\t\\telement.id = node.id + \\\"-clone\\\";\\r\\n\\t\\telement.className = node.className;\\r\\n\\t\\tfor (var j = 0; j < node.attributes.length; j++) {\\r\\n\\t\\t\\tif (node.attributes[j].specified) {\\r\\n\\t\\t\\t\\tif (node.attributes[j].nodeName.toLowerCase() != \\\"style\\\" \\r\\n\\t\\t\\t\\t\\t&& node.attributes[j].nodeName.toLowerCase() != \\\"edited\\\" \\r\\n\\t\\t\\t\\t\\t&& node.attributes[j].nodeName.toLowerCase() != \\\"contenteditable\\\"\\r\\n\\t\\t\\t\\t\\t&& node.attributes[j].nodeName.toLowerCase() != \\\"id\\\"\\r\\n\\t\\t\\t\\t\\t&& node.attributes[j].nodeName.toLowerCase() != \\\"class\\\"\\r\\n\\t\\t\\t\\t){\\r\\n\\t\\t\\t\\t\\telement.setAttribute(node.attributes[j].nodeName.toLowerCase(), node.attributes[j].nodeValue);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn element;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8313d9774b39d98dffb82b8d1ceb2b3c\",\n \"score\": \"0.4782088\",\n \"text\": \"function cl(node){\\r\\n\\t\\tvar element = document.createElement(node.tagName);\\r\\n\\t\\telement.id = node.id + \\\"-clone\\\";\\r\\n\\t\\telement.className = node.className;\\r\\n\\t\\tfor (var j = 0; j < node.attributes.length; j++) {\\r\\n\\t\\t\\tif (node.attributes[j].specified) {\\r\\n\\t\\t\\t\\tif (node.attributes[j].nodeName.toLowerCase() != \\\"style\\\" \\r\\n\\t\\t\\t\\t\\t&& node.attributes[j].nodeName.toLowerCase() != \\\"edited\\\" \\r\\n\\t\\t\\t\\t\\t&& node.attributes[j].nodeName.toLowerCase() != \\\"contenteditable\\\"\\r\\n\\t\\t\\t\\t\\t&& node.attributes[j].nodeName.toLowerCase() != \\\"id\\\"\\r\\n\\t\\t\\t\\t\\t&& node.attributes[j].nodeName.toLowerCase() != \\\"class\\\"\\r\\n\\t\\t\\t\\t){\\r\\n\\t\\t\\t\\t\\telement.setAttribute(node.attributes[j].nodeName.toLowerCase(), node.attributes[j].nodeValue);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn element;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"571157dbcc45626e6eb6d9e159322d51\",\n \"score\": \"0.4773645\",\n \"text\": \"function dom(name, attributes) {\\n\\tvar node = document.createElement(name);\\n\\tif (attributes) {\\n\\t\\tforEachIn(attributes, function(name, value) {\\n\\t\\t\\tsetNodeAttribute(node, name, value);\\n\\t\\t\\t/**\\n\\t\\t\\t * the forEachIn function uses attributes as object and calls the action\\n\\t\\t\\t * using object and object[property], so object[property] is where the value of the\\n\\t\\t\\t * attribute to set comes from.\\n\\t\\t\\t * Furthermore the forEachIn function is able to use the second argument of the dom function an \\n\\t\\t\\t * object containing the attributes of the node.\\n\\t\\t\\t * */\\n\\n\\t\\t});\\n\\t}\\n\\tfor (var i = 2; i < arguments.length; i++) {\\n\\t\\tvar child = arguments[i];\\n\\t\\tif (typeof child == \\\"string\\\")\\n\\t\\t\\tchild = document.createTextNode(child);\\n\\t\\tnode.appendChild(child);\\n\\t}\\n\\treturn node;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc8e08d49526e95f5585371bf0db1e90\",\n \"score\": \"0.477162\",\n \"text\": \"function changeXmlNodeType(node, tag, attributes)\\n{\\n\\t// Find the root (actually the document, not the root node. Who's counting?)\\n\\t// We create based on this XML document to ensure we have the right namespace\\n\\tvar root = rootNode(node);\\n\\tvar ns = namespace(node);\\n\\n\\t// Create a new node of the desired type\\n\\tvar newNode = root.createElementNS(ns, tag);\\n\\n\\t// Set the desired attributes on the new node\\n\\tattributes && _.each(attributes, function(val, key) {\\n\\t\\tnewNode.setAttribute(key, val);\\n\\t});\\n\\n\\t// Transfer all children from the old node to the new\\n\\twhile(node.childNodes.length)\\n\\t\\tnewNode.appendChild(node.childNodes[0]);\\n\\n\\t// Replace the old node with the new\\n\\tnode.parentNode.replaceChild(newNode, node);\\n\\n\\t// Return the new node in case the caller needs to perform further operations on it\\n\\treturn newNode;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e29df195c1d4168c4468e274c3c3adf2\",\n \"score\": \"0.4767753\",\n \"text\": \"createInstance (resourceName, attrs, options) {\\n let definition = this.definitions[resourceName]\\n let item\\n\\n attrs = attrs || {}\\n\\n if (!definition) {\\n throw new NER(resourceName)\\n } else if (attrs && !DSUtils.isObject(attrs)) {\\n throw new IA('\\\"attrs\\\" must be an object!')\\n }\\n\\n options = DSUtils._(definition, options)\\n\\n const relationList = definition.relationList || []\\n if (relationList.length) {\\n DSUtils.forEach(relationList, function (def) {\\n const relationData = DSUtils.get(attrs, def.localField)\\n if (relationData) {\\n if (DSUtils.isArray(relationData)) {\\n const array = []\\n const Resource = definition.getResource(def.relation)\\n const _options = options.orig()\\n DSUtils.forEach(relationData, function (relationDataItem) {\\n array.push(Resource.createInstance(relationDataItem, _options))\\n })\\n DSUtils.set(attrs, def.localField, array)\\n } else if (DSUtils.isObject(relationData)) {\\n DSUtils.set(attrs, def.localField, definition.getResource(def.relation).createInstance(relationData, options.orig()))\\n }\\n }\\n })\\n }\\n\\n options.logFn('createInstance', attrs, options)\\n\\n // lifecycle\\n options.beforeCreateInstance(options, attrs)\\n\\n // grab instance constructor function from Resource definition\\n let Constructor = definition[definition.class]\\n\\n // create instance\\n item = new Constructor()\\n\\n if (definition.instanceEvents) {\\n DSUtils.Events(item)\\n }\\n\\n // add default values\\n if (options.defaultValues) {\\n DSUtils.deepMixIn(item, DSUtils.copy(options.defaultValues))\\n }\\n DSUtils.deepMixIn(item, attrs)\\n\\n // compute computed properties\\n if (definition.computed) {\\n definition.compute(item)\\n }\\n // lifecycle\\n options.afterCreateInstance(options, item)\\n return item\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":68,"cells":{"query_id":{"kind":"string","value":"decb3823ea9d53ab355b97675829d143"},"query":{"kind":"string","value":"1. Draw the image data onto offscreen buffer 2. Draw buffer to canvas at zoom level"},"positive_passages":{"kind":"list like","value":[{"docid":"db73486f235926182a6e4c747760f0c4","score":"0.6300846","text":"function updateBuffer() {\n\toffscreen.width = canvasWidth;\n\toffscreen.height = canvasHeight;\n\n\tvar imgdata = offscreenCtx.getImageData(0, 0, canvasWidth, canvasHeight);\n\tvar color;\n\tvar pixel;\n\tvar index;\n\tvar data = imgdata.data;\n\tvar coord;\n\tvar owner = mypixelsSelected && me.userID;\n\n\t//loop over board\n\tfor(var pos in board) {\n\t\tpixel = board[pos];\n\t\t//skip if only drawing owner\n\t\tif(owner && pixel.owner != owner) continue;\n\t\t\n\t\tcoord = pos.split(\",\");\n if(coord.length !== 2) continue;\n\n\t\tindex = (coord[1] * canvasWidth + (+coord[0])) * 4;\n\t\tcolor = pixel.color;\n\t\t\n\t\tdata[index] = parseInt(color.substr(0, 2), 16); //red\n\t\tdata[++index] = parseInt(color.substr(2, 2), 16); // green\n\t\tdata[++index] = parseInt(color.substr(4, 2), 16); // blue\n\t\tdata[++index] = 255;\n\t}\n\t\n\t//loop over selected pixels\n\tfor(var pos in pixels) {\n\t\tpixel = board[pos];\n\t\tif(owner && !pixel) continue;\n\t\tif(owner && pixel.owner != owner) continue;\n\t\t\n\t\tcoord = pos.split(\",\");\n\t\tif(coord.length !== 2) continue;\n\n\t\tindex = (coord[1] * canvasWidth + (+coord[0])) * 4;\n\n\t\tvar sr = parseInt(selectColorHex.substr(0, 2), 16),\n\t\t\tsg = parseInt(selectColorHex.substr(2, 2), 16),\n\t\t\tsb = parseInt(selectColorHex.substr(4, 2), 16);\n\n\t\tif(!pixel) {\n\t\t\tdata[ index] = sr; //red\n\t\t\tdata[++index] = sg; // green\n\t\t\tdata[++index] = sb; // blue\n\t\t\tdata[++index] = 127;\n\t\t} else {\n\t\t\tvar other = pixel.color;\n\t\t\tvar r = parseInt(other.substr(0, 2), 16) / 255;\n\t\t\tvar g = parseInt(other.substr(2, 2), 16) / 255;\n\t\t\tvar b = parseInt(other.substr(4, 2), 16) / 255;\n\t\t\tsr /= 255;\n\t\t\tsg /= 255;\n\t\t\tsb /= 255;\n\n\t\t\tdata[ index] = ((r * .5 + sr * .5) * 255) | 0;\n\t\t\tdata[++index] = ((g * .5 + sg * .5) * 255) | 0;\n\t\t\tdata[++index] = ((b * .5 + sb * .5) * 255) | 0;\n\t\t\tdata[++index] = 255;\n\t\t}\n\t\t\n\t}\n\n\toffscreenCtx.putImageData(imgdata, 0, 0);\n\tdirtyBuffer = false;\n}","title":""}],"string":"[\n {\n \"docid\": \"db73486f235926182a6e4c747760f0c4\",\n \"score\": \"0.6300846\",\n \"text\": \"function updateBuffer() {\\n\\toffscreen.width = canvasWidth;\\n\\toffscreen.height = canvasHeight;\\n\\n\\tvar imgdata = offscreenCtx.getImageData(0, 0, canvasWidth, canvasHeight);\\n\\tvar color;\\n\\tvar pixel;\\n\\tvar index;\\n\\tvar data = imgdata.data;\\n\\tvar coord;\\n\\tvar owner = mypixelsSelected && me.userID;\\n\\n\\t//loop over board\\n\\tfor(var pos in board) {\\n\\t\\tpixel = board[pos];\\n\\t\\t//skip if only drawing owner\\n\\t\\tif(owner && pixel.owner != owner) continue;\\n\\t\\t\\n\\t\\tcoord = pos.split(\\\",\\\");\\n if(coord.length !== 2) continue;\\n\\n\\t\\tindex = (coord[1] * canvasWidth + (+coord[0])) * 4;\\n\\t\\tcolor = pixel.color;\\n\\t\\t\\n\\t\\tdata[index] = parseInt(color.substr(0, 2), 16); //red\\n\\t\\tdata[++index] = parseInt(color.substr(2, 2), 16); // green\\n\\t\\tdata[++index] = parseInt(color.substr(4, 2), 16); // blue\\n\\t\\tdata[++index] = 255;\\n\\t}\\n\\t\\n\\t//loop over selected pixels\\n\\tfor(var pos in pixels) {\\n\\t\\tpixel = board[pos];\\n\\t\\tif(owner && !pixel) continue;\\n\\t\\tif(owner && pixel.owner != owner) continue;\\n\\t\\t\\n\\t\\tcoord = pos.split(\\\",\\\");\\n\\t\\tif(coord.length !== 2) continue;\\n\\n\\t\\tindex = (coord[1] * canvasWidth + (+coord[0])) * 4;\\n\\n\\t\\tvar sr = parseInt(selectColorHex.substr(0, 2), 16),\\n\\t\\t\\tsg = parseInt(selectColorHex.substr(2, 2), 16),\\n\\t\\t\\tsb = parseInt(selectColorHex.substr(4, 2), 16);\\n\\n\\t\\tif(!pixel) {\\n\\t\\t\\tdata[ index] = sr; //red\\n\\t\\t\\tdata[++index] = sg; // green\\n\\t\\t\\tdata[++index] = sb; // blue\\n\\t\\t\\tdata[++index] = 127;\\n\\t\\t} else {\\n\\t\\t\\tvar other = pixel.color;\\n\\t\\t\\tvar r = parseInt(other.substr(0, 2), 16) / 255;\\n\\t\\t\\tvar g = parseInt(other.substr(2, 2), 16) / 255;\\n\\t\\t\\tvar b = parseInt(other.substr(4, 2), 16) / 255;\\n\\t\\t\\tsr /= 255;\\n\\t\\t\\tsg /= 255;\\n\\t\\t\\tsb /= 255;\\n\\n\\t\\t\\tdata[ index] = ((r * .5 + sr * .5) * 255) | 0;\\n\\t\\t\\tdata[++index] = ((g * .5 + sg * .5) * 255) | 0;\\n\\t\\t\\tdata[++index] = ((b * .5 + sb * .5) * 255) | 0;\\n\\t\\t\\tdata[++index] = 255;\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\n\\toffscreenCtx.putImageData(imgdata, 0, 0);\\n\\tdirtyBuffer = false;\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"2630d8bc28c8735c9ed296f6a319091e","score":"0.66202974","text":"function render() {//used in run():271\n requestAnimationFrame(render);\n\n lHis && lHis.style(\"display\", setting.showHistogram ? null : \"none\");\n lLeg && lLeg.style(\"display\", setting.showCountExt ? null : \"none\");\n\n if (valid) return;\n\n valid = true;\n\n ctx.save();\n ctx.clearRect(0, 0, _w, _h);\n\n redrawCanvas();//:618\n\n ctx.drawImage(bufCanvas, 0, 0);\n ctx.restore();\n\n valid = false;\n\n // console.log(\"rendered!\");\n }","title":""},{"docid":"7bb531dbad4b57442d86c93c02a2e7b9","score":"0.6546924","text":"function update_spectrum() {\n\n if (!windowLeft)\n requestAnimationFrame(update_spectrum);\n\n spec_now = performance.now();\n spec_elapsed = spec_now - spec_then;\n\n //if (spec_elapsed > fpsInterval)\n {\n spec_then = spec_now - (spec_elapsed % fpsInterval);\n //console.log(\"spectrum interval: \" + spec_elapsed.toFixed(3) + \" [ms]\", \"fps = \", Math.round(1000 / spec_elapsed)) ;\n\n //image\n try {\n let data = image_stack.pop();\n image_stack = [];\n\n ctx.clearRect(data.px, data.py, data.zoomed_size, data.zoomed_size);\n\n var imageCanvas;\n\n if (composite_view)\n imageCanvas = compositeCanvas;\n else\n imageCanvas = imageContainer[va_count - 1].imageCanvas;//if composite_view use compositeCanvas\n\n if (zoom_shape == \"square\") {\n ctx.fillStyle = \"rgba(0,0,0,0.3)\";\n ctx.fillRect(data.px, data.py, data.zoomed_size, data.zoomed_size);\n\n ctx.drawImage(imageCanvas, data.x - data.clipSize, data.y - data.clipSize, 2 * data.clipSize + 1, 2 * data.clipSize + 1, data.px, data.py, data.zoomed_size, data.zoomed_size);\n }\n\n if (zoom_shape == \"circle\") {\n ctx.save();\n ctx.beginPath();\n ctx.arc(data.px + data.zoomed_size / 2, data.py + data.zoomed_size / 2, data.zoomed_size / 2, 0, 2 * Math.PI, true);\n\n ctx.fillStyle = \"rgba(0,0,0,0.3)\";\n ctx.fill();\n\n ctx.closePath();\n ctx.clip();\n ctx.drawImage(imageCanvas, data.x - data.clipSize, data.y - data.clipSize, 2 * data.clipSize + 1, 2 * data.clipSize + 1, data.px, data.py, data.zoomed_size, data.zoomed_size);\n ctx.restore();\n }\n }\n catch (e) {\n //console.log(e) ;\n }\n\n //spectrum\n try {\n let go_ahead = true;\n let new_seq_id = 0;\n\n for (let index = 0; index < va_count; index++) {\n let len = spectrum_stack[index].length;\n\n if (len > 0) {\n let id = spectrum_stack[index][len - 1].id;\n\n if (id <= last_seq_id)\n go_ahead = false;\n else\n new_seq_id = Math.max(new_seq_id, id);\n }\n else\n go_ahead = false;\n }\n\n if (go_ahead) {\n last_seq_id = new_seq_id;\n console.log(\"last_seq_id:\", last_seq_id);\n\n //pop all <va_count> spectrum stacks\n var data = [];\n\n for (let index = 0; index < va_count; index++) {\n data.push(spectrum_stack[index].pop().spectrum);\n spectrum_stack[index] = [];\n }\n\n plot_spectrum(data);\n replot_y_axis();\n\n last_spectrum = data;\n }\n\n }\n catch (e) {\n console.log(e);\n }\n\n }\n }","title":""},{"docid":"988d067ea30d7e3e74f15ea22a6d534e","score":"0.6491379","text":"drawImage(canvas, canvasSize, level, window, maskVisibility, maskColours) {\n\t//console.log(\"draw\", level, window)\n\t// Get the dimensions\n\tvar height = this.data.length\n\tvar width = this.data[0].length\n\tvar pixHeight = this.pixHeight\n\tvar pixWidth = this.pixWidth\n\t\n\tvar size = canvasSize\n\tif (height > width) {\n\t // Calculate unscaled height\n\t var actualSize = height*pixHeight\n\t \n\t // Size the canvas correctly\n\t var scale = size/actualSize\n\t this.scale = scale\n\t canvas.height = size\n\t canvas.width = width * pixWidth * scale\n\t}\n\telse {\n\t // Calc unscaled width\n\t var actualSize = width*pixWidth\n\t // Size canvas\n\t var scale = size/actualSize\n\t this.scale = scale\n\t canvas.width = size\n\t canvas.height = height*pixHeight*scale\n\t}\n\n\t// Clear the canvas\n\tvar ctx = canvas.getContext(\"2d\")\n\tctx.clearRect(0, 0, width*scale, height*scale);\n\t// Draw the image\n\tif (this.preRender !== null && this.preRenderLevel === level\n\t && this.preRenderWindow === window) {\n\t ctx.drawImage(this.preRender, 0, 0)\n\t}\n\telse {\n\t this.drawImageOnly(canvas, canvasSize, level, window, maskVisibility, maskColours)\n\t}\n\t// Draw the image onto the canvas\n\tfor (var row = 0; row < height; row++) {\n\t for (var col = 0; col < width; col++) { \n\t\tfor (var i = 0; i < this.masks.length; i++) {\n\t\t if (maskVisibility[i] === false) {\n\t\t\tcontinue\n\t\t }\n\t\t if (this.currentMask === i) {\n\t\t\tvar mask = this.tempMask\n\t\t }\n\t\t else {\n\t\t\tvar mask = this.masks[i]\n\t\t }\n\t\t if (row > 0 && mask[row][col] !== mask[row - 1][col]) {\n\t\t\tif (mask[row][col] !== 0) {\n\t\t\t // Set the color to the one specified\n\t\t\t ctx.fillStyle = maskColours[i][mask[row][col] - 1]; \n\t\t\t ctx.fillRect(Math.floor(col * pixWidth * scale), Math.floor(row * pixHeight*scale), Math.ceil(pixWidth*scale), Math.ceil(0.33*pixHeight*scale));\n\t\t\t}\n\n\t\t\tif (mask[row - 1][col] !== 0) {\n\t\t\t ctx.fillStyle = maskColours[i][mask[row - 1][col] - 1];\n\t\t\t ctx.fillRect(Math.floor(col * pixWidth * scale), Math.floor((row-0.33) * pixHeight*scale), Math.ceil(pixWidth*scale), Math.ceil(0.33*pixHeight*scale));\n\t\t\t}\n\t\t }\n\n\t\t if (col > 0 && mask[row][col] !== mask[row][col - 1]) {\n\t\t\tif (mask[row][col] !== 0) {\n\t\t\t ctx.fillStyle = maskColours[i][mask[row][col] - 1]; \n\t\t\t ctx.fillRect(Math.floor(col * pixWidth * scale), Math.floor(row * pixHeight*scale), Math.ceil(0.33*pixWidth*scale), Math.ceil(pixHeight*scale));\n\t\t\t}\n\t\t\tif (mask[row][col - 1] !== 0) {\n\t\t\t ctx.fillStyle = maskColours[i][mask[row][col - 1] - 1]; \n\t\t\t ctx.fillRect(Math.floor((col-0.33) * pixWidth * scale), Math.floor(row * pixHeight*scale), Math.ceil(0.33*pixWidth*scale), Math.ceil(pixHeight*scale));\n\t\t\t}\n\t\t }\n\t\t}\n\t }\n\t}\n\tthis.boundingRect[1] = this.rowToCoord(this.boundingRectPix[1])\n\tthis.boundingRect[3] = this.rowToCoord(this.boundingRectPix[3])\n\tthis.boundingRect[0] = this.colToCoord(this.boundingRectPix[0])\n\tthis.boundingRect[2] = this.colToCoord(this.boundingRectPix[2])\n\tctx.beginPath();\n\tctx.rect(this.boundingRect[0],\n\t\t this.boundingRect[1],\n\t\t this.boundingRect[2] - this.boundingRect[0],// * (pixWidth * scale),\n\t\t this.boundingRect[3] - this.boundingRect[1])\n\tctx.lineWidth = 3\n\tctx.strokeStyle = 'yellow';\n\tctx.stroke()\n }","title":""},{"docid":"08383a6efbdacedf1475ae2f12976aab","score":"0.6488885","text":"draw(ctx) {\n const smoothing = this.ctx.imageSmoothingEnabled\n ctx.imageSmoothingEnabled = this.useImageSmoothing\n this.ctx.putImageData(this.imageData, 0, 0)\n // this.updateCanvas()\n util.fillCtxWithImage(ctx, this.ctx.canvas)\n ctx.imageSmoothingEnabled = smoothing\n }","title":""},{"docid":"903cc3c263665d2894bf082297ae17b7","score":"0.6474566","text":"_fillMipMap() {\n var ctx = this.canvas.getContext('2d');\n\n // First zoom-level comes from the image\n var to = this.coordinates[0];\n ctx.drawImage(this.image, to[0], to[1], to[2], to[3]);\n\n // The rest are copy actions internal to the canvas/context\n for (let iterations = 1; iterations < this.NUM_ITERATIONS; iterations++) {\n let from = this.coordinates[iterations - 1];\n let to = this.coordinates[iterations];\n\n ctx.drawImage(this.canvas,\n from[0], from[1], from[2], from[3],\n to[0], to[1], to[2], to[3]\n );\n }\n }","title":""},{"docid":"eb145e0e4ba898867a28ac5ca010b145","score":"0.64403844","text":"_fillMipMap() {\n const ctx = this.canvas.getContext(\"2d\");\n\n // First zoom-level comes from the image\n const to = this.coordinates[0];\n ctx.drawImage(this.image, to[0], to[1], to[2], to[3]);\n\n // The rest are copy actions internal to the canvas/context\n for (let iterations = 1; iterations < this.NUM_ITERATIONS; iterations++) {\n const from = this.coordinates[iterations - 1];\n const to = this.coordinates[iterations];\n\n ctx.drawImage(\n this.canvas,\n from[0],\n from[1],\n from[2],\n from[3],\n to[0],\n to[1],\n to[2],\n to[3]\n );\n }\n }","title":""},{"docid":"b3898c71b1ac81e50f8a504723b24ede","score":"0.64184576","text":"function drawImage(canvas) {\n\t // canvas is a d3 selection.\n\t //var plotdata = canvas.data()[0];\n\t var maxColorIndex = 255,\n\t overflowIndex = 256,\n\t context = canvas.node().getContext(\"2d\"),\n\t ctx = backing_canvas.getContext(\"2d\");\n\n\t if (_redraw_backing) {\n\t _redraw_backing = false;\n\t var height = source_data.length,\n\t width = source_data[0].length;\n\t if (backing_image == null || backing_canvas.width != width || backing_canvas.height != height) {\n\t backing_canvas.width = width;\n\t backing_canvas.height = height;\n\t backing_image = ctx.createImageData(width, height);\n\t }\n\t var data = backing_image.data;\n\t var yp,\n\t pp = 0;\n\t for (var yt = 0, p = -1; yt < height; ++yt) {\n\t yp = dims.ydim - 1 - yt; // y-axis starts at the top!\n\t for (var xp = 0; xp < width; ++xp, pp++) {\n\t var c = _colormap_array[plotdata[pp]];\n\t data[++p] = c.r;\n\t data[++p] = c.g;\n\t data[++p] = c.b;\n\t data[++p] = c.a;\n\t }\n\t }\n\t ctx.putImageData(backing_image, 0, 0);\n\t }\n\n\t //context.mozImageSmoothingEnabled = false;\n\t //context.webkitImageSmoothingEnabled = false;\n\t //context.msImageSmoothingEnabled = false;\n\t //context.imageSmoothingEnabled = false;\n\n\n\t context.clearRect(0, 0, context.canvas.width, context.canvas.height);\n\t if (context.mozImageSmoothingEnabled) context.mozImageSmoothingEnabled = false;\n\t if (context.imageSmoothingEnabled) context.imageSmoothingEnabled = false;\n\t if (context.msImageSmoothingEnabled) context.msImageSmoothingEnabled = false;\n\t if (context.webkitImageSmoothingEnabled) context.webkitImageSmoothingEnabled = false;\n\t var sxdx = get_sxdx();\n\t context.drawImage(ctx.canvas, sxdx.sx, sxdx.sy, sxdx.sw, sxdx.sh, sxdx.dx, sxdx.dy, sxdx.dw, sxdx.dh);\n\t }","title":""},{"docid":"44e4e1da9f8e49af0bfc86bf334e43ec","score":"0.6397034","text":"function render(){\n var start = Date.now();\n\n for (var i = 0; i <= canvas.width; i++){\n for (var j = 0; j <= canvas.height; j++){\n var ray = camera.castRay(i, j);\n setPixel(i, j, trace(ray, scene.bounce_depth) );\n }\n }\n\n //carica immagine calcolata\n context.putImageData(imageBuffer,0,0);\n\n var end = Date.now();\n $('#log').html(\"rendered in: \"+(end-start)+\"ms\");\n console.log(\"rendered in: \"+(end-start)+\"ms\");\n\n}","title":""},{"docid":"c8c9a1ad46f72f78002a0bf35078ea1c","score":"0.6391222","text":"updateCanvas() {\n this.shootAreaCtx.putImageData(this.shootAreaData, 0, 0);\n }","title":""},{"docid":"384a81d8c891c9f9a85110558b0d2f4d","score":"0.6380239","text":"function drawPixelated(img,context,zoom,x,y){\n if (!zoom) zoom=4; if (!x) x=0; if (!y) y=0;\n if (!img.id) img.id = \"__img\"+(drawPixelated.lastImageId++);\n var idata = drawPixelated.idataById[img.id];\n if (!idata){\n var ctx = document.createElement('canvas').getContext('2d');\n ctx.width = img.width;\n ctx.height = img.height;\n ctx.drawImage(img,0,0);\n idata = drawPixelated.idataById[img.id] = ctx.getImageData(0,0,img.width,img.height).data;\n }\n for (var x2=0;x2<img.width;++x2){\n for (var y2=0;y2<img.height;++y2){\n var i=(y2*img.width+x2)*4;\n var r=idata[i ];\n var g=idata[i+1];\n var b=idata[i+2];\n var a=idata[i+3];\n context.fillStyle = \"rgba(\"+r+\",\"+g+\",\"+b+\",\"+(a/255)+\")\";\n context.fillRect(x+x2*zoom, y+y2*zoom, zoom, zoom);\n }\n }\n}","title":""},{"docid":"bc71d73016587d246b054af8f9e9bacb","score":"0.63600194","text":"drawBuffer() {\n const nominalWidth = Math.round(\n this.getDuration() *\n this.params.minPxPerSec *\n this.params.pixelRatio\n );\n const parentWidth = this.drawer.getWidth();\n let width = nominalWidth;\n let start = this.drawer.getScrollX();\n let end = Math.max(start + parentWidth, width);\n // Fill container\n if (\n this.params.fillParent &&\n (!this.params.scrollParent || nominalWidth < parentWidth)\n ) {\n width = parentWidth;\n start = 0;\n end = width;\n }\n\n let peaks;\n peaks = this.backend.getPeaks(width, start, end);\n this.drawer.drawPeaks(peaks, width, start, end);\n this.fireEvent('redraw', peaks, width);\n }","title":""},{"docid":"049a85a5ce2971b79c4fdcb1453f3833","score":"0.6356626","text":"fitToScreen() {\n var rect = this.getRectofPoints(this.points);\n var rateX = 0, rateY = 0;\n this.wx = 0;\n this.wy = 0;\n rateX = (this.canvas.width-20)/(rect.xMax-rect.xMin);\n rateY = (this.canvas.height-20)/(rect.yMax-rect.yMin);\n if(rateX > rateY) {\n this.scale = 1 * rateY;\n }\n else {\n this.scale = 1 * rateX;\n }\n this.wx = (this.zoomedX(rect.xMin)-(this.canvas.width-this.zoomedX(rect.xMax)+this.zoomedX(rect.xMin))/2)/this.scale; // world zoom origin\n this.wy = (this.zoomedY(rect.yMin)-(this.canvas.height-this.zoomedY(rect.yMax)+this.zoomedY(rect.yMin))/2)/this.scale;\n this.drawLine();\n }","title":""},{"docid":"d4d1c473e46766e04d475426bbb57b47","score":"0.6347767","text":"function takeScreenshot(){\n\tif(!gl){return;}\n\tgl.bindFramebuffer(gl.FRAMEBUFFER, framebuffer);\n\trender(1);\nvar ddd1 = new Date().getTime();\n\n\tvar offscreenView = new Uint8Array(offscreenRenderWidth*offscreenRenderHeight*4);\nvar ddd2 = new Date().getTime();\nconsole.log((ddd2-ddd1));\t\n\tgl.readPixels(0,0,offscreenRenderWidth,offscreenRenderHeight,gl.RGBA,gl.UNSIGNED_BYTE,offscreenView);\nvar ddd3 = new Date().getTime();\nconsole.log(\"readpixels: \"+(ddd3-ddd2));\t\n\tgl.bindFramebuffer(gl.FRAMEBUFFER, null);\n\trender(0);\nvar ddd4 = new Date().getTime();\nconsole.log((ddd4-ddd3));\n\t//omzetten naar bmp\nvar cnvs=document.getElementById(\"canvasOffscreenHelper\");\t\n\t$('#canvasOffscreenHelper').attr('width',offscreenRenderWidth);\n\t$('#canvasOffscreenHelper').attr('height',offscreenRenderHeight);\n\tvar ctxt=cnvs.getContext(\"2d\");\n\tvar imgData=ctxt.createImageData(offscreenRenderWidth,offscreenRenderHeight);\nvar ddd5 = new Date().getTime();\nconsole.log((ddd5-ddd4));\n\tfor(var i=0;i<offscreenRenderHeight;i+=1){\t\t\t\t\t\t\t//put arraybuffer content in canvas, flipped vertically\n\t\tfor(var j=0;j<=4*offscreenRenderWidth-4;j=j+1){\n\t\t\timgData.data[j+i*4*offscreenRenderWidth]=offscreenView[j-i*4*offscreenRenderWidth+4*offscreenRenderWidth*offscreenRenderHeight];\n\t\t}\n \t}\nvar ddd6 = new Date().getTime();\nconsole.log((ddd6-ddd5));\n\tctxt.putImageData(imgData,0,0);\n\tvar img = cnvs.toDataURL(\"image/jpeg\");;\n\tdocument.getElementById(\"imgOffscreenHelper\").src=img;\n\tdocument.getElementById(\"aOffscreenHelper\").href = img;\n\tdocument.getElementById(\"aOffscreenHelper\").download=document.getElementById(\"inputOffscreenName\").value+\".jpeg\";\n \n\tvar clickEvent = document.createEvent(\"MouseEvent\");\n\tclickEvent.initMouseEvent(\"click\", true, true, window, 0, 0, 0, 0, 0, false, false, false, false, 0, null); \n\tdocument.getElementById(\"aOffscreenHelper\").dispatchEvent(clickEvent);\n\n\tconsole.log(\"done taking screenshot\");\n\t\n\treturn img;\n\t\tvar ddd7 = new Date().getTime();\n\nconsole.log((ddd7-ddd6));\n}","title":""},{"docid":"3ecc06b76b87aa7e363f56a8cbe36df8","score":"0.63405704","text":"function startRender() {\n\tlet v4 = viewWidth / 2;\n\tlet h4 = v4 * heightToWidthRatio;\n\tmandelBitmap.render(curCR - v4, curCI + h4,\n\t\tcurCR + v4, curCI - h4);\n\n\tlet zoomLevel = Math.pow(zoomFactor, curZoom);\n\tzoomText.innerHTML = zoomLevel;\n}","title":""},{"docid":"cc748b66a2f040b49c54db5cb20d6381","score":"0.6309445","text":"function updateCanvas() {\n ctx.putImageData(canvasData, 0, 0);\n}","title":""},{"docid":"985ad0aef7e6916e81305cbef69e1cd8","score":"0.62963384","text":"function cw_drawScreen() {\n ctx.clearRect(0, 0, canvas.width, canvas.height);\n ctx.save();\n cw_setCameraPosition();\n ctx.translate(200 - (camera_x * zoom), 200 + (camera_y * zoom));\n ctx.scale(zoom, -zoom);\n cw_drawFloor();\n ghost_draw_frame(ctx, ghost);\n cw_drawCars();\n ctx.restore();\n}","title":""},{"docid":"dcbb2d49e2b20d59a3fdb55dc4a48ee3","score":"0.62800926","text":"function doRedraw() {\n\n doClearScreen(false);\n\n var lowerFrameStart = visibleWidth * canvasCharacterHeight; // redrawX + visibleXStart\n \n if (canvases==1) {\n\t\t\n var sx = visibleXStart * canvasCharacterWidth; // The x coordinate of the upper left corner of the rectangle from which the ImageData will be extracted.\n var sy = (visibleHeight + visibleYStart + 1) * canvasCharacterHeight; // The y coordinate of the upper left corner of the rectangle from which the ImageData will be extracted.\n var sw = (visibleWidth) * canvasCharacterWidth; // The width of the rectangle from which the ImageData will be extracted.\n var sh = (visibleHeight - 1) * canvasCharacterHeight; // The height of the rectangle from which the ImageData will be extracted. \n //console.log(\"sx: \"+sx+\" sy: \"+sy+\" sw: \"+sw+\" sh: \"+sh);\n var imgData = ctx.getImageData(sx, sy, sw, sh);\n ctx.putImageData(imgData, 0, 0);\n \n } else {\n var sx = visibleXStart * canvasCharacterWidth; // The x coordinate of the upper left corner of the rectangle from which the ImageData will be extracted.\n var sy = ( visibleYStart ) * canvasCharacterHeight; // The y coordinate of the upper left corner of the rectangle from which the ImageData will be extracted.\n var sw = (visibleWidth) * canvasCharacterWidth; // The width of the rectangle from which the ImageData will be extracted.\n var sh = (visibleHeight - 1) * canvasCharacterHeight; // The height of the rectangle from which the ImageData will be extracted. \n //console.log(\"sx: \"+sx+\" sy: \"+sy+\" sw: \"+sw+\" sh: \"+sh);\n var imgData = ctx2.getImageData(sx, sy, sw, sh);\n ctx.putImageData(imgData, 0, 0);\n \n }\n\n updateScrollbarX(true, 0); // draw the scrollbar at the bottom, x position = 0 \n updateScrollbarY(true, 0); // Show a part of the scrollbar again\n //\talert(sx+\"==\"+sy+\"==\"+sw+\"==\"+sh)\n}","title":""},{"docid":"de9695d9bc964b082de802eb445c8aac","score":"0.62595356","text":"function redrawCanvas() {//used in render():890\n\n bufCtx.save();\n bufCtx.clearRect(0, 0, _w, _h);\n\n if (setting.blendingLighter && bufCtx.globalCompositeOperation == 'source-over') {\n bufCtx.globalCompositeOperation = 'lighter';\n //darker\n }\n else if (!setting.blendingLighter && bufCtx.globalCompositeOperation == 'lighter') {\n bufCtx.globalCompositeOperation = 'source-over';\n }\n\n bufCtx.translate(lastEvent.translate[0], lastEvent.translate[1]);\n bufCtx.scale(lastEvent.scale, lastEvent.scale);\n\n var n, l, i, j,\n src, trg,\n iw, ih,\n img,\n d, beg,\n c, x, y, s;\n\n\n if (setting.showEdge || selected){\n n = links.entries();\n if (!setting.showEdge)\n n = n.filter(function(d) {\n return d.key.indexOf(selected.id) >= 0;\n });\n\n l = n.length;\n\n bufCtx.save();\n bufCtx.lineCap=\"round\";\n bufCtx.lineJoin=\"round\";\n\n while(--l > -1) {\n d = n[l].value;\n src = d.source;\n trg = d.target;\n j = src.type == typeNode.child;\n\n c = curColor(j ? src : trg);\n\n bufCtx.beginPath();\n bufCtx.strokeStyle = c.toString();\n bufCtx.lineWidth = (radius(nr(d)) * 3) || 1;\n\n var sx = j ? trg.x : src.x,\n sy = j ? trg.y : src.y,\n tx = !j ? trg.x : src.x,\n ty = !j ? trg.y : src.y;\n\n bufCtx.moveTo(sx, sy);\n var x3 = .3 * ty - .3 * sy + .8 * sx + .2 * tx,\n y3 = .8 * sy + .2 * ty - .3 * tx + .3 * sx,\n x4 = .3 * ty - .3 * sy + .2 * sx + .8 * tx,\n y4 = .2 * sy + .8 * ty - .3 * tx + .3 * sx;\n bufCtx.bezierCurveTo(x3, y3, x4, y4, tx, ty);\n bufCtx.stroke();\n }\n bufCtx.restore();\n }//end of if (setting.showEdge || selected){\n\n if (setting.showChild) {\n n = _force.nodes()\n .filter(filterVisible)\n .sort(sortBySize)\n .sort(sortByOpacity)\n .sort(sortByColor)\n ;\n\n l = n.length;\n\n c = null;\n i = 100;\n j = true;\n beg = false;\n\n bufCtx.globalAlpha = i * .01;\n\n while(--l > -1) {\n d = n[l];\n\n if (i != curOpacity(d)) {\n i = curOpacity(d);\n bufCtx.globalAlpha = i * .01;\n }\n\n if (!c || compereColor(c, curColor(d))) {\n c = curColor(d);\n j = false;\n }\n\n if (!j) {\n if (!setting.showHalo) {\n if (beg) {\n bufCtx.closePath();\n bufCtx.fill();\n bufCtx.stroke();\n }\n\n bufCtx.beginPath();\n beg = true;\n bufCtx.strokeStyle = \"none\";\n bufCtx.fillStyle = c.toString();\n }\n else\n img = colorize(particle, c.r, c.g, c.b, 1);\n j = true;\n }\n\n x = Math.floor(d.x);\n y = Math.floor(d.y);\n\n\n if (setting.fadingTail && setting.showTrack) {\n //bufCtx.save();\n bufCtx.lineCap=\"round\";\n //bufCtx.lineJoin=\"round\";\n bufCtx.lineWidth = (radius(nr(d)) / 4) || 1;\n bufCtx.fillStyle = \"none\";\n bufCtx.strokeStyle = c.toString();\n\n var rs = d.paths.slice(0).reverse(),\n lrs = rs.length,\n cura = bufCtx.globalAlpha;\n\n for (var p in rs) {\n if (!rs.hasOwnProperty(p))\n continue;\n\n bufCtx.beginPath();\n if (p < 1)\n bufCtx.moveTo(x, y);\n else\n bufCtx.moveTo(\n Math.floor(rs[p - 1].x),\n Math.floor(rs[p - 1].y)\n );\n bufCtx.lineTo(\n Math.floor(rs[p].x),\n Math.floor(rs[p].y)\n );\n bufCtx.stroke();\n bufCtx.globalAlpha = ((lrs - p)/lrs) * cura;\n }\n //bufCtx.restore();\n bufCtx.globalAlpha = cura;\n }\n\n if (!setting.fadingTail && setting.showTrack) {\n bufCtx.save();\n bufCtx.beginPath();\n bufCtx.lineCap=\"round\";\n bufCtx.lineJoin=\"round\";\n bufCtx.strokeStyle = c.toString();\n bufCtx.lineWidth = (radius(nr(d)) / 4) || 1;\n\n var rs = d.paths.slice(0).reverse(),\n lrs = rs.length;\n\n bufCtx.moveTo(x, y);\n for (var p in rs) {\n if (!rs.hasOwnProperty(p))\n continue;\n\n bufCtx.lineTo(\n Math.floor(rs[p].x),\n Math.floor(rs[p].y)\n );\n }\n //bufCtx.closePath();\n bufCtx.stroke();\n bufCtx.restore();\n }\n\n s = radius(nr(d)) * (setting.showHalo ? 8 : 1);\n setting.showHalo\n ? bufCtx.drawImage(img, x - s / 2, y - s / 2, s, s)\n : bufCtx.arc(x, y, s, 0, PI_CIRCLE, true)\n ;\n }//end of while\n if (!setting.showHalo && beg) {\n bufCtx.closePath();\n bufCtx.fill();\n bufCtx.stroke();\n }\n }//end of if (setting.showChild)\n\n if (setting.showParent || setting.showLabel) {\n n = _forceBase.nodes().filter(filterVisible).sort(sortByOpacity);\n l = n.length;\n\n i = 100;\n\n bufCtx.globalAlpha = i * .01;\n\n while(--l > -1) {\n d = n[l];\n\n if (i != curOpacity(d)) {\n i = curOpacity(d);\n bufCtx.globalAlpha = i * .01;\n }\n\n x = Math.floor(d.x);\n y = Math.floor(d.y);\n\n if (setting.showParent) {\n c = curColor(d);\n bufCtx.save();\n\n if (setting.showPaddingCircle) {\n bufCtx.beginPath();\n bufCtx.strokeStyle = \"none\";\n bufCtx.fillStyle = \"#ff0000\";\n bufCtx.arc(x, y, nr(d) + setting.padding, 0, PI_CIRCLE, true);\n bufCtx.closePath();\n bufCtx.fill();\n bufCtx.stroke();\n }\n\n bufCtx.beginPath();\n bufCtx.strokeStyle = \"transparent\";\n bufCtx.fillStyle = setting.useImage ? \"transparent\" : c;\n bufCtx.arc(x, y, nr(d), 0, PI_CIRCLE, true);\n bufCtx.closePath();\n bufCtx.fill();\n bufCtx.stroke();\n img = d.img && d.img.width > 0 && d.img.height > 0 ? d.img : defImg;\n if (setting.useImage && img.width > 0 && img.height > 0) {\n bufCtx.clip();\n iw = img.width;\n ih = img.height;\n\n if (iw == ih) {\n ih = iw = nr(d);\n }\n else if (iw > ih) {\n ih = (ih/iw) * nr(d) * 1.2;\n iw = nr(d) * 1.2;\n }\n else {\n iw = (iw/ih) * nr(d) * 1.2;\n ih = nr(d) * 1.2;\n }\n\n bufCtx.drawImage(img, x - iw, y - ih, iw * 2, ih * 2);\n }\n\n bufCtx.restore();\n }\n\n if (setting.showLabel) {\n c = d.flash ? \"white\" : \"gray\";\n\n bufCtx.fillStyle = c;\n bufCtx.fillText(d.nodeValue.shortName, x, y + nr(d) * 1.5);\n }\n }\n }//end of if (setting.showParent || setting.showLabel) {\n\n bufCtx.restore();\n\n }","title":""},{"docid":"a321591d8eca1c0c45839d85bfa2390f","score":"0.6248543","text":"function drawImage(){\n\tvar imgWidth = G.img.width;\n\tvar imgHeight = G.img.height;\n\tvar sx = 0, sy = 0, sw = imgWidth, sh = imgHeight, dx, dy, dw, dh;\n\tif(imgWidth >= imgHeight){ \t\t//fill the width or height of the image to the canvas\n\t\tdw = G.getWidth();\n\t\tdh = dw*imgHeight/imgWidth;\n\t}else{\n\t\tdh = G.getHeight();\n\t\tdw = dh*imgWidth/imgHeight;\n\t}\n\n\tdw = dw * G.zoomScale;\n\tdh = dh * G.zoomScale;\n\n\tdx = Math.floor((G.getWidth() - dw) / 2);\n\tdy = Math.floor((G.getHeight() - dh) / 2);\n\n\tG.ctxPic.drawImage(G.img, sx, sy, sw, sh, dx, dy, dw, dh);\n\t/*G.ctxMask.fillStyle = \"rgba(0, 0, 0, 0.4)\";\n\tG.ctxMask.fillRect(0, 0, G.getWidth(), G.getHeight());*/\n}","title":""},{"docid":"6d473b7e6a0d79afcd805af1d8b33da6","score":"0.6216746","text":"function renderCanvas() {\n canvas = document.querySelector('canvas');\n ctx = canvas.getContext('2d');\n var imageObj = new Image();\n imageObj.src = gCurrImg.url;\n ctx.drawImage(imageObj, 0, 0, canvas.width, canvas.height);\n renderLines();\n}","title":""},{"docid":"f805ef3435d9db007c3e280c4a18e392","score":"0.62075156","text":"createCanvas () {\n let width = this.texture.width;\n let height = this.texture.height-50;\n if (!this._canvas) {\n this._canvas = document.createElement('canvas');\n\n this._canvas.width = width;\n this._canvas.height = height;\n }\n else {\n this.clearCanvas();\n }\n let ctx = this._canvas.getContext('2d');\n this.camera.render();\n let data = this.texture.readPixels();\n // write the render data\n let rowBytes = width * 4; \n for (let row = 0; row < height; row++) {\n let srow = height - 1 - row;\n let imageData = ctx.createImageData(width, 1);\n let start = srow * width * 4;\n for (let i = 0; i < rowBytes; i++) {\n // if ((i - 3) % 4 == 0) {\n // // cc.log (\"i \" + i + \" data \" + data[start + i]);\n // // imageData.data[i] = 255;\n // } else {\n // imageData.data[i] = data[start + i];\n // }\n imageData.data[i] = data[start + i];\n }\n\n ctx.putImageData(imageData, 0, row);\n }\n return this._canvas;\n }","title":""},{"docid":"9a19bdd2ab6aa86409ddc86c9d3b5c87","score":"0.6190052","text":"function zoomOut(event) {\n var oldCols = canvas.width/scale;\n var oldRows = canvas.height/scale;\n if(scale>10){\n scale-=10;\n var newCols = canvas.width/scale;\n var newRows = canvas.height/scale;\n xOffset += Math.round((newCols - oldCols)/2);\n yOffset += Math.round((newRows - oldRows)/2);\n }\n drawBlueprint();\n}","title":""},{"docid":"3d1f0d6510b4bcafb0c9bec88a40758b","score":"0.618379","text":"function zoomIn(event) {\n var oldCols = canvas.width/scale;\n var oldRows = canvas.height/scale;\n if(scale<80){\n scale+=10;\n var newCols = canvas.width/scale;\n var newRows = canvas.height/scale;\n xOffset -= Math.round((oldCols - newCols)/2);\n yOffset -= Math.round((oldRows - newRows)/2);\n }\n drawBlueprint();}","title":""},{"docid":"821461eff52a211b28a3444443ae6c68","score":"0.6173043","text":"updateDrawing() {\n P5.image(this.graphicsBuffer, 0, 0);\n }","title":""},{"docid":"c3022ea7716915d57927e47fafbe62f1","score":"0.6164941","text":"function updateCanvas(){\n\tctx.drawImage(canvasImgSource, 0, 0, canvas.width, canvas.height);\n\tctxIn.drawImage(canvasImgSource, 0, 0, canvas.width, canvas.height);\n}","title":""},{"docid":"ccdde14c39669959f530a8234e1d3596","score":"0.61515725","text":"function CImgBuf(wide, tall) {\r\n//==============================================================================\r\n// Construct an 'image-buffer' object to hold a floating-point ray-traced image.\r\n// Contains BOTH\r\n//\tiBuf -- 2D array of 8-bit RGB pixel values we can display on-screen, AND\r\n//\tfBuf -- 2D array of floating-point RGB pixel values we often CAN'T display,\r\n// but contains full-precision results of ray-tracing.\r\n//\t\t\t--Both buffers hold the same numbers of pixel values (xSiz,ySiz,pixSiz)\r\n//\t\t\t--imgBuf.int2float() copies/converts current iBuf contents to fBuf\r\n//\t\t\t--imgBuf.float2int() copies/converts current fBuf contents to iBuf\r\n//\tWHY? \r\n//\t--Our ray-tracer computes floating-point light amounts(e.g. radiance L) \r\n// but neither our display nor our WebGL texture-map buffers can accept \r\n//\t\timages with floating-point pixel values.\r\n//\t--You will NEED all those floating-point values for applications such as\r\n// environment maps (re-lighting from sky image) and lighting simulations.\r\n// Stay simple in early versions of your ray-tracer: keep 0.0 <= RGB < 1.0, \r\n// but later you can modify your ray-tracer \r\n// to use radiometric units of Radiance (watts/(steradians*meter^2), or convert \r\n// to use photometric units of luminance (lumens/(steradians*meter^2 or cd/m^2) \r\n// to compute in physically verifiable units of visible light.\r\n\r\n\tthis.xSiz = wide;\t\t\t\t\t\t\t// image width in pixels\r\n\tthis.ySiz =\ttall;\t\t\t\t\t\t\t// image height in pixels\r\n\tthis.pixSiz = 3;\t\t\t\t\t\t\t// pixel size (3 for RGB, 4 for RGBA, etc)\r\n\tthis.iBuf = new Uint8Array( this.xSiz * this.ySiz * this.pixSiz);\t\r\n\tthis.fBuf = new Float32Array(this.xSiz * this.ySiz * this.pixSiz);\r\n\tthis.antiAliasing = 0;\r\n}","title":""},{"docid":"823843dbf8678ab0874edc023441ba3f","score":"0.6125147","text":"drawImage(dx, dy, image) {\n dx = dx || 0;\n dy = dy || 0;\n let dyy;\n let dxx;\n let dyyPage;\n let dxxByte = null;\n let bufferOffset = 0;\n let page;\n let imageOffset;\n let pixelByte;\n let color;\n\n // outer loop through columns\n for (let x = 0; x < image.width; x++) {\n dxx = dx + x;\n if (this.clipped(dxx, null)) {\n continue;\n }\n page = -1; // reset page\n // inner loop through rows\n for (let y = 0; y < image.height; y++) {\n dyy = dy + y;\n if (this.clipped(null, dyy)) {\n continue;\n }\n // calculate buffer page for y coord\n dyyPage = Math.floor(dyy / 8);\n // check if new page\n if (dyyPage > page) {\n // if we have a byte and it differs from buffer then save\n if (dxxByte !== null && dxxByte !== this.buffer[bufferOffset]) {\n this.buffer[bufferOffset] = dxxByte;\n this.dirtyBytes[page] = this.dirtyBytes[page] || {};\n this.dirtyBytes[page][dxx] = dxxByte;\n }\n // prepare settings for new page\n page = dyyPage;\n bufferOffset = page * this.Config.displayColumns + dxx;\n dxxByte = this.buffer[bufferOffset];\n }\n // calculate offset into image data (4 bytes per RGBA pixel)\n imageOffset = (image.width * image.channels * y + image.channels * x);\n\n // transparency check\n if (image.channels === 2 || image.channels === 4) {\n if (!image.data[imageOffset + (image.channels - 1)]) { continue; }\n }\n\n // convert pixel y position into buffer column byte\n pixelByte = 0x01 << (dyy - 8 * dyyPage);\n // convert image pixel color to monochrome\n color = (image.channels < 3 ? image.data[imageOffset] : image.data[imageOffset] || image.data[imageOffset + 1] || image.data[imageOffset + 2]);\n\n // apply pixel to buffer byte\n if (color) {\n dxxByte |= pixelByte;\n }\n else {\n dxxByte &= ~pixelByte;\n }\n }\n // if we have a byte and it differs from buffer then save\n if (dxxByte !== null && dxxByte !== this.buffer[bufferOffset]) {\n // save byte\n this.buffer[bufferOffset] = dxxByte;\n this.dirtyBytes[page] = this.dirtyBytes[page] || {};\n this.dirtyBytes[page][dxx] = dxxByte;\n }\n dxxByte = null;\n }\n }","title":""},{"docid":"4c53cfdfdeb5a03dd298e6109ca24045","score":"0.6124233","text":"async function zoom(buffer) {\n return sharp(buffer)\n .crop(sharp.gravity.center)\n .resize(1280, config.zoom)\n .toBuffer();\n }","title":""},{"docid":"9da17b8f6704199e6e67d454efcc5b7c","score":"0.6120511","text":"render(timestamp){\n // for (let i = 0; i < this.vramSize; i += 4){\n // this._layerOne.data[i + 0] = this.vram[i + 0]\n // this._layerOne.data[i + 1] = this.vram[i + 1]\n // this._layerOne.data[i + 2] = this.vram[i + 2]\n // this._layerOne.data[i + 3] = 255\n // }\n\n // let that = this\n // console.log(timestamp)\n // console.log(1000/(timestamp - this.oldTime))\n this.fps = 1000/(timestamp - this.oldTime)\n this.oldTime = timestamp\n\n this.copyVramToImage()\n\n Promise.all([\n createImageBitmap(this._layerOne, {\n resizeQuality: 'pixelated',\n colorSpaceConversion: 'none',\n premultiplyAlpha: 'premultiply',\n resizeWidth: this.canvas.width,\n resizeHeight: this.canvas.height,\n })\n ]).then(function(bitmaps){\n // this.ctx.putImageData(this._imageData, 0, 0)\n\n this.ctx.drawImage(bitmaps[0], 0, 0)\n\n requestAnimationFrame(this.render.bind(this))\n }.bind(this))\n\n }","title":""},{"docid":"96a3933ca06da8c118ea38916914cec4","score":"0.6114568","text":"function pickPoint(e){\n console.log(e)\n console.log(e.offsetX, e.offsetY)\n // var imgAryBaseWidth = window.baselevel.slice_size[0]\n var imgAryBaseWidth = window.baselevel.resolution[0] // tempXXX\n const rateCanvas = Math.ceil(canvas.width / canvasMinimap.width)\n const scaleRate = 1\n const rate = Math.ceil((imgAryBaseWidth / scaleRate) / canvas.width)\n // 縮圖置中，添加平移量\n const baseX = (canvasMinimap.width - imgAryBaseWidth / rate / rateCanvas) / 2\n var x = (e.offsetX - baseX) * rateCanvas\n var y = e.offsetY * rateCanvas\n // var pointer = canvas.getPointer({ x: 0, y: 0 });\n // var pointer = beforeRotateLeftTopCoord(window.theta, CenterCoord(), { x: 0, y: 0 })\n var pointer = CenterCoord()\n var ary = new Array(6)\n var ary = canvas.viewportTransform;\n var centerMoveMatirx = [1, 0, 0, 1, pointer.x - x, pointer.y - y]\n // console.log('--A--', JSON.stringify(ary))\n // var centerMoveMatirx = [1,0,0,1,10,10]\n ary = matrixProduct(ary, centerMoveMatirx) // 先平移\n // console.log('--B--', JSON.stringify(ary))\n canvas.setViewportTransform(ary);\n canvas.renderAll();\n clearTimeout(tt)\n tt = setTimeout(function(){\n var zoom = realZoom()\n var levelInfo = window.imgInfo.partition.find(function(item){\n return item.scaleRate < zoom || item.scaleRate === 1\n })\n var area = { x: shiftDrawArea(), y: shiftDrawArea(), w: window.tempCanvasWidth, h: window.tempCanvasWidth}\n var coordinate = leftTopCoord()\n if (window.theta !== 0) {\n var tempAngle = window.theta\n rotateSwitch(0)\n coordinate = leftTopCoord()\n rotateSwitch(tempAngle)\n }\n loadImgByLevelAndCanvasArea(levelInfo, coordinate, zoom, area)\n })\n }","title":""},{"docid":"43d3e938383f490ed92cee8518721823","score":"0.6097722","text":"function Layer(width, height, canvas) {\n this.canvasSize = [width, height];\n this.canvas = canvas;\n this.context = this.canvas.getContext('2d');\n // Initializes the canvas\n this.initialize = function() {\n var maxHorizontalZoom = Math.floor(window.innerWidth/this.canvasSize[0]*0.75);\n var maxVerticalZoom = Math.floor(window.innerHeight/this.canvasSize[1]*0.75);\n\n zoom = Math.min(maxHorizontalZoom,maxVerticalZoom);\n if (zoom < 1) zoom = 1;\n\n //resize canvas\n this.canvas.width = this.canvasSize[0];\n this.canvas.height = this.canvasSize[1];\n this.canvas.style.width = (this.canvas.width*zoom)+'px';\n this.canvas.style.height = (this.canvas.height*zoom)+'px';\n\n //unhide canvas\n this.canvas.style.display = 'block';\n\n //center canvas in window\n this.canvas.style.left = 64+canvasView.clientWidth/2-(this.canvasSize[0]*zoom/2)+'px';\n this.canvas.style.top = 48+canvasView.clientHeight/2-(this.canvasSize[1]*zoom/2)+'px';\n\n this.context.imageSmoothingEnabled = false;\n this.context.mozImageSmoothingEnabled = false;\n };\n // Resizes canvas\n this.resize = function() {\n let newWidth = (this.canvas.width * zoom) + 'px';\n let newHeight = (this.canvas.height *zoom)+ 'px';\n\n this.canvas.style.width = newWidth;\n this.canvas.style.height = newHeight;\n };\n // Copies the otherCanvas' position and size\n this.copyData = function(otherCanvas) {\n this.canvas.style.width = otherCanvas.canvas.style.width;\n this.canvas.style.height = otherCanvas.canvas.style.height;\n\n this.canvas.style.left = otherCanvas.canvas.style.left;\n this.canvas.style.top = otherCanvas.canvas.style.top;\n };\n}","title":""},{"docid":"cc72e52476809d5b9136ab1bca6eaabd","score":"0.60591197","text":"function updateCanvasSize(){\n\n canvas.width = params.width;\n canvas.height = params.height;\n\n zoomCanvas();\n\n params.width = canvas.width;\n params.height = canvas.height;\n gl.viewport( 0, 0, canvas.width, canvas.height );\n createRenderTargets();\n params.step = 0;\n params.doConfig = 1;\n }","title":""},{"docid":"c94600d5fa2af2f238fe9eb098afddf9","score":"0.604687","text":"function drawPixels(canvasId, imageData) {\n var context2d = getContext2d(canvasId);\n context2d.putImageData(imageData, 0, 0);\n }","title":""},{"docid":"291e2ba957c88c47091f0cef22295ad4","score":"0.603797","text":"draw() {\r\n this.context.drawImage(this.img, 0, 0, this.img.width, this.img.height, (this.canvas.width - this.img.width * this.ratio)/2, (this.canvas.height - this.img.height * this.ratio)/2, (this.img.width * this.ratio), (this.img.height * this.ratio));\r\n }","title":""},{"docid":"7de1a5357b8f04a082fceb65df329770","score":"0.60340315","text":"function draw(img) {\n\tconst data = img.dataSync();\n\tconst multiplier = 500;\n\tconst imageData = new ImageData(width, height);\n\n\tfor (let i = 0; i < height * width; ++i) {\n\t\tconst j = i * 4;\n\t\timageData.data[j + 0] = data[i] * multiplier;\n\t\timageData.data[j + 1] = data[i] * multiplier;\n\t\timageData.data[j + 2] = data[i] * multiplier;\n\t\timageData.data[j + 3] = 255;\n\n\t}\n\n\tif (canvas != null) {\n\t\tconst ctx = canvas.getContext('2d');\n\t\tctx.putImageData(imageData, 0, 0);\n\t}\n}","title":""},{"docid":"df3faff3ca5c5273bc52105a96c123b6","score":"0.6028558","text":"function draw () {\n\t\tdrawVisual = requestAnimationFrame(draw);\n\n\t\tanalyser.getByteTimeDomainData(dataArray);\n\n\t\tcanvasCtx.fillStyle = 'rgb(46,19,114)';\n\t\tcanvasCtx.fillRect(0, 0, WIDTH, HEIGHT);\n\t\t\n\t\tcanvasCtx.lineWidth = 4;\n\t\tcanvasCtx.strokeStyle = '#1ADB6F';\n\n\t\tcanvasCtx.beginPath();\n\n\t\tvar sliceWidth = WIDTH * 1.0 / bufferLength;\n\t\tvar x = 0\n\n\t\tfor(var i = 0; i < bufferLength; i++) {\n \n \tvar v = dataArray[i] / 128.0;\n \tvar y = v * HEIGHT/2;\n\n \tif(i === 0) {\n \t\tcanvasCtx.moveTo(x, y);\n \t} else {\n \t\tcanvasCtx.lineTo(x, y);\n \t}\n\n \tx += sliceWidth;\n \t}\t\n\n \tcanvasCtx.lineTo(canvas.width, canvas.height/2);\n \tcanvasCtx.stroke();\n\t}","title":""},{"docid":"2ad65cf79a70d86bc70bb1f2659204ed","score":"0.6018335","text":"function renderFrame() {\n let oldFrame;\n\n // 1. Capture to offscreen buffer\n offscreenCtx.drawImage(cameraEl, 0, 0);\n\n // 2. Read the pixel data from this buffer\n let frame = offscreenCtx.getImageData(\n 0,\n 0,\n offscreenCanvasEl.width,\n offscreenCanvasEl.height\n );\n\n const totalPixels = frame.data.length / 4; // Get total number of pixels by dividing by 4 (since each pixel uses 4 values)\n for (let pixelIndex = 0; pixelIndex < totalPixels; pixelIndex++) {\n // Save each color channel of the pixel\n const r = frame.data[pixelIndex * 4 + 0];\n const g = frame.data[pixelIndex * 4 + 1];\n const b = frame.data[pixelIndex * 4 + 2];\n\n // Calculate the \"blueishness\" of the pixel\n const blueishness = b - (r + g) / 2;\n\n if (blueishness < 40) {\n // If it's not blue we make the pixel transparent\n frame.data[pixelIndex * 4 + 3] = 0;\n } else {\n // If it's blue enough we set it to pink\n frame.data[pixelIndex * 4 + 0] = 255;\n frame.data[pixelIndex * 4 + 2] = 128;\n }\n }\n\n // Add the frame to our buffer array to be able to delay the rendering\n frameBuffer.push(frame);\n if (frameBuffer.length > 30) {\n // Remove the oldest frames and save it for later\n oldFrame = frameBuffer.shift();\n }\n\n // Draw the camera picture to the screen\n ctx.drawImage(cameraEl, 0, 0);\n\n if (delay && oldFrame) {\n // Write our old modified frame back to the buffer and\n // draw buffer to the visible canvas\n offscreenCtx.putImageData(oldFrame, 0, 0);\n ctx.drawImage(offscreenCanvasEl, 0, 0);\n } else if (!delay) {\n // Write our modified frame back to the buffer and\n // draw buffer to the visible canvas\n offscreenCtx.putImageData(frame, 0, 0);\n ctx.drawImage(offscreenCanvasEl, 0, 0);\n }\n\n // Repeat!\n window.requestAnimationFrame(renderFrame);\n}","title":""},{"docid":"e7e6c5463d6c3b66ee481e312065817a","score":"0.6008731","text":"update (data) {\n let canvas = this.refs.canvas.getContext('2d');\n let img = new Image();\n img.onload = function () {\n //canvas.clearRect(0,0,2000,2000);\n canvas.drawImage(this, 0, 0);\n }\n img.src = data;\n }","title":""},{"docid":"517b272f692f8db940ed40225e3ac7cd","score":"0.6008491","text":"function blit_pixels(viewport, transform, pixels, viewport_size, mono){\n var ctx = viewport.getContext(\"2d\");\n var imageData = ctx.getImageData(0, 0, viewport.width, viewport.height);\n var target = imageData.data;\n for(var y = 0; y < viewport_size; y++)\n {\n for(var x = 0; x < viewport_size; x++)\n {\n var posn = pair(x,y);\n var transposn = transform(posn); \n var srcIdx = 4*(viewport_size * y + x);\n var destIdx = 4*(viewport.width * Math.round(posn_y(transposn)) + Math.round(posn_x(transposn)));\n if(mono){\n var avg = Math.round(pixels[srcIdx+0] + pixels[srcIdx+1] + pixels[srcIdx+2])/3;\n target[destIdx+0] = avg;\n target[destIdx+1] = avg;\n target[destIdx+2] = avg;\n }else{\n target[destIdx+0] = pixels[srcIdx+0];\n target[destIdx+1] = pixels[srcIdx+1];\n target[destIdx+2] = pixels[srcIdx+2];\n }\n target[destIdx+3] = 255;\n }\n }\n var buffer = document.createElement(\"Canvas\");\n buffer.width = ctx.canvas.width;\n buffer.height = ctx.canvas.height;\n buffer.getContext(\"2d\").putImageData(imageData, 0, 0);\n ctx.scale(antialias, antialias);\n ctx.drawImage(buffer, 0 , 0);\n}","title":""},{"docid":"55556abc4bd49715daa173e787c2e203","score":"0.60031","text":"_bindCanvas() {\n\t\tconst {width, height} = this.state;\n\t\tconst {image, step} = this.props;\n\t\tconst canvas = document.querySelector('#strenght-canvas');\n\t\tconst ctx = canvas.getContext('2d');\n\n\t\tconst img = loadImage(image);\n\n\t\timg.onload = function () {\n\t\t\tctx.fillStyle = \"red\";\n\t\t\tctx.drawImage(this, 0, 0, width, height);\n\n\t\t\tconst imageData = ctx.getImageData(0, 0, width, height);\n\t\t\tconst data = imageData.data;\n\n\t\t\tfor (var i = 0; i < data.length; i += 4) {\n\t\t\t\tif(data[i] > (50 * step) && step < 8) {\n\t\t\t\t\tdata[i] = 0;\n\t\t\t\t\tdata[i+1] = data[i];\n\t\t\t\t\tdata[i+2] = data[i] + 10;\n\t\t\t\t}else {\n\t\t\t\t\tdata[i] = data[i];\n\t\t\t\t\tdata[i+1] = data[i+1];\n\t\t\t\t\tdata[i+2] = data[i+2];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tctx.putImageData(imageData, 0, 0);\n\t\t}\n\t}","title":""},{"docid":"98bb84a9295d8b6fbe923ec3b9746d7f","score":"0.59990275","text":"constructor(image, scale, callback, isPreview){\n\n this.image = image;\n this.isPreview = isPreview;\n this.scale = scale || 1;\n\n this.width = this.image.metaData.width;\n this.height = this.image.metaData.height;\n this.scaleMin = this.image.scaling.scaleMin;\n this.scaleMax = this.image.scaling.scaleMax;\n this.sample = Math.floor(1 / this.scale);\n this.targetWidth = Math.floor(this.width * this.scale);\n this.targetHeight = Math.floor(this.height * this.scale);\n\n let tmpCanvas = document.createElement('canvas');\n tmpCanvas.width = this.targetWidth;\n tmpCanvas.height = this.targetHeight;\n\n let tmpCtx = this.tmpCtx = tmpCanvas.getContext('2d');\n\n let data = {\n width: this.width,\n height: this.height,\n targetWidth: this.targetWidth,\n targetHeight: this.targetHeight,\n sample: this.sample,\n scaleMin: this.scaleMin,\n scaleMax: this.scaleMax,\n imageData: this.image.imageData,\n colors: this.image.scaling.colors,\n scaleFunction: this.image.scaling.scaleFunction,\n tmpContext: this.tmpCtx.getImageData(0,0,this.targetWidth, this.targetHeight)\n };\n\n if(isPreview){\n this.render(data, callback);\n }else{\n this.workerRender(data, function(imageData){\n tmpCtx.putImageData(imageData, 0, 0);\n let url = tmpCtx.canvas.toDataURL(),\n img = new Image();\n img.src = url;\n callback(img);\n });\n }\n\n }","title":""},{"docid":"38085e6a3412840a0b99fec363e4d031","score":"0.5987512","text":"function saveDrawingSurface(){\n\t\n\t\tvar imageData=context.getImageData(0,0, canvas.width, canvas.height);\n\n}","title":""},{"docid":"2d59a60aac62cdd888e284a78cf3afa6","score":"0.59859693","text":"draw(){\n this.context.drawImage(this.img, this.x, this.y);\n }","title":""},{"docid":"2d4d72722fcefd98944285e356d8430b","score":"0.5984148","text":"function renderImageToCanvas(img, canvas, width, height) {\n var iw = img.naturalWidth;\n var ih = img.naturalHeight;\n var ctx = canvas.getContext('2d');\n canvas.width = width;\n canvas.height = height;\n ctx.save();\n\n var subsampled = detectSubsampling(img);\n if (subsampled) {\n iw /= 2;\n ih /= 2;\n }\n\n var d = 1024; // size of tiling canvas\n var tilingCanvas = document.createElement('canvas');\n tilingCanvas.width = tilingCanvas.height = d;\n var tilingCtx = tilingCanvas.getContext('2d');\n var vertSquashRatio = detectVerticalSquash(img, iw, ih);\n\n var sy = 0;\n while (sy < ih) {\n var sh = sy + d > ih ? ih - sy : d;\n var sx = 0;\n while (sx < iw) {\n var sw = sx + d > iw ? iw - sx : d;\n tilingCtx.clearRect(0, 0, d, d);\n tilingCtx.drawImage(img, -sx, -sy);\n var dx = sx * width / iw << 0;\n var dw = Math.ceil(sw * width / iw);\n var dy = sy * height / ih / vertSquashRatio << 0;\n var dh = Math.ceil(sh * height / ih / vertSquashRatio);\n ctx.drawImage(tilingCanvas, 0, 0, sw, sh, dx, dy, dw, dh);\n sx += d;\n }\n\n sy += d;\n }\n\n ctx.restore();\n tilingCanvas = tilingCtx = null;\n}","title":""},{"docid":"1a1c88ca902f7ba47a072b93edec96da","score":"0.59780794","text":"drawFromBuffer () {\n\t\tdisplaySystem.updateBufferFOV();\n\t\tdisplaySystem.updateBuffer();\n\n\t\tdisplay.clear();\n\t\tlogger.showMessages();\n\t\tfor (let i = 0; i < bufferOptions.width; i++) {\n\t\t\tfor (let j = 0; j < bufferOptions.height; j++) {\n\t\t\t\tlet pos = i + (j * bufferOptions.width);\n\n\t\t\t\t//draw separating line between game and log/information\n\t\t\t\tfor (let k = 0; k < bufferOptions.height; k++) {\n\t\t\t\t\tdisplay.draw(bufferOptions.width, k, \"|\", \"#ffffff\")\n\t\t\t\t}\n \t\t\t\t\n\t\t\t\t//idea: \"flipped mode\" where i and j are flipped as a status effect\n\t\t\t\tif (this.buffer[pos]) { display.draw(i, j, this.buffer[pos][0], this.buffer[pos][1], this.buffer[pos][2]);}\n\t\t\t\telse {display.draw(i,j,'','','#000000')}\n\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"5764c0eb56cc20747429b9da4ea9127b","score":"0.5965301","text":"function initCanvas() {\n //Choose zoom level to fit image inside canvas\n currZoom = 1.0;\n var fitWidthScale = window.cc.canvas.clientWidth / imgs[0][0].naturalWidth;\n var fitHeightScale = window.cc.canvas.clientHeight / imgs[0][0].naturalHeight;\n if (fitWidthScale < fitHeightScale) {\n currZoom = fitWidthScale;\n } else {\n currZoom = fitHeightScale;\n }\n window.cc.scale(currZoom, currZoom);\n\n //Move (0,0) from top-left of canvas to centre\n window.cc.translate(window.cc.canvas.clientWidth / currZoom / 2, window.cc.canvas.clientHeight / currZoom / 2);\n\n //Find where top-left of image should be positioned\n imgTopLeft = [-imgs[0][0].naturalWidth / 2, -imgs[0][0].naturalHeight / 2];\n\n userRotateEnabled = true;\n userPanEnabled = true;\n userZoomEnabled = true;\n}","title":""},{"docid":"4b5785262f8b44f4a07b9c41b60f6bfe","score":"0.5957516","text":"renderFrame() {\n // Check if we have new graphics to show\n if (!this.imageDataArrayChanged) {\n return;\n }\n this.imageDataArrayChanged = false;\n\n // Check for a callback for accessing image data\n if (this.updateGraphicsCallback) {\n this.updateGraphicsCallback(this.imageDataArray);\n }\n\n // Set the imageDataArray to our plugins\n WasmBoyPlugins.runHook({\n key: 'graphics',\n params: [this.imageDataArray],\n callback: response => {\n if (response) {\n this.imageDataArray = response;\n }\n }\n });\n\n // Add our new imageData\n this.canvasImageData.data.set(this.imageDataArray);\n\n this.canvasContext.clearRect(0, 0, this.canvasElement.width, this.canvasElement.height);\n this.canvasContext.putImageData(this.canvasImageData, 0, 0);\n }","title":""},{"docid":"340df2fa63931a9764378319b4b315b8","score":"0.59360313","text":"async function zoom(buffer) {\n\t\treturn sharp(buffer)\n\t\t\t.crop(sharp.gravity.center)\n\t\t\t.resize(1280, config.zoom)\n\t\t\t.toBuffer();\n\t}","title":""},{"docid":"6227ea2c147325bc03f3ece9ce433209","score":"0.5933869","text":"function main() {\n\n // Get the canvas and context\n var canvas = document.getElementById(\"viewport\");\n var context = canvas.getContext(\"2d\");\n\tcontext.translate(0,context.canvas.height);\n\tcontext.scale(1,-1);\n\t\n\n \n // Create the image\n //drawRandPixels(context);\n // shows how to draw pixels\n \n drawRandPixelsInInputEllipsoids(context);\n // shows how to draw pixels and read input file\n \n //drawInputEllipsoidsUsingArcs(context);\n // shows how to read input file, but not how to draw pixels\n}","title":""},{"docid":"7afeba09a2e3beeacbdfde2b59d53a5a","score":"0.5932826","text":"function renderFrame() {\n let offscreenC = offscreenCanvasEl.getContext('2d');\n let c = canvasEl.getContext('2d');\n\n // 1. Capture to offscreen canvas\n offscreenC.drawImage(cameraEl, 0, 0);\n\n // 2. Do whatever processing we want to the this buffer\n // Example from: https://developer.mozilla.org/en-US/docs/Web/API/Canvas_API/Manipulating_video_using_canvas\n let frame = offscreenC.getImageData(0, 0, offscreenCanvasEl.width, offscreenCanvasEl.height);\n\n let diffCount = 0;\n\n // 4 is used here since frame is represented as R G B A\n let l = frame.data.length / 4;\n if (oldFrame !== null) {\n for (let i = 0; i < l; i++) {\n if (comparePixel(frame, i)) {\n frame.data[i * 4 + 3] = 0; // Set alpha to 0, transparent\n diffCount++;\n }\n }\n }\n // Draw something in the background\n var gradient = c.createLinearGradient(0, 0, canvasEl.width, canvasEl.height);\n gradient.addColorStop(0, 'deeppink');\n gradient.addColorStop(1, 'palegreen');\n\n c.fillStyle = gradient;\n c.fillRect(0, 0, canvasEl.width, canvasEl.height);\n\n // Write image data to destination context\n offscreenC.putImageData(frame, 0, 0);\n\n c.drawImage(offscreenCanvasEl, 0, 0);\n\n // % of image that has changed\n diffCount = 100 - parseInt(100 * (diffCount / (frame.data.length / 4)));\n c.fillStyle = 'white';\n c.font = '48px \"Fira Code\", Monaco, \"Andale Mono\", \"Lucida Console\", \"Bitstream Vera Sans Mono\", \"Courier New\", Courier, monospace';\n c.fillText(diffCount + \"%\", 100, 100);\n\n let now = Date.now();\n let keepFrame = true;\n\n // If we want, we could change when we hold on to the last frame,\n // eg to only update it every so often, or to keep a single reference frame\n\n // This only updates the reference frame every 1 second\n // if (now - oldFrameCapturedAt < 11000) keepFrame = false;\n\n // This only keeps a single reference frame and never updates it\n //if (oldFrame !== null) keepFrame = false;\n\n // Remember last frame\n if (keepFrame) {\n oldFrame = frame;\n oldFrameCapturedAt = now;\n }\n\n // Repeat!\n window.requestAnimationFrame(renderFrame);\n}","title":""},{"docid":"6fa5245c34e87690d6c472b4e601ea65","score":"0.5928093","text":"function draw() {\n var drawVisual = requestAnimationFrame(draw);\n\n analyser.getByteTimeDomainData(dataArray);\n\n canvasCtx.fillStyle = \"rgb(240,128,128)\";\n canvasCtx.fillRect(0, 0, canvas.width, canvas.height);\n\n canvasCtx.lineWidth = 2;\n canvasCtx.strokeStyle = \"rgb(50, 150, 127)\";\n\n canvasCtx.beginPath();\n\n var sliceWidth = (canvas.width * 1.0) / bufferLength;\n var x = 0;\n\n for (var i = 0; i < bufferLength; i++) {\n var v = dataArray[i] / 128.0;\n var y = (v * canvas.height) / 2;\n\n if (i === 0) {\n canvasCtx.moveTo(x, y);\n } else {\n canvasCtx.lineTo(x, y);\n }\n\n x += sliceWidth;\n }\n\n canvasCtx.lineTo(canvas.width, canvas.height / 2);\n canvasCtx.stroke();\n}","title":""},{"docid":"b8b580569a0b3e13c7e3a2b235293a33","score":"0.5911935","text":"function directImage() {\n if (trueMagnification !== 1) {\n console.error('directImage: Magnification is not equal to 1, it is ' + trueMagnification);\n return;\n }\n console.log('directImage');\n output.startDrawing();\n output.pixels.update();\n const pixels = output.pixels;\n const width = output.canvas.width;\n const height = width;\n let imageIndex = 0;\n // going over image pixels, skipping border cells\n for (var j = 0; j < height; j++) {\n // skip first two cell rows (border)\n const jCellSize = size * (2 + j);\n for (var i = 0; i < width; i++) {\n // skip first two cell columns (border)\n const cell = cells[jCellSize + i + 2];\n if (cell < -20) {\n pixels.array[imageIndex] = colorForMoverLeft;\n } else if (cell < -10) {\n pixels.array[imageIndex] = colorForMoverRight;\n } else if (cell < 0) {\n pixels.array[imageIndex] = colorForMover;\n } else {\n pixels.array[imageIndex] = colors[cell];\n }\n imageIndex += 1;\n }\n }\n output.pixels.show();\n}","title":""},{"docid":"9e85c5190bb308ae9b0ed2acadfd15a0","score":"0.5899221","text":"display() {\n let sx = this.raw ? 0 : cs.camera.getX()\n let sy = this.raw ? 0 : cs.camera.getY()\n let sWidth = this.raw ? this.canvas.width : cs.camera.getWidth()\n let sHeight = this.raw ? this.canvas.height : cs.camera.getHeight()\n\n // We will have to scale the X over becuse safari doesnt act like chrome\n const dx = sx < 0 ? Math.floor(cs.camera.getScale() * (cs.camera.getX() * -1)) : 0\n const dy = sy < 0 ? Math.floor(cs.camera.getScale() * (cs.camera.getY() * -1)) : 0\n const dWidth = sWidth <= this.canvas.width\n ? cs.view.width\n : cs.view.width - Math.floor(cs.camera.getScale() * ((cs.camera.getWidth()) - this.canvas.width))\n const dHeight = sHeight <= this.canvas.height\n ? cs.view.height\n : cs.view.height - Math.floor(cs.camera.getScale() * ((cs.camera.getHeight()) - this.canvas.height))\n\n if (sx < 0) {\n sx = 0\n sWidth += sx * -1\n }\n if (sy < 0) {\n sy = 0\n sHeight += sy * -1\n }\n if (sWidth > this.canvas.width) sWidth = this.canvas.width\n if (sHeight > this.canvas.height) sWidth = this.canvas.height\n\n cs.view.ctx.drawImage(this.canvas,\n sx, sy, sWidth, sHeight,\n dx, dy, dWidth, dHeight)\n }","title":""},{"docid":"ca104ce1178123771c0cc6f3ec176b23","score":"0.58842003","text":"function drawBlendImage(messageEvent) {\n logOnce_1('main thread - ', messageEvent.data);\n blendImageData\n .data\n .set(\n new Uint8ClampedArray(messageEvent.data)\n );\n\n blendCtx.putImageData(blendImageData, 0, 0);\n previousImageData = currentImageData;\n}","title":""},{"docid":"3818b9ad0b1ab5ea4e805e53893ac4e0","score":"0.58829224","text":"function _zoom() {\n step++\n if (step < 20) {\n self._zoomFrame = requestAnimationFrame(_zoom)\n }\n var tickZoom = easeOutQuart(step, curPerc, perc - curPerc, 20)\n\n var ratio = tickZoom / curPerc,\n imgWidth = imageDim.w * tickZoom / 100,\n imgHeight = imageDim.h * tickZoom / 100,\n newLeft = -((point.x - curLeft) * ratio - point.x),\n newTop = -((point.y - curTop) * ratio - point.y)\n\n var baseLeft = Math.max((containerDim.w - imgWidth) / 2, 0),\n baseTop = Math.max((containerDim.h - imgHeight) / 2, 0),\n baseRight = containerDim.w - baseLeft,\n baseBottom = containerDim.h - baseTop\n\n newLeft = Math.min(newLeft, baseLeft)\n newTop = Math.min(newTop, baseTop)\n\n //fix for right and bottom\n if ((newLeft + imgWidth) < baseRight) {\n newLeft = baseRight - imgWidth //newLeft - (newLeft + imgWidth - baseRight)\n }\n if ((newTop + imgHeight) < baseBottom) {\n newTop = baseBottom - imgHeight //newTop + (newTop + imgHeight - baseBottom)\n }\n curImg.style.width = imgWidth + 'px'\n curImg.style.height = imgHeight + 'px'\n curImg.style.left = newLeft + 'px'\n curImg.style.top = newTop + 'px'\n\n self.zoomValue = tickZoom\n }","title":""},{"docid":"07cc27b4154126e080a854d9c3d5bd25","score":"0.58762825","text":"renderDataBuffer( dataBuffer, dataMaterial )\n { \n \n // render data into copy texture\n gl.bindFramebuffer( gl.FRAMEBUFFER, this._rtCopyBuffer.fbo() );\n gl.clear( gl.COLOR_BUFFER_BIT );\n \n dataMaterial.apply(); \n this._screenQuadMesh.render(); \n \n // render copy texture into data texture\n gl.bindFramebuffer( gl.FRAMEBUFFER, dataBuffer );\n gl.clear( gl.COLOR_BUFFER_BIT );\n \n this._copyMaterial.apply(); \n this._screenQuadMesh.render(); \n }","title":""},{"docid":"6e78f714ba12b82e7ca7937fcdc995e2","score":"0.58723897","text":"draw() {\n if (!this.img) return;\n ctx.drawImage(this.img, this.x, this.y);\n ctx.drawImage(this.img, this.x + W, 0);\n }","title":""},{"docid":"ee696d12fe5305d93eac14e51af829a4","score":"0.5871594","text":"function copy() {\n imgData = ctx.getImageData(0, 0, canvas.width, canvas.height);\n}","title":""},{"docid":"01c5e47397a1d67de79759e8560eab67","score":"0.5870759","text":"draw(ctx) {\n ctx.drawImage(\n this.image,\n this.position.x,\n this.position.y,\n this.size,\n this.size\n );\n }","title":""},{"docid":"a20010b74f92954bc7764c1a1fcda2ff","score":"0.58594215","text":"updateCanvas() {\n this.ctx.putImageData(this.imageData, 0, 0)\n return this.ctx.canvas\n }","title":""},{"docid":"38e003eaf69fa6868b08f647059d102d","score":"0.58476776","text":"function drawImage(canvas) {\n var context = canvas.node().getContext(\"2d\"),\n image = context.createImageData(dx, dy);\n\n //for (var y = 0, p = -1; y < dy; ++y) {\n for (var y = dy-1, p = -1; y >= 0; --y) {\n for (var x = 0; x < dx; ++x) {\n if (mapdata[y][x] < 0.) {\n image.data[++p] = 200;\n image.data[++p] = 200;\n image.data[++p] = 210;\n image.data[++p] = 255;\n } else {\n var c = d3.rgb(color(mapdata[y][x]));\n image.data[++p] = c.r;\n image.data[++p] = c.g;\n image.data[++p] = c.b;\n image.data[++p] = 255;\n }\n }\n }\n\n context.putImageData(image, 0, 0);\n }","title":""},{"docid":"dedeb8d1234809e0adc59ba014af6a62","score":"0.5847137","text":"function renderImageToCanvas(img, canvas, options) {\r\n var iw = img.naturalWidth,\r\n ih = img.naturalHeight;\r\n var width = options.width,\r\n height = options.height;\r\n var ctx = canvas.getContext('2d');\r\n ctx.save();\r\n transformCoordinate(canvas, width, height, options.orientation);\r\n var subsampled = detectSubsampling(img);\r\n if (subsampled) {\r\n iw /= 2;\r\n ih /= 2;\r\n }\r\n var d = 1024; // size of tiling canvas\r\n var tmpCanvas = document.createElement('canvas');\r\n tmpCanvas.width = tmpCanvas.height = d;\r\n var tmpCtx = tmpCanvas.getContext('2d');\r\n var vertSquashRatio = detectVerticalSquash(img, iw, ih);\r\n var dw = Math.ceil(d * width / iw);\r\n var dh = Math.ceil(d * height / ih / vertSquashRatio);\r\n var sy = 0;\r\n var dy = 0;\r\n while (sy < ih) {\r\n var sx = 0;\r\n var dx = 0;\r\n while (sx < iw) {\r\n tmpCtx.clearRect(0, 0, d, d);\r\n tmpCtx.drawImage(img, -sx, -sy);\r\n ctx.drawImage(tmpCanvas, 0, 0, d, d, dx, dy, dw, dh);\r\n sx += d;\r\n dx += dw;\r\n }\r\n sy += d;\r\n dy += dh;\r\n }\r\n ctx.restore();\r\n tmpCanvas = tmpCtx = null;\r\n }","title":""},{"docid":"7d7ea2b3e887d39b3ad5db14b431fc99","score":"0.5846274","text":"function img_update () {\r\n\t\tcontexto.drawImage(canvas, 0, 0);\r\n\t\tcontext.clearRect(0, 0, canvas.width, canvas.height);\r\n }","title":""},{"docid":"a803035406feab74e81384f6829a3c80","score":"0.5832754","text":"render(cameraX, cameraY, cameraScaleX, cameraScaleY, cameraZoom){}","title":""},{"docid":"3947f35a4721e8c03fa55cfe2c9d0876","score":"0.5832374","text":"function writeToCanvas(){\n\t//Create off-screen canvas\n\tvar temp_canvas = document.createElement('canvas'),\n\t\ttemp_canvas_context = temp_canvas.getContext('2d'),\n\t\twrite_y = 0,\n\t\twrite_x = 0;\n\t\n\ttemp_canvas.width = width;\n\ttemp_canvas.height = height;\n\t\n\t// put pixel data on canvas\n\tfor (x = 0; x < individual_blocks.length; x++){\n\t\t//reset to create a new row of blocks\n\t\tif(write_y * block_size > height - block_size){\n\t\t\twrite_y = 0;\n\t\t\twrite_x++;\n\t\t}\n\t\t//Write to temp canvas\n\t\ttemp_canvas_context.putImageData(individual_blocks[x], write_x*block_size, write_y*block_size);\n\t\t//Increment row count\n\t\twrite_y++;\n\t}\n\n\t//Write to final canvas fully rendered effects\n\tcanvas_context.drawImage(temp_canvas, 0, 0);\n\t\n}","title":""},{"docid":"40e9a20ee5e9f999dd9252a2fe69464a","score":"0.58318746","text":"function renderImageToCanvas(img, canvas, options) {\n\t\tvar iw = img.naturalWidth, ih = img.naturalHeight;\n\t\tvar width = options.width, height = options.height;\n\t\tvar x = options.x || 0, y = options.y || 0;\n\t\tvar ctx = canvas.getContext('2d');\n\t\tif (detectSubsampling(img)) {\n\t\t\tiw /= 2;\n\t\t\tih /= 2;\n\t\t}\n\t\tvar d = 1024; // size of tiling canvas\n\t\tvar tmpCanvas = document.createElement('canvas');\n\t\ttmpCanvas.width = tmpCanvas.height = d;\n\t\tvar tmpCtx = tmpCanvas.getContext('2d');\n\t\tvar vertSquashRatio = detectVerticalSquash(img, iw, ih);\n\t\tvar sy = 0;\n\t\twhile (sy < ih) {\n\t\t\tvar sh = sy + d > ih ? ih - sy : d;\n\t\t\tvar sx = 0;\n\t\t\twhile (sx < iw) {\n\t\t\t\tvar sw = sx + d > iw ? iw - sx : d;\n\t\t\t\ttmpCtx.clearRect(0, 0, d, d);\n\t\t\t\ttmpCtx.drawImage(img, -sx, -sy);\n\t\t\t\tvar dx = (sx * width / iw + x) << 0;\n\t\t\t\tvar dw = Math.ceil(sw * width / iw);\n\t\t\t\tvar dy = (sy * height / ih / vertSquashRatio + y) << 0;\n\t\t\t\tvar dh = Math.ceil(sh * height / ih / vertSquashRatio);\n\t\t\t\tctx.drawImage(tmpCanvas, 0, 0, sw, sh, dx, dy, dw, dh);\n\t\t\t\tsx += d;\n\t\t\t}\n\t\t\tsy += d;\n\t\t}\n\t\ttmpCanvas = tmpCtx = null;\n\t}","title":""},{"docid":"40e9a20ee5e9f999dd9252a2fe69464a","score":"0.58318746","text":"function renderImageToCanvas(img, canvas, options) {\n\t\tvar iw = img.naturalWidth, ih = img.naturalHeight;\n\t\tvar width = options.width, height = options.height;\n\t\tvar x = options.x || 0, y = options.y || 0;\n\t\tvar ctx = canvas.getContext('2d');\n\t\tif (detectSubsampling(img)) {\n\t\t\tiw /= 2;\n\t\t\tih /= 2;\n\t\t}\n\t\tvar d = 1024; // size of tiling canvas\n\t\tvar tmpCanvas = document.createElement('canvas');\n\t\ttmpCanvas.width = tmpCanvas.height = d;\n\t\tvar tmpCtx = tmpCanvas.getContext('2d');\n\t\tvar vertSquashRatio = detectVerticalSquash(img, iw, ih);\n\t\tvar sy = 0;\n\t\twhile (sy < ih) {\n\t\t\tvar sh = sy + d > ih ? ih - sy : d;\n\t\t\tvar sx = 0;\n\t\t\twhile (sx < iw) {\n\t\t\t\tvar sw = sx + d > iw ? iw - sx : d;\n\t\t\t\ttmpCtx.clearRect(0, 0, d, d);\n\t\t\t\ttmpCtx.drawImage(img, -sx, -sy);\n\t\t\t\tvar dx = (sx * width / iw + x) << 0;\n\t\t\t\tvar dw = Math.ceil(sw * width / iw);\n\t\t\t\tvar dy = (sy * height / ih / vertSquashRatio + y) << 0;\n\t\t\t\tvar dh = Math.ceil(sh * height / ih / vertSquashRatio);\n\t\t\t\tctx.drawImage(tmpCanvas, 0, 0, sw, sh, dx, dy, dw, dh);\n\t\t\t\tsx += d;\n\t\t\t}\n\t\t\tsy += d;\n\t\t}\n\t\ttmpCanvas = tmpCtx = null;\n\t}","title":""},{"docid":"40e9a20ee5e9f999dd9252a2fe69464a","score":"0.58318746","text":"function renderImageToCanvas(img, canvas, options) {\n\t\tvar iw = img.naturalWidth, ih = img.naturalHeight;\n\t\tvar width = options.width, height = options.height;\n\t\tvar x = options.x || 0, y = options.y || 0;\n\t\tvar ctx = canvas.getContext('2d');\n\t\tif (detectSubsampling(img)) {\n\t\t\tiw /= 2;\n\t\t\tih /= 2;\n\t\t}\n\t\tvar d = 1024; // size of tiling canvas\n\t\tvar tmpCanvas = document.createElement('canvas');\n\t\ttmpCanvas.width = tmpCanvas.height = d;\n\t\tvar tmpCtx = tmpCanvas.getContext('2d');\n\t\tvar vertSquashRatio = detectVerticalSquash(img, iw, ih);\n\t\tvar sy = 0;\n\t\twhile (sy < ih) {\n\t\t\tvar sh = sy + d > ih ? ih - sy : d;\n\t\t\tvar sx = 0;\n\t\t\twhile (sx < iw) {\n\t\t\t\tvar sw = sx + d > iw ? iw - sx : d;\n\t\t\t\ttmpCtx.clearRect(0, 0, d, d);\n\t\t\t\ttmpCtx.drawImage(img, -sx, -sy);\n\t\t\t\tvar dx = (sx * width / iw + x) << 0;\n\t\t\t\tvar dw = Math.ceil(sw * width / iw);\n\t\t\t\tvar dy = (sy * height / ih / vertSquashRatio + y) << 0;\n\t\t\t\tvar dh = Math.ceil(sh * height / ih / vertSquashRatio);\n\t\t\t\tctx.drawImage(tmpCanvas, 0, 0, sw, sh, dx, dy, dw, dh);\n\t\t\t\tsx += d;\n\t\t\t}\n\t\t\tsy += d;\n\t\t}\n\t\ttmpCanvas = tmpCtx = null;\n\t}","title":""},{"docid":"08f13d9d6b6f053a6392a80409c09462","score":"0.58316827","text":"updateBuffer () {\n\t\tthis.buffer = new Array(displayOptions.width * displayOptions.height);\n\n\t\t//console.log(this.bx + \",\"+ this.by);\n\t\tthis.bx = this.bufferEntity.position.x;\n\t\tthis.by = this.bufferEntity.position.y;\n\n\t\tfor (let i = 0; i < bufferOptions.width; i++) {\n\t\t\tfor (let j = 0; j < bufferOptions.height; j++) {\n\t\t\t\t//Tiles are the default thing in the buffer\n\t\t\t\t//position of the screen ON THE MAP.\n\t\t\t\t//BX is NOT on the BUFFER; it is on the MAP.\n\t\t\t\tconst bufferx = this.bx + i;\n\t\t\t\tconst buffery = this.by + j;\n\t\t\t\tconst tile = mapSystem.getTile(bufferx, buffery);\n\t\t\t\tconst isOutsideMap = bufferx < 0 || bufferx >= mapOptions.width || buffery < 0 || buffery >= mapOptions.height;\n\t\t\t\tconst pos = i + j * bufferOptions.width;\n\n\t\t\t\t//Bloody hack: If it's outside the map, then dont draw it\n\t\t\t\tif (!tile || isOutsideMap) {this.buffer[pos] = new DisplayTile('', '', '#000000').query(); continue;}\n\t\t\t\telse if (tile.entityHere && tile.entityHere.display && (tile.hasSeen || tile.inSight)) {\n\t\t\t\t\tconst entity = tile.entityHere;\n\n\t\t\t\t\tthis.buffer[pos] = entity.display.tile.query();\n\t\t\t\t}\n\t\t\t\telse if (tile.hasSeen || tile.inSight) {\n\t\t\t\t\tif (tile.varietyColor) {this.buffer[i+j*bufferOptions.width]=[tile.tileType.tile.character, tile.varietyColor];}\n\t\t\t\t\telse {\n\t\t\t\t\t\tthis.buffer[pos] = tile.tileType.tile.query();\n\t\t\t\t\t\tif (tile.hasSeen && !tile.inSight) {\n\t\t\t\t\t\t\tthis.buffer[pos][1] = ROT.Color.toHex(ROT.Color.interpolate(ROT.Color.fromString(this.buffer[pos][1]), ROT.Color.fromString(\"#000000\")), 0.3);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttile.inSight = false;\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"c73e63cebd939d2a19304c54a3efa69e","score":"0.581672","text":"function img_update () {\n\t\tcontexto.drawImage(canvas, 0, 0);\n\t\tcontext.clearRect(0, 0, canvas.width, canvas.height);\n }","title":""},{"docid":"4e5608455003bf56ce6716308ffdd02c","score":"0.58157545","text":"function renderData(imageData, anim){\t\n\tvar data = getUserInputData();\n\t//identified global variables\n\tvar Xs = 256;\t\t\t\t\t//Xres\n\tvar Ys = 256;\t\t\t\t\t//Yres\n\tvar Zmax = 333333333;\n\tvar Cam = {X:{}, Y:{}, Z:{}}\t//camera\n\tvar worldMatrix = new Array();\n\t//end of global variables\n\t//calculated values from global variables\n\t\n\t//end of calculated values\n\tdata.Light = [\n\t\t\t\t\t{pos:{x:-0.7071, y:0.7071, z:0},color:{r:0.5,g:0.5,b:0.9}},\n\t\t\t\t\t{pos:{x:0, y:-0.7071, z:-0.7071},color:{r:0.9,g:0.2,b:0.3}},//{0, -0.7071, -0.7071}, {0.9, 0.2, 0.3}\n\t\t\t\t\t{pos:{x:0.7071, y:0.0, z:-0.7071},color:{r:0.2,g:0.7,b:0.3}},//{0.7071, 0.0, -0.7071}, {0.2, 0.7, 0.3}\t\n\t\t\t\t];\t//{ {-0.7071, 0.7071, 0}, {0.5, 0.5, 0.9} };\n\tdata.Ks = {r:0.3,g:0.3,b:0.3};\n\tdata.Ka = {r:0.1,g:0.1,b:0.1};\n\tdata.Kd = {r:0.7,g:0.7,b:0.7};\n\tdata.s = 32;//specular coefficient\n\tdata.La = {pos:{x:0, y:0, z:0},color:{r:0.3,g:0.3,b:0.3}}\n\tdata.Zmax = Zmax;\n\t//data.shaderType = 'FLAT';//GOURAUD';//'FLAT'\n\n\tcalculateWorldMatrix(worldMatrix, data)\n\n\tvar FOV = data.FOV\t//focal point\n\tvar C = data.C;\t\t//camera location\n\tvar L = data.L;\t\t//lookat\n\tvar UP = data.UP;\t//up_\n\tif(anim){\n\t\tFOV = data.FOV = anim.FOV?anim.FOV:data.FOV;\n\t\t//data.La.color.r = anim.FOV;\n\t\t//data.Light = anim.Light?anim.Light:data.Light;\n\t\tdata.La = anim.La?anim.La:data.La;\n\t\tdata.proceduralTexture = anim.proceduralTexture;\n\t}\n\tvar d = 1/(tan(FOV/2));\n\n\tcalculateCamera(Cam, C, L, UP)\n\tvar Xsp = calculateXsp(Xs, Ys, Zmax, d);\n\tvar Xpi = calculateXpi(d);\n\tvar Xiw = calculateXiw(Cam, C)\n\tvar Xwm = calculateXwm(worldMatrix)\n\tdata.Xsp = Xsp;\n\tdata.Xpi = Xpi;\n\tdata.Xiw = Xiw;\n\tdata.Xwm = Xwm;\n\n\tvar globalMatrix = new Array();\n\tglobalMatrix.push(Xsp);\n\tglobalMatrix.push(Xpi);\n\n\tvar Xi = matrixMultiply(Xwm, Xiw);\n\tglobalMatrix.push(Xi);\n\t// globalMatrix.push(Xiw)\n\t// globalMatrix.push(Xwm)\n\n\t//removing Scaling and translation from Xi\n\t\n\tvar Xsm = calculateXsm(globalMatrix);\n\n\tXi = normalizeXi(Xi);\n\n\tvar newVertices = applyXForms(vertices, Xsm, Xi, data)\n\n\tshowFinalImage(newVertices, imageData, data)\n}","title":""},{"docid":"95d9c18712a73e59d590100f7325884f","score":"0.57955796","text":"function zoomCanvasTo(_x,_y, oldlevel ,newlevel){\n\tif(showAll){\n\t\tscreenH=$(window).height()-20;\n\n\t\tif(canvasRatio>screenRatio){\n\t\t\tshowAllZoomLevel=(canvas.width/screenW)\n\t\t}else{\n\t\t\tshowAllZoomLevel=(canvas.height/screenH)\n\t\t}\nnewLevel= showAllZoomLevel\n\t\t$(\"#canvasHolder\").css({width:screenW, height:screenH})\n\t\t$(\"#canvasNavHolder\").slideUp(\"slow\").delay(400);\n\t\t$(\"#buttonHolder\").css({marginTop:(screenH+70)+\"px\"});\n\t\t$(\"#canvas\").css({cursor: \"url(images/cursor_zoom_in.cur) 6.5 6.5, crosshair\"})\n\t}else{\n\t\t$(\"#canvasHolder\").css({width:screenW, height:screenH})\n\t\tscreenH=$(window).height()-60;\n\t\t$(\"#buttonHolder\").css({marginTop:(screenH+10)+\"px\"}).clearQueue().show();\n\t\t$(\"#canvasNavHolder\").slideDown(\"slow\").delay(400);\n\t\t$(\"#canvas\").css({cursor: \"url(images/\"+currentCursor+\".cur) \"+cursorPosition[currentCursor]+\" \"+cursorPosition[currentCursor]+\", crosshair\"})\n\t}\n\tcanvasCenter={x:_x,y:_y}\n\tvar oldCanvasW=canvas.width/oldlevel;\n\tvar newCanvasW=canvas.width/newlevel;\n\tvar navCanvasW=canvas.width*navSizePercent;\n\tvar oldCanvasH=canvas.height/oldlevel\n\tvar newCanvasH=canvas.height/newlevel\n\tvar navCanvasH=canvas.height*navSizePercent;\n\tvar navX=navCanvasW*((oldCanvasW-(oldCanvasW-(_x/oldlevel)))/oldCanvasW);\n\tvar navY=navCanvasH*((oldCanvasH-(oldCanvasH-(_y/oldlevel)))/oldCanvasH);\n\tvar newX=newCanvasW*((oldCanvasW-(oldCanvasW-(_x/oldlevel)))/oldCanvasW);\n\tvar newY=newCanvasH*((oldCanvasH-(oldCanvasH-(_y/oldlevel)))/oldCanvasH);\n\tvar offsetX=-(newX)+(screenW/2);\n\tvar offsetY=-(newY)+(screenH/2);\n\tvar canvasBoxH=(screenH*navSizePercent)*newlevel;\n\tvar canvasBoxW=(screenW*navSizePercent)*newlevel;\n\tvar navOffsetX=(navX)-(canvasBoxW/2)\n\tvar navOffsetY=(navY)-(canvasBoxH/2)\n\tcurrentZoomLevel= newlevel\n\t// set to draggable so the animate function can properly set the left/top of canvas. figure out why this is the case…\n\t$(\"#canvas\").draggable({drag:dragfunc})\n\t$(\"#canvas\").animate({\n\t\tleft:offsetX,\n\t\ttop:offsetY,\n\t\twidth:canvas.width/newlevel,\n\t\theight:canvas.height/newlevel\n\t},300,function(){\n\t\tcanvasPos.x=$(\"#canvas\").offset().left;\n\t\tcanvasPos.y=$(\"#canvas\").offset().top;\n\t});\n\t//destroy the draggable instance.\n\t$(\"#canvas\").draggable(\"destroy\")\n\tcanvasPos.x=offsetX;\n\tcanvasPos.y=offsetY;\n\t$(\"#canvasNavBox\").animate({\n\t\tleft:navOffsetX,\n\t\ttop:navOffsetY,\n\t\twidth:canvasBoxW-2,\n\t\theight:canvasBoxH-2\n\t},300);\t\n}","title":""},{"docid":"96a1a139f18770167558a49568463c01","score":"0.57934433","text":"preRenderImage(canvasSize, level, window) {\n\tvar canvas = document.createElement(\"canvas\")\n\tthis.drawImageOnly(canvas, canvasSize, level, window)\n\tthis.preRender = canvas\n\tthis.preRenderLevel = level\n\tthis.preRenderWindow = window\n }","title":""},{"docid":"dc290efda242e3911db3b02507492e93","score":"0.57924485","text":"render() {\n for (let y = 0; y < this.canvas.heigth; y += 1) {\n for (let x = 0; x < this.canvas.width; x += 1) {\n let pixel = x === 0 || y === 0 ? this.canvas.renderAt(x, y) : null;\n\n const line = this.pixels[x];\n if (!line) this.pixels[x] = [];\n\n if (!pixel) {\n for (let s = this.shapes.length - 1; s >= 0; s -= 1) {\n const v = this.shapes[s].renderAt(x, y);\n if (v) {\n pixel = v;\n break;\n }\n }\n }\n\n\n if (!pixel) {\n pixel = this.pixels[x][y] ? this.pixels[x][y] : this.canvas.renderAt(x, y);\n }\n this.pixels[x][y] = pixel;\n this.rl.write(pixel);\n }\n this.rl.write('\\n');\n }\n }","title":""},{"docid":"bafd9f7b63e705a5c55ecda35d72d0ae","score":"0.57905746","text":"updateCanvas(){\n if (this.props.content){\n let data = this.props.content.toImageData();\n const canvas = this.refs.canvas;\n const context = canvas.getContext('2d');\n\n context.clearRect(0, 0, canvas.width, canvas.height);\n context.fillStyle =\"rgba(255, 255, 255, 255)\";\n context.beginPath();\n context.fillRect(0, 0, data.width, data.height);\n context.fill();\n context.globalCompositeOperation = 'source-over';\n\n context.putImageData(this.props.content.toImageData(), 0, 0);\n }\n }","title":""},{"docid":"971f49d1e3e5a8f960547e76ff231e0d","score":"0.57877886","text":"function drawImage(canvas) {\n var context = canvas.node().getContext(\"2d\"),\n image = context.createImageData(dx, dy);\n \n for (var y = 0, p = -1; y < dy; ++y) {\n for (var x = 0; x < dx; ++x) {\n var c = d3.rgb(MAP_COLORS(data[dy-y-1][x]));\n image.data[++p] = c.r;\n image.data[++p] = c.g;\n image.data[++p] = c.b;\n image.data[++p] = 255;\n }\n }\n \n context.putImageData(image, 0, 0);\n }","title":""},{"docid":"7261bff790cbd1b9806b791f2a8260b7","score":"0.57866824","text":"function draw()\n{\n\trenderPass = 0;\n\tmode = $(\"algorithm\").selectedIndex;\n\tconsole.log(\"alg: \" + mode);\n\tdoInverse = $(\"inverse\").checked;\n\n\tdepth_red = parseInt($(\"redText\").value);\n\tdepth_green = parseInt($(\"greenText\").value);\n\tdepth_blue = parseInt($(\"blueText\").value);\n\n\tmax_depth = Math.max(depth_green, Math.max(depth_blue, depth_red));\n\timg_cache = matrix(max_depth, 2, 0.0);\n\n\tresetScore();\n\n\tif ( lookAt === null ) lookAt = lookAtDefault;\n\tif ( zoom === null ) zoom = [zoomStart, zoomStart];\n\n\txRange = [lookAt[0]-zoom[0]/2, lookAt[0]+zoom[0]/2];\n\tyRange = [lookAt[1]-zoom[1]/2, lookAt[1]+zoom[1]/2];\n\trange_x = xRange[1] - xRange[0];\n\trange_y = yRange[1] - yRange[0];\n\n\tif ( reInitCanvas ) {\n\t\treInitCanvas = false;\n\n\t\tcanvas = $('canvasMandelbrot');\n\t\tcanvas.width = window.innerWidth;\n\t\tcanvas.height = window.innerHeight;\n\n\t\tccanvas = $('canvasControls');\n\t\tccanvas.width = window.innerWidth;\n\t\tccanvas.height = window.innerHeight;\n\n\t\tctx = canvas.getContext('2d');\n\t\tctx_img = ctx.createImageData(canvas.width, canvas.height);\n\t}\n\n\tadjustAspectRatio(xRange, yRange, canvas);\n\tconsole.log(\"zoom: \" + zoom[0] + \" \" + zoom[1] + \" mode: \" + mode);\n\n\timg_red = new matrix(canvas.width, canvas.height, 0.0);\n\timg_green = new matrix(canvas.width, canvas.height, 0.0);\n\timg_blue = new matrix(canvas.width, canvas.height, 0.0);\n\n\tupdateHashTag();\n\tupdateInfoBox();\n\n\t// Only enable one render at a time\n\trenderId += 1;\n\n\trender();\n}","title":""},{"docid":"b9d37fea73cf9b30eb9b8bfbdeb5df3b","score":"0.578049","text":"function doRedraw (){\n encoder.addFrame(canvas.getContext(\"2d\"));\n }","title":""},{"docid":"6943a26eac201da2990cbd3cb560a44f","score":"0.57749456","text":"draw() {\n ctx.drawImage(this.img, this.x, this.y, this.width, this.height);\n }","title":""},{"docid":"9055cea84c6f492eb7fec64ac3975270","score":"0.57669914","text":"function initCanvas()\n{\n const canvas = document.getElementById('canvas');\n const ctx = canvas.getContext('2d');\n const canvasWidth = canvas.width;\n const canvasHeight = canvas.height;\n const imageData = ctx.getImageData(0,0,1,1);\n\n\n \n\n \n\n}","title":""},{"docid":"a0fee69d031e26cec344378db4ff4e8c","score":"0.57667243","text":"function initCanvas() {\n buf.canvas.width = circuit.width;\n buf.canvas.height = circuit.height;\n ctx.canvas.width = circuit.width * scale;\n ctx.canvas.height = circuit.height * scale;\n\n ctx.imageSmoothingEnabled = false;\n ctx.fillStyle = \"white\";\n ctx.strokeStyle = \"white\";\n\n switch (scale) {\n case 1:\n rubber.size = 12;\n break;\n case 2:\n rubber.size = 6;\n break;\n case 3:\n rubber.size = 3;\n break;\n case 4:\n rubber.size = 2;\n break;\n default:\n rubber.size = 1;\n break;\n }\n}","title":""},{"docid":"a09ec4cb8df7079d01fbbdd82ff2b1fe","score":"0.5749631","text":"function draw() {\n image(resultImg, 0, 0, 640, 480);\n}","title":""},{"docid":"798b0f2e57c8a7b7b9b81bc4b7213a8f","score":"0.5728994","text":"function render(src){\n var image = new Image();\n \n image.onload = function(){\n ctx.clearRect(0, 0, canvas.width, canvas.height);\n\n canvas.width = 2480;\n canvas.height = 3508;\n\n\n ctx.fillStyle = blendColor;\n ctx.fillRect(0,0,canvas.width,canvas.height);\n // @TODO find solution for no .filter support in IE or Safari. Consider this approach: https://www.html5rocks.com/en/tutorials/canvas/imagefilters/\n ctx.filter = currentFilter + ' contrast(' + contrast + ')';\n ctx.filter += currentFilter + ' brightness(' + brightness + ')';\n ctx.filter += currentFilter + ' blur(' + blur + 'px)';\n ctx.globalCompositeOperation = currentBlend;\n\n // get the scale\n var scale = Math.max(canvas.width / image.width, canvas.height / image.height);\n\n var x = (canvas.width / 2) - (image.width / 2) * scale;\n var y = (canvas.height / 2) - (image.height / 2) * scale;\n ctx.drawImage(image, x, y, image.width * scale, image.height * scale);\n \n\n };\n \n image.src = src;\n}","title":""},{"docid":"8d71917f633b9039f59866d580bb21b4","score":"0.57225996","text":"listenerMouseDownTouchStart(e) {\n // The pointerdown event signals the start of a touch interaction.\n // This event is cached to support 2-finger gestures\n if (e.pointerId) {\n this.evCache.push(e);\n }\n var [pos, touch] = this.pointerEvents(e);\n\n if (this.evCache.length < 2) {\n this.dragStarted = true;\n this.isDragging = this.scaling = false;\n\n this.startCoords = {\n x: pos.x - this.lastMove.x,\n y: pos.y - this.lastMove.y\n };\n\n this.previewZoomStartCoords = {\n x: this.applyScaleToMoveX(this.startCoords.x),\n y: this.applyScaleToMoveY(this.startCoords.y)\n };\n\n this.lastDraggedPos.x = pos.x;\n this.lastDraggedPos.y = pos.y;\n\n this.lastChangeIn = \"main\";\n\n this.queueCanvasDraw();\n\n if (app.dev) {\n // console.log(['start startCoords:', this.startCoords.x, this.startCoords.y, ', pos: ', pos.x, pos.y, ', lastMove: ', this.lastMove.x, this.lastMove.y, ', dragStarted: ', this.dragStarted]);\n // console.log(this.scalingCanvasDrawArgs());\n }\n }\n }","title":""},{"docid":"9b3ae336f361bcff8016b7054fb847d0","score":"0.57220244","text":"function draw(v, c, bc, w, h) {\n // First, draw it into the backing canvas\n bc.drawImage(v, 0, 0, w, h);\n // Grab the pixel data from the backing canvas\n var idata = bc.getImageData(0, 0, w, h);\n var data = idata.data;\n\n // apply filters based on filterMode set with button\n filters(filterMode, data);\n\n idata.data = data;\n // Draw the pixels onto the visible canvas\n c.putImageData(idata, 0, 0);\n // Start over!\n setTimeout(function () {\n\n draw(v, c, bc, w, h);\n }, 0);\n }","title":""},{"docid":"0af984a9e0a6c745a362bfc54f09228c","score":"0.57095057","text":"function placeOntoCanvas() {\n holder.getContext('2d').drawImage(videoElm, 0, 0);\n imageData = holder.getContext('2d').getImageData(0, 0, holder.width, holder.height);\n window.chroma.cutout(imageData, holder.height, holder.width, function(cleaned) {\n imageData.data.set(cleaned);\n output.getContext('2d').putImageData(cleaned, 0, 0);\n });\n }","title":""},{"docid":"140cb2e155fe581e1d4107b24e13efc9","score":"0.57065076","text":"render (ctx, srcX, srcY, srcW, srcH, destX, destY, destW, destH) {\n if (!this.isReady()) { return; }\n\n var srcImg = this._srcImg;\n if (ctx.filter) {\n var filterImg = filterRenderer.renderFilter(ctx, this, srcX, srcY, srcW, srcH);\n if (filterImg) {\n srcImg = filterImg;\n srcX = 0;\n srcY = 0;\n }\n }\n\n ctx.drawImage(srcImg, srcX, srcY, srcW, srcH, destX, destY, destW, destH);\n }","title":""},{"docid":"5ab4868990c30adb6456b071db843359","score":"0.5697599","text":"draw() {\n drawCallCount++;\n return new Uint8ClampedArray(900);\n }","title":""},{"docid":"0c0d88cdeadd2dd560c051c2e5cd4943","score":"0.56916714","text":"function render(canvas){\n var L = parseFloat(document.getElementById(\"L\").value);\n var K = parseFloat(document.getElementById(\"K\").value);\n var G = parseFloat(document.getElementById(\"G\").value);\n var color_func = greyscale_map;\n if (document.getElementById(\"color\").checked)\n color_func = rainbow_colormap;\n var canvas = document.getElementById('example');\n \n if (! canvas) {\n console.log(' Failed to retrieve the < canvas > element');\n return false;\n }\n else {\n\tconsole.log(' Got < canvas > element ');\n }\n // Get the rendering context for 2DCG <- (2)\n var ctx = canvas.getContext('2d');\n\n // Draw the scalar data using an image rpresentation\n var imgData=ctx.getImageData(0,0,canvas.width,canvas.height);\n\n // Store whole image noise data\n var pt_noise = (function()\n {\n var array = [];\n for(var y = 0; y != (canvas.width+1); y++) { array[y] = new Float32Array(canvas.height+1); }\n return array;\n })();\n\n var pt_lic = (function()\n {\n var array = [];\n for(var y = 0; y != (canvas.width+1); y++) { array[y] = new Float32Array(canvas.height+1); }\n return array;\n })();\n\n for (var y=0;y<canvas.height;y++){\n \tfor (var x=0;x<canvas.width;x++)\n {\n pt_noise[x][y] = Math.random();\n }\n }\n\n for (var y=0;y<canvas.height;y++){\n for (var x=0;x<canvas.width;x++)\n {\n var h = 5.0*(x_extent[1]-x_extent[0])/canvas.width;\n var steps = L;\n var pixel = [x,y];\n var numerator = 0.0;\n var denominator = 0.0;\n var pt_pixel = pixel2pt(canvas.width,canvas.height,x_extent,y_extent,x,y);\n var linpts_forward = euler_integration(pixel2pt(canvas.width,canvas.height,x_extent,y_extent,x,y),h,steps,gaussian_gradient);\n var linpts_backward = euler_integration(pixel2pt(canvas.width,canvas.height,x_extent,y_extent,x,y),h,steps,gaussian_gradient_backward);\n\n var temp_forward = 0.0;\n var temp_backward = 0.0;\n var distances_backward = new Float32Array(steps);\n var distances_forward = new Float32Array(steps);\n distances_backward[0]=0.0;\n distances_forward[0]=0.0;\n for (var i = 0; i < steps-1; i++) {\n temp_backward = temp_backward + distance(linpts_backward[i],linpts_backward[i+1]);\n temp_forward = temp_forward + distance(linpts_backward[i],linpts_forward[i+1]);\n distances_backward[i+1]=temp_backward;\n distances_forward[i+1]=temp_forward;\n }\n\n for (var i = 0; i < steps; i++) {\n var pixel_backward = pt2pixel(canvas.width,canvas.height,x_extent,y_extent,linpts_backward[i][0],linpts_backward[i][1]);\n var pixel_forward = pt2pixel(canvas.width,canvas.height,x_extent,y_extent,linpts_forward[i][0],linpts_forward[i][1]);\n var weight_backward = Math.exp(-Math.pow(distances_backward[i],2));\n var weight_forward = Math.exp(-Math.pow(distances_forward[i],2));\n\n if (pixel_backward[0]<0||pixel_backward[0]>canvas.width||pixel_backward[1]<0||pixel_backward[1]>canvas.height||pixel_forward[0]<0||pixel_forward[0]>canvas.width||pixel_forward[1]<0||pixel_forward[1]>canvas.height) {\n numerator = numerator + weight_backward * Math.random() + weight_forward * Math.random();\n }else{\n numerator = numerator + weight_backward * pt_noise[pixel_backward[0]][pixel_backward[1]] + weight_forward * pt_noise[pixel_forward[0]][pixel_forward[1]];\n }\n denominator = denominator + weight_backward + weight_forward;\n }\n numerator = numerator - pt_noise[x][y]; // substract weight(1) * target pixel noise since euler_integration calculate twice(backward,forward)\n denominator = denominator - 1; // substract target pixel weight(1) since euler_integration calculate twice(backward,forward)\n pt_lic[x][y] = numerator/denominator;\n }\n }\n var mn_temp = 256;\n var mx_temp = -256;\n for (var y=0;y<canvas.height;y++)\n for (var x=0;x<canvas.width;x++)\n {\n var grad = gaussian_gradient(pixel2pt(canvas.width,canvas.height,x_extent,y_extent,x,y));\n var fval = Math.sqrt(Math.pow(grad[0],2)+Math.pow(grad[1],2));\n if (fval < mn_temp)\n mn_temp=fval;\n if (fval>mx_temp)\n mx_temp=fval;\n }\n\n var mn = pt_noise[0][0];\n var mx = mn;\n for (var y=0;y<canvas.height;y++)\n for (var x=0;x<canvas.width;x++)\n {\n var fval = pt_noise[x][y];\n if (fval < mn)\n mn=fval;\n if (fval>mx)\n mx=fval;\n }\n\n for (var y=0;y<canvas.height;y++){\n for (var x=0;x<canvas.width;x++)\n {\n if (document.getElementById(\"color\").checked){\n color_func = rainbow_colormap;\n var grad = gaussian_gradient(pixel2pt(canvas.width,canvas.height,x_extent,y_extent,x,y));\n var temp = Math.sqrt(Math.pow(grad[0],2)+Math.pow(grad[1],2));\n var color = color_func(temp,mn_temp,mx_temp);\n i = (y*canvas.width + x)*4\n imgData.data[i]=color[0]*pt_lic[x][y];\n imgData.data[i+1]= color[1]*pt_lic[x][y];\n imgData.data[i+2]= color[2]*pt_lic[x][y];\n imgData.data[i+3]= color[3];\n }else{\n var color = color_func(pt_lic[x][y],mn,mx);\n i = (y*canvas.width + x)*4\n imgData.data[i]=color[0];\n imgData.data[i+1]= color[1];\n imgData.data[i+2]= color[2];\n imgData.data[i+3]= color[3];\n }\n }\n }\n\n\tctx.putImageData(imgData,0,0);\n if (document.getElementById(\"hedgehog\").checked){\n draw_glyphs(K,G,gaussian_gradient,canvas);\n }\n}","title":""},{"docid":"dc784f544afe38e83a43c4e271de62b5","score":"0.5690815","text":"function zoomimg_in() {\n\n imageheight *= 1.1\n imagewidth *= 1.1\n\n}","title":""},{"docid":"f3ac9af4243e79a14ad6360d45b923c1","score":"0.56900203","text":"function restoreDrawingSurface(){\n\tcontext.putImageData(imageData,0,0);\n\t}","title":""},{"docid":"e15f4252d2352a8ca8cb36c54024223e","score":"0.56877136","text":"_draw(){\n if(!this.currentConfig) return;\n const ids = this.streamIds();\n if(this.currentConfig.paint){\n // let the custom paint function handle it\n this.currentConfig.paint(ids, this._canvas, this._context);\n }else{\n const snapshot = {background: null, mixed: []};\n this._context.clearRect(0,0,this._width,this._height);\n const background = this.currentConfig.background()(ids);\n this._context.fillStyle = background;\n snapshot.background = background;\n this._context.fillRect(0,0,this._width, this._height);\n // check if you have to resolve position functions\n const resolveFn = (v, s) => typeof v === \"function\" ? v(s) : v;\n this.currentConfig.calculatedPositions\n // sort according to z-Index\n .sort((a , b) => {\n if(a.zIndex !== undefined && b.zIndex !== undefined){\n return (typeof a.zIndex === \"function\" ? a.zIndex({id: a.assignedId}) : a.zIndex) - (typeof b.zIndex === \"function\" ? b.zIndex({id: b.assignedId}) : b.zIndex);\n }\n else if(a.zIndex !== undefined) return 1;\n else return -1\n })\n // draw each frame\n .forEach((pos, drawIndex) => {\n const stats = {width: this.width, height: this.height, id: pos.assignedId, drawIndex};\n if(pos.source){\n const x = resolveFn(pos.x, stats);\n const y = resolveFn(pos.y, stats);\n const width = resolveFn(pos.width, stats);\n const height = resolveFn(pos.height, stats);\n this._context.drawImage(pos.source, x, y, width, height);\n snapshot.mixed.push({id: pos.assignedId, drawIndex, x, y, width, height});\n }\n });\n // optionally take a snapshot\n if(this._snapshot){\n this._snapshot(snapshot);\n this._snapshot = null;\n }\n }\n }","title":""},{"docid":"9ce64ebcbe8ee222e5858e3f4855e176","score":"0.5683904","text":"function draw_image(){\n ctx.drawImage(img,0,0,CANVAS_WIDTH, CANVAS_HEIGHT);\n}","title":""},{"docid":"a2a5d53aef18a389dffb134dea251f1e","score":"0.56792134","text":"function init() {\n canvas = document.getElementById('fractal');\n canvasPreview = document.getElementById('zoompreview');\n paletStart = document.getElementById(\"rngPalet\");\n\n zoomhistory = [];\n\n /*\n Get references to important elements in the DOM\n */\n // Bounding box info\n elmX1 = document.getElementById('bbx1');\n elmY1 = document.getElementById('bby1');\n elmX2 = document.getElementById('bbx2');\n elmY2 = document.getElementById('bby2');\n\n // cursor location\n elmCursorX = document.getElementById('cursorX');\n elmCursorY = document.getElementById('cursorY');\n\n // zoombox information\n elmZoomX1 = document.getElementById('zoomx1');\n elmZoomX2 = document.getElementById('zoomx2');\n elmZoomY1 = document.getElementById('zoomy1');\n elmZoomY2 = document.getElementById('zoomy2');\n\n elmZoombox = document.getElementById('zoombox');\n elmLivePreview = document.getElementById(\"livepreview\");\n elmDrawtime = document.getElementById(\"drawtime\");\n elmZoomHistoryInfo = document.getElementById(\"zoomhistoryinfo\");\n\n var eventcatcher = document.getElementById(\"eventcatcher\");\n\n var palette = setupPalette(0);\n\n var constants = prepareconstants(canvas, -2.0, 2.0, 2.0, -2.0);\n constants.colorpalette = palette;\n setupZoombox(constants);\n\n AddToHistory(constants);\n\n elmDrawtime.textContent = draw(canvas, constants);\n showBoundingBoxInfo(constants);\n\n eventcatcher.addEventListener(\"mousemove\", (evt) => {\n\n mouseX = evt.offsetX;\n mouseY = evt.offsetY;\n\n // evt.offsetX and evt.offsetY contain the point clicked on the canvas. these need to be translated to the given bounding box\n const cx = constants.boundingBoxX1 + (mouseX / constants.canvas_width ) * constants.boundingBoxWidth;\n const cy = constants.boundingBoxY1 - (mouseY / constants.canvas_height) * constants.boundingBoxHeight;\n\n elmCursorX.textContent = cx.toString().substr(0,6);\n elmCursorY.textContent = cy.toString().substr(0,6);\n\n // make a box 12% x 8% of the bounding box.\n zoombox_x1 = cx - (ZOOMBOX_WIDTH_PERCENTAGE / 100) * constants.boundingBoxWidth / 2;\n zoombox_x2 = cx + (ZOOMBOX_WIDTH_PERCENTAGE / 100) * constants.boundingBoxWidth / 2;\n zoombox_y1 = cy + (ZOOMBOX_HEIGHT_PERCENTAGE / 100) * constants.boundingBoxHeight / 2;\n zoombox_y2 = cy - (ZOOMBOX_HEIGHT_PERCENTAGE / 100) * constants.boundingBoxHeight / 2;\n\n elmZoomX1.textContent = (zoombox_x1.toString()).substr(0,6);\n elmZoomX2.textContent = (zoombox_x2.toString()).substr(0,6);\n elmZoomY1.textContent = (zoombox_y1.toString()).substr(0,6);\n elmZoomY2.textContent = (zoombox_y2.toString()).substr(0,6);\n\n let x = mouseX - zbox_w / 2;\n let y = mouseY - zbox_h / 2\n\n elmZoombox.setAttribute(\"x\", x);\n elmZoombox.setAttribute(\"y\", y);\n\n if (elmLivePreview.checked){\n\n let tempConstants = prepareconstants(canvasPreview, zoombox_x1, zoombox_y1, zoombox_x2, zoombox_y2);\n lastclick = prepareconstants(canvasPreview, zoombox_x1, zoombox_y1, zoombox_x2, zoombox_y2);\n tempConstants.colorpalette = setupPalette(parseInt(paletStart.value));\n draw(canvasPreview, tempConstants);\n }\n });\n\n eventcatcher.addEventListener(\"wheel\", (evt) => {\n if (evt.wheelDelta > 0) {\n ZOOMBOX_WIDTH_PERCENTAGE++;\n ZOOMBOX_HEIGHT_PERCENTAGE++;\n }\n else if (evt.wheelDelta <0) {\n ZOOMBOX_WIDTH_PERCENTAGE--;\n ZOOMBOX_HEIGHT_PERCENTAGE--;\n }\n setupZoombox(constants);\n });\n\n window.addEventListener(\"keypress\", (evt) => {\n switch(evt.code){\n case \"+\":\n case \"NumpadAdd\":\n ZOOMBOX_WIDTH_PERCENTAGE++;\n ZOOMBOX_HEIGHT_PERCENTAGE++;\n break;\n case \"-\":\n case \"NumpadSubtract\":\n ZOOMBOX_WIDTH_PERCENTAGE--;\n ZOOMBOX_HEIGHT_PERCENTAGE--;\n break;\n }\n setupZoombox(constants);\n });\n\n eventcatcher.addEventListener(\"dblclick\", (evt) => {\n\n evt.preventDefault();\n evt.stopPropagation();\n\n AddToHistory(constants);\n\n constants = prepareconstants(canvas, zoombox_x1, zoombox_y1, zoombox_x2, zoombox_y2);\n constants.colorpalette = palette;\n\n elmDrawtime.textContent = draw(canvas, constants);\n showBoundingBoxInfo(constants);\n\n return false;\n });\n\n var lastclick = null;\n\n eventcatcher.addEventListener(\"click\", (evt) => {\n evt.preventDefault();\n evt.stopPropagation();\n\n // left mouse\n let tempConstants = prepareconstants(canvasPreview, zoombox_x1, zoombox_y1, zoombox_x2, zoombox_y2);\n lastclick = prepareconstants(canvasPreview, zoombox_x1, zoombox_y1, zoombox_x2, zoombox_y2);\n tempConstants.colorpalette = palette;\n draw(canvasPreview, tempConstants);\n\n return false;\n });\n\n eventcatcher.addEventListener(\"contextmenu\", evt => {\n evt.preventDefault();\n evt.stopPropagation();\n // right mouse\n if (zoomhistory.length > 0) {\n constants = GetFromHistory();\n showBoundingBoxInfo(constants);\n draw(canvas, constants);\n }\n return false;\n });\n\n\n document.getElementById(\"redraw\").addEventListener(\"click\", (evt) => {\n AddToHistory(constants);\n if (lastclick) {\n constants = prepareconstants(canvas,\n lastclick.boundingBoxX1,\n lastclick.boundingBoxY1,\n lastclick.boundingBoxX2,\n lastclick.boundingBoxY2,\n );\n constants.colorpalette = palette;\n elmDrawtime.textContent = draw(canvas, constants);\n\n }\n });\n\n paletStart.addEventListener(\"change\", (evt) => {\n palette = setupPalette(parseInt(paletStart.value));\n\n if (lastclick) {\n lastclick.colorpalette = palette;\n draw(canvasPreview, lastclick);\n }\n }, false);\n}","title":""},{"docid":"77d4665a16e9e359d6df166a5bc4552b","score":"0.5677521","text":"function draw_on_canvas()\n{\n GLOBAL_OVERRIDE = edit_image_draw;\n}","title":""},{"docid":"c34cc33f5a5d501191ae8c17df48f421","score":"0.5677143","text":"render() {\n ctx.drawImage( Resources.get( this.image ), this.posX, this.posY );\n }","title":""},{"docid":"d58daa4d3f1e4ee5657d4f8de073fbb0","score":"0.56621003","text":"function DrawImageToHelpUserPutTheirHandOverTheDevice(){\n\timage(img, 0, 0, window.innerWidth/2, window.innerHeight/2);\n}","title":""},{"docid":"be1dc87dfc806cbc0787d9305453fcbb","score":"0.56600535","text":"function copy_viewport(src, dest) \n{\n dest.getContext(\"2d\").clearRect(0,0,dest.width,dest.height);\n dest.getContext(\"2d\").drawImage(src,0,0);\n}","title":""},{"docid":"68e4c54b3e06afe901ff48713b90f3b5","score":"0.56491554","text":"function draw(adjust) {\n //ctx.clearRect(0, 0, canvas.width, canvas.height)\n ctx.setTransform(scalef,0,0,scalef,offsetx,offsety)\n var r = detectVerticalSquash(img)\n ctx.drawImage(img, 0, 0, width, height/r)\n \n if ($('input[name=res]').is(':checked')) _draw_res_rings()\n if ($('input[name=ice]').is(':checked')) _draw_ice_rings()\n }","title":""},{"docid":"0e972b1626d900519c8e6ca70842a07f","score":"0.5636554","text":"function zoomimg_out() {\n\n imageheight /= 1.1\n imagewidth /= 1.1\n\n}","title":""}],"string":"[\n {\n \"docid\": \"2630d8bc28c8735c9ed296f6a319091e\",\n \"score\": \"0.66202974\",\n \"text\": \"function render() {//used in run():271\\n requestAnimationFrame(render);\\n\\n lHis && lHis.style(\\\"display\\\", setting.showHistogram ? null : \\\"none\\\");\\n lLeg && lLeg.style(\\\"display\\\", setting.showCountExt ? null : \\\"none\\\");\\n\\n if (valid) return;\\n\\n valid = true;\\n\\n ctx.save();\\n ctx.clearRect(0, 0, _w, _h);\\n\\n redrawCanvas();//:618\\n\\n ctx.drawImage(bufCanvas, 0, 0);\\n ctx.restore();\\n\\n valid = false;\\n\\n // console.log(\\\"rendered!\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bb531dbad4b57442d86c93c02a2e7b9\",\n \"score\": \"0.6546924\",\n \"text\": \"function update_spectrum() {\\n\\n if (!windowLeft)\\n requestAnimationFrame(update_spectrum);\\n\\n spec_now = performance.now();\\n spec_elapsed = spec_now - spec_then;\\n\\n //if (spec_elapsed > fpsInterval)\\n {\\n spec_then = spec_now - (spec_elapsed % fpsInterval);\\n //console.log(\\\"spectrum interval: \\\" + spec_elapsed.toFixed(3) + \\\" [ms]\\\", \\\"fps = \\\", Math.round(1000 / spec_elapsed)) ;\\n\\n //image\\n try {\\n let data = image_stack.pop();\\n image_stack = [];\\n\\n ctx.clearRect(data.px, data.py, data.zoomed_size, data.zoomed_size);\\n\\n var imageCanvas;\\n\\n if (composite_view)\\n imageCanvas = compositeCanvas;\\n else\\n imageCanvas = imageContainer[va_count - 1].imageCanvas;//if composite_view use compositeCanvas\\n\\n if (zoom_shape == \\\"square\\\") {\\n ctx.fillStyle = \\\"rgba(0,0,0,0.3)\\\";\\n ctx.fillRect(data.px, data.py, data.zoomed_size, data.zoomed_size);\\n\\n ctx.drawImage(imageCanvas, data.x - data.clipSize, data.y - data.clipSize, 2 * data.clipSize + 1, 2 * data.clipSize + 1, data.px, data.py, data.zoomed_size, data.zoomed_size);\\n }\\n\\n if (zoom_shape == \\\"circle\\\") {\\n ctx.save();\\n ctx.beginPath();\\n ctx.arc(data.px + data.zoomed_size / 2, data.py + data.zoomed_size / 2, data.zoomed_size / 2, 0, 2 * Math.PI, true);\\n\\n ctx.fillStyle = \\\"rgba(0,0,0,0.3)\\\";\\n ctx.fill();\\n\\n ctx.closePath();\\n ctx.clip();\\n ctx.drawImage(imageCanvas, data.x - data.clipSize, data.y - data.clipSize, 2 * data.clipSize + 1, 2 * data.clipSize + 1, data.px, data.py, data.zoomed_size, data.zoomed_size);\\n ctx.restore();\\n }\\n }\\n catch (e) {\\n //console.log(e) ;\\n }\\n\\n //spectrum\\n try {\\n let go_ahead = true;\\n let new_seq_id = 0;\\n\\n for (let index = 0; index < va_count; index++) {\\n let len = spectrum_stack[index].length;\\n\\n if (len > 0) {\\n let id = spectrum_stack[index][len - 1].id;\\n\\n if (id <= last_seq_id)\\n go_ahead = false;\\n else\\n new_seq_id = Math.max(new_seq_id, id);\\n }\\n else\\n go_ahead = false;\\n }\\n\\n if (go_ahead) {\\n last_seq_id = new_seq_id;\\n console.log(\\\"last_seq_id:\\\", last_seq_id);\\n\\n //pop all <va_count> spectrum stacks\\n var data = [];\\n\\n for (let index = 0; index < va_count; index++) {\\n data.push(spectrum_stack[index].pop().spectrum);\\n spectrum_stack[index] = [];\\n }\\n\\n plot_spectrum(data);\\n replot_y_axis();\\n\\n last_spectrum = data;\\n }\\n\\n }\\n catch (e) {\\n console.log(e);\\n }\\n\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"988d067ea30d7e3e74f15ea22a6d534e\",\n \"score\": \"0.6491379\",\n \"text\": \"drawImage(canvas, canvasSize, level, window, maskVisibility, maskColours) {\\n\\t//console.log(\\\"draw\\\", level, window)\\n\\t// Get the dimensions\\n\\tvar height = this.data.length\\n\\tvar width = this.data[0].length\\n\\tvar pixHeight = this.pixHeight\\n\\tvar pixWidth = this.pixWidth\\n\\t\\n\\tvar size = canvasSize\\n\\tif (height > width) {\\n\\t // Calculate unscaled height\\n\\t var actualSize = height*pixHeight\\n\\t \\n\\t // Size the canvas correctly\\n\\t var scale = size/actualSize\\n\\t this.scale = scale\\n\\t canvas.height = size\\n\\t canvas.width = width * pixWidth * scale\\n\\t}\\n\\telse {\\n\\t // Calc unscaled width\\n\\t var actualSize = width*pixWidth\\n\\t // Size canvas\\n\\t var scale = size/actualSize\\n\\t this.scale = scale\\n\\t canvas.width = size\\n\\t canvas.height = height*pixHeight*scale\\n\\t}\\n\\n\\t// Clear the canvas\\n\\tvar ctx = canvas.getContext(\\\"2d\\\")\\n\\tctx.clearRect(0, 0, width*scale, height*scale);\\n\\t// Draw the image\\n\\tif (this.preRender !== null && this.preRenderLevel === level\\n\\t && this.preRenderWindow === window) {\\n\\t ctx.drawImage(this.preRender, 0, 0)\\n\\t}\\n\\telse {\\n\\t this.drawImageOnly(canvas, canvasSize, level, window, maskVisibility, maskColours)\\n\\t}\\n\\t// Draw the image onto the canvas\\n\\tfor (var row = 0; row < height; row++) {\\n\\t for (var col = 0; col < width; col++) { \\n\\t\\tfor (var i = 0; i < this.masks.length; i++) {\\n\\t\\t if (maskVisibility[i] === false) {\\n\\t\\t\\tcontinue\\n\\t\\t }\\n\\t\\t if (this.currentMask === i) {\\n\\t\\t\\tvar mask = this.tempMask\\n\\t\\t }\\n\\t\\t else {\\n\\t\\t\\tvar mask = this.masks[i]\\n\\t\\t }\\n\\t\\t if (row > 0 && mask[row][col] !== mask[row - 1][col]) {\\n\\t\\t\\tif (mask[row][col] !== 0) {\\n\\t\\t\\t // Set the color to the one specified\\n\\t\\t\\t ctx.fillStyle = maskColours[i][mask[row][col] - 1]; \\n\\t\\t\\t ctx.fillRect(Math.floor(col * pixWidth * scale), Math.floor(row * pixHeight*scale), Math.ceil(pixWidth*scale), Math.ceil(0.33*pixHeight*scale));\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (mask[row - 1][col] !== 0) {\\n\\t\\t\\t ctx.fillStyle = maskColours[i][mask[row - 1][col] - 1];\\n\\t\\t\\t ctx.fillRect(Math.floor(col * pixWidth * scale), Math.floor((row-0.33) * pixHeight*scale), Math.ceil(pixWidth*scale), Math.ceil(0.33*pixHeight*scale));\\n\\t\\t\\t}\\n\\t\\t }\\n\\n\\t\\t if (col > 0 && mask[row][col] !== mask[row][col - 1]) {\\n\\t\\t\\tif (mask[row][col] !== 0) {\\n\\t\\t\\t ctx.fillStyle = maskColours[i][mask[row][col] - 1]; \\n\\t\\t\\t ctx.fillRect(Math.floor(col * pixWidth * scale), Math.floor(row * pixHeight*scale), Math.ceil(0.33*pixWidth*scale), Math.ceil(pixHeight*scale));\\n\\t\\t\\t}\\n\\t\\t\\tif (mask[row][col - 1] !== 0) {\\n\\t\\t\\t ctx.fillStyle = maskColours[i][mask[row][col - 1] - 1]; \\n\\t\\t\\t ctx.fillRect(Math.floor((col-0.33) * pixWidth * scale), Math.floor(row * pixHeight*scale), Math.ceil(0.33*pixWidth*scale), Math.ceil(pixHeight*scale));\\n\\t\\t\\t}\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tthis.boundingRect[1] = this.rowToCoord(this.boundingRectPix[1])\\n\\tthis.boundingRect[3] = this.rowToCoord(this.boundingRectPix[3])\\n\\tthis.boundingRect[0] = this.colToCoord(this.boundingRectPix[0])\\n\\tthis.boundingRect[2] = this.colToCoord(this.boundingRectPix[2])\\n\\tctx.beginPath();\\n\\tctx.rect(this.boundingRect[0],\\n\\t\\t this.boundingRect[1],\\n\\t\\t this.boundingRect[2] - this.boundingRect[0],// * (pixWidth * scale),\\n\\t\\t this.boundingRect[3] - this.boundingRect[1])\\n\\tctx.lineWidth = 3\\n\\tctx.strokeStyle = 'yellow';\\n\\tctx.stroke()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08383a6efbdacedf1475ae2f12976aab\",\n \"score\": \"0.6488885\",\n \"text\": \"draw(ctx) {\\n const smoothing = this.ctx.imageSmoothingEnabled\\n ctx.imageSmoothingEnabled = this.useImageSmoothing\\n this.ctx.putImageData(this.imageData, 0, 0)\\n // this.updateCanvas()\\n util.fillCtxWithImage(ctx, this.ctx.canvas)\\n ctx.imageSmoothingEnabled = smoothing\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"903cc3c263665d2894bf082297ae17b7\",\n \"score\": \"0.6474566\",\n \"text\": \"_fillMipMap() {\\n var ctx = this.canvas.getContext('2d');\\n\\n // First zoom-level comes from the image\\n var to = this.coordinates[0];\\n ctx.drawImage(this.image, to[0], to[1], to[2], to[3]);\\n\\n // The rest are copy actions internal to the canvas/context\\n for (let iterations = 1; iterations < this.NUM_ITERATIONS; iterations++) {\\n let from = this.coordinates[iterations - 1];\\n let to = this.coordinates[iterations];\\n\\n ctx.drawImage(this.canvas,\\n from[0], from[1], from[2], from[3],\\n to[0], to[1], to[2], to[3]\\n );\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb145e0e4ba898867a28ac5ca010b145\",\n \"score\": \"0.64403844\",\n \"text\": \"_fillMipMap() {\\n const ctx = this.canvas.getContext(\\\"2d\\\");\\n\\n // First zoom-level comes from the image\\n const to = this.coordinates[0];\\n ctx.drawImage(this.image, to[0], to[1], to[2], to[3]);\\n\\n // The rest are copy actions internal to the canvas/context\\n for (let iterations = 1; iterations < this.NUM_ITERATIONS; iterations++) {\\n const from = this.coordinates[iterations - 1];\\n const to = this.coordinates[iterations];\\n\\n ctx.drawImage(\\n this.canvas,\\n from[0],\\n from[1],\\n from[2],\\n from[3],\\n to[0],\\n to[1],\\n to[2],\\n to[3]\\n );\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3898c71b1ac81e50f8a504723b24ede\",\n \"score\": \"0.64184576\",\n \"text\": \"function drawImage(canvas) {\\n\\t // canvas is a d3 selection.\\n\\t //var plotdata = canvas.data()[0];\\n\\t var maxColorIndex = 255,\\n\\t overflowIndex = 256,\\n\\t context = canvas.node().getContext(\\\"2d\\\"),\\n\\t ctx = backing_canvas.getContext(\\\"2d\\\");\\n\\n\\t if (_redraw_backing) {\\n\\t _redraw_backing = false;\\n\\t var height = source_data.length,\\n\\t width = source_data[0].length;\\n\\t if (backing_image == null || backing_canvas.width != width || backing_canvas.height != height) {\\n\\t backing_canvas.width = width;\\n\\t backing_canvas.height = height;\\n\\t backing_image = ctx.createImageData(width, height);\\n\\t }\\n\\t var data = backing_image.data;\\n\\t var yp,\\n\\t pp = 0;\\n\\t for (var yt = 0, p = -1; yt < height; ++yt) {\\n\\t yp = dims.ydim - 1 - yt; // y-axis starts at the top!\\n\\t for (var xp = 0; xp < width; ++xp, pp++) {\\n\\t var c = _colormap_array[plotdata[pp]];\\n\\t data[++p] = c.r;\\n\\t data[++p] = c.g;\\n\\t data[++p] = c.b;\\n\\t data[++p] = c.a;\\n\\t }\\n\\t }\\n\\t ctx.putImageData(backing_image, 0, 0);\\n\\t }\\n\\n\\t //context.mozImageSmoothingEnabled = false;\\n\\t //context.webkitImageSmoothingEnabled = false;\\n\\t //context.msImageSmoothingEnabled = false;\\n\\t //context.imageSmoothingEnabled = false;\\n\\n\\n\\t context.clearRect(0, 0, context.canvas.width, context.canvas.height);\\n\\t if (context.mozImageSmoothingEnabled) context.mozImageSmoothingEnabled = false;\\n\\t if (context.imageSmoothingEnabled) context.imageSmoothingEnabled = false;\\n\\t if (context.msImageSmoothingEnabled) context.msImageSmoothingEnabled = false;\\n\\t if (context.webkitImageSmoothingEnabled) context.webkitImageSmoothingEnabled = false;\\n\\t var sxdx = get_sxdx();\\n\\t context.drawImage(ctx.canvas, sxdx.sx, sxdx.sy, sxdx.sw, sxdx.sh, sxdx.dx, sxdx.dy, sxdx.dw, sxdx.dh);\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44e4e1da9f8e49af0bfc86bf334e43ec\",\n \"score\": \"0.6397034\",\n \"text\": \"function render(){\\n var start = Date.now();\\n\\n for (var i = 0; i <= canvas.width; i++){\\n for (var j = 0; j <= canvas.height; j++){\\n var ray = camera.castRay(i, j);\\n setPixel(i, j, trace(ray, scene.bounce_depth) );\\n }\\n }\\n\\n //carica immagine calcolata\\n context.putImageData(imageBuffer,0,0);\\n\\n var end = Date.now();\\n $('#log').html(\\\"rendered in: \\\"+(end-start)+\\\"ms\\\");\\n console.log(\\\"rendered in: \\\"+(end-start)+\\\"ms\\\");\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8c9a1ad46f72f78002a0bf35078ea1c\",\n \"score\": \"0.6391222\",\n \"text\": \"updateCanvas() {\\n this.shootAreaCtx.putImageData(this.shootAreaData, 0, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"384a81d8c891c9f9a85110558b0d2f4d\",\n \"score\": \"0.6380239\",\n \"text\": \"function drawPixelated(img,context,zoom,x,y){\\n if (!zoom) zoom=4; if (!x) x=0; if (!y) y=0;\\n if (!img.id) img.id = \\\"__img\\\"+(drawPixelated.lastImageId++);\\n var idata = drawPixelated.idataById[img.id];\\n if (!idata){\\n var ctx = document.createElement('canvas').getContext('2d');\\n ctx.width = img.width;\\n ctx.height = img.height;\\n ctx.drawImage(img,0,0);\\n idata = drawPixelated.idataById[img.id] = ctx.getImageData(0,0,img.width,img.height).data;\\n }\\n for (var x2=0;x2<img.width;++x2){\\n for (var y2=0;y2<img.height;++y2){\\n var i=(y2*img.width+x2)*4;\\n var r=idata[i ];\\n var g=idata[i+1];\\n var b=idata[i+2];\\n var a=idata[i+3];\\n context.fillStyle = \\\"rgba(\\\"+r+\\\",\\\"+g+\\\",\\\"+b+\\\",\\\"+(a/255)+\\\")\\\";\\n context.fillRect(x+x2*zoom, y+y2*zoom, zoom, zoom);\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc71d73016587d246b054af8f9e9bacb\",\n \"score\": \"0.63600194\",\n \"text\": \"drawBuffer() {\\n const nominalWidth = Math.round(\\n this.getDuration() *\\n this.params.minPxPerSec *\\n this.params.pixelRatio\\n );\\n const parentWidth = this.drawer.getWidth();\\n let width = nominalWidth;\\n let start = this.drawer.getScrollX();\\n let end = Math.max(start + parentWidth, width);\\n // Fill container\\n if (\\n this.params.fillParent &&\\n (!this.params.scrollParent || nominalWidth < parentWidth)\\n ) {\\n width = parentWidth;\\n start = 0;\\n end = width;\\n }\\n\\n let peaks;\\n peaks = this.backend.getPeaks(width, start, end);\\n this.drawer.drawPeaks(peaks, width, start, end);\\n this.fireEvent('redraw', peaks, width);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"049a85a5ce2971b79c4fdcb1453f3833\",\n \"score\": \"0.6356626\",\n \"text\": \"fitToScreen() {\\n var rect = this.getRectofPoints(this.points);\\n var rateX = 0, rateY = 0;\\n this.wx = 0;\\n this.wy = 0;\\n rateX = (this.canvas.width-20)/(rect.xMax-rect.xMin);\\n rateY = (this.canvas.height-20)/(rect.yMax-rect.yMin);\\n if(rateX > rateY) {\\n this.scale = 1 * rateY;\\n }\\n else {\\n this.scale = 1 * rateX;\\n }\\n this.wx = (this.zoomedX(rect.xMin)-(this.canvas.width-this.zoomedX(rect.xMax)+this.zoomedX(rect.xMin))/2)/this.scale; // world zoom origin\\n this.wy = (this.zoomedY(rect.yMin)-(this.canvas.height-this.zoomedY(rect.yMax)+this.zoomedY(rect.yMin))/2)/this.scale;\\n this.drawLine();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4d1c473e46766e04d475426bbb57b47\",\n \"score\": \"0.6347767\",\n \"text\": \"function takeScreenshot(){\\n\\tif(!gl){return;}\\n\\tgl.bindFramebuffer(gl.FRAMEBUFFER, framebuffer);\\n\\trender(1);\\nvar ddd1 = new Date().getTime();\\n\\n\\tvar offscreenView = new Uint8Array(offscreenRenderWidth*offscreenRenderHeight*4);\\nvar ddd2 = new Date().getTime();\\nconsole.log((ddd2-ddd1));\\t\\n\\tgl.readPixels(0,0,offscreenRenderWidth,offscreenRenderHeight,gl.RGBA,gl.UNSIGNED_BYTE,offscreenView);\\nvar ddd3 = new Date().getTime();\\nconsole.log(\\\"readpixels: \\\"+(ddd3-ddd2));\\t\\n\\tgl.bindFramebuffer(gl.FRAMEBUFFER, null);\\n\\trender(0);\\nvar ddd4 = new Date().getTime();\\nconsole.log((ddd4-ddd3));\\n\\t//omzetten naar bmp\\nvar cnvs=document.getElementById(\\\"canvasOffscreenHelper\\\");\\t\\n\\t$('#canvasOffscreenHelper').attr('width',offscreenRenderWidth);\\n\\t$('#canvasOffscreenHelper').attr('height',offscreenRenderHeight);\\n\\tvar ctxt=cnvs.getContext(\\\"2d\\\");\\n\\tvar imgData=ctxt.createImageData(offscreenRenderWidth,offscreenRenderHeight);\\nvar ddd5 = new Date().getTime();\\nconsole.log((ddd5-ddd4));\\n\\tfor(var i=0;i<offscreenRenderHeight;i+=1){\\t\\t\\t\\t\\t\\t\\t//put arraybuffer content in canvas, flipped vertically\\n\\t\\tfor(var j=0;j<=4*offscreenRenderWidth-4;j=j+1){\\n\\t\\t\\timgData.data[j+i*4*offscreenRenderWidth]=offscreenView[j-i*4*offscreenRenderWidth+4*offscreenRenderWidth*offscreenRenderHeight];\\n\\t\\t}\\n \\t}\\nvar ddd6 = new Date().getTime();\\nconsole.log((ddd6-ddd5));\\n\\tctxt.putImageData(imgData,0,0);\\n\\tvar img = cnvs.toDataURL(\\\"image/jpeg\\\");;\\n\\tdocument.getElementById(\\\"imgOffscreenHelper\\\").src=img;\\n\\tdocument.getElementById(\\\"aOffscreenHelper\\\").href = img;\\n\\tdocument.getElementById(\\\"aOffscreenHelper\\\").download=document.getElementById(\\\"inputOffscreenName\\\").value+\\\".jpeg\\\";\\n \\n\\tvar clickEvent = document.createEvent(\\\"MouseEvent\\\");\\n\\tclickEvent.initMouseEvent(\\\"click\\\", true, true, window, 0, 0, 0, 0, 0, false, false, false, false, 0, null); \\n\\tdocument.getElementById(\\\"aOffscreenHelper\\\").dispatchEvent(clickEvent);\\n\\n\\tconsole.log(\\\"done taking screenshot\\\");\\n\\t\\n\\treturn img;\\n\\t\\tvar ddd7 = new Date().getTime();\\n\\nconsole.log((ddd7-ddd6));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ecc06b76b87aa7e363f56a8cbe36df8\",\n \"score\": \"0.63405704\",\n \"text\": \"function startRender() {\\n\\tlet v4 = viewWidth / 2;\\n\\tlet h4 = v4 * heightToWidthRatio;\\n\\tmandelBitmap.render(curCR - v4, curCI + h4,\\n\\t\\tcurCR + v4, curCI - h4);\\n\\n\\tlet zoomLevel = Math.pow(zoomFactor, curZoom);\\n\\tzoomText.innerHTML = zoomLevel;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc748b66a2f040b49c54db5cb20d6381\",\n \"score\": \"0.6309445\",\n \"text\": \"function updateCanvas() {\\n ctx.putImageData(canvasData, 0, 0);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"985ad0aef7e6916e81305cbef69e1cd8\",\n \"score\": \"0.62963384\",\n \"text\": \"function cw_drawScreen() {\\n ctx.clearRect(0, 0, canvas.width, canvas.height);\\n ctx.save();\\n cw_setCameraPosition();\\n ctx.translate(200 - (camera_x * zoom), 200 + (camera_y * zoom));\\n ctx.scale(zoom, -zoom);\\n cw_drawFloor();\\n ghost_draw_frame(ctx, ghost);\\n cw_drawCars();\\n ctx.restore();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dcbb2d49e2b20d59a3fdb55dc4a48ee3\",\n \"score\": \"0.62800926\",\n \"text\": \"function doRedraw() {\\n\\n doClearScreen(false);\\n\\n var lowerFrameStart = visibleWidth * canvasCharacterHeight; // redrawX + visibleXStart\\n \\n if (canvases==1) {\\n\\t\\t\\n var sx = visibleXStart * canvasCharacterWidth; // The x coordinate of the upper left corner of the rectangle from which the ImageData will be extracted.\\n var sy = (visibleHeight + visibleYStart + 1) * canvasCharacterHeight; // The y coordinate of the upper left corner of the rectangle from which the ImageData will be extracted.\\n var sw = (visibleWidth) * canvasCharacterWidth; // The width of the rectangle from which the ImageData will be extracted.\\n var sh = (visibleHeight - 1) * canvasCharacterHeight; // The height of the rectangle from which the ImageData will be extracted. \\n //console.log(\\\"sx: \\\"+sx+\\\" sy: \\\"+sy+\\\" sw: \\\"+sw+\\\" sh: \\\"+sh);\\n var imgData = ctx.getImageData(sx, sy, sw, sh);\\n ctx.putImageData(imgData, 0, 0);\\n \\n } else {\\n var sx = visibleXStart * canvasCharacterWidth; // The x coordinate of the upper left corner of the rectangle from which the ImageData will be extracted.\\n var sy = ( visibleYStart ) * canvasCharacterHeight; // The y coordinate of the upper left corner of the rectangle from which the ImageData will be extracted.\\n var sw = (visibleWidth) * canvasCharacterWidth; // The width of the rectangle from which the ImageData will be extracted.\\n var sh = (visibleHeight - 1) * canvasCharacterHeight; // The height of the rectangle from which the ImageData will be extracted. \\n //console.log(\\\"sx: \\\"+sx+\\\" sy: \\\"+sy+\\\" sw: \\\"+sw+\\\" sh: \\\"+sh);\\n var imgData = ctx2.getImageData(sx, sy, sw, sh);\\n ctx.putImageData(imgData, 0, 0);\\n \\n }\\n\\n updateScrollbarX(true, 0); // draw the scrollbar at the bottom, x position = 0 \\n updateScrollbarY(true, 0); // Show a part of the scrollbar again\\n //\\talert(sx+\\\"==\\\"+sy+\\\"==\\\"+sw+\\\"==\\\"+sh)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de9695d9bc964b082de802eb445c8aac\",\n \"score\": \"0.62595356\",\n \"text\": \"function redrawCanvas() {//used in render():890\\n\\n bufCtx.save();\\n bufCtx.clearRect(0, 0, _w, _h);\\n\\n if (setting.blendingLighter && bufCtx.globalCompositeOperation == 'source-over') {\\n bufCtx.globalCompositeOperation = 'lighter';\\n //darker\\n }\\n else if (!setting.blendingLighter && bufCtx.globalCompositeOperation == 'lighter') {\\n bufCtx.globalCompositeOperation = 'source-over';\\n }\\n\\n bufCtx.translate(lastEvent.translate[0], lastEvent.translate[1]);\\n bufCtx.scale(lastEvent.scale, lastEvent.scale);\\n\\n var n, l, i, j,\\n src, trg,\\n iw, ih,\\n img,\\n d, beg,\\n c, x, y, s;\\n\\n\\n if (setting.showEdge || selected){\\n n = links.entries();\\n if (!setting.showEdge)\\n n = n.filter(function(d) {\\n return d.key.indexOf(selected.id) >= 0;\\n });\\n\\n l = n.length;\\n\\n bufCtx.save();\\n bufCtx.lineCap=\\\"round\\\";\\n bufCtx.lineJoin=\\\"round\\\";\\n\\n while(--l > -1) {\\n d = n[l].value;\\n src = d.source;\\n trg = d.target;\\n j = src.type == typeNode.child;\\n\\n c = curColor(j ? src : trg);\\n\\n bufCtx.beginPath();\\n bufCtx.strokeStyle = c.toString();\\n bufCtx.lineWidth = (radius(nr(d)) * 3) || 1;\\n\\n var sx = j ? trg.x : src.x,\\n sy = j ? trg.y : src.y,\\n tx = !j ? trg.x : src.x,\\n ty = !j ? trg.y : src.y;\\n\\n bufCtx.moveTo(sx, sy);\\n var x3 = .3 * ty - .3 * sy + .8 * sx + .2 * tx,\\n y3 = .8 * sy + .2 * ty - .3 * tx + .3 * sx,\\n x4 = .3 * ty - .3 * sy + .2 * sx + .8 * tx,\\n y4 = .2 * sy + .8 * ty - .3 * tx + .3 * sx;\\n bufCtx.bezierCurveTo(x3, y3, x4, y4, tx, ty);\\n bufCtx.stroke();\\n }\\n bufCtx.restore();\\n }//end of if (setting.showEdge || selected){\\n\\n if (setting.showChild) {\\n n = _force.nodes()\\n .filter(filterVisible)\\n .sort(sortBySize)\\n .sort(sortByOpacity)\\n .sort(sortByColor)\\n ;\\n\\n l = n.length;\\n\\n c = null;\\n i = 100;\\n j = true;\\n beg = false;\\n\\n bufCtx.globalAlpha = i * .01;\\n\\n while(--l > -1) {\\n d = n[l];\\n\\n if (i != curOpacity(d)) {\\n i = curOpacity(d);\\n bufCtx.globalAlpha = i * .01;\\n }\\n\\n if (!c || compereColor(c, curColor(d))) {\\n c = curColor(d);\\n j = false;\\n }\\n\\n if (!j) {\\n if (!setting.showHalo) {\\n if (beg) {\\n bufCtx.closePath();\\n bufCtx.fill();\\n bufCtx.stroke();\\n }\\n\\n bufCtx.beginPath();\\n beg = true;\\n bufCtx.strokeStyle = \\\"none\\\";\\n bufCtx.fillStyle = c.toString();\\n }\\n else\\n img = colorize(particle, c.r, c.g, c.b, 1);\\n j = true;\\n }\\n\\n x = Math.floor(d.x);\\n y = Math.floor(d.y);\\n\\n\\n if (setting.fadingTail && setting.showTrack) {\\n //bufCtx.save();\\n bufCtx.lineCap=\\\"round\\\";\\n //bufCtx.lineJoin=\\\"round\\\";\\n bufCtx.lineWidth = (radius(nr(d)) / 4) || 1;\\n bufCtx.fillStyle = \\\"none\\\";\\n bufCtx.strokeStyle = c.toString();\\n\\n var rs = d.paths.slice(0).reverse(),\\n lrs = rs.length,\\n cura = bufCtx.globalAlpha;\\n\\n for (var p in rs) {\\n if (!rs.hasOwnProperty(p))\\n continue;\\n\\n bufCtx.beginPath();\\n if (p < 1)\\n bufCtx.moveTo(x, y);\\n else\\n bufCtx.moveTo(\\n Math.floor(rs[p - 1].x),\\n Math.floor(rs[p - 1].y)\\n );\\n bufCtx.lineTo(\\n Math.floor(rs[p].x),\\n Math.floor(rs[p].y)\\n );\\n bufCtx.stroke();\\n bufCtx.globalAlpha = ((lrs - p)/lrs) * cura;\\n }\\n //bufCtx.restore();\\n bufCtx.globalAlpha = cura;\\n }\\n\\n if (!setting.fadingTail && setting.showTrack) {\\n bufCtx.save();\\n bufCtx.beginPath();\\n bufCtx.lineCap=\\\"round\\\";\\n bufCtx.lineJoin=\\\"round\\\";\\n bufCtx.strokeStyle = c.toString();\\n bufCtx.lineWidth = (radius(nr(d)) / 4) || 1;\\n\\n var rs = d.paths.slice(0).reverse(),\\n lrs = rs.length;\\n\\n bufCtx.moveTo(x, y);\\n for (var p in rs) {\\n if (!rs.hasOwnProperty(p))\\n continue;\\n\\n bufCtx.lineTo(\\n Math.floor(rs[p].x),\\n Math.floor(rs[p].y)\\n );\\n }\\n //bufCtx.closePath();\\n bufCtx.stroke();\\n bufCtx.restore();\\n }\\n\\n s = radius(nr(d)) * (setting.showHalo ? 8 : 1);\\n setting.showHalo\\n ? bufCtx.drawImage(img, x - s / 2, y - s / 2, s, s)\\n : bufCtx.arc(x, y, s, 0, PI_CIRCLE, true)\\n ;\\n }//end of while\\n if (!setting.showHalo && beg) {\\n bufCtx.closePath();\\n bufCtx.fill();\\n bufCtx.stroke();\\n }\\n }//end of if (setting.showChild)\\n\\n if (setting.showParent || setting.showLabel) {\\n n = _forceBase.nodes().filter(filterVisible).sort(sortByOpacity);\\n l = n.length;\\n\\n i = 100;\\n\\n bufCtx.globalAlpha = i * .01;\\n\\n while(--l > -1) {\\n d = n[l];\\n\\n if (i != curOpacity(d)) {\\n i = curOpacity(d);\\n bufCtx.globalAlpha = i * .01;\\n }\\n\\n x = Math.floor(d.x);\\n y = Math.floor(d.y);\\n\\n if (setting.showParent) {\\n c = curColor(d);\\n bufCtx.save();\\n\\n if (setting.showPaddingCircle) {\\n bufCtx.beginPath();\\n bufCtx.strokeStyle = \\\"none\\\";\\n bufCtx.fillStyle = \\\"#ff0000\\\";\\n bufCtx.arc(x, y, nr(d) + setting.padding, 0, PI_CIRCLE, true);\\n bufCtx.closePath();\\n bufCtx.fill();\\n bufCtx.stroke();\\n }\\n\\n bufCtx.beginPath();\\n bufCtx.strokeStyle = \\\"transparent\\\";\\n bufCtx.fillStyle = setting.useImage ? \\\"transparent\\\" : c;\\n bufCtx.arc(x, y, nr(d), 0, PI_CIRCLE, true);\\n bufCtx.closePath();\\n bufCtx.fill();\\n bufCtx.stroke();\\n img = d.img && d.img.width > 0 && d.img.height > 0 ? d.img : defImg;\\n if (setting.useImage && img.width > 0 && img.height > 0) {\\n bufCtx.clip();\\n iw = img.width;\\n ih = img.height;\\n\\n if (iw == ih) {\\n ih = iw = nr(d);\\n }\\n else if (iw > ih) {\\n ih = (ih/iw) * nr(d) * 1.2;\\n iw = nr(d) * 1.2;\\n }\\n else {\\n iw = (iw/ih) * nr(d) * 1.2;\\n ih = nr(d) * 1.2;\\n }\\n\\n bufCtx.drawImage(img, x - iw, y - ih, iw * 2, ih * 2);\\n }\\n\\n bufCtx.restore();\\n }\\n\\n if (setting.showLabel) {\\n c = d.flash ? \\\"white\\\" : \\\"gray\\\";\\n\\n bufCtx.fillStyle = c;\\n bufCtx.fillText(d.nodeValue.shortName, x, y + nr(d) * 1.5);\\n }\\n }\\n }//end of if (setting.showParent || setting.showLabel) {\\n\\n bufCtx.restore();\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a321591d8eca1c0c45839d85bfa2390f\",\n \"score\": \"0.6248543\",\n \"text\": \"function drawImage(){\\n\\tvar imgWidth = G.img.width;\\n\\tvar imgHeight = G.img.height;\\n\\tvar sx = 0, sy = 0, sw = imgWidth, sh = imgHeight, dx, dy, dw, dh;\\n\\tif(imgWidth >= imgHeight){ \\t\\t//fill the width or height of the image to the canvas\\n\\t\\tdw = G.getWidth();\\n\\t\\tdh = dw*imgHeight/imgWidth;\\n\\t}else{\\n\\t\\tdh = G.getHeight();\\n\\t\\tdw = dh*imgWidth/imgHeight;\\n\\t}\\n\\n\\tdw = dw * G.zoomScale;\\n\\tdh = dh * G.zoomScale;\\n\\n\\tdx = Math.floor((G.getWidth() - dw) / 2);\\n\\tdy = Math.floor((G.getHeight() - dh) / 2);\\n\\n\\tG.ctxPic.drawImage(G.img, sx, sy, sw, sh, dx, dy, dw, dh);\\n\\t/*G.ctxMask.fillStyle = \\\"rgba(0, 0, 0, 0.4)\\\";\\n\\tG.ctxMask.fillRect(0, 0, G.getWidth(), G.getHeight());*/\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d473b7e6a0d79afcd805af1d8b33da6\",\n \"score\": \"0.6216746\",\n \"text\": \"function renderCanvas() {\\n canvas = document.querySelector('canvas');\\n ctx = canvas.getContext('2d');\\n var imageObj = new Image();\\n imageObj.src = gCurrImg.url;\\n ctx.drawImage(imageObj, 0, 0, canvas.width, canvas.height);\\n renderLines();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f805ef3435d9db007c3e280c4a18e392\",\n \"score\": \"0.62075156\",\n \"text\": \"createCanvas () {\\n let width = this.texture.width;\\n let height = this.texture.height-50;\\n if (!this._canvas) {\\n this._canvas = document.createElement('canvas');\\n\\n this._canvas.width = width;\\n this._canvas.height = height;\\n }\\n else {\\n this.clearCanvas();\\n }\\n let ctx = this._canvas.getContext('2d');\\n this.camera.render();\\n let data = this.texture.readPixels();\\n // write the render data\\n let rowBytes = width * 4; \\n for (let row = 0; row < height; row++) {\\n let srow = height - 1 - row;\\n let imageData = ctx.createImageData(width, 1);\\n let start = srow * width * 4;\\n for (let i = 0; i < rowBytes; i++) {\\n // if ((i - 3) % 4 == 0) {\\n // // cc.log (\\\"i \\\" + i + \\\" data \\\" + data[start + i]);\\n // // imageData.data[i] = 255;\\n // } else {\\n // imageData.data[i] = data[start + i];\\n // }\\n imageData.data[i] = data[start + i];\\n }\\n\\n ctx.putImageData(imageData, 0, row);\\n }\\n return this._canvas;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a19bdd2ab6aa86409ddc86c9d3b5c87\",\n \"score\": \"0.6190052\",\n \"text\": \"function zoomOut(event) {\\n var oldCols = canvas.width/scale;\\n var oldRows = canvas.height/scale;\\n if(scale>10){\\n scale-=10;\\n var newCols = canvas.width/scale;\\n var newRows = canvas.height/scale;\\n xOffset += Math.round((newCols - oldCols)/2);\\n yOffset += Math.round((newRows - oldRows)/2);\\n }\\n drawBlueprint();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d1f0d6510b4bcafb0c9bec88a40758b\",\n \"score\": \"0.618379\",\n \"text\": \"function zoomIn(event) {\\n var oldCols = canvas.width/scale;\\n var oldRows = canvas.height/scale;\\n if(scale<80){\\n scale+=10;\\n var newCols = canvas.width/scale;\\n var newRows = canvas.height/scale;\\n xOffset -= Math.round((oldCols - newCols)/2);\\n yOffset -= Math.round((oldRows - newRows)/2);\\n }\\n drawBlueprint();}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"821461eff52a211b28a3444443ae6c68\",\n \"score\": \"0.6173043\",\n \"text\": \"updateDrawing() {\\n P5.image(this.graphicsBuffer, 0, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3022ea7716915d57927e47fafbe62f1\",\n \"score\": \"0.6164941\",\n \"text\": \"function updateCanvas(){\\n\\tctx.drawImage(canvasImgSource, 0, 0, canvas.width, canvas.height);\\n\\tctxIn.drawImage(canvasImgSource, 0, 0, canvas.width, canvas.height);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ccdde14c39669959f530a8234e1d3596\",\n \"score\": \"0.61515725\",\n \"text\": \"function CImgBuf(wide, tall) {\\r\\n//==============================================================================\\r\\n// Construct an 'image-buffer' object to hold a floating-point ray-traced image.\\r\\n// Contains BOTH\\r\\n//\\tiBuf -- 2D array of 8-bit RGB pixel values we can display on-screen, AND\\r\\n//\\tfBuf -- 2D array of floating-point RGB pixel values we often CAN'T display,\\r\\n// but contains full-precision results of ray-tracing.\\r\\n//\\t\\t\\t--Both buffers hold the same numbers of pixel values (xSiz,ySiz,pixSiz)\\r\\n//\\t\\t\\t--imgBuf.int2float() copies/converts current iBuf contents to fBuf\\r\\n//\\t\\t\\t--imgBuf.float2int() copies/converts current fBuf contents to iBuf\\r\\n//\\tWHY? \\r\\n//\\t--Our ray-tracer computes floating-point light amounts(e.g. radiance L) \\r\\n// but neither our display nor our WebGL texture-map buffers can accept \\r\\n//\\t\\timages with floating-point pixel values.\\r\\n//\\t--You will NEED all those floating-point values for applications such as\\r\\n// environment maps (re-lighting from sky image) and lighting simulations.\\r\\n// Stay simple in early versions of your ray-tracer: keep 0.0 <= RGB < 1.0, \\r\\n// but later you can modify your ray-tracer \\r\\n// to use radiometric units of Radiance (watts/(steradians*meter^2), or convert \\r\\n// to use photometric units of luminance (lumens/(steradians*meter^2 or cd/m^2) \\r\\n// to compute in physically verifiable units of visible light.\\r\\n\\r\\n\\tthis.xSiz = wide;\\t\\t\\t\\t\\t\\t\\t// image width in pixels\\r\\n\\tthis.ySiz =\\ttall;\\t\\t\\t\\t\\t\\t\\t// image height in pixels\\r\\n\\tthis.pixSiz = 3;\\t\\t\\t\\t\\t\\t\\t// pixel size (3 for RGB, 4 for RGBA, etc)\\r\\n\\tthis.iBuf = new Uint8Array( this.xSiz * this.ySiz * this.pixSiz);\\t\\r\\n\\tthis.fBuf = new Float32Array(this.xSiz * this.ySiz * this.pixSiz);\\r\\n\\tthis.antiAliasing = 0;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"823843dbf8678ab0874edc023441ba3f\",\n \"score\": \"0.6125147\",\n \"text\": \"drawImage(dx, dy, image) {\\n dx = dx || 0;\\n dy = dy || 0;\\n let dyy;\\n let dxx;\\n let dyyPage;\\n let dxxByte = null;\\n let bufferOffset = 0;\\n let page;\\n let imageOffset;\\n let pixelByte;\\n let color;\\n\\n // outer loop through columns\\n for (let x = 0; x < image.width; x++) {\\n dxx = dx + x;\\n if (this.clipped(dxx, null)) {\\n continue;\\n }\\n page = -1; // reset page\\n // inner loop through rows\\n for (let y = 0; y < image.height; y++) {\\n dyy = dy + y;\\n if (this.clipped(null, dyy)) {\\n continue;\\n }\\n // calculate buffer page for y coord\\n dyyPage = Math.floor(dyy / 8);\\n // check if new page\\n if (dyyPage > page) {\\n // if we have a byte and it differs from buffer then save\\n if (dxxByte !== null && dxxByte !== this.buffer[bufferOffset]) {\\n this.buffer[bufferOffset] = dxxByte;\\n this.dirtyBytes[page] = this.dirtyBytes[page] || {};\\n this.dirtyBytes[page][dxx] = dxxByte;\\n }\\n // prepare settings for new page\\n page = dyyPage;\\n bufferOffset = page * this.Config.displayColumns + dxx;\\n dxxByte = this.buffer[bufferOffset];\\n }\\n // calculate offset into image data (4 bytes per RGBA pixel)\\n imageOffset = (image.width * image.channels * y + image.channels * x);\\n\\n // transparency check\\n if (image.channels === 2 || image.channels === 4) {\\n if (!image.data[imageOffset + (image.channels - 1)]) { continue; }\\n }\\n\\n // convert pixel y position into buffer column byte\\n pixelByte = 0x01 << (dyy - 8 * dyyPage);\\n // convert image pixel color to monochrome\\n color = (image.channels < 3 ? image.data[imageOffset] : image.data[imageOffset] || image.data[imageOffset + 1] || image.data[imageOffset + 2]);\\n\\n // apply pixel to buffer byte\\n if (color) {\\n dxxByte |= pixelByte;\\n }\\n else {\\n dxxByte &= ~pixelByte;\\n }\\n }\\n // if we have a byte and it differs from buffer then save\\n if (dxxByte !== null && dxxByte !== this.buffer[bufferOffset]) {\\n // save byte\\n this.buffer[bufferOffset] = dxxByte;\\n this.dirtyBytes[page] = this.dirtyBytes[page] || {};\\n this.dirtyBytes[page][dxx] = dxxByte;\\n }\\n dxxByte = null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c53cfdfdeb5a03dd298e6109ca24045\",\n \"score\": \"0.6124233\",\n \"text\": \"async function zoom(buffer) {\\n return sharp(buffer)\\n .crop(sharp.gravity.center)\\n .resize(1280, config.zoom)\\n .toBuffer();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9da17b8f6704199e6e67d454efcc5b7c\",\n \"score\": \"0.6120511\",\n \"text\": \"render(timestamp){\\n // for (let i = 0; i < this.vramSize; i += 4){\\n // this._layerOne.data[i + 0] = this.vram[i + 0]\\n // this._layerOne.data[i + 1] = this.vram[i + 1]\\n // this._layerOne.data[i + 2] = this.vram[i + 2]\\n // this._layerOne.data[i + 3] = 255\\n // }\\n\\n // let that = this\\n // console.log(timestamp)\\n // console.log(1000/(timestamp - this.oldTime))\\n this.fps = 1000/(timestamp - this.oldTime)\\n this.oldTime = timestamp\\n\\n this.copyVramToImage()\\n\\n Promise.all([\\n createImageBitmap(this._layerOne, {\\n resizeQuality: 'pixelated',\\n colorSpaceConversion: 'none',\\n premultiplyAlpha: 'premultiply',\\n resizeWidth: this.canvas.width,\\n resizeHeight: this.canvas.height,\\n })\\n ]).then(function(bitmaps){\\n // this.ctx.putImageData(this._imageData, 0, 0)\\n\\n this.ctx.drawImage(bitmaps[0], 0, 0)\\n\\n requestAnimationFrame(this.render.bind(this))\\n }.bind(this))\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96a3933ca06da8c118ea38916914cec4\",\n \"score\": \"0.6114568\",\n \"text\": \"function pickPoint(e){\\n console.log(e)\\n console.log(e.offsetX, e.offsetY)\\n // var imgAryBaseWidth = window.baselevel.slice_size[0]\\n var imgAryBaseWidth = window.baselevel.resolution[0] // tempXXX\\n const rateCanvas = Math.ceil(canvas.width / canvasMinimap.width)\\n const scaleRate = 1\\n const rate = Math.ceil((imgAryBaseWidth / scaleRate) / canvas.width)\\n // 縮圖置中，添加平移量\\n const baseX = (canvasMinimap.width - imgAryBaseWidth / rate / rateCanvas) / 2\\n var x = (e.offsetX - baseX) * rateCanvas\\n var y = e.offsetY * rateCanvas\\n // var pointer = canvas.getPointer({ x: 0, y: 0 });\\n // var pointer = beforeRotateLeftTopCoord(window.theta, CenterCoord(), { x: 0, y: 0 })\\n var pointer = CenterCoord()\\n var ary = new Array(6)\\n var ary = canvas.viewportTransform;\\n var centerMoveMatirx = [1, 0, 0, 1, pointer.x - x, pointer.y - y]\\n // console.log('--A--', JSON.stringify(ary))\\n // var centerMoveMatirx = [1,0,0,1,10,10]\\n ary = matrixProduct(ary, centerMoveMatirx) // 先平移\\n // console.log('--B--', JSON.stringify(ary))\\n canvas.setViewportTransform(ary);\\n canvas.renderAll();\\n clearTimeout(tt)\\n tt = setTimeout(function(){\\n var zoom = realZoom()\\n var levelInfo = window.imgInfo.partition.find(function(item){\\n return item.scaleRate < zoom || item.scaleRate === 1\\n })\\n var area = { x: shiftDrawArea(), y: shiftDrawArea(), w: window.tempCanvasWidth, h: window.tempCanvasWidth}\\n var coordinate = leftTopCoord()\\n if (window.theta !== 0) {\\n var tempAngle = window.theta\\n rotateSwitch(0)\\n coordinate = leftTopCoord()\\n rotateSwitch(tempAngle)\\n }\\n loadImgByLevelAndCanvasArea(levelInfo, coordinate, zoom, area)\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43d3e938383f490ed92cee8518721823\",\n \"score\": \"0.6097722\",\n \"text\": \"function Layer(width, height, canvas) {\\n this.canvasSize = [width, height];\\n this.canvas = canvas;\\n this.context = this.canvas.getContext('2d');\\n // Initializes the canvas\\n this.initialize = function() {\\n var maxHorizontalZoom = Math.floor(window.innerWidth/this.canvasSize[0]*0.75);\\n var maxVerticalZoom = Math.floor(window.innerHeight/this.canvasSize[1]*0.75);\\n\\n zoom = Math.min(maxHorizontalZoom,maxVerticalZoom);\\n if (zoom < 1) zoom = 1;\\n\\n //resize canvas\\n this.canvas.width = this.canvasSize[0];\\n this.canvas.height = this.canvasSize[1];\\n this.canvas.style.width = (this.canvas.width*zoom)+'px';\\n this.canvas.style.height = (this.canvas.height*zoom)+'px';\\n\\n //unhide canvas\\n this.canvas.style.display = 'block';\\n\\n //center canvas in window\\n this.canvas.style.left = 64+canvasView.clientWidth/2-(this.canvasSize[0]*zoom/2)+'px';\\n this.canvas.style.top = 48+canvasView.clientHeight/2-(this.canvasSize[1]*zoom/2)+'px';\\n\\n this.context.imageSmoothingEnabled = false;\\n this.context.mozImageSmoothingEnabled = false;\\n };\\n // Resizes canvas\\n this.resize = function() {\\n let newWidth = (this.canvas.width * zoom) + 'px';\\n let newHeight = (this.canvas.height *zoom)+ 'px';\\n\\n this.canvas.style.width = newWidth;\\n this.canvas.style.height = newHeight;\\n };\\n // Copies the otherCanvas' position and size\\n this.copyData = function(otherCanvas) {\\n this.canvas.style.width = otherCanvas.canvas.style.width;\\n this.canvas.style.height = otherCanvas.canvas.style.height;\\n\\n this.canvas.style.left = otherCanvas.canvas.style.left;\\n this.canvas.style.top = otherCanvas.canvas.style.top;\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc72e52476809d5b9136ab1bca6eaabd\",\n \"score\": \"0.60591197\",\n \"text\": \"function updateCanvasSize(){\\n\\n canvas.width = params.width;\\n canvas.height = params.height;\\n\\n zoomCanvas();\\n\\n params.width = canvas.width;\\n params.height = canvas.height;\\n gl.viewport( 0, 0, canvas.width, canvas.height );\\n createRenderTargets();\\n params.step = 0;\\n params.doConfig = 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c94600d5fa2af2f238fe9eb098afddf9\",\n \"score\": \"0.604687\",\n \"text\": \"function drawPixels(canvasId, imageData) {\\n var context2d = getContext2d(canvasId);\\n context2d.putImageData(imageData, 0, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"291e2ba957c88c47091f0cef22295ad4\",\n \"score\": \"0.603797\",\n \"text\": \"draw() {\\r\\n this.context.drawImage(this.img, 0, 0, this.img.width, this.img.height, (this.canvas.width - this.img.width * this.ratio)/2, (this.canvas.height - this.img.height * this.ratio)/2, (this.img.width * this.ratio), (this.img.height * this.ratio));\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7de1a5357b8f04a082fceb65df329770\",\n \"score\": \"0.60340315\",\n \"text\": \"function draw(img) {\\n\\tconst data = img.dataSync();\\n\\tconst multiplier = 500;\\n\\tconst imageData = new ImageData(width, height);\\n\\n\\tfor (let i = 0; i < height * width; ++i) {\\n\\t\\tconst j = i * 4;\\n\\t\\timageData.data[j + 0] = data[i] * multiplier;\\n\\t\\timageData.data[j + 1] = data[i] * multiplier;\\n\\t\\timageData.data[j + 2] = data[i] * multiplier;\\n\\t\\timageData.data[j + 3] = 255;\\n\\n\\t}\\n\\n\\tif (canvas != null) {\\n\\t\\tconst ctx = canvas.getContext('2d');\\n\\t\\tctx.putImageData(imageData, 0, 0);\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df3faff3ca5c5273bc52105a96c123b6\",\n \"score\": \"0.6028558\",\n \"text\": \"function draw () {\\n\\t\\tdrawVisual = requestAnimationFrame(draw);\\n\\n\\t\\tanalyser.getByteTimeDomainData(dataArray);\\n\\n\\t\\tcanvasCtx.fillStyle = 'rgb(46,19,114)';\\n\\t\\tcanvasCtx.fillRect(0, 0, WIDTH, HEIGHT);\\n\\t\\t\\n\\t\\tcanvasCtx.lineWidth = 4;\\n\\t\\tcanvasCtx.strokeStyle = '#1ADB6F';\\n\\n\\t\\tcanvasCtx.beginPath();\\n\\n\\t\\tvar sliceWidth = WIDTH * 1.0 / bufferLength;\\n\\t\\tvar x = 0\\n\\n\\t\\tfor(var i = 0; i < bufferLength; i++) {\\n \\n \\tvar v = dataArray[i] / 128.0;\\n \\tvar y = v * HEIGHT/2;\\n\\n \\tif(i === 0) {\\n \\t\\tcanvasCtx.moveTo(x, y);\\n \\t} else {\\n \\t\\tcanvasCtx.lineTo(x, y);\\n \\t}\\n\\n \\tx += sliceWidth;\\n \\t}\\t\\n\\n \\tcanvasCtx.lineTo(canvas.width, canvas.height/2);\\n \\tcanvasCtx.stroke();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ad65cf79a70d86bc70bb1f2659204ed\",\n \"score\": \"0.6018335\",\n \"text\": \"function renderFrame() {\\n let oldFrame;\\n\\n // 1. Capture to offscreen buffer\\n offscreenCtx.drawImage(cameraEl, 0, 0);\\n\\n // 2. Read the pixel data from this buffer\\n let frame = offscreenCtx.getImageData(\\n 0,\\n 0,\\n offscreenCanvasEl.width,\\n offscreenCanvasEl.height\\n );\\n\\n const totalPixels = frame.data.length / 4; // Get total number of pixels by dividing by 4 (since each pixel uses 4 values)\\n for (let pixelIndex = 0; pixelIndex < totalPixels; pixelIndex++) {\\n // Save each color channel of the pixel\\n const r = frame.data[pixelIndex * 4 + 0];\\n const g = frame.data[pixelIndex * 4 + 1];\\n const b = frame.data[pixelIndex * 4 + 2];\\n\\n // Calculate the \\\"blueishness\\\" of the pixel\\n const blueishness = b - (r + g) / 2;\\n\\n if (blueishness < 40) {\\n // If it's not blue we make the pixel transparent\\n frame.data[pixelIndex * 4 + 3] = 0;\\n } else {\\n // If it's blue enough we set it to pink\\n frame.data[pixelIndex * 4 + 0] = 255;\\n frame.data[pixelIndex * 4 + 2] = 128;\\n }\\n }\\n\\n // Add the frame to our buffer array to be able to delay the rendering\\n frameBuffer.push(frame);\\n if (frameBuffer.length > 30) {\\n // Remove the oldest frames and save it for later\\n oldFrame = frameBuffer.shift();\\n }\\n\\n // Draw the camera picture to the screen\\n ctx.drawImage(cameraEl, 0, 0);\\n\\n if (delay && oldFrame) {\\n // Write our old modified frame back to the buffer and\\n // draw buffer to the visible canvas\\n offscreenCtx.putImageData(oldFrame, 0, 0);\\n ctx.drawImage(offscreenCanvasEl, 0, 0);\\n } else if (!delay) {\\n // Write our modified frame back to the buffer and\\n // draw buffer to the visible canvas\\n offscreenCtx.putImageData(frame, 0, 0);\\n ctx.drawImage(offscreenCanvasEl, 0, 0);\\n }\\n\\n // Repeat!\\n window.requestAnimationFrame(renderFrame);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e7e6c5463d6c3b66ee481e312065817a\",\n \"score\": \"0.6008731\",\n \"text\": \"update (data) {\\n let canvas = this.refs.canvas.getContext('2d');\\n let img = new Image();\\n img.onload = function () {\\n //canvas.clearRect(0,0,2000,2000);\\n canvas.drawImage(this, 0, 0);\\n }\\n img.src = data;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"517b272f692f8db940ed40225e3ac7cd\",\n \"score\": \"0.6008491\",\n \"text\": \"function blit_pixels(viewport, transform, pixels, viewport_size, mono){\\n var ctx = viewport.getContext(\\\"2d\\\");\\n var imageData = ctx.getImageData(0, 0, viewport.width, viewport.height);\\n var target = imageData.data;\\n for(var y = 0; y < viewport_size; y++)\\n {\\n for(var x = 0; x < viewport_size; x++)\\n {\\n var posn = pair(x,y);\\n var transposn = transform(posn); \\n var srcIdx = 4*(viewport_size * y + x);\\n var destIdx = 4*(viewport.width * Math.round(posn_y(transposn)) + Math.round(posn_x(transposn)));\\n if(mono){\\n var avg = Math.round(pixels[srcIdx+0] + pixels[srcIdx+1] + pixels[srcIdx+2])/3;\\n target[destIdx+0] = avg;\\n target[destIdx+1] = avg;\\n target[destIdx+2] = avg;\\n }else{\\n target[destIdx+0] = pixels[srcIdx+0];\\n target[destIdx+1] = pixels[srcIdx+1];\\n target[destIdx+2] = pixels[srcIdx+2];\\n }\\n target[destIdx+3] = 255;\\n }\\n }\\n var buffer = document.createElement(\\\"Canvas\\\");\\n buffer.width = ctx.canvas.width;\\n buffer.height = ctx.canvas.height;\\n buffer.getContext(\\\"2d\\\").putImageData(imageData, 0, 0);\\n ctx.scale(antialias, antialias);\\n ctx.drawImage(buffer, 0 , 0);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55556abc4bd49715daa173e787c2e203\",\n \"score\": \"0.60031\",\n \"text\": \"_bindCanvas() {\\n\\t\\tconst {width, height} = this.state;\\n\\t\\tconst {image, step} = this.props;\\n\\t\\tconst canvas = document.querySelector('#strenght-canvas');\\n\\t\\tconst ctx = canvas.getContext('2d');\\n\\n\\t\\tconst img = loadImage(image);\\n\\n\\t\\timg.onload = function () {\\n\\t\\t\\tctx.fillStyle = \\\"red\\\";\\n\\t\\t\\tctx.drawImage(this, 0, 0, width, height);\\n\\n\\t\\t\\tconst imageData = ctx.getImageData(0, 0, width, height);\\n\\t\\t\\tconst data = imageData.data;\\n\\n\\t\\t\\tfor (var i = 0; i < data.length; i += 4) {\\n\\t\\t\\t\\tif(data[i] > (50 * step) && step < 8) {\\n\\t\\t\\t\\t\\tdata[i] = 0;\\n\\t\\t\\t\\t\\tdata[i+1] = data[i];\\n\\t\\t\\t\\t\\tdata[i+2] = data[i] + 10;\\n\\t\\t\\t\\t}else {\\n\\t\\t\\t\\t\\tdata[i] = data[i];\\n\\t\\t\\t\\t\\tdata[i+1] = data[i+1];\\n\\t\\t\\t\\t\\tdata[i+2] = data[i+2];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tctx.putImageData(imageData, 0, 0);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98bb84a9295d8b6fbe923ec3b9746d7f\",\n \"score\": \"0.59990275\",\n \"text\": \"constructor(image, scale, callback, isPreview){\\n\\n this.image = image;\\n this.isPreview = isPreview;\\n this.scale = scale || 1;\\n\\n this.width = this.image.metaData.width;\\n this.height = this.image.metaData.height;\\n this.scaleMin = this.image.scaling.scaleMin;\\n this.scaleMax = this.image.scaling.scaleMax;\\n this.sample = Math.floor(1 / this.scale);\\n this.targetWidth = Math.floor(this.width * this.scale);\\n this.targetHeight = Math.floor(this.height * this.scale);\\n\\n let tmpCanvas = document.createElement('canvas');\\n tmpCanvas.width = this.targetWidth;\\n tmpCanvas.height = this.targetHeight;\\n\\n let tmpCtx = this.tmpCtx = tmpCanvas.getContext('2d');\\n\\n let data = {\\n width: this.width,\\n height: this.height,\\n targetWidth: this.targetWidth,\\n targetHeight: this.targetHeight,\\n sample: this.sample,\\n scaleMin: this.scaleMin,\\n scaleMax: this.scaleMax,\\n imageData: this.image.imageData,\\n colors: this.image.scaling.colors,\\n scaleFunction: this.image.scaling.scaleFunction,\\n tmpContext: this.tmpCtx.getImageData(0,0,this.targetWidth, this.targetHeight)\\n };\\n\\n if(isPreview){\\n this.render(data, callback);\\n }else{\\n this.workerRender(data, function(imageData){\\n tmpCtx.putImageData(imageData, 0, 0);\\n let url = tmpCtx.canvas.toDataURL(),\\n img = new Image();\\n img.src = url;\\n callback(img);\\n });\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"38085e6a3412840a0b99fec363e4d031\",\n \"score\": \"0.5987512\",\n \"text\": \"function saveDrawingSurface(){\\n\\t\\n\\t\\tvar imageData=context.getImageData(0,0, canvas.width, canvas.height);\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d59a60aac62cdd888e284a78cf3afa6\",\n \"score\": \"0.59859693\",\n \"text\": \"draw(){\\n this.context.drawImage(this.img, this.x, this.y);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d4d72722fcefd98944285e356d8430b\",\n \"score\": \"0.5984148\",\n \"text\": \"function renderImageToCanvas(img, canvas, width, height) {\\n var iw = img.naturalWidth;\\n var ih = img.naturalHeight;\\n var ctx = canvas.getContext('2d');\\n canvas.width = width;\\n canvas.height = height;\\n ctx.save();\\n\\n var subsampled = detectSubsampling(img);\\n if (subsampled) {\\n iw /= 2;\\n ih /= 2;\\n }\\n\\n var d = 1024; // size of tiling canvas\\n var tilingCanvas = document.createElement('canvas');\\n tilingCanvas.width = tilingCanvas.height = d;\\n var tilingCtx = tilingCanvas.getContext('2d');\\n var vertSquashRatio = detectVerticalSquash(img, iw, ih);\\n\\n var sy = 0;\\n while (sy < ih) {\\n var sh = sy + d > ih ? ih - sy : d;\\n var sx = 0;\\n while (sx < iw) {\\n var sw = sx + d > iw ? iw - sx : d;\\n tilingCtx.clearRect(0, 0, d, d);\\n tilingCtx.drawImage(img, -sx, -sy);\\n var dx = sx * width / iw << 0;\\n var dw = Math.ceil(sw * width / iw);\\n var dy = sy * height / ih / vertSquashRatio << 0;\\n var dh = Math.ceil(sh * height / ih / vertSquashRatio);\\n ctx.drawImage(tilingCanvas, 0, 0, sw, sh, dx, dy, dw, dh);\\n sx += d;\\n }\\n\\n sy += d;\\n }\\n\\n ctx.restore();\\n tilingCanvas = tilingCtx = null;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a1c88ca902f7ba47a072b93edec96da\",\n \"score\": \"0.59780794\",\n \"text\": \"drawFromBuffer () {\\n\\t\\tdisplaySystem.updateBufferFOV();\\n\\t\\tdisplaySystem.updateBuffer();\\n\\n\\t\\tdisplay.clear();\\n\\t\\tlogger.showMessages();\\n\\t\\tfor (let i = 0; i < bufferOptions.width; i++) {\\n\\t\\t\\tfor (let j = 0; j < bufferOptions.height; j++) {\\n\\t\\t\\t\\tlet pos = i + (j * bufferOptions.width);\\n\\n\\t\\t\\t\\t//draw separating line between game and log/information\\n\\t\\t\\t\\tfor (let k = 0; k < bufferOptions.height; k++) {\\n\\t\\t\\t\\t\\tdisplay.draw(bufferOptions.width, k, \\\"|\\\", \\\"#ffffff\\\")\\n\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\n\\t\\t\\t\\t//idea: \\\"flipped mode\\\" where i and j are flipped as a status effect\\n\\t\\t\\t\\tif (this.buffer[pos]) { display.draw(i, j, this.buffer[pos][0], this.buffer[pos][1], this.buffer[pos][2]);}\\n\\t\\t\\t\\telse {display.draw(i,j,'','','#000000')}\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5764c0eb56cc20747429b9da4ea9127b\",\n \"score\": \"0.5965301\",\n \"text\": \"function initCanvas() {\\n //Choose zoom level to fit image inside canvas\\n currZoom = 1.0;\\n var fitWidthScale = window.cc.canvas.clientWidth / imgs[0][0].naturalWidth;\\n var fitHeightScale = window.cc.canvas.clientHeight / imgs[0][0].naturalHeight;\\n if (fitWidthScale < fitHeightScale) {\\n currZoom = fitWidthScale;\\n } else {\\n currZoom = fitHeightScale;\\n }\\n window.cc.scale(currZoom, currZoom);\\n\\n //Move (0,0) from top-left of canvas to centre\\n window.cc.translate(window.cc.canvas.clientWidth / currZoom / 2, window.cc.canvas.clientHeight / currZoom / 2);\\n\\n //Find where top-left of image should be positioned\\n imgTopLeft = [-imgs[0][0].naturalWidth / 2, -imgs[0][0].naturalHeight / 2];\\n\\n userRotateEnabled = true;\\n userPanEnabled = true;\\n userZoomEnabled = true;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b5785262f8b44f4a07b9c41b60f6bfe\",\n \"score\": \"0.5957516\",\n \"text\": \"renderFrame() {\\n // Check if we have new graphics to show\\n if (!this.imageDataArrayChanged) {\\n return;\\n }\\n this.imageDataArrayChanged = false;\\n\\n // Check for a callback for accessing image data\\n if (this.updateGraphicsCallback) {\\n this.updateGraphicsCallback(this.imageDataArray);\\n }\\n\\n // Set the imageDataArray to our plugins\\n WasmBoyPlugins.runHook({\\n key: 'graphics',\\n params: [this.imageDataArray],\\n callback: response => {\\n if (response) {\\n this.imageDataArray = response;\\n }\\n }\\n });\\n\\n // Add our new imageData\\n this.canvasImageData.data.set(this.imageDataArray);\\n\\n this.canvasContext.clearRect(0, 0, this.canvasElement.width, this.canvasElement.height);\\n this.canvasContext.putImageData(this.canvasImageData, 0, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"340df2fa63931a9764378319b4b315b8\",\n \"score\": \"0.59360313\",\n \"text\": \"async function zoom(buffer) {\\n\\t\\treturn sharp(buffer)\\n\\t\\t\\t.crop(sharp.gravity.center)\\n\\t\\t\\t.resize(1280, config.zoom)\\n\\t\\t\\t.toBuffer();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6227ea2c147325bc03f3ece9ce433209\",\n \"score\": \"0.5933869\",\n \"text\": \"function main() {\\n\\n // Get the canvas and context\\n var canvas = document.getElementById(\\\"viewport\\\");\\n var context = canvas.getContext(\\\"2d\\\");\\n\\tcontext.translate(0,context.canvas.height);\\n\\tcontext.scale(1,-1);\\n\\t\\n\\n \\n // Create the image\\n //drawRandPixels(context);\\n // shows how to draw pixels\\n \\n drawRandPixelsInInputEllipsoids(context);\\n // shows how to draw pixels and read input file\\n \\n //drawInputEllipsoidsUsingArcs(context);\\n // shows how to read input file, but not how to draw pixels\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7afeba09a2e3beeacbdfde2b59d53a5a\",\n \"score\": \"0.5932826\",\n \"text\": \"function renderFrame() {\\n let offscreenC = offscreenCanvasEl.getContext('2d');\\n let c = canvasEl.getContext('2d');\\n\\n // 1. Capture to offscreen canvas\\n offscreenC.drawImage(cameraEl, 0, 0);\\n\\n // 2. Do whatever processing we want to the this buffer\\n // Example from: https://developer.mozilla.org/en-US/docs/Web/API/Canvas_API/Manipulating_video_using_canvas\\n let frame = offscreenC.getImageData(0, 0, offscreenCanvasEl.width, offscreenCanvasEl.height);\\n\\n let diffCount = 0;\\n\\n // 4 is used here since frame is represented as R G B A\\n let l = frame.data.length / 4;\\n if (oldFrame !== null) {\\n for (let i = 0; i < l; i++) {\\n if (comparePixel(frame, i)) {\\n frame.data[i * 4 + 3] = 0; // Set alpha to 0, transparent\\n diffCount++;\\n }\\n }\\n }\\n // Draw something in the background\\n var gradient = c.createLinearGradient(0, 0, canvasEl.width, canvasEl.height);\\n gradient.addColorStop(0, 'deeppink');\\n gradient.addColorStop(1, 'palegreen');\\n\\n c.fillStyle = gradient;\\n c.fillRect(0, 0, canvasEl.width, canvasEl.height);\\n\\n // Write image data to destination context\\n offscreenC.putImageData(frame, 0, 0);\\n\\n c.drawImage(offscreenCanvasEl, 0, 0);\\n\\n // % of image that has changed\\n diffCount = 100 - parseInt(100 * (diffCount / (frame.data.length / 4)));\\n c.fillStyle = 'white';\\n c.font = '48px \\\"Fira Code\\\", Monaco, \\\"Andale Mono\\\", \\\"Lucida Console\\\", \\\"Bitstream Vera Sans Mono\\\", \\\"Courier New\\\", Courier, monospace';\\n c.fillText(diffCount + \\\"%\\\", 100, 100);\\n\\n let now = Date.now();\\n let keepFrame = true;\\n\\n // If we want, we could change when we hold on to the last frame,\\n // eg to only update it every so often, or to keep a single reference frame\\n\\n // This only updates the reference frame every 1 second\\n // if (now - oldFrameCapturedAt < 11000) keepFrame = false;\\n\\n // This only keeps a single reference frame and never updates it\\n //if (oldFrame !== null) keepFrame = false;\\n\\n // Remember last frame\\n if (keepFrame) {\\n oldFrame = frame;\\n oldFrameCapturedAt = now;\\n }\\n\\n // Repeat!\\n window.requestAnimationFrame(renderFrame);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fa5245c34e87690d6c472b4e601ea65\",\n \"score\": \"0.5928093\",\n \"text\": \"function draw() {\\n var drawVisual = requestAnimationFrame(draw);\\n\\n analyser.getByteTimeDomainData(dataArray);\\n\\n canvasCtx.fillStyle = \\\"rgb(240,128,128)\\\";\\n canvasCtx.fillRect(0, 0, canvas.width, canvas.height);\\n\\n canvasCtx.lineWidth = 2;\\n canvasCtx.strokeStyle = \\\"rgb(50, 150, 127)\\\";\\n\\n canvasCtx.beginPath();\\n\\n var sliceWidth = (canvas.width * 1.0) / bufferLength;\\n var x = 0;\\n\\n for (var i = 0; i < bufferLength; i++) {\\n var v = dataArray[i] / 128.0;\\n var y = (v * canvas.height) / 2;\\n\\n if (i === 0) {\\n canvasCtx.moveTo(x, y);\\n } else {\\n canvasCtx.lineTo(x, y);\\n }\\n\\n x += sliceWidth;\\n }\\n\\n canvasCtx.lineTo(canvas.width, canvas.height / 2);\\n canvasCtx.stroke();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8b580569a0b3e13c7e3a2b235293a33\",\n \"score\": \"0.5911935\",\n \"text\": \"function directImage() {\\n if (trueMagnification !== 1) {\\n console.error('directImage: Magnification is not equal to 1, it is ' + trueMagnification);\\n return;\\n }\\n console.log('directImage');\\n output.startDrawing();\\n output.pixels.update();\\n const pixels = output.pixels;\\n const width = output.canvas.width;\\n const height = width;\\n let imageIndex = 0;\\n // going over image pixels, skipping border cells\\n for (var j = 0; j < height; j++) {\\n // skip first two cell rows (border)\\n const jCellSize = size * (2 + j);\\n for (var i = 0; i < width; i++) {\\n // skip first two cell columns (border)\\n const cell = cells[jCellSize + i + 2];\\n if (cell < -20) {\\n pixels.array[imageIndex] = colorForMoverLeft;\\n } else if (cell < -10) {\\n pixels.array[imageIndex] = colorForMoverRight;\\n } else if (cell < 0) {\\n pixels.array[imageIndex] = colorForMover;\\n } else {\\n pixels.array[imageIndex] = colors[cell];\\n }\\n imageIndex += 1;\\n }\\n }\\n output.pixels.show();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e85c5190bb308ae9b0ed2acadfd15a0\",\n \"score\": \"0.5899221\",\n \"text\": \"display() {\\n let sx = this.raw ? 0 : cs.camera.getX()\\n let sy = this.raw ? 0 : cs.camera.getY()\\n let sWidth = this.raw ? this.canvas.width : cs.camera.getWidth()\\n let sHeight = this.raw ? this.canvas.height : cs.camera.getHeight()\\n\\n // We will have to scale the X over becuse safari doesnt act like chrome\\n const dx = sx < 0 ? Math.floor(cs.camera.getScale() * (cs.camera.getX() * -1)) : 0\\n const dy = sy < 0 ? Math.floor(cs.camera.getScale() * (cs.camera.getY() * -1)) : 0\\n const dWidth = sWidth <= this.canvas.width\\n ? cs.view.width\\n : cs.view.width - Math.floor(cs.camera.getScale() * ((cs.camera.getWidth()) - this.canvas.width))\\n const dHeight = sHeight <= this.canvas.height\\n ? cs.view.height\\n : cs.view.height - Math.floor(cs.camera.getScale() * ((cs.camera.getHeight()) - this.canvas.height))\\n\\n if (sx < 0) {\\n sx = 0\\n sWidth += sx * -1\\n }\\n if (sy < 0) {\\n sy = 0\\n sHeight += sy * -1\\n }\\n if (sWidth > this.canvas.width) sWidth = this.canvas.width\\n if (sHeight > this.canvas.height) sWidth = this.canvas.height\\n\\n cs.view.ctx.drawImage(this.canvas,\\n sx, sy, sWidth, sHeight,\\n dx, dy, dWidth, dHeight)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca104ce1178123771c0cc6f3ec176b23\",\n \"score\": \"0.58842003\",\n \"text\": \"function drawBlendImage(messageEvent) {\\n logOnce_1('main thread - ', messageEvent.data);\\n blendImageData\\n .data\\n .set(\\n new Uint8ClampedArray(messageEvent.data)\\n );\\n\\n blendCtx.putImageData(blendImageData, 0, 0);\\n previousImageData = currentImageData;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3818b9ad0b1ab5ea4e805e53893ac4e0\",\n \"score\": \"0.58829224\",\n \"text\": \"function _zoom() {\\n step++\\n if (step < 20) {\\n self._zoomFrame = requestAnimationFrame(_zoom)\\n }\\n var tickZoom = easeOutQuart(step, curPerc, perc - curPerc, 20)\\n\\n var ratio = tickZoom / curPerc,\\n imgWidth = imageDim.w * tickZoom / 100,\\n imgHeight = imageDim.h * tickZoom / 100,\\n newLeft = -((point.x - curLeft) * ratio - point.x),\\n newTop = -((point.y - curTop) * ratio - point.y)\\n\\n var baseLeft = Math.max((containerDim.w - imgWidth) / 2, 0),\\n baseTop = Math.max((containerDim.h - imgHeight) / 2, 0),\\n baseRight = containerDim.w - baseLeft,\\n baseBottom = containerDim.h - baseTop\\n\\n newLeft = Math.min(newLeft, baseLeft)\\n newTop = Math.min(newTop, baseTop)\\n\\n //fix for right and bottom\\n if ((newLeft + imgWidth) < baseRight) {\\n newLeft = baseRight - imgWidth //newLeft - (newLeft + imgWidth - baseRight)\\n }\\n if ((newTop + imgHeight) < baseBottom) {\\n newTop = baseBottom - imgHeight //newTop + (newTop + imgHeight - baseBottom)\\n }\\n curImg.style.width = imgWidth + 'px'\\n curImg.style.height = imgHeight + 'px'\\n curImg.style.left = newLeft + 'px'\\n curImg.style.top = newTop + 'px'\\n\\n self.zoomValue = tickZoom\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07cc27b4154126e080a854d9c3d5bd25\",\n \"score\": \"0.58762825\",\n \"text\": \"renderDataBuffer( dataBuffer, dataMaterial )\\n { \\n \\n // render data into copy texture\\n gl.bindFramebuffer( gl.FRAMEBUFFER, this._rtCopyBuffer.fbo() );\\n gl.clear( gl.COLOR_BUFFER_BIT );\\n \\n dataMaterial.apply(); \\n this._screenQuadMesh.render(); \\n \\n // render copy texture into data texture\\n gl.bindFramebuffer( gl.FRAMEBUFFER, dataBuffer );\\n gl.clear( gl.COLOR_BUFFER_BIT );\\n \\n this._copyMaterial.apply(); \\n this._screenQuadMesh.render(); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e78f714ba12b82e7ca7937fcdc995e2\",\n \"score\": \"0.58723897\",\n \"text\": \"draw() {\\n if (!this.img) return;\\n ctx.drawImage(this.img, this.x, this.y);\\n ctx.drawImage(this.img, this.x + W, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee696d12fe5305d93eac14e51af829a4\",\n \"score\": \"0.5871594\",\n \"text\": \"function copy() {\\n imgData = ctx.getImageData(0, 0, canvas.width, canvas.height);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01c5e47397a1d67de79759e8560eab67\",\n \"score\": \"0.5870759\",\n \"text\": \"draw(ctx) {\\n ctx.drawImage(\\n this.image,\\n this.position.x,\\n this.position.y,\\n this.size,\\n this.size\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a20010b74f92954bc7764c1a1fcda2ff\",\n \"score\": \"0.58594215\",\n \"text\": \"updateCanvas() {\\n this.ctx.putImageData(this.imageData, 0, 0)\\n return this.ctx.canvas\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"38e003eaf69fa6868b08f647059d102d\",\n \"score\": \"0.58476776\",\n \"text\": \"function drawImage(canvas) {\\n var context = canvas.node().getContext(\\\"2d\\\"),\\n image = context.createImageData(dx, dy);\\n\\n //for (var y = 0, p = -1; y < dy; ++y) {\\n for (var y = dy-1, p = -1; y >= 0; --y) {\\n for (var x = 0; x < dx; ++x) {\\n if (mapdata[y][x] < 0.) {\\n image.data[++p] = 200;\\n image.data[++p] = 200;\\n image.data[++p] = 210;\\n image.data[++p] = 255;\\n } else {\\n var c = d3.rgb(color(mapdata[y][x]));\\n image.data[++p] = c.r;\\n image.data[++p] = c.g;\\n image.data[++p] = c.b;\\n image.data[++p] = 255;\\n }\\n }\\n }\\n\\n context.putImageData(image, 0, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dedeb8d1234809e0adc59ba014af6a62\",\n \"score\": \"0.5847137\",\n \"text\": \"function renderImageToCanvas(img, canvas, options) {\\r\\n var iw = img.naturalWidth,\\r\\n ih = img.naturalHeight;\\r\\n var width = options.width,\\r\\n height = options.height;\\r\\n var ctx = canvas.getContext('2d');\\r\\n ctx.save();\\r\\n transformCoordinate(canvas, width, height, options.orientation);\\r\\n var subsampled = detectSubsampling(img);\\r\\n if (subsampled) {\\r\\n iw /= 2;\\r\\n ih /= 2;\\r\\n }\\r\\n var d = 1024; // size of tiling canvas\\r\\n var tmpCanvas = document.createElement('canvas');\\r\\n tmpCanvas.width = tmpCanvas.height = d;\\r\\n var tmpCtx = tmpCanvas.getContext('2d');\\r\\n var vertSquashRatio = detectVerticalSquash(img, iw, ih);\\r\\n var dw = Math.ceil(d * width / iw);\\r\\n var dh = Math.ceil(d * height / ih / vertSquashRatio);\\r\\n var sy = 0;\\r\\n var dy = 0;\\r\\n while (sy < ih) {\\r\\n var sx = 0;\\r\\n var dx = 0;\\r\\n while (sx < iw) {\\r\\n tmpCtx.clearRect(0, 0, d, d);\\r\\n tmpCtx.drawImage(img, -sx, -sy);\\r\\n ctx.drawImage(tmpCanvas, 0, 0, d, d, dx, dy, dw, dh);\\r\\n sx += d;\\r\\n dx += dw;\\r\\n }\\r\\n sy += d;\\r\\n dy += dh;\\r\\n }\\r\\n ctx.restore();\\r\\n tmpCanvas = tmpCtx = null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d7ea2b3e887d39b3ad5db14b431fc99\",\n \"score\": \"0.5846274\",\n \"text\": \"function img_update () {\\r\\n\\t\\tcontexto.drawImage(canvas, 0, 0);\\r\\n\\t\\tcontext.clearRect(0, 0, canvas.width, canvas.height);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a803035406feab74e81384f6829a3c80\",\n \"score\": \"0.5832754\",\n \"text\": \"render(cameraX, cameraY, cameraScaleX, cameraScaleY, cameraZoom){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3947f35a4721e8c03fa55cfe2c9d0876\",\n \"score\": \"0.5832374\",\n \"text\": \"function writeToCanvas(){\\n\\t//Create off-screen canvas\\n\\tvar temp_canvas = document.createElement('canvas'),\\n\\t\\ttemp_canvas_context = temp_canvas.getContext('2d'),\\n\\t\\twrite_y = 0,\\n\\t\\twrite_x = 0;\\n\\t\\n\\ttemp_canvas.width = width;\\n\\ttemp_canvas.height = height;\\n\\t\\n\\t// put pixel data on canvas\\n\\tfor (x = 0; x < individual_blocks.length; x++){\\n\\t\\t//reset to create a new row of blocks\\n\\t\\tif(write_y * block_size > height - block_size){\\n\\t\\t\\twrite_y = 0;\\n\\t\\t\\twrite_x++;\\n\\t\\t}\\n\\t\\t//Write to temp canvas\\n\\t\\ttemp_canvas_context.putImageData(individual_blocks[x], write_x*block_size, write_y*block_size);\\n\\t\\t//Increment row count\\n\\t\\twrite_y++;\\n\\t}\\n\\n\\t//Write to final canvas fully rendered effects\\n\\tcanvas_context.drawImage(temp_canvas, 0, 0);\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40e9a20ee5e9f999dd9252a2fe69464a\",\n \"score\": \"0.58318746\",\n \"text\": \"function renderImageToCanvas(img, canvas, options) {\\n\\t\\tvar iw = img.naturalWidth, ih = img.naturalHeight;\\n\\t\\tvar width = options.width, height = options.height;\\n\\t\\tvar x = options.x || 0, y = options.y || 0;\\n\\t\\tvar ctx = canvas.getContext('2d');\\n\\t\\tif (detectSubsampling(img)) {\\n\\t\\t\\tiw /= 2;\\n\\t\\t\\tih /= 2;\\n\\t\\t}\\n\\t\\tvar d = 1024; // size of tiling canvas\\n\\t\\tvar tmpCanvas = document.createElement('canvas');\\n\\t\\ttmpCanvas.width = tmpCanvas.height = d;\\n\\t\\tvar tmpCtx = tmpCanvas.getContext('2d');\\n\\t\\tvar vertSquashRatio = detectVerticalSquash(img, iw, ih);\\n\\t\\tvar sy = 0;\\n\\t\\twhile (sy < ih) {\\n\\t\\t\\tvar sh = sy + d > ih ? ih - sy : d;\\n\\t\\t\\tvar sx = 0;\\n\\t\\t\\twhile (sx < iw) {\\n\\t\\t\\t\\tvar sw = sx + d > iw ? iw - sx : d;\\n\\t\\t\\t\\ttmpCtx.clearRect(0, 0, d, d);\\n\\t\\t\\t\\ttmpCtx.drawImage(img, -sx, -sy);\\n\\t\\t\\t\\tvar dx = (sx * width / iw + x) << 0;\\n\\t\\t\\t\\tvar dw = Math.ceil(sw * width / iw);\\n\\t\\t\\t\\tvar dy = (sy * height / ih / vertSquashRatio + y) << 0;\\n\\t\\t\\t\\tvar dh = Math.ceil(sh * height / ih / vertSquashRatio);\\n\\t\\t\\t\\tctx.drawImage(tmpCanvas, 0, 0, sw, sh, dx, dy, dw, dh);\\n\\t\\t\\t\\tsx += d;\\n\\t\\t\\t}\\n\\t\\t\\tsy += d;\\n\\t\\t}\\n\\t\\ttmpCanvas = tmpCtx = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40e9a20ee5e9f999dd9252a2fe69464a\",\n \"score\": \"0.58318746\",\n \"text\": \"function renderImageToCanvas(img, canvas, options) {\\n\\t\\tvar iw = img.naturalWidth, ih = img.naturalHeight;\\n\\t\\tvar width = options.width, height = options.height;\\n\\t\\tvar x = options.x || 0, y = options.y || 0;\\n\\t\\tvar ctx = canvas.getContext('2d');\\n\\t\\tif (detectSubsampling(img)) {\\n\\t\\t\\tiw /= 2;\\n\\t\\t\\tih /= 2;\\n\\t\\t}\\n\\t\\tvar d = 1024; // size of tiling canvas\\n\\t\\tvar tmpCanvas = document.createElement('canvas');\\n\\t\\ttmpCanvas.width = tmpCanvas.height = d;\\n\\t\\tvar tmpCtx = tmpCanvas.getContext('2d');\\n\\t\\tvar vertSquashRatio = detectVerticalSquash(img, iw, ih);\\n\\t\\tvar sy = 0;\\n\\t\\twhile (sy < ih) {\\n\\t\\t\\tvar sh = sy + d > ih ? ih - sy : d;\\n\\t\\t\\tvar sx = 0;\\n\\t\\t\\twhile (sx < iw) {\\n\\t\\t\\t\\tvar sw = sx + d > iw ? iw - sx : d;\\n\\t\\t\\t\\ttmpCtx.clearRect(0, 0, d, d);\\n\\t\\t\\t\\ttmpCtx.drawImage(img, -sx, -sy);\\n\\t\\t\\t\\tvar dx = (sx * width / iw + x) << 0;\\n\\t\\t\\t\\tvar dw = Math.ceil(sw * width / iw);\\n\\t\\t\\t\\tvar dy = (sy * height / ih / vertSquashRatio + y) << 0;\\n\\t\\t\\t\\tvar dh = Math.ceil(sh * height / ih / vertSquashRatio);\\n\\t\\t\\t\\tctx.drawImage(tmpCanvas, 0, 0, sw, sh, dx, dy, dw, dh);\\n\\t\\t\\t\\tsx += d;\\n\\t\\t\\t}\\n\\t\\t\\tsy += d;\\n\\t\\t}\\n\\t\\ttmpCanvas = tmpCtx = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40e9a20ee5e9f999dd9252a2fe69464a\",\n \"score\": \"0.58318746\",\n \"text\": \"function renderImageToCanvas(img, canvas, options) {\\n\\t\\tvar iw = img.naturalWidth, ih = img.naturalHeight;\\n\\t\\tvar width = options.width, height = options.height;\\n\\t\\tvar x = options.x || 0, y = options.y || 0;\\n\\t\\tvar ctx = canvas.getContext('2d');\\n\\t\\tif (detectSubsampling(img)) {\\n\\t\\t\\tiw /= 2;\\n\\t\\t\\tih /= 2;\\n\\t\\t}\\n\\t\\tvar d = 1024; // size of tiling canvas\\n\\t\\tvar tmpCanvas = document.createElement('canvas');\\n\\t\\ttmpCanvas.width = tmpCanvas.height = d;\\n\\t\\tvar tmpCtx = tmpCanvas.getContext('2d');\\n\\t\\tvar vertSquashRatio = detectVerticalSquash(img, iw, ih);\\n\\t\\tvar sy = 0;\\n\\t\\twhile (sy < ih) {\\n\\t\\t\\tvar sh = sy + d > ih ? ih - sy : d;\\n\\t\\t\\tvar sx = 0;\\n\\t\\t\\twhile (sx < iw) {\\n\\t\\t\\t\\tvar sw = sx + d > iw ? iw - sx : d;\\n\\t\\t\\t\\ttmpCtx.clearRect(0, 0, d, d);\\n\\t\\t\\t\\ttmpCtx.drawImage(img, -sx, -sy);\\n\\t\\t\\t\\tvar dx = (sx * width / iw + x) << 0;\\n\\t\\t\\t\\tvar dw = Math.ceil(sw * width / iw);\\n\\t\\t\\t\\tvar dy = (sy * height / ih / vertSquashRatio + y) << 0;\\n\\t\\t\\t\\tvar dh = Math.ceil(sh * height / ih / vertSquashRatio);\\n\\t\\t\\t\\tctx.drawImage(tmpCanvas, 0, 0, sw, sh, dx, dy, dw, dh);\\n\\t\\t\\t\\tsx += d;\\n\\t\\t\\t}\\n\\t\\t\\tsy += d;\\n\\t\\t}\\n\\t\\ttmpCanvas = tmpCtx = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08f13d9d6b6f053a6392a80409c09462\",\n \"score\": \"0.58316827\",\n \"text\": \"updateBuffer () {\\n\\t\\tthis.buffer = new Array(displayOptions.width * displayOptions.height);\\n\\n\\t\\t//console.log(this.bx + \\\",\\\"+ this.by);\\n\\t\\tthis.bx = this.bufferEntity.position.x;\\n\\t\\tthis.by = this.bufferEntity.position.y;\\n\\n\\t\\tfor (let i = 0; i < bufferOptions.width; i++) {\\n\\t\\t\\tfor (let j = 0; j < bufferOptions.height; j++) {\\n\\t\\t\\t\\t//Tiles are the default thing in the buffer\\n\\t\\t\\t\\t//position of the screen ON THE MAP.\\n\\t\\t\\t\\t//BX is NOT on the BUFFER; it is on the MAP.\\n\\t\\t\\t\\tconst bufferx = this.bx + i;\\n\\t\\t\\t\\tconst buffery = this.by + j;\\n\\t\\t\\t\\tconst tile = mapSystem.getTile(bufferx, buffery);\\n\\t\\t\\t\\tconst isOutsideMap = bufferx < 0 || bufferx >= mapOptions.width || buffery < 0 || buffery >= mapOptions.height;\\n\\t\\t\\t\\tconst pos = i + j * bufferOptions.width;\\n\\n\\t\\t\\t\\t//Bloody hack: If it's outside the map, then dont draw it\\n\\t\\t\\t\\tif (!tile || isOutsideMap) {this.buffer[pos] = new DisplayTile('', '', '#000000').query(); continue;}\\n\\t\\t\\t\\telse if (tile.entityHere && tile.entityHere.display && (tile.hasSeen || tile.inSight)) {\\n\\t\\t\\t\\t\\tconst entity = tile.entityHere;\\n\\n\\t\\t\\t\\t\\tthis.buffer[pos] = entity.display.tile.query();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (tile.hasSeen || tile.inSight) {\\n\\t\\t\\t\\t\\tif (tile.varietyColor) {this.buffer[i+j*bufferOptions.width]=[tile.tileType.tile.character, tile.varietyColor];}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tthis.buffer[pos] = tile.tileType.tile.query();\\n\\t\\t\\t\\t\\t\\tif (tile.hasSeen && !tile.inSight) {\\n\\t\\t\\t\\t\\t\\t\\tthis.buffer[pos][1] = ROT.Color.toHex(ROT.Color.interpolate(ROT.Color.fromString(this.buffer[pos][1]), ROT.Color.fromString(\\\"#000000\\\")), 0.3);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttile.inSight = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c73e63cebd939d2a19304c54a3efa69e\",\n \"score\": \"0.581672\",\n \"text\": \"function img_update () {\\n\\t\\tcontexto.drawImage(canvas, 0, 0);\\n\\t\\tcontext.clearRect(0, 0, canvas.width, canvas.height);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e5608455003bf56ce6716308ffdd02c\",\n \"score\": \"0.58157545\",\n \"text\": \"function renderData(imageData, anim){\\t\\n\\tvar data = getUserInputData();\\n\\t//identified global variables\\n\\tvar Xs = 256;\\t\\t\\t\\t\\t//Xres\\n\\tvar Ys = 256;\\t\\t\\t\\t\\t//Yres\\n\\tvar Zmax = 333333333;\\n\\tvar Cam = {X:{}, Y:{}, Z:{}}\\t//camera\\n\\tvar worldMatrix = new Array();\\n\\t//end of global variables\\n\\t//calculated values from global variables\\n\\t\\n\\t//end of calculated values\\n\\tdata.Light = [\\n\\t\\t\\t\\t\\t{pos:{x:-0.7071, y:0.7071, z:0},color:{r:0.5,g:0.5,b:0.9}},\\n\\t\\t\\t\\t\\t{pos:{x:0, y:-0.7071, z:-0.7071},color:{r:0.9,g:0.2,b:0.3}},//{0, -0.7071, -0.7071}, {0.9, 0.2, 0.3}\\n\\t\\t\\t\\t\\t{pos:{x:0.7071, y:0.0, z:-0.7071},color:{r:0.2,g:0.7,b:0.3}},//{0.7071, 0.0, -0.7071}, {0.2, 0.7, 0.3}\\t\\n\\t\\t\\t\\t];\\t//{ {-0.7071, 0.7071, 0}, {0.5, 0.5, 0.9} };\\n\\tdata.Ks = {r:0.3,g:0.3,b:0.3};\\n\\tdata.Ka = {r:0.1,g:0.1,b:0.1};\\n\\tdata.Kd = {r:0.7,g:0.7,b:0.7};\\n\\tdata.s = 32;//specular coefficient\\n\\tdata.La = {pos:{x:0, y:0, z:0},color:{r:0.3,g:0.3,b:0.3}}\\n\\tdata.Zmax = Zmax;\\n\\t//data.shaderType = 'FLAT';//GOURAUD';//'FLAT'\\n\\n\\tcalculateWorldMatrix(worldMatrix, data)\\n\\n\\tvar FOV = data.FOV\\t//focal point\\n\\tvar C = data.C;\\t\\t//camera location\\n\\tvar L = data.L;\\t\\t//lookat\\n\\tvar UP = data.UP;\\t//up_\\n\\tif(anim){\\n\\t\\tFOV = data.FOV = anim.FOV?anim.FOV:data.FOV;\\n\\t\\t//data.La.color.r = anim.FOV;\\n\\t\\t//data.Light = anim.Light?anim.Light:data.Light;\\n\\t\\tdata.La = anim.La?anim.La:data.La;\\n\\t\\tdata.proceduralTexture = anim.proceduralTexture;\\n\\t}\\n\\tvar d = 1/(tan(FOV/2));\\n\\n\\tcalculateCamera(Cam, C, L, UP)\\n\\tvar Xsp = calculateXsp(Xs, Ys, Zmax, d);\\n\\tvar Xpi = calculateXpi(d);\\n\\tvar Xiw = calculateXiw(Cam, C)\\n\\tvar Xwm = calculateXwm(worldMatrix)\\n\\tdata.Xsp = Xsp;\\n\\tdata.Xpi = Xpi;\\n\\tdata.Xiw = Xiw;\\n\\tdata.Xwm = Xwm;\\n\\n\\tvar globalMatrix = new Array();\\n\\tglobalMatrix.push(Xsp);\\n\\tglobalMatrix.push(Xpi);\\n\\n\\tvar Xi = matrixMultiply(Xwm, Xiw);\\n\\tglobalMatrix.push(Xi);\\n\\t// globalMatrix.push(Xiw)\\n\\t// globalMatrix.push(Xwm)\\n\\n\\t//removing Scaling and translation from Xi\\n\\t\\n\\tvar Xsm = calculateXsm(globalMatrix);\\n\\n\\tXi = normalizeXi(Xi);\\n\\n\\tvar newVertices = applyXForms(vertices, Xsm, Xi, data)\\n\\n\\tshowFinalImage(newVertices, imageData, data)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95d9c18712a73e59d590100f7325884f\",\n \"score\": \"0.57955796\",\n \"text\": \"function zoomCanvasTo(_x,_y, oldlevel ,newlevel){\\n\\tif(showAll){\\n\\t\\tscreenH=$(window).height()-20;\\n\\n\\t\\tif(canvasRatio>screenRatio){\\n\\t\\t\\tshowAllZoomLevel=(canvas.width/screenW)\\n\\t\\t}else{\\n\\t\\t\\tshowAllZoomLevel=(canvas.height/screenH)\\n\\t\\t}\\nnewLevel= showAllZoomLevel\\n\\t\\t$(\\\"#canvasHolder\\\").css({width:screenW, height:screenH})\\n\\t\\t$(\\\"#canvasNavHolder\\\").slideUp(\\\"slow\\\").delay(400);\\n\\t\\t$(\\\"#buttonHolder\\\").css({marginTop:(screenH+70)+\\\"px\\\"});\\n\\t\\t$(\\\"#canvas\\\").css({cursor: \\\"url(images/cursor_zoom_in.cur) 6.5 6.5, crosshair\\\"})\\n\\t}else{\\n\\t\\t$(\\\"#canvasHolder\\\").css({width:screenW, height:screenH})\\n\\t\\tscreenH=$(window).height()-60;\\n\\t\\t$(\\\"#buttonHolder\\\").css({marginTop:(screenH+10)+\\\"px\\\"}).clearQueue().show();\\n\\t\\t$(\\\"#canvasNavHolder\\\").slideDown(\\\"slow\\\").delay(400);\\n\\t\\t$(\\\"#canvas\\\").css({cursor: \\\"url(images/\\\"+currentCursor+\\\".cur) \\\"+cursorPosition[currentCursor]+\\\" \\\"+cursorPosition[currentCursor]+\\\", crosshair\\\"})\\n\\t}\\n\\tcanvasCenter={x:_x,y:_y}\\n\\tvar oldCanvasW=canvas.width/oldlevel;\\n\\tvar newCanvasW=canvas.width/newlevel;\\n\\tvar navCanvasW=canvas.width*navSizePercent;\\n\\tvar oldCanvasH=canvas.height/oldlevel\\n\\tvar newCanvasH=canvas.height/newlevel\\n\\tvar navCanvasH=canvas.height*navSizePercent;\\n\\tvar navX=navCanvasW*((oldCanvasW-(oldCanvasW-(_x/oldlevel)))/oldCanvasW);\\n\\tvar navY=navCanvasH*((oldCanvasH-(oldCanvasH-(_y/oldlevel)))/oldCanvasH);\\n\\tvar newX=newCanvasW*((oldCanvasW-(oldCanvasW-(_x/oldlevel)))/oldCanvasW);\\n\\tvar newY=newCanvasH*((oldCanvasH-(oldCanvasH-(_y/oldlevel)))/oldCanvasH);\\n\\tvar offsetX=-(newX)+(screenW/2);\\n\\tvar offsetY=-(newY)+(screenH/2);\\n\\tvar canvasBoxH=(screenH*navSizePercent)*newlevel;\\n\\tvar canvasBoxW=(screenW*navSizePercent)*newlevel;\\n\\tvar navOffsetX=(navX)-(canvasBoxW/2)\\n\\tvar navOffsetY=(navY)-(canvasBoxH/2)\\n\\tcurrentZoomLevel= newlevel\\n\\t// set to draggable so the animate function can properly set the left/top of canvas. figure out why this is the case…\\n\\t$(\\\"#canvas\\\").draggable({drag:dragfunc})\\n\\t$(\\\"#canvas\\\").animate({\\n\\t\\tleft:offsetX,\\n\\t\\ttop:offsetY,\\n\\t\\twidth:canvas.width/newlevel,\\n\\t\\theight:canvas.height/newlevel\\n\\t},300,function(){\\n\\t\\tcanvasPos.x=$(\\\"#canvas\\\").offset().left;\\n\\t\\tcanvasPos.y=$(\\\"#canvas\\\").offset().top;\\n\\t});\\n\\t//destroy the draggable instance.\\n\\t$(\\\"#canvas\\\").draggable(\\\"destroy\\\")\\n\\tcanvasPos.x=offsetX;\\n\\tcanvasPos.y=offsetY;\\n\\t$(\\\"#canvasNavBox\\\").animate({\\n\\t\\tleft:navOffsetX,\\n\\t\\ttop:navOffsetY,\\n\\t\\twidth:canvasBoxW-2,\\n\\t\\theight:canvasBoxH-2\\n\\t},300);\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96a1a139f18770167558a49568463c01\",\n \"score\": \"0.57934433\",\n \"text\": \"preRenderImage(canvasSize, level, window) {\\n\\tvar canvas = document.createElement(\\\"canvas\\\")\\n\\tthis.drawImageOnly(canvas, canvasSize, level, window)\\n\\tthis.preRender = canvas\\n\\tthis.preRenderLevel = level\\n\\tthis.preRenderWindow = window\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc290efda242e3911db3b02507492e93\",\n \"score\": \"0.57924485\",\n \"text\": \"render() {\\n for (let y = 0; y < this.canvas.heigth; y += 1) {\\n for (let x = 0; x < this.canvas.width; x += 1) {\\n let pixel = x === 0 || y === 0 ? this.canvas.renderAt(x, y) : null;\\n\\n const line = this.pixels[x];\\n if (!line) this.pixels[x] = [];\\n\\n if (!pixel) {\\n for (let s = this.shapes.length - 1; s >= 0; s -= 1) {\\n const v = this.shapes[s].renderAt(x, y);\\n if (v) {\\n pixel = v;\\n break;\\n }\\n }\\n }\\n\\n\\n if (!pixel) {\\n pixel = this.pixels[x][y] ? this.pixels[x][y] : this.canvas.renderAt(x, y);\\n }\\n this.pixels[x][y] = pixel;\\n this.rl.write(pixel);\\n }\\n this.rl.write('\\\\n');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bafd9f7b63e705a5c55ecda35d72d0ae\",\n \"score\": \"0.57905746\",\n \"text\": \"updateCanvas(){\\n if (this.props.content){\\n let data = this.props.content.toImageData();\\n const canvas = this.refs.canvas;\\n const context = canvas.getContext('2d');\\n\\n context.clearRect(0, 0, canvas.width, canvas.height);\\n context.fillStyle =\\\"rgba(255, 255, 255, 255)\\\";\\n context.beginPath();\\n context.fillRect(0, 0, data.width, data.height);\\n context.fill();\\n context.globalCompositeOperation = 'source-over';\\n\\n context.putImageData(this.props.content.toImageData(), 0, 0);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"971f49d1e3e5a8f960547e76ff231e0d\",\n \"score\": \"0.57877886\",\n \"text\": \"function drawImage(canvas) {\\n var context = canvas.node().getContext(\\\"2d\\\"),\\n image = context.createImageData(dx, dy);\\n \\n for (var y = 0, p = -1; y < dy; ++y) {\\n for (var x = 0; x < dx; ++x) {\\n var c = d3.rgb(MAP_COLORS(data[dy-y-1][x]));\\n image.data[++p] = c.r;\\n image.data[++p] = c.g;\\n image.data[++p] = c.b;\\n image.data[++p] = 255;\\n }\\n }\\n \\n context.putImageData(image, 0, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7261bff790cbd1b9806b791f2a8260b7\",\n \"score\": \"0.57866824\",\n \"text\": \"function draw()\\n{\\n\\trenderPass = 0;\\n\\tmode = $(\\\"algorithm\\\").selectedIndex;\\n\\tconsole.log(\\\"alg: \\\" + mode);\\n\\tdoInverse = $(\\\"inverse\\\").checked;\\n\\n\\tdepth_red = parseInt($(\\\"redText\\\").value);\\n\\tdepth_green = parseInt($(\\\"greenText\\\").value);\\n\\tdepth_blue = parseInt($(\\\"blueText\\\").value);\\n\\n\\tmax_depth = Math.max(depth_green, Math.max(depth_blue, depth_red));\\n\\timg_cache = matrix(max_depth, 2, 0.0);\\n\\n\\tresetScore();\\n\\n\\tif ( lookAt === null ) lookAt = lookAtDefault;\\n\\tif ( zoom === null ) zoom = [zoomStart, zoomStart];\\n\\n\\txRange = [lookAt[0]-zoom[0]/2, lookAt[0]+zoom[0]/2];\\n\\tyRange = [lookAt[1]-zoom[1]/2, lookAt[1]+zoom[1]/2];\\n\\trange_x = xRange[1] - xRange[0];\\n\\trange_y = yRange[1] - yRange[0];\\n\\n\\tif ( reInitCanvas ) {\\n\\t\\treInitCanvas = false;\\n\\n\\t\\tcanvas = $('canvasMandelbrot');\\n\\t\\tcanvas.width = window.innerWidth;\\n\\t\\tcanvas.height = window.innerHeight;\\n\\n\\t\\tccanvas = $('canvasControls');\\n\\t\\tccanvas.width = window.innerWidth;\\n\\t\\tccanvas.height = window.innerHeight;\\n\\n\\t\\tctx = canvas.getContext('2d');\\n\\t\\tctx_img = ctx.createImageData(canvas.width, canvas.height);\\n\\t}\\n\\n\\tadjustAspectRatio(xRange, yRange, canvas);\\n\\tconsole.log(\\\"zoom: \\\" + zoom[0] + \\\" \\\" + zoom[1] + \\\" mode: \\\" + mode);\\n\\n\\timg_red = new matrix(canvas.width, canvas.height, 0.0);\\n\\timg_green = new matrix(canvas.width, canvas.height, 0.0);\\n\\timg_blue = new matrix(canvas.width, canvas.height, 0.0);\\n\\n\\tupdateHashTag();\\n\\tupdateInfoBox();\\n\\n\\t// Only enable one render at a time\\n\\trenderId += 1;\\n\\n\\trender();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9d37fea73cf9b30eb9b8bfbdeb5df3b\",\n \"score\": \"0.578049\",\n \"text\": \"function doRedraw (){\\n encoder.addFrame(canvas.getContext(\\\"2d\\\"));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6943a26eac201da2990cbd3cb560a44f\",\n \"score\": \"0.57749456\",\n \"text\": \"draw() {\\n ctx.drawImage(this.img, this.x, this.y, this.width, this.height);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9055cea84c6f492eb7fec64ac3975270\",\n \"score\": \"0.57669914\",\n \"text\": \"function initCanvas()\\n{\\n const canvas = document.getElementById('canvas');\\n const ctx = canvas.getContext('2d');\\n const canvasWidth = canvas.width;\\n const canvasHeight = canvas.height;\\n const imageData = ctx.getImageData(0,0,1,1);\\n\\n\\n \\n\\n \\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a0fee69d031e26cec344378db4ff4e8c\",\n \"score\": \"0.57667243\",\n \"text\": \"function initCanvas() {\\n buf.canvas.width = circuit.width;\\n buf.canvas.height = circuit.height;\\n ctx.canvas.width = circuit.width * scale;\\n ctx.canvas.height = circuit.height * scale;\\n\\n ctx.imageSmoothingEnabled = false;\\n ctx.fillStyle = \\\"white\\\";\\n ctx.strokeStyle = \\\"white\\\";\\n\\n switch (scale) {\\n case 1:\\n rubber.size = 12;\\n break;\\n case 2:\\n rubber.size = 6;\\n break;\\n case 3:\\n rubber.size = 3;\\n break;\\n case 4:\\n rubber.size = 2;\\n break;\\n default:\\n rubber.size = 1;\\n break;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a09ec4cb8df7079d01fbbdd82ff2b1fe\",\n \"score\": \"0.5749631\",\n \"text\": \"function draw() {\\n image(resultImg, 0, 0, 640, 480);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"798b0f2e57c8a7b7b9b81bc4b7213a8f\",\n \"score\": \"0.5728994\",\n \"text\": \"function render(src){\\n var image = new Image();\\n \\n image.onload = function(){\\n ctx.clearRect(0, 0, canvas.width, canvas.height);\\n\\n canvas.width = 2480;\\n canvas.height = 3508;\\n\\n\\n ctx.fillStyle = blendColor;\\n ctx.fillRect(0,0,canvas.width,canvas.height);\\n // @TODO find solution for no .filter support in IE or Safari. Consider this approach: https://www.html5rocks.com/en/tutorials/canvas/imagefilters/\\n ctx.filter = currentFilter + ' contrast(' + contrast + ')';\\n ctx.filter += currentFilter + ' brightness(' + brightness + ')';\\n ctx.filter += currentFilter + ' blur(' + blur + 'px)';\\n ctx.globalCompositeOperation = currentBlend;\\n\\n // get the scale\\n var scale = Math.max(canvas.width / image.width, canvas.height / image.height);\\n\\n var x = (canvas.width / 2) - (image.width / 2) * scale;\\n var y = (canvas.height / 2) - (image.height / 2) * scale;\\n ctx.drawImage(image, x, y, image.width * scale, image.height * scale);\\n \\n\\n };\\n \\n image.src = src;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d71917f633b9039f59866d580bb21b4\",\n \"score\": \"0.57225996\",\n \"text\": \"listenerMouseDownTouchStart(e) {\\n // The pointerdown event signals the start of a touch interaction.\\n // This event is cached to support 2-finger gestures\\n if (e.pointerId) {\\n this.evCache.push(e);\\n }\\n var [pos, touch] = this.pointerEvents(e);\\n\\n if (this.evCache.length < 2) {\\n this.dragStarted = true;\\n this.isDragging = this.scaling = false;\\n\\n this.startCoords = {\\n x: pos.x - this.lastMove.x,\\n y: pos.y - this.lastMove.y\\n };\\n\\n this.previewZoomStartCoords = {\\n x: this.applyScaleToMoveX(this.startCoords.x),\\n y: this.applyScaleToMoveY(this.startCoords.y)\\n };\\n\\n this.lastDraggedPos.x = pos.x;\\n this.lastDraggedPos.y = pos.y;\\n\\n this.lastChangeIn = \\\"main\\\";\\n\\n this.queueCanvasDraw();\\n\\n if (app.dev) {\\n // console.log(['start startCoords:', this.startCoords.x, this.startCoords.y, ', pos: ', pos.x, pos.y, ', lastMove: ', this.lastMove.x, this.lastMove.y, ', dragStarted: ', this.dragStarted]);\\n // console.log(this.scalingCanvasDrawArgs());\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b3ae336f361bcff8016b7054fb847d0\",\n \"score\": \"0.57220244\",\n \"text\": \"function draw(v, c, bc, w, h) {\\n // First, draw it into the backing canvas\\n bc.drawImage(v, 0, 0, w, h);\\n // Grab the pixel data from the backing canvas\\n var idata = bc.getImageData(0, 0, w, h);\\n var data = idata.data;\\n\\n // apply filters based on filterMode set with button\\n filters(filterMode, data);\\n\\n idata.data = data;\\n // Draw the pixels onto the visible canvas\\n c.putImageData(idata, 0, 0);\\n // Start over!\\n setTimeout(function () {\\n\\n draw(v, c, bc, w, h);\\n }, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0af984a9e0a6c745a362bfc54f09228c\",\n \"score\": \"0.57095057\",\n \"text\": \"function placeOntoCanvas() {\\n holder.getContext('2d').drawImage(videoElm, 0, 0);\\n imageData = holder.getContext('2d').getImageData(0, 0, holder.width, holder.height);\\n window.chroma.cutout(imageData, holder.height, holder.width, function(cleaned) {\\n imageData.data.set(cleaned);\\n output.getContext('2d').putImageData(cleaned, 0, 0);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"140cb2e155fe581e1d4107b24e13efc9\",\n \"score\": \"0.57065076\",\n \"text\": \"render (ctx, srcX, srcY, srcW, srcH, destX, destY, destW, destH) {\\n if (!this.isReady()) { return; }\\n\\n var srcImg = this._srcImg;\\n if (ctx.filter) {\\n var filterImg = filterRenderer.renderFilter(ctx, this, srcX, srcY, srcW, srcH);\\n if (filterImg) {\\n srcImg = filterImg;\\n srcX = 0;\\n srcY = 0;\\n }\\n }\\n\\n ctx.drawImage(srcImg, srcX, srcY, srcW, srcH, destX, destY, destW, destH);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ab4868990c30adb6456b071db843359\",\n \"score\": \"0.5697599\",\n \"text\": \"draw() {\\n drawCallCount++;\\n return new Uint8ClampedArray(900);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c0d88cdeadd2dd560c051c2e5cd4943\",\n \"score\": \"0.56916714\",\n \"text\": \"function render(canvas){\\n var L = parseFloat(document.getElementById(\\\"L\\\").value);\\n var K = parseFloat(document.getElementById(\\\"K\\\").value);\\n var G = parseFloat(document.getElementById(\\\"G\\\").value);\\n var color_func = greyscale_map;\\n if (document.getElementById(\\\"color\\\").checked)\\n color_func = rainbow_colormap;\\n var canvas = document.getElementById('example');\\n \\n if (! canvas) {\\n console.log(' Failed to retrieve the < canvas > element');\\n return false;\\n }\\n else {\\n\\tconsole.log(' Got < canvas > element ');\\n }\\n // Get the rendering context for 2DCG <- (2)\\n var ctx = canvas.getContext('2d');\\n\\n // Draw the scalar data using an image rpresentation\\n var imgData=ctx.getImageData(0,0,canvas.width,canvas.height);\\n\\n // Store whole image noise data\\n var pt_noise = (function()\\n {\\n var array = [];\\n for(var y = 0; y != (canvas.width+1); y++) { array[y] = new Float32Array(canvas.height+1); }\\n return array;\\n })();\\n\\n var pt_lic = (function()\\n {\\n var array = [];\\n for(var y = 0; y != (canvas.width+1); y++) { array[y] = new Float32Array(canvas.height+1); }\\n return array;\\n })();\\n\\n for (var y=0;y<canvas.height;y++){\\n \\tfor (var x=0;x<canvas.width;x++)\\n {\\n pt_noise[x][y] = Math.random();\\n }\\n }\\n\\n for (var y=0;y<canvas.height;y++){\\n for (var x=0;x<canvas.width;x++)\\n {\\n var h = 5.0*(x_extent[1]-x_extent[0])/canvas.width;\\n var steps = L;\\n var pixel = [x,y];\\n var numerator = 0.0;\\n var denominator = 0.0;\\n var pt_pixel = pixel2pt(canvas.width,canvas.height,x_extent,y_extent,x,y);\\n var linpts_forward = euler_integration(pixel2pt(canvas.width,canvas.height,x_extent,y_extent,x,y),h,steps,gaussian_gradient);\\n var linpts_backward = euler_integration(pixel2pt(canvas.width,canvas.height,x_extent,y_extent,x,y),h,steps,gaussian_gradient_backward);\\n\\n var temp_forward = 0.0;\\n var temp_backward = 0.0;\\n var distances_backward = new Float32Array(steps);\\n var distances_forward = new Float32Array(steps);\\n distances_backward[0]=0.0;\\n distances_forward[0]=0.0;\\n for (var i = 0; i < steps-1; i++) {\\n temp_backward = temp_backward + distance(linpts_backward[i],linpts_backward[i+1]);\\n temp_forward = temp_forward + distance(linpts_backward[i],linpts_forward[i+1]);\\n distances_backward[i+1]=temp_backward;\\n distances_forward[i+1]=temp_forward;\\n }\\n\\n for (var i = 0; i < steps; i++) {\\n var pixel_backward = pt2pixel(canvas.width,canvas.height,x_extent,y_extent,linpts_backward[i][0],linpts_backward[i][1]);\\n var pixel_forward = pt2pixel(canvas.width,canvas.height,x_extent,y_extent,linpts_forward[i][0],linpts_forward[i][1]);\\n var weight_backward = Math.exp(-Math.pow(distances_backward[i],2));\\n var weight_forward = Math.exp(-Math.pow(distances_forward[i],2));\\n\\n if (pixel_backward[0]<0||pixel_backward[0]>canvas.width||pixel_backward[1]<0||pixel_backward[1]>canvas.height||pixel_forward[0]<0||pixel_forward[0]>canvas.width||pixel_forward[1]<0||pixel_forward[1]>canvas.height) {\\n numerator = numerator + weight_backward * Math.random() + weight_forward * Math.random();\\n }else{\\n numerator = numerator + weight_backward * pt_noise[pixel_backward[0]][pixel_backward[1]] + weight_forward * pt_noise[pixel_forward[0]][pixel_forward[1]];\\n }\\n denominator = denominator + weight_backward + weight_forward;\\n }\\n numerator = numerator - pt_noise[x][y]; // substract weight(1) * target pixel noise since euler_integration calculate twice(backward,forward)\\n denominator = denominator - 1; // substract target pixel weight(1) since euler_integration calculate twice(backward,forward)\\n pt_lic[x][y] = numerator/denominator;\\n }\\n }\\n var mn_temp = 256;\\n var mx_temp = -256;\\n for (var y=0;y<canvas.height;y++)\\n for (var x=0;x<canvas.width;x++)\\n {\\n var grad = gaussian_gradient(pixel2pt(canvas.width,canvas.height,x_extent,y_extent,x,y));\\n var fval = Math.sqrt(Math.pow(grad[0],2)+Math.pow(grad[1],2));\\n if (fval < mn_temp)\\n mn_temp=fval;\\n if (fval>mx_temp)\\n mx_temp=fval;\\n }\\n\\n var mn = pt_noise[0][0];\\n var mx = mn;\\n for (var y=0;y<canvas.height;y++)\\n for (var x=0;x<canvas.width;x++)\\n {\\n var fval = pt_noise[x][y];\\n if (fval < mn)\\n mn=fval;\\n if (fval>mx)\\n mx=fval;\\n }\\n\\n for (var y=0;y<canvas.height;y++){\\n for (var x=0;x<canvas.width;x++)\\n {\\n if (document.getElementById(\\\"color\\\").checked){\\n color_func = rainbow_colormap;\\n var grad = gaussian_gradient(pixel2pt(canvas.width,canvas.height,x_extent,y_extent,x,y));\\n var temp = Math.sqrt(Math.pow(grad[0],2)+Math.pow(grad[1],2));\\n var color = color_func(temp,mn_temp,mx_temp);\\n i = (y*canvas.width + x)*4\\n imgData.data[i]=color[0]*pt_lic[x][y];\\n imgData.data[i+1]= color[1]*pt_lic[x][y];\\n imgData.data[i+2]= color[2]*pt_lic[x][y];\\n imgData.data[i+3]= color[3];\\n }else{\\n var color = color_func(pt_lic[x][y],mn,mx);\\n i = (y*canvas.width + x)*4\\n imgData.data[i]=color[0];\\n imgData.data[i+1]= color[1];\\n imgData.data[i+2]= color[2];\\n imgData.data[i+3]= color[3];\\n }\\n }\\n }\\n\\n\\tctx.putImageData(imgData,0,0);\\n if (document.getElementById(\\\"hedgehog\\\").checked){\\n draw_glyphs(K,G,gaussian_gradient,canvas);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc784f544afe38e83a43c4e271de62b5\",\n \"score\": \"0.5690815\",\n \"text\": \"function zoomimg_in() {\\n\\n imageheight *= 1.1\\n imagewidth *= 1.1\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3ac9af4243e79a14ad6360d45b923c1\",\n \"score\": \"0.56900203\",\n \"text\": \"function restoreDrawingSurface(){\\n\\tcontext.putImageData(imageData,0,0);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e15f4252d2352a8ca8cb36c54024223e\",\n \"score\": \"0.56877136\",\n \"text\": \"_draw(){\\n if(!this.currentConfig) return;\\n const ids = this.streamIds();\\n if(this.currentConfig.paint){\\n // let the custom paint function handle it\\n this.currentConfig.paint(ids, this._canvas, this._context);\\n }else{\\n const snapshot = {background: null, mixed: []};\\n this._context.clearRect(0,0,this._width,this._height);\\n const background = this.currentConfig.background()(ids);\\n this._context.fillStyle = background;\\n snapshot.background = background;\\n this._context.fillRect(0,0,this._width, this._height);\\n // check if you have to resolve position functions\\n const resolveFn = (v, s) => typeof v === \\\"function\\\" ? v(s) : v;\\n this.currentConfig.calculatedPositions\\n // sort according to z-Index\\n .sort((a , b) => {\\n if(a.zIndex !== undefined && b.zIndex !== undefined){\\n return (typeof a.zIndex === \\\"function\\\" ? a.zIndex({id: a.assignedId}) : a.zIndex) - (typeof b.zIndex === \\\"function\\\" ? b.zIndex({id: b.assignedId}) : b.zIndex);\\n }\\n else if(a.zIndex !== undefined) return 1;\\n else return -1\\n })\\n // draw each frame\\n .forEach((pos, drawIndex) => {\\n const stats = {width: this.width, height: this.height, id: pos.assignedId, drawIndex};\\n if(pos.source){\\n const x = resolveFn(pos.x, stats);\\n const y = resolveFn(pos.y, stats);\\n const width = resolveFn(pos.width, stats);\\n const height = resolveFn(pos.height, stats);\\n this._context.drawImage(pos.source, x, y, width, height);\\n snapshot.mixed.push({id: pos.assignedId, drawIndex, x, y, width, height});\\n }\\n });\\n // optionally take a snapshot\\n if(this._snapshot){\\n this._snapshot(snapshot);\\n this._snapshot = null;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ce64ebcbe8ee222e5858e3f4855e176\",\n \"score\": \"0.5683904\",\n \"text\": \"function draw_image(){\\n ctx.drawImage(img,0,0,CANVAS_WIDTH, CANVAS_HEIGHT);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2a5d53aef18a389dffb134dea251f1e\",\n \"score\": \"0.56792134\",\n \"text\": \"function init() {\\n canvas = document.getElementById('fractal');\\n canvasPreview = document.getElementById('zoompreview');\\n paletStart = document.getElementById(\\\"rngPalet\\\");\\n\\n zoomhistory = [];\\n\\n /*\\n Get references to important elements in the DOM\\n */\\n // Bounding box info\\n elmX1 = document.getElementById('bbx1');\\n elmY1 = document.getElementById('bby1');\\n elmX2 = document.getElementById('bbx2');\\n elmY2 = document.getElementById('bby2');\\n\\n // cursor location\\n elmCursorX = document.getElementById('cursorX');\\n elmCursorY = document.getElementById('cursorY');\\n\\n // zoombox information\\n elmZoomX1 = document.getElementById('zoomx1');\\n elmZoomX2 = document.getElementById('zoomx2');\\n elmZoomY1 = document.getElementById('zoomy1');\\n elmZoomY2 = document.getElementById('zoomy2');\\n\\n elmZoombox = document.getElementById('zoombox');\\n elmLivePreview = document.getElementById(\\\"livepreview\\\");\\n elmDrawtime = document.getElementById(\\\"drawtime\\\");\\n elmZoomHistoryInfo = document.getElementById(\\\"zoomhistoryinfo\\\");\\n\\n var eventcatcher = document.getElementById(\\\"eventcatcher\\\");\\n\\n var palette = setupPalette(0);\\n\\n var constants = prepareconstants(canvas, -2.0, 2.0, 2.0, -2.0);\\n constants.colorpalette = palette;\\n setupZoombox(constants);\\n\\n AddToHistory(constants);\\n\\n elmDrawtime.textContent = draw(canvas, constants);\\n showBoundingBoxInfo(constants);\\n\\n eventcatcher.addEventListener(\\\"mousemove\\\", (evt) => {\\n\\n mouseX = evt.offsetX;\\n mouseY = evt.offsetY;\\n\\n // evt.offsetX and evt.offsetY contain the point clicked on the canvas. these need to be translated to the given bounding box\\n const cx = constants.boundingBoxX1 + (mouseX / constants.canvas_width ) * constants.boundingBoxWidth;\\n const cy = constants.boundingBoxY1 - (mouseY / constants.canvas_height) * constants.boundingBoxHeight;\\n\\n elmCursorX.textContent = cx.toString().substr(0,6);\\n elmCursorY.textContent = cy.toString().substr(0,6);\\n\\n // make a box 12% x 8% of the bounding box.\\n zoombox_x1 = cx - (ZOOMBOX_WIDTH_PERCENTAGE / 100) * constants.boundingBoxWidth / 2;\\n zoombox_x2 = cx + (ZOOMBOX_WIDTH_PERCENTAGE / 100) * constants.boundingBoxWidth / 2;\\n zoombox_y1 = cy + (ZOOMBOX_HEIGHT_PERCENTAGE / 100) * constants.boundingBoxHeight / 2;\\n zoombox_y2 = cy - (ZOOMBOX_HEIGHT_PERCENTAGE / 100) * constants.boundingBoxHeight / 2;\\n\\n elmZoomX1.textContent = (zoombox_x1.toString()).substr(0,6);\\n elmZoomX2.textContent = (zoombox_x2.toString()).substr(0,6);\\n elmZoomY1.textContent = (zoombox_y1.toString()).substr(0,6);\\n elmZoomY2.textContent = (zoombox_y2.toString()).substr(0,6);\\n\\n let x = mouseX - zbox_w / 2;\\n let y = mouseY - zbox_h / 2\\n\\n elmZoombox.setAttribute(\\\"x\\\", x);\\n elmZoombox.setAttribute(\\\"y\\\", y);\\n\\n if (elmLivePreview.checked){\\n\\n let tempConstants = prepareconstants(canvasPreview, zoombox_x1, zoombox_y1, zoombox_x2, zoombox_y2);\\n lastclick = prepareconstants(canvasPreview, zoombox_x1, zoombox_y1, zoombox_x2, zoombox_y2);\\n tempConstants.colorpalette = setupPalette(parseInt(paletStart.value));\\n draw(canvasPreview, tempConstants);\\n }\\n });\\n\\n eventcatcher.addEventListener(\\\"wheel\\\", (evt) => {\\n if (evt.wheelDelta > 0) {\\n ZOOMBOX_WIDTH_PERCENTAGE++;\\n ZOOMBOX_HEIGHT_PERCENTAGE++;\\n }\\n else if (evt.wheelDelta <0) {\\n ZOOMBOX_WIDTH_PERCENTAGE--;\\n ZOOMBOX_HEIGHT_PERCENTAGE--;\\n }\\n setupZoombox(constants);\\n });\\n\\n window.addEventListener(\\\"keypress\\\", (evt) => {\\n switch(evt.code){\\n case \\\"+\\\":\\n case \\\"NumpadAdd\\\":\\n ZOOMBOX_WIDTH_PERCENTAGE++;\\n ZOOMBOX_HEIGHT_PERCENTAGE++;\\n break;\\n case \\\"-\\\":\\n case \\\"NumpadSubtract\\\":\\n ZOOMBOX_WIDTH_PERCENTAGE--;\\n ZOOMBOX_HEIGHT_PERCENTAGE--;\\n break;\\n }\\n setupZoombox(constants);\\n });\\n\\n eventcatcher.addEventListener(\\\"dblclick\\\", (evt) => {\\n\\n evt.preventDefault();\\n evt.stopPropagation();\\n\\n AddToHistory(constants);\\n\\n constants = prepareconstants(canvas, zoombox_x1, zoombox_y1, zoombox_x2, zoombox_y2);\\n constants.colorpalette = palette;\\n\\n elmDrawtime.textContent = draw(canvas, constants);\\n showBoundingBoxInfo(constants);\\n\\n return false;\\n });\\n\\n var lastclick = null;\\n\\n eventcatcher.addEventListener(\\\"click\\\", (evt) => {\\n evt.preventDefault();\\n evt.stopPropagation();\\n\\n // left mouse\\n let tempConstants = prepareconstants(canvasPreview, zoombox_x1, zoombox_y1, zoombox_x2, zoombox_y2);\\n lastclick = prepareconstants(canvasPreview, zoombox_x1, zoombox_y1, zoombox_x2, zoombox_y2);\\n tempConstants.colorpalette = palette;\\n draw(canvasPreview, tempConstants);\\n\\n return false;\\n });\\n\\n eventcatcher.addEventListener(\\\"contextmenu\\\", evt => {\\n evt.preventDefault();\\n evt.stopPropagation();\\n // right mouse\\n if (zoomhistory.length > 0) {\\n constants = GetFromHistory();\\n showBoundingBoxInfo(constants);\\n draw(canvas, constants);\\n }\\n return false;\\n });\\n\\n\\n document.getElementById(\\\"redraw\\\").addEventListener(\\\"click\\\", (evt) => {\\n AddToHistory(constants);\\n if (lastclick) {\\n constants = prepareconstants(canvas,\\n lastclick.boundingBoxX1,\\n lastclick.boundingBoxY1,\\n lastclick.boundingBoxX2,\\n lastclick.boundingBoxY2,\\n );\\n constants.colorpalette = palette;\\n elmDrawtime.textContent = draw(canvas, constants);\\n\\n }\\n });\\n\\n paletStart.addEventListener(\\\"change\\\", (evt) => {\\n palette = setupPalette(parseInt(paletStart.value));\\n\\n if (lastclick) {\\n lastclick.colorpalette = palette;\\n draw(canvasPreview, lastclick);\\n }\\n }, false);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77d4665a16e9e359d6df166a5bc4552b\",\n \"score\": \"0.5677521\",\n \"text\": \"function draw_on_canvas()\\n{\\n GLOBAL_OVERRIDE = edit_image_draw;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c34cc33f5a5d501191ae8c17df48f421\",\n \"score\": \"0.5677143\",\n \"text\": \"render() {\\n ctx.drawImage( Resources.get( this.image ), this.posX, this.posY );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d58daa4d3f1e4ee5657d4f8de073fbb0\",\n \"score\": \"0.56621003\",\n \"text\": \"function DrawImageToHelpUserPutTheirHandOverTheDevice(){\\n\\timage(img, 0, 0, window.innerWidth/2, window.innerHeight/2);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be1dc87dfc806cbc0787d9305453fcbb\",\n \"score\": \"0.56600535\",\n \"text\": \"function copy_viewport(src, dest) \\n{\\n dest.getContext(\\\"2d\\\").clearRect(0,0,dest.width,dest.height);\\n dest.getContext(\\\"2d\\\").drawImage(src,0,0);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68e4c54b3e06afe901ff48713b90f3b5\",\n \"score\": \"0.56491554\",\n \"text\": \"function draw(adjust) {\\n //ctx.clearRect(0, 0, canvas.width, canvas.height)\\n ctx.setTransform(scalef,0,0,scalef,offsetx,offsety)\\n var r = detectVerticalSquash(img)\\n ctx.drawImage(img, 0, 0, width, height/r)\\n \\n if ($('input[name=res]').is(':checked')) _draw_res_rings()\\n if ($('input[name=ice]').is(':checked')) _draw_ice_rings()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e972b1626d900519c8e6ca70842a07f\",\n \"score\": \"0.5636554\",\n \"text\": \"function zoomimg_out() {\\n\\n imageheight /= 1.1\\n imagewidth /= 1.1\\n\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":69,"cells":{"query_id":{"kind":"string","value":"8b02d6e077f551b63dc4bc64973e7e13"},"query":{"kind":"string","value":"Deal with Mobile Click"},"positive_passages":{"kind":"list like","value":[{"docid":"fbcc7736882403b5d127f335c0802219","score":"0.0","text":"function openMenu(){\n let menu = document.querySelector('.dropdown-content');\n if(menu.style.display === 'block')\n {\n menu.style.display = 'none';\n } else {\n menu.style.display = 'block';\n }\n}","title":""}],"string":"[\n {\n \"docid\": \"fbcc7736882403b5d127f335c0802219\",\n \"score\": \"0.0\",\n \"text\": \"function openMenu(){\\n let menu = document.querySelector('.dropdown-content');\\n if(menu.style.display === 'block')\\n {\\n menu.style.display = 'none';\\n } else {\\n menu.style.display = 'block';\\n }\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"601b36ab5035fb431fa9cd9e7eb32c86","score":"0.682185","text":"function mmm_mobile_double_tap_to_go () {\r\n\t\t\tfunction_selector = '#mega_main_menu li:has(.mega_dropdown) > .item_link, #mega_main_menu li:has(.post_details) > .processed_image';\r\n\t\t\tjQuery( function_selector ).unbind();\r\n\t\t\tif( /iphone|ipad|ipod|android|webos|blackberry|iemobile|opera mini/i.test( navigator.userAgent.toLowerCase() ) ) \r\n\t\t\t{\r\n\t\t\t\tvar clicked_item = false;\r\n\t\t\t\tjQuery( function_selector ).on( 'click', function( index )\r\n\t\t\t\t{\r\n\t\t\t\t\tif ( clicked_item != this) {\r\n\t\t\t\t\t\tindex.preventDefault();\r\n\t\t\t\t\t\tif ( jQuery( this ).parent().parent().parent().hasClass('keep_open') ) {\r\n\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tjQuery( '#mega_main_menu .keep_open' ).removeClass('keep_open');\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tjQuery( this ).parent().addClass('keep_open');\r\n\t\t\t\t\t\tclicked_item = this;\r\n\t\t\t\t\t}\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t}","title":""},{"docid":"314e42c1062666bbd066c0573385434e","score":"0.6660941","text":"fixMobileMouseHandling() {\n new FastClick(document.body);\n window.addEventListener(\"touchstart\", \n (event) => {\n if(event.touches.length > 1) {\n //the event is multi-touch\n //you can then prevent the behavior\n event.preventDefault();\n }\n },{ passive : false});\n }","title":""},{"docid":"9ba9b2813dc11128f862ff1c13b67fb7","score":"0.6437528","text":"function mobileMenuBtnClick() {\n $($menuMobileBtn).click(function () {\n $(this).toggleClass($showClass);\n $($menuMain).toggleClass($showClass);\n $('body').toggleClass('jsa-body-lock');\n });\n }","title":""},{"docid":"d43ec7a4863ff459379335d3dc2fd6b9","score":"0.6416783","text":"function handleClick(){\n if(isMobile){\n props.history.push(\"/dashboard/userId=\"+firebase.getCurrentUserId()+\"/goals/\"+goal.category+\"/goalId=\"+goal.id)\n }\n console.log(\"Click\")\n }","title":""},{"docid":"878c0af731e2d4b0b75162d3440da930","score":"0.63476425","text":"onMobileToggleClick(e) {\n e.preventDefault();\n this.dom.links.classList.toggle('open');\n }","title":""},{"docid":"72dbdb78bc20baacab6349ad6fe50f28","score":"0.6310012","text":"switch_to_mobile () {\n // click mobile version button\n cy.get(\".header__line--top .icon-mobile\", { timeout: 15000 })\n //.first()\n .click({ force: true });\n }","title":""},{"docid":"4f74904dc6c4c7bb68c834de91b779e3","score":"0.6309403","text":"function OnClick () {\t\t\n\t\tfingering.OnClick();\n\t\tnote.OnClick();\n\t}","title":""},{"docid":"c5069da0eda035efac35f9c6335fafdf","score":"0.62545425","text":"function receivePush(e) { \nconsole.log(\"receivePush\");\nconsole.log(e);\n\tvar extra = (OS_IOS)?e.data.extra:e.extra;\n\tvar target = (OS_IOS)?e.data.target:e.target;\n\t \n\tTi.App.fireEvent('app:goToAds', {target: target, extra: extra});\n\tTi.App.fireEvent('refresh_notification');\n\treturn false;\n}","title":""},{"docid":"97b26fdecf9ee873ac0906b660f098fd","score":"0.6253619","text":"function changePageOnTouch(num) {\n if( mobileDevice.isAny() ) {\n //alert(\"is mobile device\");\n changepage(num);\n return false;\n }\n}","title":""},{"docid":"5aeb3276f6b6c851c2373fd08f4e1479","score":"0.6211651","text":"function hyperlinkPhone(){\n\t $(\"a[href^='tel:']\").click(function(){\n\t \tif( !$(\"body\").hasClass(\"mobile\") ) return false;\n });\n}","title":""},{"docid":"40fa5e6128a85b95cde17ae5bbae15d7","score":"0.6107772","text":"function isMobile() {\n try{ document.createEvent(\"TouchEvent\"); return true; }\n catch(e){ return false; }\n }","title":""},{"docid":"40fa5e6128a85b95cde17ae5bbae15d7","score":"0.6107772","text":"function isMobile() {\n try{ document.createEvent(\"TouchEvent\"); return true; }\n catch(e){ return false; }\n }","title":""},{"docid":"9edc2dd30b177ac7bc29f66de5a3b4ef","score":"0.60983336","text":"function checkMobile() {\n try {\n document.createEvent(\"TouchEvent\");\n return true;\n } catch (e) {\n return false;\n }\n }","title":""},{"docid":"1dfd4ff08b9d401195d6c57d02c3e0c6","score":"0.6077894","text":"mobileTabClick(event) {\n const {tab} = event.target.dataset;\n this.showTab(tab);\n }","title":""},{"docid":"58ad59c09ec33627becd5bd81edaa367","score":"0.6058387","text":"function onSupportClick() {\n Analytics.trackEvent('web', 'main-support-click');\n }","title":""},{"docid":"870ca91c69fc1c3b8fb6969e31db13a3","score":"0.6024742","text":"function imgClick() {\n alert(\"Thanks For purchasing This World Class Mobile Phone\")\n}","title":""},{"docid":"2cf735ec1df6293711e69e8efe110e21","score":"0.6009585","text":"_onTouchstart(event) {\n // Prevent the click event\n event.preventDefault()\n\n this.cancelNextClick = true\n this.trigger('OffCanvasMenuButton:click')\n }","title":""},{"docid":"406ac4a71c537bab44df765ec301d61b","score":"0.5996544","text":"function mobileUi() {\n\t\tjQuery('body').addClass('mobile');\n\t\t// jQuery('#wrap-move-zones').remove();\n\t\tjQuery('#wrap-move-zones .move-fast').remove();\n\t\t//iScroll plugin\n\t\t/*var myScroll;\n\t\tmyScroll = new iScroll('menu_holder', {\n\t\t\thScroll: false,\n\t\t\thScrollbar: true,\n\t\t\tvScrollbar: true,\n\t\t\tscrollbarClass: 'myScrollbar',\n\t\t\tonScrollMove: function () {\n\t\t\t\thideAllEvents();\n\t\t\t}\n\t\t\t//onScrollEnd: function () {\n\t\t\t//topOffset: pullDownOffset,\n\t\t\t//onRefresh: function () {\n\t\t});*/\n\n\t\t//Y not let them click on the years!\n\t\tjQuery('.event-normal').click(function (e) {\n\t\t\tjQuery(this).addClass('event-normal-bg');\n\t\t\tif (jQuery(this).attr('id') !== 'current-event') {\n\t\t\t\thideAllEvents();\n\t\t\t\tjQuery(this).children().show();\n\t\t\t\tjQuery(this).attr('id', 'current-event');\n\t\t\t} else {\n\t\t\t\t//if is already current stay hidden\n\t\t\t\thideAllEvents();\n\t\t\t}\n\t\t});\n\t\tjQuery('.event-mystery').click(function (e) {\n\t\t\tif (jQuery(this).attr('id') !== 'current-event') {\n\t\t\t\thideAllEvents();\n\t\t\t\tjQuery(this).children().show().css('visibility', 'visible')\n\t\t\t\t\t.children().show().css('visibility', 'visible')\n\t\t\t\t\t.attr('id', 'current-event');\n\t\t\t} else {\n\t\t\t\t//if is already current stay hidden\n\t\t\t\thideAllEvents();\n\t\t\t}\n\t\t});\n\t}","title":""},{"docid":"53e32b146103e0d3f4357a77a702d004","score":"0.59458256","text":"toggleMobileNav(e) {\n e.preventDefault();\n this.props.toggleMobileNav(this.props.canViewMobileNav)\n }","title":""},{"docid":"7bb21d569aee673c96187857cd4f21cd","score":"0.59452724","text":"function handleFocus() {\n bc.ga._trackEvent( \"mobile app\", \"view\", document.title );\n }","title":""},{"docid":"36ca5642e3857783b500500c9ca3f570","score":"0.59341574","text":"function _enterMobile() {\n\t\t\t$scope.$broadcast('enter-mobile');\n\t\t}","title":""},{"docid":"f7c5a3ce1d1ad441a71ff44b7888e6da","score":"0.5925757","text":"function startTapClick(t){var e,n,o=10*-MOUSE_WAIT,i=0,a=!1,r=!1,c=new WeakMap;function s(t){o=Object(_chunk_e7816c0b_js__WEBPACK_IMPORTED_MODULE_0__[\"c\"])(t),E(t)}function d(){clearTimeout(n),n=void 0,e&&(v(!1),e=void 0),a=!0}function u(t){e||r||(a=!1,f(getActivatableTarget(t),t))}function E(t){r||(f(void 0,t),a&&t.cancelable&&t.preventDefault())}function f(t,o){if(!t||t!==e){clearTimeout(n),n=void 0;var i=Object(_chunk_e7816c0b_js__WEBPACK_IMPORTED_MODULE_0__[\"l\"])(o),a=i.x,r=i.y;if(e){if(c.has(e))throw new Error(\"internal error\");e.classList.contains(ACTIVATED)||l(e,a,r),v(!0)}if(t){var s=c.get(t);s&&(clearTimeout(s),c.delete(t)),t.classList.remove(ACTIVATED),n=setTimeout(function(){l(t,a,r),n=void 0},ADD_ACTIVATED_DEFERS)}e=t}}function l(t,e,n){i=Date.now(),t.classList.add(ACTIVATED);var o=getRippleEffect(t);o&&o.addRipple&&o.addRipple(e,n)}function v(t){var n=e;if(n){var o=CLEAR_STATE_DEFERS-Date.now()+i;if(t&&o>0){var a=setTimeout(function(){n.classList.remove(ACTIVATED),c.delete(n)},CLEAR_STATE_DEFERS);c.set(n,a)}else n.classList.remove(ACTIVATED)}}t.body.addEventListener(\"click\",function(t){(a||r)&&(t.preventDefault(),t.stopPropagation())},!0),t.body.addEventListener(\"ionScrollStart\",function(){r=!0,d()}),t.body.addEventListener(\"ionScrollEnd\",function(){r=!1}),t.body.addEventListener(\"ionGestureCaptured\",d),t.addEventListener(\"touchstart\",function(t){o=Object(_chunk_e7816c0b_js__WEBPACK_IMPORTED_MODULE_0__[\"c\"])(t),u(t)},!0),t.addEventListener(\"touchcancel\",s,!0),t.addEventListener(\"touchend\",s,!0),t.addEventListener(\"mousedown\",function(t){var e=Object(_chunk_e7816c0b_js__WEBPACK_IMPORTED_MODULE_0__[\"c\"])(t)-MOUSE_WAIT;o<e&&u(t)},!0),t.addEventListener(\"mouseup\",function(t){var e=Object(_chunk_e7816c0b_js__WEBPACK_IMPORTED_MODULE_0__[\"c\"])(t)-MOUSE_WAIT;o<e&&E(t)},!0)}","title":""},{"docid":"8305c87ee400da7df9789a9a9fd562cd","score":"0.5924296","text":"function touchHandler(ev) {\n //this function will run when the touch events happen\n if (ev.type == \"touchend\") {\n ev.preventDefault();\n var touch = ev.changedTouches[0]; //this is the first object touched\n var newEvt = document.createEvent(\"MouseEvent\");\n newEvt.initMouseEvent(\"click\", true, true, window, 1, touch.screenX, touch.screenY, touch.clientX, touch.clientY);\n //var newEvt = new MouseEvent(\"click\"); //new method\n //REF: https://developer.mozilla.org/en-US/docs/Web/API/MouseEvent.MouseEvent\n ev.currentTarget.dispatchEvent(newEvt);\n //change the touchend event into a click event and dispatch it immediately\n //this will skip the built-in 300ms delay before the click is fired by the browser\n }\n}","title":""},{"docid":"567b00df8cc4d6d9b5898e854026b4ec","score":"0.58738345","text":"function dummyTouchStartHandler(e) {\n}","title":""},{"docid":"2986d00c29c2d3c18c19ab8db195fb62","score":"0.5871501","text":"function mousePressed() {\n // click to unlock phone\n var d = dist(mouseX, mouseY, 840, 900);\n if (d < 100) {\n islockScreen = false;\n ishomeScreen = true;\n }\n \n // click on app icon\n var d1 = dist(mouseX, mouseY, 750, 710);\n if (ishomeScreen && d1 < 100) {\n ishomeScreen = false;\n isappScreen = true;\n }\n \n // click to scan product\n var d2 = dist(mouseX, mouseY, 760, 300);\n if (isappScreen && d2 < 100) {\n isappScreen = false;\n isscanProductScreen = true;\n \n }\n \n var d3 = dist(mouseX, mouseY,815,270);\n if (isscanProductScreen && d3 < 100) {\n isscanProductScreen = false;\n isproduct1Screen = true;\n }\n \n var d4 = dist(mouseX, mouseY,795,600);\n if (isproduct1Screen && d4 < 100) {\n //print(\"click report button\");\n isproduct1Screen = false;\n isreportScreen = true;\n }\n \n var d5 = dist(mouseX, mouseY,790,770);\n if (isreportScreen && d5 < 100) {\n //print(\"click report button\");\n isreportScreen = false;\n isthankyouScreen = true;\n }\n \n var d6 = dist(mouseX, mouseY,790,100);\n if (isthankyouScreen && d6 < 100) {\n //print(\"click report button\");\n isthankyouScreen = false;\n isproduct2Screen = true;\n }\n \n \n \n \n \n}","title":""},{"docid":"e3de382e913f73a0ef6072c6313586ef","score":"0.5869818","text":"handleTechTap_() {\n this.userActive(!this.userActive());\n }","title":""},{"docid":"fc8222789b44f313056700ef5456ed4d","score":"0.58670884","text":"function isMobile() {\n\ttry{ document.createEvent(\"TouchEvent\"); return true; }\n\tcatch(e){ return false; }\n}","title":""},{"docid":"724b51a6540b63b07173bfe20631121e","score":"0.5862267","text":"function isMobile() {\n\t try{ document.createEvent(\"TouchEvent\"); return true; }\n\t catch(e){ return false; }\n\t}","title":""},{"docid":"86c5411b3e429103ab1c89f5eca4d34f","score":"0.58460444","text":"function mobileOpen() {\n navCircle.removeClass(\"navCircleLeft\");\n $(\".redBar\").removeClass(\"navCircleLeft\");\n clearTimeout($(window).data('scrollTimeout'));\n navOpen();\n }","title":""},{"docid":"52d1d2bdc2c6b51e89f03d74d19034ce","score":"0.58369094","text":"function mobileSetUp()\n {\n $('.hiddenMobile').hide();\n $('.viewMobile').show();\n }","title":""},{"docid":"37b8bca33ff05aeaa6c8d3ababb01e24","score":"0.58295876","text":"function loadmobile(){setmobile();window.location.reload()}","title":""},{"docid":"84f9a45c295cbd57b55c39a1742e5055","score":"0.58281934","text":"function onDeviceReady() {\n\t$.mobile.defaultPageTransition = 'none';\n\t$.mobile.defaultDialogTransition = 'none';\n\t$.mobile.buttonMarkup.hoverDelay = 0;\n\t// iOS. BB. Android\n\tdocument.addEventListener(\"offline\", onOffline, false);\n\tdocument.addEventListener(\"online\", onOnline, false);\n\n}","title":""},{"docid":"295afa52d60a5e8c6599e0cd46c465e6","score":"0.5822111","text":"function mobileSetUp()\n {\n \n $('.no-mobile').hide();\n $('.mobile').show();\n }","title":""},{"docid":"bd67ce88007e3f709fa0fe0f743bd956","score":"0.5820651","text":"function fpNavCloseOnClickMobile(){\r\n if(windows.width() < 992) {\r\n $('.fullpage-menu').on('click', 'li a', function(e) {\r\n $('.side-header-toggle').removeClass('toggle-close');\r\n $('.side-menu-overlay').removeClass('overlay-show');\r\n $('.side-header').removeClass('side-menu-open');\r\n });\r\n }\r\n}","title":""},{"docid":"e29191692247d435d507dda0634d6083","score":"0.5818043","text":"clickHandler() {\n if (this.Navigation.mobileState) {\n if (this.open) {\n this.open = false;\n this.button.setAttribute('aria-expanded', false);\n this.element.classList.remove('term-navigation-menu--expanded');\n this.menu.setAttribute('aria-hidden', true);\n } else {\n this.open = true;\n this.button.setAttribute('aria-expanded', true);\n this.element.classList.add('term-navigation-menu--expanded');\n this.menu.setAttribute('aria-hidden', false);\n this.buttonLink.focus();\n }\n }\n }","title":""},{"docid":"9ff71f400a76bb542f5ca76a3d7263d4","score":"0.5816977","text":"function btnBack_OnTouch() {web.Back();}","title":""},{"docid":"a5bc8f911dd515b1a8e40b8df073a6c2","score":"0.5799958","text":"function touchstart(event) {\n // prevents this from running when the sandwich menu button is visible:\n // prevents this from running when we're doing the \"phone\" menu\n if ($('.navbar .toggle-nav-bar').css('display') !== 'none') {\n return false;\n }\n\n if ($(this).closest('.dropdown').hasClass('open')) {\n } else {\n // If it is a touch event, get rid of the click events.\n if (event.type == 'touchstart') {\n $(this).off('click.toggleNav');\n }\n $(this).parent('.dropdown').addClass('open');\n $(this).parent('.dropdown').addClass('open');\n self.openMenu = this;\n event.preventDefault();\n event.stopPropagation();\n }\n }","title":""},{"docid":"fd9dea43022ddfc43cf2600a1b3d5b63","score":"0.5799006","text":"function handleClick() {\n\t\t window.ctaClick();\n\t\t}","title":""},{"docid":"c6454a9d7204b70c92e0a15ba3d46cec","score":"0.57907677","text":"function clickTheGreyBackgroundToCloseMobile() {\n hamburgerAnimation();\n}","title":""},{"docid":"45adfc0883014a1f0d895e8048253c80","score":"0.5782326","text":"function tdAjaxSubCatMegaRunOnTouch(event, jQueryObject) {\r\n if ( (true === tdSubCatMegaRunLink) && (event.target === tdSubCatMegaLastTarget) ) {\r\n window.location = event.target;\r\n } else {\r\n tdSubCatMegaRunLink = true;\r\n tdSubCatMegaLastTarget = event.target;\r\n event.preventDefault();\r\n\r\n setTimeout( function() {\r\n tdSubCatMegaRunLink = false;\r\n }, 300);\r\n\r\n tdAjaxSubCatMegaRun(event, jQueryObject);\r\n }\r\n }","title":""},{"docid":"e5437f1dc87e5baf341005dc2d07b548","score":"0.57641983","text":"function exeMenuPageOpen(){\n //Windows Phone checks.\n\tif($.mobile.path.getLocation(\"x-wmapp0://www/ustadmobile_menuPage2.html\") != \"x-wmapp0://www/ustadmobile_menuPage2.html\"){\n\t\tdebugLog('there is path problem');\n\t}else{\n\t\tdebugLog('everything is OK with paths');\n\t}\n\tdebugLog(\"Ustad Mobile Content: You will go into: exeMenuPage \" + exeMenuPage2);\n //alert(\"userAgent:\" + navigator.userAgent);\n //if( platform == \"android\" ){\n if(navigator.userAgent.indexOf(\"Android\") !== -1){\n var exeMenuLink2 = localStorage.getItem(\"baseURL\") + \"/\" + exeMenuPage2;\n\t debugLog(\"Ustad Mobile Content: ANDROID: You will go into: exeMenuLink \" + exeMenuLink2);\t\n }else if(navigator.userAgent.indexOf(\"Windows Phone OS 8.0\") !== -1){\t//Currently only Windows Phone checks.\n\t var exeMenuLink2 = \"/www/\" + exeMenuPage2;\n debugLog(\"Ustad Mobile Content: WINDOWS PHONE 8: You will go into: exeMenuLink \" + exeMenuLink2);\n }else if(navigator.userAgent.indexOf(\"BB10\") !== -1){\n //Do nothing\n console.log(\"Detected your device platform as: Blackberry 10!\");\n var exeMenuLink2 = localStorage.getItem(\"baseURL\") + \"/\" + exeMenuPage2;\n\t debugLog(\"Ustad Mobile Content: Blackberry 10: You will go into: exeMenuLink \" + exeMenuLink2);\n //alert(\"BB10TEST: Ustad Mobile Content: Blackberry 10: You will go into: exeMenuLink \" + exeMenuLink2);\n }else if(navigator.userAgent.indexOf(\"iPhone OS\") !== -1 ){\n //Do nothing\n console.log(\"Detected your device platform as: iOS!\");\n\t//alert(\"Detected iOS.\");\n var exeMenuLink2 = localStorage.getItem(\"baseURL\") + \"/\" + exeMenuPage2;\n\t debugLog(\"Ustad Mobile Content: iOS: You will go into: exeMenuLink \" + exeMenuLink2);\n\t//alert(\"exeMenuLink: \" + exeMenuLink2);\n }else{\n console.log(\"Unable to detect your device platform. Error.\");\t\n\t//alert(\"Unable to get platform..\");\n }\n $.mobile.changePage( exeMenuLink2, { transition: \"slideup\" } );\n}","title":""},{"docid":"a2f1c827adfb60402e2555afbda0c6c3","score":"0.57560736","text":"function handler_click() {\n\t\t//\tStuff to do on the click\n\t}","title":""},{"docid":"396129d730de26d5a558729f9d9d4f41","score":"0.57545674","text":"_buttonTap() {\n this.dispatchEvent(new CustomEvent(\"click\", { detail: this }));\n }","title":""},{"docid":"6f9ea6767236d077cf6da5c1f1979391","score":"0.5752597","text":"function click(layoutManager){\n return {\n restrict: 'A', \n link: function(scope, element, attrs){\n \n\n element.bind('touchstart click', function(event) {\n\n console.log('clicked');\n \n event.preventDefault();\n event.stopPropagation();\n \n scope.$event = event;\n scope.$apply(attrs['click']);\n\n });\n }\n };\n }","title":""},{"docid":"99d9e5759d2c44b6619be26bb6c0ba64","score":"0.5750859","text":"function iPadseemenu(){\r\n\tif ($(window).width() <= 767) {\r\n $('.see-head').on('click',function(){\r\n if(!$(this).hasClass('selected')){\r\n $(this).addClass('selected');\r\n $('.see-menu').slideDown();\r\n }\r\n else{\r\n $(this).removeClass('selected');\r\n $('.see-menu').slideUp(); \r\n } \r\n }); \r\n\t}\r\n}","title":""},{"docid":"4b517fd8adfde74d10a5c1d478a6ed97","score":"0.57492906","text":"handletouchstart(e) {\n var touch = e.touches[0];\n var mouseEvent = new MouseEvent(\"mousedown\", {\n clientX: touch.clientX,\n clientY: touch.clientY\n })\n this.canvas.dispatchEvent(mouseEvent);\n e.preventDefault();\n }","title":""},{"docid":"84c1a745a614d33d5de1266d728b8b87","score":"0.573138","text":"function doubleTapIni(windowW) {\r\n\t\t$('.touch category-block__list a').doubleTapToGo();\r\n\t\tif (windowW > 767) {\r\n\t\t\t$('.touch ul.navbar-nav > li').each(function () {\r\n\t\t\t\tif ($(this).find('a').hasClass('dropdown-toggle')) {\r\n\t\t\t\t\t$(this).doubleTapToGo()\r\n\t\t\t\t}\r\n\t\t\t})\r\n\t\t}\r\n\t}","title":""},{"docid":"11f7aefa664e3b3d2be543f7e016fb5a","score":"0.5726181","text":"function detectDisengageMobile(event, str)\n {\n if(str === \"touchstart\")\n {\n touch_start_time = Date.now();\n }\n\n\n if(str === \"touchend\")\n {\n let currenttime = Date.now();\n /* touch for 5 second or more */\n if(currenttime - touch_start_time > TOUCH_DISENGAGE_TIME)\n {\n disengageSignalServer();\n }\n\n }\n\n return true;\n }","title":""},{"docid":"d6965c038eb4da27bcf2184bc2547008","score":"0.5722948","text":"click_event(){\n const card = this.card;\n deck.element.addEventListener('click', function handler(event){\n if(event.target && event.target.matches('.card:not(.open)')){\n card.open(event.target);\n }\n // mobile\n else if (event.target && event.target.matches('I.fa') && event.target.parentElement.matches('.card:not(.open)')){\n card.open(event.target.parentElement);\n }\n },false);\n }","title":""},{"docid":"5ca4dfca4671f2b9e593238c91983ff0","score":"0.5721627","text":"_onBannerItemClicked(adjURL: string) {\n this.props.navigator.push({ name: 'WebPage',url: adjURL });\n }","title":""},{"docid":"60a53c6d35e91c929743651c2d865f28","score":"0.57209605","text":"tapEventOn(e) {\n if (typeof this.hoverClass !== typeof undefined && !this.disabled) {\n // break class into array\n var classes = this.hoverClass.split(\" \");\n // run through each and add or remove classes\n classes.forEach((item, index) => {\n if (item != \"\") {\n this.shadowRoot.querySelector(\"#button\").classList.add(item);\n if (item.indexOf(\"-\") != -1) {\n this.shadowRoot.querySelector(\"#icon\").classList.add(item);\n }\n }\n });\n }\n }","title":""},{"docid":"566776465cdf66fcd632e8999b4b600b","score":"0.5720453","text":"handleProductLongPressRelease() {\n if (isMobile)\n clearTimeout(this.productPressTimer);\n }","title":""},{"docid":"0147bb6aac2a5169f9086492e5048fd1","score":"0.5713222","text":"function triggerTicketMachine()\n{\n\t// Once an event has completed, the mobile device calls this funtion to trigger the ticket machine.\n\t// Android ticket machine is native (so doesn't need to use this callback)\n\tif(deviceType == 'ios'){\n\t\t//console.log('triggerTicketMachine');\n\t\tshowTicketMachine();\n\t}\n}","title":""},{"docid":"807ff55bb93857a40f36aa218e0005b7","score":"0.5711519","text":"function handleIconInteraction() {\n if (icon.dataset.open == dataOpen) {\n closeMobileMenu();\n } else {\n openMobileMenu();\n }\n }","title":""},{"docid":"f473d44f4aa09f842c0b246d2f26a763","score":"0.5707521","text":"function touchNav() {\r\n $(\"#work-carousel-mobile\").on(\"swipeleft\", function () {\r\n $(\".right.carousel-control\").trigger(\"click\");\r\n });\r\n $(\"#work-carousel-mobile\").on(\"swiperight\", function () {\r\n $(\".left.carousel-control\").trigger(\"click\");\r\n });\r\n }","title":""},{"docid":"0aabdb84b03d960bb0c1bfc78eccd1a8","score":"0.5697396","text":"function Local__clickHandler(e) {\n\tif (e.button !== 0) { return; } // handle left-click only\n\tvar request = local.util.extractRequest.fromAnchor(e.target);\n\tif (request && ['_top','_blank'].indexOf(request.target) !== -1) { return; }\n\tif (request) {\n\t\te.preventDefault();\n\t\te.stopPropagation();\n\t\tlocal.util.dispatchRequestEvent(e.target, request);\n\t\treturn false;\n\t}\n}","title":""},{"docid":"1d5600f7f2cd152c136338f10d2cd0cb","score":"0.5697365","text":"fireClick() {}","title":""},{"docid":"981d90d81fe7308a7a283a2fef2e1e36","score":"0.5692574","text":"function collegeMiddleMobileMenuClicked(){\n\t/* This is only used for Medium and smaller devices. So only allow the\n\t * below code to run when window width is medium or smaller (< 64.063em)\n\t */\n\tvar width = $(window).width() / parseFloat($(\"body\").css(\"font-size\"));\n\tif( width < 64.063 ){\n\t\tvar elem = $('.dropDownCollegeMenu');\n\t\tif (elem.hasClass('active')) {\n\t\t\telem.slideUp( 250,'easeInOutExpo', function (){\n\t\t\t\t$(this).css('display', '').removeClass('active');\n\t\t\t});\n\t\t} else {\n\t\t\telem.slideDown(250, 'easeInOutExpo', function() {\n\t\t\t\t$(this).addClass('active');\n\t\t\t});\n\t\t};\n\t}\n}","title":""},{"docid":"66cfd4edc783eeeda360c3ad2d330614","score":"0.56887734","text":"function mic_click_handler(e) {\n\tstates.mic_on = !(states.mic_on);\n\tif (states.mic_on) {\n\t\tuserStartAudio().then(function() {\n\t\t\tmic.start();\n\t\t\tmic_fft.setInput(mic);\n\t\t});\n\t\tthis.style.opacity = \"1\";\n\t}\n\telse {\n\t\tmic.stop();\n\t\tthis.style.opacity = \".6\";\n\t}\n}","title":""},{"docid":"afdf06846e1e2f3a0fd4e6bb9c899edf","score":"0.56835926","text":"function clickItbackMessageType() {\n showMessagingtest();\n}","title":""},{"docid":"a771166604dd792fadf7dc445a4e74f2","score":"0.5680112","text":"handleClick(e) {\n\t\tconst id = $(e.currentTarget).attr('href');\n\n\t\tVeams.Vent.trigger(Veams.EVENTS.navigation.clicked, id);\n\t\te.preventDefault();\n\t}","title":""},{"docid":"391fd62e77baf908c8022c5529ea6649","score":"0.56696445","text":"function preventClickSpam() {\n $('.card').off('click');\n $('.card').off('tap');\n window.setTimeout(() => {\n $('.card').click(toggleCardOpenClose);\n $('.card').on('tap', toggleCardOpenClose);\n }, 500); // Value corresponds to .card-exterior \"transition\" attribute.\n}","title":""},{"docid":"08098f430618ae274708852d7acbd50f","score":"0.56611055","text":"function toggleMobileNav(event) {\n\t\tevent.preventDefault();\n\t\tevent.stopPropagation();\n\t\t\n\t\t$('body').toggleClass('mobile-nav--is-open');\n\t\twindow.scrollTo(0,0);\n\t}","title":""},{"docid":"81fdb430f994cbb22681d0b9430edcf9","score":"0.5655625","text":"function clickHandler() {\n audioContext.resume();\n document.body.removeEventListener(\"click\", clickHandler);\n document.body.removeEventListener(\"touchend\", clickHandler);\n }","title":""},{"docid":"3bcf1a6f2e664d23caa3b133288fd356","score":"0.5654505","text":"function showCitationOnClick($) {\n $('.citation-num.citation-num-mobile').each(function() {\n touchClick($(this), () => {\n $(this).next().addClass('fadeIn').slideToggle(200);\n })\n });\n}","title":""},{"docid":"997beb087fa12b4aadb66bf8bf0dbf87","score":"0.56465274","text":"function touchHandler(event) {\n var touch = event.changedTouches[0];\n\n var simulatedEvent = document.createEvent(\"MouseEvent\");\n simulatedEvent.initMouseEvent({\n touchstart: \"mousedown\",\n touchmove: \"mousemove\",\n touchend: \"mouseup\"\n }[event.type], true, true, window, 1,\n touch.screenX, touch.screenY,\n touch.clientX, touch.clientY, false,\n false, false, false, 0, null);\n\n touch.target.dispatchEvent(simulatedEvent);\n // Clicks should continue to work\n if( event.type === \"touchmove\" ) event.preventDefault();\n}","title":""},{"docid":"a7e9fb67812c07066f882116f2f1430f","score":"0.56389457","text":"function checkMobileMode() {\n var width = $(window).width();\n if (width > 1000) {\n turnOffAllTaskFunctionality();\n\n makeDraggableAndDroppable();\n clickResize();\n $(\".draggableTask p:last-child\").mousedown(function (event) {\n $(this).focus();\n });\n }\n else {\n turnOffAllTaskFunctionality();\n\n $(\".task\").click(function () {\n var data = { id: $(this).attr(\"id\") };\n makeDialog(\"/Task/GetTaskDetails_Ajax\", data);\n })\n }\n}","title":""},{"docid":"7d3a7313f6ea9e5237929ab167b13089","score":"0.5636837","text":"function checkForMobile() {\n if (_currentViewPortSize.width <= _tabletBreakWidth || _browserInfo.mobile.any()) {\n switchToMobileView();\n } else if (_currentViewPortSize.width > _tabletBreakWidth) {\n switchToDesktopView();\n }\n }","title":""},{"docid":"39b8b5f748e830fbafaa06f76be9a4ab","score":"0.5634701","text":"function onSocialClick(snName) {\n Analytics.trackEvent('web', 'main-social-click', snName);\n }","title":""},{"docid":"60439ad96f6637c803dbb8985c853ea8","score":"0.5634074","text":"function contentItemTap() {\n\n\t\tif (!isMenuOpen) {\n\t\t\t\n // Change the current screen\n App.navigate($(this).attr(\"href\"));\n\t\t\n } else {\n \n // If the menu is open, close it\n\t\t\tcloseMenu();\n\n }\n\t\treturn false;\n\t}","title":""},{"docid":"8dd36367f00834f413313bde57ca12ce","score":"0.56199014","text":"function openMobileMenu(){\n if (breakPoint == 'xx' || breakPoint == 'xs' || breakPoint == 'sm') {\n $('.hamburger').attr('data-toggle', 'collapse');\n $('.hamburger').attr('aria-expanded', 'true');\n $('.hamburger').attr('data-target', '#mobile-wrap');\n $('.hamburger').addClass('collapsed');\n $('.mobile-wrap').addClass('collapse');\n\n } else {\n\n $('.hamburger').removeAttr('data-toggle', 'collapse');\n $('.hamburger').removeAttr('aria-expanded', 'true');\n $('.hamburger').removeAttr('data-target', '#mobile-wrap');\n $('.hamburger').removeClass('collapsed');\n $('.mobile-wrap').removeClass('collapse');\n }\n }","title":""},{"docid":"1eb64bf0d09f42490e25e2ec737139eb","score":"0.56099147","text":"function clicktag_Click(e) {\n if (dcSelect) {\n Enabler.exit(\"Exit Click\");\n // Enabler.exitOverride(\"Exit Click\", \"https://www.google.com\");\n Enabler.counter(\"Counter Click\");\n } else {\n window.open(window.clickTag);\n }\n}","title":""},{"docid":"1eb64bf0d09f42490e25e2ec737139eb","score":"0.56099147","text":"function clicktag_Click(e) {\n if (dcSelect) {\n Enabler.exit(\"Exit Click\");\n // Enabler.exitOverride(\"Exit Click\", \"https://www.google.com\");\n Enabler.counter(\"Counter Click\");\n } else {\n window.open(window.clickTag);\n }\n}","title":""},{"docid":"5081728542f53c62dc9b0faa22f3a5d1","score":"0.5608519","text":"function FastClick(a,b){function c(a,b){return function(){return a.apply(b,arguments)}}var d;b=b||{};this.trackingClick=!1;this.trackingClickStart=0;this.targetElement=null;this.lastTouchIdentifier=this.touchStartY=this.touchStartX=0;this.touchBoundary=b.touchBoundary||10;this.layer=a;this.tapDelay=b.tapDelay||200;if(!FastClick.notNeeded(a)){for(var g=\"onMouse onClick onTouchStart onTouchMove onTouchEnd onTouchCancel\".split(\" \"),f=0,h=g.length;f<h;f++)this[g[f]]=c(this[g[f]],this);deviceIsAndroid&&\n(a.addEventListener(\"mouseover\",this.onMouse,!0),a.addEventListener(\"mousedown\",this.onMouse,!0),a.addEventListener(\"mouseup\",this.onMouse,!0));a.addEventListener(\"click\",this.onClick,!0);a.addEventListener(\"touchstart\",this.onTouchStart,!1);a.addEventListener(\"touchmove\",this.onTouchMove,!1);a.addEventListener(\"touchend\",this.onTouchEnd,!1);a.addEventListener(\"touchcancel\",this.onTouchCancel,!1);Event.prototype.stopImmediatePropagation||(a.removeEventListener=function(b,c,d){var e=Node.prototype.removeEventListener;\n\"click\"===b?e.call(a,b,c.hijacked||c,d):e.call(a,b,c,d)},a.addEventListener=function(b,c,d){var e=Node.prototype.addEventListener;\"click\"===b?e.call(a,b,c.hijacked||(c.hijacked=function(a){a.propagationStopped||c(a)}),d):e.call(a,b,c,d)});\"function\"===typeof a.onclick&&(d=a.onclick,a.addEventListener(\"click\",function(a){d(a)},!1),a.onclick=null)}}","title":""},{"docid":"5033e7a48fe4f142a577a1fe9c38e69f","score":"0.5606225","text":"function openCardPhone(e) {\n if (!isCardOpen) { cardTogglePhone(e); } else { cardTogglePhone(null); }\n }","title":""},{"docid":"10dc22b6a0629abed46fb33cf328bc69","score":"0.55988795","text":"onShortClick() { }","title":""},{"docid":"e6b154cbe9a3fabe65a7886c83de918a","score":"0.55959994","text":"function returnFromMobile() {\n if (document.body.clientWidth >= 480) {\n var down = document.body.querySelector(\".down\");\n var downMenu = document.body.querySelector(\".down__menu\");\n var parent = downMenu.parentElement;\n var social = document.body.querySelectorAll(\".social\");\n var end = document.body.querySelectorAll(\".social-around\");\n downMenu.parentElement.removeChild(downMenu);\n down.appendChild(downMenu);\n var linksRight = document.body.querySelector(\".links .right\");\n linksRight.appendChild(social[0]);\n linksRight.appendChild(social[1]);\n down.removeChild(down.firstElementChild);\n \n }\n}","title":""},{"docid":"4ec4b503e65a49351ed854cc6e1a961d","score":"0.559447","text":"function touchHandler(event) {\r\n var touch = event.changedTouches[0];\r\n\r\n var simulatedEvent = document.createEvent(\"MouseEvent\");\r\n simulatedEvent.initMouseEvent({\r\n touchstart: \"mousedown\",\r\n touchmove: \"mousemove\",\r\n touchend: \"mouseup\"\r\n }[event.type], true, true, window, 1,\r\n touch.screenX, touch.screenY,\r\n touch.clientX, touch.clientY, false,\r\n false, false, false, 0, null);\r\n\r\n touch.target.dispatchEvent(simulatedEvent);\r\n event.preventDefault();\r\n \r\n}","title":""},{"docid":"29f2de62259d13578d9da2e2ef8a4d64","score":"0.5592888","text":"function dropdownHandlerMobile(e) {\n\te.stopPropagation();\n\te.preventDefault();\n\n\tvar mobileMenu = this.nextElementSibling;\n\tvar downCarat = this.childNodes[1];\n\n\tmobileMenu.classList.toggle('show');\n\tdownCarat.classList.toggle('active');\n\n\thideMenuHandler(mobileMenu.id);\n}","title":""},{"docid":"092c39abd955aefd9b0ef571040e2e3c","score":"0.55926293","text":"function deviceChecker() {\n var eventHandler = \"\"\n //check if device is mobile or desktop --> Needs testing dont think itll work consistantly \n if (/Android|webOS|iPhone|iPad|iPod|BlackBerry/i.test(navigator.userAgent)) {\n //mobile \n // isMobile = true;\n console.log('mobile device')\n //click for mobile\n eventHandler = \"click\";\n //click ooption on for mobile\n $('.panel').click(dropDownHandler);\n } else {\n //desktop \n console.log('desktop')\n //hover for desktop\n eventHandler = \"mouseover\";\n //hover option on for desktop\n $('.panel').hover(dropDownHandler, exitHoverCallBack);\n }\n //make the panel open when page loads \n $(\".panel:eq(0)\").trigger(eventHandler);\n}","title":""},{"docid":"0ac6c7bc6d5f26bb4e18b5771c86ba04","score":"0.558345","text":"function clickButton() {\n }","title":""},{"docid":"ca9e427982972f6c55c712638ec592f6","score":"0.55779415","text":"function setupMobileTabs() {\r\n tabContentMobile.hide();\r\n tabMobile.click(function() {\r\n $f(this).toggleClass('selected').next().slideToggle();\r\n });\r\n tabMobile.eq(0).click();\r\n }","title":""},{"docid":"c72c7b4ea7cbe7374553456a149926ae","score":"0.55694604","text":"function ao(){\r\n var aK,aJ,aM,aL,aN,s=false;\r\n am.unbind(\"touchstart.jsp touchmove.jsp touchend.jsp click.jsp-touchclick\").bind(\"touchstart.jsp\",function(aO){\r\n var aP=aO.originalEvent.touches[0];\r\n aK=aD();\r\n aJ=aB();\r\n aM=aP.pageX;\r\n aL=aP.pageY;\r\n aN=false;\r\n s=true\r\n })\r\n .bind(\"touchmove.jsp\",function(aR){\r\n if(!s){\r\n return\r\n }\r\n var aQ=aR.originalEvent.touches[0],aP=aa,aO=I;\r\n Q.scrollTo(aK+aM-aQ.pageX,aJ+aL-aQ.pageY);\r\n aN=aN||Math.abs(aM-aQ.pageX)>5||Math.abs(aL-aQ.pageY)>5;\r\n/* Returning true of no movement so rest of the screen can scroll */ \r\n return aP==aa&&aO==I\r\n })\r\n .bind(\"touchend.jsp\",function(aO){\r\n s=false\r\n })\r\n .bind(\"click.jsp-touchclick\",function(aO){\r\n if(aN){\r\n aN=false;\r\n return false\r\n }\r\n })\r\n }","title":""},{"docid":"281cef91a1fd41ba18e7dbd159e831b2","score":"0.5568188","text":"function checkMobile() { return /iPhone|iPad|iPod|Android/i.test(navigator.userAgent); }","title":""},{"docid":"012ddbf06425bc4fd22bbca4ee11a222","score":"0.555924","text":"function desktopSetUp()\n {\n $('.hiddenMobile').show();\n $('.viewMobile').hide();\n }","title":""},{"docid":"52f9b56b2f1f7e8bd6f4f41be606c028","score":"0.5559024","text":"function viewportGo_l() {\n\tundropclick();\n}","title":""},{"docid":"7c68985a94cbd8b18cb6efd494aa984c","score":"0.55485904","text":"onVRClick(event) {\n this.dispatchEvent({ type: \"click\" });\n }","title":""},{"docid":"7ba7a79d72c3de761ae35447dcbbc2d0","score":"0.55451727","text":"function burgerIconClick() {\n $(BURGER_BTN).on('click', e => {\n e.preventDefault();\n toggleMobileMenu();\n });\n}","title":""},{"docid":"45390be3a1e91e911967611e4e6dbafa","score":"0.554504","text":"function clickable() { ; }","title":""},{"docid":"09733752b89ead40b6bac0e9b896af48","score":"0.5545003","text":"function openSectionBindClick($selector, $target, $targetMobile)\n {\n $(\"#\"+$selector).click(function()\n {\n if(_isMobile)\n {\n $('#'+$targetMobile).slideToggle( \"slow\", function() \n {\n checkBoxVisibility();\n });\n }else\n {\n $('#'+$target).slideToggle( \"slow\", function() \n {\n checkBoxVisibility();\n });\n }\n });\n }","title":""},{"docid":"0f763157d62f93d4b98cf6775bfe82a0","score":"0.554456","text":"handleTechTouchMove_() {\n if (this.userWasActive) {\n this.reportUserActivity();\n }\n }","title":""},{"docid":"e2830816acdd8fb86e6e57a1ef33fd30","score":"0.55387014","text":"onMobileModeChanged(inMobileMode) {\n }","title":""},{"docid":"2f4ecc2e74aa99e8c1979fcdce18e388","score":"0.553794","text":"function FastClick(t,e){\"use strict\";function i(t,e){return function(){return t.apply(e,arguments)}}var n;if(e=e||{},this.trackingClick=!1,this.trackingClickStart=0,this.targetElement=null,this.touchStartX=0,this.touchStartY=0,this.lastTouchIdentifier=0,this.touchBoundary=e.touchBoundary||10,this.layer=t,this.tapDelay=e.tapDelay||200,!FastClick.notNeeded(t)){for(var o=[\"onMouse\",\"onClick\",\"onTouchStart\",\"onTouchMove\",\"onTouchEnd\",\"onTouchCancel\"],s=this,r=0,c=o.length;c>r;r++)s[o[r]]=i(s[o[r]],s);deviceIsAndroid&&(t.addEventListener(\"mouseover\",this.onMouse,!0),t.addEventListener(\"mousedown\",this.onMouse,!0),t.addEventListener(\"mouseup\",this.onMouse,!0)),t.addEventListener(\"click\",this.onClick,!0),t.addEventListener(\"touchstart\",this.onTouchStart,!1),t.addEventListener(\"touchmove\",this.onTouchMove,!1),t.addEventListener(\"touchend\",this.onTouchEnd,!1),t.addEventListener(\"touchcancel\",this.onTouchCancel,!1),Event.prototype.stopImmediatePropagation||(t.removeEventListener=function(e,i,n){var o=Node.prototype.removeEventListener;\"click\"===e?o.call(t,e,i.hijacked||i,n):o.call(t,e,i,n)},t.addEventListener=function(e,i,n){var o=Node.prototype.addEventListener;\"click\"===e?o.call(t,e,i.hijacked||(i.hijacked=function(t){t.propagationStopped||i(t)}),n):o.call(t,e,i,n)}),\"function\"==typeof t.onclick&&(n=t.onclick,t.addEventListener(\"click\",function(t){n(t)},!1),t.onclick=null)}}","title":""},{"docid":"d2efa36567f8ca2e7e7f5daba5439d86","score":"0.5532519","text":"function customLinkClickHandler() {\n var target;\n if (target = getTargetAttribute(this)) {\n if (target == 'stop') {\n option[13]/*auto*/ = FALSE;\n stopAuto();\n } else if (target == \"start\") {\n startAuto();\n option[13]/*auto*/ = TRUE;\n } else if (target == 'block') {\n clickable = FALSE;\n } else if (target == 'unblock') {\n clickable = TRUE;\n } else {\n enqueueAnimation((target == parseInt10(target)) ? target - 1 : target, TRUE);\n }\n }\n return FALSE;\n }","title":""},{"docid":"e6af8250337a6dc07617bbb9cf0020cc","score":"0.55304444","text":"function _exitMobile() {\n\t\t\t$scope.$broadcast('exit-mobile');\n\t\t}","title":""},{"docid":"9c4130614d1f100ca241ced3f50cd50b","score":"0.55257833","text":"function mobileMenuShiftAwayLink() {\n const elementMenuMobileLink = document.getElementsByClassName(\"menu_mobile_link\");\n for (let i = 0; i < elementMenuMobileLink.length; i++) {\n elementMenuMobileLink[i].addEventListener(\"click\", function() {\n document.getElementById(\"animation_mobile_menu\").style.display = \"none\";\n document.getElementById(\"div_mobile_menu\").style.display = \"none\";\n document.getElementById(\"nav_mobile_menu\").style.display = \"block\";\n document.getElementById(\"nav_mobile_menu\").addEventListener(\"click\", mobileMenuPopUp);\n document.getElementById(\"div_mobile_menu\").style.opacity = 0;\n });\n }\n }","title":""},{"docid":"424fce98e06e0335276d73515be3a705","score":"0.5523683","text":"function hb_is_mobile(){\n\tif( /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(navigator.userAgent) ) {\n\t\t$body.addClass('mobile mobile-device');\n\t}\n}","title":""},{"docid":"7f716e911e8b0b9292ed656930b6deba","score":"0.5503497","text":"function handleClick () {\n\t}","title":""},{"docid":"2cdb7e455c58293e153ad13b3122d77e","score":"0.550324","text":"function mobileToggle(e) {\n\t\t\tif ($(e).hasClass(\"active\") == true) {\n\t\t\t\t$(e).animate({maxHeight: \"70px\"}, 300).removeClass(\"active\");\n\t\t\t} else {\n\t\t\t\t$(e).animate({maxHeight: \"100vh\"}, 300).addClass(\"active\");\n\t\t\t}\n\t\t}","title":""},{"docid":"199823edf0db66a57f88b77a09a42e3a","score":"0.5495514","text":"function h(){var e=window.navigator.userAgent;return(-1===e.indexOf(\"Android 2.\")&&-1===e.indexOf(\"Android 4.0\")||-1===e.indexOf(\"Mobile Safari\")||-1!==e.indexOf(\"Chrome\")||-1!==e.indexOf(\"Windows Phone\"))&&(window.history&&\"pushState\"in window.history)}","title":""},{"docid":"a31b5a70432a7ea15988624eb6d8e60b","score":"0.5483041","text":"function handleHireClick(e) {\n\tlocation.href = \"\";\n}","title":""}],"string":"[\n {\n \"docid\": \"601b36ab5035fb431fa9cd9e7eb32c86\",\n \"score\": \"0.682185\",\n \"text\": \"function mmm_mobile_double_tap_to_go () {\\r\\n\\t\\t\\tfunction_selector = '#mega_main_menu li:has(.mega_dropdown) > .item_link, #mega_main_menu li:has(.post_details) > .processed_image';\\r\\n\\t\\t\\tjQuery( function_selector ).unbind();\\r\\n\\t\\t\\tif( /iphone|ipad|ipod|android|webos|blackberry|iemobile|opera mini/i.test( navigator.userAgent.toLowerCase() ) ) \\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tvar clicked_item = false;\\r\\n\\t\\t\\t\\tjQuery( function_selector ).on( 'click', function( index )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif ( clicked_item != this) {\\r\\n\\t\\t\\t\\t\\t\\tindex.preventDefault();\\r\\n\\t\\t\\t\\t\\t\\tif ( jQuery( this ).parent().parent().parent().hasClass('keep_open') ) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t\\tjQuery( '#mega_main_menu .keep_open' ).removeClass('keep_open');\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\tjQuery( this ).parent().addClass('keep_open');\\r\\n\\t\\t\\t\\t\\t\\tclicked_item = this;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t});\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"314e42c1062666bbd066c0573385434e\",\n \"score\": \"0.6660941\",\n \"text\": \"fixMobileMouseHandling() {\\n new FastClick(document.body);\\n window.addEventListener(\\\"touchstart\\\", \\n (event) => {\\n if(event.touches.length > 1) {\\n //the event is multi-touch\\n //you can then prevent the behavior\\n event.preventDefault();\\n }\\n },{ passive : false});\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ba9b2813dc11128f862ff1c13b67fb7\",\n \"score\": \"0.6437528\",\n \"text\": \"function mobileMenuBtnClick() {\\n $($menuMobileBtn).click(function () {\\n $(this).toggleClass($showClass);\\n $($menuMain).toggleClass($showClass);\\n $('body').toggleClass('jsa-body-lock');\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d43ec7a4863ff459379335d3dc2fd6b9\",\n \"score\": \"0.6416783\",\n \"text\": \"function handleClick(){\\n if(isMobile){\\n props.history.push(\\\"/dashboard/userId=\\\"+firebase.getCurrentUserId()+\\\"/goals/\\\"+goal.category+\\\"/goalId=\\\"+goal.id)\\n }\\n console.log(\\\"Click\\\")\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"878c0af731e2d4b0b75162d3440da930\",\n \"score\": \"0.63476425\",\n \"text\": \"onMobileToggleClick(e) {\\n e.preventDefault();\\n this.dom.links.classList.toggle('open');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72dbdb78bc20baacab6349ad6fe50f28\",\n \"score\": \"0.6310012\",\n \"text\": \"switch_to_mobile () {\\n // click mobile version button\\n cy.get(\\\".header__line--top .icon-mobile\\\", { timeout: 15000 })\\n //.first()\\n .click({ force: true });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f74904dc6c4c7bb68c834de91b779e3\",\n \"score\": \"0.6309403\",\n \"text\": \"function OnClick () {\\t\\t\\n\\t\\tfingering.OnClick();\\n\\t\\tnote.OnClick();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5069da0eda035efac35f9c6335fafdf\",\n \"score\": \"0.62545425\",\n \"text\": \"function receivePush(e) { \\nconsole.log(\\\"receivePush\\\");\\nconsole.log(e);\\n\\tvar extra = (OS_IOS)?e.data.extra:e.extra;\\n\\tvar target = (OS_IOS)?e.data.target:e.target;\\n\\t \\n\\tTi.App.fireEvent('app:goToAds', {target: target, extra: extra});\\n\\tTi.App.fireEvent('refresh_notification');\\n\\treturn false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97b26fdecf9ee873ac0906b660f098fd\",\n \"score\": \"0.6253619\",\n \"text\": \"function changePageOnTouch(num) {\\n if( mobileDevice.isAny() ) {\\n //alert(\\\"is mobile device\\\");\\n changepage(num);\\n return false;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5aeb3276f6b6c851c2373fd08f4e1479\",\n \"score\": \"0.6211651\",\n \"text\": \"function hyperlinkPhone(){\\n\\t $(\\\"a[href^='tel:']\\\").click(function(){\\n\\t \\tif( !$(\\\"body\\\").hasClass(\\\"mobile\\\") ) return false;\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40fa5e6128a85b95cde17ae5bbae15d7\",\n \"score\": \"0.6107772\",\n \"text\": \"function isMobile() {\\n try{ document.createEvent(\\\"TouchEvent\\\"); return true; }\\n catch(e){ return false; }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40fa5e6128a85b95cde17ae5bbae15d7\",\n \"score\": \"0.6107772\",\n \"text\": \"function isMobile() {\\n try{ document.createEvent(\\\"TouchEvent\\\"); return true; }\\n catch(e){ return false; }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9edc2dd30b177ac7bc29f66de5a3b4ef\",\n \"score\": \"0.60983336\",\n \"text\": \"function checkMobile() {\\n try {\\n document.createEvent(\\\"TouchEvent\\\");\\n return true;\\n } catch (e) {\\n return false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dfd4ff08b9d401195d6c57d02c3e0c6\",\n \"score\": \"0.6077894\",\n \"text\": \"mobileTabClick(event) {\\n const {tab} = event.target.dataset;\\n this.showTab(tab);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58ad59c09ec33627becd5bd81edaa367\",\n \"score\": \"0.6058387\",\n \"text\": \"function onSupportClick() {\\n Analytics.trackEvent('web', 'main-support-click');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"870ca91c69fc1c3b8fb6969e31db13a3\",\n \"score\": \"0.6024742\",\n \"text\": \"function imgClick() {\\n alert(\\\"Thanks For purchasing This World Class Mobile Phone\\\")\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cf735ec1df6293711e69e8efe110e21\",\n \"score\": \"0.6009585\",\n \"text\": \"_onTouchstart(event) {\\n // Prevent the click event\\n event.preventDefault()\\n\\n this.cancelNextClick = true\\n this.trigger('OffCanvasMenuButton:click')\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"406ac4a71c537bab44df765ec301d61b\",\n \"score\": \"0.5996544\",\n \"text\": \"function mobileUi() {\\n\\t\\tjQuery('body').addClass('mobile');\\n\\t\\t// jQuery('#wrap-move-zones').remove();\\n\\t\\tjQuery('#wrap-move-zones .move-fast').remove();\\n\\t\\t//iScroll plugin\\n\\t\\t/*var myScroll;\\n\\t\\tmyScroll = new iScroll('menu_holder', {\\n\\t\\t\\thScroll: false,\\n\\t\\t\\thScrollbar: true,\\n\\t\\t\\tvScrollbar: true,\\n\\t\\t\\tscrollbarClass: 'myScrollbar',\\n\\t\\t\\tonScrollMove: function () {\\n\\t\\t\\t\\thideAllEvents();\\n\\t\\t\\t}\\n\\t\\t\\t//onScrollEnd: function () {\\n\\t\\t\\t//topOffset: pullDownOffset,\\n\\t\\t\\t//onRefresh: function () {\\n\\t\\t});*/\\n\\n\\t\\t//Y not let them click on the years!\\n\\t\\tjQuery('.event-normal').click(function (e) {\\n\\t\\t\\tjQuery(this).addClass('event-normal-bg');\\n\\t\\t\\tif (jQuery(this).attr('id') !== 'current-event') {\\n\\t\\t\\t\\thideAllEvents();\\n\\t\\t\\t\\tjQuery(this).children().show();\\n\\t\\t\\t\\tjQuery(this).attr('id', 'current-event');\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t//if is already current stay hidden\\n\\t\\t\\t\\thideAllEvents();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tjQuery('.event-mystery').click(function (e) {\\n\\t\\t\\tif (jQuery(this).attr('id') !== 'current-event') {\\n\\t\\t\\t\\thideAllEvents();\\n\\t\\t\\t\\tjQuery(this).children().show().css('visibility', 'visible')\\n\\t\\t\\t\\t\\t.children().show().css('visibility', 'visible')\\n\\t\\t\\t\\t\\t.attr('id', 'current-event');\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t//if is already current stay hidden\\n\\t\\t\\t\\thideAllEvents();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53e32b146103e0d3f4357a77a702d004\",\n \"score\": \"0.59458256\",\n \"text\": \"toggleMobileNav(e) {\\n e.preventDefault();\\n this.props.toggleMobileNav(this.props.canViewMobileNav)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bb21d569aee673c96187857cd4f21cd\",\n \"score\": \"0.59452724\",\n \"text\": \"function handleFocus() {\\n bc.ga._trackEvent( \\\"mobile app\\\", \\\"view\\\", document.title );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36ca5642e3857783b500500c9ca3f570\",\n \"score\": \"0.59341574\",\n \"text\": \"function _enterMobile() {\\n\\t\\t\\t$scope.$broadcast('enter-mobile');\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7c5a3ce1d1ad441a71ff44b7888e6da\",\n \"score\": \"0.5925757\",\n \"text\": \"function startTapClick(t){var e,n,o=10*-MOUSE_WAIT,i=0,a=!1,r=!1,c=new WeakMap;function s(t){o=Object(_chunk_e7816c0b_js__WEBPACK_IMPORTED_MODULE_0__[\\\"c\\\"])(t),E(t)}function d(){clearTimeout(n),n=void 0,e&&(v(!1),e=void 0),a=!0}function u(t){e||r||(a=!1,f(getActivatableTarget(t),t))}function E(t){r||(f(void 0,t),a&&t.cancelable&&t.preventDefault())}function f(t,o){if(!t||t!==e){clearTimeout(n),n=void 0;var i=Object(_chunk_e7816c0b_js__WEBPACK_IMPORTED_MODULE_0__[\\\"l\\\"])(o),a=i.x,r=i.y;if(e){if(c.has(e))throw new Error(\\\"internal error\\\");e.classList.contains(ACTIVATED)||l(e,a,r),v(!0)}if(t){var s=c.get(t);s&&(clearTimeout(s),c.delete(t)),t.classList.remove(ACTIVATED),n=setTimeout(function(){l(t,a,r),n=void 0},ADD_ACTIVATED_DEFERS)}e=t}}function l(t,e,n){i=Date.now(),t.classList.add(ACTIVATED);var o=getRippleEffect(t);o&&o.addRipple&&o.addRipple(e,n)}function v(t){var n=e;if(n){var o=CLEAR_STATE_DEFERS-Date.now()+i;if(t&&o>0){var a=setTimeout(function(){n.classList.remove(ACTIVATED),c.delete(n)},CLEAR_STATE_DEFERS);c.set(n,a)}else n.classList.remove(ACTIVATED)}}t.body.addEventListener(\\\"click\\\",function(t){(a||r)&&(t.preventDefault(),t.stopPropagation())},!0),t.body.addEventListener(\\\"ionScrollStart\\\",function(){r=!0,d()}),t.body.addEventListener(\\\"ionScrollEnd\\\",function(){r=!1}),t.body.addEventListener(\\\"ionGestureCaptured\\\",d),t.addEventListener(\\\"touchstart\\\",function(t){o=Object(_chunk_e7816c0b_js__WEBPACK_IMPORTED_MODULE_0__[\\\"c\\\"])(t),u(t)},!0),t.addEventListener(\\\"touchcancel\\\",s,!0),t.addEventListener(\\\"touchend\\\",s,!0),t.addEventListener(\\\"mousedown\\\",function(t){var e=Object(_chunk_e7816c0b_js__WEBPACK_IMPORTED_MODULE_0__[\\\"c\\\"])(t)-MOUSE_WAIT;o<e&&u(t)},!0),t.addEventListener(\\\"mouseup\\\",function(t){var e=Object(_chunk_e7816c0b_js__WEBPACK_IMPORTED_MODULE_0__[\\\"c\\\"])(t)-MOUSE_WAIT;o<e&&E(t)},!0)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8305c87ee400da7df9789a9a9fd562cd\",\n \"score\": \"0.5924296\",\n \"text\": \"function touchHandler(ev) {\\n //this function will run when the touch events happen\\n if (ev.type == \\\"touchend\\\") {\\n ev.preventDefault();\\n var touch = ev.changedTouches[0]; //this is the first object touched\\n var newEvt = document.createEvent(\\\"MouseEvent\\\");\\n newEvt.initMouseEvent(\\\"click\\\", true, true, window, 1, touch.screenX, touch.screenY, touch.clientX, touch.clientY);\\n //var newEvt = new MouseEvent(\\\"click\\\"); //new method\\n //REF: https://developer.mozilla.org/en-US/docs/Web/API/MouseEvent.MouseEvent\\n ev.currentTarget.dispatchEvent(newEvt);\\n //change the touchend event into a click event and dispatch it immediately\\n //this will skip the built-in 300ms delay before the click is fired by the browser\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"567b00df8cc4d6d9b5898e854026b4ec\",\n \"score\": \"0.58738345\",\n \"text\": \"function dummyTouchStartHandler(e) {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2986d00c29c2d3c18c19ab8db195fb62\",\n \"score\": \"0.5871501\",\n \"text\": \"function mousePressed() {\\n // click to unlock phone\\n var d = dist(mouseX, mouseY, 840, 900);\\n if (d < 100) {\\n islockScreen = false;\\n ishomeScreen = true;\\n }\\n \\n // click on app icon\\n var d1 = dist(mouseX, mouseY, 750, 710);\\n if (ishomeScreen && d1 < 100) {\\n ishomeScreen = false;\\n isappScreen = true;\\n }\\n \\n // click to scan product\\n var d2 = dist(mouseX, mouseY, 760, 300);\\n if (isappScreen && d2 < 100) {\\n isappScreen = false;\\n isscanProductScreen = true;\\n \\n }\\n \\n var d3 = dist(mouseX, mouseY,815,270);\\n if (isscanProductScreen && d3 < 100) {\\n isscanProductScreen = false;\\n isproduct1Screen = true;\\n }\\n \\n var d4 = dist(mouseX, mouseY,795,600);\\n if (isproduct1Screen && d4 < 100) {\\n //print(\\\"click report button\\\");\\n isproduct1Screen = false;\\n isreportScreen = true;\\n }\\n \\n var d5 = dist(mouseX, mouseY,790,770);\\n if (isreportScreen && d5 < 100) {\\n //print(\\\"click report button\\\");\\n isreportScreen = false;\\n isthankyouScreen = true;\\n }\\n \\n var d6 = dist(mouseX, mouseY,790,100);\\n if (isthankyouScreen && d6 < 100) {\\n //print(\\\"click report button\\\");\\n isthankyouScreen = false;\\n isproduct2Screen = true;\\n }\\n \\n \\n \\n \\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3de382e913f73a0ef6072c6313586ef\",\n \"score\": \"0.5869818\",\n \"text\": \"handleTechTap_() {\\n this.userActive(!this.userActive());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc8222789b44f313056700ef5456ed4d\",\n \"score\": \"0.58670884\",\n \"text\": \"function isMobile() {\\n\\ttry{ document.createEvent(\\\"TouchEvent\\\"); return true; }\\n\\tcatch(e){ return false; }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"724b51a6540b63b07173bfe20631121e\",\n \"score\": \"0.5862267\",\n \"text\": \"function isMobile() {\\n\\t try{ document.createEvent(\\\"TouchEvent\\\"); return true; }\\n\\t catch(e){ return false; }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86c5411b3e429103ab1c89f5eca4d34f\",\n \"score\": \"0.58460444\",\n \"text\": \"function mobileOpen() {\\n navCircle.removeClass(\\\"navCircleLeft\\\");\\n $(\\\".redBar\\\").removeClass(\\\"navCircleLeft\\\");\\n clearTimeout($(window).data('scrollTimeout'));\\n navOpen();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52d1d2bdc2c6b51e89f03d74d19034ce\",\n \"score\": \"0.58369094\",\n \"text\": \"function mobileSetUp()\\n {\\n $('.hiddenMobile').hide();\\n $('.viewMobile').show();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37b8bca33ff05aeaa6c8d3ababb01e24\",\n \"score\": \"0.58295876\",\n \"text\": \"function loadmobile(){setmobile();window.location.reload()}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84f9a45c295cbd57b55c39a1742e5055\",\n \"score\": \"0.58281934\",\n \"text\": \"function onDeviceReady() {\\n\\t$.mobile.defaultPageTransition = 'none';\\n\\t$.mobile.defaultDialogTransition = 'none';\\n\\t$.mobile.buttonMarkup.hoverDelay = 0;\\n\\t// iOS. BB. Android\\n\\tdocument.addEventListener(\\\"offline\\\", onOffline, false);\\n\\tdocument.addEventListener(\\\"online\\\", onOnline, false);\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"295afa52d60a5e8c6599e0cd46c465e6\",\n \"score\": \"0.5822111\",\n \"text\": \"function mobileSetUp()\\n {\\n \\n $('.no-mobile').hide();\\n $('.mobile').show();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd67ce88007e3f709fa0fe0f743bd956\",\n \"score\": \"0.5820651\",\n \"text\": \"function fpNavCloseOnClickMobile(){\\r\\n if(windows.width() < 992) {\\r\\n $('.fullpage-menu').on('click', 'li a', function(e) {\\r\\n $('.side-header-toggle').removeClass('toggle-close');\\r\\n $('.side-menu-overlay').removeClass('overlay-show');\\r\\n $('.side-header').removeClass('side-menu-open');\\r\\n });\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e29191692247d435d507dda0634d6083\",\n \"score\": \"0.5818043\",\n \"text\": \"clickHandler() {\\n if (this.Navigation.mobileState) {\\n if (this.open) {\\n this.open = false;\\n this.button.setAttribute('aria-expanded', false);\\n this.element.classList.remove('term-navigation-menu--expanded');\\n this.menu.setAttribute('aria-hidden', true);\\n } else {\\n this.open = true;\\n this.button.setAttribute('aria-expanded', true);\\n this.element.classList.add('term-navigation-menu--expanded');\\n this.menu.setAttribute('aria-hidden', false);\\n this.buttonLink.focus();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ff71f400a76bb542f5ca76a3d7263d4\",\n \"score\": \"0.5816977\",\n \"text\": \"function btnBack_OnTouch() {web.Back();}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5bc8f911dd515b1a8e40b8df073a6c2\",\n \"score\": \"0.5799958\",\n \"text\": \"function touchstart(event) {\\n // prevents this from running when the sandwich menu button is visible:\\n // prevents this from running when we're doing the \\\"phone\\\" menu\\n if ($('.navbar .toggle-nav-bar').css('display') !== 'none') {\\n return false;\\n }\\n\\n if ($(this).closest('.dropdown').hasClass('open')) {\\n } else {\\n // If it is a touch event, get rid of the click events.\\n if (event.type == 'touchstart') {\\n $(this).off('click.toggleNav');\\n }\\n $(this).parent('.dropdown').addClass('open');\\n $(this).parent('.dropdown').addClass('open');\\n self.openMenu = this;\\n event.preventDefault();\\n event.stopPropagation();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd9dea43022ddfc43cf2600a1b3d5b63\",\n \"score\": \"0.5799006\",\n \"text\": \"function handleClick() {\\n\\t\\t window.ctaClick();\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6454a9d7204b70c92e0a15ba3d46cec\",\n \"score\": \"0.57907677\",\n \"text\": \"function clickTheGreyBackgroundToCloseMobile() {\\n hamburgerAnimation();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45adfc0883014a1f0d895e8048253c80\",\n \"score\": \"0.5782326\",\n \"text\": \"function tdAjaxSubCatMegaRunOnTouch(event, jQueryObject) {\\r\\n if ( (true === tdSubCatMegaRunLink) && (event.target === tdSubCatMegaLastTarget) ) {\\r\\n window.location = event.target;\\r\\n } else {\\r\\n tdSubCatMegaRunLink = true;\\r\\n tdSubCatMegaLastTarget = event.target;\\r\\n event.preventDefault();\\r\\n\\r\\n setTimeout( function() {\\r\\n tdSubCatMegaRunLink = false;\\r\\n }, 300);\\r\\n\\r\\n tdAjaxSubCatMegaRun(event, jQueryObject);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5437f1dc87e5baf341005dc2d07b548\",\n \"score\": \"0.57641983\",\n \"text\": \"function exeMenuPageOpen(){\\n //Windows Phone checks.\\n\\tif($.mobile.path.getLocation(\\\"x-wmapp0://www/ustadmobile_menuPage2.html\\\") != \\\"x-wmapp0://www/ustadmobile_menuPage2.html\\\"){\\n\\t\\tdebugLog('there is path problem');\\n\\t}else{\\n\\t\\tdebugLog('everything is OK with paths');\\n\\t}\\n\\tdebugLog(\\\"Ustad Mobile Content: You will go into: exeMenuPage \\\" + exeMenuPage2);\\n //alert(\\\"userAgent:\\\" + navigator.userAgent);\\n //if( platform == \\\"android\\\" ){\\n if(navigator.userAgent.indexOf(\\\"Android\\\") !== -1){\\n var exeMenuLink2 = localStorage.getItem(\\\"baseURL\\\") + \\\"/\\\" + exeMenuPage2;\\n\\t debugLog(\\\"Ustad Mobile Content: ANDROID: You will go into: exeMenuLink \\\" + exeMenuLink2);\\t\\n }else if(navigator.userAgent.indexOf(\\\"Windows Phone OS 8.0\\\") !== -1){\\t//Currently only Windows Phone checks.\\n\\t var exeMenuLink2 = \\\"/www/\\\" + exeMenuPage2;\\n debugLog(\\\"Ustad Mobile Content: WINDOWS PHONE 8: You will go into: exeMenuLink \\\" + exeMenuLink2);\\n }else if(navigator.userAgent.indexOf(\\\"BB10\\\") !== -1){\\n //Do nothing\\n console.log(\\\"Detected your device platform as: Blackberry 10!\\\");\\n var exeMenuLink2 = localStorage.getItem(\\\"baseURL\\\") + \\\"/\\\" + exeMenuPage2;\\n\\t debugLog(\\\"Ustad Mobile Content: Blackberry 10: You will go into: exeMenuLink \\\" + exeMenuLink2);\\n //alert(\\\"BB10TEST: Ustad Mobile Content: Blackberry 10: You will go into: exeMenuLink \\\" + exeMenuLink2);\\n }else if(navigator.userAgent.indexOf(\\\"iPhone OS\\\") !== -1 ){\\n //Do nothing\\n console.log(\\\"Detected your device platform as: iOS!\\\");\\n\\t//alert(\\\"Detected iOS.\\\");\\n var exeMenuLink2 = localStorage.getItem(\\\"baseURL\\\") + \\\"/\\\" + exeMenuPage2;\\n\\t debugLog(\\\"Ustad Mobile Content: iOS: You will go into: exeMenuLink \\\" + exeMenuLink2);\\n\\t//alert(\\\"exeMenuLink: \\\" + exeMenuLink2);\\n }else{\\n console.log(\\\"Unable to detect your device platform. Error.\\\");\\t\\n\\t//alert(\\\"Unable to get platform..\\\");\\n }\\n $.mobile.changePage( exeMenuLink2, { transition: \\\"slideup\\\" } );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2f1c827adfb60402e2555afbda0c6c3\",\n \"score\": \"0.57560736\",\n \"text\": \"function handler_click() {\\n\\t\\t//\\tStuff to do on the click\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"396129d730de26d5a558729f9d9d4f41\",\n \"score\": \"0.57545674\",\n \"text\": \"_buttonTap() {\\n this.dispatchEvent(new CustomEvent(\\\"click\\\", { detail: this }));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f9ea6767236d077cf6da5c1f1979391\",\n \"score\": \"0.5752597\",\n \"text\": \"function click(layoutManager){\\n return {\\n restrict: 'A', \\n link: function(scope, element, attrs){\\n \\n\\n element.bind('touchstart click', function(event) {\\n\\n console.log('clicked');\\n \\n event.preventDefault();\\n event.stopPropagation();\\n \\n scope.$event = event;\\n scope.$apply(attrs['click']);\\n\\n });\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99d9e5759d2c44b6619be26bb6c0ba64\",\n \"score\": \"0.5750859\",\n \"text\": \"function iPadseemenu(){\\r\\n\\tif ($(window).width() <= 767) {\\r\\n $('.see-head').on('click',function(){\\r\\n if(!$(this).hasClass('selected')){\\r\\n $(this).addClass('selected');\\r\\n $('.see-menu').slideDown();\\r\\n }\\r\\n else{\\r\\n $(this).removeClass('selected');\\r\\n $('.see-menu').slideUp(); \\r\\n } \\r\\n }); \\r\\n\\t}\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b517fd8adfde74d10a5c1d478a6ed97\",\n \"score\": \"0.57492906\",\n \"text\": \"handletouchstart(e) {\\n var touch = e.touches[0];\\n var mouseEvent = new MouseEvent(\\\"mousedown\\\", {\\n clientX: touch.clientX,\\n clientY: touch.clientY\\n })\\n this.canvas.dispatchEvent(mouseEvent);\\n e.preventDefault();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84c1a745a614d33d5de1266d728b8b87\",\n \"score\": \"0.573138\",\n \"text\": \"function doubleTapIni(windowW) {\\r\\n\\t\\t$('.touch category-block__list a').doubleTapToGo();\\r\\n\\t\\tif (windowW > 767) {\\r\\n\\t\\t\\t$('.touch ul.navbar-nav > li').each(function () {\\r\\n\\t\\t\\t\\tif ($(this).find('a').hasClass('dropdown-toggle')) {\\r\\n\\t\\t\\t\\t\\t$(this).doubleTapToGo()\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t})\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11f7aefa664e3b3d2be543f7e016fb5a\",\n \"score\": \"0.5726181\",\n \"text\": \"function detectDisengageMobile(event, str)\\n {\\n if(str === \\\"touchstart\\\")\\n {\\n touch_start_time = Date.now();\\n }\\n\\n\\n if(str === \\\"touchend\\\")\\n {\\n let currenttime = Date.now();\\n /* touch for 5 second or more */\\n if(currenttime - touch_start_time > TOUCH_DISENGAGE_TIME)\\n {\\n disengageSignalServer();\\n }\\n\\n }\\n\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6965c038eb4da27bcf2184bc2547008\",\n \"score\": \"0.5722948\",\n \"text\": \"click_event(){\\n const card = this.card;\\n deck.element.addEventListener('click', function handler(event){\\n if(event.target && event.target.matches('.card:not(.open)')){\\n card.open(event.target);\\n }\\n // mobile\\n else if (event.target && event.target.matches('I.fa') && event.target.parentElement.matches('.card:not(.open)')){\\n card.open(event.target.parentElement);\\n }\\n },false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ca4dfca4671f2b9e593238c91983ff0\",\n \"score\": \"0.5721627\",\n \"text\": \"_onBannerItemClicked(adjURL: string) {\\n this.props.navigator.push({ name: 'WebPage',url: adjURL });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60a53c6d35e91c929743651c2d865f28\",\n \"score\": \"0.57209605\",\n \"text\": \"tapEventOn(e) {\\n if (typeof this.hoverClass !== typeof undefined && !this.disabled) {\\n // break class into array\\n var classes = this.hoverClass.split(\\\" \\\");\\n // run through each and add or remove classes\\n classes.forEach((item, index) => {\\n if (item != \\\"\\\") {\\n this.shadowRoot.querySelector(\\\"#button\\\").classList.add(item);\\n if (item.indexOf(\\\"-\\\") != -1) {\\n this.shadowRoot.querySelector(\\\"#icon\\\").classList.add(item);\\n }\\n }\\n });\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"566776465cdf66fcd632e8999b4b600b\",\n \"score\": \"0.5720453\",\n \"text\": \"handleProductLongPressRelease() {\\n if (isMobile)\\n clearTimeout(this.productPressTimer);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0147bb6aac2a5169f9086492e5048fd1\",\n \"score\": \"0.5713222\",\n \"text\": \"function triggerTicketMachine()\\n{\\n\\t// Once an event has completed, the mobile device calls this funtion to trigger the ticket machine.\\n\\t// Android ticket machine is native (so doesn't need to use this callback)\\n\\tif(deviceType == 'ios'){\\n\\t\\t//console.log('triggerTicketMachine');\\n\\t\\tshowTicketMachine();\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"807ff55bb93857a40f36aa218e0005b7\",\n \"score\": \"0.5711519\",\n \"text\": \"function handleIconInteraction() {\\n if (icon.dataset.open == dataOpen) {\\n closeMobileMenu();\\n } else {\\n openMobileMenu();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f473d44f4aa09f842c0b246d2f26a763\",\n \"score\": \"0.5707521\",\n \"text\": \"function touchNav() {\\r\\n $(\\\"#work-carousel-mobile\\\").on(\\\"swipeleft\\\", function () {\\r\\n $(\\\".right.carousel-control\\\").trigger(\\\"click\\\");\\r\\n });\\r\\n $(\\\"#work-carousel-mobile\\\").on(\\\"swiperight\\\", function () {\\r\\n $(\\\".left.carousel-control\\\").trigger(\\\"click\\\");\\r\\n });\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0aabdb84b03d960bb0c1bfc78eccd1a8\",\n \"score\": \"0.5697396\",\n \"text\": \"function Local__clickHandler(e) {\\n\\tif (e.button !== 0) { return; } // handle left-click only\\n\\tvar request = local.util.extractRequest.fromAnchor(e.target);\\n\\tif (request && ['_top','_blank'].indexOf(request.target) !== -1) { return; }\\n\\tif (request) {\\n\\t\\te.preventDefault();\\n\\t\\te.stopPropagation();\\n\\t\\tlocal.util.dispatchRequestEvent(e.target, request);\\n\\t\\treturn false;\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d5600f7f2cd152c136338f10d2cd0cb\",\n \"score\": \"0.5697365\",\n \"text\": \"fireClick() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"981d90d81fe7308a7a283a2fef2e1e36\",\n \"score\": \"0.5692574\",\n \"text\": \"function collegeMiddleMobileMenuClicked(){\\n\\t/* This is only used for Medium and smaller devices. So only allow the\\n\\t * below code to run when window width is medium or smaller (< 64.063em)\\n\\t */\\n\\tvar width = $(window).width() / parseFloat($(\\\"body\\\").css(\\\"font-size\\\"));\\n\\tif( width < 64.063 ){\\n\\t\\tvar elem = $('.dropDownCollegeMenu');\\n\\t\\tif (elem.hasClass('active')) {\\n\\t\\t\\telem.slideUp( 250,'easeInOutExpo', function (){\\n\\t\\t\\t\\t$(this).css('display', '').removeClass('active');\\n\\t\\t\\t});\\n\\t\\t} else {\\n\\t\\t\\telem.slideDown(250, 'easeInOutExpo', function() {\\n\\t\\t\\t\\t$(this).addClass('active');\\n\\t\\t\\t});\\n\\t\\t};\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66cfd4edc783eeeda360c3ad2d330614\",\n \"score\": \"0.56887734\",\n \"text\": \"function mic_click_handler(e) {\\n\\tstates.mic_on = !(states.mic_on);\\n\\tif (states.mic_on) {\\n\\t\\tuserStartAudio().then(function() {\\n\\t\\t\\tmic.start();\\n\\t\\t\\tmic_fft.setInput(mic);\\n\\t\\t});\\n\\t\\tthis.style.opacity = \\\"1\\\";\\n\\t}\\n\\telse {\\n\\t\\tmic.stop();\\n\\t\\tthis.style.opacity = \\\".6\\\";\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afdf06846e1e2f3a0fd4e6bb9c899edf\",\n \"score\": \"0.56835926\",\n \"text\": \"function clickItbackMessageType() {\\n showMessagingtest();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a771166604dd792fadf7dc445a4e74f2\",\n \"score\": \"0.5680112\",\n \"text\": \"handleClick(e) {\\n\\t\\tconst id = $(e.currentTarget).attr('href');\\n\\n\\t\\tVeams.Vent.trigger(Veams.EVENTS.navigation.clicked, id);\\n\\t\\te.preventDefault();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"391fd62e77baf908c8022c5529ea6649\",\n \"score\": \"0.56696445\",\n \"text\": \"function preventClickSpam() {\\n $('.card').off('click');\\n $('.card').off('tap');\\n window.setTimeout(() => {\\n $('.card').click(toggleCardOpenClose);\\n $('.card').on('tap', toggleCardOpenClose);\\n }, 500); // Value corresponds to .card-exterior \\\"transition\\\" attribute.\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08098f430618ae274708852d7acbd50f\",\n \"score\": \"0.56611055\",\n \"text\": \"function toggleMobileNav(event) {\\n\\t\\tevent.preventDefault();\\n\\t\\tevent.stopPropagation();\\n\\t\\t\\n\\t\\t$('body').toggleClass('mobile-nav--is-open');\\n\\t\\twindow.scrollTo(0,0);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81fdb430f994cbb22681d0b9430edcf9\",\n \"score\": \"0.5655625\",\n \"text\": \"function clickHandler() {\\n audioContext.resume();\\n document.body.removeEventListener(\\\"click\\\", clickHandler);\\n document.body.removeEventListener(\\\"touchend\\\", clickHandler);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3bcf1a6f2e664d23caa3b133288fd356\",\n \"score\": \"0.5654505\",\n \"text\": \"function showCitationOnClick($) {\\n $('.citation-num.citation-num-mobile').each(function() {\\n touchClick($(this), () => {\\n $(this).next().addClass('fadeIn').slideToggle(200);\\n })\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"997beb087fa12b4aadb66bf8bf0dbf87\",\n \"score\": \"0.56465274\",\n \"text\": \"function touchHandler(event) {\\n var touch = event.changedTouches[0];\\n\\n var simulatedEvent = document.createEvent(\\\"MouseEvent\\\");\\n simulatedEvent.initMouseEvent({\\n touchstart: \\\"mousedown\\\",\\n touchmove: \\\"mousemove\\\",\\n touchend: \\\"mouseup\\\"\\n }[event.type], true, true, window, 1,\\n touch.screenX, touch.screenY,\\n touch.clientX, touch.clientY, false,\\n false, false, false, 0, null);\\n\\n touch.target.dispatchEvent(simulatedEvent);\\n // Clicks should continue to work\\n if( event.type === \\\"touchmove\\\" ) event.preventDefault();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7e9fb67812c07066f882116f2f1430f\",\n \"score\": \"0.56389457\",\n \"text\": \"function checkMobileMode() {\\n var width = $(window).width();\\n if (width > 1000) {\\n turnOffAllTaskFunctionality();\\n\\n makeDraggableAndDroppable();\\n clickResize();\\n $(\\\".draggableTask p:last-child\\\").mousedown(function (event) {\\n $(this).focus();\\n });\\n }\\n else {\\n turnOffAllTaskFunctionality();\\n\\n $(\\\".task\\\").click(function () {\\n var data = { id: $(this).attr(\\\"id\\\") };\\n makeDialog(\\\"/Task/GetTaskDetails_Ajax\\\", data);\\n })\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d3a7313f6ea9e5237929ab167b13089\",\n \"score\": \"0.5636837\",\n \"text\": \"function checkForMobile() {\\n if (_currentViewPortSize.width <= _tabletBreakWidth || _browserInfo.mobile.any()) {\\n switchToMobileView();\\n } else if (_currentViewPortSize.width > _tabletBreakWidth) {\\n switchToDesktopView();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39b8b5f748e830fbafaa06f76be9a4ab\",\n \"score\": \"0.5634701\",\n \"text\": \"function onSocialClick(snName) {\\n Analytics.trackEvent('web', 'main-social-click', snName);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60439ad96f6637c803dbb8985c853ea8\",\n \"score\": \"0.5634074\",\n \"text\": \"function contentItemTap() {\\n\\n\\t\\tif (!isMenuOpen) {\\n\\t\\t\\t\\n // Change the current screen\\n App.navigate($(this).attr(\\\"href\\\"));\\n\\t\\t\\n } else {\\n \\n // If the menu is open, close it\\n\\t\\t\\tcloseMenu();\\n\\n }\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8dd36367f00834f413313bde57ca12ce\",\n \"score\": \"0.56199014\",\n \"text\": \"function openMobileMenu(){\\n if (breakPoint == 'xx' || breakPoint == 'xs' || breakPoint == 'sm') {\\n $('.hamburger').attr('data-toggle', 'collapse');\\n $('.hamburger').attr('aria-expanded', 'true');\\n $('.hamburger').attr('data-target', '#mobile-wrap');\\n $('.hamburger').addClass('collapsed');\\n $('.mobile-wrap').addClass('collapse');\\n\\n } else {\\n\\n $('.hamburger').removeAttr('data-toggle', 'collapse');\\n $('.hamburger').removeAttr('aria-expanded', 'true');\\n $('.hamburger').removeAttr('data-target', '#mobile-wrap');\\n $('.hamburger').removeClass('collapsed');\\n $('.mobile-wrap').removeClass('collapse');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1eb64bf0d09f42490e25e2ec737139eb\",\n \"score\": \"0.56099147\",\n \"text\": \"function clicktag_Click(e) {\\n if (dcSelect) {\\n Enabler.exit(\\\"Exit Click\\\");\\n // Enabler.exitOverride(\\\"Exit Click\\\", \\\"https://www.google.com\\\");\\n Enabler.counter(\\\"Counter Click\\\");\\n } else {\\n window.open(window.clickTag);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1eb64bf0d09f42490e25e2ec737139eb\",\n \"score\": \"0.56099147\",\n \"text\": \"function clicktag_Click(e) {\\n if (dcSelect) {\\n Enabler.exit(\\\"Exit Click\\\");\\n // Enabler.exitOverride(\\\"Exit Click\\\", \\\"https://www.google.com\\\");\\n Enabler.counter(\\\"Counter Click\\\");\\n } else {\\n window.open(window.clickTag);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5081728542f53c62dc9b0faa22f3a5d1\",\n \"score\": \"0.5608519\",\n \"text\": \"function FastClick(a,b){function c(a,b){return function(){return a.apply(b,arguments)}}var d;b=b||{};this.trackingClick=!1;this.trackingClickStart=0;this.targetElement=null;this.lastTouchIdentifier=this.touchStartY=this.touchStartX=0;this.touchBoundary=b.touchBoundary||10;this.layer=a;this.tapDelay=b.tapDelay||200;if(!FastClick.notNeeded(a)){for(var g=\\\"onMouse onClick onTouchStart onTouchMove onTouchEnd onTouchCancel\\\".split(\\\" \\\"),f=0,h=g.length;f<h;f++)this[g[f]]=c(this[g[f]],this);deviceIsAndroid&&\\n(a.addEventListener(\\\"mouseover\\\",this.onMouse,!0),a.addEventListener(\\\"mousedown\\\",this.onMouse,!0),a.addEventListener(\\\"mouseup\\\",this.onMouse,!0));a.addEventListener(\\\"click\\\",this.onClick,!0);a.addEventListener(\\\"touchstart\\\",this.onTouchStart,!1);a.addEventListener(\\\"touchmove\\\",this.onTouchMove,!1);a.addEventListener(\\\"touchend\\\",this.onTouchEnd,!1);a.addEventListener(\\\"touchcancel\\\",this.onTouchCancel,!1);Event.prototype.stopImmediatePropagation||(a.removeEventListener=function(b,c,d){var e=Node.prototype.removeEventListener;\\n\\\"click\\\"===b?e.call(a,b,c.hijacked||c,d):e.call(a,b,c,d)},a.addEventListener=function(b,c,d){var e=Node.prototype.addEventListener;\\\"click\\\"===b?e.call(a,b,c.hijacked||(c.hijacked=function(a){a.propagationStopped||c(a)}),d):e.call(a,b,c,d)});\\\"function\\\"===typeof a.onclick&&(d=a.onclick,a.addEventListener(\\\"click\\\",function(a){d(a)},!1),a.onclick=null)}}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5033e7a48fe4f142a577a1fe9c38e69f\",\n \"score\": \"0.5606225\",\n \"text\": \"function openCardPhone(e) {\\n if (!isCardOpen) { cardTogglePhone(e); } else { cardTogglePhone(null); }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10dc22b6a0629abed46fb33cf328bc69\",\n \"score\": \"0.55988795\",\n \"text\": \"onShortClick() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6b154cbe9a3fabe65a7886c83de918a\",\n \"score\": \"0.55959994\",\n \"text\": \"function returnFromMobile() {\\n if (document.body.clientWidth >= 480) {\\n var down = document.body.querySelector(\\\".down\\\");\\n var downMenu = document.body.querySelector(\\\".down__menu\\\");\\n var parent = downMenu.parentElement;\\n var social = document.body.querySelectorAll(\\\".social\\\");\\n var end = document.body.querySelectorAll(\\\".social-around\\\");\\n downMenu.parentElement.removeChild(downMenu);\\n down.appendChild(downMenu);\\n var linksRight = document.body.querySelector(\\\".links .right\\\");\\n linksRight.appendChild(social[0]);\\n linksRight.appendChild(social[1]);\\n down.removeChild(down.firstElementChild);\\n \\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ec4b503e65a49351ed854cc6e1a961d\",\n \"score\": \"0.559447\",\n \"text\": \"function touchHandler(event) {\\r\\n var touch = event.changedTouches[0];\\r\\n\\r\\n var simulatedEvent = document.createEvent(\\\"MouseEvent\\\");\\r\\n simulatedEvent.initMouseEvent({\\r\\n touchstart: \\\"mousedown\\\",\\r\\n touchmove: \\\"mousemove\\\",\\r\\n touchend: \\\"mouseup\\\"\\r\\n }[event.type], true, true, window, 1,\\r\\n touch.screenX, touch.screenY,\\r\\n touch.clientX, touch.clientY, false,\\r\\n false, false, false, 0, null);\\r\\n\\r\\n touch.target.dispatchEvent(simulatedEvent);\\r\\n event.preventDefault();\\r\\n \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29f2de62259d13578d9da2e2ef8a4d64\",\n \"score\": \"0.5592888\",\n \"text\": \"function dropdownHandlerMobile(e) {\\n\\te.stopPropagation();\\n\\te.preventDefault();\\n\\n\\tvar mobileMenu = this.nextElementSibling;\\n\\tvar downCarat = this.childNodes[1];\\n\\n\\tmobileMenu.classList.toggle('show');\\n\\tdownCarat.classList.toggle('active');\\n\\n\\thideMenuHandler(mobileMenu.id);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"092c39abd955aefd9b0ef571040e2e3c\",\n \"score\": \"0.55926293\",\n \"text\": \"function deviceChecker() {\\n var eventHandler = \\\"\\\"\\n //check if device is mobile or desktop --> Needs testing dont think itll work consistantly \\n if (/Android|webOS|iPhone|iPad|iPod|BlackBerry/i.test(navigator.userAgent)) {\\n //mobile \\n // isMobile = true;\\n console.log('mobile device')\\n //click for mobile\\n eventHandler = \\\"click\\\";\\n //click ooption on for mobile\\n $('.panel').click(dropDownHandler);\\n } else {\\n //desktop \\n console.log('desktop')\\n //hover for desktop\\n eventHandler = \\\"mouseover\\\";\\n //hover option on for desktop\\n $('.panel').hover(dropDownHandler, exitHoverCallBack);\\n }\\n //make the panel open when page loads \\n $(\\\".panel:eq(0)\\\").trigger(eventHandler);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ac6c7bc6d5f26bb4e18b5771c86ba04\",\n \"score\": \"0.558345\",\n \"text\": \"function clickButton() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca9e427982972f6c55c712638ec592f6\",\n \"score\": \"0.55779415\",\n \"text\": \"function setupMobileTabs() {\\r\\n tabContentMobile.hide();\\r\\n tabMobile.click(function() {\\r\\n $f(this).toggleClass('selected').next().slideToggle();\\r\\n });\\r\\n tabMobile.eq(0).click();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c72c7b4ea7cbe7374553456a149926ae\",\n \"score\": \"0.55694604\",\n \"text\": \"function ao(){\\r\\n var aK,aJ,aM,aL,aN,s=false;\\r\\n am.unbind(\\\"touchstart.jsp touchmove.jsp touchend.jsp click.jsp-touchclick\\\").bind(\\\"touchstart.jsp\\\",function(aO){\\r\\n var aP=aO.originalEvent.touches[0];\\r\\n aK=aD();\\r\\n aJ=aB();\\r\\n aM=aP.pageX;\\r\\n aL=aP.pageY;\\r\\n aN=false;\\r\\n s=true\\r\\n })\\r\\n .bind(\\\"touchmove.jsp\\\",function(aR){\\r\\n if(!s){\\r\\n return\\r\\n }\\r\\n var aQ=aR.originalEvent.touches[0],aP=aa,aO=I;\\r\\n Q.scrollTo(aK+aM-aQ.pageX,aJ+aL-aQ.pageY);\\r\\n aN=aN||Math.abs(aM-aQ.pageX)>5||Math.abs(aL-aQ.pageY)>5;\\r\\n/* Returning true of no movement so rest of the screen can scroll */ \\r\\n return aP==aa&&aO==I\\r\\n })\\r\\n .bind(\\\"touchend.jsp\\\",function(aO){\\r\\n s=false\\r\\n })\\r\\n .bind(\\\"click.jsp-touchclick\\\",function(aO){\\r\\n if(aN){\\r\\n aN=false;\\r\\n return false\\r\\n }\\r\\n })\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"281cef91a1fd41ba18e7dbd159e831b2\",\n \"score\": \"0.5568188\",\n \"text\": \"function checkMobile() { return /iPhone|iPad|iPod|Android/i.test(navigator.userAgent); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"012ddbf06425bc4fd22bbca4ee11a222\",\n \"score\": \"0.555924\",\n \"text\": \"function desktopSetUp()\\n {\\n $('.hiddenMobile').show();\\n $('.viewMobile').hide();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52f9b56b2f1f7e8bd6f4f41be606c028\",\n \"score\": \"0.5559024\",\n \"text\": \"function viewportGo_l() {\\n\\tundropclick();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c68985a94cbd8b18cb6efd494aa984c\",\n \"score\": \"0.55485904\",\n \"text\": \"onVRClick(event) {\\n this.dispatchEvent({ type: \\\"click\\\" });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ba7a79d72c3de761ae35447dcbbc2d0\",\n \"score\": \"0.55451727\",\n \"text\": \"function burgerIconClick() {\\n $(BURGER_BTN).on('click', e => {\\n e.preventDefault();\\n toggleMobileMenu();\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45390be3a1e91e911967611e4e6dbafa\",\n \"score\": \"0.554504\",\n \"text\": \"function clickable() { ; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09733752b89ead40b6bac0e9b896af48\",\n \"score\": \"0.5545003\",\n \"text\": \"function openSectionBindClick($selector, $target, $targetMobile)\\n {\\n $(\\\"#\\\"+$selector).click(function()\\n {\\n if(_isMobile)\\n {\\n $('#'+$targetMobile).slideToggle( \\\"slow\\\", function() \\n {\\n checkBoxVisibility();\\n });\\n }else\\n {\\n $('#'+$target).slideToggle( \\\"slow\\\", function() \\n {\\n checkBoxVisibility();\\n });\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f763157d62f93d4b98cf6775bfe82a0\",\n \"score\": \"0.554456\",\n \"text\": \"handleTechTouchMove_() {\\n if (this.userWasActive) {\\n this.reportUserActivity();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2830816acdd8fb86e6e57a1ef33fd30\",\n \"score\": \"0.55387014\",\n \"text\": \"onMobileModeChanged(inMobileMode) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f4ecc2e74aa99e8c1979fcdce18e388\",\n \"score\": \"0.553794\",\n \"text\": \"function FastClick(t,e){\\\"use strict\\\";function i(t,e){return function(){return t.apply(e,arguments)}}var n;if(e=e||{},this.trackingClick=!1,this.trackingClickStart=0,this.targetElement=null,this.touchStartX=0,this.touchStartY=0,this.lastTouchIdentifier=0,this.touchBoundary=e.touchBoundary||10,this.layer=t,this.tapDelay=e.tapDelay||200,!FastClick.notNeeded(t)){for(var o=[\\\"onMouse\\\",\\\"onClick\\\",\\\"onTouchStart\\\",\\\"onTouchMove\\\",\\\"onTouchEnd\\\",\\\"onTouchCancel\\\"],s=this,r=0,c=o.length;c>r;r++)s[o[r]]=i(s[o[r]],s);deviceIsAndroid&&(t.addEventListener(\\\"mouseover\\\",this.onMouse,!0),t.addEventListener(\\\"mousedown\\\",this.onMouse,!0),t.addEventListener(\\\"mouseup\\\",this.onMouse,!0)),t.addEventListener(\\\"click\\\",this.onClick,!0),t.addEventListener(\\\"touchstart\\\",this.onTouchStart,!1),t.addEventListener(\\\"touchmove\\\",this.onTouchMove,!1),t.addEventListener(\\\"touchend\\\",this.onTouchEnd,!1),t.addEventListener(\\\"touchcancel\\\",this.onTouchCancel,!1),Event.prototype.stopImmediatePropagation||(t.removeEventListener=function(e,i,n){var o=Node.prototype.removeEventListener;\\\"click\\\"===e?o.call(t,e,i.hijacked||i,n):o.call(t,e,i,n)},t.addEventListener=function(e,i,n){var o=Node.prototype.addEventListener;\\\"click\\\"===e?o.call(t,e,i.hijacked||(i.hijacked=function(t){t.propagationStopped||i(t)}),n):o.call(t,e,i,n)}),\\\"function\\\"==typeof t.onclick&&(n=t.onclick,t.addEventListener(\\\"click\\\",function(t){n(t)},!1),t.onclick=null)}}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2efa36567f8ca2e7e7f5daba5439d86\",\n \"score\": \"0.5532519\",\n \"text\": \"function customLinkClickHandler() {\\n var target;\\n if (target = getTargetAttribute(this)) {\\n if (target == 'stop') {\\n option[13]/*auto*/ = FALSE;\\n stopAuto();\\n } else if (target == \\\"start\\\") {\\n startAuto();\\n option[13]/*auto*/ = TRUE;\\n } else if (target == 'block') {\\n clickable = FALSE;\\n } else if (target == 'unblock') {\\n clickable = TRUE;\\n } else {\\n enqueueAnimation((target == parseInt10(target)) ? target - 1 : target, TRUE);\\n }\\n }\\n return FALSE;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6af8250337a6dc07617bbb9cf0020cc\",\n \"score\": \"0.55304444\",\n \"text\": \"function _exitMobile() {\\n\\t\\t\\t$scope.$broadcast('exit-mobile');\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c4130614d1f100ca241ced3f50cd50b\",\n \"score\": \"0.55257833\",\n \"text\": \"function mobileMenuShiftAwayLink() {\\n const elementMenuMobileLink = document.getElementsByClassName(\\\"menu_mobile_link\\\");\\n for (let i = 0; i < elementMenuMobileLink.length; i++) {\\n elementMenuMobileLink[i].addEventListener(\\\"click\\\", function() {\\n document.getElementById(\\\"animation_mobile_menu\\\").style.display = \\\"none\\\";\\n document.getElementById(\\\"div_mobile_menu\\\").style.display = \\\"none\\\";\\n document.getElementById(\\\"nav_mobile_menu\\\").style.display = \\\"block\\\";\\n document.getElementById(\\\"nav_mobile_menu\\\").addEventListener(\\\"click\\\", mobileMenuPopUp);\\n document.getElementById(\\\"div_mobile_menu\\\").style.opacity = 0;\\n });\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"424fce98e06e0335276d73515be3a705\",\n \"score\": \"0.5523683\",\n \"text\": \"function hb_is_mobile(){\\n\\tif( /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(navigator.userAgent) ) {\\n\\t\\t$body.addClass('mobile mobile-device');\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f716e911e8b0b9292ed656930b6deba\",\n \"score\": \"0.5503497\",\n \"text\": \"function handleClick () {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cdb7e455c58293e153ad13b3122d77e\",\n \"score\": \"0.550324\",\n \"text\": \"function mobileToggle(e) {\\n\\t\\t\\tif ($(e).hasClass(\\\"active\\\") == true) {\\n\\t\\t\\t\\t$(e).animate({maxHeight: \\\"70px\\\"}, 300).removeClass(\\\"active\\\");\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t$(e).animate({maxHeight: \\\"100vh\\\"}, 300).addClass(\\\"active\\\");\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"199823edf0db66a57f88b77a09a42e3a\",\n \"score\": \"0.5495514\",\n \"text\": \"function h(){var e=window.navigator.userAgent;return(-1===e.indexOf(\\\"Android 2.\\\")&&-1===e.indexOf(\\\"Android 4.0\\\")||-1===e.indexOf(\\\"Mobile Safari\\\")||-1!==e.indexOf(\\\"Chrome\\\")||-1!==e.indexOf(\\\"Windows Phone\\\"))&&(window.history&&\\\"pushState\\\"in window.history)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a31b5a70432a7ea15988624eb6d8e60b\",\n \"score\": \"0.5483041\",\n \"text\": \"function handleHireClick(e) {\\n\\tlocation.href = \\\"\\\";\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":70,"cells":{"query_id":{"kind":"string","value":"35d89ee3ac1e30c58af916935248994e"},"query":{"kind":"string","value":"generate new questions and reset instance variables"},"positive_passages":{"kind":"list like","value":[{"docid":"48d178d010aa7ecf90b5f65262dec541","score":"0.6474137","text":"reset() {\n this.generateQuestions();\n this.timer = new Timer(10, this.timesUp(this));\n this.round = 0;\n this.score = 0;\n this.multiplier = 1;\n this.currentQuestion = this.questions[this.round];\n this.userGuess = '';\n\n // housekeeping - clear the board \n this.timer.remove();\n this.currentQuestion.clear();\n this.clearNextQuestionPromt();\n }","title":""}],"string":"[\n {\n \"docid\": \"48d178d010aa7ecf90b5f65262dec541\",\n \"score\": \"0.6474137\",\n \"text\": \"reset() {\\n this.generateQuestions();\\n this.timer = new Timer(10, this.timesUp(this));\\n this.round = 0;\\n this.score = 0;\\n this.multiplier = 1;\\n this.currentQuestion = this.questions[this.round];\\n this.userGuess = '';\\n\\n // housekeeping - clear the board \\n this.timer.remove();\\n this.currentQuestion.clear();\\n this.clearNextQuestionPromt();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"6e0608ad32e552f242d97ac25d68cb39","score":"0.7902963","text":"generateQuestions() {\n const questions = []\n const randoms = this.randomQuestions();\n for (let i = 0; i < randoms.length; i++) {\n const question = new Question(randoms[i]);\n questions.push(question);\n }\n\n this.questions = questions;\n }","title":""},{"docid":"6f2fc038069ea365476e82ffc3d26e5d","score":"0.7423109","text":"function loadQuestion() {\n let singleQuestion = new QuestionAndAnswer\n (\n randomLoremGenMax66Words(7, 20),\n randomLoremGenMax66Words(3, 66),\n numberOfQuestion\n );\n\n showQuestion(\n singleQuestion.getQuestion(),\n singleQuestion.getAnswer(),\n phaseAppendQuestions\n );\n //Global change\n numberOfQuestion++;\n}","title":""},{"docid":"b055006a4f980ba2a8478c36b4cc398a","score":"0.73392","text":"function populateQuestions(){\nallQuestions = defaultQuestions;\nquestions = defaultQuestions[current];\nquestion = questions.question;\nchoiceA = questions.choiceA;\nchoiceB = questions.choiceB;\nchoiceC = questions.choiceC;\nchoiceD = questions.choiceD;\n}","title":""},{"docid":"c0dc88b1638108824e2f0dc7245b2cbc","score":"0.724611","text":"function setupNewQuestion() {\n question = new MinusQuestion();\n questionElement.innerText = question.questionText();\n answerElement.value = \"\";\n }","title":""},{"docid":"caab26beb565cfe75f5be815a65b008a","score":"0.7243469","text":"function resetUsedQuestions() {\n usedQuestions = [];\n}","title":""},{"docid":"be01c81e5d782f133a9734f15a071b28","score":"0.7171578","text":"function makeQuestion() {\n randomizeQuestion();\n displayQuestion();\n }","title":""},{"docid":"201a82df32491c3804563041b4647f96","score":"0.7169128","text":"function qGenerator(){\n var i = Math.floor(Math.random()*questionSet.length);\n question.textContent = questionSet[i][0];\n answer1.textContent = questionSet[i][1];\n answer2.textContent = questionSet[i][2];\n answer3.textContent = questionSet[i][3];\n answer4.textContent = questionSet[i][4];\n questionSet.splice(i,1);\n}","title":""},{"docid":"be2cd6e9b3acbeab7b9aaccea216adcd","score":"0.7132091","text":"function newQuestion() {\n var allQuestions = [ageQue, jobQue, countryQue];\n\n var n = Math.floor(Math.random() * allQuestions.length);\n\n allQuestions[n].displayQuestion();\n\n var answer = prompt(allQuestions[n].question);\n\n if (answer !== 'exit') {\n allQuestions[n].checkAnswer(parseInt(answer));\n newQuestion();\n }\n }","title":""},{"docid":"7b0d955a665d1d5ac4cc424c74ced9b4","score":"0.7091687","text":"generateQuestion() {\n questionDiv.empty();\n questionDiv.append(Object.values(this.questions[counter].question));\n this.startTimer();\n }","title":""},{"docid":"3deec5471f7e55586c062472966e5925","score":"0.7048493","text":"function generateNewQuestion() {\n // increasing question tracker by 1 with each new question generated and updating text\n questionTracker++;\n questionTrackerText.innerText = questionTracker + \"/\" + totalQuestions;\n\n // variable for question index to generate random question from available questions array\n var questionIndex = Math.floor(Math.random(availableQuestions.length));\n // setting current question to a random index within the availabe questions array\n currentQuestion = availableQuestions[questionIndex];\n quizQuestion.innerText = currentQuestion.question;\n\n // following same principle for answer selections usinf forEach method\n answerSelections.forEach(answerSelection => {\n // variable to reference data-set in html \n var number = answerSelection.dataset[\"number\"];\n // printing selections to the screen that match with corresponding text \n answerSelection.innerText = currentQuestion[\"answerSelection\" + number];\n });\n // splicing out question that was used so it doesn't repeat\n availableQuestions.splice(questionIndex, 1);\n}","title":""},{"docid":"737ee54f63bde82b3564bd7670f34bb2","score":"0.70346135","text":"function generateQuestions() {\n questionArray.push(new question(\"What card has the following flavor text? <br><br> <em>'A blade that has never known sheath, a hilt that has never known hand.'</em>\", [\"Dancing Scimitar\", \"Sword of the Ages\", \"Whirling Dervish\", \"Blade Sentinel\"], \"dancing-scimitar.jpg\"));\n questionArray.push(new question(\"First printed in Alpha, is the only card with art painted by Faye Jones. It pictures a clown and a blindfolded humanoid fox balanced on a scale.\", [\"Stasis\", \"Jackal Pup\", \"Atog\", \"Noetic Scales\"], \"stasis.jpg\"));\n questionArray.push(new question(\"Which of these is NOT a creature type on the card Coiling Oracle?\", [\"Merfolk\", \"Snake\", \"Elf\", \"Druid\"], \"coiling_oracle.jpg\"));\n questionArray.push(new question(\"Which of these lands is both a Swamp and and Island\", [\"Underground Sea\", \"Overgrown Tomb\", \"Lonely Sandbar\", \"Bloodstained Mire\"], \"underground_sea.jpg\"));\n questionArray.push(new question(\"What card has the following flavor text? <br><br> <em>'I want a banana this big!'</em>\", [\"Gorilla Titan\", \"Tasigur, the Golden Fang\", \"Uktabi Orangutan\", \"Hyalopterous Lemure\"], \"gorilla_titan.jpg\"));\n questionArray.push(new question(\"What is the converted mana cost of the card Enlisted Wurm?\", [6, 5, 7, 8], \"enlisted_wurm.jpg\"));\n questionArray.push(new question(\"Besides Shaman, what creature type does Thundercloud Shaman have?\", [\"Giant\", \"Elf\", \"Elemental\", \"Goblin\"], \"thundercloud_shaman.jpg\"));\n questionArray.push(new question(\"How much damage does the card Pyroclasm do to each creature?\", [2, 3, 4, 1], \"pyroclasm.jpg\"));\n questionArray.push(new question(\"What is Lord of the Pit's power and toughness?\", [\"7/7\", \"6/6\", \"5/5\", \"8/8\"], \"lord_of_the_pit.jpg\"));\n questionArray.push(new question(\"What color is the card Volcanic Erruption\", [\"Blue\", \"Red\", \"Black\", \"Green\"], \"volcanic_erruption.jpg\"));\n}","title":""},{"docid":"972aa0d00eafd19734868c33fffbf6b7","score":"0.7029648","text":"function init() {\n questions();\n}","title":""},{"docid":"ff619fc488f4a983a7b59b9ee017b3d4","score":"0.7003965","text":"function setQuestions() {\n for (let i = 0; i < questionsLength; i++) {\n availableQuestion.push(quizQuestions[i]);\n }\n}","title":""},{"docid":"f5b8ace8f7f68fdadf7a20966f7a928b","score":"0.6993607","text":"function setNextQuestion(){\n //resets everything back to the starting state for each quesiton\n resetState()\n //runs the function that dynamically generates the questions\n showQuestion(shuffledQuestions[currentQuestionIndex])\n}","title":""},{"docid":"b1b6680dd5fc0f19d6810985c06bbf29","score":"0.69657195","text":"function populate() {\n new Questions('cult', 'The Goonies search for which pirate\\'s treasure?', 'Blackbeard', 'Davy Jones', 'Calico Jack', 'One Eyed-Willy', 4);\n new Questions('cult', 'Which 80s movie theme song was recorded in just 3 hours?', '\"Oh Yeah\" - Ferris Bueller\\'s Day Off', '\"Don\\'t You (Forget About Me)\" - The Breakfast Club', '\"Storybook Love\" - The Princess Bride', '\"Ghostbusters\" - Ghostbusters', 2);\n new Questions('magic', 'In the Labyrinth, what other name does the Goblin King go by (Hint: The Goblin King is played by David Bowie!)?', 'The Lord of the Labyrinth', 'Robert', 'Jareth', 'His Highness', 3);\n new Questions('magic', 'What is the name of Atreyu\\'s horse in The NeverEnding Story?', 'Artex', 'Teeny Weeny', 'Bastian', 'Urgl', 1);\n new Questions('horror', 'Which movie is in the Guinness Book of Records for the most retakes of a single scene?', 'A Nightmare on Elm Street', 'The Shining', 'The Evil Dead', 'Poltergeist', 2);\n new Questions('horror', 'How many Nightmare on Elm Street films were made in the 80s?', 3, 4, 5, 6, 3);\n new Questions('scifi', 'Which 80s movie was the highest grossing film of the decade?', 'E.T. the Extra-Terrestrial', 'Return of the Jedi', 'Tron', 'Aliens', 1);\n new Questions('scifi', 'This is the only actor to be killed by an Alien, Predator, and a Terminator.', 'Sigourney Weaver', 'Carl Weathers', 'Lance Henriksen', 'Bill Paxton', 4);\n new Questions('chevy', 'What nickname did Chevy Chase\\'s wife call him in the National Lampoon movies?', 'Buddy', 'Clark', 'Sparky', 'Mr. Griswold', 3);\n new Questions('cult', 'What song did Ducky lip sync in Pretty in Pink?', '\"Try a Little Tenderness\"', '\"Nothing\\'s Gonna Stop Us Now\"', '\"Saving All My Love for You\"', '\"Longer\"', 1);\n new Questions('action', 'Name That Movie: \"Snakes. Why did it have to be snakes?\"', 'Indiana Jones and the Template of Doom', 'Crocodile Dundee', 'The Princess Bride', 'Raiders of the Lost Ark', 4);\n new Questions('magic', 'Jim Hensen\\'s The Dark Crystal takes place in \"another world, another time, in the age of _____.\"', 'surprise', 'wonder', 'magic', 'uncertainty', 2);\n new Questions('scifi', 'The main street set in Back to the Future is also the main street in what other 80s movie?', 'RoboCop', 'Repo Man', 'Gremlins', 'E.T. the Extra-Terrestrial', 3);\n new Questions('scifi', 'What is the single most valuable commodity in David Lynch\\'s Dune?', 'Melange', 'Coffee', 'Salt', 'Plutonium', 1);\n new Questions('horror', 'Which is not a movie directed by John Carpenter?', 'The Fog', 'Halloween II', 'The Thing', 'Prince of Darkness', 2);\n new Questions('scifi', 'Whose work did NOT influence Blade Runner?', 'Philip K. Dick', 'Dan O\\'Bannon', 'Jean Giraud', 'Arthur C. Clarke', 4);\n new Questions('magic', 'What god does Conan the Barbarian worship?', 'Odin', 'Kull', 'Crom', 'Bhaal', 3);\n new Questions('magic', 'What was the first DVD sent out on Netflix in 1998?', 'Beetlejuice', 'The Dark Crystal', 'The NeverEnding Story', 'Gremlins', 1);\n new Questions('chevy', 'In Three Amigos!, what did the Dusty Bottoms play for the other amigos to dance to in the cantina?', 'Arm in Arm', 'My Little Buttercup', 'Cheek to Cheek', 'My Love, Sweet Love', 2);\n new Questions('chevy', 'In National Lampoon\\'s Christmas Vaction, which football team\\'s hat did Clark wear?', 'Green Bay Packers', 'Chicago Bears', 'Pittsburgh Steelers', 'Kansas City Chiefs', 2);\n new Questions('chevy', 'In Caddyshack, Ty Webb and Judge Smails each bet what amount in the golf match?', '$20k', '$40k', '$60k', '$80k', 1);\n new Questions('chevy', 'In Funny Farm, what hat does Andy wear for most of the film?', 'Chicago Cubs', 'New York Mets', 'Boston Red Sox', 'New York Yankees', 2);\n new Questions('action', 'In The Warriors, what famous line does Luther screech?', 'Just beat it', 'Come out to play', 'Let\\'s get down to it', 'Truth or dare', 2);\n new Questions('action', 'In Escape from New York, what is the only thing that Snake asks for when escaping?', 'A Shower', 'Water', 'A Phone Call', 'A Ride', 4);\n new Questions('action', 'In They Live, Nada is here to, \"Kick Ass and _____?\"', 'Take Names', 'Take a Break', 'Right Wrongs', 'Chew Bubblegum', 4);\n new Questions('action', 'In Highlander, the main villain - the Kurgan - says \"it\\'s better to _____.\"', 'be alone', 'burn the candle at both ends', 'burn out than to fade away', 'be feared than loved', 3);\n new Questions('horror', 'Although Jamie Lee Curtis has top billing in Halloween II, she only appears for _____ minutes in the film.', '23', '28', '31', '25', 4);\n new Questions('horror', 'In The Lost Boys, what was the name of the main love interest?', 'Star', 'Peony', 'Soleil', 'Moonflower', 1);\n new Questions('horror', 'In Pet Sematary, what was the name of the evil cat that comes back to life?', 'Josie', 'Kitty', 'Churches', 'Maxy', 3);\n new Questions('scifi', 'In The Thing, what computer game did R.J. MacReady play while sitting in his cabin?', 'Tetris', 'Chess', 'Pong', 'Solitaire', 2);\n new Questions('scifi', 'In Aliens, what was the little girl\\'s name who was the only survivor at the LV-426 settlement?', 'Sarah', 'Hadley', 'Newt', 'Salamander', 3);\n new Questions('scifi', 'In Blade Runner, what type of origami animal does Gaff make and leave outside Deckard\\'s house?', 'Frog', 'Unicorn', 'Horse', 'Swan', 2);\n new Questions('scifi', 'In The Terminator, what was the only possession that Kyle had of Sarah Connor\\'s?', 'Tapes', 'A Gun', 'A T-shirt', 'Polaroid', 4);\n new Questions('cult', 'In The Goonies, what was the name of the Fratelli family member whom Chunk befriends?', 'Mouth', 'Sloth', 'Sid', 'Brand', 2);\n new Questions('cult', 'In The Princess Bride, Buttercup knew it was Westley when he said what phrase to her?', 'Where you go I go', 'As I do hope you love me', 'As you wish', 'With your permission', 3);\n new Questions('scifi', 'In Back to the Future, how fast does Doc Brown tell Marty McFly he needs to drive in order to time travel in The DeLorean?', '66 mph', '77 mph', '88 mph', '99 mph', 3);\n new Questions('scifi', 'In E.T. the Extra-Terrestrial, what colorful candy did Elliot leave in a trail to attract E.T.?', 'Skittles', 'Reese\\'s Pieces','M&M\\'s', 'Runts', 2);\n new Questions('magic', 'In the Labyrinth, what animal does the Goblin King transform into?', 'Owl', 'Cat', 'Dog', 'Spider', 1);\n new Questions('magic', 'In Willow, the main character was not always a powerful sorcerer; what was he beforehand?', 'Farmer', 'Fisher', 'Baker', 'Shopkeeper', 1);\n new Questions('magic', 'In The NeverEnding Story, what was the name of Bastion\\'s luckdragon?', 'Troy', 'Artayu', 'Falkor', 'Jaryth', 3);\n new Questions('magic', 'In Clash of the Titans, which titan does Perseus kill to save Andromeda?', 'Kraken', 'Uranus', 'Mars', 'Cronus', 1);\n new Questions('action', 'Bruce Willis was paid an \"unheard of\" sum of money to star in Die Hard. How much was it?', '$3 Million', '$4 Million', '$5 Million', '$6 Million', 3);\n new Questions('action', 'Name That Movie: \"Son, your ego is writing checks your body can\\'t cash!\"', 'Lethal Weapon', 'Top Gun', 'Bloodsport', 'Beverly Hills Cop', 2);\n new Questions('horror', 'What was the first movie to win an Academy Award for Best Makeup?', 'An American Werewolf in London', 'The Evil Dead', 'Halloween II', 'Friday the 13th', 1);\n new Questions('horror', 'What movie did Andy Warhol call, \"A Clockwork Orange of the 1980s?\"', 'A Nightmare on Elm Street', 'Re-Animator', 'Christine', 'Videodrome', 4);\n new Questions('horror', 'Who did Steven Spielberg initially ask to write the Poltergeist script?', 'John Carpenter', 'Tobe Hooper', 'Stephen King', 'Dario Argento', 3);\n new Questions('cult', 'How many times was the name \"Heather\" said during the movie Heathers?', '70', '80', '90', '100', 3);\n new Questions('cult', 'David Lynch\\'s Blue Velvet contains subtle references to which historical figure\\'s assassination?', 'John F. Kennedy', 'Abraham Lincoln', 'Archduke Franz Ferdinand', 'Martin Luther King Jr.', 2);\n new Questions('cult', 'In the original script of Bill & Ted\\'s Excellent Adventure, the time machine was a _____?', 'Treadmill', 'Van', 'Closet', 'Hot Tub', 2);\n new Questions('cult', 'Which movie on IMDB is rated out of 11 instead of 10?', 'Ghostbusters', 'RoboCop', 'Scarface', 'This is Spinal Tap', 4);\n new Questions('chevy', 'How many National Lampoon\\'s Vacation movies came out in the 80s?', 1, 2, 3, 4, 3);\n new Questions('chevy', 'The Griswald family win a trip to Europe on what game show?', 'The Price Is Right', 'You Bet Your Life', 'Pig In A Poke', 'Wacky Wally World', 3);\n new Questions('chevy', 'In National Lampoon\\'s European Vacation, what Monty Python actor do the Griswalds literally keep running into?', 'Eric Idle', 'John Cleese', 'Terry Gilliam', 'Terry Jones', 1);\n new Questions('chevy', 'Which Cheers actor was in the movie Fletch with Chevy Chase?', 'Woody Harrelson', 'Kelsey Grammer', 'George Wendt', 'Ted Danson', 3);\n new Questions('cult', 'Who did not star in the 1982 classic, Fast Times at Ridgemont High?', 'Sean Penn', 'Forest Whitaker', 'Kevin Kline', 'Nicolas Cage', 3);\n new Questions('chevy', 'What 1980s movie did Chevy Chase turn down a leading role in?', 'Airplane', 'American Gigolo', 'Stir Crazy', 'Private Benjamin', 2);\n new Questions('chevy', 'What country were Emmett Fitz-Hume and Austin Millbarge sent to in Spies Like Us?', 'Saudi Arabia', 'Iran', 'Pakistan', 'Afghanistan', 3);\n new Questions('cult', 'In Scarface, Tony Montana came to America from which country?', 'Columbia', 'Puerto Rico', 'Italy', 'Cuba', 4);\n new Questions('chevy', 'What movie did Chevy Chase star in with Gregory Hines?', 'Deal Of The Century', 'The Couch Trip', 'Running Scared', 'Modern Problems', 1);\n new Questions('action', 'Which popular wrestler starred in the movie They Live?', 'Hulk Hogan', 'Andre The Giant', '\"Rowdy\" Roddy Piper', 'Jimmy \"Superfly\" Snuka', 3);\n new Questions('magic', 'What quintessential 80s rockband performed the soundtrack for Highlander?','Survivor', 'Rush', 'Journey', 'Queen', 4);\n new Questions('cult', 'In Real Genius, what does Professor Hathaway hate the smell of?', 'Coffee', 'Dirty Sneakers','Popcorn', 'Hairspray', 3);\n new Questions('magic', 'Who composed the film score for Beetlejuice?', 'John Williams', 'Hans Zimmer', 'Danny Elfman', 'Harold Faltimimer', 3);\n new Questions('action', 'What type of bird call was used to create the Predator\\'s click noise?', 'Wood Pecker', 'Crow', 'Blue Jay', 'cockatoo', 2);\n new Questions ('action', 'In Big Trouble in Little China, what must the sorceror do to retrieve his physical form?', 'Marry a green eyed girl', 'Sacrifice a pure woman', 'Bring back an ancestor from the dead', 'Kill a dragon', 1);\n new Questions('action', 'What future date does The Running Man take place in?', '2020', '2001', '2033', '2017', 4);\n new Questions('action', 'In Die Hard, what special gift does Riggs give Murtaugh at the end of the movie?', 'A special forces patch from his Army uniform', 'An unfired bullet', 'The bullet he was shot with during the movie', 'A zippo lighter he recieved from his deceased wife', 2);\n new Questions ('cult', 'Complete this famous line from Mad Max, Road Warrior: \"A fella, a quick fella, might have a weapon under there it would be a shame if I had to..\"', 'take off his hand', 'serve him to the snake', 'pin his head to the panel', 'slit his throat', 3);\n new Questions ('magic', 'What is the name of Honeythorn Gump\\'s fairy friend that accompanies them on their adventure in Legend?', 'Oona', 'Lilly', 'Asteria','Elvina', 1);\n new Questions ('cult', 'In ending number one of Clue, who killed the cook?', 'Miss Scarlet','The Butler', 'Yvette', 'Professor Plum', 3);\n new Questions ('chevy', 'What unwanted gift did Clark receive as his bonus during National Lampoon\\'s Christmas Vacation?', 'A yearly subscription to Time magazine', 'A yearly subscription to a Jelly of the Month Club', 'A really nice card', 'A designer set of towels', 2);\n new Questions('chevy', 'What is Chevy Chase\\'s real name?', 'Christopher', 'Cornelius', 'Cameron', 'Colton', 2);\n new Questions('horror', 'How many Evil Dead sequels were made?', '1', '2', '3', '4', 2);\n new Questions('chevy', 'Which Las Angeles Lakers player made an appearance in the movie Fletch?', 'Magic Johnson', 'Kareem Abdul-Jabbar', 'James Worthy', 'A.C. Green', 2);\n new Questions('chevy', 'In the movie Fletch, Irwin Fletcher published articles for the Las Angeles Times under which pseudonym?', 'Ann Landers', 'Mark Twain', 'Jane Doe', 'Busy Body', 3);\n new Questions('horror', 'Chucky first appeared in which 80s horror film?', 'Good Guy', 'Child\\'s Play', 'Sleep Tight', 'Let\\'s Play', 2);\n new Questions('horror', 'Which of the following is not a 1980s horror film?', 'The Stuff', 'The Blob', 'The Gate', 'The Slime', 4);\n new Questions('horror', 'In the 1983 movie The Dead Zone, Christopher Walken\\'s character has what special power?', 'He can see the future', 'He can see dead people', 'He can become invisible', 'He can kill people with his mind', 1);\n new Questions('horror', 'What model car was Christine in the 1983 John Carpenter movie?', '1958 Plymouth Fury', '1954 Buick Skylark', '1957 Ford Thunderbird', '1955 Chrysler 300', 1);\n}","title":""},{"docid":"3280024f440f51c1ad5e5f582e8ead5f","score":"0.6943061","text":"function generateQuestion(){\n if(questions.length === 0) {\n // If there are no quotes remaining, triggers end of game\n handleEndOfGame();\n } else {\n randomNumber = generateRandomNumber();\n $('#question').empty().append(questions[randomNumber].question);\n $('#option1').empty().append(questions[randomNumber].option1);\n $('#option2').empty().append(questions[randomNumber].option2);\n $('#option3').empty().append(questions[randomNumber].option3);\n $('#option4').empty().append(questions[randomNumber].option4);\n $('#questionContainer').fadeIn(1000); \n }\n }","title":""},{"docid":"67fdd3185d08106c999bdd09632fa170","score":"0.6941443","text":"function initQuestion() {\r\n /* Question array */\r\n var q = [\"This is a Debian derived Linux distribution managed and funded by the Offensive Security Ltd, designed for digital forensics and penetration testing. Which is this very famous OS majorly developed for Hackers and software testers?\", \"What is DDoS?\", \"The word X is a combination of the words “robot” and “network”. It is a number of Internet-connected devices, each of which is running one or more bots. This can be used to perform DDoS attacks, steal data, send spam. Identify the word X?\"];\r\n\r\n /* Answer array */\r\n var a = [\"kalilinux\", \"distributeddenialofservice\", \"botnet\"];\r\n\r\n /* Make a new array containing the question objects */\r\n var question = [];\r\n for (var i = 0; i < q.length; i++) {\r\n question.push(new Question(q[i], a[i]));\r\n }\r\n return question;\r\n}","title":""},{"docid":"baaa0a2b2576819b11070d7b5f52da7f","score":"0.69409657","text":"function newGame(){\n var create1 = new genQuestion(question1);\n var create2 = new genQuestion(question2);\n var create3 = new genQuestion(question3);\n var create4 = new genQuestion(question4);\n var create5 = new genQuestion(question5);\n}","title":""},{"docid":"9d54bd67dd29759f9873917c64541c5b","score":"0.6936279","text":"function questionSetup(current, answers, correct){\n \n this.current = current;\n this.answers= answers;\n this.correct = correct;\n \n}","title":""},{"docid":"482210a0c6e388ca17c61f3e3a44d832","score":"0.6915367","text":"function newQuestion(){\r\n\t// remove stylings\r\n\t$('.correct').removeClass('correct');\r\n\t$('.wrong').removeClass('wrong');\r\n\t$('.disabled').removeClass('disabled');\r\n\t$('.selected').removeClass('selected');\r\n\r\n\t// hide the correct answer box\r\n\t$('#dontknowbox').hide();\r\n\tviewModel.currentAnswerAsText('');\r\n\r\n\t// reset current and user values\r\n\tviewModel.currentCardPosition(null);\r\n\tviewModel.currentCardValue(null);\r\n\tviewModel.currentCardSuit(null);\r\n\tviewModel.userCardSuit(null);\r\n\tviewModel.userCardValue(null);\r\n\tviewModel.userCardPosition(null);\r\n\tviewModel.currentCorrect(false);\r\n\r\n\t// reset question styles visible\r\n\tviewModel.questionStyleAVisible(false);\r\n\tviewModel.questionStyleBVisible(false);\t\r\n\tviewModel.questionStyleCVisible(false);\r\n\tviewModel.questionStyleDVisible(false);\r\n\r\n\r\n\t// take card from bank\r\n\tvar x = viewModel.currentBank()[0];\r\n\r\n\t// set position, value and suit of this card\r\n\tviewModel.currentCardPosition(x);\r\n\tviewModel.currentCardValue(viewModel.stack()[x][0]);\r\n\tviewModel.currentCardSuit(viewModel.stack()[x][1]);\r\n\r\n\t// choose what type of question to use:\r\n\tviewModel.randomSeed((Math.floor((Math.random() * 4) + 1)));\r\n\t// viewModel.randomSeed(1); // debug\r\n\t\r\n\t// make that question visible\r\n\tswitch (viewModel.randomSeed()) {\r\n\t\tcase 1: // user picks position of given card\r\n\t\t\tviewModel.questionStyleAVisible(true);\r\n\t\tbreak;\r\n\t\tcase 2: // user picks card at given position \r\n\t\t\tviewModel.questionStyleBVisible(true);\t\r\n\t\tbreak;\r\n\t\tcase 3: // user gives card before a given card\r\n\t\t\tviewModel.questionStyleCVisible(true);\r\n\t\tbreak;\r\n\t\tcase 4: // user gives card that is after a given card\r\n\t\t\tviewModel.questionStyleDVisible(true);\r\n\t\tbreak;\r\n\t}\r\n\r\n\t// make the check button visible and the next button not\r\n\tviewModel.nextVisible(false);\r\n\tviewModel.checkVisible(true);\r\n\tsaveDataToLocalStorage()\r\n}","title":""},{"docid":"c7d3843a59299293ed03ad359f875323","score":"0.68536645","text":"newQuestion() {\r\n return {\r\n \"nb_answers\": 0,\r\n \"allowed_emojis\": [],\r\n \"objs\": {\r\n \"q\": {},\r\n \"e\": {}\r\n },\r\n \"results\": [],\r\n \"winner\": {},\r\n \"messages\": {\r\n \"response\": \"\",\r\n \"question\": \"\",\r\n },\r\n \"randomized\": false,\r\n \"success\": false\r\n }\r\n }","title":""},{"docid":"d195d23a8827cacd5ce6263911711ab7","score":"0.68338555","text":"setTheNewQuestion() {\n const englishWords = this.mapperOfEnglishWords();\n const deutschWords = this.mapperOfDeutschWords();\n const map = this.mapper();\n const question = englishWords[Math.floor(Math.random() * englishWords.length)];\n this.correctAnswer = map[question];\n const wrongAnswers = deutschWords.filter(item => item !== this.correctAnswer);\n for (let index = 0; index < 4; index++) {\n let randomValue = Math.floor(Math.random() * wrongAnswers.length);\n let aWrongAnswer = wrongAnswers[randomValue];\n wrongAnswers.splice(randomValue, 1);\n this.fillTheButtonText(\"#ChoiceButton\" + index, aWrongAnswer);\n }\n\n this.correctAnswerIndex = Math.floor(Math.random() * 4);\n this.fillTheButtonText(\"#ChoiceButton\" + this.correctAnswerIndex, this.correctAnswer);\n\n this.question.innerHTML = question;\n }","title":""},{"docid":"80eff6866d9eb383de923f16e24e5f73","score":"0.6810776","text":"function populate_quiz_question(){\n // Populate qns number out of total questions, e.g. Q 1 of 10\n populate_question_of_total_question();\n\n // Populate title of question\n populate_question_title();\n\n // Start the loop through the quiz questions\n console.log(\"Current question count = \" + current_qns_count);\n loop_through_quiz_questions();\n}","title":""},{"docid":"bcc6b0d386e88852b97488314929c689","score":"0.68083346","text":"function setNextQuestions() {\n resetState()\n //randomize based on the questions variable index\n showQuestion(shuffledQuestions[currentQuestionIndex])\n}","title":""},{"docid":"645a838469f8ad0e94cd76195d15988c","score":"0.6803702","text":"function newQuestion() {\n console.log(\"New question requested\");\n\n var questionTypes = [SimpleQuestion, ChoiceQuestion];\n\n // Load the next question\n var question = new questionTypes[Math.floor(Math.random() * questionTypes.length)]();\n question.renderQuestion();\n}","title":""},{"docid":"873123cafeac2e73960f326885c26ffb","score":"0.6798145","text":"function populateQuestions() {\n if (\n easyCountdown <= 0 ||\n hardCountdown <= 0 ||\n questionCount === questions.length\n ) {\n clearQuestions();\n } else {\n questionNumber.textContent = `Question ${questionCount + 1}/5`;\n questionHeader.textContent = questions[questionCount].title;\n populateButtons();\n }\n}","title":""},{"docid":"d4beab75567e7cfd0c3c880442218a8a","score":"0.67921925","text":"function populateQuiz() {\n // A. Keep count of questions presented\n questionsAsked++;\n \n // B. Pull current question and corresponding answer options\n let quizData = questionsArray[currentQuestion];\n\n questionNumber = quizData.questionNum;\n questionCount.textContent = `Question ${questionNumber}`;\n questionPlaceholder.textContent = quizData.question;\n answerAPlaceholder.textContent = quizData.A;\n answerBPlaceholder.textContent = quizData.B;\n answerCPlaceholder.textContent = quizData.C;\n answerDPlaceholder.textContent = quizData.D;\n answerEPlaceholder.textContent = quizData.E;\n }","title":""},{"docid":"592cef64502ad90f346b44c6e07ec76b","score":"0.6784942","text":"function Quiz(questions){\n this.score = 0;\n this.questions = questions;\n this.questionIndex = 0;\n}","title":""},{"docid":"057abe32897a79ca1a387c59216331ea","score":"0.67785996","text":"function newQuestion() {\n \n indexQ = Math.floor(Math.random()*questionPool.length);\n console.log(\"indexQ is \"+indexQ)\n console.log(\"pool length is \"+questionPool.length)\n questionText.innerText = JSON.stringify(questionPool[indexQ].question);\n choiceText1.innerText = JSON.stringify(questionPool[indexQ].choice1)\n choiceText2.innerText = JSON.stringify(questionPool[indexQ].choice2)\n choiceText3.innerText = JSON.stringify(questionPool[indexQ].choice3)\n choiceText4.innerText = JSON.stringify(questionPool[indexQ].choice4)\n\n \n }","title":""},{"docid":"f9628563122e4ea6108ae2470fe1e1d4","score":"0.6775914","text":"function populateQ() {\n if (currentTime > 0 && questionIndex < questionArr.length) {\n \n // Populates question\n changingTxt.textContent = questionArr[questionIndex].q;\n \n // Populates multiple choice & assigns values\n for (var i=0; i < mcBtnArr.length; i++) {\n mcBtnArr[i].textContent = questionArr[questionIndex].choices[i];\n } \n } \n}","title":""},{"docid":"806a6f6eb1729af4cef4b13fdb0b3bbc","score":"0.6774283","text":"function populateQuesAndAns(eachQuestion) {\n $('#question-view').text(eachQuestion.question);\n for (var i = 0; i < eachQuestion.multipleChoice.length; i++) {\n $($('.choice')[i]).text(eachQuestion.multipleChoice[i]);\n }\n quesCount += 1;\n $('#question-status').text(quesCount + \" Question out of 10\");\n displayResult(count);\n $('.next').hide();\n\n }","title":""},{"docid":"1d9e87f3de35ca0caf38d726066974fb","score":"0.67520386","text":"function init() {\n // set the index of qArray to the first question in the array.\n idx = 0;\n // reset the score to 0\n scores = 0;\n // build a new set of randomly sorted questions for the user to answer\n buildQuestionsArray();\n }","title":""},{"docid":"daf58493001fcc279c551ebf74ed0212","score":"0.67499244","text":"function generate(){\n\t//get form values\n\tdifficulty = document.getElementById('difficulty').value;\n\tnumquestions = document.getElementById('numQuestions').value;\n\tif(difficulty == \"chapter\"){\n\t\tnumquestions = 50;\n\t}\n\t//check if # of questions is too large\n\tif(difficulty == \"beginner\" && numquestions > beginner.length){\n\t\tnumquestions = beginner.length;\n\t\twindow.alert(\"Test size too large. Lowering number of questions.\");\n\t}\n\tif(difficulty == \"simple\" && numquestions > simple.length){\n\t\tnumquestions = simple.length;\n\t\twindow.alert(\"Test size too large. Lowering number of questions.\");\n\t}\n\tif(difficulty == \"average\" && numquestions > average.length){\n\t\tnumquestions = average.length;\n\t\twindow.alert(\"Test size too large. Lowering number of questions.\");\n\t}\n\tif(difficulty == \"challenging\" && numquestions > challenging.length){\n\t\tnumquestions = challenging.length;\n\t\twindow.alert(\"Test size too large. Lowering number of questions.\");\n\t}\n\t//create an array of questions\n\tquestions = [];\n\t//try to prevent duplicate questions\n\tvar used = new Array();\n\tvar max;\n\tif(difficulty == \"beginner\"){\n\t\tmax = beginner.length;\n\t}\n\tif(difficulty == \"simple\"){\n\t\tmax = simple.length;\n\t}\n\tif(difficulty == \"average\"){\n\t\tmax = average.length;\n\t}\n\tif(difficulty == \"challenging\"){\n\t\tmax = challenging.length;\n\t}\n\tfor(var i = 0; i < max; i ++){\n\t\tused[i] = false;\n\t}\n\t//loop to fill questions array\n\tfor(var i = 0; i < numquestions; i ++){\n\t\tvar rand;\n\t\tif(difficulty == \"beginner\"){\n\t\t\tdo{ \n\t\t\t\trand = Math.floor(Math.random() * beginner.length);\n\t\t\t}\n\t\t\twhile(used[rand]);\n\t\t\tused[rand] = true;\n\t\t\tvar thisquestion = beginner[rand];\n\t\t}\n\t\telse if(difficulty == \"simple\"){\n\t\t\tdo{ \n\t\t\t\trand = Math.floor(Math.random() * simple.length);\n\t\t\t}\n\t\t\twhile(used[rand]);\n\t\t\tused[rand] = true;\n\t\t\tvar thisquestion = simple[rand];\n\t\t}\n\t\telse if(difficulty == \"average\"){\n\t\t\tdo{ \n\t\t\t\trand = Math.floor(Math.random() * average.length);\n\t\t\t}\n\t\t\twhile(used[rand]);\n\t\t\tused[rand] = true;\n\t\t\tvar thisquestion = average[rand];\n\t\t}\n\t\telse if(difficulty == \"challenging\"){\n\t\t\tdo{ \n\t\t\t\trand = Math.floor(Math.random() * challenging.length);\n\t\t\t}\n\t\t\twhile(used[rand]);\n\t\t\tused[rand] = true;\n\t\t\tvar thisquestion = challenging[rand];\n\t\t}\n\t\telse if(difficulty == \"chapter\"){\n\t\t\tif(i < 11){ // 10 beginner\n\t\t\t\trand = Math.floor(Math.random() * beginner.length);\n\t\t\t\tvar thisquestion = beginner[rand];\n\t\t\t}\n\t\t\telse if(i >= 11 && i < 26){ // 15 simple\n\t\t\t\trand = Math.floor(Math.random() * simple.length);\n\t\t\t\tvar thisquestion = simple[rand];\n\t\t\t}\n\t\t\telse if(i >= 26 && i < 46){ // 20 average\n\t\t\t\trand = Math.floor(Math.random() * average.length);\n\t\t\t\tvar thisquestion = average[rand];\n\t\t\t}\n\t\t\telse if(i >= 46 && i < 50){ // 5 challenging\n\t\t\t\trand = Math.floor(Math.random() * challenging.length);\n\t\t\t\tvar thisquestion = challenging[rand];\n\t\t\t}\n\t\t}\n\t\tquestions.push(thisquestion);\n\t}\n\t//output\n\tvar out = '<div class=\"adminDataSection nohover\" style=\"width:97.5%; padding-left:5%; padding-right:5%; padding-top:2.5%; padding-bottom: 2.5%\">';\n\tfor(var i = 0; i < numquestions; i ++){\n\t\tout = out + \"<form id='question\" + (i+1) + \"'><div class='form-group'><label>\" + (i+1) + \". \" + questions[i][0] + \"</label><br>\";\n\t\tout = out + \"<label><input type='radio' name='answer\" + (i+1) + \"' value='1'>\" + questions[i][1] + \"</label><br>\";\n\t\tout = out + \"<label><input type='radio' name='answer\" + (i+1) + \"' value='2'>\" + questions[i][2] + \"</label><br>\";\n\t\tout = out + \"<label><input type='radio' name='answer\" + (i+1) + \"' value='3'>\" + questions[i][3] + \"</label><br>\";\n\t\tout = out + \"<label><input type='radio' name='answer\" + (i+1) + \"' value='4'>\" + questions[i][4] + \"</label><br>\";\t\t \n\t\tout = out + \"</div></form>\";\n\t}\n\tout = out + \"<button id='submitButton' class='btn btn-primary' onclick='submitAnswers()'>Score</button><form target='hideframe' id='scoreForm' style='display:none;' method='post'><input type='number' id='scoreValue' name='scoreValue'><input type='number' id='testNumber' name='testNumber'></form></div>\";\n\tcontent.innerHTML = out;\n}","title":""},{"docid":"a6014c5331f4e31247f63fc5c7c8cf1b","score":"0.6740833","text":"function resetQuestions() {\n $('.autogenerate').remove();\n counter = 0;\n}","title":""},{"docid":"aae21eed7ffc68eec0fb2c06d71b677f","score":"0.6740296","text":"function repopulateQuestion(data) {\n\n\tif(data.template) {\n\t\trepopulateTemplateQuestion(data);\n\t} else {\n\t\trepopulateIndividualQuestion(data);\n\t}\n}","title":""},{"docid":"f8645303f474486adc0ac19986150ff5","score":"0.6739203","text":"function createQuestions() {\n\t $('#fade').fadeIn('slow');\n\t// unselect all radiobuttons at the start\n\tfor (var i = 0; i<4; i++) {\n\t\t$(\"#answer\" + i).prop('checked', false);\n\t}\n\t$(\"#questions\").text(allQuestions[questionNum].question);\n\tcreateOptions();\n}","title":""},{"docid":"a5d2e4ef15d9aef2e3b79af88161c17f","score":"0.6730938","text":"function Quiz(questions) {\n this.score = 0;\n this.questions = questions;\n this.questionIndex = 0;\n}","title":""},{"docid":"a5d2e4ef15d9aef2e3b79af88161c17f","score":"0.6730938","text":"function Quiz(questions) {\n this.score = 0;\n this.questions = questions;\n this.questionIndex = 0;\n}","title":""},{"docid":"c84b9dd7fedf2bae598fbf4a8778b8cb","score":"0.67301095","text":"function generateQuestions() {\n finalEl.style.display = \"none\";\n if (currentQuestionIndex === finalQuestionIndex) {\n return displayScore();\n }\n var currentQuestion = questions[currentQuestionIndex];\n questionEl.innerHTML = \"<p>\" + currentQuestion.question + \"</p>\";\n button1.innerHTML = currentQuestion.choice1;\n button2.innerHTML = currentQuestion.choice2;\n button3.innerHTML = currentQuestion.choice3;\n button4.innerHTML = currentQuestion.choice4;\n}","title":""},{"docid":"ebc981cbf6b995cb4102c54453b56587","score":"0.6728595","text":"InitializeQuestions(){\n this.getOrderedQuestions()\n }","title":""},{"docid":"7bdd5a1f64496b255b35f0e8c9343ae1","score":"0.67273176","text":"function nextRandomQuestion(){\r\n \r\n //set of questions\r\nvar q1 = new QuestionSet('Where is Assam Located?',\r\n ['India', 'China', 'Bangladesh'],\r\n 0);\r\nvar q2 = new QuestionSet('Who is the current President of USA?',\r\n ['Obama', 'Bill Clinton', 'Donald Trump'],\r\n 2);\r\nvar q3 = new QuestionSet('Elun Musk is a/an :', \r\n ['Dancer', 'Athlete', 'Entrepreneur'],\r\n 2);\r\n \r\n//storing the questions in an array\r\nvar questions = [q1,q2,q3];\r\n \r\n//chooisng a random question\r\nvar n = Math.floor(Math.random(questions)*questions.length);\r\n\r\nquestions[n].DisplayQuestions(); //Displays Questions\r\n\r\nvar answer = prompt('Please give your Answer'); //promts user to input the correct option\r\n//Quits the game if user types 'exit'\r\nif(answer === 'exit'){\r\n \r\n console.log('---------------------------------');\r\n console.log('Refresh the page to Play the Quiz'); \r\n console.log('---------------------------------'); \r\n }\r\n else{\r\n \r\n questions[n].CheckAnswer(parseInt(answer), KeepScore); // Displays Correct Answer\r\n nextRandomQuestion();\r\n }\r\n}","title":""},{"docid":"7c8fb4411ed5bc75273f47113f468a5a","score":"0.6719887","text":"function setNextQuestion() {\n resetquestion()\n questiondisplay(randomanswers[Current])\n}","title":""},{"docid":"1e1e9299b8e05618f85ab7d181973341","score":"0.67028195","text":"function generateQuestion() {\r\n\t\t// Randomly select assembled/combined item\r\n\t\tvar keysArr = [], \r\n\t\trandomItemName = '',\r\n\t\trandomItemObj = {};\r\n\r\n\t\tkeysArr = Object.keys(itemObj.combined);\r\n\t\trandomItemName = keysArr[Helper.randomInt(0, keysArr.length - 1)];\r\n\t\trandomItemObj = itemObj.combined[randomItemName];\r\n\r\n\t\tquestionArchive.push(\r\n\t\t\tnew Question({\r\n\t\t\t\titemName: randomItemName,\r\n\t\t\t\tmaterials: randomItemObj.components,\r\n\t\t\t\treversed: (Helper.randomInt(0, 1) === 0), // Determine the quiz type\r\n\t\t\t\trecipe: getRecipe(randomItemObj.components, randomItemObj.cost),\r\n\t\t\t}).createWrongItems() // Create wrong set of items and store it in question object.\r\n\t\t);\r\n\r\n\t}","title":""},{"docid":"545b659948a4cf4f5abed57c4423365c","score":"0.6696466","text":"populateQuestions(questionsData) {\n\t\t//Iterate over questions data and make a new TriviaQuestion for each question in the data\n\t\t$.each(questionsData, (index, question) => {\n\t\t\t//Add newly instantiated trivia question object to questions array\t\n\t\t\tthis.questionsList.push(new TriviaQuestion(question.question,\n\t\t\t\tquestion.incorrect_answers,question.correct_answer));\t\t\t\t\n\t\t});\n\n\t\t//Now in the questionPhase\n\t\tthis.updateGameState('questionPhase');\n\t}","title":""},{"docid":"f204d08e7cba0440f07c5844691d08d7","score":"0.6690915","text":"function Quiz(questions) {\n this.score = 0;\n this.questions = questions;\n this.questionIndex = 0;\n}","title":""},{"docid":"30add9442f4beeac8d93d939a86a03cf","score":"0.66893685","text":"function newQuestion() {\n $(\"#message\").empty();\n $(\"#correct-answer\").empty();\n $(\"#image\").hide();\n $(\"#fun-fact\").hide();\n $(\"#timer-counter\").show();\n answered = true;\n\n $(\"#current-question\").html(\"Question \" + (currentQuestion + 1) + \" of \" + questionsArray.length);\n $(\".question\").html(questionsArray[currentQuestion].question);\n\n // tried to set up where questions get set up randomly, failed miserable. will try again after turning in assignment \n // for (var j = 0; j < questionCount; j++ ) {\n // var randomQuestion = questionsArray.splice (\n // Math.floor(Math.random() * questionsArray.length), 1)[0];\n // (existingQuestions());\n // // Add the question to the tracker\n // questionTracker.push(randomQuestion);\n // }\n \n // // If the current random number already exists in the tracker, return true\n // function existingQuestions() {\n // for (var j = 0; j < questionTracker.length; j++) {\n // if (questionTracker[j] === randomQuestion) {\n // return true;\n // }\n // }\n // return false;\n // }\n for (var i = 0; i < 4; i++) {\n var choices = $(\"<div>\");\n choices.text(questionsArray[currentQuestion].choicesArray[i]);\n choices.attr({\n \"data-index\": i\n });\n choices.addClass(\"thisChoice\");\n $(\".answer-choices\").append(choices);\n }\n countdown();\n //clicking an answer will pause the time \n $(\".thisChoice\").on(\"click\", function () {\n userSelect = $(this).data(\"index\");\n clearInterval(time);\n $(\"#timer-counter\").hide();\n answers();\n });\n }","title":""},{"docid":"451162481b102dabbad3f6918fde7720","score":"0.6684085","text":"function setQuestion() {\n nextQuestion(questionList[firstQuestion])\n\n}","title":""},{"docid":"2d95540c02433003ea13406bc638f624","score":"0.66763985","text":"function newQuestion() {\n if (index >= questionAnswerArray.length) {\n endQuiz();\n } else {\n currentQuestion = questionAnswerArray[index];\n question.textContent = currentQuestion.Question;\n button1.textContent = currentQuestion.Answers[0];\n button2.textContent = currentQuestion.Answers[1];\n button3.textContent = currentQuestion.Answers[2];\n button4.textContent = currentQuestion.Answers[3];\n }\n}","title":""},{"docid":"477c930419ba34fecd52aea2c59f8171","score":"0.66757387","text":"function newQuestion(){\n\t\t$(\"#message\").empty();\n\t\t$(\"#correctedAnswer\").empty();\n\t\t$(\"#gif\").hide();\n\t\t$(\"#gifCaption\").hide();\n\t\tanswered = true;\n\t\t\n\t\t//This function displays the new question\n\t\tif(currentQuestion){triviaQuestions.splice(currentQuestion-1, 1);}\n\t\tcurrentQuestion = Math.round(Math.random()*(triviaQuestions.length-1));\n\t\tconsole.log(triviaQuestions);\n\t\t$(\"#currentQuestion\").html(\"Pregunta \" + ((parseInt(correctAnswer)+parseInt(incorrectAnswer)+parseInt(unanswered))+1) + \" de \" + ((document.getElementById(\"limite\").value)));\n\t\t$(\".question\").html(triviaQuestions[currentQuestion].question);\n\n\t\t//This function displays the new questions's answer options in multiple choice type\n\t\tfor(var i = 0; i <= 5; i++){\n\n\t\t\tvar choices = $(\"<div>\");\n\t\t\tchoices.text(triviaQuestions[currentQuestion].answerList[i]);\n\t\t\tchoices.attr({\"data-index\": i });\n\t\t\tchoices.addClass(\"thisChoice\");\n\t\t\t$(\".answerList\").append(choices);\n\t\t}\n\n\t\t//This sets the timer\n\t\tcountdown();\n\n\t\t//When user clicks on n answer this will pause the time and display the correct answer to the question \n\t\t$(\".thisChoice\").on(\"click\",function(){\n\t\t\t\tuserSelect = $(this).data(\"index\");\n\t\t\t\tclearInterval(time);\n\t\t\t\tanswerPage();\n\t\t\t});\n\t\t}","title":""},{"docid":"12dad05d413c7b1010f660aa291f8d61","score":"0.6669103","text":"function loadQuestions() {\n\n\t\tfor ( var i=0; i < myQs.length; i++ ) {\n\t\t\tquestionArr.push( new Question( myQs[i].q, myQs[i].a, myQs[i].correctA ) );\n\t\t}\n\t\t//console.log(questionArr);\n\t}","title":""},{"docid":"35fe551f1db2aeb29dd6b51f78634123","score":"0.6658865","text":"function newQuestion() {\n $(\".click-btn\").hide();\n number = 16;\n question = questionsArray[index];\n console.log(question);\n\n runTimer();\n\n $(\".image-display\").empty();\n\n $(\".question-display\")\n .empty()\n .append(questionsArray[index]);\n\n $(\"#answer-1\")\n .empty()\n .append(answers[index][0]);\n\n $(\"#answer-2\")\n .empty()\n .append(answers[index][1]);\n\n $(\"#answer-3\")\n .empty()\n .append(answers[index][2]);\n\n $(\"#answer-4\")\n .empty()\n .append(answers[index][3]);\n }","title":""},{"docid":"4e301e7ae46a45e0d4ed102bb16df0b8","score":"0.66222835","text":"function populateQuestions() {\n \n $(\"#questionNumber\").html(\"<p>Question \" + getQuestion[counter].questionNumber + \" out of 10</p>\");\n $(\"#question\").text(getQuestion[counter].question);\n $(\"#choiceBox\").append(\"<button class=\\\"clickMe\\\">\" + getQuestion[counter].options[0] + \"</button>\",\n \"<button class=\\\"clickMe\\\">\" + getQuestion[counter].options[1] + \"</button>\");\n $(\"#choiceBox\").append(\"<button class=\\\"clickMe\\\">\" + getQuestion[counter].options[2] + \"</button>\",\n \"<button class=\\\"clickMe\\\">\" + getQuestion[counter].options[3] + \"</button>\")\n }","title":""},{"docid":"7f7c822d6429495e7437226c237240ff","score":"0.6621603","text":"constructor(questions) {\n this.score = 0;\n this.questions = questions;\n this.questionIndex = 0;\n}","title":""},{"docid":"c34ee8f1001569ba68c1beeada7082bb","score":"0.6614671","text":"function populate() {\r\n// alert(\"function populate started\");\r\n// this function gives each of the answers 0 points so if someone doesn't answer a question\r\n// the whole thing will continue to work\r\n for(var i=0; i<10; i++) { Quest[i]=0; }\r\n}","title":""},{"docid":"e43de237fcaae8d85bed76462f82d049","score":"0.66036505","text":"function Quiz(questions) {\n this.questions = questions;\n\n this.userAnswers = [];\n}","title":""},{"docid":"c12aa52d34827ecfd7008c63f3058e05","score":"0.6602285","text":"function setNextQuestion() {\n //resetState() when i removed questions started up\n showQuestion()\n}","title":""},{"docid":"cace6dc3560282c6af9963e0a190f32c","score":"0.6600927","text":"function makeQuestions(questions){\n $scope.questions = questions;\n }","title":""},{"docid":"9405ea0c58e685c0d892deb723d8be7f","score":"0.65982234","text":"function questionsManager()\n {\n // Get the current TestManager instance\n var answers = app.getTest().getQuestionBank(),\n answersLength = answers.length;\n \n // TODO: Update this description\n incorrectAnswers = [],\n \n // TODO: Update this description\n correctAnswers = [];\n\n // Check if interaction data exists\n for (var x = 0; x < answersLength; x++)\n {\n // Build in/correct answer lists to pass\n // Since the questions are manually graded,\n // just push everything to the correct list\n if (answers[x].learner_response !== undefined)\n {\n correctAnswers[x] = {\n \"answer\" : answers[x].learner_response,\n \"index\" : answers[x].id\n };\n }\n }\n \n if (correctAnswers.length > 0)\n {\n //Build responses\n buildSlideShow({\n \"correctAnswers\" : correctAnswers\n }); \n }\n else\n {\n buildSlideShow();\n }\n }","title":""},{"docid":"35a8a6a4b390c0cc2c75e18bbc343e72","score":"0.6595699","text":"function QuestionSet()\n{\n\tthis.start = new Array();\n\tthis.onTrail = new Array();\n\tthis.capture = new Array();\n\tthis.transport = new Array();\n\n\tthis.startUsed = new Array();\n\tthis.onTrailUsed = new Array();\n\tthis.captureUsed = new Array();\n\tthis.transportUsed = new Array();\n}","title":""},{"docid":"70b9db74196ff9eebb156eeb6a74ba34","score":"0.6594566","text":"function resetAnswers() {\n $(\"nextQ\").css(\"display\", \"none\");\n gameInProgress = true;\n contGame();\n questionIteration++;\n console.log(\"On interation \" + questionIteration);\n $(\"#answerOptions\").empty();\n changeQuestionsText(questionIteration);\n correctOption = questionsArrays[questionIteration][\"correct\"];\n //console.log(correctOption);\n}","title":""},{"docid":"3ca84f8f8aad78ed0c30399c8ff4e942","score":"0.6579937","text":"function createQuestions () {\n let q = questionCounter;\n if (q === questions.length) {\n console.log('button removed');\n } else {\n $('#question').text(questions[q].question);\n }\n}","title":""},{"docid":"a4f77e0ad113b29e543de5eaee31dff1","score":"0.6572392","text":"function question() {\n\t\t\t$('#questionNumber').text(questionCounter + ' / ' + totalQuestions)\n\t\t\t$('#stemQuestion').text(stemList[listIndex][1] + ' ');\n\t\t\t$('#answer').val('');\n\t\t\t$('#exampleVocabulary').text(stemList[listIndex][3]);\n\t\t\t$('#answer').focus();\n\t\t}","title":""},{"docid":"e114b9936217bfda66a23c45f8a18d7d","score":"0.6566742","text":"function loadPreviousQuestion() {\r\n //Decrement quentions index\r\n currentQuestion--;\r\n //remove last array value;\r\n score.pop();\r\n //Generate the question\r\n generateQuestions(currentQuestion);\r\n }","title":""},{"docid":"6ee29e5988e7c91bd1f6345a20d318b2","score":"0.6563854","text":"function questionReset() {\n\tfor (i = 0; i < 10; i++) {\n\t\t// console.log(questionsIndex);\n\t\t// console.log(junkyard);\n\t\tquestionsIndex.push(junkyard[i]);\n\t}\n\tfor (i = 0; i < 10; i++) {\n\t\tjunkyard.splice(junkyard[i], 1);\n\t}\n}","title":""},{"docid":"509e91844f6738e58c0e62266704335b","score":"0.6552508","text":"function buildQuestionArray() {\n\n for (let i = 0; i < questionAvailable; i++) {\n questionArray.push(eval(\"question\" + i));\n }\n\n // Shuffles question array\n shuffleArray(questionArray);\n}","title":""},{"docid":"4d269d92c0e7c5d284858a3a3d20cdff","score":"0.65462","text":"function loadPreviousQuestion() {\r\n //Decrement quentions index\r\n currentQuestion--;\r\n //remove last array value;\r\n score.pop();\r\n //Generate the question\r\n generateQuestions(currentQuestion);\r\n}","title":""},{"docid":"0a2ede7b70acf353188d365bd9db4d48","score":"0.6544964","text":"function generateQuestion() {\n let question = `<p class = 'question' >\n Question: ${store.questionNumber + 1} / 5 </p>\n <p>${store.questions[store.questionNumber].question}</p><p>SCORE:${\n store.score\n }/5</p>\n <form class = 'check-submited-answer'>`;\n for (\n let i = 0;\n i < store.questions[store.questionNumber].answers.length;\n i++\n ) {\n let newAnswers = store.questions[store.questionNumber].answers[i];\n question += ` <label>\n <input class = 'js-checkAnswer' type=\"radio\" name = 'radAnswer' value = '${newAnswers}'>\n <span id = 'focus' tabindex = '0'>${newAnswers}</span>\n </label>\n `;\n }\n question += `\n \n <div class = 'a-button-submit'>\n <button id = 'submit-button' tabindex = '0' class=\"next-button\" type=\"button\" value=\"submit\" hidden = 'true'> SUBMIT </button>\n </div>\n <div id = \"answer\" hidden> </div>\n </form>`;\n $('.Start').html('');\n $('.Start').html(question);\n}","title":""},{"docid":"47214fc50b620f690666d4a3794d64c0","score":"0.653825","text":"function resetQuestion() {\n $(\"#answers-area\").empty();\n $(\"#question-area\").empty();\n $(\".correct-ans\").empty();\n $(\"#correct-ans-image-one\").empty();\n }","title":""},{"docid":"9226d4c3f17fd140fc07380f82793a40","score":"0.653741","text":"function next_question() {\n // clear question\n $questions.empty();\n // clear #picks\n $picks.empty();\n return\n\n}","title":""},{"docid":"d838856e493602777716812d3ccd74c8","score":"0.6536722","text":"function nextQuestion() {\n setQuestionText()\n clearAnswers();\n buildAnswers();\n}","title":""},{"docid":"8a9a5e0e72480c48f00ab478d00f5f2f","score":"0.65348333","text":"constructor(options){\n this.options = options;\n //takes array from options_construct\n this.bookList = options[0]; //list of 0/1 values, first value is 'all'\n this.bookCount = this.countBooks(this.bookList);\n\n this.questionType = options[1]; // true is spoken, false is text\n this.questionCount = options[2]; // integer value, -1 is infinite\n this.questionTimer = options[3]; // integer value, -1 is no timer\n this.questionRepeat = options[4]; // false is no repeated values, true allows repeats\n\n this.answerType = options[5] // 0 no details, 1 is a break, 2 correct/incorrect, 3 is full\n this.answerTimer = options[6]; // integer value, -1 is no timer\n this.answerInput = options[7]; // 0 MC, 1 write-in, 2 MC w/ chapter, 3 write-in w/ chapter\n\n this.generalSound = options[8]; // false no sound, true has sound\n this.generalProgressBar = options[9]; // false no bar, true has bar\n this.generalTimer = options[10]; // false timer not displayed, true timer displayed\n\n this.proportions = this.generateProportion(this.bookCount, this.questionCount);\n\n //generate question list\n this.currentQuestion;\n this.currentQuestionBonus = false; //bonus question boolean flag\n\n //multiple choice options -> first value is blank\n this.currentTitles = [\"----\"];\n this.currentAuthors = [\"----\"];\n this.currentSources = [\"----\"];\n\n this.questionList = [];\n this.usedQuestions = [];\n this.generateQuestions(this.proportions);\n\n //user input tracker\n this.responseTracker = [];\n\n //initialize session stats\n this.stats = new statisticsTracker();\n\n }","title":""},{"docid":"f58e206907bba9da3c20ef12f4fba7f4","score":"0.6527583","text":"function questions() {\n let q = questions[runningQuestion];\n\n question.innerHTML = \"<p>\" + q.question + \"</p>\";\n choiceA.innerHTML = q.choiceA;\n choiceB.innerHTML = q.choiceB;\n choiceC.innerHTML = q.choiceC;\n choiceD.innerHTML = q.choiceD;\n}","title":""},{"docid":"342fb948836406f04f8d832fb9a398bd","score":"0.65250874","text":"function setQuestion(){\n // selects random question from var easy\n random = Math.floor(Math.random() * easy.length);\n current = easy[random]\n //question\n currentQuestion = current.question;\n // the 4 choices in order of their place in a for loop\n currentChoice0 = current.choice.choice0;\n currentChoice1 = current.choice.choice1;\n currentChoice2 = current.choice.choice2;\n currentChoice3 = current.choice.choice3;\n\n // the correct choice\n currentCorrectChoice = current.correctChoice;\n // id targets from html page\n showQuestion = document.getElementById(\"question\");\n showChoice0 = document.getElementById(\"choice0\");\n showChoice1 = document.getElementById(\"choice1\");\n showChoice2 = document.getElementById(\"choice2\");\n showChoice3 = document.getElementById(\"choice3\");\n\n\n\n // shows current question\n showQuestion.innerText = currentQuestion\n\n\n // shows choice options which connect to the current question\n showChoice0.innerText = currentChoice0\n showChoice1.innerText = currentChoice1\n showChoice2.innerText = currentChoice2\n showChoice3.innerText = currentChoice3\n\n\n}","title":""},{"docid":"7ceca76a97ca80ef894493cc17e52114","score":"0.6522983","text":"function loadPreviousQuestion() {\n currentQuestion--;\n //remove last value\n score.pop();\n //generate question\n generateQuestions(currentQuestion);\n}","title":""},{"docid":"e661b5255e3ddac3d19848ef5ca58064","score":"0.6519909","text":"function askQuestions() {\n\t\tquestionTimer.start();\n\t\t$('#question').html(qsArray[currentIndex].question);\n\t\t$('#btn0').show().html(qsArray[currentIndex].answers[0]);\n\t\t$('#btn1').show().html(qsArray[currentIndex].answers[1]);\n\t\t$('#btn2').show().html(qsArray[currentIndex].answers[2]);\n\t\t$('#btn3').show().html(qsArray[currentIndex].answers[3]);\n\t\t$('#gifHolder').hide().off('click');\n\n\t\tonClickAnswer();\n\t}","title":""},{"docid":"c03eb599e56283bc8fcaf00bf737888e","score":"0.6517329","text":"function newQuestion() {\n\t\ttimer();\n\t\tif (index >= questions.length) {\n\t\t\tendGame();\n\t\t} else {\n\t\t\t$(\"#correct-question-box\").html(questions[index].questionTitle);\n\t\t\tvar question = questions[index];\n\t\t\tconsole.log(\"index: \" + index);\n\t\t\tvar choicesHtml = $(\".choices\");\n\t\t\tfor (var i = 0; i < choicesHtml.length; i++) {\n\t\t\t\t// Updates the choices to the HTML page\n\t\t\t\tvar choiceHTML = $(choicesHtml[i]);\n\t\t\t\tvar selection = questions[index].choices[i];\n\t\t\t\t$(choiceHTML).html(selection);\n\t\t\t}\n\n\t\t\t// Turns click off\n\t\t\t$(\".choices\").off(\"click\");\n\n\t\t\t$(\"#choice-one-box.choices\").on(\"click\", function () {\n\t\t\t\tvar userSelection = questions[index - 1].choices[0];\n\t\t\t\tanswerHelper(userSelection, question);\n\t\t\t\tclearInterval(countDownInterval);\n\t\t\t});\n\n\t\t\t$(\"#choice-two-box.choices\").on(\"click\", function () {\n\t\t\t\tvar userSelection = questions[index - 1].choices[1];\n\t\t\t\tanswerHelper(userSelection, question);\n\t\t\t\tclearInterval(countDownInterval);\n\t\t\t});\n\n\t\t\t$(\"#choice-three-box.choices\").on(\"click\", function () {\n\t\t\t\tvar userSelection = questions[index - 1].choices[2];\n\t\t\t\tanswerHelper(userSelection, question);\n\t\t\t\tclearInterval(countDownInterval);\n\t\t\t});\n\n\t\t\t$(\"#choice-four-box.choices\").on(\"click\", function () {\n\t\t\t\tvar userSelection = questions[index - 1].choices[3];\n\t\t\t\tanswerHelper(userSelection, question);\n\t\t\t\tclearInterval(countDownInterval);\n\t\t\t});\n\t\t\tindex++;\n\t\t}\n\t}","title":""},{"docid":"bf518be32ca4c33784f2b663214ddc7b","score":"0.6516582","text":"function populateRandomQuestion(){\n i = Math.floor(Math.random() * sqlQuestions.length);\n console.log(`The value of i is ${i}`)\n var randomQuestion = sqlQuestions[i];\n nextQuestion.replaceWith(\"<p id = question></p>\")\n $(\"#question\").text(randomQuestion.question);\n nextAnswer.replaceWith(\"<p id = answer></p>\")\n $(\"#answer\").text(randomQuestion.answer);\n\n }","title":""},{"docid":"32e61149010332408b9b0144b2da36f7","score":"0.6515139","text":"function generateQuestion() {\n if (questionNumber < STORE.length) {\n return createForm(questionNumber);\n } else {\n $('.question-box').hide();\n results();\n }\n}","title":""},{"docid":"6b60fbc4ad5f6de2b82a8a6b7bf27427","score":"0.6505692","text":"function resetAnswers() {\r\n\t\texerciseAnswers = {\r\n\t\t\tfirst: null,\r\n\t\t\tsecond: null,\r\n\t\t\tthird: null,\r\n\t\t\tfourth: null,\r\n\t\t\tfifth: null,\r\n\t\t\tsixth: null\r\n\t\t},\r\n\t\tcorrectness = {\r\n\t\t\tfirst: null,\r\n\t\t\tsecond: null,\r\n\t\t\tthird: null,\r\n\t\t\tfourth: null,\r\n\t\t\tfifth: null,\r\n\t\t\tsixth: null\t\r\n\t\t};\r\n\r\n\t\tdocument.dispatchEvent(new CustomEvent('model:destoryed'));\t\r\n\t}","title":""},{"docid":"9ad4166aa89d6c9c19509d8cd4145ec3","score":"0.65024614","text":"function questionOne(){\n\n // Put in previous questions in function\n}","title":""},{"docid":"79820ff24abd77aff0b0989cf712b5c7","score":"0.65020245","text":"function generate(){\n\tq.innerHTML= data.questions[qIndex].question;\n\topt1.value= data.questions[qIndex].options[0];\n\topt2.value= data.questions[qIndex].options[1];\n\topt3.value= data.questions[qIndex].options[2];\n\topt4.value= data.questions[qIndex].options[3];\n}","title":""},{"docid":"d1fcad3d781e76fc58ee1906b031071b","score":"0.64977986","text":"function pickQuestions() {\n currentquestion = Quiz[index];\n setPage();\n }","title":""},{"docid":"1434faddf822109de553e35fd43ef79a","score":"0.64865273","text":"function init() {\n const data= questions();\n}","title":""},{"docid":"266e3695ee664f70bcd54a0c8037e7c9","score":"0.64820796","text":"function nextQuestion () {\n //first get next question from array\n currQuestionIndex = generateRandomNumber();\n var question = questionnaire[currQuestionIndex].question;\n //Display this new question in the html\n showQuest.innerHTML = questionnaire[currQuestionIndex].question;\n totalAskedQ++;\n\n}","title":""},{"docid":"18f3c93e33b25fccbe1e4fb53ad7ff05","score":"0.6478707","text":"function newQuiz() {\n $(\"#start-button\").remove();\n $(\"#game-over\").text(\"Select the correct answer!!\");\n correct = 0;\n incorrect = 0;\n unanswered = 0;\n nextQuestion();\n }","title":""},{"docid":"4592349ce588fbc88adfcf672c4670d4","score":"0.6477452","text":"function setNextQuestion() {\r\n resetState();\r\n showQuestion(shuffledQuestions[currentQuestionIndex]);\r\n}","title":""},{"docid":"62abf254f92a9b15e38785bdd7610121","score":"0.64716613","text":"function createQuiz(q)\n{\n\t//Loop through the questions\n\t//Determine question type\n\t//Fill in the template info\n\t//Append question to the page.\n\tfor(var i = 0; i < q.length; i++)\n\t{\n\t\tvar type = q[i].type;\n\t\tvar question = q[i].question;\n\t\t//alert(type + \" \" + question);\n\t\tif(type === \"mc\")\n\t\t{\n\t\t\tvar a = q[i].a;\n\t\t\tvar b = q[i].b;\n\t\t\tvar c = q[i].c;\n\t\t\t\n\t\t\tvar temp = qmc.clone(true);\n\t\t\ttemp.attr(\"id\", \"MCQ\" + num.toString());\n\t\t\t\n\t\t\ttemp.find(\"#MXX\").attr(\"id\", \"M\" + num.toString()).text(question);\n\t\t\ttemp.find(\"#MLXX\").attr(\"id\", \"ML\" + num.toString()).attr(\"for\", \"M\" + num.toString()).text(\"Question \" + num.toString() + \": \");\n\t\t\t\n\t\t\ttemp.find(\"#MAIXX\").attr(\"id\", \"MAI\" + num.toString()).text(a);\n\t\t\ttemp.find(\"#AXX\").attr(\"id\", \"A\" + num.toString()).attr(\"name\", \"MC\" + num.toString());\n\t\t\t\n\t\t\ttemp.find(\"#MBIXX\").attr(\"id\", \"MBI\" + num.toString()).text(b);\n\t\t\ttemp.find(\"#BXX\").attr(\"id\", \"B\" + num.toString()).attr(\"name\", \"MC\" + num.toString());\n\t\t\t\n\t\t\ttemp.find(\"#MCIXX\").attr(\"id\", \"MCI\" + num.toString()).text(c);\n\t\t\ttemp.find(\"#CXX\").attr(\"id\", \"C\" + num.toString()).attr(\"name\", \"MC\" + num.toString());\n\t\t\t\n\t\t\t$(\"#Quiz\").append(temp);\n\t\t\tnum++;\n\t\t\tqtype.push(\"mc\");\n\t\t}\n\t\tif(type === \"tf\")\n\t\t{\n\t\t\tvar temp = qtf.clone(true);\n\t\t\ttemp.attr(\"id\", \"TFQ\" + num.toString());\n\t\t\t\n\t\t\ttemp.find(\"#TFXX\").attr(\"id\", \"TF\" + num.toString()).text(question);\n\t\t\ttemp.find(\"#TFLXX\").attr(\"id\", \"TFL\" + num.toString()).attr(\"for\", \"TF\" + num.toString()).text(\"Question \" + num.toString() + \": \");\n\t\t\t\n\t\t\ttemp.find(\"#TXX\").attr(\"id\", \"T\" + num.toString()).attr(\"name\", \"TFC\" + num.toString());\n\t\t\ttemp.find(\"#FXX\").attr(\"id\", \"F\" + num.toString()).attr(\"name\", \"TFC\" + num.toString());\n\t\t\t\n\t\t\t$(\"#Quiz\").append(temp);\n\t\t\tnum++;\n\t\t\tqtype.push(\"tf\");\n\t\t}\n\t\tif(type === \"sa\")\n\t\t{\n\t\t\tvar temp = qsa.clone(true);\n\t\t\ttemp.attr(\"id\", \"SAQ\" + num.toString());\n\t\t\t\n\t\t\ttemp.find(\"#SAXX\").attr(\"id\", \"SA\" + num.toString()).text(question);\n\t\t\ttemp.find(\"#SALXX\").attr(\"id\", \"SAL\" + num.toString()).attr(\"for\", \"SA\" + num.toString()).text(\"Question \" + num.toString() + \": \");\n\t\t\t\n\t\t\ttemp.find(\"#ANSXX\").attr(\"id\", \"ANS\" + num.toString()).attr(\"name\", \"SAC\" + num.toString());\n\t\t\t\n\t\t\t$(\"#Quiz\").append(temp);\n\t\t\tnum++;\n\t\t\tqtype.push(\"sa\");\n\t\t}\n\t}\n}","title":""},{"docid":"e6511c2c4755d1c360f801eab8bab1d1","score":"0.6469415","text":"function Question(question) {\n this.question = question;\n this.answers = [];\n}","title":""},{"docid":"37df610c443aaf3ea46cc6f767711fa0","score":"0.6468998","text":"function nextQ() {\n // console.log(qA);\n random = Math.floor(Math.random() * qA.length);\n // console.log(random);\n question = qA[random].q;\n answer = qA[random].a;\n qA.splice(random, 1);\n var displayQ = $(\"#ask\");\n displayQ.html(question);\n console.log(qA);\n }","title":""},{"docid":"fb8649ba6a58b793a32c1e5dfd6cce9e","score":"0.64687735","text":"function CreateQuestion(){\n\tvar randomIndex = GetRandomIndex(count);\n\tvar choice;\n\n\tquestion = books[randomIndex];\n\t\n\t// Do not get long books.\n\twhile(question.eser.length > 28) {\n\t\tquestion = books[GetRandomIndex(count)];\t\t\n\t}\n\n\t// Print the book name to the box.\n\t$(\"#book_name\").html(question.eser);\n\n\t// Get random author names.\n\tfor(var i = 0; i < 3; i++) {\n\t\tchoice = books[GetRandomIndex(count)];\n\n\t\tif(choices.indexOf(choice.yazar) == -1 || choice.yazar.length > 22){\n\t\t\tif(question.yazar !== choice.yazar){\n\t\t\t\tif(!((question.hasOwnProperty(\"digerYazar\") && choice.yazar == question.digerYazar) ||\n\t\t\t\t\t(choice.hasOwnProperty(\"digerYazar\") && choice.digerYazar == question.yazar))) {\n\t\t\t\t\t\n\t\t\t\t\t// If all the conditions are satisfied, save it as an option.\n\t\t\t\t\tchoices[i] = choice.yazar;\n\n\t\t\t\t} else { i--; }\n\t\t\t} else { i--; }\n\t\t} else { i--; }\n\t}\n\n\t// Put the real answer into the array.\n\tanswerIndex = GetRandomIndex(3);\n\tchoices[answerIndex] = question.yazar;\n\n\t// Print the choices to the buttons.\n\tfor(var i = 0; i < 3; i++) {\n\t\t$('#button_' + i).html(choices[i]);\n\t}\n}","title":""},{"docid":"0754e92b041c99925a0936a0bbecb1d8","score":"0.64680153","text":"function createQuestions() {\n return [\n {\n letter: 'a',\n status: 0,\n questions: [\n {\n question:\n 'CON LA A. Dicho de una supuesta criatura extraterrestre: Apoderarse de alguien.',\n answer: 'abducir',\n },\n {\n question: \"CON LA A. Legítimo Rey de Gondor en 'El señor de los anillos'.\",\n answer: 'aragorn',\n },\n {\n question:\n 'CON LA A. Persona que se encarga del cumplimiento de las reglas en algunos deportes.',\n answer: 'arbitro',\n },\n ],\n },\n {\n letter: 'b',\n status: 0,\n questions: [\n {\n question:\n \"CON LA B. Juego que ha sacado de quicio a todos los 'Skylabers' en las sesiones de precurso.\",\n answer: 'bingo',\n },\n {\n question:\n 'CON LA B. Diosa egipcia de la protección, amor y armonía. Su cabeza tiene forma de gato.',\n answer: 'bastet',\n },\n {\n question: 'CON LA B. Mamífero acuático de gran tamaño.',\n answer: 'ballena',\n },\n ],\n },\n {\n letter: 'c',\n status: 0,\n questions: [\n { question: 'CON LA C. Niño, crío, bebé.', answer: 'churumbel' },\n {\n question: \"CON LA C. De las novelas 'Canción de hielo y fuego', 'Las lluvias de...'.\",\n answer: 'castamere',\n },\n {\n question:\n 'CON LA C. Automóvil destinado al transporte de personas y con capacidad no superior a siete plazas.',\n answer: 'coche',\n },\n ],\n },\n {\n letter: 'd',\n status: 0,\n questions: [\n {\n question:\n 'CON LA D. Anormalidad en la función del aparato digestivo caracterizada por frecuentes evacuaciones y su consistencia líquida.',\n answer: 'diarrea',\n },\n {\n question:\n 'CON LA D. Reptil fósil, propio del Mesozoico, generalmente de gran tamaño, cabeza pequeña, cuello largo, cola robusta y larga, y extremidades posteriores más largas que las anteriores.',\n answer: 'dinosaurio',\n },\n {\n question: 'CON LA D. Romper, hacer añicos.',\n answer: 'destrozar',\n },\n ],\n },\n {\n letter: 'e',\n status: 0,\n questions: [\n {\n question:\n 'CON LA E. Afección cutánea caracterizada por vesículas rojizas y exudativas, que dan lugar a costras y escamas.',\n answer: 'eccema',\n },\n {\n question: 'CON LA E. Idioma universal artificial creado por el polaco L. L. Zamenhof.',\n answer: 'esperanto',\n },\n {\n question:\n 'CON LA E. Jefe supremo del antiguo Imperio romano, y que originariamente se nombraba por aclamación del Ejército o decreto del Senado.',\n answer: 'emperador',\n },\n ],\n },\n {\n letter: 'f',\n status: 0,\n questions: [\n {\n question: 'CON LA F. Que no requiere gran esfuerzo, capacidad o dificultad.',\n answer: 'facil',\n },\n {\n question: 'CON LA F. Genero literario donde aparecen caballeros, dragones y magia.',\n answer: 'fantasia',\n },\n {\n question:\n 'CON LA F. Cada uno de los antiguos reyes de Egipto anteriores a la conquista de este país por los persas.',\n answer: 'faraon',\n },\n ],\n },\n {\n letter: 'g',\n status: 0,\n questions: [\n {\n question:\n 'CON LA G. Conjunto enorme de estrellas, polvo interestelar, gases y partículas.',\n answer: 'galaxia',\n },\n {\n question:\n \"CON LA G. Título original en España de la aclamada película de ciencia ficción. 'La guerra de las...'.\",\n answer: 'galaxias',\n },\n {\n question: 'CON LA G. Educado, de buenas maneras.',\n answer: 'gentil',\n },\n ],\n },\n {\n letter: 'h',\n status: 0,\n questions: [\n {\n question:\n 'CON LA H. Forma de suicidio ritual, practicado en el Japón por razones de honor o por orden superior, consistente en abrirse el vientre.',\n answer: 'harakiri',\n },\n {\n question: 'CON LA H. Herir el amor propio o la dignidad de alguien.',\n answer: 'humillar',\n },\n {\n question:\n 'CON LA H. Agua convertida en cuerpo sólido y cristalino por un descenso suficiente de temperatura.',\n answer: 'hielo',\n },\n ],\n },\n {\n letter: 'i',\n status: 0,\n questions: [\n {\n question: 'CON LA I. Templo cristiano.',\n answer: 'iglesia',\n },\n {\n question: \"CON LA I. País-Ciudad controlada por Saruman en 'El señor de los anillos'.\",\n answer: 'isengard',\n },\n {\n question:\n 'CON LA I. Cambiar, sustituyéndolos por sus contrarios, la posición, el orden o el sentido de las cosas.',\n answer: 'invertir',\n },\n ],\n },\n {\n letter: 'j',\n status: 0,\n questions: [\n {\n question:\n \"CON LA J. Variedad salvaje del cerdo que sale en la película 'El Rey León', de nombre Pumba.\",\n answer: 'jabali',\n },\n\n {\n question: 'CON LA J. Preparado farmacéutico líquido que se administra por la boca.',\n answer: 'jarabe',\n },\n {\n question: 'CONTIENE LA J. Actividad intensa que implica movimientos incesantes.',\n answer: 'ajetreo',\n },\n ],\n },\n {\n letter: 'l',\n status: 0,\n questions: [\n {\n question: 'CON LA L. Único satélite natural de la Tierra.',\n answer: 'luna',\n },\n {\n question:\n 'CON LA L. Persona que, según la tradición popular, se convierte en lobo las noches de plenilunio.',\n answer: 'licantropo',\n },\n {\n question: 'CON LA L. Que ha perdido la razón.',\n answer: 'loco',\n },\n ],\n },\n {\n letter: 'm',\n status: 0,\n questions: [\n {\n question:\n 'CON LA M. Persona que huye del trato con otras personas o siente gran aversión hacia ellas.',\n answer: 'misantropo',\n },\n {\n question:\n 'CON LA M. Figura decorativa tallada en madera situada en la proa de antiguos buques.',\n answer: 'mascaron',\n },\n {\n question:\n 'CON LA M. Parte del día comprendida entre el amanecer y el mediodía, o la hora de comer o almorzar.',\n answer: 'mañana',\n },\n ],\n },\n {\n letter: 'n',\n status: 0,\n questions: [\n {\n question: 'CON LA N. Demostración de poca inteligencia.',\n answer: 'necedad',\n },\n {\n question: 'CON LA N. Mago especializado en magia negra y resucitar muertos.',\n answer: 'nigromante',\n },\n {\n question:\n 'CON LA N. Sustancia blanca formada por la precipitación de agua a bajas temperaturas.',\n answer: 'nieve',\n },\n ],\n },\n {\n letter: 'ñ',\n status: 0,\n questions: [\n {\n question:\n 'CONTIENE LA Ñ. Indicio que permite deducir algo de lo que no se tiene un conocimiento directo.',\n answer: 'señal',\n },\n {\n question: 'CON LA Ñ. Antílope sudafricano.',\n answer: 'ñu',\n },\n {\n question: 'CONTIENE LA Ñ: Golpe que se da con el puño de la mano.',\n answer: 'puñetazo',\n },\n ],\n },\n {\n letter: 'o',\n status: 0,\n questions: [\n {\n question: 'CON LA O. Órgano externo de la audición.',\n answer: 'oreja',\n },\n\n {\n question: 'CON LA O. Onda de gran amplitud que se forma en la superficie de las aguas.',\n answer: 'ola',\n },\n {\n question: 'CON LA O. Adorno, compostura, atavío que hace vistosa una cosa.',\n answer: 'ornamento',\n },\n ],\n },\n {\n letter: 'p',\n status: 0,\n questions: [\n {\n question:\n 'CON LA P. Raza ancestral tecnológicamente avanzada que se caracteriza por sus grandes poderes psiónicos del videojuego StarCraft.',\n answer: 'protoss',\n },\n {\n question: 'CON LA P: Que se repite con frecuencia a intervalos determinados.',\n answer: 'periodico',\n },\n {\n question:\n 'CON LA P. Utensilio de hierro en forma de rejilla para poner al fuego lo que se ha de asar o tostar.',\n answer: 'parrilla',\n },\n ],\n },\n {\n letter: 'q',\n status: 0,\n questions: [\n {\n question: 'CON LA Q. Producto obtenido por la maduración de la cuajada de la leche',\n answer: 'queso',\n },\n {\n question:\n 'CON LA Q. Piezas bucales presentes en un subfilo de artrópodos como los arácnidos.',\n answer: 'queliceros',\n },\n { question: 'CON LA Q. Destruir algo o a alguien con fuego.', answer: 'quemar' },\n ],\n },\n {\n letter: 'r',\n status: 0,\n questions: [\n {\n question: \"CON LA R. Ciudad élfica gobernada por Elrond en 'El señor de los anillos'.\",\n answer: 'rivendel',\n },\n {\n question:\n 'CON LA R. Mamífero roedor de pequeño tamaño, de hocico puntiagudo y cola larga, de pelaje corto.',\n answer: 'raton',\n },\n {\n question:\n 'CON LA R. Corriente de agua continua y más o menos caudalosa que va a desembocar en otra, en un lago o en el mar.',\n answer: 'rio',\n },\n ],\n },\n {\n letter: 's',\n status: 0,\n questions: [\n {\n question: 'CON LA S. Comunidad salvadora de todo desarrollador informático.',\n answer: 'stackoverflow',\n },\n\n {\n question: 'CON LA S. Baile típico de brasil.',\n answer: 'samba',\n },\n {\n question: 'CON LA S. Representarse en la fantasía imágenes o sucesos mientras se duerme.',\n answer: 'soñar',\n },\n ],\n },\n {\n letter: 't',\n status: 0,\n questions: [\n {\n question:\n 'CON LA T. Película del director James Cameron que consolidó a Arnold Schwarzenegger como actor en 1984.',\n answer: 'terminator',\n },\n {\n question:\n 'CON LA T. Alimento preparado con huevo batido, cuajado con aceite en la sartén y de forma redonda o alargada, al que a veces se añaden otros ingredientes.',\n answer: 'tortilla',\n },\n {\n question:\n 'CON LA T. Grave dolor físico o psicológico infligido a alguien, con métodos y utensilios diversos, con el fin de obtener de él una confesión, o como medio de castigo.',\n answer: 'tortura',\n },\n ],\n },\n {\n letter: 'u',\n status: 0,\n questions: [\n {\n question:\n \"CON LA U. Escritor y filósofo español de la generación del 98 autor del libro 'Niebla' en 1914.\",\n answer: 'unamuno',\n },\n {\n question: 'CON LA U. Instrumento de cuerda similar a la guitarra pero más pequeño.',\n answer: 'ukelele',\n },\n {\n question: 'CON LA U. Objeto fabricado que se destina a un uso manual y doméstico.',\n answer: 'utensilio',\n },\n ],\n },\n {\n letter: 'v',\n status: 0,\n questions: [\n {\n question:\n 'CON LA V. Nombre dado a los miembros de los pueblos nórdicos originarios de Escandinavia, famosos por sus incursiones y pillajes en Europa.',\n answer: 'vikingos',\n },\n {\n question:\n 'CON LA V. Traspasar a alguien por el precio convenido la propiedad de lo que se posee.',\n answer: 'vender',\n },\n {\n question: 'CON LA V. Hortaliza, especialmente la de hojas verdes.',\n answer: 'verdura',\n },\n ],\n },\n {\n letter: 'x',\n status: 0,\n questions: [\n {\n question: 'CONTIENE LA X. Toxina bacteriana utilizada en cirujía estética.',\n answer: 'botox',\n },\n {\n question:\n 'CON LA X. Instrumento musical de percusión formado por láminas generalmente de madera, ordenadas horizontalmente según su tamaño y sonido, que se hacen sonar golpeándolas con dos baquetas.',\n answer: 'xilofono',\n },\n {\n question: 'CON LA X. Fobia a los extranjeros.',\n answer: 'xenofobia',\n },\n ],\n },\n {\n letter: 'y',\n status: 0,\n questions: [\n {\n question:\n 'CONTIENE LA Y. Planta cactácea, de pequeño tamaño, que contiene una sustancia cuya ingestión produce efectos alucinógenos y narcóticos.',\n answer: 'peyote',\n },\n {\n question:\n 'CONTIENE LA Y. Abominable hombre de las nieves. Supuesto gigante antropomorfo, del cual se dice que vive en el Himalaya.',\n answer: 'yeti',\n },\n {\n question:\n 'CONTIENE LA Y. Pieza de la armadura antigua que resguardaba la cabeza y el rostro, y se componía de morrión, visera y babera.',\n answer: 'yelmo',\n },\n ],\n },\n {\n letter: 'z',\n status: 0,\n questions: [\n {\n question:\n 'CON LA Z. Escuela de budismo que busca la experiencia de la sabiduría más allá del discurso racional.',\n answer: 'zen',\n },\n {\n question: 'CON LA Z. Zapato de madera de una pieza.',\n answer: 'zueco',\n },\n {\n question:\n 'CON LA Z. Calzado que no pasa del tobillo, con la parte inferior de suela y lo demás de piel, fieltro, paño u otro tejido, más o menos escotado por el empeine.',\n answer: 'zapato',\n },\n ],\n },\n ];\n}","title":""},{"docid":"fd0613b36851808af9f2bbb77174576a","score":"0.64674777","text":"function setNextQuestion () {\n resetState()\n showQuestion (shuffledQuestions[currentQuestionIndex])\n}","title":""},{"docid":"2b6f46fa0f3e3017fab0c4d7e29436e8","score":"0.6464019","text":"function generateNextQuestions()\r\n{\r\n if(defaultQuestions[counter])\r\n {\r\n\t\tFirstQuestion.innerText = (counter+1) +\". \"+ defaultQuestions[counter].QuestionText; \r\n\t\tfirstAnswer.style.visibility = \"visible\";\r\n }\r\n else\r\n {\r\n FirstQuestion.innerText = \"\";\r\n firstAnswer.style.visibility = \"hidden\";\r\n }\r\n if(defaultQuestions[counter+1])\r\n {\r\n\t\tSecondQuestion.innerText = (counter+2) +\". \"+ defaultQuestions[counter+1].QuestionText;\r\n\t\tsecondAnswer.style.visibility = \"visible\";\r\n }\r\n else\r\n {\r\n SecondQuestion.innerText = \"\";\r\n secondAnswer.style.visibility = \"hidden\";\r\n }\r\n firstAnswer.value = \"\"; \r\n secondAnswer.value = \"\";\r\n \r\n }","title":""},{"docid":"ba67cef78fdc2d6bef04d59d7f698612","score":"0.6462216","text":"async function uniformData() {\n\n // iterate over all question data sets\n await $.asyncForEach( self.questions, async ( question, i ) => {\n\n // each question knows her original number and HTML ID\n question.nr = i + 1; question.id = 'question-' + question.nr;\n\n // consider default values for question data from instance config\n self.questions[ i ] = question = await $.integrate( $.filterProperties( self, 'text', 'description', 'answers', 'input', 'attributes', 'swap', 'escape', 'random', 'solution' ), question, true );\n\n // default input type is checkbox\n if ( !question.input ) question.input = 'checkbox';\n\n // set default information about correct answers\n if ( !question.solution && question.input !== 'radio' ) question.solution = [];\n\n // answer data sets could be given as single string (answer text) instead of object\n for ( i = 0; i < question.answers.length; i++ )\n if ( !$.isObject( question.answers[ i ] ) )\n question.answers[ i ] = { text: question.answers[ i ] };\n\n // information about correct answers of a multiple choice question could be given as integer array instead of boolean array\n if ( question.input === 'checkbox' && typeof question.solution[ 0 ] === 'number' ) {\n const solution = [];\n for ( i = 0; i < question.answers.length; i++ )\n solution.push( question.solution.indexOf( i ) >= 0 );\n question.solution = solution;\n }\n\n // fill up array of information about correct answers with default values (checkbox -> false, otherwise empty string)\n if ( Array.isArray( question.solution ) )\n for ( i = 0; i < question.answers.length; i++ )\n if ( question.solution[ i ] === undefined )\n question.solution[ i ] = question.input === 'checkbox' ? false : '';\n\n // iterate over all answers\n await $.asyncForEach( question.answers, async ( answer, i ) => {\n\n // each answer knows her original number, HTML class and HTML ID\n answer.nr = i + 1; answer.class = 'answer-' + answer.nr; answer.id = question.id + '-' + answer.class;\n\n // information about correct answers of a question could be given via answer data\n if ( answer.correct !== undefined )\n if ( question.input === 'radio' ) {\n if ( answer.correct === true ) question.solution = i;\n }\n else\n question.solution[ i ] = question.input === 'number' ? parseInt( answer.correct ) : answer.correct;\n\n // consider default values for answer data from question data\n question.answers[ i ] = await $.integrate( $.filterProperties( question, 'attributes', 'swap', 'escape' ), answer, true );\n\n } );\n\n // remove no more needed properties in question data\n delete question.attributes; delete question.swap;\n\n } );\n\n // remove no more needed properties in config\n delete self.text; delete self.description; delete self.answers; delete self.input; delete self.attributes; delete self.swap; delete self.escape; delete self.random; delete self.solution;\n\n }","title":""},{"docid":"3796e65ccf740d396f191eb34807e03e","score":"0.646083","text":"function setNextQuestion() {\n resetState()\n showQuestion(shuffledQuestion[currentQuestionIndex])\n\n}","title":""},{"docid":"68f2b89d11cd9c91387d70b8332f8da3","score":"0.6442499","text":"function getNewQuestion() {\r\n\r\n // set question number\r\n questionNumber.innerHTML = \"Question \" + (questionCounter + 1) + \" of \" + quiz.length;\r\n\r\n // set question text\r\n // get rendom question\r\n var questionIndex = availabeQuestion[Math.floor(Math.random() * availabeQuestion.length)]\r\n currentQuestion = questionIndex;\r\n questionText.innerHTML = currentQuestion.q;\r\n\r\n // get the position of 'questionIndex' from availableQuestion\r\n var index1 = availabeQuestion.indexOf(questionIndex);\r\n\r\n // remove the 'questionIndex' from availableQuestion so that the questions is not repeat\r\n availabeQuestion.splice(index1, 1);\r\n\r\n // set options\r\n // get the length of options\r\n\r\n var optionsLen = currentQuestion.options.length;\r\n\r\n // push optins into available option Array\r\n for (var i = 0; i < optionsLen; i++) {\r\n availabeOptions.push(i)\r\n }\r\n\r\n optionContainer.innerHTML = '';\r\n\r\n var animationDelay = 0.15;\r\n // creat options in HTML\r\n\r\n for (var i = 0; i < optionsLen; i++) {\r\n // random option\r\n var optonIndex = availabeOptions[Math.floor(Math.random() * availabeOptions.length)];\r\n\r\n // get the position of 'optonIndex' from the availabeOptions\r\n var index2 = availabeOptions.indexOf(optonIndex);\r\n\r\n // remove the 'optonIndex' from availableOptions so that the questions is not repeat\r\n availabeOptions.splice(index2, 1);\r\n var option = document.createElement(\"div\");\r\n option.innerHTML = currentQuestion.options[optonIndex];\r\n option.id = optonIndex;\r\n option.style.animationDelay = animationDelay + 's';\r\n animationDelay = animationDelay + 0.15;\r\n option.className = \"option\";\r\n optionContainer.appendChild(option);\r\n option.setAttribute(\"onclick\", \"getResult(this)\")\r\n\r\n }\r\n\r\n // console.log(currentQuestion.options)\r\n\r\n\r\n\r\n questionCounter++\r\n\r\n}","title":""},{"docid":"bc6073bcffea72baea8ac2a9a802ffee","score":"0.6441558","text":"function nextQuestion() {\n /* Chose new question until the question was not asked yet -- Crashes if no more available questions */\n\n while (questionArray[questionNumberToShow].allreadyAsked) {\n questionNumberToShow = Math.floor(Math.random() * questionArray.length);\n }\n\n /* Shuffle the answers of the chosen question */\n\n questionArray[questionNumberToShow].answerArray = shuffleArray(\n questionArray[questionNumberToShow].answerArray\n );\n\n /* Set the question in the site content */\n\n questionTextHTML.innerText = questionArray[questionNumberToShow].questionText;\n answer1HTML.innerText = questionArray[questionNumberToShow].answerArray[0];\n answer2HTML.innerText = questionArray[questionNumberToShow].answerArray[1];\n answer3HTML.innerText = questionArray[questionNumberToShow].answerArray[2];\n answer4HTML.innerText = questionArray[questionNumberToShow].answerArray[3];\n\n correctToShowHTML.innerText = `Leider ze spéit! Déi richteg Äntwert war ${questionArray[questionNumberToShow].correctAnswer}`;\n\n /* Set allready asked to true because question was asked */\n\n questionArray[questionNumberToShow].allreadyAsked = true;\n\n /* Remove colors and hidden from answers */\n\n answer1HTML.classList.remove(\"answerfalse\");\n answer2HTML.classList.remove(\"answerfalse\");\n answer3HTML.classList.remove(\"answerfalse\");\n answer4HTML.classList.remove(\"answerfalse\");\n answer1HTML.classList.remove(\"answercorrect\");\n answer2HTML.classList.remove(\"answercorrect\");\n answer3HTML.classList.remove(\"answercorrect\");\n answer4HTML.classList.remove(\"answercorrect\");\n allAnswersHTML.classList.remove(\"hidden\");\n\n /* Set possible trys back to 4 */\n\n answerTrys = 4;\n\n /* Update questions to ask */\n numberOfQuestionsAllreadyAsked++;\n numberofQuestionsToAsk--;\n console.log(numberofQuestionsToAsk);\n\n /* Update image */\n\n imageFeedbackHTML.setAttribute(\"src\", \"questionMark.png\");\n}","title":""},{"docid":"4a3113915b6cdf567d3ef2379537f077","score":"0.6440944","text":"function setNextQuestion() {\n resetState();\n showQuestion(shuffledQuestions[currentQuestionIndex]);\n currentQuestionIndex++;\n}","title":""},{"docid":"7f3a693df8696fa6b2571c1cbeaba854","score":"0.6440389","text":"function setup() {\n var currQuestion = register[questionNr];\n \n question.innerHTML = \"<b>Question \" + (questionNr + 1) + \"/3:</b><br>\" + currQuestion.question;\n choiceList[0].innerHTML = \"1. \" + currQuestion.choices[0];\n choiceList[1].innerHTML = \"X. \" + currQuestion.choices[1];\n choiceList[2].innerHTML = \"2. \" + currQuestion.choices[2];\n correctAnswer = currQuestion.answer;\n }","title":""},{"docid":"32434106b7096afdb60999cde0310fcd","score":"0.64375913","text":"function createQuestions(){\n buildButtons(quizCards[longClock].answerChoices);\n questionTitle.textContent = quizCards[longClock].question;\n\n}","title":""}],"string":"[\n {\n \"docid\": \"6e0608ad32e552f242d97ac25d68cb39\",\n \"score\": \"0.7902963\",\n \"text\": \"generateQuestions() {\\n const questions = []\\n const randoms = this.randomQuestions();\\n for (let i = 0; i < randoms.length; i++) {\\n const question = new Question(randoms[i]);\\n questions.push(question);\\n }\\n\\n this.questions = questions;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f2fc038069ea365476e82ffc3d26e5d\",\n \"score\": \"0.7423109\",\n \"text\": \"function loadQuestion() {\\n let singleQuestion = new QuestionAndAnswer\\n (\\n randomLoremGenMax66Words(7, 20),\\n randomLoremGenMax66Words(3, 66),\\n numberOfQuestion\\n );\\n\\n showQuestion(\\n singleQuestion.getQuestion(),\\n singleQuestion.getAnswer(),\\n phaseAppendQuestions\\n );\\n //Global change\\n numberOfQuestion++;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b055006a4f980ba2a8478c36b4cc398a\",\n \"score\": \"0.73392\",\n \"text\": \"function populateQuestions(){\\nallQuestions = defaultQuestions;\\nquestions = defaultQuestions[current];\\nquestion = questions.question;\\nchoiceA = questions.choiceA;\\nchoiceB = questions.choiceB;\\nchoiceC = questions.choiceC;\\nchoiceD = questions.choiceD;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0dc88b1638108824e2f0dc7245b2cbc\",\n \"score\": \"0.724611\",\n \"text\": \"function setupNewQuestion() {\\n question = new MinusQuestion();\\n questionElement.innerText = question.questionText();\\n answerElement.value = \\\"\\\";\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"caab26beb565cfe75f5be815a65b008a\",\n \"score\": \"0.7243469\",\n \"text\": \"function resetUsedQuestions() {\\n usedQuestions = [];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be01c81e5d782f133a9734f15a071b28\",\n \"score\": \"0.7171578\",\n \"text\": \"function makeQuestion() {\\n randomizeQuestion();\\n displayQuestion();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"201a82df32491c3804563041b4647f96\",\n \"score\": \"0.7169128\",\n \"text\": \"function qGenerator(){\\n var i = Math.floor(Math.random()*questionSet.length);\\n question.textContent = questionSet[i][0];\\n answer1.textContent = questionSet[i][1];\\n answer2.textContent = questionSet[i][2];\\n answer3.textContent = questionSet[i][3];\\n answer4.textContent = questionSet[i][4];\\n questionSet.splice(i,1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be2cd6e9b3acbeab7b9aaccea216adcd\",\n \"score\": \"0.7132091\",\n \"text\": \"function newQuestion() {\\n var allQuestions = [ageQue, jobQue, countryQue];\\n\\n var n = Math.floor(Math.random() * allQuestions.length);\\n\\n allQuestions[n].displayQuestion();\\n\\n var answer = prompt(allQuestions[n].question);\\n\\n if (answer !== 'exit') {\\n allQuestions[n].checkAnswer(parseInt(answer));\\n newQuestion();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b0d955a665d1d5ac4cc424c74ced9b4\",\n \"score\": \"0.7091687\",\n \"text\": \"generateQuestion() {\\n questionDiv.empty();\\n questionDiv.append(Object.values(this.questions[counter].question));\\n this.startTimer();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3deec5471f7e55586c062472966e5925\",\n \"score\": \"0.7048493\",\n \"text\": \"function generateNewQuestion() {\\n // increasing question tracker by 1 with each new question generated and updating text\\n questionTracker++;\\n questionTrackerText.innerText = questionTracker + \\\"/\\\" + totalQuestions;\\n\\n // variable for question index to generate random question from available questions array\\n var questionIndex = Math.floor(Math.random(availableQuestions.length));\\n // setting current question to a random index within the availabe questions array\\n currentQuestion = availableQuestions[questionIndex];\\n quizQuestion.innerText = currentQuestion.question;\\n\\n // following same principle for answer selections usinf forEach method\\n answerSelections.forEach(answerSelection => {\\n // variable to reference data-set in html \\n var number = answerSelection.dataset[\\\"number\\\"];\\n // printing selections to the screen that match with corresponding text \\n answerSelection.innerText = currentQuestion[\\\"answerSelection\\\" + number];\\n });\\n // splicing out question that was used so it doesn't repeat\\n availableQuestions.splice(questionIndex, 1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"737ee54f63bde82b3564bd7670f34bb2\",\n \"score\": \"0.70346135\",\n \"text\": \"function generateQuestions() {\\n questionArray.push(new question(\\\"What card has the following flavor text? <br><br> <em>'A blade that has never known sheath, a hilt that has never known hand.'</em>\\\", [\\\"Dancing Scimitar\\\", \\\"Sword of the Ages\\\", \\\"Whirling Dervish\\\", \\\"Blade Sentinel\\\"], \\\"dancing-scimitar.jpg\\\"));\\n questionArray.push(new question(\\\"First printed in Alpha, is the only card with art painted by Faye Jones. It pictures a clown and a blindfolded humanoid fox balanced on a scale.\\\", [\\\"Stasis\\\", \\\"Jackal Pup\\\", \\\"Atog\\\", \\\"Noetic Scales\\\"], \\\"stasis.jpg\\\"));\\n questionArray.push(new question(\\\"Which of these is NOT a creature type on the card Coiling Oracle?\\\", [\\\"Merfolk\\\", \\\"Snake\\\", \\\"Elf\\\", \\\"Druid\\\"], \\\"coiling_oracle.jpg\\\"));\\n questionArray.push(new question(\\\"Which of these lands is both a Swamp and and Island\\\", [\\\"Underground Sea\\\", \\\"Overgrown Tomb\\\", \\\"Lonely Sandbar\\\", \\\"Bloodstained Mire\\\"], \\\"underground_sea.jpg\\\"));\\n questionArray.push(new question(\\\"What card has the following flavor text? <br><br> <em>'I want a banana this big!'</em>\\\", [\\\"Gorilla Titan\\\", \\\"Tasigur, the Golden Fang\\\", \\\"Uktabi Orangutan\\\", \\\"Hyalopterous Lemure\\\"], \\\"gorilla_titan.jpg\\\"));\\n questionArray.push(new question(\\\"What is the converted mana cost of the card Enlisted Wurm?\\\", [6, 5, 7, 8], \\\"enlisted_wurm.jpg\\\"));\\n questionArray.push(new question(\\\"Besides Shaman, what creature type does Thundercloud Shaman have?\\\", [\\\"Giant\\\", \\\"Elf\\\", \\\"Elemental\\\", \\\"Goblin\\\"], \\\"thundercloud_shaman.jpg\\\"));\\n questionArray.push(new question(\\\"How much damage does the card Pyroclasm do to each creature?\\\", [2, 3, 4, 1], \\\"pyroclasm.jpg\\\"));\\n questionArray.push(new question(\\\"What is Lord of the Pit's power and toughness?\\\", [\\\"7/7\\\", \\\"6/6\\\", \\\"5/5\\\", \\\"8/8\\\"], \\\"lord_of_the_pit.jpg\\\"));\\n questionArray.push(new question(\\\"What color is the card Volcanic Erruption\\\", [\\\"Blue\\\", \\\"Red\\\", \\\"Black\\\", \\\"Green\\\"], \\\"volcanic_erruption.jpg\\\"));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"972aa0d00eafd19734868c33fffbf6b7\",\n \"score\": \"0.7029648\",\n \"text\": \"function init() {\\n questions();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff619fc488f4a983a7b59b9ee017b3d4\",\n \"score\": \"0.7003965\",\n \"text\": \"function setQuestions() {\\n for (let i = 0; i < questionsLength; i++) {\\n availableQuestion.push(quizQuestions[i]);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5b8ace8f7f68fdadf7a20966f7a928b\",\n \"score\": \"0.6993607\",\n \"text\": \"function setNextQuestion(){\\n //resets everything back to the starting state for each quesiton\\n resetState()\\n //runs the function that dynamically generates the questions\\n showQuestion(shuffledQuestions[currentQuestionIndex])\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1b6680dd5fc0f19d6810985c06bbf29\",\n \"score\": \"0.69657195\",\n \"text\": \"function populate() {\\n new Questions('cult', 'The Goonies search for which pirate\\\\'s treasure?', 'Blackbeard', 'Davy Jones', 'Calico Jack', 'One Eyed-Willy', 4);\\n new Questions('cult', 'Which 80s movie theme song was recorded in just 3 hours?', '\\\"Oh Yeah\\\" - Ferris Bueller\\\\'s Day Off', '\\\"Don\\\\'t You (Forget About Me)\\\" - The Breakfast Club', '\\\"Storybook Love\\\" - The Princess Bride', '\\\"Ghostbusters\\\" - Ghostbusters', 2);\\n new Questions('magic', 'In the Labyrinth, what other name does the Goblin King go by (Hint: The Goblin King is played by David Bowie!)?', 'The Lord of the Labyrinth', 'Robert', 'Jareth', 'His Highness', 3);\\n new Questions('magic', 'What is the name of Atreyu\\\\'s horse in The NeverEnding Story?', 'Artex', 'Teeny Weeny', 'Bastian', 'Urgl', 1);\\n new Questions('horror', 'Which movie is in the Guinness Book of Records for the most retakes of a single scene?', 'A Nightmare on Elm Street', 'The Shining', 'The Evil Dead', 'Poltergeist', 2);\\n new Questions('horror', 'How many Nightmare on Elm Street films were made in the 80s?', 3, 4, 5, 6, 3);\\n new Questions('scifi', 'Which 80s movie was the highest grossing film of the decade?', 'E.T. the Extra-Terrestrial', 'Return of the Jedi', 'Tron', 'Aliens', 1);\\n new Questions('scifi', 'This is the only actor to be killed by an Alien, Predator, and a Terminator.', 'Sigourney Weaver', 'Carl Weathers', 'Lance Henriksen', 'Bill Paxton', 4);\\n new Questions('chevy', 'What nickname did Chevy Chase\\\\'s wife call him in the National Lampoon movies?', 'Buddy', 'Clark', 'Sparky', 'Mr. Griswold', 3);\\n new Questions('cult', 'What song did Ducky lip sync in Pretty in Pink?', '\\\"Try a Little Tenderness\\\"', '\\\"Nothing\\\\'s Gonna Stop Us Now\\\"', '\\\"Saving All My Love for You\\\"', '\\\"Longer\\\"', 1);\\n new Questions('action', 'Name That Movie: \\\"Snakes. Why did it have to be snakes?\\\"', 'Indiana Jones and the Template of Doom', 'Crocodile Dundee', 'The Princess Bride', 'Raiders of the Lost Ark', 4);\\n new Questions('magic', 'Jim Hensen\\\\'s The Dark Crystal takes place in \\\"another world, another time, in the age of _____.\\\"', 'surprise', 'wonder', 'magic', 'uncertainty', 2);\\n new Questions('scifi', 'The main street set in Back to the Future is also the main street in what other 80s movie?', 'RoboCop', 'Repo Man', 'Gremlins', 'E.T. the Extra-Terrestrial', 3);\\n new Questions('scifi', 'What is the single most valuable commodity in David Lynch\\\\'s Dune?', 'Melange', 'Coffee', 'Salt', 'Plutonium', 1);\\n new Questions('horror', 'Which is not a movie directed by John Carpenter?', 'The Fog', 'Halloween II', 'The Thing', 'Prince of Darkness', 2);\\n new Questions('scifi', 'Whose work did NOT influence Blade Runner?', 'Philip K. Dick', 'Dan O\\\\'Bannon', 'Jean Giraud', 'Arthur C. Clarke', 4);\\n new Questions('magic', 'What god does Conan the Barbarian worship?', 'Odin', 'Kull', 'Crom', 'Bhaal', 3);\\n new Questions('magic', 'What was the first DVD sent out on Netflix in 1998?', 'Beetlejuice', 'The Dark Crystal', 'The NeverEnding Story', 'Gremlins', 1);\\n new Questions('chevy', 'In Three Amigos!, what did the Dusty Bottoms play for the other amigos to dance to in the cantina?', 'Arm in Arm', 'My Little Buttercup', 'Cheek to Cheek', 'My Love, Sweet Love', 2);\\n new Questions('chevy', 'In National Lampoon\\\\'s Christmas Vaction, which football team\\\\'s hat did Clark wear?', 'Green Bay Packers', 'Chicago Bears', 'Pittsburgh Steelers', 'Kansas City Chiefs', 2);\\n new Questions('chevy', 'In Caddyshack, Ty Webb and Judge Smails each bet what amount in the golf match?', '$20k', '$40k', '$60k', '$80k', 1);\\n new Questions('chevy', 'In Funny Farm, what hat does Andy wear for most of the film?', 'Chicago Cubs', 'New York Mets', 'Boston Red Sox', 'New York Yankees', 2);\\n new Questions('action', 'In The Warriors, what famous line does Luther screech?', 'Just beat it', 'Come out to play', 'Let\\\\'s get down to it', 'Truth or dare', 2);\\n new Questions('action', 'In Escape from New York, what is the only thing that Snake asks for when escaping?', 'A Shower', 'Water', 'A Phone Call', 'A Ride', 4);\\n new Questions('action', 'In They Live, Nada is here to, \\\"Kick Ass and _____?\\\"', 'Take Names', 'Take a Break', 'Right Wrongs', 'Chew Bubblegum', 4);\\n new Questions('action', 'In Highlander, the main villain - the Kurgan - says \\\"it\\\\'s better to _____.\\\"', 'be alone', 'burn the candle at both ends', 'burn out than to fade away', 'be feared than loved', 3);\\n new Questions('horror', 'Although Jamie Lee Curtis has top billing in Halloween II, she only appears for _____ minutes in the film.', '23', '28', '31', '25', 4);\\n new Questions('horror', 'In The Lost Boys, what was the name of the main love interest?', 'Star', 'Peony', 'Soleil', 'Moonflower', 1);\\n new Questions('horror', 'In Pet Sematary, what was the name of the evil cat that comes back to life?', 'Josie', 'Kitty', 'Churches', 'Maxy', 3);\\n new Questions('scifi', 'In The Thing, what computer game did R.J. MacReady play while sitting in his cabin?', 'Tetris', 'Chess', 'Pong', 'Solitaire', 2);\\n new Questions('scifi', 'In Aliens, what was the little girl\\\\'s name who was the only survivor at the LV-426 settlement?', 'Sarah', 'Hadley', 'Newt', 'Salamander', 3);\\n new Questions('scifi', 'In Blade Runner, what type of origami animal does Gaff make and leave outside Deckard\\\\'s house?', 'Frog', 'Unicorn', 'Horse', 'Swan', 2);\\n new Questions('scifi', 'In The Terminator, what was the only possession that Kyle had of Sarah Connor\\\\'s?', 'Tapes', 'A Gun', 'A T-shirt', 'Polaroid', 4);\\n new Questions('cult', 'In The Goonies, what was the name of the Fratelli family member whom Chunk befriends?', 'Mouth', 'Sloth', 'Sid', 'Brand', 2);\\n new Questions('cult', 'In The Princess Bride, Buttercup knew it was Westley when he said what phrase to her?', 'Where you go I go', 'As I do hope you love me', 'As you wish', 'With your permission', 3);\\n new Questions('scifi', 'In Back to the Future, how fast does Doc Brown tell Marty McFly he needs to drive in order to time travel in The DeLorean?', '66 mph', '77 mph', '88 mph', '99 mph', 3);\\n new Questions('scifi', 'In E.T. the Extra-Terrestrial, what colorful candy did Elliot leave in a trail to attract E.T.?', 'Skittles', 'Reese\\\\'s Pieces','M&M\\\\'s', 'Runts', 2);\\n new Questions('magic', 'In the Labyrinth, what animal does the Goblin King transform into?', 'Owl', 'Cat', 'Dog', 'Spider', 1);\\n new Questions('magic', 'In Willow, the main character was not always a powerful sorcerer; what was he beforehand?', 'Farmer', 'Fisher', 'Baker', 'Shopkeeper', 1);\\n new Questions('magic', 'In The NeverEnding Story, what was the name of Bastion\\\\'s luckdragon?', 'Troy', 'Artayu', 'Falkor', 'Jaryth', 3);\\n new Questions('magic', 'In Clash of the Titans, which titan does Perseus kill to save Andromeda?', 'Kraken', 'Uranus', 'Mars', 'Cronus', 1);\\n new Questions('action', 'Bruce Willis was paid an \\\"unheard of\\\" sum of money to star in Die Hard. How much was it?', '$3 Million', '$4 Million', '$5 Million', '$6 Million', 3);\\n new Questions('action', 'Name That Movie: \\\"Son, your ego is writing checks your body can\\\\'t cash!\\\"', 'Lethal Weapon', 'Top Gun', 'Bloodsport', 'Beverly Hills Cop', 2);\\n new Questions('horror', 'What was the first movie to win an Academy Award for Best Makeup?', 'An American Werewolf in London', 'The Evil Dead', 'Halloween II', 'Friday the 13th', 1);\\n new Questions('horror', 'What movie did Andy Warhol call, \\\"A Clockwork Orange of the 1980s?\\\"', 'A Nightmare on Elm Street', 'Re-Animator', 'Christine', 'Videodrome', 4);\\n new Questions('horror', 'Who did Steven Spielberg initially ask to write the Poltergeist script?', 'John Carpenter', 'Tobe Hooper', 'Stephen King', 'Dario Argento', 3);\\n new Questions('cult', 'How many times was the name \\\"Heather\\\" said during the movie Heathers?', '70', '80', '90', '100', 3);\\n new Questions('cult', 'David Lynch\\\\'s Blue Velvet contains subtle references to which historical figure\\\\'s assassination?', 'John F. Kennedy', 'Abraham Lincoln', 'Archduke Franz Ferdinand', 'Martin Luther King Jr.', 2);\\n new Questions('cult', 'In the original script of Bill & Ted\\\\'s Excellent Adventure, the time machine was a _____?', 'Treadmill', 'Van', 'Closet', 'Hot Tub', 2);\\n new Questions('cult', 'Which movie on IMDB is rated out of 11 instead of 10?', 'Ghostbusters', 'RoboCop', 'Scarface', 'This is Spinal Tap', 4);\\n new Questions('chevy', 'How many National Lampoon\\\\'s Vacation movies came out in the 80s?', 1, 2, 3, 4, 3);\\n new Questions('chevy', 'The Griswald family win a trip to Europe on what game show?', 'The Price Is Right', 'You Bet Your Life', 'Pig In A Poke', 'Wacky Wally World', 3);\\n new Questions('chevy', 'In National Lampoon\\\\'s European Vacation, what Monty Python actor do the Griswalds literally keep running into?', 'Eric Idle', 'John Cleese', 'Terry Gilliam', 'Terry Jones', 1);\\n new Questions('chevy', 'Which Cheers actor was in the movie Fletch with Chevy Chase?', 'Woody Harrelson', 'Kelsey Grammer', 'George Wendt', 'Ted Danson', 3);\\n new Questions('cult', 'Who did not star in the 1982 classic, Fast Times at Ridgemont High?', 'Sean Penn', 'Forest Whitaker', 'Kevin Kline', 'Nicolas Cage', 3);\\n new Questions('chevy', 'What 1980s movie did Chevy Chase turn down a leading role in?', 'Airplane', 'American Gigolo', 'Stir Crazy', 'Private Benjamin', 2);\\n new Questions('chevy', 'What country were Emmett Fitz-Hume and Austin Millbarge sent to in Spies Like Us?', 'Saudi Arabia', 'Iran', 'Pakistan', 'Afghanistan', 3);\\n new Questions('cult', 'In Scarface, Tony Montana came to America from which country?', 'Columbia', 'Puerto Rico', 'Italy', 'Cuba', 4);\\n new Questions('chevy', 'What movie did Chevy Chase star in with Gregory Hines?', 'Deal Of The Century', 'The Couch Trip', 'Running Scared', 'Modern Problems', 1);\\n new Questions('action', 'Which popular wrestler starred in the movie They Live?', 'Hulk Hogan', 'Andre The Giant', '\\\"Rowdy\\\" Roddy Piper', 'Jimmy \\\"Superfly\\\" Snuka', 3);\\n new Questions('magic', 'What quintessential 80s rockband performed the soundtrack for Highlander?','Survivor', 'Rush', 'Journey', 'Queen', 4);\\n new Questions('cult', 'In Real Genius, what does Professor Hathaway hate the smell of?', 'Coffee', 'Dirty Sneakers','Popcorn', 'Hairspray', 3);\\n new Questions('magic', 'Who composed the film score for Beetlejuice?', 'John Williams', 'Hans Zimmer', 'Danny Elfman', 'Harold Faltimimer', 3);\\n new Questions('action', 'What type of bird call was used to create the Predator\\\\'s click noise?', 'Wood Pecker', 'Crow', 'Blue Jay', 'cockatoo', 2);\\n new Questions ('action', 'In Big Trouble in Little China, what must the sorceror do to retrieve his physical form?', 'Marry a green eyed girl', 'Sacrifice a pure woman', 'Bring back an ancestor from the dead', 'Kill a dragon', 1);\\n new Questions('action', 'What future date does The Running Man take place in?', '2020', '2001', '2033', '2017', 4);\\n new Questions('action', 'In Die Hard, what special gift does Riggs give Murtaugh at the end of the movie?', 'A special forces patch from his Army uniform', 'An unfired bullet', 'The bullet he was shot with during the movie', 'A zippo lighter he recieved from his deceased wife', 2);\\n new Questions ('cult', 'Complete this famous line from Mad Max, Road Warrior: \\\"A fella, a quick fella, might have a weapon under there it would be a shame if I had to..\\\"', 'take off his hand', 'serve him to the snake', 'pin his head to the panel', 'slit his throat', 3);\\n new Questions ('magic', 'What is the name of Honeythorn Gump\\\\'s fairy friend that accompanies them on their adventure in Legend?', 'Oona', 'Lilly', 'Asteria','Elvina', 1);\\n new Questions ('cult', 'In ending number one of Clue, who killed the cook?', 'Miss Scarlet','The Butler', 'Yvette', 'Professor Plum', 3);\\n new Questions ('chevy', 'What unwanted gift did Clark receive as his bonus during National Lampoon\\\\'s Christmas Vacation?', 'A yearly subscription to Time magazine', 'A yearly subscription to a Jelly of the Month Club', 'A really nice card', 'A designer set of towels', 2);\\n new Questions('chevy', 'What is Chevy Chase\\\\'s real name?', 'Christopher', 'Cornelius', 'Cameron', 'Colton', 2);\\n new Questions('horror', 'How many Evil Dead sequels were made?', '1', '2', '3', '4', 2);\\n new Questions('chevy', 'Which Las Angeles Lakers player made an appearance in the movie Fletch?', 'Magic Johnson', 'Kareem Abdul-Jabbar', 'James Worthy', 'A.C. Green', 2);\\n new Questions('chevy', 'In the movie Fletch, Irwin Fletcher published articles for the Las Angeles Times under which pseudonym?', 'Ann Landers', 'Mark Twain', 'Jane Doe', 'Busy Body', 3);\\n new Questions('horror', 'Chucky first appeared in which 80s horror film?', 'Good Guy', 'Child\\\\'s Play', 'Sleep Tight', 'Let\\\\'s Play', 2);\\n new Questions('horror', 'Which of the following is not a 1980s horror film?', 'The Stuff', 'The Blob', 'The Gate', 'The Slime', 4);\\n new Questions('horror', 'In the 1983 movie The Dead Zone, Christopher Walken\\\\'s character has what special power?', 'He can see the future', 'He can see dead people', 'He can become invisible', 'He can kill people with his mind', 1);\\n new Questions('horror', 'What model car was Christine in the 1983 John Carpenter movie?', '1958 Plymouth Fury', '1954 Buick Skylark', '1957 Ford Thunderbird', '1955 Chrysler 300', 1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3280024f440f51c1ad5e5f582e8ead5f\",\n \"score\": \"0.6943061\",\n \"text\": \"function generateQuestion(){\\n if(questions.length === 0) {\\n // If there are no quotes remaining, triggers end of game\\n handleEndOfGame();\\n } else {\\n randomNumber = generateRandomNumber();\\n $('#question').empty().append(questions[randomNumber].question);\\n $('#option1').empty().append(questions[randomNumber].option1);\\n $('#option2').empty().append(questions[randomNumber].option2);\\n $('#option3').empty().append(questions[randomNumber].option3);\\n $('#option4').empty().append(questions[randomNumber].option4);\\n $('#questionContainer').fadeIn(1000); \\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67fdd3185d08106c999bdd09632fa170\",\n \"score\": \"0.6941443\",\n \"text\": \"function initQuestion() {\\r\\n /* Question array */\\r\\n var q = [\\\"This is a Debian derived Linux distribution managed and funded by the Offensive Security Ltd, designed for digital forensics and penetration testing. Which is this very famous OS majorly developed for Hackers and software testers?\\\", \\\"What is DDoS?\\\", \\\"The word X is a combination of the words “robot” and “network”. It is a number of Internet-connected devices, each of which is running one or more bots. This can be used to perform DDoS attacks, steal data, send spam. Identify the word X?\\\"];\\r\\n\\r\\n /* Answer array */\\r\\n var a = [\\\"kalilinux\\\", \\\"distributeddenialofservice\\\", \\\"botnet\\\"];\\r\\n\\r\\n /* Make a new array containing the question objects */\\r\\n var question = [];\\r\\n for (var i = 0; i < q.length; i++) {\\r\\n question.push(new Question(q[i], a[i]));\\r\\n }\\r\\n return question;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"baaa0a2b2576819b11070d7b5f52da7f\",\n \"score\": \"0.69409657\",\n \"text\": \"function newGame(){\\n var create1 = new genQuestion(question1);\\n var create2 = new genQuestion(question2);\\n var create3 = new genQuestion(question3);\\n var create4 = new genQuestion(question4);\\n var create5 = new genQuestion(question5);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d54bd67dd29759f9873917c64541c5b\",\n \"score\": \"0.6936279\",\n \"text\": \"function questionSetup(current, answers, correct){\\n \\n this.current = current;\\n this.answers= answers;\\n this.correct = correct;\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"482210a0c6e388ca17c61f3e3a44d832\",\n \"score\": \"0.6915367\",\n \"text\": \"function newQuestion(){\\r\\n\\t// remove stylings\\r\\n\\t$('.correct').removeClass('correct');\\r\\n\\t$('.wrong').removeClass('wrong');\\r\\n\\t$('.disabled').removeClass('disabled');\\r\\n\\t$('.selected').removeClass('selected');\\r\\n\\r\\n\\t// hide the correct answer box\\r\\n\\t$('#dontknowbox').hide();\\r\\n\\tviewModel.currentAnswerAsText('');\\r\\n\\r\\n\\t// reset current and user values\\r\\n\\tviewModel.currentCardPosition(null);\\r\\n\\tviewModel.currentCardValue(null);\\r\\n\\tviewModel.currentCardSuit(null);\\r\\n\\tviewModel.userCardSuit(null);\\r\\n\\tviewModel.userCardValue(null);\\r\\n\\tviewModel.userCardPosition(null);\\r\\n\\tviewModel.currentCorrect(false);\\r\\n\\r\\n\\t// reset question styles visible\\r\\n\\tviewModel.questionStyleAVisible(false);\\r\\n\\tviewModel.questionStyleBVisible(false);\\t\\r\\n\\tviewModel.questionStyleCVisible(false);\\r\\n\\tviewModel.questionStyleDVisible(false);\\r\\n\\r\\n\\r\\n\\t// take card from bank\\r\\n\\tvar x = viewModel.currentBank()[0];\\r\\n\\r\\n\\t// set position, value and suit of this card\\r\\n\\tviewModel.currentCardPosition(x);\\r\\n\\tviewModel.currentCardValue(viewModel.stack()[x][0]);\\r\\n\\tviewModel.currentCardSuit(viewModel.stack()[x][1]);\\r\\n\\r\\n\\t// choose what type of question to use:\\r\\n\\tviewModel.randomSeed((Math.floor((Math.random() * 4) + 1)));\\r\\n\\t// viewModel.randomSeed(1); // debug\\r\\n\\t\\r\\n\\t// make that question visible\\r\\n\\tswitch (viewModel.randomSeed()) {\\r\\n\\t\\tcase 1: // user picks position of given card\\r\\n\\t\\t\\tviewModel.questionStyleAVisible(true);\\r\\n\\t\\tbreak;\\r\\n\\t\\tcase 2: // user picks card at given position \\r\\n\\t\\t\\tviewModel.questionStyleBVisible(true);\\t\\r\\n\\t\\tbreak;\\r\\n\\t\\tcase 3: // user gives card before a given card\\r\\n\\t\\t\\tviewModel.questionStyleCVisible(true);\\r\\n\\t\\tbreak;\\r\\n\\t\\tcase 4: // user gives card that is after a given card\\r\\n\\t\\t\\tviewModel.questionStyleDVisible(true);\\r\\n\\t\\tbreak;\\r\\n\\t}\\r\\n\\r\\n\\t// make the check button visible and the next button not\\r\\n\\tviewModel.nextVisible(false);\\r\\n\\tviewModel.checkVisible(true);\\r\\n\\tsaveDataToLocalStorage()\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7d3843a59299293ed03ad359f875323\",\n \"score\": \"0.68536645\",\n \"text\": \"newQuestion() {\\r\\n return {\\r\\n \\\"nb_answers\\\": 0,\\r\\n \\\"allowed_emojis\\\": [],\\r\\n \\\"objs\\\": {\\r\\n \\\"q\\\": {},\\r\\n \\\"e\\\": {}\\r\\n },\\r\\n \\\"results\\\": [],\\r\\n \\\"winner\\\": {},\\r\\n \\\"messages\\\": {\\r\\n \\\"response\\\": \\\"\\\",\\r\\n \\\"question\\\": \\\"\\\",\\r\\n },\\r\\n \\\"randomized\\\": false,\\r\\n \\\"success\\\": false\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d195d23a8827cacd5ce6263911711ab7\",\n \"score\": \"0.68338555\",\n \"text\": \"setTheNewQuestion() {\\n const englishWords = this.mapperOfEnglishWords();\\n const deutschWords = this.mapperOfDeutschWords();\\n const map = this.mapper();\\n const question = englishWords[Math.floor(Math.random() * englishWords.length)];\\n this.correctAnswer = map[question];\\n const wrongAnswers = deutschWords.filter(item => item !== this.correctAnswer);\\n for (let index = 0; index < 4; index++) {\\n let randomValue = Math.floor(Math.random() * wrongAnswers.length);\\n let aWrongAnswer = wrongAnswers[randomValue];\\n wrongAnswers.splice(randomValue, 1);\\n this.fillTheButtonText(\\\"#ChoiceButton\\\" + index, aWrongAnswer);\\n }\\n\\n this.correctAnswerIndex = Math.floor(Math.random() * 4);\\n this.fillTheButtonText(\\\"#ChoiceButton\\\" + this.correctAnswerIndex, this.correctAnswer);\\n\\n this.question.innerHTML = question;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80eff6866d9eb383de923f16e24e5f73\",\n \"score\": \"0.6810776\",\n \"text\": \"function populate_quiz_question(){\\n // Populate qns number out of total questions, e.g. Q 1 of 10\\n populate_question_of_total_question();\\n\\n // Populate title of question\\n populate_question_title();\\n\\n // Start the loop through the quiz questions\\n console.log(\\\"Current question count = \\\" + current_qns_count);\\n loop_through_quiz_questions();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bcc6b0d386e88852b97488314929c689\",\n \"score\": \"0.68083346\",\n \"text\": \"function setNextQuestions() {\\n resetState()\\n //randomize based on the questions variable index\\n showQuestion(shuffledQuestions[currentQuestionIndex])\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"645a838469f8ad0e94cd76195d15988c\",\n \"score\": \"0.6803702\",\n \"text\": \"function newQuestion() {\\n console.log(\\\"New question requested\\\");\\n\\n var questionTypes = [SimpleQuestion, ChoiceQuestion];\\n\\n // Load the next question\\n var question = new questionTypes[Math.floor(Math.random() * questionTypes.length)]();\\n question.renderQuestion();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"873123cafeac2e73960f326885c26ffb\",\n \"score\": \"0.6798145\",\n \"text\": \"function populateQuestions() {\\n if (\\n easyCountdown <= 0 ||\\n hardCountdown <= 0 ||\\n questionCount === questions.length\\n ) {\\n clearQuestions();\\n } else {\\n questionNumber.textContent = `Question ${questionCount + 1}/5`;\\n questionHeader.textContent = questions[questionCount].title;\\n populateButtons();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4beab75567e7cfd0c3c880442218a8a\",\n \"score\": \"0.67921925\",\n \"text\": \"function populateQuiz() {\\n // A. Keep count of questions presented\\n questionsAsked++;\\n \\n // B. Pull current question and corresponding answer options\\n let quizData = questionsArray[currentQuestion];\\n\\n questionNumber = quizData.questionNum;\\n questionCount.textContent = `Question ${questionNumber}`;\\n questionPlaceholder.textContent = quizData.question;\\n answerAPlaceholder.textContent = quizData.A;\\n answerBPlaceholder.textContent = quizData.B;\\n answerCPlaceholder.textContent = quizData.C;\\n answerDPlaceholder.textContent = quizData.D;\\n answerEPlaceholder.textContent = quizData.E;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"592cef64502ad90f346b44c6e07ec76b\",\n \"score\": \"0.6784942\",\n \"text\": \"function Quiz(questions){\\n this.score = 0;\\n this.questions = questions;\\n this.questionIndex = 0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"057abe32897a79ca1a387c59216331ea\",\n \"score\": \"0.67785996\",\n \"text\": \"function newQuestion() {\\n \\n indexQ = Math.floor(Math.random()*questionPool.length);\\n console.log(\\\"indexQ is \\\"+indexQ)\\n console.log(\\\"pool length is \\\"+questionPool.length)\\n questionText.innerText = JSON.stringify(questionPool[indexQ].question);\\n choiceText1.innerText = JSON.stringify(questionPool[indexQ].choice1)\\n choiceText2.innerText = JSON.stringify(questionPool[indexQ].choice2)\\n choiceText3.innerText = JSON.stringify(questionPool[indexQ].choice3)\\n choiceText4.innerText = JSON.stringify(questionPool[indexQ].choice4)\\n\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9628563122e4ea6108ae2470fe1e1d4\",\n \"score\": \"0.6775914\",\n \"text\": \"function populateQ() {\\n if (currentTime > 0 && questionIndex < questionArr.length) {\\n \\n // Populates question\\n changingTxt.textContent = questionArr[questionIndex].q;\\n \\n // Populates multiple choice & assigns values\\n for (var i=0; i < mcBtnArr.length; i++) {\\n mcBtnArr[i].textContent = questionArr[questionIndex].choices[i];\\n } \\n } \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"806a6f6eb1729af4cef4b13fdb0b3bbc\",\n \"score\": \"0.6774283\",\n \"text\": \"function populateQuesAndAns(eachQuestion) {\\n $('#question-view').text(eachQuestion.question);\\n for (var i = 0; i < eachQuestion.multipleChoice.length; i++) {\\n $($('.choice')[i]).text(eachQuestion.multipleChoice[i]);\\n }\\n quesCount += 1;\\n $('#question-status').text(quesCount + \\\" Question out of 10\\\");\\n displayResult(count);\\n $('.next').hide();\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d9e87f3de35ca0caf38d726066974fb\",\n \"score\": \"0.67520386\",\n \"text\": \"function init() {\\n // set the index of qArray to the first question in the array.\\n idx = 0;\\n // reset the score to 0\\n scores = 0;\\n // build a new set of randomly sorted questions for the user to answer\\n buildQuestionsArray();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"daf58493001fcc279c551ebf74ed0212\",\n \"score\": \"0.67499244\",\n \"text\": \"function generate(){\\n\\t//get form values\\n\\tdifficulty = document.getElementById('difficulty').value;\\n\\tnumquestions = document.getElementById('numQuestions').value;\\n\\tif(difficulty == \\\"chapter\\\"){\\n\\t\\tnumquestions = 50;\\n\\t}\\n\\t//check if # of questions is too large\\n\\tif(difficulty == \\\"beginner\\\" && numquestions > beginner.length){\\n\\t\\tnumquestions = beginner.length;\\n\\t\\twindow.alert(\\\"Test size too large. Lowering number of questions.\\\");\\n\\t}\\n\\tif(difficulty == \\\"simple\\\" && numquestions > simple.length){\\n\\t\\tnumquestions = simple.length;\\n\\t\\twindow.alert(\\\"Test size too large. Lowering number of questions.\\\");\\n\\t}\\n\\tif(difficulty == \\\"average\\\" && numquestions > average.length){\\n\\t\\tnumquestions = average.length;\\n\\t\\twindow.alert(\\\"Test size too large. Lowering number of questions.\\\");\\n\\t}\\n\\tif(difficulty == \\\"challenging\\\" && numquestions > challenging.length){\\n\\t\\tnumquestions = challenging.length;\\n\\t\\twindow.alert(\\\"Test size too large. Lowering number of questions.\\\");\\n\\t}\\n\\t//create an array of questions\\n\\tquestions = [];\\n\\t//try to prevent duplicate questions\\n\\tvar used = new Array();\\n\\tvar max;\\n\\tif(difficulty == \\\"beginner\\\"){\\n\\t\\tmax = beginner.length;\\n\\t}\\n\\tif(difficulty == \\\"simple\\\"){\\n\\t\\tmax = simple.length;\\n\\t}\\n\\tif(difficulty == \\\"average\\\"){\\n\\t\\tmax = average.length;\\n\\t}\\n\\tif(difficulty == \\\"challenging\\\"){\\n\\t\\tmax = challenging.length;\\n\\t}\\n\\tfor(var i = 0; i < max; i ++){\\n\\t\\tused[i] = false;\\n\\t}\\n\\t//loop to fill questions array\\n\\tfor(var i = 0; i < numquestions; i ++){\\n\\t\\tvar rand;\\n\\t\\tif(difficulty == \\\"beginner\\\"){\\n\\t\\t\\tdo{ \\n\\t\\t\\t\\trand = Math.floor(Math.random() * beginner.length);\\n\\t\\t\\t}\\n\\t\\t\\twhile(used[rand]);\\n\\t\\t\\tused[rand] = true;\\n\\t\\t\\tvar thisquestion = beginner[rand];\\n\\t\\t}\\n\\t\\telse if(difficulty == \\\"simple\\\"){\\n\\t\\t\\tdo{ \\n\\t\\t\\t\\trand = Math.floor(Math.random() * simple.length);\\n\\t\\t\\t}\\n\\t\\t\\twhile(used[rand]);\\n\\t\\t\\tused[rand] = true;\\n\\t\\t\\tvar thisquestion = simple[rand];\\n\\t\\t}\\n\\t\\telse if(difficulty == \\\"average\\\"){\\n\\t\\t\\tdo{ \\n\\t\\t\\t\\trand = Math.floor(Math.random() * average.length);\\n\\t\\t\\t}\\n\\t\\t\\twhile(used[rand]);\\n\\t\\t\\tused[rand] = true;\\n\\t\\t\\tvar thisquestion = average[rand];\\n\\t\\t}\\n\\t\\telse if(difficulty == \\\"challenging\\\"){\\n\\t\\t\\tdo{ \\n\\t\\t\\t\\trand = Math.floor(Math.random() * challenging.length);\\n\\t\\t\\t}\\n\\t\\t\\twhile(used[rand]);\\n\\t\\t\\tused[rand] = true;\\n\\t\\t\\tvar thisquestion = challenging[rand];\\n\\t\\t}\\n\\t\\telse if(difficulty == \\\"chapter\\\"){\\n\\t\\t\\tif(i < 11){ // 10 beginner\\n\\t\\t\\t\\trand = Math.floor(Math.random() * beginner.length);\\n\\t\\t\\t\\tvar thisquestion = beginner[rand];\\n\\t\\t\\t}\\n\\t\\t\\telse if(i >= 11 && i < 26){ // 15 simple\\n\\t\\t\\t\\trand = Math.floor(Math.random() * simple.length);\\n\\t\\t\\t\\tvar thisquestion = simple[rand];\\n\\t\\t\\t}\\n\\t\\t\\telse if(i >= 26 && i < 46){ // 20 average\\n\\t\\t\\t\\trand = Math.floor(Math.random() * average.length);\\n\\t\\t\\t\\tvar thisquestion = average[rand];\\n\\t\\t\\t}\\n\\t\\t\\telse if(i >= 46 && i < 50){ // 5 challenging\\n\\t\\t\\t\\trand = Math.floor(Math.random() * challenging.length);\\n\\t\\t\\t\\tvar thisquestion = challenging[rand];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tquestions.push(thisquestion);\\n\\t}\\n\\t//output\\n\\tvar out = '<div class=\\\"adminDataSection nohover\\\" style=\\\"width:97.5%; padding-left:5%; padding-right:5%; padding-top:2.5%; padding-bottom: 2.5%\\\">';\\n\\tfor(var i = 0; i < numquestions; i ++){\\n\\t\\tout = out + \\\"<form id='question\\\" + (i+1) + \\\"'><div class='form-group'><label>\\\" + (i+1) + \\\". \\\" + questions[i][0] + \\\"</label><br>\\\";\\n\\t\\tout = out + \\\"<label><input type='radio' name='answer\\\" + (i+1) + \\\"' value='1'>\\\" + questions[i][1] + \\\"</label><br>\\\";\\n\\t\\tout = out + \\\"<label><input type='radio' name='answer\\\" + (i+1) + \\\"' value='2'>\\\" + questions[i][2] + \\\"</label><br>\\\";\\n\\t\\tout = out + \\\"<label><input type='radio' name='answer\\\" + (i+1) + \\\"' value='3'>\\\" + questions[i][3] + \\\"</label><br>\\\";\\n\\t\\tout = out + \\\"<label><input type='radio' name='answer\\\" + (i+1) + \\\"' value='4'>\\\" + questions[i][4] + \\\"</label><br>\\\";\\t\\t \\n\\t\\tout = out + \\\"</div></form>\\\";\\n\\t}\\n\\tout = out + \\\"<button id='submitButton' class='btn btn-primary' onclick='submitAnswers()'>Score</button><form target='hideframe' id='scoreForm' style='display:none;' method='post'><input type='number' id='scoreValue' name='scoreValue'><input type='number' id='testNumber' name='testNumber'></form></div>\\\";\\n\\tcontent.innerHTML = out;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6014c5331f4e31247f63fc5c7c8cf1b\",\n \"score\": \"0.6740833\",\n \"text\": \"function resetQuestions() {\\n $('.autogenerate').remove();\\n counter = 0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aae21eed7ffc68eec0fb2c06d71b677f\",\n \"score\": \"0.6740296\",\n \"text\": \"function repopulateQuestion(data) {\\n\\n\\tif(data.template) {\\n\\t\\trepopulateTemplateQuestion(data);\\n\\t} else {\\n\\t\\trepopulateIndividualQuestion(data);\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8645303f474486adc0ac19986150ff5\",\n \"score\": \"0.6739203\",\n \"text\": \"function createQuestions() {\\n\\t $('#fade').fadeIn('slow');\\n\\t// unselect all radiobuttons at the start\\n\\tfor (var i = 0; i<4; i++) {\\n\\t\\t$(\\\"#answer\\\" + i).prop('checked', false);\\n\\t}\\n\\t$(\\\"#questions\\\").text(allQuestions[questionNum].question);\\n\\tcreateOptions();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5d2e4ef15d9aef2e3b79af88161c17f\",\n \"score\": \"0.6730938\",\n \"text\": \"function Quiz(questions) {\\n this.score = 0;\\n this.questions = questions;\\n this.questionIndex = 0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5d2e4ef15d9aef2e3b79af88161c17f\",\n \"score\": \"0.6730938\",\n \"text\": \"function Quiz(questions) {\\n this.score = 0;\\n this.questions = questions;\\n this.questionIndex = 0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c84b9dd7fedf2bae598fbf4a8778b8cb\",\n \"score\": \"0.67301095\",\n \"text\": \"function generateQuestions() {\\n finalEl.style.display = \\\"none\\\";\\n if (currentQuestionIndex === finalQuestionIndex) {\\n return displayScore();\\n }\\n var currentQuestion = questions[currentQuestionIndex];\\n questionEl.innerHTML = \\\"<p>\\\" + currentQuestion.question + \\\"</p>\\\";\\n button1.innerHTML = currentQuestion.choice1;\\n button2.innerHTML = currentQuestion.choice2;\\n button3.innerHTML = currentQuestion.choice3;\\n button4.innerHTML = currentQuestion.choice4;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebc981cbf6b995cb4102c54453b56587\",\n \"score\": \"0.6728595\",\n \"text\": \"InitializeQuestions(){\\n this.getOrderedQuestions()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bdd5a1f64496b255b35f0e8c9343ae1\",\n \"score\": \"0.67273176\",\n \"text\": \"function nextRandomQuestion(){\\r\\n \\r\\n //set of questions\\r\\nvar q1 = new QuestionSet('Where is Assam Located?',\\r\\n ['India', 'China', 'Bangladesh'],\\r\\n 0);\\r\\nvar q2 = new QuestionSet('Who is the current President of USA?',\\r\\n ['Obama', 'Bill Clinton', 'Donald Trump'],\\r\\n 2);\\r\\nvar q3 = new QuestionSet('Elun Musk is a/an :', \\r\\n ['Dancer', 'Athlete', 'Entrepreneur'],\\r\\n 2);\\r\\n \\r\\n//storing the questions in an array\\r\\nvar questions = [q1,q2,q3];\\r\\n \\r\\n//chooisng a random question\\r\\nvar n = Math.floor(Math.random(questions)*questions.length);\\r\\n\\r\\nquestions[n].DisplayQuestions(); //Displays Questions\\r\\n\\r\\nvar answer = prompt('Please give your Answer'); //promts user to input the correct option\\r\\n//Quits the game if user types 'exit'\\r\\nif(answer === 'exit'){\\r\\n \\r\\n console.log('---------------------------------');\\r\\n console.log('Refresh the page to Play the Quiz'); \\r\\n console.log('---------------------------------'); \\r\\n }\\r\\n else{\\r\\n \\r\\n questions[n].CheckAnswer(parseInt(answer), KeepScore); // Displays Correct Answer\\r\\n nextRandomQuestion();\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c8fb4411ed5bc75273f47113f468a5a\",\n \"score\": \"0.6719887\",\n \"text\": \"function setNextQuestion() {\\n resetquestion()\\n questiondisplay(randomanswers[Current])\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e1e9299b8e05618f85ab7d181973341\",\n \"score\": \"0.67028195\",\n \"text\": \"function generateQuestion() {\\r\\n\\t\\t// Randomly select assembled/combined item\\r\\n\\t\\tvar keysArr = [], \\r\\n\\t\\trandomItemName = '',\\r\\n\\t\\trandomItemObj = {};\\r\\n\\r\\n\\t\\tkeysArr = Object.keys(itemObj.combined);\\r\\n\\t\\trandomItemName = keysArr[Helper.randomInt(0, keysArr.length - 1)];\\r\\n\\t\\trandomItemObj = itemObj.combined[randomItemName];\\r\\n\\r\\n\\t\\tquestionArchive.push(\\r\\n\\t\\t\\tnew Question({\\r\\n\\t\\t\\t\\titemName: randomItemName,\\r\\n\\t\\t\\t\\tmaterials: randomItemObj.components,\\r\\n\\t\\t\\t\\treversed: (Helper.randomInt(0, 1) === 0), // Determine the quiz type\\r\\n\\t\\t\\t\\trecipe: getRecipe(randomItemObj.components, randomItemObj.cost),\\r\\n\\t\\t\\t}).createWrongItems() // Create wrong set of items and store it in question object.\\r\\n\\t\\t);\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"545b659948a4cf4f5abed57c4423365c\",\n \"score\": \"0.6696466\",\n \"text\": \"populateQuestions(questionsData) {\\n\\t\\t//Iterate over questions data and make a new TriviaQuestion for each question in the data\\n\\t\\t$.each(questionsData, (index, question) => {\\n\\t\\t\\t//Add newly instantiated trivia question object to questions array\\t\\n\\t\\t\\tthis.questionsList.push(new TriviaQuestion(question.question,\\n\\t\\t\\t\\tquestion.incorrect_answers,question.correct_answer));\\t\\t\\t\\t\\n\\t\\t});\\n\\n\\t\\t//Now in the questionPhase\\n\\t\\tthis.updateGameState('questionPhase');\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f204d08e7cba0440f07c5844691d08d7\",\n \"score\": \"0.6690915\",\n \"text\": \"function Quiz(questions) {\\n this.score = 0;\\n this.questions = questions;\\n this.questionIndex = 0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30add9442f4beeac8d93d939a86a03cf\",\n \"score\": \"0.66893685\",\n \"text\": \"function newQuestion() {\\n $(\\\"#message\\\").empty();\\n $(\\\"#correct-answer\\\").empty();\\n $(\\\"#image\\\").hide();\\n $(\\\"#fun-fact\\\").hide();\\n $(\\\"#timer-counter\\\").show();\\n answered = true;\\n\\n $(\\\"#current-question\\\").html(\\\"Question \\\" + (currentQuestion + 1) + \\\" of \\\" + questionsArray.length);\\n $(\\\".question\\\").html(questionsArray[currentQuestion].question);\\n\\n // tried to set up where questions get set up randomly, failed miserable. will try again after turning in assignment \\n // for (var j = 0; j < questionCount; j++ ) {\\n // var randomQuestion = questionsArray.splice (\\n // Math.floor(Math.random() * questionsArray.length), 1)[0];\\n // (existingQuestions());\\n // // Add the question to the tracker\\n // questionTracker.push(randomQuestion);\\n // }\\n \\n // // If the current random number already exists in the tracker, return true\\n // function existingQuestions() {\\n // for (var j = 0; j < questionTracker.length; j++) {\\n // if (questionTracker[j] === randomQuestion) {\\n // return true;\\n // }\\n // }\\n // return false;\\n // }\\n for (var i = 0; i < 4; i++) {\\n var choices = $(\\\"<div>\\\");\\n choices.text(questionsArray[currentQuestion].choicesArray[i]);\\n choices.attr({\\n \\\"data-index\\\": i\\n });\\n choices.addClass(\\\"thisChoice\\\");\\n $(\\\".answer-choices\\\").append(choices);\\n }\\n countdown();\\n //clicking an answer will pause the time \\n $(\\\".thisChoice\\\").on(\\\"click\\\", function () {\\n userSelect = $(this).data(\\\"index\\\");\\n clearInterval(time);\\n $(\\\"#timer-counter\\\").hide();\\n answers();\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"451162481b102dabbad3f6918fde7720\",\n \"score\": \"0.6684085\",\n \"text\": \"function setQuestion() {\\n nextQuestion(questionList[firstQuestion])\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d95540c02433003ea13406bc638f624\",\n \"score\": \"0.66763985\",\n \"text\": \"function newQuestion() {\\n if (index >= questionAnswerArray.length) {\\n endQuiz();\\n } else {\\n currentQuestion = questionAnswerArray[index];\\n question.textContent = currentQuestion.Question;\\n button1.textContent = currentQuestion.Answers[0];\\n button2.textContent = currentQuestion.Answers[1];\\n button3.textContent = currentQuestion.Answers[2];\\n button4.textContent = currentQuestion.Answers[3];\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"477c930419ba34fecd52aea2c59f8171\",\n \"score\": \"0.66757387\",\n \"text\": \"function newQuestion(){\\n\\t\\t$(\\\"#message\\\").empty();\\n\\t\\t$(\\\"#correctedAnswer\\\").empty();\\n\\t\\t$(\\\"#gif\\\").hide();\\n\\t\\t$(\\\"#gifCaption\\\").hide();\\n\\t\\tanswered = true;\\n\\t\\t\\n\\t\\t//This function displays the new question\\n\\t\\tif(currentQuestion){triviaQuestions.splice(currentQuestion-1, 1);}\\n\\t\\tcurrentQuestion = Math.round(Math.random()*(triviaQuestions.length-1));\\n\\t\\tconsole.log(triviaQuestions);\\n\\t\\t$(\\\"#currentQuestion\\\").html(\\\"Pregunta \\\" + ((parseInt(correctAnswer)+parseInt(incorrectAnswer)+parseInt(unanswered))+1) + \\\" de \\\" + ((document.getElementById(\\\"limite\\\").value)));\\n\\t\\t$(\\\".question\\\").html(triviaQuestions[currentQuestion].question);\\n\\n\\t\\t//This function displays the new questions's answer options in multiple choice type\\n\\t\\tfor(var i = 0; i <= 5; i++){\\n\\n\\t\\t\\tvar choices = $(\\\"<div>\\\");\\n\\t\\t\\tchoices.text(triviaQuestions[currentQuestion].answerList[i]);\\n\\t\\t\\tchoices.attr({\\\"data-index\\\": i });\\n\\t\\t\\tchoices.addClass(\\\"thisChoice\\\");\\n\\t\\t\\t$(\\\".answerList\\\").append(choices);\\n\\t\\t}\\n\\n\\t\\t//This sets the timer\\n\\t\\tcountdown();\\n\\n\\t\\t//When user clicks on n answer this will pause the time and display the correct answer to the question \\n\\t\\t$(\\\".thisChoice\\\").on(\\\"click\\\",function(){\\n\\t\\t\\t\\tuserSelect = $(this).data(\\\"index\\\");\\n\\t\\t\\t\\tclearInterval(time);\\n\\t\\t\\t\\tanswerPage();\\n\\t\\t\\t});\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12dad05d413c7b1010f660aa291f8d61\",\n \"score\": \"0.6669103\",\n \"text\": \"function loadQuestions() {\\n\\n\\t\\tfor ( var i=0; i < myQs.length; i++ ) {\\n\\t\\t\\tquestionArr.push( new Question( myQs[i].q, myQs[i].a, myQs[i].correctA ) );\\n\\t\\t}\\n\\t\\t//console.log(questionArr);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35fe551f1db2aeb29dd6b51f78634123\",\n \"score\": \"0.6658865\",\n \"text\": \"function newQuestion() {\\n $(\\\".click-btn\\\").hide();\\n number = 16;\\n question = questionsArray[index];\\n console.log(question);\\n\\n runTimer();\\n\\n $(\\\".image-display\\\").empty();\\n\\n $(\\\".question-display\\\")\\n .empty()\\n .append(questionsArray[index]);\\n\\n $(\\\"#answer-1\\\")\\n .empty()\\n .append(answers[index][0]);\\n\\n $(\\\"#answer-2\\\")\\n .empty()\\n .append(answers[index][1]);\\n\\n $(\\\"#answer-3\\\")\\n .empty()\\n .append(answers[index][2]);\\n\\n $(\\\"#answer-4\\\")\\n .empty()\\n .append(answers[index][3]);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e301e7ae46a45e0d4ed102bb16df0b8\",\n \"score\": \"0.66222835\",\n \"text\": \"function populateQuestions() {\\n \\n $(\\\"#questionNumber\\\").html(\\\"<p>Question \\\" + getQuestion[counter].questionNumber + \\\" out of 10</p>\\\");\\n $(\\\"#question\\\").text(getQuestion[counter].question);\\n $(\\\"#choiceBox\\\").append(\\\"<button class=\\\\\\\"clickMe\\\\\\\">\\\" + getQuestion[counter].options[0] + \\\"</button>\\\",\\n \\\"<button class=\\\\\\\"clickMe\\\\\\\">\\\" + getQuestion[counter].options[1] + \\\"</button>\\\");\\n $(\\\"#choiceBox\\\").append(\\\"<button class=\\\\\\\"clickMe\\\\\\\">\\\" + getQuestion[counter].options[2] + \\\"</button>\\\",\\n \\\"<button class=\\\\\\\"clickMe\\\\\\\">\\\" + getQuestion[counter].options[3] + \\\"</button>\\\")\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f7c822d6429495e7437226c237240ff\",\n \"score\": \"0.6621603\",\n \"text\": \"constructor(questions) {\\n this.score = 0;\\n this.questions = questions;\\n this.questionIndex = 0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c34ee8f1001569ba68c1beeada7082bb\",\n \"score\": \"0.6614671\",\n \"text\": \"function populate() {\\r\\n// alert(\\\"function populate started\\\");\\r\\n// this function gives each of the answers 0 points so if someone doesn't answer a question\\r\\n// the whole thing will continue to work\\r\\n for(var i=0; i<10; i++) { Quest[i]=0; }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e43de237fcaae8d85bed76462f82d049\",\n \"score\": \"0.66036505\",\n \"text\": \"function Quiz(questions) {\\n this.questions = questions;\\n\\n this.userAnswers = [];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c12aa52d34827ecfd7008c63f3058e05\",\n \"score\": \"0.6602285\",\n \"text\": \"function setNextQuestion() {\\n //resetState() when i removed questions started up\\n showQuestion()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cace6dc3560282c6af9963e0a190f32c\",\n \"score\": \"0.6600927\",\n \"text\": \"function makeQuestions(questions){\\n $scope.questions = questions;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9405ea0c58e685c0d892deb723d8be7f\",\n \"score\": \"0.65982234\",\n \"text\": \"function questionsManager()\\n {\\n // Get the current TestManager instance\\n var answers = app.getTest().getQuestionBank(),\\n answersLength = answers.length;\\n \\n // TODO: Update this description\\n incorrectAnswers = [],\\n \\n // TODO: Update this description\\n correctAnswers = [];\\n\\n // Check if interaction data exists\\n for (var x = 0; x < answersLength; x++)\\n {\\n // Build in/correct answer lists to pass\\n // Since the questions are manually graded,\\n // just push everything to the correct list\\n if (answers[x].learner_response !== undefined)\\n {\\n correctAnswers[x] = {\\n \\\"answer\\\" : answers[x].learner_response,\\n \\\"index\\\" : answers[x].id\\n };\\n }\\n }\\n \\n if (correctAnswers.length > 0)\\n {\\n //Build responses\\n buildSlideShow({\\n \\\"correctAnswers\\\" : correctAnswers\\n }); \\n }\\n else\\n {\\n buildSlideShow();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35a8a6a4b390c0cc2c75e18bbc343e72\",\n \"score\": \"0.6595699\",\n \"text\": \"function QuestionSet()\\n{\\n\\tthis.start = new Array();\\n\\tthis.onTrail = new Array();\\n\\tthis.capture = new Array();\\n\\tthis.transport = new Array();\\n\\n\\tthis.startUsed = new Array();\\n\\tthis.onTrailUsed = new Array();\\n\\tthis.captureUsed = new Array();\\n\\tthis.transportUsed = new Array();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70b9db74196ff9eebb156eeb6a74ba34\",\n \"score\": \"0.6594566\",\n \"text\": \"function resetAnswers() {\\n $(\\\"nextQ\\\").css(\\\"display\\\", \\\"none\\\");\\n gameInProgress = true;\\n contGame();\\n questionIteration++;\\n console.log(\\\"On interation \\\" + questionIteration);\\n $(\\\"#answerOptions\\\").empty();\\n changeQuestionsText(questionIteration);\\n correctOption = questionsArrays[questionIteration][\\\"correct\\\"];\\n //console.log(correctOption);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ca84f8f8aad78ed0c30399c8ff4e942\",\n \"score\": \"0.6579937\",\n \"text\": \"function createQuestions () {\\n let q = questionCounter;\\n if (q === questions.length) {\\n console.log('button removed');\\n } else {\\n $('#question').text(questions[q].question);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4f77e0ad113b29e543de5eaee31dff1\",\n \"score\": \"0.6572392\",\n \"text\": \"function question() {\\n\\t\\t\\t$('#questionNumber').text(questionCounter + ' / ' + totalQuestions)\\n\\t\\t\\t$('#stemQuestion').text(stemList[listIndex][1] + ' ');\\n\\t\\t\\t$('#answer').val('');\\n\\t\\t\\t$('#exampleVocabulary').text(stemList[listIndex][3]);\\n\\t\\t\\t$('#answer').focus();\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e114b9936217bfda66a23c45f8a18d7d\",\n \"score\": \"0.6566742\",\n \"text\": \"function loadPreviousQuestion() {\\r\\n //Decrement quentions index\\r\\n currentQuestion--;\\r\\n //remove last array value;\\r\\n score.pop();\\r\\n //Generate the question\\r\\n generateQuestions(currentQuestion);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ee29e5988e7c91bd1f6345a20d318b2\",\n \"score\": \"0.6563854\",\n \"text\": \"function questionReset() {\\n\\tfor (i = 0; i < 10; i++) {\\n\\t\\t// console.log(questionsIndex);\\n\\t\\t// console.log(junkyard);\\n\\t\\tquestionsIndex.push(junkyard[i]);\\n\\t}\\n\\tfor (i = 0; i < 10; i++) {\\n\\t\\tjunkyard.splice(junkyard[i], 1);\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"509e91844f6738e58c0e62266704335b\",\n \"score\": \"0.6552508\",\n \"text\": \"function buildQuestionArray() {\\n\\n for (let i = 0; i < questionAvailable; i++) {\\n questionArray.push(eval(\\\"question\\\" + i));\\n }\\n\\n // Shuffles question array\\n shuffleArray(questionArray);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d269d92c0e7c5d284858a3a3d20cdff\",\n \"score\": \"0.65462\",\n \"text\": \"function loadPreviousQuestion() {\\r\\n //Decrement quentions index\\r\\n currentQuestion--;\\r\\n //remove last array value;\\r\\n score.pop();\\r\\n //Generate the question\\r\\n generateQuestions(currentQuestion);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a2ede7b70acf353188d365bd9db4d48\",\n \"score\": \"0.6544964\",\n \"text\": \"function generateQuestion() {\\n let question = `<p class = 'question' >\\n Question: ${store.questionNumber + 1} / 5 </p>\\n <p>${store.questions[store.questionNumber].question}</p><p>SCORE:${\\n store.score\\n }/5</p>\\n <form class = 'check-submited-answer'>`;\\n for (\\n let i = 0;\\n i < store.questions[store.questionNumber].answers.length;\\n i++\\n ) {\\n let newAnswers = store.questions[store.questionNumber].answers[i];\\n question += ` <label>\\n <input class = 'js-checkAnswer' type=\\\"radio\\\" name = 'radAnswer' value = '${newAnswers}'>\\n <span id = 'focus' tabindex = '0'>${newAnswers}</span>\\n </label>\\n `;\\n }\\n question += `\\n \\n <div class = 'a-button-submit'>\\n <button id = 'submit-button' tabindex = '0' class=\\\"next-button\\\" type=\\\"button\\\" value=\\\"submit\\\" hidden = 'true'> SUBMIT </button>\\n </div>\\n <div id = \\\"answer\\\" hidden> </div>\\n </form>`;\\n $('.Start').html('');\\n $('.Start').html(question);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47214fc50b620f690666d4a3794d64c0\",\n \"score\": \"0.653825\",\n \"text\": \"function resetQuestion() {\\n $(\\\"#answers-area\\\").empty();\\n $(\\\"#question-area\\\").empty();\\n $(\\\".correct-ans\\\").empty();\\n $(\\\"#correct-ans-image-one\\\").empty();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9226d4c3f17fd140fc07380f82793a40\",\n \"score\": \"0.653741\",\n \"text\": \"function next_question() {\\n // clear question\\n $questions.empty();\\n // clear #picks\\n $picks.empty();\\n return\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d838856e493602777716812d3ccd74c8\",\n \"score\": \"0.6536722\",\n \"text\": \"function nextQuestion() {\\n setQuestionText()\\n clearAnswers();\\n buildAnswers();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a9a5e0e72480c48f00ab478d00f5f2f\",\n \"score\": \"0.65348333\",\n \"text\": \"constructor(options){\\n this.options = options;\\n //takes array from options_construct\\n this.bookList = options[0]; //list of 0/1 values, first value is 'all'\\n this.bookCount = this.countBooks(this.bookList);\\n\\n this.questionType = options[1]; // true is spoken, false is text\\n this.questionCount = options[2]; // integer value, -1 is infinite\\n this.questionTimer = options[3]; // integer value, -1 is no timer\\n this.questionRepeat = options[4]; // false is no repeated values, true allows repeats\\n\\n this.answerType = options[5] // 0 no details, 1 is a break, 2 correct/incorrect, 3 is full\\n this.answerTimer = options[6]; // integer value, -1 is no timer\\n this.answerInput = options[7]; // 0 MC, 1 write-in, 2 MC w/ chapter, 3 write-in w/ chapter\\n\\n this.generalSound = options[8]; // false no sound, true has sound\\n this.generalProgressBar = options[9]; // false no bar, true has bar\\n this.generalTimer = options[10]; // false timer not displayed, true timer displayed\\n\\n this.proportions = this.generateProportion(this.bookCount, this.questionCount);\\n\\n //generate question list\\n this.currentQuestion;\\n this.currentQuestionBonus = false; //bonus question boolean flag\\n\\n //multiple choice options -> first value is blank\\n this.currentTitles = [\\\"----\\\"];\\n this.currentAuthors = [\\\"----\\\"];\\n this.currentSources = [\\\"----\\\"];\\n\\n this.questionList = [];\\n this.usedQuestions = [];\\n this.generateQuestions(this.proportions);\\n\\n //user input tracker\\n this.responseTracker = [];\\n\\n //initialize session stats\\n this.stats = new statisticsTracker();\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f58e206907bba9da3c20ef12f4fba7f4\",\n \"score\": \"0.6527583\",\n \"text\": \"function questions() {\\n let q = questions[runningQuestion];\\n\\n question.innerHTML = \\\"<p>\\\" + q.question + \\\"</p>\\\";\\n choiceA.innerHTML = q.choiceA;\\n choiceB.innerHTML = q.choiceB;\\n choiceC.innerHTML = q.choiceC;\\n choiceD.innerHTML = q.choiceD;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"342fb948836406f04f8d832fb9a398bd\",\n \"score\": \"0.65250874\",\n \"text\": \"function setQuestion(){\\n // selects random question from var easy\\n random = Math.floor(Math.random() * easy.length);\\n current = easy[random]\\n //question\\n currentQuestion = current.question;\\n // the 4 choices in order of their place in a for loop\\n currentChoice0 = current.choice.choice0;\\n currentChoice1 = current.choice.choice1;\\n currentChoice2 = current.choice.choice2;\\n currentChoice3 = current.choice.choice3;\\n\\n // the correct choice\\n currentCorrectChoice = current.correctChoice;\\n // id targets from html page\\n showQuestion = document.getElementById(\\\"question\\\");\\n showChoice0 = document.getElementById(\\\"choice0\\\");\\n showChoice1 = document.getElementById(\\\"choice1\\\");\\n showChoice2 = document.getElementById(\\\"choice2\\\");\\n showChoice3 = document.getElementById(\\\"choice3\\\");\\n\\n\\n\\n // shows current question\\n showQuestion.innerText = currentQuestion\\n\\n\\n // shows choice options which connect to the current question\\n showChoice0.innerText = currentChoice0\\n showChoice1.innerText = currentChoice1\\n showChoice2.innerText = currentChoice2\\n showChoice3.innerText = currentChoice3\\n\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ceca76a97ca80ef894493cc17e52114\",\n \"score\": \"0.6522983\",\n \"text\": \"function loadPreviousQuestion() {\\n currentQuestion--;\\n //remove last value\\n score.pop();\\n //generate question\\n generateQuestions(currentQuestion);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e661b5255e3ddac3d19848ef5ca58064\",\n \"score\": \"0.6519909\",\n \"text\": \"function askQuestions() {\\n\\t\\tquestionTimer.start();\\n\\t\\t$('#question').html(qsArray[currentIndex].question);\\n\\t\\t$('#btn0').show().html(qsArray[currentIndex].answers[0]);\\n\\t\\t$('#btn1').show().html(qsArray[currentIndex].answers[1]);\\n\\t\\t$('#btn2').show().html(qsArray[currentIndex].answers[2]);\\n\\t\\t$('#btn3').show().html(qsArray[currentIndex].answers[3]);\\n\\t\\t$('#gifHolder').hide().off('click');\\n\\n\\t\\tonClickAnswer();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c03eb599e56283bc8fcaf00bf737888e\",\n \"score\": \"0.6517329\",\n \"text\": \"function newQuestion() {\\n\\t\\ttimer();\\n\\t\\tif (index >= questions.length) {\\n\\t\\t\\tendGame();\\n\\t\\t} else {\\n\\t\\t\\t$(\\\"#correct-question-box\\\").html(questions[index].questionTitle);\\n\\t\\t\\tvar question = questions[index];\\n\\t\\t\\tconsole.log(\\\"index: \\\" + index);\\n\\t\\t\\tvar choicesHtml = $(\\\".choices\\\");\\n\\t\\t\\tfor (var i = 0; i < choicesHtml.length; i++) {\\n\\t\\t\\t\\t// Updates the choices to the HTML page\\n\\t\\t\\t\\tvar choiceHTML = $(choicesHtml[i]);\\n\\t\\t\\t\\tvar selection = questions[index].choices[i];\\n\\t\\t\\t\\t$(choiceHTML).html(selection);\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Turns click off\\n\\t\\t\\t$(\\\".choices\\\").off(\\\"click\\\");\\n\\n\\t\\t\\t$(\\\"#choice-one-box.choices\\\").on(\\\"click\\\", function () {\\n\\t\\t\\t\\tvar userSelection = questions[index - 1].choices[0];\\n\\t\\t\\t\\tanswerHelper(userSelection, question);\\n\\t\\t\\t\\tclearInterval(countDownInterval);\\n\\t\\t\\t});\\n\\n\\t\\t\\t$(\\\"#choice-two-box.choices\\\").on(\\\"click\\\", function () {\\n\\t\\t\\t\\tvar userSelection = questions[index - 1].choices[1];\\n\\t\\t\\t\\tanswerHelper(userSelection, question);\\n\\t\\t\\t\\tclearInterval(countDownInterval);\\n\\t\\t\\t});\\n\\n\\t\\t\\t$(\\\"#choice-three-box.choices\\\").on(\\\"click\\\", function () {\\n\\t\\t\\t\\tvar userSelection = questions[index - 1].choices[2];\\n\\t\\t\\t\\tanswerHelper(userSelection, question);\\n\\t\\t\\t\\tclearInterval(countDownInterval);\\n\\t\\t\\t});\\n\\n\\t\\t\\t$(\\\"#choice-four-box.choices\\\").on(\\\"click\\\", function () {\\n\\t\\t\\t\\tvar userSelection = questions[index - 1].choices[3];\\n\\t\\t\\t\\tanswerHelper(userSelection, question);\\n\\t\\t\\t\\tclearInterval(countDownInterval);\\n\\t\\t\\t});\\n\\t\\t\\tindex++;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf518be32ca4c33784f2b663214ddc7b\",\n \"score\": \"0.6516582\",\n \"text\": \"function populateRandomQuestion(){\\n i = Math.floor(Math.random() * sqlQuestions.length);\\n console.log(`The value of i is ${i}`)\\n var randomQuestion = sqlQuestions[i];\\n nextQuestion.replaceWith(\\\"<p id = question></p>\\\")\\n $(\\\"#question\\\").text(randomQuestion.question);\\n nextAnswer.replaceWith(\\\"<p id = answer></p>\\\")\\n $(\\\"#answer\\\").text(randomQuestion.answer);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32e61149010332408b9b0144b2da36f7\",\n \"score\": \"0.6515139\",\n \"text\": \"function generateQuestion() {\\n if (questionNumber < STORE.length) {\\n return createForm(questionNumber);\\n } else {\\n $('.question-box').hide();\\n results();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b60fbc4ad5f6de2b82a8a6b7bf27427\",\n \"score\": \"0.6505692\",\n \"text\": \"function resetAnswers() {\\r\\n\\t\\texerciseAnswers = {\\r\\n\\t\\t\\tfirst: null,\\r\\n\\t\\t\\tsecond: null,\\r\\n\\t\\t\\tthird: null,\\r\\n\\t\\t\\tfourth: null,\\r\\n\\t\\t\\tfifth: null,\\r\\n\\t\\t\\tsixth: null\\r\\n\\t\\t},\\r\\n\\t\\tcorrectness = {\\r\\n\\t\\t\\tfirst: null,\\r\\n\\t\\t\\tsecond: null,\\r\\n\\t\\t\\tthird: null,\\r\\n\\t\\t\\tfourth: null,\\r\\n\\t\\t\\tfifth: null,\\r\\n\\t\\t\\tsixth: null\\t\\r\\n\\t\\t};\\r\\n\\r\\n\\t\\tdocument.dispatchEvent(new CustomEvent('model:destoryed'));\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ad4166aa89d6c9c19509d8cd4145ec3\",\n \"score\": \"0.65024614\",\n \"text\": \"function questionOne(){\\n\\n // Put in previous questions in function\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79820ff24abd77aff0b0989cf712b5c7\",\n \"score\": \"0.65020245\",\n \"text\": \"function generate(){\\n\\tq.innerHTML= data.questions[qIndex].question;\\n\\topt1.value= data.questions[qIndex].options[0];\\n\\topt2.value= data.questions[qIndex].options[1];\\n\\topt3.value= data.questions[qIndex].options[2];\\n\\topt4.value= data.questions[qIndex].options[3];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1fcad3d781e76fc58ee1906b031071b\",\n \"score\": \"0.64977986\",\n \"text\": \"function pickQuestions() {\\n currentquestion = Quiz[index];\\n setPage();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1434faddf822109de553e35fd43ef79a\",\n \"score\": \"0.64865273\",\n \"text\": \"function init() {\\n const data= questions();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"266e3695ee664f70bcd54a0c8037e7c9\",\n \"score\": \"0.64820796\",\n \"text\": \"function nextQuestion () {\\n //first get next question from array\\n currQuestionIndex = generateRandomNumber();\\n var question = questionnaire[currQuestionIndex].question;\\n //Display this new question in the html\\n showQuest.innerHTML = questionnaire[currQuestionIndex].question;\\n totalAskedQ++;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18f3c93e33b25fccbe1e4fb53ad7ff05\",\n \"score\": \"0.6478707\",\n \"text\": \"function newQuiz() {\\n $(\\\"#start-button\\\").remove();\\n $(\\\"#game-over\\\").text(\\\"Select the correct answer!!\\\");\\n correct = 0;\\n incorrect = 0;\\n unanswered = 0;\\n nextQuestion();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4592349ce588fbc88adfcf672c4670d4\",\n \"score\": \"0.6477452\",\n \"text\": \"function setNextQuestion() {\\r\\n resetState();\\r\\n showQuestion(shuffledQuestions[currentQuestionIndex]);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62abf254f92a9b15e38785bdd7610121\",\n \"score\": \"0.64716613\",\n \"text\": \"function createQuiz(q)\\n{\\n\\t//Loop through the questions\\n\\t//Determine question type\\n\\t//Fill in the template info\\n\\t//Append question to the page.\\n\\tfor(var i = 0; i < q.length; i++)\\n\\t{\\n\\t\\tvar type = q[i].type;\\n\\t\\tvar question = q[i].question;\\n\\t\\t//alert(type + \\\" \\\" + question);\\n\\t\\tif(type === \\\"mc\\\")\\n\\t\\t{\\n\\t\\t\\tvar a = q[i].a;\\n\\t\\t\\tvar b = q[i].b;\\n\\t\\t\\tvar c = q[i].c;\\n\\t\\t\\t\\n\\t\\t\\tvar temp = qmc.clone(true);\\n\\t\\t\\ttemp.attr(\\\"id\\\", \\\"MCQ\\\" + num.toString());\\n\\t\\t\\t\\n\\t\\t\\ttemp.find(\\\"#MXX\\\").attr(\\\"id\\\", \\\"M\\\" + num.toString()).text(question);\\n\\t\\t\\ttemp.find(\\\"#MLXX\\\").attr(\\\"id\\\", \\\"ML\\\" + num.toString()).attr(\\\"for\\\", \\\"M\\\" + num.toString()).text(\\\"Question \\\" + num.toString() + \\\": \\\");\\n\\t\\t\\t\\n\\t\\t\\ttemp.find(\\\"#MAIXX\\\").attr(\\\"id\\\", \\\"MAI\\\" + num.toString()).text(a);\\n\\t\\t\\ttemp.find(\\\"#AXX\\\").attr(\\\"id\\\", \\\"A\\\" + num.toString()).attr(\\\"name\\\", \\\"MC\\\" + num.toString());\\n\\t\\t\\t\\n\\t\\t\\ttemp.find(\\\"#MBIXX\\\").attr(\\\"id\\\", \\\"MBI\\\" + num.toString()).text(b);\\n\\t\\t\\ttemp.find(\\\"#BXX\\\").attr(\\\"id\\\", \\\"B\\\" + num.toString()).attr(\\\"name\\\", \\\"MC\\\" + num.toString());\\n\\t\\t\\t\\n\\t\\t\\ttemp.find(\\\"#MCIXX\\\").attr(\\\"id\\\", \\\"MCI\\\" + num.toString()).text(c);\\n\\t\\t\\ttemp.find(\\\"#CXX\\\").attr(\\\"id\\\", \\\"C\\\" + num.toString()).attr(\\\"name\\\", \\\"MC\\\" + num.toString());\\n\\t\\t\\t\\n\\t\\t\\t$(\\\"#Quiz\\\").append(temp);\\n\\t\\t\\tnum++;\\n\\t\\t\\tqtype.push(\\\"mc\\\");\\n\\t\\t}\\n\\t\\tif(type === \\\"tf\\\")\\n\\t\\t{\\n\\t\\t\\tvar temp = qtf.clone(true);\\n\\t\\t\\ttemp.attr(\\\"id\\\", \\\"TFQ\\\" + num.toString());\\n\\t\\t\\t\\n\\t\\t\\ttemp.find(\\\"#TFXX\\\").attr(\\\"id\\\", \\\"TF\\\" + num.toString()).text(question);\\n\\t\\t\\ttemp.find(\\\"#TFLXX\\\").attr(\\\"id\\\", \\\"TFL\\\" + num.toString()).attr(\\\"for\\\", \\\"TF\\\" + num.toString()).text(\\\"Question \\\" + num.toString() + \\\": \\\");\\n\\t\\t\\t\\n\\t\\t\\ttemp.find(\\\"#TXX\\\").attr(\\\"id\\\", \\\"T\\\" + num.toString()).attr(\\\"name\\\", \\\"TFC\\\" + num.toString());\\n\\t\\t\\ttemp.find(\\\"#FXX\\\").attr(\\\"id\\\", \\\"F\\\" + num.toString()).attr(\\\"name\\\", \\\"TFC\\\" + num.toString());\\n\\t\\t\\t\\n\\t\\t\\t$(\\\"#Quiz\\\").append(temp);\\n\\t\\t\\tnum++;\\n\\t\\t\\tqtype.push(\\\"tf\\\");\\n\\t\\t}\\n\\t\\tif(type === \\\"sa\\\")\\n\\t\\t{\\n\\t\\t\\tvar temp = qsa.clone(true);\\n\\t\\t\\ttemp.attr(\\\"id\\\", \\\"SAQ\\\" + num.toString());\\n\\t\\t\\t\\n\\t\\t\\ttemp.find(\\\"#SAXX\\\").attr(\\\"id\\\", \\\"SA\\\" + num.toString()).text(question);\\n\\t\\t\\ttemp.find(\\\"#SALXX\\\").attr(\\\"id\\\", \\\"SAL\\\" + num.toString()).attr(\\\"for\\\", \\\"SA\\\" + num.toString()).text(\\\"Question \\\" + num.toString() + \\\": \\\");\\n\\t\\t\\t\\n\\t\\t\\ttemp.find(\\\"#ANSXX\\\").attr(\\\"id\\\", \\\"ANS\\\" + num.toString()).attr(\\\"name\\\", \\\"SAC\\\" + num.toString());\\n\\t\\t\\t\\n\\t\\t\\t$(\\\"#Quiz\\\").append(temp);\\n\\t\\t\\tnum++;\\n\\t\\t\\tqtype.push(\\\"sa\\\");\\n\\t\\t}\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6511c2c4755d1c360f801eab8bab1d1\",\n \"score\": \"0.6469415\",\n \"text\": \"function Question(question) {\\n this.question = question;\\n this.answers = [];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37df610c443aaf3ea46cc6f767711fa0\",\n \"score\": \"0.6468998\",\n \"text\": \"function nextQ() {\\n // console.log(qA);\\n random = Math.floor(Math.random() * qA.length);\\n // console.log(random);\\n question = qA[random].q;\\n answer = qA[random].a;\\n qA.splice(random, 1);\\n var displayQ = $(\\\"#ask\\\");\\n displayQ.html(question);\\n console.log(qA);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb8649ba6a58b793a32c1e5dfd6cce9e\",\n \"score\": \"0.64687735\",\n \"text\": \"function CreateQuestion(){\\n\\tvar randomIndex = GetRandomIndex(count);\\n\\tvar choice;\\n\\n\\tquestion = books[randomIndex];\\n\\t\\n\\t// Do not get long books.\\n\\twhile(question.eser.length > 28) {\\n\\t\\tquestion = books[GetRandomIndex(count)];\\t\\t\\n\\t}\\n\\n\\t// Print the book name to the box.\\n\\t$(\\\"#book_name\\\").html(question.eser);\\n\\n\\t// Get random author names.\\n\\tfor(var i = 0; i < 3; i++) {\\n\\t\\tchoice = books[GetRandomIndex(count)];\\n\\n\\t\\tif(choices.indexOf(choice.yazar) == -1 || choice.yazar.length > 22){\\n\\t\\t\\tif(question.yazar !== choice.yazar){\\n\\t\\t\\t\\tif(!((question.hasOwnProperty(\\\"digerYazar\\\") && choice.yazar == question.digerYazar) ||\\n\\t\\t\\t\\t\\t(choice.hasOwnProperty(\\\"digerYazar\\\") && choice.digerYazar == question.yazar))) {\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// If all the conditions are satisfied, save it as an option.\\n\\t\\t\\t\\t\\tchoices[i] = choice.yazar;\\n\\n\\t\\t\\t\\t} else { i--; }\\n\\t\\t\\t} else { i--; }\\n\\t\\t} else { i--; }\\n\\t}\\n\\n\\t// Put the real answer into the array.\\n\\tanswerIndex = GetRandomIndex(3);\\n\\tchoices[answerIndex] = question.yazar;\\n\\n\\t// Print the choices to the buttons.\\n\\tfor(var i = 0; i < 3; i++) {\\n\\t\\t$('#button_' + i).html(choices[i]);\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0754e92b041c99925a0936a0bbecb1d8\",\n \"score\": \"0.64680153\",\n \"text\": \"function createQuestions() {\\n return [\\n {\\n letter: 'a',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CON LA A. Dicho de una supuesta criatura extraterrestre: Apoderarse de alguien.',\\n answer: 'abducir',\\n },\\n {\\n question: \\\"CON LA A. Legítimo Rey de Gondor en 'El señor de los anillos'.\\\",\\n answer: 'aragorn',\\n },\\n {\\n question:\\n 'CON LA A. Persona que se encarga del cumplimiento de las reglas en algunos deportes.',\\n answer: 'arbitro',\\n },\\n ],\\n },\\n {\\n letter: 'b',\\n status: 0,\\n questions: [\\n {\\n question:\\n \\\"CON LA B. Juego que ha sacado de quicio a todos los 'Skylabers' en las sesiones de precurso.\\\",\\n answer: 'bingo',\\n },\\n {\\n question:\\n 'CON LA B. Diosa egipcia de la protección, amor y armonía. Su cabeza tiene forma de gato.',\\n answer: 'bastet',\\n },\\n {\\n question: 'CON LA B. Mamífero acuático de gran tamaño.',\\n answer: 'ballena',\\n },\\n ],\\n },\\n {\\n letter: 'c',\\n status: 0,\\n questions: [\\n { question: 'CON LA C. Niño, crío, bebé.', answer: 'churumbel' },\\n {\\n question: \\\"CON LA C. De las novelas 'Canción de hielo y fuego', 'Las lluvias de...'.\\\",\\n answer: 'castamere',\\n },\\n {\\n question:\\n 'CON LA C. Automóvil destinado al transporte de personas y con capacidad no superior a siete plazas.',\\n answer: 'coche',\\n },\\n ],\\n },\\n {\\n letter: 'd',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CON LA D. Anormalidad en la función del aparato digestivo caracterizada por frecuentes evacuaciones y su consistencia líquida.',\\n answer: 'diarrea',\\n },\\n {\\n question:\\n 'CON LA D. Reptil fósil, propio del Mesozoico, generalmente de gran tamaño, cabeza pequeña, cuello largo, cola robusta y larga, y extremidades posteriores más largas que las anteriores.',\\n answer: 'dinosaurio',\\n },\\n {\\n question: 'CON LA D. Romper, hacer añicos.',\\n answer: 'destrozar',\\n },\\n ],\\n },\\n {\\n letter: 'e',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CON LA E. Afección cutánea caracterizada por vesículas rojizas y exudativas, que dan lugar a costras y escamas.',\\n answer: 'eccema',\\n },\\n {\\n question: 'CON LA E. Idioma universal artificial creado por el polaco L. L. Zamenhof.',\\n answer: 'esperanto',\\n },\\n {\\n question:\\n 'CON LA E. Jefe supremo del antiguo Imperio romano, y que originariamente se nombraba por aclamación del Ejército o decreto del Senado.',\\n answer: 'emperador',\\n },\\n ],\\n },\\n {\\n letter: 'f',\\n status: 0,\\n questions: [\\n {\\n question: 'CON LA F. Que no requiere gran esfuerzo, capacidad o dificultad.',\\n answer: 'facil',\\n },\\n {\\n question: 'CON LA F. Genero literario donde aparecen caballeros, dragones y magia.',\\n answer: 'fantasia',\\n },\\n {\\n question:\\n 'CON LA F. Cada uno de los antiguos reyes de Egipto anteriores a la conquista de este país por los persas.',\\n answer: 'faraon',\\n },\\n ],\\n },\\n {\\n letter: 'g',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CON LA G. Conjunto enorme de estrellas, polvo interestelar, gases y partículas.',\\n answer: 'galaxia',\\n },\\n {\\n question:\\n \\\"CON LA G. Título original en España de la aclamada película de ciencia ficción. 'La guerra de las...'.\\\",\\n answer: 'galaxias',\\n },\\n {\\n question: 'CON LA G. Educado, de buenas maneras.',\\n answer: 'gentil',\\n },\\n ],\\n },\\n {\\n letter: 'h',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CON LA H. Forma de suicidio ritual, practicado en el Japón por razones de honor o por orden superior, consistente en abrirse el vientre.',\\n answer: 'harakiri',\\n },\\n {\\n question: 'CON LA H. Herir el amor propio o la dignidad de alguien.',\\n answer: 'humillar',\\n },\\n {\\n question:\\n 'CON LA H. Agua convertida en cuerpo sólido y cristalino por un descenso suficiente de temperatura.',\\n answer: 'hielo',\\n },\\n ],\\n },\\n {\\n letter: 'i',\\n status: 0,\\n questions: [\\n {\\n question: 'CON LA I. Templo cristiano.',\\n answer: 'iglesia',\\n },\\n {\\n question: \\\"CON LA I. País-Ciudad controlada por Saruman en 'El señor de los anillos'.\\\",\\n answer: 'isengard',\\n },\\n {\\n question:\\n 'CON LA I. Cambiar, sustituyéndolos por sus contrarios, la posición, el orden o el sentido de las cosas.',\\n answer: 'invertir',\\n },\\n ],\\n },\\n {\\n letter: 'j',\\n status: 0,\\n questions: [\\n {\\n question:\\n \\\"CON LA J. Variedad salvaje del cerdo que sale en la película 'El Rey León', de nombre Pumba.\\\",\\n answer: 'jabali',\\n },\\n\\n {\\n question: 'CON LA J. Preparado farmacéutico líquido que se administra por la boca.',\\n answer: 'jarabe',\\n },\\n {\\n question: 'CONTIENE LA J. Actividad intensa que implica movimientos incesantes.',\\n answer: 'ajetreo',\\n },\\n ],\\n },\\n {\\n letter: 'l',\\n status: 0,\\n questions: [\\n {\\n question: 'CON LA L. Único satélite natural de la Tierra.',\\n answer: 'luna',\\n },\\n {\\n question:\\n 'CON LA L. Persona que, según la tradición popular, se convierte en lobo las noches de plenilunio.',\\n answer: 'licantropo',\\n },\\n {\\n question: 'CON LA L. Que ha perdido la razón.',\\n answer: 'loco',\\n },\\n ],\\n },\\n {\\n letter: 'm',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CON LA M. Persona que huye del trato con otras personas o siente gran aversión hacia ellas.',\\n answer: 'misantropo',\\n },\\n {\\n question:\\n 'CON LA M. Figura decorativa tallada en madera situada en la proa de antiguos buques.',\\n answer: 'mascaron',\\n },\\n {\\n question:\\n 'CON LA M. Parte del día comprendida entre el amanecer y el mediodía, o la hora de comer o almorzar.',\\n answer: 'mañana',\\n },\\n ],\\n },\\n {\\n letter: 'n',\\n status: 0,\\n questions: [\\n {\\n question: 'CON LA N. Demostración de poca inteligencia.',\\n answer: 'necedad',\\n },\\n {\\n question: 'CON LA N. Mago especializado en magia negra y resucitar muertos.',\\n answer: 'nigromante',\\n },\\n {\\n question:\\n 'CON LA N. Sustancia blanca formada por la precipitación de agua a bajas temperaturas.',\\n answer: 'nieve',\\n },\\n ],\\n },\\n {\\n letter: 'ñ',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CONTIENE LA Ñ. Indicio que permite deducir algo de lo que no se tiene un conocimiento directo.',\\n answer: 'señal',\\n },\\n {\\n question: 'CON LA Ñ. Antílope sudafricano.',\\n answer: 'ñu',\\n },\\n {\\n question: 'CONTIENE LA Ñ: Golpe que se da con el puño de la mano.',\\n answer: 'puñetazo',\\n },\\n ],\\n },\\n {\\n letter: 'o',\\n status: 0,\\n questions: [\\n {\\n question: 'CON LA O. Órgano externo de la audición.',\\n answer: 'oreja',\\n },\\n\\n {\\n question: 'CON LA O. Onda de gran amplitud que se forma en la superficie de las aguas.',\\n answer: 'ola',\\n },\\n {\\n question: 'CON LA O. Adorno, compostura, atavío que hace vistosa una cosa.',\\n answer: 'ornamento',\\n },\\n ],\\n },\\n {\\n letter: 'p',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CON LA P. Raza ancestral tecnológicamente avanzada que se caracteriza por sus grandes poderes psiónicos del videojuego StarCraft.',\\n answer: 'protoss',\\n },\\n {\\n question: 'CON LA P: Que se repite con frecuencia a intervalos determinados.',\\n answer: 'periodico',\\n },\\n {\\n question:\\n 'CON LA P. Utensilio de hierro en forma de rejilla para poner al fuego lo que se ha de asar o tostar.',\\n answer: 'parrilla',\\n },\\n ],\\n },\\n {\\n letter: 'q',\\n status: 0,\\n questions: [\\n {\\n question: 'CON LA Q. Producto obtenido por la maduración de la cuajada de la leche',\\n answer: 'queso',\\n },\\n {\\n question:\\n 'CON LA Q. Piezas bucales presentes en un subfilo de artrópodos como los arácnidos.',\\n answer: 'queliceros',\\n },\\n { question: 'CON LA Q. Destruir algo o a alguien con fuego.', answer: 'quemar' },\\n ],\\n },\\n {\\n letter: 'r',\\n status: 0,\\n questions: [\\n {\\n question: \\\"CON LA R. Ciudad élfica gobernada por Elrond en 'El señor de los anillos'.\\\",\\n answer: 'rivendel',\\n },\\n {\\n question:\\n 'CON LA R. Mamífero roedor de pequeño tamaño, de hocico puntiagudo y cola larga, de pelaje corto.',\\n answer: 'raton',\\n },\\n {\\n question:\\n 'CON LA R. Corriente de agua continua y más o menos caudalosa que va a desembocar en otra, en un lago o en el mar.',\\n answer: 'rio',\\n },\\n ],\\n },\\n {\\n letter: 's',\\n status: 0,\\n questions: [\\n {\\n question: 'CON LA S. Comunidad salvadora de todo desarrollador informático.',\\n answer: 'stackoverflow',\\n },\\n\\n {\\n question: 'CON LA S. Baile típico de brasil.',\\n answer: 'samba',\\n },\\n {\\n question: 'CON LA S. Representarse en la fantasía imágenes o sucesos mientras se duerme.',\\n answer: 'soñar',\\n },\\n ],\\n },\\n {\\n letter: 't',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CON LA T. Película del director James Cameron que consolidó a Arnold Schwarzenegger como actor en 1984.',\\n answer: 'terminator',\\n },\\n {\\n question:\\n 'CON LA T. Alimento preparado con huevo batido, cuajado con aceite en la sartén y de forma redonda o alargada, al que a veces se añaden otros ingredientes.',\\n answer: 'tortilla',\\n },\\n {\\n question:\\n 'CON LA T. Grave dolor físico o psicológico infligido a alguien, con métodos y utensilios diversos, con el fin de obtener de él una confesión, o como medio de castigo.',\\n answer: 'tortura',\\n },\\n ],\\n },\\n {\\n letter: 'u',\\n status: 0,\\n questions: [\\n {\\n question:\\n \\\"CON LA U. Escritor y filósofo español de la generación del 98 autor del libro 'Niebla' en 1914.\\\",\\n answer: 'unamuno',\\n },\\n {\\n question: 'CON LA U. Instrumento de cuerda similar a la guitarra pero más pequeño.',\\n answer: 'ukelele',\\n },\\n {\\n question: 'CON LA U. Objeto fabricado que se destina a un uso manual y doméstico.',\\n answer: 'utensilio',\\n },\\n ],\\n },\\n {\\n letter: 'v',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CON LA V. Nombre dado a los miembros de los pueblos nórdicos originarios de Escandinavia, famosos por sus incursiones y pillajes en Europa.',\\n answer: 'vikingos',\\n },\\n {\\n question:\\n 'CON LA V. Traspasar a alguien por el precio convenido la propiedad de lo que se posee.',\\n answer: 'vender',\\n },\\n {\\n question: 'CON LA V. Hortaliza, especialmente la de hojas verdes.',\\n answer: 'verdura',\\n },\\n ],\\n },\\n {\\n letter: 'x',\\n status: 0,\\n questions: [\\n {\\n question: 'CONTIENE LA X. Toxina bacteriana utilizada en cirujía estética.',\\n answer: 'botox',\\n },\\n {\\n question:\\n 'CON LA X. Instrumento musical de percusión formado por láminas generalmente de madera, ordenadas horizontalmente según su tamaño y sonido, que se hacen sonar golpeándolas con dos baquetas.',\\n answer: 'xilofono',\\n },\\n {\\n question: 'CON LA X. Fobia a los extranjeros.',\\n answer: 'xenofobia',\\n },\\n ],\\n },\\n {\\n letter: 'y',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CONTIENE LA Y. Planta cactácea, de pequeño tamaño, que contiene una sustancia cuya ingestión produce efectos alucinógenos y narcóticos.',\\n answer: 'peyote',\\n },\\n {\\n question:\\n 'CONTIENE LA Y. Abominable hombre de las nieves. Supuesto gigante antropomorfo, del cual se dice que vive en el Himalaya.',\\n answer: 'yeti',\\n },\\n {\\n question:\\n 'CONTIENE LA Y. Pieza de la armadura antigua que resguardaba la cabeza y el rostro, y se componía de morrión, visera y babera.',\\n answer: 'yelmo',\\n },\\n ],\\n },\\n {\\n letter: 'z',\\n status: 0,\\n questions: [\\n {\\n question:\\n 'CON LA Z. Escuela de budismo que busca la experiencia de la sabiduría más allá del discurso racional.',\\n answer: 'zen',\\n },\\n {\\n question: 'CON LA Z. Zapato de madera de una pieza.',\\n answer: 'zueco',\\n },\\n {\\n question:\\n 'CON LA Z. Calzado que no pasa del tobillo, con la parte inferior de suela y lo demás de piel, fieltro, paño u otro tejido, más o menos escotado por el empeine.',\\n answer: 'zapato',\\n },\\n ],\\n },\\n ];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd0613b36851808af9f2bbb77174576a\",\n \"score\": \"0.64674777\",\n \"text\": \"function setNextQuestion () {\\n resetState()\\n showQuestion (shuffledQuestions[currentQuestionIndex])\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b6f46fa0f3e3017fab0c4d7e29436e8\",\n \"score\": \"0.6464019\",\n \"text\": \"function generateNextQuestions()\\r\\n{\\r\\n if(defaultQuestions[counter])\\r\\n {\\r\\n\\t\\tFirstQuestion.innerText = (counter+1) +\\\". \\\"+ defaultQuestions[counter].QuestionText; \\r\\n\\t\\tfirstAnswer.style.visibility = \\\"visible\\\";\\r\\n }\\r\\n else\\r\\n {\\r\\n FirstQuestion.innerText = \\\"\\\";\\r\\n firstAnswer.style.visibility = \\\"hidden\\\";\\r\\n }\\r\\n if(defaultQuestions[counter+1])\\r\\n {\\r\\n\\t\\tSecondQuestion.innerText = (counter+2) +\\\". \\\"+ defaultQuestions[counter+1].QuestionText;\\r\\n\\t\\tsecondAnswer.style.visibility = \\\"visible\\\";\\r\\n }\\r\\n else\\r\\n {\\r\\n SecondQuestion.innerText = \\\"\\\";\\r\\n secondAnswer.style.visibility = \\\"hidden\\\";\\r\\n }\\r\\n firstAnswer.value = \\\"\\\"; \\r\\n secondAnswer.value = \\\"\\\";\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba67cef78fdc2d6bef04d59d7f698612\",\n \"score\": \"0.6462216\",\n \"text\": \"async function uniformData() {\\n\\n // iterate over all question data sets\\n await $.asyncForEach( self.questions, async ( question, i ) => {\\n\\n // each question knows her original number and HTML ID\\n question.nr = i + 1; question.id = 'question-' + question.nr;\\n\\n // consider default values for question data from instance config\\n self.questions[ i ] = question = await $.integrate( $.filterProperties( self, 'text', 'description', 'answers', 'input', 'attributes', 'swap', 'escape', 'random', 'solution' ), question, true );\\n\\n // default input type is checkbox\\n if ( !question.input ) question.input = 'checkbox';\\n\\n // set default information about correct answers\\n if ( !question.solution && question.input !== 'radio' ) question.solution = [];\\n\\n // answer data sets could be given as single string (answer text) instead of object\\n for ( i = 0; i < question.answers.length; i++ )\\n if ( !$.isObject( question.answers[ i ] ) )\\n question.answers[ i ] = { text: question.answers[ i ] };\\n\\n // information about correct answers of a multiple choice question could be given as integer array instead of boolean array\\n if ( question.input === 'checkbox' && typeof question.solution[ 0 ] === 'number' ) {\\n const solution = [];\\n for ( i = 0; i < question.answers.length; i++ )\\n solution.push( question.solution.indexOf( i ) >= 0 );\\n question.solution = solution;\\n }\\n\\n // fill up array of information about correct answers with default values (checkbox -> false, otherwise empty string)\\n if ( Array.isArray( question.solution ) )\\n for ( i = 0; i < question.answers.length; i++ )\\n if ( question.solution[ i ] === undefined )\\n question.solution[ i ] = question.input === 'checkbox' ? false : '';\\n\\n // iterate over all answers\\n await $.asyncForEach( question.answers, async ( answer, i ) => {\\n\\n // each answer knows her original number, HTML class and HTML ID\\n answer.nr = i + 1; answer.class = 'answer-' + answer.nr; answer.id = question.id + '-' + answer.class;\\n\\n // information about correct answers of a question could be given via answer data\\n if ( answer.correct !== undefined )\\n if ( question.input === 'radio' ) {\\n if ( answer.correct === true ) question.solution = i;\\n }\\n else\\n question.solution[ i ] = question.input === 'number' ? parseInt( answer.correct ) : answer.correct;\\n\\n // consider default values for answer data from question data\\n question.answers[ i ] = await $.integrate( $.filterProperties( question, 'attributes', 'swap', 'escape' ), answer, true );\\n\\n } );\\n\\n // remove no more needed properties in question data\\n delete question.attributes; delete question.swap;\\n\\n } );\\n\\n // remove no more needed properties in config\\n delete self.text; delete self.description; delete self.answers; delete self.input; delete self.attributes; delete self.swap; delete self.escape; delete self.random; delete self.solution;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3796e65ccf740d396f191eb34807e03e\",\n \"score\": \"0.646083\",\n \"text\": \"function setNextQuestion() {\\n resetState()\\n showQuestion(shuffledQuestion[currentQuestionIndex])\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68f2b89d11cd9c91387d70b8332f8da3\",\n \"score\": \"0.6442499\",\n \"text\": \"function getNewQuestion() {\\r\\n\\r\\n // set question number\\r\\n questionNumber.innerHTML = \\\"Question \\\" + (questionCounter + 1) + \\\" of \\\" + quiz.length;\\r\\n\\r\\n // set question text\\r\\n // get rendom question\\r\\n var questionIndex = availabeQuestion[Math.floor(Math.random() * availabeQuestion.length)]\\r\\n currentQuestion = questionIndex;\\r\\n questionText.innerHTML = currentQuestion.q;\\r\\n\\r\\n // get the position of 'questionIndex' from availableQuestion\\r\\n var index1 = availabeQuestion.indexOf(questionIndex);\\r\\n\\r\\n // remove the 'questionIndex' from availableQuestion so that the questions is not repeat\\r\\n availabeQuestion.splice(index1, 1);\\r\\n\\r\\n // set options\\r\\n // get the length of options\\r\\n\\r\\n var optionsLen = currentQuestion.options.length;\\r\\n\\r\\n // push optins into available option Array\\r\\n for (var i = 0; i < optionsLen; i++) {\\r\\n availabeOptions.push(i)\\r\\n }\\r\\n\\r\\n optionContainer.innerHTML = '';\\r\\n\\r\\n var animationDelay = 0.15;\\r\\n // creat options in HTML\\r\\n\\r\\n for (var i = 0; i < optionsLen; i++) {\\r\\n // random option\\r\\n var optonIndex = availabeOptions[Math.floor(Math.random() * availabeOptions.length)];\\r\\n\\r\\n // get the position of 'optonIndex' from the availabeOptions\\r\\n var index2 = availabeOptions.indexOf(optonIndex);\\r\\n\\r\\n // remove the 'optonIndex' from availableOptions so that the questions is not repeat\\r\\n availabeOptions.splice(index2, 1);\\r\\n var option = document.createElement(\\\"div\\\");\\r\\n option.innerHTML = currentQuestion.options[optonIndex];\\r\\n option.id = optonIndex;\\r\\n option.style.animationDelay = animationDelay + 's';\\r\\n animationDelay = animationDelay + 0.15;\\r\\n option.className = \\\"option\\\";\\r\\n optionContainer.appendChild(option);\\r\\n option.setAttribute(\\\"onclick\\\", \\\"getResult(this)\\\")\\r\\n\\r\\n }\\r\\n\\r\\n // console.log(currentQuestion.options)\\r\\n\\r\\n\\r\\n\\r\\n questionCounter++\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc6073bcffea72baea8ac2a9a802ffee\",\n \"score\": \"0.6441558\",\n \"text\": \"function nextQuestion() {\\n /* Chose new question until the question was not asked yet -- Crashes if no more available questions */\\n\\n while (questionArray[questionNumberToShow].allreadyAsked) {\\n questionNumberToShow = Math.floor(Math.random() * questionArray.length);\\n }\\n\\n /* Shuffle the answers of the chosen question */\\n\\n questionArray[questionNumberToShow].answerArray = shuffleArray(\\n questionArray[questionNumberToShow].answerArray\\n );\\n\\n /* Set the question in the site content */\\n\\n questionTextHTML.innerText = questionArray[questionNumberToShow].questionText;\\n answer1HTML.innerText = questionArray[questionNumberToShow].answerArray[0];\\n answer2HTML.innerText = questionArray[questionNumberToShow].answerArray[1];\\n answer3HTML.innerText = questionArray[questionNumberToShow].answerArray[2];\\n answer4HTML.innerText = questionArray[questionNumberToShow].answerArray[3];\\n\\n correctToShowHTML.innerText = `Leider ze spéit! Déi richteg Äntwert war ${questionArray[questionNumberToShow].correctAnswer}`;\\n\\n /* Set allready asked to true because question was asked */\\n\\n questionArray[questionNumberToShow].allreadyAsked = true;\\n\\n /* Remove colors and hidden from answers */\\n\\n answer1HTML.classList.remove(\\\"answerfalse\\\");\\n answer2HTML.classList.remove(\\\"answerfalse\\\");\\n answer3HTML.classList.remove(\\\"answerfalse\\\");\\n answer4HTML.classList.remove(\\\"answerfalse\\\");\\n answer1HTML.classList.remove(\\\"answercorrect\\\");\\n answer2HTML.classList.remove(\\\"answercorrect\\\");\\n answer3HTML.classList.remove(\\\"answercorrect\\\");\\n answer4HTML.classList.remove(\\\"answercorrect\\\");\\n allAnswersHTML.classList.remove(\\\"hidden\\\");\\n\\n /* Set possible trys back to 4 */\\n\\n answerTrys = 4;\\n\\n /* Update questions to ask */\\n numberOfQuestionsAllreadyAsked++;\\n numberofQuestionsToAsk--;\\n console.log(numberofQuestionsToAsk);\\n\\n /* Update image */\\n\\n imageFeedbackHTML.setAttribute(\\\"src\\\", \\\"questionMark.png\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a3113915b6cdf567d3ef2379537f077\",\n \"score\": \"0.6440944\",\n \"text\": \"function setNextQuestion() {\\n resetState();\\n showQuestion(shuffledQuestions[currentQuestionIndex]);\\n currentQuestionIndex++;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f3a693df8696fa6b2571c1cbeaba854\",\n \"score\": \"0.6440389\",\n \"text\": \"function setup() {\\n var currQuestion = register[questionNr];\\n \\n question.innerHTML = \\\"<b>Question \\\" + (questionNr + 1) + \\\"/3:</b><br>\\\" + currQuestion.question;\\n choiceList[0].innerHTML = \\\"1. \\\" + currQuestion.choices[0];\\n choiceList[1].innerHTML = \\\"X. \\\" + currQuestion.choices[1];\\n choiceList[2].innerHTML = \\\"2. \\\" + currQuestion.choices[2];\\n correctAnswer = currQuestion.answer;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32434106b7096afdb60999cde0310fcd\",\n \"score\": \"0.64375913\",\n \"text\": \"function createQuestions(){\\n buildButtons(quizCards[longClock].answerChoices);\\n questionTitle.textContent = quizCards[longClock].question;\\n\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":71,"cells":{"query_id":{"kind":"string","value":"1bd114b8b72f3c32ad22ac07270ccd69"},"query":{"kind":"string","value":"'this' will refer to tdInstance here."},"positive_passages":{"kind":"list like","value":[{"docid":"974f97f6a39a72aa861ebfafb3175a67","score":"0.0","text":"function onPlaylistPreloaded(e) {\n this.getTracks(function(tracks) {\n var nowPlaying = this.getTrack();\n\n log(tracks);\n\n // If parameters.single is not explicitly set to false and\n // there is only one track, render the single-track player.\n if(tracks.length === 1 && playerParameters.single !== false && playerParameters.mini == false && playerParameters.feed == false) {\n playerParameters.single = true;\n }\n\n container.find('.tdspinner').hide();\n\n rerender({\n feed: playerParameters.feed,\n mini: playerParameters.mini,\n nowPlaying: nowPlaying,\n shrink: playerParameters.shrink,\n single: playerParameters.single,\n skin: playerParameters.skin,\n tracks: tracks,\n tracksPerArtist: playerParameters.tracksPerArtist,\n visualizerType: playerParameters.visualizerType\n });\n\n if(this.getSound() && !this.getSound().paused) {\n changePlayButton(false);\n }\n }.bind(this));\n }","title":""}],"string":"[\n {\n \"docid\": \"974f97f6a39a72aa861ebfafb3175a67\",\n \"score\": \"0.0\",\n \"text\": \"function onPlaylistPreloaded(e) {\\n this.getTracks(function(tracks) {\\n var nowPlaying = this.getTrack();\\n\\n log(tracks);\\n\\n // If parameters.single is not explicitly set to false and\\n // there is only one track, render the single-track player.\\n if(tracks.length === 1 && playerParameters.single !== false && playerParameters.mini == false && playerParameters.feed == false) {\\n playerParameters.single = true;\\n }\\n\\n container.find('.tdspinner').hide();\\n\\n rerender({\\n feed: playerParameters.feed,\\n mini: playerParameters.mini,\\n nowPlaying: nowPlaying,\\n shrink: playerParameters.shrink,\\n single: playerParameters.single,\\n skin: playerParameters.skin,\\n tracks: tracks,\\n tracksPerArtist: playerParameters.tracksPerArtist,\\n visualizerType: playerParameters.visualizerType\\n });\\n\\n if(this.getSound() && !this.getSound().paused) {\\n changePlayButton(false);\\n }\\n }.bind(this));\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"939791025edbd806410f7d0a6de0c114","score":"0.58534116","text":"setTR(t, r) {\nthis._t = t;\nthis._r = r;\nreturn this;\n}","title":""},{"docid":"f8d4419b49780f7014f96fc9a0f2bd6b","score":"0.56894654","text":"setT(t) {\nthis._t = t;\nreturn this;\n}","title":""},{"docid":"138d112863a2c0b9fa57ebb142ba4c75","score":"0.56351155","text":"getWrappedInstance() {\n if (!this.wrappedInstance) console.warn('RTSelectTable - No wrapped instance')\n if (this.wrappedInstance.getWrappedInstance) return this.wrappedInstance.getWrappedInstance()\n else return this.wrappedInstance\n }","title":""},{"docid":"1e976fcc6fa7aee3da521661116d8dae","score":"0.54664683","text":"TP(val) {\n this._TP = val;\n return this;\n }","title":""},{"docid":"df93e1a67131a63386fd5f3e945b8fe6","score":"0.543338","text":"get table() {\n return this._table;\n }","title":""},{"docid":"2c1041abbdf0891ce784e2b9ba955b1b","score":"0.5391248","text":"get target() {\n\t\treturn this._t;\n\t}","title":""},{"docid":"d721fc7abc70184471cfe1060085e6ca","score":"0.5328283","text":"get tr() {\n return new Transaction(this);\n }","title":""},{"docid":"5292297b4de589c7507b8c6494ef0483","score":"0.52894646","text":"function bindTT() {\n\t$t=$(this);\n\t$p=$t.parent();\n\tif ($p.hasClass(\"selflink\") == false) {\n\t\t$t.data(\"tt\", $p.attr(\"title\").replace(\" (page does not exist)\",\"\").replace(\"?\",\"%3F\")).hover(showTip,hideTip).mousemove(moveTip);\n\t}\n}","title":""},{"docid":"3b663c3ca93377f2c5d648fb50412735","score":"0.5223055","text":"get table() {\n return this.tableIn;\n }","title":""},{"docid":"0632340af6ac02bedfa73761c6128104","score":"0.522078","text":"_setTable() {\r\n\r\n\r\n }","title":""},{"docid":"efbb9a165ed8d7572efc1e91112b4ee7","score":"0.51644766","text":"function ttable(tableid, divid) {\n // Store the table ID\n this.tableid = tableid;\n\n // Store the Inner Div ID\n this.divid = divid;\n\n // Table Custom Styling\n this.style = new Object();\n this.style.table = new String;\n this.style.table = 'table-default';\n this.style.tablehead = new String;\n this.style.tablehead = 'head-default';\n this.style.tablebody = new String;\n this.style.tablebody = 'body-default';\n this.style.tablecaption = new String;\n this.style.tablecaption = 'caption-default';\n\n // Custom Hover Class\n this.style.bodyhover = new Boolean;\n this.style.bodyhover = true;\n this.style.headhover = new Boolean;\n this.style.headhover = true;\n this.style.tablehead_hover = new String;\n this.style.tablehead_hover = 'hoverhead-default';\n this.style.tableheadtd_hover = new String;\n this.style.tableheadtd_hover = 'hoverheadtd-default';\n this.style.tablebody_hover = new String;\n this.style.tablebody_hover = 'hoverbody-default';\n\n // Highlighting Custom Styling\n this.highlight = new Object();\n this.highlight.enabled = new Boolean;\n this.highlight.enabled = true;\n this.highlight.style = new String;\n this.highlight.style = 'highlight-default';\n this.highlight.onlclick = new Boolean;\n this.highlight.onclick = false;\n this.highlight.onclick_style = new String;\n this.highlight.onclick_style = 'clicklight-default';\n\n // Stripped Rows Parameters\n this.style.stripped = new Boolean;\n this.style.stripped = true;\n this.style.odd_row = new String;\n this.style.odd_row = 'odd-default';\n\n // Numeration Parameters\n this.style.num = new Boolean;\n this.style.num = true;\n this.style.num_class = new String;\n this.style.num_class = 'num-default';\n\n // Sorting Paramters\n this.sorting = new Object();\n this.sorting.enabled = new Boolean;\n this.sorting.enabled = true;\n this.sorting.sortall = new Boolean;\n this.sorting.sortall = false;\n this.sorting.resetnum = new Boolean;\n this.sorting.resetnum = true;\n this.sorting.sortedstyle = new String;\n this.sorting.sortedstyle = 'sorted-default';\n this.sorting.clickablestyle = new String;\n this.sorting.clickablestyle = 'clickable-default';\n this.sorting.onclickstyle = new String;\n this.sorting.onclickstyle = 'onclick-default';\n this.sorting.sortascstyle = new String;\n this.sorting.sortascstyle = 'sortasc-default';\n this.sorting.sortdescstyle = new String;\n this.sorting.sortdescstyle = 'sortdesc-default';\n\n // Pagination Paramaters\n this.pagination = new Object();\n this.pagination.enabled = new Boolean;\n this.pagination.enabled = false;\n this.pagination.rowperpage = new Number;\n this.pagination.rowperpage = 10;\n\n // Editable Parameters\n this.edit = new Object();\n this.edit.enabled = new Boolean;\n this.edit.enabled = false;\n\n // Conversion Parameters\n this.csv = new Object();\n this.csv.separator = new String;\n this.csv.separator = ',';\n\n // Search Input\n this.search = new Object();\n this.search.enabled = new Boolean;\n this.search.enabled = false;\n this.search.inputID = new String;\n this.search.inputID = \"filter\";\n this.search.casesensitive = new Boolean;\n // True = Case Sensitive\n this.search.casesensitive = false;\n\n // Table Information\n this.info = new Object();\n}","title":""},{"docid":"bdfa9a20db90b4899e2794f800d80353","score":"0.5097572","text":"function callback() {\n //console.log('callback called', this.el[this.elProperty], this.dataModelField);\n setter(el, this.cashedElData.replace('{{' + tr + '}}',\n this.$scope[this.scopeKey].model.get(this.dataModelField)));\n }","title":""},{"docid":"978479fa434addfd8ecb16fe29e1ea84","score":"0.50876534","text":"getData() {\r\n return this.table;\r\n }","title":""},{"docid":"0f38bcdea672b4d042d3f8ed10e5e04a","score":"0.5065255","text":"created() {\n this._TPInstance = null\n this._obs_title = null\n this._obs_content = null\n }","title":""},{"docid":"1278a386efe9d8852e2aff25ac5d28d6","score":"0.50531983","text":"constructor(element, parent) {\n this.element = element;\n\n //// assign this.tabs to parent\n // this.tabs is assigned to the parent which is an object. there is only one of these objects because there was only one .tabs class used in the document\n this.tabs = parent;\n\n //// Using the method from the parent class above, pass in a reference to the custom data attribute. \n // this.tabsItem = this.parent.getTab();\n // ************solution code used the below*********************\n this.tabsItem = parent.getTab(this.element.dataset.tab);\n //// Create a new TabsItem object that passes in a tabsItem value that you just created above\n this.tabsItem = new TabsItem(this.tabsItem);\n this.element.addEventListener('click', () => {\n this.tabs.updateActive(this);\n // invoke the select() method on this\n this.select();\n });\n }","title":""},{"docid":"4f2eb900552cd55af057d34e140d6d9e","score":"0.50430435","text":"function Dt(){this.__data__=sl?sl(null):{}}","title":""},{"docid":"52e93274049e81e3ab5969b30e827a69","score":"0.5029605","text":"function whatisthis() {\n return this;\n }","title":""},{"docid":"5cfd1fa745d815bb3216f5d61cb2ba61","score":"0.50293154","text":"componentDidUpdate() {\n\t\t/* preserve context */\n\t\tconst _this = this;\n\t}","title":""},{"docid":"5cfd1fa745d815bb3216f5d61cb2ba61","score":"0.50293154","text":"componentDidUpdate() {\n\t\t/* preserve context */\n\t\tconst _this = this;\n\t}","title":""},{"docid":"9efbf4d3b2b6a5af01f9c1483177196b","score":"0.50284004","text":"get testcaseId() { return this.tcid(); }","title":""},{"docid":"519daf2835907a599ce3ae29f0a22ddf","score":"0.5025083","text":"createdCallback() {\n self = this\n self.init()\n }","title":""},{"docid":"5e79ccdfc871f0cdef412021cfe251e1","score":"0.5014645","text":"function tableView(container,doc) \r\n{\r\n var numRows; // assigned in click, includes header\r\n var numCols; // assigned at bottom of click\r\n var activeSingleQuery = null;\r\n var autoCompArray = [];\r\n var entryArray = [];\r\n var qps; // assigned in onBinding\r\n var kb = tabulator.kb;\r\n\r\n thisTable = this; // fixes a problem with calling this.container\r\n this.document=null;\r\n if(doc)\r\n this.document=doc;\r\n else\r\n this.document=document;\r\n \r\n // The necessary vars for a View\r\n this.name=\"Table\"; //Display name of this view.\r\n this.queryStates=[]; //All Queries currently in this view.\r\n this.container=container; //HTML DOM parent node for this view.\r\n this.container.setAttribute('ondblclick','tableDoubleClick(event)');\r\n \r\n /*****************************************************\r\n drawQuery \r\n ******************************************************/\r\n this.drawQuery = function (q)\r\n {\r\n var i, td, th, j, v;\r\n var t = thisTable.document.createElement('table');\r\n var tr = thisTable.document.createElement('tr');\r\n var nv = q.vars.length;\r\n \r\n this.onBinding = function (bindings) {\r\n var i, tr, td;\r\n //tabulator.log.info('making a row w/ bindings ' + bindings);\r\n tr = thisTable.document.createElement('tr');\r\n t.appendChild(tr);\r\n numStats = q.pat.statements.length; // Added\r\n qps = q.pat.statements;\r\n for (i=0; i<nv; i++) {\r\n var v = q.vars[i];\r\n var val = bindings[v];\r\n tabulator.log.msg('Variable '+v+'->'+val)\r\n // generate the subj and pred for each tdNode \r\n for (j = 0; j<numStats; j++) {\r\n var stat = q.pat.statements[j];\r\n // statClone = <s> <p> ?* .\r\n var statClone = new tabulator.rdf.Statement(stat.subject, stat.predicate, stat.object);\r\n if (statClone.object == v) {\r\n statClone.object = bindings[v];\r\n var sSubj = statClone.subject.toString();\r\n if (sSubj[0] == '?') { \r\n // statClone = ?* <p> <o> .\r\n statClone.subject = bindings[statClone.subject];\r\n }\r\n break;\r\n }\r\n }\r\n tabulator.log.msg('looking for statement in store to attach to node ' + statClone);\r\n var st = kb.anyStatementMatching(statClone.subject, statClone.predicate, statClone.object);\r\n if (!st) {tabulator.log.warn(\"Tableview: no statement {\"+\r\n statClone.subject+statClone.predicate+statClone.object+\"} from bindings: \"+bindings);}\r\n else if (!st.why) {tabulator.log.warn(\"Unknown provenence for {\"+st.subject+st.predicate+st.object+\"}\");}\r\n tr.appendChild(matrixTD(val, st));\r\n } //for each query var, make a row\r\n } // onBinding\r\n\r\n t.appendChild(tr);\r\n t.setAttribute('class', 'results sortable'); //needed to make sortable\r\n t.setAttribute('id', 'tabulated_data'); \r\n \r\n tabulator.Util.emptyNode(thisTable.container).appendChild(t); // See results as we go\r\n\r\n for (i=0; i<nv; i++) { // create the header\r\n v = q.vars[i];\r\n tabulator.log.debug(\"table header cell for \" + v + ': '+v.label)\r\n text = document.createTextNode(v.label)\r\n th = thisTable.document.createElement('th');\r\n th.appendChild(text);\r\n tr.appendChild(th);\r\n }\r\n \r\n kb.query(q, this.onBinding); // pulling in the results of the query\r\n activeSingleQuery = q;\r\n this.queryStates[q.id]=1;\r\n \r\n drawExport();\r\n drawAddRow();\r\n sortables_init();\r\n \r\n // table edit\r\n t.addEventListener('click', click, false);\r\n numCols = nv;\r\n \r\n // auto completion array\r\n entryArray = tabulator.lb.entry;\r\n for (i = 0; i<tabulator.lb.entry.length; i++) {\r\n autoCompArray.push(entryArray[i][0].toString());\r\n entryArray = entryArray.slice(0);\r\n }\r\n } //drawQuery\r\n\r\n function drawExport () {\r\n var form= thisTable.document.createElement('form');\r\n var but = thisTable.document.createElement('input');\r\n form.setAttribute('textAlign','right');\r\n but.setAttribute('type','button');\r\n but.setAttribute('id','exportButton');\r\n but.addEventListener('click',exportTable,true);\r\n but.setAttribute('value','Export to HTML');\r\n form.appendChild(but);\r\n thisTable.container.appendChild(form);\r\n }\r\n\r\n this.undrawQuery = function(q) {\r\n if(q===activeSingleQuery) \r\n {\r\n this.queryStates[q.id]=0;\r\n activeSingleQuery=null;\r\n tabulator.Util.emptyNode(this.container);\r\n }\r\n }\r\n\r\n this.addQuery = function(q) {\r\n this.queryStates[q.id]=0;\r\n }\r\n\r\n this.removeQuery = function (q) {\r\n this.undrawQuery(q);\r\n delete this.queryStates[q.id];\r\n return;\r\n }\r\n\r\n this.clearView = function () {\r\n this.undrawQuery(activeSingleQuery);\r\n activeSingleQuery=null;\r\n tabulator.Util.emptyNode(this.container);\r\n }\r\n \r\n /*****************************************************\r\n Table Editing\r\n ******************************************************/\r\n var selTD;\r\n var inputObj;\r\n var sparqlUpdate;\r\n \r\n function clearSelected(node) {\r\n if (!node) {return;}\r\n var a = document.getElementById('focus');\r\n if (a != null) { a.parentNode.removeChild(a); };\r\n var t = document.getElementById('tabulated_data');\r\n t.removeEventListener('keypress', keyHandler, false);\r\n node.style.backgroundColor = 'white';\r\n }\r\n \r\n function clickSecond(e) {\r\n selTD.removeEventListener('click', clickSecond, false); \r\n if (e.target == selTD) {\r\n clearSelected(selTD);\r\n onEdit();\r\n e.stopPropagation();\r\n e.preventDefault();\r\n }\r\n }\r\n \r\n function setSelected(node) {\r\n if (!node) {return;}\r\n if (node.tagName != \"TD\") {return;}\r\n var a = document.createElement('a');\r\n a.setAttribute('id', 'focus');\r\n node.appendChild(a);\r\n a.focus();\r\n var t = document.getElementById('tabulated_data');\r\n t.addEventListener('keypress', keyHandler, false);\r\n node.style.backgroundColor = \"#8F3\";\r\n \r\n selTD = node;\r\n selTD.addEventListener('click', clickSecond, false);\r\n }\r\n \r\n function click(e) {\r\n if (selTD != null) clearSelected(selTD);\r\n var node = e.target;\r\n if (node.firstChild && node.firstChild.tagName == \"INPUT\") return;\r\n setSelected(node);\r\n var t = document.getElementById('tabulated_data');\r\n numRows = t.childNodes.length;\r\n }\r\n \r\n function getRowIndex(node) { \r\n var trNode = node.parentNode;\r\n var rowArray = trNode.parentNode.childNodes;\r\n var rowArrayLength = trNode.parentNode.childNodes.length;\r\n for (i = 1; i<rowArrayLength; i++) {\r\n if (rowArray[i].innerHTML == trNode.innerHTML) return i;\r\n }\r\n }\r\n \r\n function getTDNode(iRow, iCol) {\r\n var t = document.getElementById('tabulated_data');\r\n //return t.rows[iRow].cells[iCol]; // relies on tbody\r\n return t.childNodes[iRow].childNodes[iCol];\r\n }\r\n \r\n function keyHandler(e) {\r\n var oldRow = getRowIndex(selTD); //includes header\r\n var oldCol = selTD.cellIndex;\r\n var t = document.getElementById('tabulated_data');\r\n clearSelected(selTD);\r\n if (e.keyCode == 35) { //end\r\n addRow();\r\n }\r\n if (e.keyCode==13) { //enter\r\n onEdit();\r\n }\r\n if(e.keyCode==37) { //left\r\n newRow = oldRow;\r\n newCol = (oldCol>0)?(oldCol-1):oldCol;\r\n var newNode = getTDNode(newRow, newCol);\r\n setSelected(newNode);\r\n }\r\n if (e.keyCode==38) { //up\r\n newRow = (oldRow>1)?(oldRow-1):oldRow;\r\n newCol = oldCol;\r\n var newNode = getTDNode(newRow, newCol)\r\n setSelected(newNode);\r\n newNode.scrollIntoView(false); // ...\r\n }\r\n if (e.keyCode==39) { //right\r\n newRow = oldRow;\r\n newCol = (oldCol<numCols-1)?(oldCol+1):oldCol;\r\n var newNode = getTDNode(newRow, newCol);\r\n setSelected(newNode);\r\n }\r\n if (e.keyCode==40) { //down\r\n newRow = (oldRow<numRows-1)?(oldRow+1):oldRow;\r\n newCol = oldCol;\r\n var newNode = getTDNode(newRow, newCol);\r\n setSelected(newNode);\r\n newNode.scrollIntoView(false);\r\n }\r\n if (e.shiftKey && e.keyCode == 9) { //shift+tab\r\n newRow = oldRow;\r\n newCol = (oldCol>0)?(oldCol-1):oldCol;\r\n if (oldCol == 0) {\r\n newRow = oldRow-1;\r\n newCol = numCols-1;\r\n }\r\n if (oldRow==1) {newRow=1;}\r\n if (oldRow==1 && oldCol==0) {newRow=1; newCol = 0;}\r\n \r\n var newNode = getTDNode(newRow, newCol);\r\n setSelected(newNode);\r\n e.stopPropagation();\r\n e.preventDefault();\r\n return;\r\n }\r\n if (e.keyCode == 9) { // tab\r\n newRow = oldRow;\r\n newCol = (oldCol<numCols-1)?(oldCol+1):oldCol;\r\n if (oldCol == numCols-1) {\r\n newRow = oldRow+1;\r\n newCol = 0;\r\n }\r\n if (oldRow == numRows-1) {newRow = numRows-1;}\r\n if (oldRow == numRows-1 && oldCol == numCols-1) \r\n {newRow = numRows-1; newCol = numCols-1}\r\n \r\n var newNode = getTDNode(newRow, newCol);\r\n setSelected(newNode);\r\n }\r\n e.stopPropagation();\r\n e.preventDefault();\r\n } //keyHandler\r\n \r\n function onEdit() {\r\n if ((selTD.getAttribute('autocomp') == undefined) && \r\n (selTD.getAttribute('type') == 'sym')) {\r\n setSelected(selTD); return; \r\n }\r\n if (!selTD.editable && (selTD.getAttribute('type') == 'sym')) {return;}\r\n if (selTD.getAttribute('type') == 'bnode') {\r\n setSelected(selTD); return;\r\n }\r\n \r\n var t = document.getElementById('tabulated_data');\r\n var oldTxt = selTD.innerHTML;\r\n inputObj = document.createElement('input');\r\n inputObj.type = \"text\";\r\n inputObj.style.width = \"99%\";\r\n inputObj.value = oldTxt;\r\n \r\n // replace old text with input box\r\n if (!oldTxt)\r\n inputObj.value = ' '; // ????\r\n if (selTD.firstChild) { // selTD = <td> text </td>\r\n selTD.replaceChild(inputObj, selTD.firstChild);\r\n inputObj.select();\r\n } else { // selTD = <td />\r\n var parent = selTD.parentNode;\r\n var newTD = thisTable.document.createElement('TD');\r\n parent.replaceChild(newTD, selTD);\r\n newTD.appendChild(inputObj);\r\n }\r\n \r\n // make autocomplete input or just regular input\r\n if (selTD.getAttribute('autocomp') == 'true') {\r\n autoSuggest(inputObj, autoCompArray);\r\n }\r\n inputObj.addEventListener (\"blur\", inputObjBlur, false);\r\n inputObj.addEventListener (\"keypress\", inputObjKeyPress, false);\r\n } //onEdit\r\n \r\n function inputObjBlur(e) { \r\n // no re-editing of symbols for now\r\n document.getElementById(\"autosuggest\").style.display = 'none';\r\n newText = inputObj.value;\r\n selTD.setAttribute('about', newText);\r\n if (newText != '') {\r\n selTD.innerHTML = newText;\r\n }\r\n else {\r\n selTD.innerHTML = '---';\r\n }\r\n setSelected(selTD);\r\n e.stopPropagation();\r\n e.preventDefault();\r\n \r\n // sparql update\r\n if (!selTD.stat) {saveAddRowText(newText); return;};\r\n tabulator.log.msg('sparql update with stat: ' + selTD.stat);\r\n tabulator.log.msg('new object will be: ' + kb.literal(newText, ''));\r\n if (tabulator.isExtension) {sparqlUpdate = sparql.update_statement(selTD.stat);}\r\n else {sparqlUpdate = new sparql(kb).update_statement(selTD.stat);}\r\n // TODO: DEFINE ERROR CALLBACK\r\n //selTD.stat.object = kb.literal(newText, '');\r\n sparqlUpdate.set_object(kb.literal(newText, ''), function(uri,success,error_body) {\r\n if (success) {\r\n //kb.add(selTD.stat.subject, selTD.stat.predicate, selTD.stat.object, selTD.stat.why)\r\n tabulator.log.msg('sparql update success');\r\n var newStatement = kb.add(selTD.stat.subject, selTD.stat.predicate, kb.literal(newText, ''), selTD.stat.why);\r\n kb.remove(selTD.stat);\r\n selTD.stat = newStatement;\r\n }\r\n });\r\n }\r\n\r\n function inputObjKeyPress(e) {\r\n if (e.keyCode == 13) { //enter\r\n inputObjBlur(e);\r\n }\r\n } //***************** End Table Editing *****************//\r\n \r\n /******************************************************\r\n Add Row\r\n *******************************************************/\r\n // node type checking\r\n function literalRC (row, col) {\r\n var t = thisTable.document.getElementById('tabulated_data'); \r\n var tdNode = t.childNodes[row].childNodes[col];\r\n if (tdNode.getAttribute('type') =='lit') return true;\r\n } \r\n\r\n function bnodeRC (row, col) {\r\n var t = thisTable.document.getElementById('tabulated_data');\r\n var tdNode = t.childNodes[row].childNodes[col];\r\n if (tdNode.getAttribute('type') =='bnode') return true;\r\n }\r\n\r\n function symbolRC(row, col) {\r\n var t = thisTable.document.getElementById('tabulated_data');\r\n var tdNode = t.childNodes[row].childNodes[col];\r\n if (tdNode.getAttribute('type') == 'sym') return true;\r\n } // end note type checking\r\n \r\n // td creation for each type\r\n function createLiteralTD() {\r\n tabulator.log.msg('creating literalTD for addRow');\r\n var td = thisTable.document.createElement(\"TD\");\r\n td.setAttribute('type', 'lit');\r\n td.innerHTML = '---';\r\n return td;\r\n }\r\n \r\n function createSymbolTD() {\r\n tabulator.log.msg('creating symbolTD for addRow');\r\n var td = thisTable.document.createElement(\"TD\");\r\n td.editable=true;\r\n td.setAttribute('type', 'sym');\r\n td.setAttribute('style', 'color:#4444ff');\r\n td.innerHTML = \"---\";\r\n td.setAttribute('autocomp', 'true');\r\n return td;\r\n }\r\n\r\n function createBNodeTD() {\r\n var td = thisTable.document.createElement('TD');\r\n td.setAttribute('type', 'bnode');\r\n td.setAttribute('style', 'color:#4444ff');\r\n td.innerHTML = \"...\";\r\n bnode = kb.bnode();\r\n tabulator.log.msg('creating bnodeTD for addRow: ' + bnode.toNT());\r\n td.setAttribute('o', bnode.toNT());\r\n return td;\r\n } //end td creation\r\n \r\n function drawAddRow () {\r\n var form = thisTable.document.createElement('form');\r\n var but = thisTable.document.createElement('input');\r\n form.setAttribute('textAlign','right');\r\n but.setAttribute('type','button');\r\n but.setAttribute('id','addRowButton');\r\n but.addEventListener('click',addRow,true);\r\n but.setAttribute('value','+');\r\n form.appendChild(but);\r\n thisTable.container.appendChild(form);\r\n }\r\n \r\n // use kb.sym for symbols\r\n // use kb.bnode for blank nodes\r\n // use kb.literal for literal nodes \r\n function addRow () {\r\n var td; var tr = thisTable.document.createElement('tr');\r\n var t = thisTable.document.getElementById('tabulated_data');\r\n // create the td nodes for the new row\r\n // for each td node add the object variable like ?v0\r\n for (var i=0; i<numCols; i++) {\r\n if (symbolRC (1, i)) {\r\n td = createSymbolTD();\r\n td.v = qps[i].object;\r\n tabulator.log.msg('FOR COLUMN '+i+' v IS '+td.v);\r\n }\r\n else if (literalRC(1, i)) {\r\n td = createLiteralTD(); \r\n td.v = qps[i].object\r\n tabulator.log.msg('FOR COLUMN '+i+' v IS '+td.v);\r\n }\r\n else if (bnodeRC(1, i)) {\r\n td = createBNodeTD();\r\n td.v = qps[i].object\r\n tabulator.log.msg('FOR COLUMN '+i+' v IS '+td.v);\r\n }\r\n else {tabulator.log.warn('addRow problem')} \r\n tr.appendChild(td);\r\n }\r\n t.appendChild(tr);\r\n // highlight the td in the first column of the new row\r\n numRows = t.childNodes.length;\r\n clearSelected(selTD);\r\n newRow = numRows-1;\r\n newCol = 0;\r\n selTD = getTDNode(newRow, newCol); // first td of the row\r\n setSelected(selTD);\r\n // clone the qps array and attach a pointer to the clone on the first td of the row\r\n tabulator.log.msg('CREATING A CLONE OF QPS: ' + qps);\r\n var qpsClone = [];\r\n for (var i = 0; i<qps.length; i++) {\r\n var stat = qps[i];\r\n var newStat = new tabulator.rdf.Statement(stat.subject, stat.predicate, stat.object, stat.why);\r\n qpsClone[i] = newStat;\r\n }\r\n selTD.qpsClone = qpsClone; // remember that right now selTD is the first td of the row, qpsClone is not a 100% clone\r\n } //addRow\r\n \r\n function saveAddRowText(newText) {\r\n var td = selTD; // need to use this in case the user switches to a new TD in the middle of the autosuggest process\r\n td.editable=false;\r\n var type = td.getAttribute('type');\r\n // get the qps which is stored on the first cell of the row\r\n var qpsc = getTDNode(getRowIndex(td), 0).qpsClone;\r\n var row = getRowIndex(td);\r\n \r\n function validate() { // make sure the user has made a selection\r\n for (var i = 0; i<autoCompArray.length; i++) {\r\n if (newText == autoCompArray[i]) {\r\n return true;\r\n } \r\n }\r\n return false;\r\n }\r\n if (validate() == false && type == 'sym') {\r\n alert('Please make a selection');\r\n td.innerHTML = '---'; clearSelected(td); setSelected(selTD);\r\n return;\r\n }\r\n \r\n function getMatchingSym(text) {\r\n for (var i=0; i<autoCompArray.length; i++) {\r\n if (newText==autoCompArray[i]) {\r\n return entryArray[i][1];\r\n }\r\n }\r\n tabulator.log.warn('no matching sym');\r\n }\r\n \r\n var rowNum = getRowIndex(td);\r\n // fill in the query pattern based on the newText\r\n for (var i = 0; i<numCols; i++) {\r\n tabulator.log.msg('FILLING IN VARIABLE: ' + td.v);\r\n tabulator.log.msg('CURRENT STATEMENT IS: ' + qpsc[i]);\r\n if (qpsc[i].subject === td.v) { // subj is a variable\r\n if (type == 'sym') {qpsc[i].subject = getMatchingSym(newText);}\r\n if (type == 'lit') {qpsc[i].subject = kb.literal(newText, '');}\r\n if (type == 'bnode') {qpsc[i].subject = kb.bnode();}\r\n tabulator.log.msg('NEW QPSC IS: ' + qpsc);\r\n }\r\n if (qpsc[i].object === td.v) { // obj is a variable\r\n // TODO: DOUBLE QUERY PROBLEM IS PROBABLY HERE\r\n if (type == 'sym') {qpsc[i].object = getMatchingSym(newText);}\r\n if (type == 'lit') {qpsc[i].object = kb.literal(newText, '');}\r\n if (type == 'bnode') {qpsc[i].object = kb.bnode();}\r\n tabulator.log.msg('NEW QPSC IS: ' + qpsc);\r\n }\r\n }\r\n \r\n // check if all the variables in the query pattern have been filled out\r\n var qpscComplete = true; \r\n for (var i = 0; i<numCols; i++) {\r\n if (qpsc[i].subject.toString()[0]=='?') {qpscComplete = false;}\r\n if (qpsc[i].object.toString()[0]=='?') {qpscComplete = false;}\r\n }\r\n \r\n // if all the variables in the query pattern have been filled out, then attach stat pointers to each node, add the stat to the store, and perform the sparql update\r\n if (qpscComplete == true) {\r\n tabulator.log.msg('qpsc has been filled out: ' + qpsc);\r\n for (var i = 0; i<numCols; i++) {\r\n tabulator.log.msg('looking for statement in store: ' + qpsc[i]);\r\n var st = kb.anyStatementMatching(qpsc[i].subject, qpsc[i].predicate, qpsc[i].object); // existing statement for symbols\r\n if (!st) { // brand new statement for literals\r\n tabulator.log.msg('statement not found, making new statement');\r\n var why = qpsc[0].subject;\r\n st = new tabulator.rdf.Statement(qpsc[i].subject, qpsc[i].predicate, qpsc[i].object, why);\r\n //kb.add(st.subject, st.predicate, st.object, st.why);\r\n }\r\n var td = getTDNode(row, i);\r\n td.stat = st; \r\n \r\n // sparql update; for each cell in the completed row, send the value of the stat pointer\r\n tabulator.log.msg('sparql update with stat: ' + td.stat);\r\n if (tabulator.isExtension) {sparqlUpdate = sparql}\r\n else {sparqlUpdate = new sparql(kb)}\r\n // TODO: DEFINE ERROR CALLBACK\r\n sparqlUpdate.insert_statement(td.stat, function(uri,success,error_body) {\r\n if (success) {\r\n tabulator.log.msg('sparql update success');\r\n var newStatement = kb.add(td.stat.subject, td.stat.predicate, td.stat.object, td.stat.why);\r\n td.stat = newStatement;\r\n tabulator.log.msg('sparql update with '+newStatement);\r\n } \r\n });\r\n }\r\n }\r\n } // saveAddRowText\r\n\r\n /******************************************************\r\n Autosuggest box\r\n *******************************************************/\r\n // mostly copied from http://gadgetopia.com/post/3773\r\n function autoSuggest(elem, suggestions)\r\n {\r\n //Arrow to store a subset of eligible suggestions that match the user's input\r\n var eligible = new Array();\r\n //A pointer to the index of the highlighted eligible item. -1 means nothing highlighted.\r\n var highlighted = -1;\r\n //A div to use to create the dropdown.\r\n var div = document.getElementById(\"autosuggest\");\r\n //Do you want to remember what keycode means what? Me neither.\r\n var TAB = 9;\r\n var ESC = 27;\r\n var KEYUP = 38;\r\n var KEYDN = 40;\r\n var ENTER = 13;\r\n\r\n /********************************************************\r\n onkeyup event handler for the input elem.\r\n Enter key = use the highlighted suggestion, if there is one.\r\n Esc key = get rid of the autosuggest dropdown\r\n Up/down arrows = Move the highlight up and down in the suggestions.\r\n ********************************************************/\r\n elem.onkeyup = function(ev)\r\n {\r\n var key = getKeyCode(ev);\r\n\r\n switch(key)\r\n {\r\n case ENTER:\r\n useSuggestion();\r\n hideDiv();\r\n break;\r\n\r\n case ESC:\r\n hideDiv();\r\n break;\r\n\r\n case KEYUP:\r\n if (highlighted > 0)\r\n {\r\n highlighted--;\r\n }\r\n changeHighlight(key);\r\n break;\r\n\r\n case KEYDN:\r\n if (highlighted < (eligible.length - 1))\r\n {\r\n highlighted++;\r\n }\r\n changeHighlight(key);\r\n \r\n case 16: break;\r\n\r\n default:\r\n if (elem.value.length > 0) {\r\n getEligible();\r\n createDiv();\r\n positionDiv();\r\n showDiv();\r\n }\r\n else {\r\n hideDiv();\r\n }\r\n }\r\n };\r\n\r\n /********************************************************\r\n Insert the highlighted suggestion into the input box, and \r\n remove the suggestion dropdown.\r\n ********************************************************/\r\n useSuggestion = function() \r\n { // This is where I can move the onblur stuff\r\n if (highlighted > -1) {\r\n elem.value = eligible[highlighted];\r\n hideDiv();\r\n \r\n setTimeout(\"document.getElementById('\" + elem.id + \"').focus()\",0);\r\n }\r\n };\r\n\r\n /********************************************************\r\n Display the dropdown. Pretty straightforward.\r\n ********************************************************/\r\n showDiv = function()\r\n {\r\n div.style.display = 'block';\r\n };\r\n\r\n /********************************************************\r\n Hide the dropdown and clear any highlight.\r\n ********************************************************/\r\n hideDiv = function()\r\n {\r\n div.style.display = 'none';\r\n highlighted = -1;\r\n };\r\n\r\n /********************************************************\r\n Modify the HTML in the dropdown to move the highlight.\r\n ********************************************************/\r\n changeHighlight = function()\r\n {\r\n var lis = div.getElementsByTagName('LI');\r\n for (i in lis) {\r\n var li = lis[i];\r\n if (highlighted == i) {\r\n li.className = \"selected\";\r\n elem.value = li.firstChild.innerHTML;\r\n }\r\n else {\r\n if (!li) return; // fixes a bug involving \"li has no properties\"\r\n li.className = \"\";\r\n }\r\n }\r\n };\r\n\r\n /********************************************************\r\n Position the dropdown div below the input text field.\r\n ********************************************************/\r\n positionDiv = function()\r\n {\r\n var el = elem;\r\n var x = 0;\r\n var y = el.offsetHeight;\r\n\r\n //Walk up the DOM and add up all of the offset positions.\r\n while (el.offsetParent && el.tagName.toUpperCase() != 'BODY') {\r\n x += el.offsetLeft;\r\n y += el.offsetTop;\r\n el = el.offsetParent;\r\n }\r\n\r\n x += el.offsetLeft;\r\n y += el.offsetTop;\r\n\r\n div.style.left = x + 'px';\r\n div.style.top = y + 'px';\r\n };\r\n\r\n /********************************************************\r\n Build the HTML for the dropdown div\r\n ********************************************************/\r\n createDiv = function()\r\n {\r\n var ul = document.createElement('ul');\r\n\r\n //Create an array of LI's for the words.\r\n for (i in eligible) {\r\n var word = eligible[i];\r\n\r\n var li = document.createElement('li');\r\n var a = document.createElement('a');\r\n a.href=\"javascript:false\";\r\n a.innerHTML = word;\r\n li.appendChild(a);\r\n\r\n if (highlighted == i) {\r\n li.className = \"selected\";\r\n }\r\n\r\n ul.appendChild(li);\r\n }\r\n\r\n div.replaceChild(ul,div.childNodes[0]);\r\n\r\n /********************************************************\r\n mouseover handler for the dropdown ul\r\n move the highlighted suggestion with the mouse\r\n ********************************************************/\r\n ul.onmouseover = function(ev)\r\n {\r\n //Walk up from target until you find the LI.\r\n var target = getEventSource(ev);\r\n while (target.parentNode && target.tagName.toUpperCase() != 'LI')\r\n {\r\n target = target.parentNode;\r\n }\r\n \r\n var lis = div.getElementsByTagName('LI');\r\n \r\n\r\n for (i in lis)\r\n {\r\n var li = lis[i];\r\n if(li == target)\r\n {\r\n highlighted = i;\r\n break;\r\n }\r\n }\r\n changeHighlight();\r\n \r\n };\r\n\r\n /********************************************************\r\n click handler for the dropdown ul\r\n insert the clicked suggestion into the input\r\n ********************************************************/\r\n ul.onclick = function(ev)\r\n {\r\n \r\n useSuggestion();\r\n hideDiv();\r\n cancelEvent(ev);\r\n return false;\r\n };\r\n div.className=\"suggestion_list\";\r\n div.style.position = 'absolute';\r\n }; // createDiv\r\n\r\n /********************************************************\r\n determine which of the suggestions matches the input\r\n ********************************************************/\r\n getEligible = function()\r\n {\r\n eligible = new Array();\r\n for (i in suggestions) \r\n {\r\n var suggestion = suggestions[i];\r\n \r\n if(suggestion.toLowerCase().indexOf(elem.value.toLowerCase()) == \"0\")\r\n {\r\n eligible[eligible.length]=suggestion;\r\n }\r\n }\r\n };\r\n \r\n getKeyCode = function(ev) {\r\n if(ev) { return ev.keyCode;}\r\n };\r\n\r\n getEventSource = function(ev) {\r\n if(ev) { return ev.target; }\r\n };\r\n\r\n cancelEvent = function(ev) {\r\n if(ev) { ev.preventDefault(); ev.stopPropagation(); }\r\n }\r\n } // autosuggest\r\n \r\n //document.write('<div id=\"autosuggest\"><ul></ul></div>');\r\n var div = document.createElement('div');\r\n div.setAttribute('id','autosuggest');\r\n document.body.appendChild(div);\r\n div.appendChild(document.createElement('ul'));\r\n} // tableView","title":""},{"docid":"b94094d06fcd54a46d5a7b269e462fb5","score":"0.5003326","text":"update(dt) {\n this.instance.update(dt);\n }","title":""},{"docid":"9df7c4049147d03873384570c902079a","score":"0.49766114","text":"constructor() {\n super({ dbName: dbName });\n\n const oThis = this;\n\n oThis.tableName = 'tags';\n }","title":""},{"docid":"a382965a408c90a25f4cdb6e496e3c19","score":"0.49580443","text":"get darTP() {\n return this.TP;\n }","title":""},{"docid":"7f7c46fe330b4b5e2a75ccdb6bdc5b84","score":"0.4957206","text":"function SimTable($simTable) {\n this.$simTable = $simTable;\n }","title":""},{"docid":"eb8eaa2dd74d4368cf546aa6e8911b70","score":"0.49564907","text":"get instance() {\n\t\treturn this.__instance;\n\t}","title":""},{"docid":"77cc2d15dc4163caa010cc5aa947fa1d","score":"0.4934677","text":"constructor() {\n super({ dbName: dbName });\n\n const oThis = this;\n\n oThis.tableName = 'tokens';\n }","title":""},{"docid":"5573fd5a9391cb91033a8c1fc33c18c7","score":"0.49241886","text":"function gtGrdObj(tdObj) { try { var ele = tdObj.parentNode.parentNode.parentNode; if (ele.tagName.toLowerCase() == \"tbody\") le = ele.parentNode; return ele; } catch (e) { return null; } }","title":""},{"docid":"a8dba69f37fe8ef25e8829d05059fab4","score":"0.4920098","text":"function q(){this.evTarget=tt,this.targetIds={},T.apply(this,arguments)}","title":""},{"docid":"aa7c739239482579ded4993b34052bb7","score":"0.4918942","text":"get name() { return this.tcid(); }","title":""},{"docid":"7c25c42cf8d67c35600bcefd526229e3","score":"0.4880299","text":"trans() {\nreturn this._t;\n}","title":""},{"docid":"fec8990af17a1fc1abe9c5dd28451abf","score":"0.4871689","text":"bind(context) {\n this.$parent = context;\n }","title":""},{"docid":"c0fc3e147865bf23d54cf82379b69d6f","score":"0.48596126","text":"function tablerow(objtable, datasetname, tabledata, template, update) { // Do each row\n if (!datasetname) datasetname = '';\n\n var TR;\n\n if (!update) { // New Record\n\tTR = objtable.find('.row_tablecontent').last();\n\n\tobjtable.append(template); // Append invisible Template for next record\n TR.attr(\"data-id\", tabledata._id); // assign Data To TR tag attribute data-id=1.2.3...\n }else if(update=='new'){\n objtable.prepend(template); // Template for next record\n TR = objtable.find('.row_tablecontent').first();\n TR.attr(\"data-id\", tabledata._id);\n }else {\n var nameofrow = \"[data-id=\" + tabledata._id + \"]\";\n TR = objtable.find(nameofrow)\n .first();\n }\n\n\n setdatabyclass(TR, datasetname, tabledata);\n\n //TR.show('slow');\n return TR;\n}","title":""},{"docid":"5ec7c2cd32c70fc1146a116f7d1a31b8","score":"0.484656","text":"_forwardContentValues(instance) {\n instance.datepicker = this;\n instance.color = this.color;\n }","title":""},{"docid":"516e09173a0db62757b2581c41206614","score":"0.483899","text":"constructor() {\n this.display = document.getElementById('displayRow'); //getting the tbody of our table\n this.notify = document.getElementById('notification'); //getting the div tag above table to show alerts\n }","title":""},{"docid":"a56f4b77740a3a21bd944ba7ec9146ee","score":"0.48319685","text":"get cell() {\n let parentNode = this.node.parentNode;\n return parentNode && parentNode._newtabCell;\n }","title":""},{"docid":"7eefebbf2ab847a8fcd7d14f93bd8827","score":"0.48261744","text":"constructor (el, data) {\n el.tbInstance = this;\n extend(this, data, { el: el });\n\n // defaults for all widget types\n this.setDefaults({\n poweredBy: true\n });\n\n // set defaults\n this.setDefaults(this.defaults());\n\n this.el = el;\n }","title":""},{"docid":"2fd47e0915920454e41a419b6024ab20","score":"0.4818463","text":"function A() {\n\t\tt.call(this)\n\t}","title":""},{"docid":"a640ed365ede1af377478e708eb4bb6e","score":"0.48009488","text":"function itemTable() { }","title":""},{"docid":"577f89e9141a8e022fa9633ba46235f2","score":"0.47947276","text":"openTable() {\n this._stackItem = new TableStackItem(this._stackItem);\n }","title":""},{"docid":"f91518d7b7da5dee8030fad3d790cdfd","score":"0.47885925","text":"get data() {\n\t\treturn this._tableData;\n\t}","title":""},{"docid":"883e54789af553158c104a3507c13031","score":"0.47839266","text":"get target(){ return this.__target; }","title":""},{"docid":"9541189044955202dd819bc74c175cd0","score":"0.4774126","text":"constructor() {\n super({ dbName: dbName });\n\n const oThis = this;\n\n oThis.tableName = 'latest_transactions';\n }","title":""},{"docid":"de716f50507860b768a7752276fc27d5","score":"0.47672662","text":"function t(e,t){if(!t.has(e))throw new TypeError(\"attempted to get private field on non-instance\");return t.get(e)}","title":""},{"docid":"6cf2dd0c9d3907681e300477096fa1fa","score":"0.47472554","text":"function createInstanceRow(instanceData) {\n var newTr = $(\"<tr>\");\n //check where i'm pulling description from. may be the wrong word. \n // newTr.data(\"description\", instanceData);\n newTr.append(\"<td>\" + instanceData.Class_description.class_name + \"</td>\");\n newTr.append(\"<td>\" + instanceData.week_day + \"</td>\");\n newTr.append(\"<td>\" + instanceData.time + \"</td>\")\n newTr.append(\"<td>\" + instanceData.start_date + \"</td>\");\n newTr.append(\"<td>\" + instanceData.end_date + \"</td>\");\n newTr.append(\"<td style='text-align: center;'>\" + instanceData.seats_total+ \"</td>\");\n newTr.append(\"<td style='text-align: center;'>\" + instanceData.seats_filled+ \"</td>\");\n //line below needs info to capture the info from the table description\n $(\"#instance-table tbody\").append(newTr);\n\n return newTr;\n }","title":""},{"docid":"61f9ef3d8f0717e59720597de9f5ba4f","score":"0.47399446","text":"constructor() {\n super()\n self = this\n self.init()\n }","title":""},{"docid":"9eb35b5244a0d7f86ff9f1771a537e67","score":"0.47387487","text":"function table() {\n this.table = null;\n this.opts = {};\n this.table_id = \"\";\n}","title":""},{"docid":"f87ba40e4fef4c58508b8f26202ef29b","score":"0.47295478","text":"function __initFormTable($dom) {\r\n}","title":""},{"docid":"4b370c4f48599d6ffb9f6f16907afd13","score":"0.47240978","text":"function CdkCellOutletRowContext() {}","title":""},{"docid":"00af0935ec1a54e433e58d98779dea67","score":"0.4722145","text":"selectTower(){\r\n if (selectedTower != this){\r\n selectedTower = this;\r\n }\r\n else{\r\n selectedTower = null;\r\n }\r\n }","title":""},{"docid":"136a63d2c9db806222b89aae1d6d1d6f","score":"0.4721397","text":"measured_TP(val) {\n this._measured_TP = val;\n return this;\n }","title":""},{"docid":"24ddf31bee2d7dfcb611a5f5eaf92597","score":"0.4720601","text":"function afterSomeTime() {\n this.text = \"Two seconds have passed..\";\n let func = () => {\n // Notice how here 'this' captures the outer this\n console.log(this.text);\n };\n setTimeout(func, 2000);\n}","title":""},{"docid":"e223947985bf679803959d0ce9201243","score":"0.4720128","text":"async #renderTable() {\n $(\"#\" + this.id).dataTable();\n}","title":""},{"docid":"56ac4b701b4da0ccd0ef0d895f400c47","score":"0.4718859","text":"function Vt(){this.__data__=[]}","title":""},{"docid":"ea03c0b171ee33fb2fb5ee4c2115e457","score":"0.4708719","text":"constructor() {\n super({ dbName: dbName });\n\n const oThis = this;\n\n oThis.tableName = 'meetings';\n }","title":""},{"docid":"021209895fffdd8e4baeb53313d7b3a8","score":"0.47022685","text":"getGlobalTRX() {\nreturn this.globalTRX;\n}","title":""},{"docid":"522c43e3524870fbd84406a835447332","score":"0.4700845","text":"function T0(t){this._=t;}","title":""},{"docid":"e7c1cac210523d10f1ea1237de0abaca","score":"0.4693868","text":"setTable(Table) {\n this.table = Table + '.do';\n }","title":""},{"docid":"be63be55eca7a526178c5abd31943f42","score":"0.46858203","text":"_table() {\n if (this._table_obj === undefined) {\n this._table_obj = this.fwk_app_container.find('table#fwk-qserv-scheduler-hist');\n }\n return this._table_obj;\n }","title":""},{"docid":"519f3d347a900506ab5753ee144c65e1","score":"0.46761814","text":"function tr(t,e){this.x=e,this.q=t}","title":""},{"docid":"057b7607e0ad246f3573674ae694e56c","score":"0.46686664","text":"start() {\n //let self = this;\n }","title":""},{"docid":"e356a629d41d94a898beab84d8fd5c2d","score":"0.46653488","text":"function getTableUpdate() {\n\n}","title":""},{"docid":"39b793c84be3e75b93b45243f239d35c","score":"0.46611255","text":"function self($this) {\n\treturn $this;\n}","title":""},{"docid":"2133eec93ccb79ffda8434366205d157","score":"0.46608463","text":"function Table() {\r\n}","title":""},{"docid":"5d1c2d5ef579e724030a6764ef158035","score":"0.4659421","text":"function AxisTableRenderer(parent){this.parent=parent;}","title":""},{"docid":"8d2d1ffd2759f74027cf888d2445ec46","score":"0.46469113","text":"constructor() { \n \n TrendedDataReport.initialize(this);\n }","title":""},{"docid":"26ec86ef140122517a3280010a0300b1","score":"0.46436965","text":"constructor() {\n\n this.table = {};\n\n this.tableSize = 0;\n }","title":""},{"docid":"3bc94b53530fe63a8130a475b9da990c","score":"0.4638839","text":"init(){\n var self = this;\n self.generateData();\n self.insertInfo();\n self.copyData();\n }","title":""},{"docid":"58ee5ab61079814de8c04fd570ef8bc2","score":"0.4638349","text":"constructor(){\n this.instance = createTextBox();\n }","title":""},{"docid":"45556f1a395ede0968a34a7ea93eefce","score":"0.4634339","text":"function doSomethingElse() {\n console.log(this, 'normal function, this has its own context here');\n console.log(self, 'normal function with a workaround to use this storing it in a variable called self');\n }","title":""},{"docid":"1d94c2a33e15599a22fa87f278f12ed9","score":"0.46309555","text":"function contextOfThis(){\n return this\n}","title":""},{"docid":"3ee2659db4b6edb40040cc68b6a95d37","score":"0.4630106","text":"constructor() {\n super({ dbName: dbName });\n\n const oThis = this;\n\n oThis.tableName = 'aux_price_oracles';\n }","title":""},{"docid":"868a1daff9af0297b17afd7011bb5ae4","score":"0.46288052","text":"get selectedCell() {\n return this.table.find('td.cell.selected');\n }","title":""},{"docid":"37cad4507e96d098d803c9d145fbf890","score":"0.46269718","text":"function or(){this.__data__=new Ut}","title":""},{"docid":"04629064776b5e5f46794db6d0e9fe2b","score":"0.4620828","text":"function setTable() {\n var elemT = $(\"#in_tableh\");\n if (elemT.html() == \"true\") {\n elemT.html(\"false\");\n if ($(\"#is_ownerh\").html() == \"true\")\n sittedTable = new Table($(\"#table_idh\").html(),true);\n else\n sittedTable = new Table($(\"#table_idh\").html(),false);\n }\n}","title":""},{"docid":"ada608bcd48f72f4c1604cc90d9f4c2f","score":"0.4593819","text":"constructor(template, _differs, _table) {\n super(template, _differs);\n this._table = _table;\n }","title":""},{"docid":"bb9163d881465b59b8f83155af27a7a4","score":"0.4592558","text":"InitClass() {\n this.tpClass = 'tp.DataSource';\n }","title":""},{"docid":"698107d926b1334752fd4d746ca9ae3f","score":"0.45813075","text":"function Tester() {\n this.t1a_Selector = \"#t2a\";\n this.t1b_Selector = \"#t2b\";\n}","title":""},{"docid":"abc6f167ffa89d60a2697ce6b6c41371","score":"0.4575399","text":"constructor() {\n super({ dbName: dbName });\n\n const oThis = this;\n\n oThis.tableName = 'user_profile_elements';\n }","title":""},{"docid":"39e34bc17bce767021c2b659245fe742","score":"0.45743015","text":"function Row(tr)\n{\n this.tr=tr;\n //\n //Set the primary key of a row from the tr/primary key attribute\n this.primarykey = tr.getAttribute('primarykey');\n //\n //Set the id of a row\n this.id = tr.getAttribute('id');\n \n //Select this row by ensuring that it is the ony one with the current \n //attribute\n this.select = function()\n {\n // \n //Select all currentl markd trs\n var trs = document.querySelectorAll(\"[current]\");\n //\n //Remove the current attribute from them\n for(var i=0; i<trs.length; i++)\n {\n trs[i].removeAttribute(\"current\");\n }\n // \n //Make the given row as current\n this.tr.setAttribute(\"current\", true);\n //\n //Save the current row for future reference. Note that local storage does\n //not store objectts; rather it stores serializable data structures\n window.last_tr=this.tr;\n window.localStorage.last_tr_id=this.tr.getAttribute(\"id\");\n };\n}","title":""},{"docid":"4648958174e35a7c8dab2995be5737ce","score":"0.45740792","text":"function TimelineThread(parent, tid) {\n this.parent = parent;\n this.tid = tid;\n this.subRows = [[]];\n }","title":""},{"docid":"f3c8541f3a91ae4dbb696e7a89438abd","score":"0.45702127","text":"function highlight(td) {\r\n\tconsole.log(\"Testing\");\r\n\t\tif (selectedTd) { // remove the existing highlight if any\r\n\t\t\tselectedTd.classList.remove('addBold');\r\n\t\t}\r\n\t\tselectedTd = td;\r\n\t\tselectedTd.classList.add('addBold'); // highlight the new td\r\n\t}","title":""},{"docid":"4e0e4a9d75184437e1a91c0487c1fc42","score":"0.456851","text":"function TLE() {\n this._properties;\n this._date;\n }","title":""},{"docid":"55951612a1457d97d3a681dd4e1c0f77","score":"0.4565371","text":"construct(gantt, config) {\n const me = this;\n\n me.tipId = `${gantt.id}-baselines-tip`;\n me.gantt = gantt;\n\n super.construct(gantt, config);\n\n me.ganttDetatcher = gantt.on({\n taskDrag : 'onTaskDrag',\n afterTaskDrop : 'onAfterTaskDrop',\n thisObj : me\n });\n\n me.storeDetacher = gantt.taskStore.on({\n update : {\n fn : 'onStoreUpdateRecord',\n thisObj : me,\n prio : 1000\n }\n });\n }","title":""},{"docid":"eea9e3f16ba701ad9fda712c827cc1f5","score":"0.45651677","text":"function TXHT(id) {\n\n\n TXHT.initDataDom(id);\n }","title":""},{"docid":"ab4ae58fdabd0548dc370a37996623f5","score":"0.45617473","text":"function getTd($tr) {\n\t\t\t\tvar $td = $startTd.length != 0? $startTd: $endTd;\n\t\t\t\tif ($td.hasClass(\"left\"))\n\t\t\t\t\treturn $tr.find(\"td.content.left\");\n\t\t\t\telse if ($td.hasClass(\"right\"))\n\t\t\t\t\treturn $tr.find(\"td.content.right\");\n\t\t\t\telse\n\t\t\t\t\treturn $tr.find(\"td.content\");\n\t\t\t}","title":""},{"docid":"b64c22efd397aa39ef033a2947c36ca4","score":"0.45596147","text":"selectTable() {\n if (!this.owner.enableSelection) {\n return;\n }\n this.selectTableInternal();\n }","title":""},{"docid":"1ab1a58ec883ca381a42a9971f4d5d05","score":"0.45593542","text":"function GPT() {\n return this;\n}","title":""},{"docid":"e06801a5749d7d24ef4034182196ee4a","score":"0.45575956","text":"init(){\n\t\tthis._active = true\n\t}","title":""},{"docid":"748ef816ab33601d76adf57780674897","score":"0.45556393","text":"table() {\n this.showtable= ! this.showtable;\n //workaround - table width is incorect when rendered hidden\n //render it after 100 ms again, usually after it is shown, thus calculating\n //correct width\n if (this.showtable) window.setTimeout(function(that){that.ht2.render()},100,this);\n }","title":""},{"docid":"3f4b33da70c5e505997d6761a9329bcf","score":"0.45552093","text":"function TableData(table, options) {\n\t\tthis.$table = $(table);\n\t\tthis.options = $.extend({}, defaults, options);\n\t\t// look for a dataTable extension on this table\n\t\tif ($.fn.DataTable && $.fn.DataTable.fnIsDataTable(this.$table.get(0))) {\n\t\t\tthis.dataTable = this.$table.dataTable();\n\t\t}\n\t\tthis.parse();\n\t\tthis.$table.data(\"visualize-data\", this);\n\t}","title":""},{"docid":"6e23cb1505bb191154b15e4a9567f0bd","score":"0.4554322","text":"constructor() {\n super();\n\n this.session = null;\n\n this.past = [];\n this.future = [];\n this.updating = false; /* <-----\n updating variable is changing types through out the application \n runtime from a boolean, null, and function. <.< \n TODO: refactor to have a consistent type \n */\n \n // creating a reference for the instance name element to read its value\n this.refInputInstance = React.createRef();\n this.loadAllInstances = this.loadAllInstances.bind(this)\n this.saveInstance = this.saveInstance.bind(this)\n this.loadStateFromInstance = this.loadStateFromInstance.bind(this)\n this.instanceButtons = this.instanceButtons.bind(this)\n this.loadUserInstances = this.loadUserInstances.bind(this)\n \n // state will be read at custom mode setState of App component to send to the websocket server\n this.state = {\n tables: {},\n instances: []\n };\n }","title":""},{"docid":"b0f237d40c026767f37876c4a15bcca2","score":"0.4552781","text":"get tus() { return tus; }","title":""},{"docid":"987b58d2ab747299c92b0c36c25e18a9","score":"0.45519957","text":"function initInstanceInfoTooltip() {\n jQuery('#instance-tooltip').tooltip();\n}","title":""},{"docid":"11de85b36fe454f1b8c7a5d232fdee94","score":"0.4549164","text":"function tripTableInteractionInit(){\n $('#active-trains-table tbody').on('click', 'tr', function () {\n var data = global.tripDatatable.row( this ).data();\n onClickTripRow(data);\n \n // Update class: selected for row display\n if ( $(this).hasClass('selected') ) {\n $(this).removeClass('selected');\n }\n else {\n global.tripDatatable.$('tr.selected').removeClass('selected');\n $(this).addClass('selected');\n }\n } );\n }","title":""},{"docid":"37aa3d9c7a7795266de4eec3c77230a4","score":"0.45486185","text":"newTurtle() {\n return this;\n }","title":""},{"docid":"e0a2bb22947b3e98de513ff897743ce9","score":"0.45416552","text":"_2thr(val) {\n this.__2thr = val;\n return this;\n }","title":""},{"docid":"cf60b30f90efe5349d0936b0c61ae3d0","score":"0.4539663","text":"set(trs) {\nreturn this.setFromTRSet(trs);\n}","title":""},{"docid":"7f85fb6eea26639c94a2178f9b38fc49","score":"0.45364282","text":"initialize(instance) {\n this.instance = instance;\n }","title":""},{"docid":"95a593458aace56978b4db539d34c1b2","score":"0.453357","text":"function t(t) {\n this.count = t;\n }","title":""}],"string":"[\n {\n \"docid\": \"939791025edbd806410f7d0a6de0c114\",\n \"score\": \"0.58534116\",\n \"text\": \"setTR(t, r) {\\nthis._t = t;\\nthis._r = r;\\nreturn this;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8d4419b49780f7014f96fc9a0f2bd6b\",\n \"score\": \"0.56894654\",\n \"text\": \"setT(t) {\\nthis._t = t;\\nreturn this;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"138d112863a2c0b9fa57ebb142ba4c75\",\n \"score\": \"0.56351155\",\n \"text\": \"getWrappedInstance() {\\n if (!this.wrappedInstance) console.warn('RTSelectTable - No wrapped instance')\\n if (this.wrappedInstance.getWrappedInstance) return this.wrappedInstance.getWrappedInstance()\\n else return this.wrappedInstance\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e976fcc6fa7aee3da521661116d8dae\",\n \"score\": \"0.54664683\",\n \"text\": \"TP(val) {\\n this._TP = val;\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df93e1a67131a63386fd5f3e945b8fe6\",\n \"score\": \"0.543338\",\n \"text\": \"get table() {\\n return this._table;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c1041abbdf0891ce784e2b9ba955b1b\",\n \"score\": \"0.5391248\",\n \"text\": \"get target() {\\n\\t\\treturn this._t;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d721fc7abc70184471cfe1060085e6ca\",\n \"score\": \"0.5328283\",\n \"text\": \"get tr() {\\n return new Transaction(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5292297b4de589c7507b8c6494ef0483\",\n \"score\": \"0.52894646\",\n \"text\": \"function bindTT() {\\n\\t$t=$(this);\\n\\t$p=$t.parent();\\n\\tif ($p.hasClass(\\\"selflink\\\") == false) {\\n\\t\\t$t.data(\\\"tt\\\", $p.attr(\\\"title\\\").replace(\\\" (page does not exist)\\\",\\\"\\\").replace(\\\"?\\\",\\\"%3F\\\")).hover(showTip,hideTip).mousemove(moveTip);\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b663c3ca93377f2c5d648fb50412735\",\n \"score\": \"0.5223055\",\n \"text\": \"get table() {\\n return this.tableIn;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0632340af6ac02bedfa73761c6128104\",\n \"score\": \"0.522078\",\n \"text\": \"_setTable() {\\r\\n\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efbb9a165ed8d7572efc1e91112b4ee7\",\n \"score\": \"0.51644766\",\n \"text\": \"function ttable(tableid, divid) {\\n // Store the table ID\\n this.tableid = tableid;\\n\\n // Store the Inner Div ID\\n this.divid = divid;\\n\\n // Table Custom Styling\\n this.style = new Object();\\n this.style.table = new String;\\n this.style.table = 'table-default';\\n this.style.tablehead = new String;\\n this.style.tablehead = 'head-default';\\n this.style.tablebody = new String;\\n this.style.tablebody = 'body-default';\\n this.style.tablecaption = new String;\\n this.style.tablecaption = 'caption-default';\\n\\n // Custom Hover Class\\n this.style.bodyhover = new Boolean;\\n this.style.bodyhover = true;\\n this.style.headhover = new Boolean;\\n this.style.headhover = true;\\n this.style.tablehead_hover = new String;\\n this.style.tablehead_hover = 'hoverhead-default';\\n this.style.tableheadtd_hover = new String;\\n this.style.tableheadtd_hover = 'hoverheadtd-default';\\n this.style.tablebody_hover = new String;\\n this.style.tablebody_hover = 'hoverbody-default';\\n\\n // Highlighting Custom Styling\\n this.highlight = new Object();\\n this.highlight.enabled = new Boolean;\\n this.highlight.enabled = true;\\n this.highlight.style = new String;\\n this.highlight.style = 'highlight-default';\\n this.highlight.onlclick = new Boolean;\\n this.highlight.onclick = false;\\n this.highlight.onclick_style = new String;\\n this.highlight.onclick_style = 'clicklight-default';\\n\\n // Stripped Rows Parameters\\n this.style.stripped = new Boolean;\\n this.style.stripped = true;\\n this.style.odd_row = new String;\\n this.style.odd_row = 'odd-default';\\n\\n // Numeration Parameters\\n this.style.num = new Boolean;\\n this.style.num = true;\\n this.style.num_class = new String;\\n this.style.num_class = 'num-default';\\n\\n // Sorting Paramters\\n this.sorting = new Object();\\n this.sorting.enabled = new Boolean;\\n this.sorting.enabled = true;\\n this.sorting.sortall = new Boolean;\\n this.sorting.sortall = false;\\n this.sorting.resetnum = new Boolean;\\n this.sorting.resetnum = true;\\n this.sorting.sortedstyle = new String;\\n this.sorting.sortedstyle = 'sorted-default';\\n this.sorting.clickablestyle = new String;\\n this.sorting.clickablestyle = 'clickable-default';\\n this.sorting.onclickstyle = new String;\\n this.sorting.onclickstyle = 'onclick-default';\\n this.sorting.sortascstyle = new String;\\n this.sorting.sortascstyle = 'sortasc-default';\\n this.sorting.sortdescstyle = new String;\\n this.sorting.sortdescstyle = 'sortdesc-default';\\n\\n // Pagination Paramaters\\n this.pagination = new Object();\\n this.pagination.enabled = new Boolean;\\n this.pagination.enabled = false;\\n this.pagination.rowperpage = new Number;\\n this.pagination.rowperpage = 10;\\n\\n // Editable Parameters\\n this.edit = new Object();\\n this.edit.enabled = new Boolean;\\n this.edit.enabled = false;\\n\\n // Conversion Parameters\\n this.csv = new Object();\\n this.csv.separator = new String;\\n this.csv.separator = ',';\\n\\n // Search Input\\n this.search = new Object();\\n this.search.enabled = new Boolean;\\n this.search.enabled = false;\\n this.search.inputID = new String;\\n this.search.inputID = \\\"filter\\\";\\n this.search.casesensitive = new Boolean;\\n // True = Case Sensitive\\n this.search.casesensitive = false;\\n\\n // Table Information\\n this.info = new Object();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bdfa9a20db90b4899e2794f800d80353\",\n \"score\": \"0.5097572\",\n \"text\": \"function callback() {\\n //console.log('callback called', this.el[this.elProperty], this.dataModelField);\\n setter(el, this.cashedElData.replace('{{' + tr + '}}',\\n this.$scope[this.scopeKey].model.get(this.dataModelField)));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"978479fa434addfd8ecb16fe29e1ea84\",\n \"score\": \"0.50876534\",\n \"text\": \"getData() {\\r\\n return this.table;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f38bcdea672b4d042d3f8ed10e5e04a\",\n \"score\": \"0.5065255\",\n \"text\": \"created() {\\n this._TPInstance = null\\n this._obs_title = null\\n this._obs_content = null\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1278a386efe9d8852e2aff25ac5d28d6\",\n \"score\": \"0.50531983\",\n \"text\": \"constructor(element, parent) {\\n this.element = element;\\n\\n //// assign this.tabs to parent\\n // this.tabs is assigned to the parent which is an object. there is only one of these objects because there was only one .tabs class used in the document\\n this.tabs = parent;\\n\\n //// Using the method from the parent class above, pass in a reference to the custom data attribute. \\n // this.tabsItem = this.parent.getTab();\\n // ************solution code used the below*********************\\n this.tabsItem = parent.getTab(this.element.dataset.tab);\\n //// Create a new TabsItem object that passes in a tabsItem value that you just created above\\n this.tabsItem = new TabsItem(this.tabsItem);\\n this.element.addEventListener('click', () => {\\n this.tabs.updateActive(this);\\n // invoke the select() method on this\\n this.select();\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f2eb900552cd55af057d34e140d6d9e\",\n \"score\": \"0.50430435\",\n \"text\": \"function Dt(){this.__data__=sl?sl(null):{}}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52e93274049e81e3ab5969b30e827a69\",\n \"score\": \"0.5029605\",\n \"text\": \"function whatisthis() {\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cfd1fa745d815bb3216f5d61cb2ba61\",\n \"score\": \"0.50293154\",\n \"text\": \"componentDidUpdate() {\\n\\t\\t/* preserve context */\\n\\t\\tconst _this = this;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cfd1fa745d815bb3216f5d61cb2ba61\",\n \"score\": \"0.50293154\",\n \"text\": \"componentDidUpdate() {\\n\\t\\t/* preserve context */\\n\\t\\tconst _this = this;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9efbf4d3b2b6a5af01f9c1483177196b\",\n \"score\": \"0.50284004\",\n \"text\": \"get testcaseId() { return this.tcid(); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"519daf2835907a599ce3ae29f0a22ddf\",\n \"score\": \"0.5025083\",\n \"text\": \"createdCallback() {\\n self = this\\n self.init()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e79ccdfc871f0cdef412021cfe251e1\",\n \"score\": \"0.5014645\",\n \"text\": \"function tableView(container,doc) \\r\\n{\\r\\n var numRows; // assigned in click, includes header\\r\\n var numCols; // assigned at bottom of click\\r\\n var activeSingleQuery = null;\\r\\n var autoCompArray = [];\\r\\n var entryArray = [];\\r\\n var qps; // assigned in onBinding\\r\\n var kb = tabulator.kb;\\r\\n\\r\\n thisTable = this; // fixes a problem with calling this.container\\r\\n this.document=null;\\r\\n if(doc)\\r\\n this.document=doc;\\r\\n else\\r\\n this.document=document;\\r\\n \\r\\n // The necessary vars for a View\\r\\n this.name=\\\"Table\\\"; //Display name of this view.\\r\\n this.queryStates=[]; //All Queries currently in this view.\\r\\n this.container=container; //HTML DOM parent node for this view.\\r\\n this.container.setAttribute('ondblclick','tableDoubleClick(event)');\\r\\n \\r\\n /*****************************************************\\r\\n drawQuery \\r\\n ******************************************************/\\r\\n this.drawQuery = function (q)\\r\\n {\\r\\n var i, td, th, j, v;\\r\\n var t = thisTable.document.createElement('table');\\r\\n var tr = thisTable.document.createElement('tr');\\r\\n var nv = q.vars.length;\\r\\n \\r\\n this.onBinding = function (bindings) {\\r\\n var i, tr, td;\\r\\n //tabulator.log.info('making a row w/ bindings ' + bindings);\\r\\n tr = thisTable.document.createElement('tr');\\r\\n t.appendChild(tr);\\r\\n numStats = q.pat.statements.length; // Added\\r\\n qps = q.pat.statements;\\r\\n for (i=0; i<nv; i++) {\\r\\n var v = q.vars[i];\\r\\n var val = bindings[v];\\r\\n tabulator.log.msg('Variable '+v+'->'+val)\\r\\n // generate the subj and pred for each tdNode \\r\\n for (j = 0; j<numStats; j++) {\\r\\n var stat = q.pat.statements[j];\\r\\n // statClone = <s> <p> ?* .\\r\\n var statClone = new tabulator.rdf.Statement(stat.subject, stat.predicate, stat.object);\\r\\n if (statClone.object == v) {\\r\\n statClone.object = bindings[v];\\r\\n var sSubj = statClone.subject.toString();\\r\\n if (sSubj[0] == '?') { \\r\\n // statClone = ?* <p> <o> .\\r\\n statClone.subject = bindings[statClone.subject];\\r\\n }\\r\\n break;\\r\\n }\\r\\n }\\r\\n tabulator.log.msg('looking for statement in store to attach to node ' + statClone);\\r\\n var st = kb.anyStatementMatching(statClone.subject, statClone.predicate, statClone.object);\\r\\n if (!st) {tabulator.log.warn(\\\"Tableview: no statement {\\\"+\\r\\n statClone.subject+statClone.predicate+statClone.object+\\\"} from bindings: \\\"+bindings);}\\r\\n else if (!st.why) {tabulator.log.warn(\\\"Unknown provenence for {\\\"+st.subject+st.predicate+st.object+\\\"}\\\");}\\r\\n tr.appendChild(matrixTD(val, st));\\r\\n } //for each query var, make a row\\r\\n } // onBinding\\r\\n\\r\\n t.appendChild(tr);\\r\\n t.setAttribute('class', 'results sortable'); //needed to make sortable\\r\\n t.setAttribute('id', 'tabulated_data'); \\r\\n \\r\\n tabulator.Util.emptyNode(thisTable.container).appendChild(t); // See results as we go\\r\\n\\r\\n for (i=0; i<nv; i++) { // create the header\\r\\n v = q.vars[i];\\r\\n tabulator.log.debug(\\\"table header cell for \\\" + v + ': '+v.label)\\r\\n text = document.createTextNode(v.label)\\r\\n th = thisTable.document.createElement('th');\\r\\n th.appendChild(text);\\r\\n tr.appendChild(th);\\r\\n }\\r\\n \\r\\n kb.query(q, this.onBinding); // pulling in the results of the query\\r\\n activeSingleQuery = q;\\r\\n this.queryStates[q.id]=1;\\r\\n \\r\\n drawExport();\\r\\n drawAddRow();\\r\\n sortables_init();\\r\\n \\r\\n // table edit\\r\\n t.addEventListener('click', click, false);\\r\\n numCols = nv;\\r\\n \\r\\n // auto completion array\\r\\n entryArray = tabulator.lb.entry;\\r\\n for (i = 0; i<tabulator.lb.entry.length; i++) {\\r\\n autoCompArray.push(entryArray[i][0].toString());\\r\\n entryArray = entryArray.slice(0);\\r\\n }\\r\\n } //drawQuery\\r\\n\\r\\n function drawExport () {\\r\\n var form= thisTable.document.createElement('form');\\r\\n var but = thisTable.document.createElement('input');\\r\\n form.setAttribute('textAlign','right');\\r\\n but.setAttribute('type','button');\\r\\n but.setAttribute('id','exportButton');\\r\\n but.addEventListener('click',exportTable,true);\\r\\n but.setAttribute('value','Export to HTML');\\r\\n form.appendChild(but);\\r\\n thisTable.container.appendChild(form);\\r\\n }\\r\\n\\r\\n this.undrawQuery = function(q) {\\r\\n if(q===activeSingleQuery) \\r\\n {\\r\\n this.queryStates[q.id]=0;\\r\\n activeSingleQuery=null;\\r\\n tabulator.Util.emptyNode(this.container);\\r\\n }\\r\\n }\\r\\n\\r\\n this.addQuery = function(q) {\\r\\n this.queryStates[q.id]=0;\\r\\n }\\r\\n\\r\\n this.removeQuery = function (q) {\\r\\n this.undrawQuery(q);\\r\\n delete this.queryStates[q.id];\\r\\n return;\\r\\n }\\r\\n\\r\\n this.clearView = function () {\\r\\n this.undrawQuery(activeSingleQuery);\\r\\n activeSingleQuery=null;\\r\\n tabulator.Util.emptyNode(this.container);\\r\\n }\\r\\n \\r\\n /*****************************************************\\r\\n Table Editing\\r\\n ******************************************************/\\r\\n var selTD;\\r\\n var inputObj;\\r\\n var sparqlUpdate;\\r\\n \\r\\n function clearSelected(node) {\\r\\n if (!node) {return;}\\r\\n var a = document.getElementById('focus');\\r\\n if (a != null) { a.parentNode.removeChild(a); };\\r\\n var t = document.getElementById('tabulated_data');\\r\\n t.removeEventListener('keypress', keyHandler, false);\\r\\n node.style.backgroundColor = 'white';\\r\\n }\\r\\n \\r\\n function clickSecond(e) {\\r\\n selTD.removeEventListener('click', clickSecond, false); \\r\\n if (e.target == selTD) {\\r\\n clearSelected(selTD);\\r\\n onEdit();\\r\\n e.stopPropagation();\\r\\n e.preventDefault();\\r\\n }\\r\\n }\\r\\n \\r\\n function setSelected(node) {\\r\\n if (!node) {return;}\\r\\n if (node.tagName != \\\"TD\\\") {return;}\\r\\n var a = document.createElement('a');\\r\\n a.setAttribute('id', 'focus');\\r\\n node.appendChild(a);\\r\\n a.focus();\\r\\n var t = document.getElementById('tabulated_data');\\r\\n t.addEventListener('keypress', keyHandler, false);\\r\\n node.style.backgroundColor = \\\"#8F3\\\";\\r\\n \\r\\n selTD = node;\\r\\n selTD.addEventListener('click', clickSecond, false);\\r\\n }\\r\\n \\r\\n function click(e) {\\r\\n if (selTD != null) clearSelected(selTD);\\r\\n var node = e.target;\\r\\n if (node.firstChild && node.firstChild.tagName == \\\"INPUT\\\") return;\\r\\n setSelected(node);\\r\\n var t = document.getElementById('tabulated_data');\\r\\n numRows = t.childNodes.length;\\r\\n }\\r\\n \\r\\n function getRowIndex(node) { \\r\\n var trNode = node.parentNode;\\r\\n var rowArray = trNode.parentNode.childNodes;\\r\\n var rowArrayLength = trNode.parentNode.childNodes.length;\\r\\n for (i = 1; i<rowArrayLength; i++) {\\r\\n if (rowArray[i].innerHTML == trNode.innerHTML) return i;\\r\\n }\\r\\n }\\r\\n \\r\\n function getTDNode(iRow, iCol) {\\r\\n var t = document.getElementById('tabulated_data');\\r\\n //return t.rows[iRow].cells[iCol]; // relies on tbody\\r\\n return t.childNodes[iRow].childNodes[iCol];\\r\\n }\\r\\n \\r\\n function keyHandler(e) {\\r\\n var oldRow = getRowIndex(selTD); //includes header\\r\\n var oldCol = selTD.cellIndex;\\r\\n var t = document.getElementById('tabulated_data');\\r\\n clearSelected(selTD);\\r\\n if (e.keyCode == 35) { //end\\r\\n addRow();\\r\\n }\\r\\n if (e.keyCode==13) { //enter\\r\\n onEdit();\\r\\n }\\r\\n if(e.keyCode==37) { //left\\r\\n newRow = oldRow;\\r\\n newCol = (oldCol>0)?(oldCol-1):oldCol;\\r\\n var newNode = getTDNode(newRow, newCol);\\r\\n setSelected(newNode);\\r\\n }\\r\\n if (e.keyCode==38) { //up\\r\\n newRow = (oldRow>1)?(oldRow-1):oldRow;\\r\\n newCol = oldCol;\\r\\n var newNode = getTDNode(newRow, newCol)\\r\\n setSelected(newNode);\\r\\n newNode.scrollIntoView(false); // ...\\r\\n }\\r\\n if (e.keyCode==39) { //right\\r\\n newRow = oldRow;\\r\\n newCol = (oldCol<numCols-1)?(oldCol+1):oldCol;\\r\\n var newNode = getTDNode(newRow, newCol);\\r\\n setSelected(newNode);\\r\\n }\\r\\n if (e.keyCode==40) { //down\\r\\n newRow = (oldRow<numRows-1)?(oldRow+1):oldRow;\\r\\n newCol = oldCol;\\r\\n var newNode = getTDNode(newRow, newCol);\\r\\n setSelected(newNode);\\r\\n newNode.scrollIntoView(false);\\r\\n }\\r\\n if (e.shiftKey && e.keyCode == 9) { //shift+tab\\r\\n newRow = oldRow;\\r\\n newCol = (oldCol>0)?(oldCol-1):oldCol;\\r\\n if (oldCol == 0) {\\r\\n newRow = oldRow-1;\\r\\n newCol = numCols-1;\\r\\n }\\r\\n if (oldRow==1) {newRow=1;}\\r\\n if (oldRow==1 && oldCol==0) {newRow=1; newCol = 0;}\\r\\n \\r\\n var newNode = getTDNode(newRow, newCol);\\r\\n setSelected(newNode);\\r\\n e.stopPropagation();\\r\\n e.preventDefault();\\r\\n return;\\r\\n }\\r\\n if (e.keyCode == 9) { // tab\\r\\n newRow = oldRow;\\r\\n newCol = (oldCol<numCols-1)?(oldCol+1):oldCol;\\r\\n if (oldCol == numCols-1) {\\r\\n newRow = oldRow+1;\\r\\n newCol = 0;\\r\\n }\\r\\n if (oldRow == numRows-1) {newRow = numRows-1;}\\r\\n if (oldRow == numRows-1 && oldCol == numCols-1) \\r\\n {newRow = numRows-1; newCol = numCols-1}\\r\\n \\r\\n var newNode = getTDNode(newRow, newCol);\\r\\n setSelected(newNode);\\r\\n }\\r\\n e.stopPropagation();\\r\\n e.preventDefault();\\r\\n } //keyHandler\\r\\n \\r\\n function onEdit() {\\r\\n if ((selTD.getAttribute('autocomp') == undefined) && \\r\\n (selTD.getAttribute('type') == 'sym')) {\\r\\n setSelected(selTD); return; \\r\\n }\\r\\n if (!selTD.editable && (selTD.getAttribute('type') == 'sym')) {return;}\\r\\n if (selTD.getAttribute('type') == 'bnode') {\\r\\n setSelected(selTD); return;\\r\\n }\\r\\n \\r\\n var t = document.getElementById('tabulated_data');\\r\\n var oldTxt = selTD.innerHTML;\\r\\n inputObj = document.createElement('input');\\r\\n inputObj.type = \\\"text\\\";\\r\\n inputObj.style.width = \\\"99%\\\";\\r\\n inputObj.value = oldTxt;\\r\\n \\r\\n // replace old text with input box\\r\\n if (!oldTxt)\\r\\n inputObj.value = ' '; // ????\\r\\n if (selTD.firstChild) { // selTD = <td> text </td>\\r\\n selTD.replaceChild(inputObj, selTD.firstChild);\\r\\n inputObj.select();\\r\\n } else { // selTD = <td />\\r\\n var parent = selTD.parentNode;\\r\\n var newTD = thisTable.document.createElement('TD');\\r\\n parent.replaceChild(newTD, selTD);\\r\\n newTD.appendChild(inputObj);\\r\\n }\\r\\n \\r\\n // make autocomplete input or just regular input\\r\\n if (selTD.getAttribute('autocomp') == 'true') {\\r\\n autoSuggest(inputObj, autoCompArray);\\r\\n }\\r\\n inputObj.addEventListener (\\\"blur\\\", inputObjBlur, false);\\r\\n inputObj.addEventListener (\\\"keypress\\\", inputObjKeyPress, false);\\r\\n } //onEdit\\r\\n \\r\\n function inputObjBlur(e) { \\r\\n // no re-editing of symbols for now\\r\\n document.getElementById(\\\"autosuggest\\\").style.display = 'none';\\r\\n newText = inputObj.value;\\r\\n selTD.setAttribute('about', newText);\\r\\n if (newText != '') {\\r\\n selTD.innerHTML = newText;\\r\\n }\\r\\n else {\\r\\n selTD.innerHTML = '---';\\r\\n }\\r\\n setSelected(selTD);\\r\\n e.stopPropagation();\\r\\n e.preventDefault();\\r\\n \\r\\n // sparql update\\r\\n if (!selTD.stat) {saveAddRowText(newText); return;};\\r\\n tabulator.log.msg('sparql update with stat: ' + selTD.stat);\\r\\n tabulator.log.msg('new object will be: ' + kb.literal(newText, ''));\\r\\n if (tabulator.isExtension) {sparqlUpdate = sparql.update_statement(selTD.stat);}\\r\\n else {sparqlUpdate = new sparql(kb).update_statement(selTD.stat);}\\r\\n // TODO: DEFINE ERROR CALLBACK\\r\\n //selTD.stat.object = kb.literal(newText, '');\\r\\n sparqlUpdate.set_object(kb.literal(newText, ''), function(uri,success,error_body) {\\r\\n if (success) {\\r\\n //kb.add(selTD.stat.subject, selTD.stat.predicate, selTD.stat.object, selTD.stat.why)\\r\\n tabulator.log.msg('sparql update success');\\r\\n var newStatement = kb.add(selTD.stat.subject, selTD.stat.predicate, kb.literal(newText, ''), selTD.stat.why);\\r\\n kb.remove(selTD.stat);\\r\\n selTD.stat = newStatement;\\r\\n }\\r\\n });\\r\\n }\\r\\n\\r\\n function inputObjKeyPress(e) {\\r\\n if (e.keyCode == 13) { //enter\\r\\n inputObjBlur(e);\\r\\n }\\r\\n } //***************** End Table Editing *****************//\\r\\n \\r\\n /******************************************************\\r\\n Add Row\\r\\n *******************************************************/\\r\\n // node type checking\\r\\n function literalRC (row, col) {\\r\\n var t = thisTable.document.getElementById('tabulated_data'); \\r\\n var tdNode = t.childNodes[row].childNodes[col];\\r\\n if (tdNode.getAttribute('type') =='lit') return true;\\r\\n } \\r\\n\\r\\n function bnodeRC (row, col) {\\r\\n var t = thisTable.document.getElementById('tabulated_data');\\r\\n var tdNode = t.childNodes[row].childNodes[col];\\r\\n if (tdNode.getAttribute('type') =='bnode') return true;\\r\\n }\\r\\n\\r\\n function symbolRC(row, col) {\\r\\n var t = thisTable.document.getElementById('tabulated_data');\\r\\n var tdNode = t.childNodes[row].childNodes[col];\\r\\n if (tdNode.getAttribute('type') == 'sym') return true;\\r\\n } // end note type checking\\r\\n \\r\\n // td creation for each type\\r\\n function createLiteralTD() {\\r\\n tabulator.log.msg('creating literalTD for addRow');\\r\\n var td = thisTable.document.createElement(\\\"TD\\\");\\r\\n td.setAttribute('type', 'lit');\\r\\n td.innerHTML = '---';\\r\\n return td;\\r\\n }\\r\\n \\r\\n function createSymbolTD() {\\r\\n tabulator.log.msg('creating symbolTD for addRow');\\r\\n var td = thisTable.document.createElement(\\\"TD\\\");\\r\\n td.editable=true;\\r\\n td.setAttribute('type', 'sym');\\r\\n td.setAttribute('style', 'color:#4444ff');\\r\\n td.innerHTML = \\\"---\\\";\\r\\n td.setAttribute('autocomp', 'true');\\r\\n return td;\\r\\n }\\r\\n\\r\\n function createBNodeTD() {\\r\\n var td = thisTable.document.createElement('TD');\\r\\n td.setAttribute('type', 'bnode');\\r\\n td.setAttribute('style', 'color:#4444ff');\\r\\n td.innerHTML = \\\"...\\\";\\r\\n bnode = kb.bnode();\\r\\n tabulator.log.msg('creating bnodeTD for addRow: ' + bnode.toNT());\\r\\n td.setAttribute('o', bnode.toNT());\\r\\n return td;\\r\\n } //end td creation\\r\\n \\r\\n function drawAddRow () {\\r\\n var form = thisTable.document.createElement('form');\\r\\n var but = thisTable.document.createElement('input');\\r\\n form.setAttribute('textAlign','right');\\r\\n but.setAttribute('type','button');\\r\\n but.setAttribute('id','addRowButton');\\r\\n but.addEventListener('click',addRow,true);\\r\\n but.setAttribute('value','+');\\r\\n form.appendChild(but);\\r\\n thisTable.container.appendChild(form);\\r\\n }\\r\\n \\r\\n // use kb.sym for symbols\\r\\n // use kb.bnode for blank nodes\\r\\n // use kb.literal for literal nodes \\r\\n function addRow () {\\r\\n var td; var tr = thisTable.document.createElement('tr');\\r\\n var t = thisTable.document.getElementById('tabulated_data');\\r\\n // create the td nodes for the new row\\r\\n // for each td node add the object variable like ?v0\\r\\n for (var i=0; i<numCols; i++) {\\r\\n if (symbolRC (1, i)) {\\r\\n td = createSymbolTD();\\r\\n td.v = qps[i].object;\\r\\n tabulator.log.msg('FOR COLUMN '+i+' v IS '+td.v);\\r\\n }\\r\\n else if (literalRC(1, i)) {\\r\\n td = createLiteralTD(); \\r\\n td.v = qps[i].object\\r\\n tabulator.log.msg('FOR COLUMN '+i+' v IS '+td.v);\\r\\n }\\r\\n else if (bnodeRC(1, i)) {\\r\\n td = createBNodeTD();\\r\\n td.v = qps[i].object\\r\\n tabulator.log.msg('FOR COLUMN '+i+' v IS '+td.v);\\r\\n }\\r\\n else {tabulator.log.warn('addRow problem')} \\r\\n tr.appendChild(td);\\r\\n }\\r\\n t.appendChild(tr);\\r\\n // highlight the td in the first column of the new row\\r\\n numRows = t.childNodes.length;\\r\\n clearSelected(selTD);\\r\\n newRow = numRows-1;\\r\\n newCol = 0;\\r\\n selTD = getTDNode(newRow, newCol); // first td of the row\\r\\n setSelected(selTD);\\r\\n // clone the qps array and attach a pointer to the clone on the first td of the row\\r\\n tabulator.log.msg('CREATING A CLONE OF QPS: ' + qps);\\r\\n var qpsClone = [];\\r\\n for (var i = 0; i<qps.length; i++) {\\r\\n var stat = qps[i];\\r\\n var newStat = new tabulator.rdf.Statement(stat.subject, stat.predicate, stat.object, stat.why);\\r\\n qpsClone[i] = newStat;\\r\\n }\\r\\n selTD.qpsClone = qpsClone; // remember that right now selTD is the first td of the row, qpsClone is not a 100% clone\\r\\n } //addRow\\r\\n \\r\\n function saveAddRowText(newText) {\\r\\n var td = selTD; // need to use this in case the user switches to a new TD in the middle of the autosuggest process\\r\\n td.editable=false;\\r\\n var type = td.getAttribute('type');\\r\\n // get the qps which is stored on the first cell of the row\\r\\n var qpsc = getTDNode(getRowIndex(td), 0).qpsClone;\\r\\n var row = getRowIndex(td);\\r\\n \\r\\n function validate() { // make sure the user has made a selection\\r\\n for (var i = 0; i<autoCompArray.length; i++) {\\r\\n if (newText == autoCompArray[i]) {\\r\\n return true;\\r\\n } \\r\\n }\\r\\n return false;\\r\\n }\\r\\n if (validate() == false && type == 'sym') {\\r\\n alert('Please make a selection');\\r\\n td.innerHTML = '---'; clearSelected(td); setSelected(selTD);\\r\\n return;\\r\\n }\\r\\n \\r\\n function getMatchingSym(text) {\\r\\n for (var i=0; i<autoCompArray.length; i++) {\\r\\n if (newText==autoCompArray[i]) {\\r\\n return entryArray[i][1];\\r\\n }\\r\\n }\\r\\n tabulator.log.warn('no matching sym');\\r\\n }\\r\\n \\r\\n var rowNum = getRowIndex(td);\\r\\n // fill in the query pattern based on the newText\\r\\n for (var i = 0; i<numCols; i++) {\\r\\n tabulator.log.msg('FILLING IN VARIABLE: ' + td.v);\\r\\n tabulator.log.msg('CURRENT STATEMENT IS: ' + qpsc[i]);\\r\\n if (qpsc[i].subject === td.v) { // subj is a variable\\r\\n if (type == 'sym') {qpsc[i].subject = getMatchingSym(newText);}\\r\\n if (type == 'lit') {qpsc[i].subject = kb.literal(newText, '');}\\r\\n if (type == 'bnode') {qpsc[i].subject = kb.bnode();}\\r\\n tabulator.log.msg('NEW QPSC IS: ' + qpsc);\\r\\n }\\r\\n if (qpsc[i].object === td.v) { // obj is a variable\\r\\n // TODO: DOUBLE QUERY PROBLEM IS PROBABLY HERE\\r\\n if (type == 'sym') {qpsc[i].object = getMatchingSym(newText);}\\r\\n if (type == 'lit') {qpsc[i].object = kb.literal(newText, '');}\\r\\n if (type == 'bnode') {qpsc[i].object = kb.bnode();}\\r\\n tabulator.log.msg('NEW QPSC IS: ' + qpsc);\\r\\n }\\r\\n }\\r\\n \\r\\n // check if all the variables in the query pattern have been filled out\\r\\n var qpscComplete = true; \\r\\n for (var i = 0; i<numCols; i++) {\\r\\n if (qpsc[i].subject.toString()[0]=='?') {qpscComplete = false;}\\r\\n if (qpsc[i].object.toString()[0]=='?') {qpscComplete = false;}\\r\\n }\\r\\n \\r\\n // if all the variables in the query pattern have been filled out, then attach stat pointers to each node, add the stat to the store, and perform the sparql update\\r\\n if (qpscComplete == true) {\\r\\n tabulator.log.msg('qpsc has been filled out: ' + qpsc);\\r\\n for (var i = 0; i<numCols; i++) {\\r\\n tabulator.log.msg('looking for statement in store: ' + qpsc[i]);\\r\\n var st = kb.anyStatementMatching(qpsc[i].subject, qpsc[i].predicate, qpsc[i].object); // existing statement for symbols\\r\\n if (!st) { // brand new statement for literals\\r\\n tabulator.log.msg('statement not found, making new statement');\\r\\n var why = qpsc[0].subject;\\r\\n st = new tabulator.rdf.Statement(qpsc[i].subject, qpsc[i].predicate, qpsc[i].object, why);\\r\\n //kb.add(st.subject, st.predicate, st.object, st.why);\\r\\n }\\r\\n var td = getTDNode(row, i);\\r\\n td.stat = st; \\r\\n \\r\\n // sparql update; for each cell in the completed row, send the value of the stat pointer\\r\\n tabulator.log.msg('sparql update with stat: ' + td.stat);\\r\\n if (tabulator.isExtension) {sparqlUpdate = sparql}\\r\\n else {sparqlUpdate = new sparql(kb)}\\r\\n // TODO: DEFINE ERROR CALLBACK\\r\\n sparqlUpdate.insert_statement(td.stat, function(uri,success,error_body) {\\r\\n if (success) {\\r\\n tabulator.log.msg('sparql update success');\\r\\n var newStatement = kb.add(td.stat.subject, td.stat.predicate, td.stat.object, td.stat.why);\\r\\n td.stat = newStatement;\\r\\n tabulator.log.msg('sparql update with '+newStatement);\\r\\n } \\r\\n });\\r\\n }\\r\\n }\\r\\n } // saveAddRowText\\r\\n\\r\\n /******************************************************\\r\\n Autosuggest box\\r\\n *******************************************************/\\r\\n // mostly copied from http://gadgetopia.com/post/3773\\r\\n function autoSuggest(elem, suggestions)\\r\\n {\\r\\n //Arrow to store a subset of eligible suggestions that match the user's input\\r\\n var eligible = new Array();\\r\\n //A pointer to the index of the highlighted eligible item. -1 means nothing highlighted.\\r\\n var highlighted = -1;\\r\\n //A div to use to create the dropdown.\\r\\n var div = document.getElementById(\\\"autosuggest\\\");\\r\\n //Do you want to remember what keycode means what? Me neither.\\r\\n var TAB = 9;\\r\\n var ESC = 27;\\r\\n var KEYUP = 38;\\r\\n var KEYDN = 40;\\r\\n var ENTER = 13;\\r\\n\\r\\n /********************************************************\\r\\n onkeyup event handler for the input elem.\\r\\n Enter key = use the highlighted suggestion, if there is one.\\r\\n Esc key = get rid of the autosuggest dropdown\\r\\n Up/down arrows = Move the highlight up and down in the suggestions.\\r\\n ********************************************************/\\r\\n elem.onkeyup = function(ev)\\r\\n {\\r\\n var key = getKeyCode(ev);\\r\\n\\r\\n switch(key)\\r\\n {\\r\\n case ENTER:\\r\\n useSuggestion();\\r\\n hideDiv();\\r\\n break;\\r\\n\\r\\n case ESC:\\r\\n hideDiv();\\r\\n break;\\r\\n\\r\\n case KEYUP:\\r\\n if (highlighted > 0)\\r\\n {\\r\\n highlighted--;\\r\\n }\\r\\n changeHighlight(key);\\r\\n break;\\r\\n\\r\\n case KEYDN:\\r\\n if (highlighted < (eligible.length - 1))\\r\\n {\\r\\n highlighted++;\\r\\n }\\r\\n changeHighlight(key);\\r\\n \\r\\n case 16: break;\\r\\n\\r\\n default:\\r\\n if (elem.value.length > 0) {\\r\\n getEligible();\\r\\n createDiv();\\r\\n positionDiv();\\r\\n showDiv();\\r\\n }\\r\\n else {\\r\\n hideDiv();\\r\\n }\\r\\n }\\r\\n };\\r\\n\\r\\n /********************************************************\\r\\n Insert the highlighted suggestion into the input box, and \\r\\n remove the suggestion dropdown.\\r\\n ********************************************************/\\r\\n useSuggestion = function() \\r\\n { // This is where I can move the onblur stuff\\r\\n if (highlighted > -1) {\\r\\n elem.value = eligible[highlighted];\\r\\n hideDiv();\\r\\n \\r\\n setTimeout(\\\"document.getElementById('\\\" + elem.id + \\\"').focus()\\\",0);\\r\\n }\\r\\n };\\r\\n\\r\\n /********************************************************\\r\\n Display the dropdown. Pretty straightforward.\\r\\n ********************************************************/\\r\\n showDiv = function()\\r\\n {\\r\\n div.style.display = 'block';\\r\\n };\\r\\n\\r\\n /********************************************************\\r\\n Hide the dropdown and clear any highlight.\\r\\n ********************************************************/\\r\\n hideDiv = function()\\r\\n {\\r\\n div.style.display = 'none';\\r\\n highlighted = -1;\\r\\n };\\r\\n\\r\\n /********************************************************\\r\\n Modify the HTML in the dropdown to move the highlight.\\r\\n ********************************************************/\\r\\n changeHighlight = function()\\r\\n {\\r\\n var lis = div.getElementsByTagName('LI');\\r\\n for (i in lis) {\\r\\n var li = lis[i];\\r\\n if (highlighted == i) {\\r\\n li.className = \\\"selected\\\";\\r\\n elem.value = li.firstChild.innerHTML;\\r\\n }\\r\\n else {\\r\\n if (!li) return; // fixes a bug involving \\\"li has no properties\\\"\\r\\n li.className = \\\"\\\";\\r\\n }\\r\\n }\\r\\n };\\r\\n\\r\\n /********************************************************\\r\\n Position the dropdown div below the input text field.\\r\\n ********************************************************/\\r\\n positionDiv = function()\\r\\n {\\r\\n var el = elem;\\r\\n var x = 0;\\r\\n var y = el.offsetHeight;\\r\\n\\r\\n //Walk up the DOM and add up all of the offset positions.\\r\\n while (el.offsetParent && el.tagName.toUpperCase() != 'BODY') {\\r\\n x += el.offsetLeft;\\r\\n y += el.offsetTop;\\r\\n el = el.offsetParent;\\r\\n }\\r\\n\\r\\n x += el.offsetLeft;\\r\\n y += el.offsetTop;\\r\\n\\r\\n div.style.left = x + 'px';\\r\\n div.style.top = y + 'px';\\r\\n };\\r\\n\\r\\n /********************************************************\\r\\n Build the HTML for the dropdown div\\r\\n ********************************************************/\\r\\n createDiv = function()\\r\\n {\\r\\n var ul = document.createElement('ul');\\r\\n\\r\\n //Create an array of LI's for the words.\\r\\n for (i in eligible) {\\r\\n var word = eligible[i];\\r\\n\\r\\n var li = document.createElement('li');\\r\\n var a = document.createElement('a');\\r\\n a.href=\\\"javascript:false\\\";\\r\\n a.innerHTML = word;\\r\\n li.appendChild(a);\\r\\n\\r\\n if (highlighted == i) {\\r\\n li.className = \\\"selected\\\";\\r\\n }\\r\\n\\r\\n ul.appendChild(li);\\r\\n }\\r\\n\\r\\n div.replaceChild(ul,div.childNodes[0]);\\r\\n\\r\\n /********************************************************\\r\\n mouseover handler for the dropdown ul\\r\\n move the highlighted suggestion with the mouse\\r\\n ********************************************************/\\r\\n ul.onmouseover = function(ev)\\r\\n {\\r\\n //Walk up from target until you find the LI.\\r\\n var target = getEventSource(ev);\\r\\n while (target.parentNode && target.tagName.toUpperCase() != 'LI')\\r\\n {\\r\\n target = target.parentNode;\\r\\n }\\r\\n \\r\\n var lis = div.getElementsByTagName('LI');\\r\\n \\r\\n\\r\\n for (i in lis)\\r\\n {\\r\\n var li = lis[i];\\r\\n if(li == target)\\r\\n {\\r\\n highlighted = i;\\r\\n break;\\r\\n }\\r\\n }\\r\\n changeHighlight();\\r\\n \\r\\n };\\r\\n\\r\\n /********************************************************\\r\\n click handler for the dropdown ul\\r\\n insert the clicked suggestion into the input\\r\\n ********************************************************/\\r\\n ul.onclick = function(ev)\\r\\n {\\r\\n \\r\\n useSuggestion();\\r\\n hideDiv();\\r\\n cancelEvent(ev);\\r\\n return false;\\r\\n };\\r\\n div.className=\\\"suggestion_list\\\";\\r\\n div.style.position = 'absolute';\\r\\n }; // createDiv\\r\\n\\r\\n /********************************************************\\r\\n determine which of the suggestions matches the input\\r\\n ********************************************************/\\r\\n getEligible = function()\\r\\n {\\r\\n eligible = new Array();\\r\\n for (i in suggestions) \\r\\n {\\r\\n var suggestion = suggestions[i];\\r\\n \\r\\n if(suggestion.toLowerCase().indexOf(elem.value.toLowerCase()) == \\\"0\\\")\\r\\n {\\r\\n eligible[eligible.length]=suggestion;\\r\\n }\\r\\n }\\r\\n };\\r\\n \\r\\n getKeyCode = function(ev) {\\r\\n if(ev) { return ev.keyCode;}\\r\\n };\\r\\n\\r\\n getEventSource = function(ev) {\\r\\n if(ev) { return ev.target; }\\r\\n };\\r\\n\\r\\n cancelEvent = function(ev) {\\r\\n if(ev) { ev.preventDefault(); ev.stopPropagation(); }\\r\\n }\\r\\n } // autosuggest\\r\\n \\r\\n //document.write('<div id=\\\"autosuggest\\\"><ul></ul></div>');\\r\\n var div = document.createElement('div');\\r\\n div.setAttribute('id','autosuggest');\\r\\n document.body.appendChild(div);\\r\\n div.appendChild(document.createElement('ul'));\\r\\n} // tableView\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b94094d06fcd54a46d5a7b269e462fb5\",\n \"score\": \"0.5003326\",\n \"text\": \"update(dt) {\\n this.instance.update(dt);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9df7c4049147d03873384570c902079a\",\n \"score\": \"0.49766114\",\n \"text\": \"constructor() {\\n super({ dbName: dbName });\\n\\n const oThis = this;\\n\\n oThis.tableName = 'tags';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a382965a408c90a25f4cdb6e496e3c19\",\n \"score\": \"0.49580443\",\n \"text\": \"get darTP() {\\n return this.TP;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f7c46fe330b4b5e2a75ccdb6bdc5b84\",\n \"score\": \"0.4957206\",\n \"text\": \"function SimTable($simTable) {\\n this.$simTable = $simTable;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb8eaa2dd74d4368cf546aa6e8911b70\",\n \"score\": \"0.49564907\",\n \"text\": \"get instance() {\\n\\t\\treturn this.__instance;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77cc2d15dc4163caa010cc5aa947fa1d\",\n \"score\": \"0.4934677\",\n \"text\": \"constructor() {\\n super({ dbName: dbName });\\n\\n const oThis = this;\\n\\n oThis.tableName = 'tokens';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5573fd5a9391cb91033a8c1fc33c18c7\",\n \"score\": \"0.49241886\",\n \"text\": \"function gtGrdObj(tdObj) { try { var ele = tdObj.parentNode.parentNode.parentNode; if (ele.tagName.toLowerCase() == \\\"tbody\\\") le = ele.parentNode; return ele; } catch (e) { return null; } }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8dba69f37fe8ef25e8829d05059fab4\",\n \"score\": \"0.4920098\",\n \"text\": \"function q(){this.evTarget=tt,this.targetIds={},T.apply(this,arguments)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa7c739239482579ded4993b34052bb7\",\n \"score\": \"0.4918942\",\n \"text\": \"get name() { return this.tcid(); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c25c42cf8d67c35600bcefd526229e3\",\n \"score\": \"0.4880299\",\n \"text\": \"trans() {\\nreturn this._t;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fec8990af17a1fc1abe9c5dd28451abf\",\n \"score\": \"0.4871689\",\n \"text\": \"bind(context) {\\n this.$parent = context;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0fc3e147865bf23d54cf82379b69d6f\",\n \"score\": \"0.48596126\",\n \"text\": \"function tablerow(objtable, datasetname, tabledata, template, update) { // Do each row\\n if (!datasetname) datasetname = '';\\n\\n var TR;\\n\\n if (!update) { // New Record\\n\\tTR = objtable.find('.row_tablecontent').last();\\n\\n\\tobjtable.append(template); // Append invisible Template for next record\\n TR.attr(\\\"data-id\\\", tabledata._id); // assign Data To TR tag attribute data-id=1.2.3...\\n }else if(update=='new'){\\n objtable.prepend(template); // Template for next record\\n TR = objtable.find('.row_tablecontent').first();\\n TR.attr(\\\"data-id\\\", tabledata._id);\\n }else {\\n var nameofrow = \\\"[data-id=\\\" + tabledata._id + \\\"]\\\";\\n TR = objtable.find(nameofrow)\\n .first();\\n }\\n\\n\\n setdatabyclass(TR, datasetname, tabledata);\\n\\n //TR.show('slow');\\n return TR;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ec7c2cd32c70fc1146a116f7d1a31b8\",\n \"score\": \"0.484656\",\n \"text\": \"_forwardContentValues(instance) {\\n instance.datepicker = this;\\n instance.color = this.color;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"516e09173a0db62757b2581c41206614\",\n \"score\": \"0.483899\",\n \"text\": \"constructor() {\\n this.display = document.getElementById('displayRow'); //getting the tbody of our table\\n this.notify = document.getElementById('notification'); //getting the div tag above table to show alerts\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a56f4b77740a3a21bd944ba7ec9146ee\",\n \"score\": \"0.48319685\",\n \"text\": \"get cell() {\\n let parentNode = this.node.parentNode;\\n return parentNode && parentNode._newtabCell;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7eefebbf2ab847a8fcd7d14f93bd8827\",\n \"score\": \"0.48261744\",\n \"text\": \"constructor (el, data) {\\n el.tbInstance = this;\\n extend(this, data, { el: el });\\n\\n // defaults for all widget types\\n this.setDefaults({\\n poweredBy: true\\n });\\n\\n // set defaults\\n this.setDefaults(this.defaults());\\n\\n this.el = el;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fd47e0915920454e41a419b6024ab20\",\n \"score\": \"0.4818463\",\n \"text\": \"function A() {\\n\\t\\tt.call(this)\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a640ed365ede1af377478e708eb4bb6e\",\n \"score\": \"0.48009488\",\n \"text\": \"function itemTable() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"577f89e9141a8e022fa9633ba46235f2\",\n \"score\": \"0.47947276\",\n \"text\": \"openTable() {\\n this._stackItem = new TableStackItem(this._stackItem);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f91518d7b7da5dee8030fad3d790cdfd\",\n \"score\": \"0.47885925\",\n \"text\": \"get data() {\\n\\t\\treturn this._tableData;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"883e54789af553158c104a3507c13031\",\n \"score\": \"0.47839266\",\n \"text\": \"get target(){ return this.__target; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9541189044955202dd819bc74c175cd0\",\n \"score\": \"0.4774126\",\n \"text\": \"constructor() {\\n super({ dbName: dbName });\\n\\n const oThis = this;\\n\\n oThis.tableName = 'latest_transactions';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de716f50507860b768a7752276fc27d5\",\n \"score\": \"0.47672662\",\n \"text\": \"function t(e,t){if(!t.has(e))throw new TypeError(\\\"attempted to get private field on non-instance\\\");return t.get(e)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6cf2dd0c9d3907681e300477096fa1fa\",\n \"score\": \"0.47472554\",\n \"text\": \"function createInstanceRow(instanceData) {\\n var newTr = $(\\\"<tr>\\\");\\n //check where i'm pulling description from. may be the wrong word. \\n // newTr.data(\\\"description\\\", instanceData);\\n newTr.append(\\\"<td>\\\" + instanceData.Class_description.class_name + \\\"</td>\\\");\\n newTr.append(\\\"<td>\\\" + instanceData.week_day + \\\"</td>\\\");\\n newTr.append(\\\"<td>\\\" + instanceData.time + \\\"</td>\\\")\\n newTr.append(\\\"<td>\\\" + instanceData.start_date + \\\"</td>\\\");\\n newTr.append(\\\"<td>\\\" + instanceData.end_date + \\\"</td>\\\");\\n newTr.append(\\\"<td style='text-align: center;'>\\\" + instanceData.seats_total+ \\\"</td>\\\");\\n newTr.append(\\\"<td style='text-align: center;'>\\\" + instanceData.seats_filled+ \\\"</td>\\\");\\n //line below needs info to capture the info from the table description\\n $(\\\"#instance-table tbody\\\").append(newTr);\\n\\n return newTr;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61f9ef3d8f0717e59720597de9f5ba4f\",\n \"score\": \"0.47399446\",\n \"text\": \"constructor() {\\n super()\\n self = this\\n self.init()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eb35b5244a0d7f86ff9f1771a537e67\",\n \"score\": \"0.47387487\",\n \"text\": \"function table() {\\n this.table = null;\\n this.opts = {};\\n this.table_id = \\\"\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f87ba40e4fef4c58508b8f26202ef29b\",\n \"score\": \"0.47295478\",\n \"text\": \"function __initFormTable($dom) {\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b370c4f48599d6ffb9f6f16907afd13\",\n \"score\": \"0.47240978\",\n \"text\": \"function CdkCellOutletRowContext() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00af0935ec1a54e433e58d98779dea67\",\n \"score\": \"0.4722145\",\n \"text\": \"selectTower(){\\r\\n if (selectedTower != this){\\r\\n selectedTower = this;\\r\\n }\\r\\n else{\\r\\n selectedTower = null;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"136a63d2c9db806222b89aae1d6d1d6f\",\n \"score\": \"0.4721397\",\n \"text\": \"measured_TP(val) {\\n this._measured_TP = val;\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24ddf31bee2d7dfcb611a5f5eaf92597\",\n \"score\": \"0.4720601\",\n \"text\": \"function afterSomeTime() {\\n this.text = \\\"Two seconds have passed..\\\";\\n let func = () => {\\n // Notice how here 'this' captures the outer this\\n console.log(this.text);\\n };\\n setTimeout(func, 2000);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e223947985bf679803959d0ce9201243\",\n \"score\": \"0.4720128\",\n \"text\": \"async #renderTable() {\\n $(\\\"#\\\" + this.id).dataTable();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56ac4b701b4da0ccd0ef0d895f400c47\",\n \"score\": \"0.4718859\",\n \"text\": \"function Vt(){this.__data__=[]}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea03c0b171ee33fb2fb5ee4c2115e457\",\n \"score\": \"0.4708719\",\n \"text\": \"constructor() {\\n super({ dbName: dbName });\\n\\n const oThis = this;\\n\\n oThis.tableName = 'meetings';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"021209895fffdd8e4baeb53313d7b3a8\",\n \"score\": \"0.47022685\",\n \"text\": \"getGlobalTRX() {\\nreturn this.globalTRX;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"522c43e3524870fbd84406a835447332\",\n \"score\": \"0.4700845\",\n \"text\": \"function T0(t){this._=t;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e7c1cac210523d10f1ea1237de0abaca\",\n \"score\": \"0.4693868\",\n \"text\": \"setTable(Table) {\\n this.table = Table + '.do';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be63be55eca7a526178c5abd31943f42\",\n \"score\": \"0.46858203\",\n \"text\": \"_table() {\\n if (this._table_obj === undefined) {\\n this._table_obj = this.fwk_app_container.find('table#fwk-qserv-scheduler-hist');\\n }\\n return this._table_obj;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"519f3d347a900506ab5753ee144c65e1\",\n \"score\": \"0.46761814\",\n \"text\": \"function tr(t,e){this.x=e,this.q=t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"057b7607e0ad246f3573674ae694e56c\",\n \"score\": \"0.46686664\",\n \"text\": \"start() {\\n //let self = this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e356a629d41d94a898beab84d8fd5c2d\",\n \"score\": \"0.46653488\",\n \"text\": \"function getTableUpdate() {\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39b793c84be3e75b93b45243f239d35c\",\n \"score\": \"0.46611255\",\n \"text\": \"function self($this) {\\n\\treturn $this;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2133eec93ccb79ffda8434366205d157\",\n \"score\": \"0.46608463\",\n \"text\": \"function Table() {\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d1c2d5ef579e724030a6764ef158035\",\n \"score\": \"0.4659421\",\n \"text\": \"function AxisTableRenderer(parent){this.parent=parent;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d2d1ffd2759f74027cf888d2445ec46\",\n \"score\": \"0.46469113\",\n \"text\": \"constructor() { \\n \\n TrendedDataReport.initialize(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26ec86ef140122517a3280010a0300b1\",\n \"score\": \"0.46436965\",\n \"text\": \"constructor() {\\n\\n this.table = {};\\n\\n this.tableSize = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3bc94b53530fe63a8130a475b9da990c\",\n \"score\": \"0.4638839\",\n \"text\": \"init(){\\n var self = this;\\n self.generateData();\\n self.insertInfo();\\n self.copyData();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58ee5ab61079814de8c04fd570ef8bc2\",\n \"score\": \"0.4638349\",\n \"text\": \"constructor(){\\n this.instance = createTextBox();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45556f1a395ede0968a34a7ea93eefce\",\n \"score\": \"0.4634339\",\n \"text\": \"function doSomethingElse() {\\n console.log(this, 'normal function, this has its own context here');\\n console.log(self, 'normal function with a workaround to use this storing it in a variable called self');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d94c2a33e15599a22fa87f278f12ed9\",\n \"score\": \"0.46309555\",\n \"text\": \"function contextOfThis(){\\n return this\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ee2659db4b6edb40040cc68b6a95d37\",\n \"score\": \"0.4630106\",\n \"text\": \"constructor() {\\n super({ dbName: dbName });\\n\\n const oThis = this;\\n\\n oThis.tableName = 'aux_price_oracles';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"868a1daff9af0297b17afd7011bb5ae4\",\n \"score\": \"0.46288052\",\n \"text\": \"get selectedCell() {\\n return this.table.find('td.cell.selected');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37cad4507e96d098d803c9d145fbf890\",\n \"score\": \"0.46269718\",\n \"text\": \"function or(){this.__data__=new Ut}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04629064776b5e5f46794db6d0e9fe2b\",\n \"score\": \"0.4620828\",\n \"text\": \"function setTable() {\\n var elemT = $(\\\"#in_tableh\\\");\\n if (elemT.html() == \\\"true\\\") {\\n elemT.html(\\\"false\\\");\\n if ($(\\\"#is_ownerh\\\").html() == \\\"true\\\")\\n sittedTable = new Table($(\\\"#table_idh\\\").html(),true);\\n else\\n sittedTable = new Table($(\\\"#table_idh\\\").html(),false);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ada608bcd48f72f4c1604cc90d9f4c2f\",\n \"score\": \"0.4593819\",\n \"text\": \"constructor(template, _differs, _table) {\\n super(template, _differs);\\n this._table = _table;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb9163d881465b59b8f83155af27a7a4\",\n \"score\": \"0.4592558\",\n \"text\": \"InitClass() {\\n this.tpClass = 'tp.DataSource';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"698107d926b1334752fd4d746ca9ae3f\",\n \"score\": \"0.45813075\",\n \"text\": \"function Tester() {\\n this.t1a_Selector = \\\"#t2a\\\";\\n this.t1b_Selector = \\\"#t2b\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abc6f167ffa89d60a2697ce6b6c41371\",\n \"score\": \"0.4575399\",\n \"text\": \"constructor() {\\n super({ dbName: dbName });\\n\\n const oThis = this;\\n\\n oThis.tableName = 'user_profile_elements';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39e34bc17bce767021c2b659245fe742\",\n \"score\": \"0.45743015\",\n \"text\": \"function Row(tr)\\n{\\n this.tr=tr;\\n //\\n //Set the primary key of a row from the tr/primary key attribute\\n this.primarykey = tr.getAttribute('primarykey');\\n //\\n //Set the id of a row\\n this.id = tr.getAttribute('id');\\n \\n //Select this row by ensuring that it is the ony one with the current \\n //attribute\\n this.select = function()\\n {\\n // \\n //Select all currentl markd trs\\n var trs = document.querySelectorAll(\\\"[current]\\\");\\n //\\n //Remove the current attribute from them\\n for(var i=0; i<trs.length; i++)\\n {\\n trs[i].removeAttribute(\\\"current\\\");\\n }\\n // \\n //Make the given row as current\\n this.tr.setAttribute(\\\"current\\\", true);\\n //\\n //Save the current row for future reference. Note that local storage does\\n //not store objectts; rather it stores serializable data structures\\n window.last_tr=this.tr;\\n window.localStorage.last_tr_id=this.tr.getAttribute(\\\"id\\\");\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4648958174e35a7c8dab2995be5737ce\",\n \"score\": \"0.45740792\",\n \"text\": \"function TimelineThread(parent, tid) {\\n this.parent = parent;\\n this.tid = tid;\\n this.subRows = [[]];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3c8541f3a91ae4dbb696e7a89438abd\",\n \"score\": \"0.45702127\",\n \"text\": \"function highlight(td) {\\r\\n\\tconsole.log(\\\"Testing\\\");\\r\\n\\t\\tif (selectedTd) { // remove the existing highlight if any\\r\\n\\t\\t\\tselectedTd.classList.remove('addBold');\\r\\n\\t\\t}\\r\\n\\t\\tselectedTd = td;\\r\\n\\t\\tselectedTd.classList.add('addBold'); // highlight the new td\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e0e4a9d75184437e1a91c0487c1fc42\",\n \"score\": \"0.456851\",\n \"text\": \"function TLE() {\\n this._properties;\\n this._date;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55951612a1457d97d3a681dd4e1c0f77\",\n \"score\": \"0.4565371\",\n \"text\": \"construct(gantt, config) {\\n const me = this;\\n\\n me.tipId = `${gantt.id}-baselines-tip`;\\n me.gantt = gantt;\\n\\n super.construct(gantt, config);\\n\\n me.ganttDetatcher = gantt.on({\\n taskDrag : 'onTaskDrag',\\n afterTaskDrop : 'onAfterTaskDrop',\\n thisObj : me\\n });\\n\\n me.storeDetacher = gantt.taskStore.on({\\n update : {\\n fn : 'onStoreUpdateRecord',\\n thisObj : me,\\n prio : 1000\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eea9e3f16ba701ad9fda712c827cc1f5\",\n \"score\": \"0.45651677\",\n \"text\": \"function TXHT(id) {\\n\\n\\n TXHT.initDataDom(id);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab4ae58fdabd0548dc370a37996623f5\",\n \"score\": \"0.45617473\",\n \"text\": \"function getTd($tr) {\\n\\t\\t\\t\\tvar $td = $startTd.length != 0? $startTd: $endTd;\\n\\t\\t\\t\\tif ($td.hasClass(\\\"left\\\"))\\n\\t\\t\\t\\t\\treturn $tr.find(\\\"td.content.left\\\");\\n\\t\\t\\t\\telse if ($td.hasClass(\\\"right\\\"))\\n\\t\\t\\t\\t\\treturn $tr.find(\\\"td.content.right\\\");\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\treturn $tr.find(\\\"td.content\\\");\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b64c22efd397aa39ef033a2947c36ca4\",\n \"score\": \"0.45596147\",\n \"text\": \"selectTable() {\\n if (!this.owner.enableSelection) {\\n return;\\n }\\n this.selectTableInternal();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ab1a58ec883ca381a42a9971f4d5d05\",\n \"score\": \"0.45593542\",\n \"text\": \"function GPT() {\\n return this;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e06801a5749d7d24ef4034182196ee4a\",\n \"score\": \"0.45575956\",\n \"text\": \"init(){\\n\\t\\tthis._active = true\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"748ef816ab33601d76adf57780674897\",\n \"score\": \"0.45556393\",\n \"text\": \"table() {\\n this.showtable= ! this.showtable;\\n //workaround - table width is incorect when rendered hidden\\n //render it after 100 ms again, usually after it is shown, thus calculating\\n //correct width\\n if (this.showtable) window.setTimeout(function(that){that.ht2.render()},100,this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f4b33da70c5e505997d6761a9329bcf\",\n \"score\": \"0.45552093\",\n \"text\": \"function TableData(table, options) {\\n\\t\\tthis.$table = $(table);\\n\\t\\tthis.options = $.extend({}, defaults, options);\\n\\t\\t// look for a dataTable extension on this table\\n\\t\\tif ($.fn.DataTable && $.fn.DataTable.fnIsDataTable(this.$table.get(0))) {\\n\\t\\t\\tthis.dataTable = this.$table.dataTable();\\n\\t\\t}\\n\\t\\tthis.parse();\\n\\t\\tthis.$table.data(\\\"visualize-data\\\", this);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e23cb1505bb191154b15e4a9567f0bd\",\n \"score\": \"0.4554322\",\n \"text\": \"constructor() {\\n super();\\n\\n this.session = null;\\n\\n this.past = [];\\n this.future = [];\\n this.updating = false; /* <-----\\n updating variable is changing types through out the application \\n runtime from a boolean, null, and function. <.< \\n TODO: refactor to have a consistent type \\n */\\n \\n // creating a reference for the instance name element to read its value\\n this.refInputInstance = React.createRef();\\n this.loadAllInstances = this.loadAllInstances.bind(this)\\n this.saveInstance = this.saveInstance.bind(this)\\n this.loadStateFromInstance = this.loadStateFromInstance.bind(this)\\n this.instanceButtons = this.instanceButtons.bind(this)\\n this.loadUserInstances = this.loadUserInstances.bind(this)\\n \\n // state will be read at custom mode setState of App component to send to the websocket server\\n this.state = {\\n tables: {},\\n instances: []\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0f237d40c026767f37876c4a15bcca2\",\n \"score\": \"0.4552781\",\n \"text\": \"get tus() { return tus; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"987b58d2ab747299c92b0c36c25e18a9\",\n \"score\": \"0.45519957\",\n \"text\": \"function initInstanceInfoTooltip() {\\n jQuery('#instance-tooltip').tooltip();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11de85b36fe454f1b8c7a5d232fdee94\",\n \"score\": \"0.4549164\",\n \"text\": \"function tripTableInteractionInit(){\\n $('#active-trains-table tbody').on('click', 'tr', function () {\\n var data = global.tripDatatable.row( this ).data();\\n onClickTripRow(data);\\n \\n // Update class: selected for row display\\n if ( $(this).hasClass('selected') ) {\\n $(this).removeClass('selected');\\n }\\n else {\\n global.tripDatatable.$('tr.selected').removeClass('selected');\\n $(this).addClass('selected');\\n }\\n } );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37aa3d9c7a7795266de4eec3c77230a4\",\n \"score\": \"0.45486185\",\n \"text\": \"newTurtle() {\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0a2bb22947b3e98de513ff897743ce9\",\n \"score\": \"0.45416552\",\n \"text\": \"_2thr(val) {\\n this.__2thr = val;\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf60b30f90efe5349d0936b0c61ae3d0\",\n \"score\": \"0.4539663\",\n \"text\": \"set(trs) {\\nreturn this.setFromTRSet(trs);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f85fb6eea26639c94a2178f9b38fc49\",\n \"score\": \"0.45364282\",\n \"text\": \"initialize(instance) {\\n this.instance = instance;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95a593458aace56978b4db539d34c1b2\",\n \"score\": \"0.453357\",\n \"text\": \"function t(t) {\\n this.count = t;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":72,"cells":{"query_id":{"kind":"string","value":"44eed7e81a733925352630a4047892cb"},"query":{"kind":"string","value":"create the grid class"},"positive_passages":{"kind":"list like","value":[{"docid":"b6638c4c05344c9ed2dc062016227888","score":"0.0","text":"function grid(options) {\n //declare members\n this.behavior = \"tabular\";\n this.container = \"\";\n this.columns = [];\n this.data = null;\n this.width = \"auto\";\n this.height = \"auto\";\n this.pageIndex = 1;\n this.pageSize = 100;\n this.sortDirection = \"asc\";\n this.sortField = \"\";\n this.paginatorText = 'Records from {0} to {1} of total {2}';\n this.pivotMode = \"tree\";\n\n //declare needed variables\n var that = this;\n var container = null;\n\n //iterate all keys in options\n for (var key in options) {\n that[key] = options[key];\n }\n\n //handle errors\n if (that.container === \"\")\n return null;\n\n //declare internal members\n that._totalPages = 0;\n that._pager = null;\n that._firstCol = null;\n that._minMaxValues = null;\n that._classicalMinMax = null;\n that._rows = null;\n that._totalRecords = null;\n that._columnNames = [];\n that._rowTitles = [];\n that._rowNames = [];\n that._dataNames = [];\n that._totalColWidth = 0;\n that._subBtns = null;\n that._btns = null;\n that._header = null;\n that._footer = null;\n that._rowsContainer = null;\n that._colElements = null;\n that._colResizers = null;\n that._selectedRow = null;\n that._rowElements = null;\n that._gauges = [];\n\n //iterate all columns to set col specific members\n that.columns.forEach(function (c) {\n switch (c.direction) {\n case \"column\":\n {\n that._columnNames.push(c.fieldName);\n }\n break;\n case \"row\":\n {\n that._rowNames.push(c.fieldName);\n that._rowTitles.push(c.columnName);\n\n //set first col\n if (that._rowNames.length === 1)\n that._firstCol = c;\n }\n break;\n case \"data\":\n {\n that._dataNames.push(c.fieldName);\n }\n break;\n default:\n {\n that._columnNames.push(c.fieldName);\n }\n break;\n }\n });\n\n //initializes the grid\n let initGrid = function () {\n //set document element\n container = $('#' + that.container);\n\n //add pagos class into the client element\n if (!container.hasClass('pagos-grid'))\n container.addClass('pagos-grid');\n\n //declare needed variables\n let headerHeight = 0,\n rowsHeight = container.height() - 56,\n footerHeight = 0,\n headerHtml = \"\",\n html = \"\";\n\n //set grid dimensio\n container.css(\"width\", (that.width === 'auto' ? '100%' : that.width + 'px'));\n container.css(\"height\", (that.height === 'auto' ? container.height() : that.height + 'px'));\n\n //check if the behavior is pivot\n if (that.behavior === \"pivot\") {\n //declare variables\n let colWidth = that._firstCol.width ? that._firstCol.width : 100,\n colAlign = that._firstCol.labelPosition === \"auto\" ? \"left\" : that._firstCol.labelPosition,\n cellStyle = 'width: ' + colWidth + 'px;',\n colStyle = 'width: ' + colWidth + 'px; text-align: ' + colAlign + '; height: 27px; padding-top: 5px;',\n sortClass = '';\n\n //set background position\n if (colAlign === \"right\")\n colStyle += 'background-position: left';\n else\n colStyle += 'background-position: right';\n\n //construct column\n headerHtml += '<td class=\"colContainer ' + that.container + '_rowCol_0\" style=\"' + cellStyle + '\">';\n headerHtml += '<div id=\"' + that.container + '_col_0\" columnindex=\"0\" colname=\"' + that._firstCol.fieldName + '\" colid=\"' + that._firstCol.fieldID + '\" dataindex=\"0\" class=\"column ' + that.container + '_cols ' + sortClass + ' ' + that.container + '_rowCol_0\" style=\"' + colStyle + '\">';\n headerHtml += that._rowTitles.join('-');\n headerHtml += '</div></td>';\n\n //set min and max values\n that._minMaxValues = {};\n }\n\n //iterate all column\n that.columns.forEach(function (c, i) {\n //declare variables\n let colWidth = c.width ? c.width : 100,\n colAlign = c.labelPosition === \"auto\" ? \"left\" : c.labelPosition,\n cellStyle = 'width: ' + colWidth + 'px;',\n colStyle = 'width: ' + colWidth + 'px; text-align: ' + colAlign + '; height: 27px; padding-top: 5px;',\n sortClass = '';\n\n //set sorter position\n if (colAlign === 'right')\n colStyle += 'background-position: left';\n else\n colStyle += 'background-position: right';\n\n //check grid behavior\n if (that.behavior === 'tabular') {\n //construct column\n headerHtml += '<td class=\"colContainer ' + that.container + '_rowCol_' + i + '\" style=\"' + cellStyle + '\">';\n headerHtml += '<div id=\"' + that.container + '_col_' + i + '\" columnindex=\"' + i + '\" colname=\"' + c.fieldName + '\" colid=\"' + c.fieldID + '\" dataindex=\"' + i + '\" class=\"column ' + that.container + '_cols ' + sortClass + '\" style=\"' + colStyle + '\">';\n headerHtml += c.columnName;\n headerHtml += '</div></td>';\n } else {\n //check column behavior\n if (c.direction === 'data') {\n //set min and max values\n that._minMaxValues['min' + c.fieldName] = 0;\n that._minMaxValues['max' + c.fieldName] = 0;\n\n //construct column\n headerHtml += '<td class=\"colContainer ' + that.container + '_rowCol_' + i + '\" style=\"' + cellStyle + '\">';\n headerHtml += '<div id=\"' + that.container + '_col_' + i + '\" columnindex=\"' + i + '\" colname=\"' + c.fieldName + '\" colid=\"' + c.fieldID + '\"dataindex=\"' + i + '\" class=\"column ' + that.container + '_cols ' + sortClass + '\" style=\"' + colStyle + '\">';\n headerHtml += c.columnName;\n headerHtml += '</div></td>';\n }\n }\n\n //set an empty col\n headerHtml += '</td>';\n\n //check grid behaivor\n if (that.behavior === 'tabular') {\n //set col width\n that._totalColWidth += c.width ? c.width : 100;\n } else {\n //check col behavior\n if (c.direction === 'row' || c.direction === 'data')\n that._totalColWidth += c.width ? c.width : 100;\n }\n });\n\n //set grid content\n html += '<div id=\"' + that.container + '_hct\" style=\"width: 100%;\" class=\"pagos-grid-rail-content\">';\n html += '<table id=\"' + that.container + '_hdr\" class=\"pagos-grid-header\" style=\"\" border=\"0\" cellpadding=\"0\" cellspacing=\"0\"><tr>';\n html += headerHtml;\n html += '</tr></table></div>';\n html += '<div id=\"' + that.container + '_rows\" class=\"' + (that.behavior == 'tabular' ? 'pagos-grid-row-container' : 'pagos-pivot-row-container') + '\" style=\"width: 100%; height: ' + rowsHeight + 'px;\">';\n html += '</div>';\n\n //create footer\n if (that.behavior === 'tabular') {\n //set grid footer content\n html += '<table id=\"' + that.container + '_ft\" class=\"pagos-grid-footer\" style=\"min-width: 100%;\"><tr><td>';\n html += '<div id=\"' + that.container + '_first\" class=\"pagos-grid-button pagos-grid-button-first\"><i class=\"fa fa-fast-backward\"></i></div>';\n html += '<div id=\"' + that.container + '_prev\" class=\"pagos-grid-button pagos-grid-button-prev\"><i class=\"fa fa-backward\"></i></div>';\n html += '<div id=\"' + that.container + '_navText\" class=\"pagos-grid-footer-layer\">' + that.paginatorText + '</div>';\n html += '<div id=\"' + that.container + '_next\" class=\"pagos-grid-button pagos-grid-button-next\"><i class=\"fa fa-forward\"></i></div>';\n html += '<div id=\"' + that.container + '_last\" class=\"pagos-grid-button pagos-grid-button-last\"><i class=\"fa fa-fast-forward\"></i></div>';\n html += '<div id=\"grid_footer_layer\" class=\"pagos-grid-footer-layer\">Jump to page: <input id=\"' + that.container + '_pager\" type=\"text\" style=\"text-align: center; padding-left: 0px; width: 50px;\" /></div>';\n html += '</td></tr></table>';\n } else {\n //check whether the sub totals are visible\n if (that.showSubTotals) {\n //set pivot footer content\n let colWidth = that._firstCol.width ? that._firstCol.width : 100;\n html += '<div id=\"' + that.container + '_fct\" class=\"pagos-grid-rail-content\" style=\"width: 100%;\">';\n html += '<table id=\"' + that.container + '_ft\" class=\"pagos-grid-subtotal\" border=\"0\" cellpadding=\"0\" cellspacing=\"0\"><tr>';\n html += '<td class=\"pagos-grid-subtotal-cell-container ' + that.container + '_rowCol_0\" style=\"width: ' + colWidth + 'px;\">';\n html += '<div id=\"' + that.container + '_subTotal_0\" class=\"pagos-grid-subtotal-cell ' + that.container + '_rowCol_0\" style=\"width: ' + colWidth + 'px;\">Grand Total</div></td>';\n\n //Iterate all data columns\n that.columns.forEach(function (column, columnIndex) {\n //check if the column is data\n if (column.direction === 'data') {\n let colDataWidth = column.width ? column.width : 100;\n html += '<td class=\"pagos-grid-subtotal-cell-container ' + that.container + '_rowCol_' + columnIndex + '\" style=\"width: ' + colDataWidth + 'px;\">';\n html += '<div id=\"' + that.container + '_subTotal_' + columnIndex + '\" class=\"pagos-grid-subtotal-cell ' + that.container + '_rowCol_' + columnIndex + '\" style=\"width: ' + colDataWidth + 'px;\">0</div></td>';\n }\n });\n\n //set empty col\n html += '</td>';\n\n //closure for pivot footer\n html += '</tr></table></div>';\n }\n }\n\n //append the content\n container.html(html);\n\n //set footer events\n if (that.behavior === 'tabular') {\n //Set buttons\n $('#' + that.container + '_first').on(\"click\", function () {\n //check if first page\n if (that.pageIndex == 1)\n return;\n\n //set page index\n that.pageIndex = 1;\n\n //update footer\n setFooter();\n\n //raise page changed event\n if (that.onPageChanged)\n that.onPageChanged(that.pageIndex);\n });\n\n $('#' + that.container + '_prev').on(\"click\", function () {\n //check if first page\n if (that.pageIndex == 1)\n return;\n\n //set page index\n that.pageIndex -= 1;\n\n //update footer\n setFooter();\n\n //raise page changed event\n if (that.onPageChanged)\n that.onPageChanged(that.pageIndex);\n });\n\n $('#' + that.container + '_next').on(\"click\", function () {\n //check if last page\n if (that.pageIndex == that._totalPages)\n return;\n\n //set page index\n that.pageIndex += 1;\n\n //update footer\n setFooter();\n\n //raise page changed event\n if (that.onPageChanged)\n that.onPageChanged(that.pageIndex);\n });\n\n $('#' + that.container + '_last').on(\"click\", function () {\n //check if last page\n if (that.pageIndex == that._totalPages)\n return;\n\n //set page index\n that.pageIndex = that._totalPages;\n\n //update footer\n setFooter();\n\n //raise page changed event\n if (that.onPageChanged)\n that.onPageChanged(that.pageIndex);\n });\n\n //set pager textbox\n that._pager = $(\"#\" + that.container + \"_pager\");\n that._pager.on(\"change\", function () {\n let enteredPageIndex = parseInt(that._pager.val());\n if (isNaN(enteredPageIndex))\n return false;\n\n //handle min\n if (enteredPageIndex < 1)\n if (that.pageIndex === 1) {\n that._pager.val(1);\n return;\n }\n else\n enteredPageIndex = 1;\n\n //handle min\n if (enteredPageIndex > that._totalPages)\n if (that.pageIndex === that._totalPages) {\n that._pager.val(that._totalPages);\n return;\n }\n else\n enteredPageIndex = that._totalPages;\n\n //set page index\n that.pageIndex = enteredPageIndex;\n\n //update footer\n setFooter();\n\n //raise page changed event\n if (that.onPageChanged)\n that.onPageChanged(that.pageIndex);\n\n });\n\n //set pager content\n that._pager.val(that.pageIndex.toString());\n }\n\n //get columns\n that._header = $('#' + that.container + '_hdr');\n that._footer = $('#' + that.container + '_ft');\n that._colElements = $('.' + that.container + '_cols');\n that._rowsContainer = $('#' + that.container + '_rows');\n\n //check if col elements is not null\n if (that._colElements != null && that._colElements.length) {\n //set column click event\n that._colElements.on(\"click\", function () {\n //get colindex and dataindex\n let colIndex = parseInt($(this).attr('columnindex'));\n let dataIndex = parseInt($(this).attr('dataindex'));\n\n //set sorter\n setSorter(colIndex, dataIndex);\n });\n }\n\n //check if rows container is not null\n if (that._rowsContainer != null && that._rowsContainer.length) {\n //set scroll event for rows container\n that._rowsContainer.scroll(function () {\n let scrollArea = $(this);\n let leftPos = scrollArea.scrollLeft();\n let maxLeft = scrollArea[0].scrollWidth - scrollArea[0].clientWidth;\n let lastSubTotalCol = $('#' + that.container + '_subTotal_' + (that.columns.length - 1));\n let hct = $('#' + that.container + '_hct');\n let fct = $('#' + that.container + '_fct');\n\n //check header container\n if (hct != null && hct.length)\n hct.scrollLeft(leftPos);\n\n //check footer container\n if (fct != null && fct.length)\n fct.scrollLeft(leftPos);\n \n });\n }\n\n //check if grid has data\n if (that.data != null)\n bindData(that.data);\n };\n\n //sets footer\n let setFooter = function () {\n //declare variables\n var navText = that.paginatorText,\n rangeMin = ((that.pageIndex - 1) * that.pageSize) + 1,\n rangeMax = rangeMin + that.pageSize - 1,\n nText = $('#' + that.container + '_navText');\n\n //set range max\n if (rangeMax > that._totalRecords)\n rangeMax = that._totalRecords;\n\n //set total pages\n that._totalPages = Math.ceil(that._totalRecords / that.pageSize);\n\n //set navigator text\n navText = navText.replace('{0}', rangeMin.group('.', ',', 0));\n navText = navText.replace('{1}', rangeMax.group('.', ',', 0));\n navText = navText.replace('{2}', that._totalRecords);\n\n //set text content in navigator\n if (nText != null)\n nText.html(navText);\n\n //set pager text\n if (that._pager != null)\n that._pager.val(that.pageIndex);\n };\n\n //sets sorter \n let setSorter = function (colIndex, dataIndex) {\n //declare variables\n var col = $('#' + that.container + '_col_' + colIndex),\n column = that.columns[dataIndex],\n sortClass = that.sortDirection === 'desc' ? 'pagos-grid-sorter-desc' : 'pagos-grid-sorter-asc';\n\n //check if col elements is not null\n if (that._colElements != null) {\n //clear sorters\n that._colElements.removeClass('pagos-grid-sorter-asc');\n that._colElements.removeClass('pagos-grid-sorter-desc');\n }\n\n //check if sorter field is changed\n if (that.sortField != column.fieldName) {\n that.sortDirection = 'asc';\n sortClass = 'pagos-grid-sorter-asc';\n }\n\n if (typeof isSinglePostPage != 'undefined') {\n\n var fieldName = column.fieldName;\n var dataType = column.columnType;\n\n that._rows = that._rows.sort(function (a, b) {\n switch (dataType) {\n case 'numeric':\n {\n //get field values\n var aValue = parseFloat(a[fieldName]);\n var bValue = parseFloat(b[fieldName]);\n\n if (isNaN(aValue))\n aValue = 0;\n\n if (isNaN(bValue))\n bValue = 0;\n\n if (that.sortDirection === 'asc') {\n return aValue - bValue;\n } else {\n return bValue - aValue;\n }\n }\n case 'datetime':\n {\n //get field values\n if (that.sortDirection === 'asc') {\n return (new Date(a[fieldName]) > new Date(b[fieldName])) ? 1 : ((new Date(a[fieldName]) < new Date(b[fieldName])) ? -1 : 0);\n } else {\n return (new Date(b[fieldName]) > new Date(a[fieldName])) ? 1 : ((new Date(b[fieldName]) < new Date(a[fieldName])) ? -1 : 0);\n }\n }\n default:\n {\n if (that.sortDirection === 'asc') {\n return (a[fieldName] > b[fieldName]) ? 1 : ((a[fieldName] < b[fieldName]) ? -1 : 0);\n } else {\n return (b[fieldName] > a[fieldName]) ? 1 : ((b[fieldName] < a[fieldName]) ? -1 : 0);\n }\n }\n }\n });\n\n that.bind(that.data);\n\n //update sort direction\n that.sortDirection = that.sortDirection === 'asc' ? 'desc' : 'asc';\n }\n\n //set sort field\n that.sortField = column.fieldName;\n that.sortFieldID = column.fieldID;\n\n //check if col element is not null\n if (col != null) {\n //add sort class\n col.addClass(sortClass);\n\n //set sorter position\n if (column.labelPosition === 'right')\n col.css('backgroundPosition', 'left');\n else\n col.css('backgroundPosition', 'right');\n }\n\n //set page index and paginator\n /*if (that.behavior === 'tabular') {\n //set pae index\n that.pageIndex = 1;\n\n //set footer\n setFooter();\n }*/\n\n //raise on before sort\n if (that.onSort) {\n that.onSort(that.sortField, that.sortFieldID, that.sortDirection === 'asc' ? 'desc' : 'asc');\n\n //update sort direction\n that.sortDirection = that.sortDirection === 'asc' ? 'desc' : 'asc';\n }\n\n };\n\n //binds data for the grid\n let bindData = function () {\n //switch grid behavior\n switch (that.behavior) {\n case 'tabular':\n bindGrid(that.data);\n break;\n case 'pivot':\n bindPivot(that.data);\n break;\n }\n\n //assign resizable to each cols\n $('.' + that.container + '_cols').each(function (index) {\n //attach resizable\n $(this).resizable({\n handles: 'e',\n resize: function (e, ui) {\n //declare needed variables\n let currentColField = $(this).attr('colid');\n let currentColIndex = getColIndexByID(currentColField);\n\n //update col size\n that.columns[currentColIndex].width = ui.size.width;\n\n //resize columns\n $('.' + that.container + '_rowCol_' + currentColIndex).css('width', ui.size.width + 'px');\n\n //raise callback\n if (that.onColumnResize)\n that.onColumnResize(currentColField, currentColIndex, ui.size.width);\n },\n stop: function (e, ui) {\n\n }\n });\n });\n };\n\n //binds grid dataset\n let bindGrid = function (data) {\n //declare variables\n let html = '';\n\n //set rows, minmax and total records\n that._rows = data.rows;\n that._totalRecords = data.totalRecords;\n that._minMaxValues = data.minMaxValues;\n\n //get length\n let rowsContainerHeight = parseInt(that._rowsContainer.css('height'));\n let rowLimit = Math.floor(rowsContainerHeight / 20);\n\n //iterate all rows\n that._rows.forEach(function (row, rowIndex) {\n //hide class for screenshots\n let hideClassForScreenshot = '';\n\n //check row index to set screenshot class\n if (rowIndex >= rowLimit)\n hideClassForScreenshot = ' pagos-grid-last2';\n\n //build html\n html += '<tr id=\"' + that.container + '_row_' + rowIndex + '\" class=\"pagos-grid-row pagos-grid-row-hlines ' + that.container + '_rows ' + hideClassForScreenshot + '\">';\n\n //iterate all columns\n that.columns.forEach(function (column, colIndex) {\n //check if the column behavior is column\n html += getCellContent(row, column, rowIndex, colIndex, 0);\n });\n\n //closure for row html\n html += '</tr>';\n });\n\n //append rows html\n that._rowsContainer.html('<table cellpadding=\"0\" cellspacing=\"0\">' + html + '</table>');\n that._rowElements = $('.' + that.container + '_rows');\n\n //check if row elements is not null\n if (that._rowElements.length) {\n //set rows click event\n that._rowElements.on(\"click\", function (index) {\n //declare variables\n var item = $(this);\n\n //remove selected class from all rows\n that._rowElements.removeClass('pagos-grid-row-selected');\n\n //add current item seleted class\n item.addClass('pagos-grid-row-selected');\n\n //set selected row\n that._selectedRow = that._rows[index];\n\n //raise row selected event\n if (that.onRowSelected)\n that.onRowSelected(that._selectedRow);\n });\n }\n\n //set conditional formatting\n setConditionalFormat(that._rows, 0);\n\n //check if the page index = 1\n if (that.pageIndex === 1) {\n //set footer content\n setFooter();\n\n\n }\n };\n\n //binds pivot dataset\n let bindPivot = function (data) {\n //declare needed variables\n var rowID = '',\n subID = '',\n subDiv = null,\n rowIndex = 0,\n subTotalCell = null,\n subTotalValue = '',\n html = '';\n\n //set rows\n that._rows = data.rows;\n\n //iterate all rows\n that._rows.forEach(function (row, index) {\n //set row and sub id\n rowID = that.container + '_row_' + index;\n subID = rowID + '_sub';\n\n //build html\n html += '<tr id=\"' + rowID + '\" class=\"pagos-grid-row pagos-grid-row-hlines ' + that.container + '_rows\">';\n\n //set first row\n html += getCellContent(row, that._firstCol, index, 0, 0);\n\n //iterate all columns\n that.columns.forEach(function (column) {\n //check if the current column has a data behavior\n if (column.direction === 'data') {\n //increase col index\n var colIndex = getColIndexByfieldName(column.fieldName);\n\n //set cell\n html += getCellContent(row, column, index, colIndex, 0);\n\n //set min col value\n if (row[column.fieldName] < that._minMaxValues['min' + column.fieldName])\n that._minMaxValues['min' + column.fieldName] = row[column.fieldName];\n\n //set max col value\n if (row[column.fieldName] > that._minMaxValues['max' + column.fieldName])\n that._minMaxValues['max' + column.fieldName] = row[column.fieldName];\n }\n });\n\n //closure for row\n html += '</tr>';\n\n //add sub row container\n html += '<tr id=\"' + subID + '\" class=\"pagos-grid-sub-row-container\"><td colspan=\"' + (that.columns.length - 1) + '\"></td></tr>';\n });\n\n //append rows html\n that._rowsContainer.html('<table cellpadding=\"0\" cellspacing=\"0\">' + html + '</table>');\n that._rowElements = $('.' + that.container + '_rows');\n\n //check if row elements is not null\n if (that._rowElements.length) {\n //set rows click event\n that._rowElements.on(\"click\", function (index) {\n //declare variables\n var item = $(this);\n\n //remove selected class from all rows\n that._rowElements.removeClass('pagos-grid-row-selected');\n\n //add current item seleted class\n item.addClass('pagos-grid-row-selected');\n\n //set selected row\n that._selectedRow = that._rows[index];\n\n //raise row selected event\n if (that.onRowSelected)\n that.onRowSelected(that._selectedRow);\n });\n }\n\n //set sub buttons click event\n that._subBtns = $('.' + that.container + '_subBtns_0');\n\n //check if sub buttons is not null\n if (that._subBtns.length) {\n //attach click event\n that._subBtns.on(\"click\", function (index) {\n var item = $(this);\n rowIndex = parseInt(item.attr('rowindex'));\n\n //declare variables\n var subDivID = '#' + that.container + '_row_' + rowIndex + '_sub';\n\n //get sub content div\n subDiv = $(subDivID);\n\n //set sub button class\n if (item.hasClass('pagos-grid-minus'))\n item.removeClass('pagos-grid-minus');\n else\n item.addClass('pagos-grid-minus');\n\n //hide all subs\n $('.pagos-grid-sub-row-container').css(\"display\", \"none\");\n\n //check if expanded\n if (item.hasClass('pagos-grid-minus')) {\n //set sub div style\n subDiv.css('display', 'table-row');\n\n //build sub rows\n buildSubRows(subDiv, subDivID, that._rows[rowIndex], 0);\n } else {\n //set sub div style\n subDiv.css('display', 'none');\n }\n });\n }\n\n //check if sub totals are visible\n if (that.showSubTotals) {\n //iterate all columns\n that.columns.forEach(function (column) {\n //check if col behavior is data\n if (column.direction === 'data') {\n //get column index\n let columnIndex = getColIndexByfieldName(column.fieldName);\n\n //get subtotal cell\n subTotalCell = $('#' + that.container + '_subTotal_' + columnIndex);\n\n //get summarize value\n subTotalValue = getSummarizeByColumn(columnIndex);\n\n //check if sub total cell is not null\n if (subTotalCell != null) {\n //set sub total cell\n subTotalCell.html(subTotalValue);\n\n //attach title value\n subTotalCell.attr('title', subTotalValue);\n }\n }\n });\n }\n\n //check whether the pivot mode is classical\n if (that.pivotMode === 'classical')\n that._classicalMinMax = getClassicalMinMaxValues(that._rows);\n\n //set conditional format\n setConditionalFormat(that._rows, 0);\n };\n\n let buildSubRows = function (div, divID, row, depth) {\n //declare variables\n var increasedDepth = depth + 1,\n html = '',\n firstCol = null,\n subRowElements = null,\n subBtns = null,\n subID = '',\n subDiv = null,\n rowIndex = 0,\n subs = row.sub;\n\n //check whether the rows has sub\n if (subs != null && subs.length > 0) {\n //get first col\n firstCol = getColByName(that._rowNames[increasedDepth]);\n firstCol.width = getColByName(that._rowNames[0]).width;\n\n //iterate all sub rows\n subs.forEach(function (row, index) {\n //set sub cell id\n subID = divID + '_row_' + index + '_sub';\n\n //build html\n html += '<tr id=\"' + that.container + '_subs_' + increasedDepth + '\" class=\"pagos-grid-sub-row ' + that.container + '_subRows_' + increasedDepth + '\">';\n html += getSubCellContent(row, firstCol, index, 0, (depth + 1), divID);\n\n //iterate all columns\n that.columns.forEach(function (column) {\n //check whether the col behavior is data\n if (column.direction === 'data') {\n //increase col index\n var colIndex = getColIndexByID(column.fieldID);\n\n //get cell html\n html += getSubCellContent(row, column, index, colIndex, (depth + 0), divID);\n\n //set min value\n if (row[column.fieldName] < that._minMaxValues['min' + column.fieldName])\n that._minMaxValues['min' + column.fieldName] = row[column.fieldName];\n\n //set max value\n if (row[column.fieldName] > that._minMaxValues['max' + column.fieldName])\n that._minMaxValues['max' + column.fieldName] = row[column.fieldName];\n }\n });\n\n //closure for row\n html += '</tr>';\n html += '<tr id=\"' + subID + '\" class=\"pagos-grid-sub-row-container\"><td colspan=\"' + (that.columns.length - 1) + '\"></td></tr>';\n });\n }\n\n //set sub content\n div.children().first().html('<table border=\"0\" cellpadding=\"0\" cellspacing=\"0\">' + html + '</table>');\n\n //set sub row elements\n subRowElements = $('.' + that.container + '_subRows_' + increasedDepth);\n\n //check if sub row eelemnts is not null\n if (subRowElements.length) {\n //set click event\n subRowElements.on(\"click\", function (index) {\n //get item\n var item = $(this);\n\n //remove selected class\n subRowElements.removeClass('pagos-grid-row-selected');\n\n //add selected class\n item.addClass('pagos-grid-row-selected');\n });\n }\n\n //get sub buttons\n subBtns = $('.' + that.container + '_subBtns_' + increasedDepth);\n\n //check if subButtons are not null\n if (subBtns.length) {\n //attach click event to sub buttons\n subBtns.on(\"click\", function (index) {\n //get item\n var item = $(this);\n\n //set row index\n rowIndex = parseInt(item.attr('rowindex'));\n\n //get sub content div\n subDiv = $('#' + that.container + '_row_' + rowIndex + '_sub');\n\n //set sub button class\n if (item.hasClass('pagos-grid-minus'))\n item.removeClass('pagos-grid-minus');\n else\n item.addClass('pagos-grid-minus');\n\n //check if expanded\n if (item.hasClass('pagos-grid-minus')) {\n //show subs\n subDiv.css('display', 'table-row');\n\n //build sub rows\n buildSubRows(subDiv, '#' + that.container + '_row_' + rowIndex + '_sub', subs[rowIndex], increasedDepth);\n } else {\n //hide subs\n subDiv.css('display', 'none');\n }\n });\n }\n\n //set conditional format\n setConditionalFormat(subs, depth, divID);\n };\n\n let getSummarizeValueForColumn = function (column, row, rowIndex) {\n let abs = row[column.fieldName];\n\n //gets count of the rows\n let getSubRowCount = function () {\n let cnt = 0;\n row.sub.forEach(function (d) {\n if (d[column.fieldName] != null)\n cnt++;\n });\n return cnt;\n };\n\n if (row.sub && row.sub.length) {\n let totalValue = d3.sum(row.sub, function (d) { return d[column.fieldName]; });\n let subRowsCount = getSubRowCount();\n\n //switch expression\n switch (column.expression) {\n case 'count':\n abs = subRowsCount;\n case 'sum':\n abs = totalValue;\n break;\n case 'avg':\n {\n abs = totalValue / subRowsCount;\n }\n break;\n case 'min':\n abs = d3.min(row.sub, function (d) { return d[column.fieldName]; });\n break;\n case 'max':\n abs = d3.max(row.sub, function (d) { return d[column.fieldName]; });\n break;\n default:\n abs = totalValue;\n break;\n }\n }\n\n\n return abs;\n }\n\n let getCellContent = function (row, column, rowIndex, colIndex, depth) {\n //declare variables\n let html = '',\n cellID = that.container + '_row_' + rowIndex + '_col_' + colIndex + '_depth_' + depth,\n subs = row['sub'],\n bSub = '',\n actualColumnValue = row[column.fieldName],\n formattedColumnValue = formatCell(row[column.fieldName], column),\n cellStyle = 'width: ' + column.width + 'px; text-align: ' + column.labelPosition + '; ';\n\n if (that.type === \"pivot\" && column.direction === \"data\") {\n actualColumnValue = column.expression === \"avg\" ? +row[column.fieldName] : getSummarizeValueForColumn(column, row, rowIndex);\n formattedColumnValue = formatCell(actualColumnValue, column);\n }\n\n //check col index\n if (colIndex === that.columns.length - 1 && that._totalColWidth > container.width())\n cellStyle = 'width: ' + (column.width - 2) + 'px; text-align: ' + column.labelPosition + '; ';\n\n //set sub button\n if (colIndex === 0 && subs != null && that.behavior !== 'tabular')\n bSub = '<i class=\"pagos-grid-plus ' + that.container + '_subBtns_0 fa fa-plus\" rowindex=\"' + rowIndex + '\" colindex=\"' + colIndex + '\" depth=\"0\"></i> ';\n\n //set html\n html += '<td id=\"' + cellID + '\" title=\"' + formattedColumnValue + '\" value=\"' + actualColumnValue + '\" class=\"pagos-grid-cell pagos-grid-row-vlines ' + that.container + '_rowCol_' + colIndex + '\"';\n\n //chek whether the first index\n if (rowIndex == 0)\n html += ' style=\"' + cellStyle + '\"';\n\n //cell clas\n var cellClass = that.container + '_rowCol_' + colIndex;\n\n //set gauge\n if (column.conditionalFormat.type !== 'bars')\n cellClass += ' pagos-grid-cell-padding';\n\n //create cell\n html += '><div id=\"' + cellID + '_div\" style=\"' + cellStyle + '\" class=\"' + cellClass + '\">';\n\n //set value if values are shown\n if (!column.hideValues) {\n html += bSub + formattedColumnValue;\n } else {\n html += bSub;\n }\n\n //closure for cell\n html += '</div></td>';\n\n //return generated cell content\n return html;\n };\n\n let getSubCellContent = function (row, column, rowIndex, colIndex, depth, baseDivID) {\n //declare needed variables\n let idStart = baseDivID.startsWith(\"#\") ? baseDivID.replace(\"#\", \"\") : baseDivID,\n cellID = idStart + '_row_' + rowIndex + '_col_' + colIndex + '_depth_' + depth,\n subs = row.sub,\n subID = idStart + '_row_' + rowIndex + '_sub',\n bSub = '',\n topBorder = '',\n cellStyle = 'width: ' + column.width + 'px; text-align: ' + column.labelPosition + '; ',\n actualColumnValue = row[column.fieldName],\n formattedColumnValue = formatCell(row[column.fieldName], column),\n html = '';\n\n if (that.type === \"pivot\" && column.direction === \"data\") {\n actualColumnValue = getSummarizeValueForColumn(column, row);\n formattedColumnValue = formatCell(actualColumnValue, column);\n }\n\n //check col index\n if (colIndex === that.columns.length - 1 && that._totalColWidth > container.width())\n cellStyle = 'width: ' + (column.width - 2) + 'px; text-align: ' + column.labelPosition + '; ';\n\n //check if row index === 0 then create a top border\n if (rowIndex === 0)\n topBorder = ' border-top: 1px solid #85b9f6; '\n\n //check if first col\n if (colIndex === 0 && subs != null)\n bSub = '<i class=\"pagos-grid-plus ' + that.container + '_subBtns_' + depth + '\" sid=\"' + subID + '\" rowindex=\"' + rowIndex + '\" colindex=\"' + colIndex + '\" depth=\"' + depth + '\"></i> ';\n\n //set \n\n //create cell\n html += '<td id=\"' + cellID + '\" title=\"' + formattedColumnValue + '\" value=\"' + actualColumnValue + '\" class=\"pagos-grid-cell pagos-grid-row-vlines ' + that.container + '_rowCol_' + colIndex + '\" style=\"' + cellStyle + topBorder + '\">';\n\n //update cell style\n if (colIndex === 0)\n cellStyle += 'padding-left: ' + ((depth * 16) + 5) + 'px; padding-right: 5px';\n else\n cellStyle += 'padding-right: 5px';\n\n //cell clas\n var cellClass = that.container + '_rowCol_' + colIndex;\n\n //set gauge\n if (column.conditionalFormat.type !== 'bars')\n cellClass += ' pagos-grid-cell-padding';\n\n //set cell div\n html += '<div id=\"' + cellID + '_div\" style=\"' + cellStyle + '\" class=\"' + cellClass + '\">';\n\n //set value if values are shown\n if (!column.hideValues)\n html += bSub + formattedColumnValue;\n else\n html += bSub;\n\n //finalize html\n html += '</div></td>';\n\n //return generated cell content\n return html;\n };\n\n let formatCell = function (data, column) {\n //handle error\n if (data == null) return '';\n\n //declare variables\n let formattedValue = data,\n dateValue = null;\n\n //check column type\n if (column.columnType === 'datetime') {\n //declare default format\n let defaultFormat = column.labelFormat == '' ? '%x' : column.labelFormat;\n\n if (column.includeTime)\n defaultFormat += ' %X';\n\n formattedValue = e.formatDate(data, defaultFormat);\n } else if (column.columnType === 'numeric') {\n //create data\n formattedValue = e.formatNumber(data, column.labelFormat);\n }\n\n //handle formatted value's null values\n if (formattedValue == null || formattedValue == 'null' || formattedValue == 'nan' || formattedValue == 'NaN' || formattedValue == 'Nan' || formattedValue == NaN || formattedValue == Infinity || formattedValue == 'Infinity' || formattedValue == 'infinity')\n formattedValue = '';\n\n //return formatted value\n return formattedValue;\n };\n\n let setConditionalFormat = function (rows, depth, baseDivID) {\n //declare variables\n let cell = null,\n minMaxVals = null,\n min = 0,\n max = 0,\n ratio = 0,\n cellID = '',\n iterationColumns = null,\n value = 0,\n cond = null,\n negativeValues = {},\n positiveValues = {},\n minPositive = {}, maxPositive = {},\n minNegative = {}, maxNegative = {},\n dividerRatio = {};\n\n //clear gauges\n that._gauges.length = 0;\n\n //set min max values\n if (that.behavior === 'tabular') {\n //set columns\n iterationColumns = that.columns;\n } else {\n //arrayify iteration columns\n iterationColumns = [];\n\n //set iteration columns from rows\n getRows().forEach(function (r) {\n //push current row into the iteration columns\n iterationColumns.push(r);\n });\n\n //set iteration columns from measures\n getMeasures().forEach(function (r) {\n //push current measure into the iteration columns\n iterationColumns.push(r);\n });\n }\n\n //iterate all rows\n for (let rowIndex = 0; rowIndex < rows.length; rowIndex++) {\n //get current row\n let row = rows[rowIndex];\n\n //iterate all columns\n iterationColumns.forEach(function (column, colIndex) {\n //set condition\n cond = column.conditionalFormat;\n \n //check whether the condition is not empty\n if (cond && cond.type !== \"none\") {\n //get min max\n minMaxVals = getMinMaxValues(column.fieldName);\n min = minMaxVals.min;\n max = minMaxVals.max;\n\n //set min if null\n if (min == null || min == undefined)\n min = 0;\n\n //check whether the column has start from zero flag\n if (column.startFromZero != null && column.startFromZero === true)\n min = 0;\n\n //set min and max positives for the column\n minNegative[column.fieldName] = min < 0 ? min : 0;\n maxNegative[column.fieldName] = max >= 0 ? 0 : max;\n minPositive[column.fieldName] = min < 0 ? 0 : min;\n maxPositive[column.fieldName] = max >= 0 ? max : 0;\n\n //set cell id\n cellID = that.container + '_row_' + rowIndex + '_col_' + colIndex + '_depth_' + depth;\n\n //check if basedivid is not null\n if (baseDivID != null)\n cellID = baseDivID + '_row_' + rowIndex + '_col_' + colIndex + '_depth_' + depth;\n\n //set cell element\n if (cellID.startsWith(\"#\"))\n cell = $(cellID);\n else\n cell = $('#' + cellID);\n\n //get current value of cell\n value = parseFloat(cell.attr('value'));\n\n //set ratio\n if (min < 0) {\n ratio = ((Math.abs(value)) * 100) / (max);\n } else {\n ratio = ((Math.abs(value) - min) * 100) / (max - min);\n }\n\n //handle ratio instabilities\n if (ratio < 0) ratio = 0;\n if (ratio > 100) ratio = 100;\n if (isNaN(value)) ratio = 0;\n\n //switch condition type\n switch (cond.type) {\n case 'bars':\n {\n //declare bars variables\n let cellDiv = cell.children().first();\n let widthRange = max - min;\n let widthPercent = Math.abs(value) / widthRange * 100 - (min / widthRange * 100);\n let barWidth = column.width * widthPercent / 100;\n let cellDivHtml = '';\n let data = null;\n\n //clear cell content\n cell.css('padding', '0px 0px 0px 0px !important');\n cellDiv.css('padding', '0px 0px 0px 0px !important');\n cellDiv.css('height', '20px');\n cellDiv.css('position', 'relative');\n cellDiv.html('');\n\n //round percent\n widthPercent = Math.round(widthPercent);\n\n //do number formatting if exists\n if (column.labelFormat != '') {\n if (value == 0)\n value = '';\n else\n value = eve.formatNumber(value, column.labelFormat);\n }\n\n //set label data\n data = (isNaN(value) && column.labelFormat == '') ? '' : value;\n if (data.toString().indexOf('NaN') != -1)\n data = '';\n\n //set div html\n if (data === \"\") {\n cellDivHtml += '<div style=\"width:100%; height:20px; text-align: ' + column.labelPosition + '; position: absolute; top: 0; z-index:2; padding: 0;\" class=\"pagos-grid-cell-padding\">' + data + '</div>';\n } else {\n //if hide values flag is selected\n if (column.hideValues)\n data = '';\n\n //set div content\n cellDivHtml += '<div style=\"width:100%; height:20px; text-align: ' + column.labelPosition + '; position: absolute; padding: 0; top: 0; z-index:2;\" class=\"pagos-grid-cell-padding\">' + data + '</div>';\n\n //check whether the value is less than zero\n if (widthPercent != 0)\n cellDivHtml += '<div style=\"width:' + widthPercent + '%; height: 20px; text-align: ' + column.labelPosition + '; position: absolute; top: 0; background: ' + cond.startColor + '; padding: 0;\" class=\"pagos-grid-cell-padding\"></div>';\n\n cellDiv.html(cellDivHtml);\n }\n }\n break;\n case \"gradient\":\n {\n //declare gradient variables\n let gradient = e.gridGradient(cond.startColor, cond.endColor, ratio);\n\n //set cell value\n if (value == 0) {\n value = '';\n cell.html(value);\n }\n\n //set cell background color\n if (!isNaN(value)) {\n if (value != 0 || column.startFromZero) {\n cell.css('backgroundColor', gradient);\n }\n }\n }\n break;\n }\n \n }\n });\n }\n };\n\n let getMeasures = function () {\n //declare variables\n let measures = [];\n\n //iterate all cols\n that.columns.forEach(function (c) {\n //check behavior\n if (c.direction === 'data')\n measures.push(e.clone(c));\n });\n\n //return founded measures\n return measures;\n };\n\n let getRows = function () {\n //declare variables\n let rows = [];\n\n //iterate all cols\n that.columns.forEach(function (c) {\n //check behavior\n if (c.direction === 'row')\n rows.push(e.clone(c));\n });\n\n //return founded measures\n return rows;\n };\n\n let getColByName = function (name) {\n //declare needed variables\n let col = null;\n\n //iterate all columns\n that.columns.forEach(function (column) {\n //check if columnname matches with the given\n if (column.fieldName === name)\n col = column;\n });\n\n //return founded column\n return col;\n };\n\n let getSelectedRow = function () {\n return that._selectedRow;\n };\n\n let getColIndexByfieldName = function (fieldName) {\n //declare needed variables\n let index = -1;\n\n //iterate all columns to find index\n that.columns.forEach(function (c, i) {\n //check if current col field matches with the given\n if (c.fieldName === fieldName)\n index = i;\n });\n\n //return found index\n return index;\n };\n\n let getMinMaxValues = function (fieldName) {\n //declare needed variables\n let min = 0, max = 0;\n let rows = that._rows;\n\n //check whether the vis is grid\n if (that.behavior === \"tabular\") {\n //set min and max values\n min = parseFloat(that._minMaxValues[0][fieldName + \"_min\"]);\n max = parseFloat(that._minMaxValues[0][fieldName + \"_max\"]);\n\n //return calculated min and max\n return {\n min: min,\n max: max\n };\n }\n\n //check whether the pivot mode is classical\n if (that.pivotMode === 'classical') {\n //get row count\n let rowsArray = getRows(),\n rowNames = [];\n\n //iterate all rows\n rowsArray.forEach(function (r) {\n //push current row into the rownames\n rowNames.push(r.fieldName);\n });\n\n //iterate all rows to set max\n rows.forEach(function (row, index) {\n //check row index\n for (var key in row) {\n //check key\n if (rowNames.indexOf(key) == -1) {\n //check if current value bigger than max\n if (row[key] > max)\n max = parseFloat(row[key]);\n }\n }\n });\n\n //set min as max\n min = max;\n\n //iterate all rows to set min\n rows.forEach(function (row, index) {\n //check row index\n for (var key in row) {\n //check key\n if (rowNames.indexOf(key) == -1) {\n //check if current value bigger than max\n if (row[key] != null)\n if (row[key] < min)\n min = parseFloat(row[key]);\n }\n }\n });\n\n //return calculated min and max\n return {\n min: min,\n max: max\n };\n } else {\n //iterate all rows to set max\n rows.forEach(function (row, index) {\n //check whether the current cell is not null or undefined\n if (row[fieldName] != null && row[fieldName] != undefined && !isNaN(row[fieldName])) {\n //set max value\n if (row[fieldName] > max)\n max = parseFloat(row[fieldName]);\n }\n });\n\n //set min as max\n min = max;\n\n //iterate all rows to set min\n rows.forEach(function (row, index) {\n //check whether the current cell is not null or undefined\n if (row[fieldName] != null && row[fieldName] != undefined && !isNaN(row[fieldName])) {\n //set min value\n if (row[fieldName] < min)\n min = parseFloat(row[fieldName]);\n }\n });\n\n //return calculated min and max\n return {\n min: min,\n max: max\n };\n }\n };\n\n let getClassicalMinMaxValues = function (rows) {\n //declare needed variables\n let min = 0, max = 0;\n\n //iterate all rows\n rows.forEach(function (row, rowIndex) {\n //iterate all columns\n that.columns.forEach(function (column, colIndex) {\n //check whether the current column behavior is data\n if (column.direction === 'data') {\n //check whether the current cell value is not null or undefined\n if (row[column.fieldName] != null && row[column.fieldName] != undefined && !isNaN(row[column.fieldName])) {\n //check whether the max\n if (row[column.fieldName] > max)\n max = row[column.fieldName];\n }\n }\n });\n });\n\n //set mins\n min = max;\n\n //iterate all rows\n rows.forEach(function (row, rowIndex) {\n //iterate all columns\n that.columns.forEach(function (column, colIndex) {\n //check whether the current column behavior is data\n if (column.direction === 'data') {\n //check whether the current cell value is not null or undefined\n if (row[column.fieldName] != null && row[column.fieldName] != undefined && !isNaN(row[column.fieldName])) {\n //check whether the min\n if (row[column.fieldName] < min)\n min = row[column.fieldName];\n }\n }\n });\n });\n\n //return min max\n return {\n min: min,\n max: max\n };\n };\n\n let getSummarizeByColumn = function (colIndex) {\n //declare needed variables\n let col = that.columns[colIndex],\n valueArray = [],\n subRowsCount = 0,\n min = 0, max = 0, abs = 0, total = 0;\n\n //iterate all rows\n that._rows.forEach(function (row) {\n //get column value\n let currentValue = parseFloat(row[col.fieldName]);\n\n //check if current value is not nan\n if (!isNaN(currentValue)) {\n //push current value into stack\n valueArray.push(currentValue);\n\n //increase total value\n total += currentValue;\n }\n\n if (row[col.fieldName] != null)\n subRowsCount++;\n });\n\n //sort value array\n valueArray.sort();\n\n //switch expression\n switch (col.expression) {\n case 'count':\n abs = subRowsCount;\n case 'sum':\n abs = total;\n break;\n case 'avg':\n abs = total / subRowsCount;\n break;\n case 'min':\n abs = d3.min(valueArray);\n break;\n case 'max':\n abs = d3.max(valueArray);\n break;\n default:\n abs = total;\n break;\n }\n\n //return formatted value\n return formatCell(abs, col);\n };\n\n let getColIndexByID = function (colID) {\n //declare needed variables\n var index = -1;\n\n //iterate all columns to find index\n that.columns.forEach(function (c, i) {\n //check if current col field matches with the given\n if (c.fieldID === colID)\n index = i;\n });\n\n //return found index\n return index;\n };\n\n //attach update dataset\n this.update = function (data) {\n //handle errors\n if (data == null) return false;\n\n //declare variables\n var that = this; \n\n //switch grid behavior\n switch (that.behavior) {\n case 'tabular':\n bindGrid(data);\n break;\n case 'pivot':\n bindPivot(data);\n break;\n }\n\n //assign resizable to each cols\n $('.' + that.container + '_cols').each(function (index) {\n //attach resizable\n $(this).resizable({\n handles: 'e',\n resize: function (e, ui) {\n //declare needed variables\n var currentColField = $(this).attr('colid'),\n currentColIndex = getColIndexByID(currentColField);\n\n //update col size\n that.columns[currentColIndex].width = ui.size.width;\n\n //resize columns\n $('.' + that.container + '_rowCol_' + currentColIndex).css('width', ui.size.width + 'px');\n },\n stop: function (e, ui) {\n \n }\n });\n });\n };\n\n //check document ready\n $(document).ready(function () {\n //initialize grid\n initGrid();\n });\n }","title":""}],"string":"[\n {\n \"docid\": \"b6638c4c05344c9ed2dc062016227888\",\n \"score\": \"0.0\",\n \"text\": \"function grid(options) {\\n //declare members\\n this.behavior = \\\"tabular\\\";\\n this.container = \\\"\\\";\\n this.columns = [];\\n this.data = null;\\n this.width = \\\"auto\\\";\\n this.height = \\\"auto\\\";\\n this.pageIndex = 1;\\n this.pageSize = 100;\\n this.sortDirection = \\\"asc\\\";\\n this.sortField = \\\"\\\";\\n this.paginatorText = 'Records from {0} to {1} of total {2}';\\n this.pivotMode = \\\"tree\\\";\\n\\n //declare needed variables\\n var that = this;\\n var container = null;\\n\\n //iterate all keys in options\\n for (var key in options) {\\n that[key] = options[key];\\n }\\n\\n //handle errors\\n if (that.container === \\\"\\\")\\n return null;\\n\\n //declare internal members\\n that._totalPages = 0;\\n that._pager = null;\\n that._firstCol = null;\\n that._minMaxValues = null;\\n that._classicalMinMax = null;\\n that._rows = null;\\n that._totalRecords = null;\\n that._columnNames = [];\\n that._rowTitles = [];\\n that._rowNames = [];\\n that._dataNames = [];\\n that._totalColWidth = 0;\\n that._subBtns = null;\\n that._btns = null;\\n that._header = null;\\n that._footer = null;\\n that._rowsContainer = null;\\n that._colElements = null;\\n that._colResizers = null;\\n that._selectedRow = null;\\n that._rowElements = null;\\n that._gauges = [];\\n\\n //iterate all columns to set col specific members\\n that.columns.forEach(function (c) {\\n switch (c.direction) {\\n case \\\"column\\\":\\n {\\n that._columnNames.push(c.fieldName);\\n }\\n break;\\n case \\\"row\\\":\\n {\\n that._rowNames.push(c.fieldName);\\n that._rowTitles.push(c.columnName);\\n\\n //set first col\\n if (that._rowNames.length === 1)\\n that._firstCol = c;\\n }\\n break;\\n case \\\"data\\\":\\n {\\n that._dataNames.push(c.fieldName);\\n }\\n break;\\n default:\\n {\\n that._columnNames.push(c.fieldName);\\n }\\n break;\\n }\\n });\\n\\n //initializes the grid\\n let initGrid = function () {\\n //set document element\\n container = $('#' + that.container);\\n\\n //add pagos class into the client element\\n if (!container.hasClass('pagos-grid'))\\n container.addClass('pagos-grid');\\n\\n //declare needed variables\\n let headerHeight = 0,\\n rowsHeight = container.height() - 56,\\n footerHeight = 0,\\n headerHtml = \\\"\\\",\\n html = \\\"\\\";\\n\\n //set grid dimensio\\n container.css(\\\"width\\\", (that.width === 'auto' ? '100%' : that.width + 'px'));\\n container.css(\\\"height\\\", (that.height === 'auto' ? container.height() : that.height + 'px'));\\n\\n //check if the behavior is pivot\\n if (that.behavior === \\\"pivot\\\") {\\n //declare variables\\n let colWidth = that._firstCol.width ? that._firstCol.width : 100,\\n colAlign = that._firstCol.labelPosition === \\\"auto\\\" ? \\\"left\\\" : that._firstCol.labelPosition,\\n cellStyle = 'width: ' + colWidth + 'px;',\\n colStyle = 'width: ' + colWidth + 'px; text-align: ' + colAlign + '; height: 27px; padding-top: 5px;',\\n sortClass = '';\\n\\n //set background position\\n if (colAlign === \\\"right\\\")\\n colStyle += 'background-position: left';\\n else\\n colStyle += 'background-position: right';\\n\\n //construct column\\n headerHtml += '<td class=\\\"colContainer ' + that.container + '_rowCol_0\\\" style=\\\"' + cellStyle + '\\\">';\\n headerHtml += '<div id=\\\"' + that.container + '_col_0\\\" columnindex=\\\"0\\\" colname=\\\"' + that._firstCol.fieldName + '\\\" colid=\\\"' + that._firstCol.fieldID + '\\\" dataindex=\\\"0\\\" class=\\\"column ' + that.container + '_cols ' + sortClass + ' ' + that.container + '_rowCol_0\\\" style=\\\"' + colStyle + '\\\">';\\n headerHtml += that._rowTitles.join('-');\\n headerHtml += '</div></td>';\\n\\n //set min and max values\\n that._minMaxValues = {};\\n }\\n\\n //iterate all column\\n that.columns.forEach(function (c, i) {\\n //declare variables\\n let colWidth = c.width ? c.width : 100,\\n colAlign = c.labelPosition === \\\"auto\\\" ? \\\"left\\\" : c.labelPosition,\\n cellStyle = 'width: ' + colWidth + 'px;',\\n colStyle = 'width: ' + colWidth + 'px; text-align: ' + colAlign + '; height: 27px; padding-top: 5px;',\\n sortClass = '';\\n\\n //set sorter position\\n if (colAlign === 'right')\\n colStyle += 'background-position: left';\\n else\\n colStyle += 'background-position: right';\\n\\n //check grid behavior\\n if (that.behavior === 'tabular') {\\n //construct column\\n headerHtml += '<td class=\\\"colContainer ' + that.container + '_rowCol_' + i + '\\\" style=\\\"' + cellStyle + '\\\">';\\n headerHtml += '<div id=\\\"' + that.container + '_col_' + i + '\\\" columnindex=\\\"' + i + '\\\" colname=\\\"' + c.fieldName + '\\\" colid=\\\"' + c.fieldID + '\\\" dataindex=\\\"' + i + '\\\" class=\\\"column ' + that.container + '_cols ' + sortClass + '\\\" style=\\\"' + colStyle + '\\\">';\\n headerHtml += c.columnName;\\n headerHtml += '</div></td>';\\n } else {\\n //check column behavior\\n if (c.direction === 'data') {\\n //set min and max values\\n that._minMaxValues['min' + c.fieldName] = 0;\\n that._minMaxValues['max' + c.fieldName] = 0;\\n\\n //construct column\\n headerHtml += '<td class=\\\"colContainer ' + that.container + '_rowCol_' + i + '\\\" style=\\\"' + cellStyle + '\\\">';\\n headerHtml += '<div id=\\\"' + that.container + '_col_' + i + '\\\" columnindex=\\\"' + i + '\\\" colname=\\\"' + c.fieldName + '\\\" colid=\\\"' + c.fieldID + '\\\"dataindex=\\\"' + i + '\\\" class=\\\"column ' + that.container + '_cols ' + sortClass + '\\\" style=\\\"' + colStyle + '\\\">';\\n headerHtml += c.columnName;\\n headerHtml += '</div></td>';\\n }\\n }\\n\\n //set an empty col\\n headerHtml += '</td>';\\n\\n //check grid behaivor\\n if (that.behavior === 'tabular') {\\n //set col width\\n that._totalColWidth += c.width ? c.width : 100;\\n } else {\\n //check col behavior\\n if (c.direction === 'row' || c.direction === 'data')\\n that._totalColWidth += c.width ? c.width : 100;\\n }\\n });\\n\\n //set grid content\\n html += '<div id=\\\"' + that.container + '_hct\\\" style=\\\"width: 100%;\\\" class=\\\"pagos-grid-rail-content\\\">';\\n html += '<table id=\\\"' + that.container + '_hdr\\\" class=\\\"pagos-grid-header\\\" style=\\\"\\\" border=\\\"0\\\" cellpadding=\\\"0\\\" cellspacing=\\\"0\\\"><tr>';\\n html += headerHtml;\\n html += '</tr></table></div>';\\n html += '<div id=\\\"' + that.container + '_rows\\\" class=\\\"' + (that.behavior == 'tabular' ? 'pagos-grid-row-container' : 'pagos-pivot-row-container') + '\\\" style=\\\"width: 100%; height: ' + rowsHeight + 'px;\\\">';\\n html += '</div>';\\n\\n //create footer\\n if (that.behavior === 'tabular') {\\n //set grid footer content\\n html += '<table id=\\\"' + that.container + '_ft\\\" class=\\\"pagos-grid-footer\\\" style=\\\"min-width: 100%;\\\"><tr><td>';\\n html += '<div id=\\\"' + that.container + '_first\\\" class=\\\"pagos-grid-button pagos-grid-button-first\\\"><i class=\\\"fa fa-fast-backward\\\"></i></div>';\\n html += '<div id=\\\"' + that.container + '_prev\\\" class=\\\"pagos-grid-button pagos-grid-button-prev\\\"><i class=\\\"fa fa-backward\\\"></i></div>';\\n html += '<div id=\\\"' + that.container + '_navText\\\" class=\\\"pagos-grid-footer-layer\\\">' + that.paginatorText + '</div>';\\n html += '<div id=\\\"' + that.container + '_next\\\" class=\\\"pagos-grid-button pagos-grid-button-next\\\"><i class=\\\"fa fa-forward\\\"></i></div>';\\n html += '<div id=\\\"' + that.container + '_last\\\" class=\\\"pagos-grid-button pagos-grid-button-last\\\"><i class=\\\"fa fa-fast-forward\\\"></i></div>';\\n html += '<div id=\\\"grid_footer_layer\\\" class=\\\"pagos-grid-footer-layer\\\">Jump to page: <input id=\\\"' + that.container + '_pager\\\" type=\\\"text\\\" style=\\\"text-align: center; padding-left: 0px; width: 50px;\\\" /></div>';\\n html += '</td></tr></table>';\\n } else {\\n //check whether the sub totals are visible\\n if (that.showSubTotals) {\\n //set pivot footer content\\n let colWidth = that._firstCol.width ? that._firstCol.width : 100;\\n html += '<div id=\\\"' + that.container + '_fct\\\" class=\\\"pagos-grid-rail-content\\\" style=\\\"width: 100%;\\\">';\\n html += '<table id=\\\"' + that.container + '_ft\\\" class=\\\"pagos-grid-subtotal\\\" border=\\\"0\\\" cellpadding=\\\"0\\\" cellspacing=\\\"0\\\"><tr>';\\n html += '<td class=\\\"pagos-grid-subtotal-cell-container ' + that.container + '_rowCol_0\\\" style=\\\"width: ' + colWidth + 'px;\\\">';\\n html += '<div id=\\\"' + that.container + '_subTotal_0\\\" class=\\\"pagos-grid-subtotal-cell ' + that.container + '_rowCol_0\\\" style=\\\"width: ' + colWidth + 'px;\\\">Grand Total</div></td>';\\n\\n //Iterate all data columns\\n that.columns.forEach(function (column, columnIndex) {\\n //check if the column is data\\n if (column.direction === 'data') {\\n let colDataWidth = column.width ? column.width : 100;\\n html += '<td class=\\\"pagos-grid-subtotal-cell-container ' + that.container + '_rowCol_' + columnIndex + '\\\" style=\\\"width: ' + colDataWidth + 'px;\\\">';\\n html += '<div id=\\\"' + that.container + '_subTotal_' + columnIndex + '\\\" class=\\\"pagos-grid-subtotal-cell ' + that.container + '_rowCol_' + columnIndex + '\\\" style=\\\"width: ' + colDataWidth + 'px;\\\">0</div></td>';\\n }\\n });\\n\\n //set empty col\\n html += '</td>';\\n\\n //closure for pivot footer\\n html += '</tr></table></div>';\\n }\\n }\\n\\n //append the content\\n container.html(html);\\n\\n //set footer events\\n if (that.behavior === 'tabular') {\\n //Set buttons\\n $('#' + that.container + '_first').on(\\\"click\\\", function () {\\n //check if first page\\n if (that.pageIndex == 1)\\n return;\\n\\n //set page index\\n that.pageIndex = 1;\\n\\n //update footer\\n setFooter();\\n\\n //raise page changed event\\n if (that.onPageChanged)\\n that.onPageChanged(that.pageIndex);\\n });\\n\\n $('#' + that.container + '_prev').on(\\\"click\\\", function () {\\n //check if first page\\n if (that.pageIndex == 1)\\n return;\\n\\n //set page index\\n that.pageIndex -= 1;\\n\\n //update footer\\n setFooter();\\n\\n //raise page changed event\\n if (that.onPageChanged)\\n that.onPageChanged(that.pageIndex);\\n });\\n\\n $('#' + that.container + '_next').on(\\\"click\\\", function () {\\n //check if last page\\n if (that.pageIndex == that._totalPages)\\n return;\\n\\n //set page index\\n that.pageIndex += 1;\\n\\n //update footer\\n setFooter();\\n\\n //raise page changed event\\n if (that.onPageChanged)\\n that.onPageChanged(that.pageIndex);\\n });\\n\\n $('#' + that.container + '_last').on(\\\"click\\\", function () {\\n //check if last page\\n if (that.pageIndex == that._totalPages)\\n return;\\n\\n //set page index\\n that.pageIndex = that._totalPages;\\n\\n //update footer\\n setFooter();\\n\\n //raise page changed event\\n if (that.onPageChanged)\\n that.onPageChanged(that.pageIndex);\\n });\\n\\n //set pager textbox\\n that._pager = $(\\\"#\\\" + that.container + \\\"_pager\\\");\\n that._pager.on(\\\"change\\\", function () {\\n let enteredPageIndex = parseInt(that._pager.val());\\n if (isNaN(enteredPageIndex))\\n return false;\\n\\n //handle min\\n if (enteredPageIndex < 1)\\n if (that.pageIndex === 1) {\\n that._pager.val(1);\\n return;\\n }\\n else\\n enteredPageIndex = 1;\\n\\n //handle min\\n if (enteredPageIndex > that._totalPages)\\n if (that.pageIndex === that._totalPages) {\\n that._pager.val(that._totalPages);\\n return;\\n }\\n else\\n enteredPageIndex = that._totalPages;\\n\\n //set page index\\n that.pageIndex = enteredPageIndex;\\n\\n //update footer\\n setFooter();\\n\\n //raise page changed event\\n if (that.onPageChanged)\\n that.onPageChanged(that.pageIndex);\\n\\n });\\n\\n //set pager content\\n that._pager.val(that.pageIndex.toString());\\n }\\n\\n //get columns\\n that._header = $('#' + that.container + '_hdr');\\n that._footer = $('#' + that.container + '_ft');\\n that._colElements = $('.' + that.container + '_cols');\\n that._rowsContainer = $('#' + that.container + '_rows');\\n\\n //check if col elements is not null\\n if (that._colElements != null && that._colElements.length) {\\n //set column click event\\n that._colElements.on(\\\"click\\\", function () {\\n //get colindex and dataindex\\n let colIndex = parseInt($(this).attr('columnindex'));\\n let dataIndex = parseInt($(this).attr('dataindex'));\\n\\n //set sorter\\n setSorter(colIndex, dataIndex);\\n });\\n }\\n\\n //check if rows container is not null\\n if (that._rowsContainer != null && that._rowsContainer.length) {\\n //set scroll event for rows container\\n that._rowsContainer.scroll(function () {\\n let scrollArea = $(this);\\n let leftPos = scrollArea.scrollLeft();\\n let maxLeft = scrollArea[0].scrollWidth - scrollArea[0].clientWidth;\\n let lastSubTotalCol = $('#' + that.container + '_subTotal_' + (that.columns.length - 1));\\n let hct = $('#' + that.container + '_hct');\\n let fct = $('#' + that.container + '_fct');\\n\\n //check header container\\n if (hct != null && hct.length)\\n hct.scrollLeft(leftPos);\\n\\n //check footer container\\n if (fct != null && fct.length)\\n fct.scrollLeft(leftPos);\\n \\n });\\n }\\n\\n //check if grid has data\\n if (that.data != null)\\n bindData(that.data);\\n };\\n\\n //sets footer\\n let setFooter = function () {\\n //declare variables\\n var navText = that.paginatorText,\\n rangeMin = ((that.pageIndex - 1) * that.pageSize) + 1,\\n rangeMax = rangeMin + that.pageSize - 1,\\n nText = $('#' + that.container + '_navText');\\n\\n //set range max\\n if (rangeMax > that._totalRecords)\\n rangeMax = that._totalRecords;\\n\\n //set total pages\\n that._totalPages = Math.ceil(that._totalRecords / that.pageSize);\\n\\n //set navigator text\\n navText = navText.replace('{0}', rangeMin.group('.', ',', 0));\\n navText = navText.replace('{1}', rangeMax.group('.', ',', 0));\\n navText = navText.replace('{2}', that._totalRecords);\\n\\n //set text content in navigator\\n if (nText != null)\\n nText.html(navText);\\n\\n //set pager text\\n if (that._pager != null)\\n that._pager.val(that.pageIndex);\\n };\\n\\n //sets sorter \\n let setSorter = function (colIndex, dataIndex) {\\n //declare variables\\n var col = $('#' + that.container + '_col_' + colIndex),\\n column = that.columns[dataIndex],\\n sortClass = that.sortDirection === 'desc' ? 'pagos-grid-sorter-desc' : 'pagos-grid-sorter-asc';\\n\\n //check if col elements is not null\\n if (that._colElements != null) {\\n //clear sorters\\n that._colElements.removeClass('pagos-grid-sorter-asc');\\n that._colElements.removeClass('pagos-grid-sorter-desc');\\n }\\n\\n //check if sorter field is changed\\n if (that.sortField != column.fieldName) {\\n that.sortDirection = 'asc';\\n sortClass = 'pagos-grid-sorter-asc';\\n }\\n\\n if (typeof isSinglePostPage != 'undefined') {\\n\\n var fieldName = column.fieldName;\\n var dataType = column.columnType;\\n\\n that._rows = that._rows.sort(function (a, b) {\\n switch (dataType) {\\n case 'numeric':\\n {\\n //get field values\\n var aValue = parseFloat(a[fieldName]);\\n var bValue = parseFloat(b[fieldName]);\\n\\n if (isNaN(aValue))\\n aValue = 0;\\n\\n if (isNaN(bValue))\\n bValue = 0;\\n\\n if (that.sortDirection === 'asc') {\\n return aValue - bValue;\\n } else {\\n return bValue - aValue;\\n }\\n }\\n case 'datetime':\\n {\\n //get field values\\n if (that.sortDirection === 'asc') {\\n return (new Date(a[fieldName]) > new Date(b[fieldName])) ? 1 : ((new Date(a[fieldName]) < new Date(b[fieldName])) ? -1 : 0);\\n } else {\\n return (new Date(b[fieldName]) > new Date(a[fieldName])) ? 1 : ((new Date(b[fieldName]) < new Date(a[fieldName])) ? -1 : 0);\\n }\\n }\\n default:\\n {\\n if (that.sortDirection === 'asc') {\\n return (a[fieldName] > b[fieldName]) ? 1 : ((a[fieldName] < b[fieldName]) ? -1 : 0);\\n } else {\\n return (b[fieldName] > a[fieldName]) ? 1 : ((b[fieldName] < a[fieldName]) ? -1 : 0);\\n }\\n }\\n }\\n });\\n\\n that.bind(that.data);\\n\\n //update sort direction\\n that.sortDirection = that.sortDirection === 'asc' ? 'desc' : 'asc';\\n }\\n\\n //set sort field\\n that.sortField = column.fieldName;\\n that.sortFieldID = column.fieldID;\\n\\n //check if col element is not null\\n if (col != null) {\\n //add sort class\\n col.addClass(sortClass);\\n\\n //set sorter position\\n if (column.labelPosition === 'right')\\n col.css('backgroundPosition', 'left');\\n else\\n col.css('backgroundPosition', 'right');\\n }\\n\\n //set page index and paginator\\n /*if (that.behavior === 'tabular') {\\n //set pae index\\n that.pageIndex = 1;\\n\\n //set footer\\n setFooter();\\n }*/\\n\\n //raise on before sort\\n if (that.onSort) {\\n that.onSort(that.sortField, that.sortFieldID, that.sortDirection === 'asc' ? 'desc' : 'asc');\\n\\n //update sort direction\\n that.sortDirection = that.sortDirection === 'asc' ? 'desc' : 'asc';\\n }\\n\\n };\\n\\n //binds data for the grid\\n let bindData = function () {\\n //switch grid behavior\\n switch (that.behavior) {\\n case 'tabular':\\n bindGrid(that.data);\\n break;\\n case 'pivot':\\n bindPivot(that.data);\\n break;\\n }\\n\\n //assign resizable to each cols\\n $('.' + that.container + '_cols').each(function (index) {\\n //attach resizable\\n $(this).resizable({\\n handles: 'e',\\n resize: function (e, ui) {\\n //declare needed variables\\n let currentColField = $(this).attr('colid');\\n let currentColIndex = getColIndexByID(currentColField);\\n\\n //update col size\\n that.columns[currentColIndex].width = ui.size.width;\\n\\n //resize columns\\n $('.' + that.container + '_rowCol_' + currentColIndex).css('width', ui.size.width + 'px');\\n\\n //raise callback\\n if (that.onColumnResize)\\n that.onColumnResize(currentColField, currentColIndex, ui.size.width);\\n },\\n stop: function (e, ui) {\\n\\n }\\n });\\n });\\n };\\n\\n //binds grid dataset\\n let bindGrid = function (data) {\\n //declare variables\\n let html = '';\\n\\n //set rows, minmax and total records\\n that._rows = data.rows;\\n that._totalRecords = data.totalRecords;\\n that._minMaxValues = data.minMaxValues;\\n\\n //get length\\n let rowsContainerHeight = parseInt(that._rowsContainer.css('height'));\\n let rowLimit = Math.floor(rowsContainerHeight / 20);\\n\\n //iterate all rows\\n that._rows.forEach(function (row, rowIndex) {\\n //hide class for screenshots\\n let hideClassForScreenshot = '';\\n\\n //check row index to set screenshot class\\n if (rowIndex >= rowLimit)\\n hideClassForScreenshot = ' pagos-grid-last2';\\n\\n //build html\\n html += '<tr id=\\\"' + that.container + '_row_' + rowIndex + '\\\" class=\\\"pagos-grid-row pagos-grid-row-hlines ' + that.container + '_rows ' + hideClassForScreenshot + '\\\">';\\n\\n //iterate all columns\\n that.columns.forEach(function (column, colIndex) {\\n //check if the column behavior is column\\n html += getCellContent(row, column, rowIndex, colIndex, 0);\\n });\\n\\n //closure for row html\\n html += '</tr>';\\n });\\n\\n //append rows html\\n that._rowsContainer.html('<table cellpadding=\\\"0\\\" cellspacing=\\\"0\\\">' + html + '</table>');\\n that._rowElements = $('.' + that.container + '_rows');\\n\\n //check if row elements is not null\\n if (that._rowElements.length) {\\n //set rows click event\\n that._rowElements.on(\\\"click\\\", function (index) {\\n //declare variables\\n var item = $(this);\\n\\n //remove selected class from all rows\\n that._rowElements.removeClass('pagos-grid-row-selected');\\n\\n //add current item seleted class\\n item.addClass('pagos-grid-row-selected');\\n\\n //set selected row\\n that._selectedRow = that._rows[index];\\n\\n //raise row selected event\\n if (that.onRowSelected)\\n that.onRowSelected(that._selectedRow);\\n });\\n }\\n\\n //set conditional formatting\\n setConditionalFormat(that._rows, 0);\\n\\n //check if the page index = 1\\n if (that.pageIndex === 1) {\\n //set footer content\\n setFooter();\\n\\n\\n }\\n };\\n\\n //binds pivot dataset\\n let bindPivot = function (data) {\\n //declare needed variables\\n var rowID = '',\\n subID = '',\\n subDiv = null,\\n rowIndex = 0,\\n subTotalCell = null,\\n subTotalValue = '',\\n html = '';\\n\\n //set rows\\n that._rows = data.rows;\\n\\n //iterate all rows\\n that._rows.forEach(function (row, index) {\\n //set row and sub id\\n rowID = that.container + '_row_' + index;\\n subID = rowID + '_sub';\\n\\n //build html\\n html += '<tr id=\\\"' + rowID + '\\\" class=\\\"pagos-grid-row pagos-grid-row-hlines ' + that.container + '_rows\\\">';\\n\\n //set first row\\n html += getCellContent(row, that._firstCol, index, 0, 0);\\n\\n //iterate all columns\\n that.columns.forEach(function (column) {\\n //check if the current column has a data behavior\\n if (column.direction === 'data') {\\n //increase col index\\n var colIndex = getColIndexByfieldName(column.fieldName);\\n\\n //set cell\\n html += getCellContent(row, column, index, colIndex, 0);\\n\\n //set min col value\\n if (row[column.fieldName] < that._minMaxValues['min' + column.fieldName])\\n that._minMaxValues['min' + column.fieldName] = row[column.fieldName];\\n\\n //set max col value\\n if (row[column.fieldName] > that._minMaxValues['max' + column.fieldName])\\n that._minMaxValues['max' + column.fieldName] = row[column.fieldName];\\n }\\n });\\n\\n //closure for row\\n html += '</tr>';\\n\\n //add sub row container\\n html += '<tr id=\\\"' + subID + '\\\" class=\\\"pagos-grid-sub-row-container\\\"><td colspan=\\\"' + (that.columns.length - 1) + '\\\"></td></tr>';\\n });\\n\\n //append rows html\\n that._rowsContainer.html('<table cellpadding=\\\"0\\\" cellspacing=\\\"0\\\">' + html + '</table>');\\n that._rowElements = $('.' + that.container + '_rows');\\n\\n //check if row elements is not null\\n if (that._rowElements.length) {\\n //set rows click event\\n that._rowElements.on(\\\"click\\\", function (index) {\\n //declare variables\\n var item = $(this);\\n\\n //remove selected class from all rows\\n that._rowElements.removeClass('pagos-grid-row-selected');\\n\\n //add current item seleted class\\n item.addClass('pagos-grid-row-selected');\\n\\n //set selected row\\n that._selectedRow = that._rows[index];\\n\\n //raise row selected event\\n if (that.onRowSelected)\\n that.onRowSelected(that._selectedRow);\\n });\\n }\\n\\n //set sub buttons click event\\n that._subBtns = $('.' + that.container + '_subBtns_0');\\n\\n //check if sub buttons is not null\\n if (that._subBtns.length) {\\n //attach click event\\n that._subBtns.on(\\\"click\\\", function (index) {\\n var item = $(this);\\n rowIndex = parseInt(item.attr('rowindex'));\\n\\n //declare variables\\n var subDivID = '#' + that.container + '_row_' + rowIndex + '_sub';\\n\\n //get sub content div\\n subDiv = $(subDivID);\\n\\n //set sub button class\\n if (item.hasClass('pagos-grid-minus'))\\n item.removeClass('pagos-grid-minus');\\n else\\n item.addClass('pagos-grid-minus');\\n\\n //hide all subs\\n $('.pagos-grid-sub-row-container').css(\\\"display\\\", \\\"none\\\");\\n\\n //check if expanded\\n if (item.hasClass('pagos-grid-minus')) {\\n //set sub div style\\n subDiv.css('display', 'table-row');\\n\\n //build sub rows\\n buildSubRows(subDiv, subDivID, that._rows[rowIndex], 0);\\n } else {\\n //set sub div style\\n subDiv.css('display', 'none');\\n }\\n });\\n }\\n\\n //check if sub totals are visible\\n if (that.showSubTotals) {\\n //iterate all columns\\n that.columns.forEach(function (column) {\\n //check if col behavior is data\\n if (column.direction === 'data') {\\n //get column index\\n let columnIndex = getColIndexByfieldName(column.fieldName);\\n\\n //get subtotal cell\\n subTotalCell = $('#' + that.container + '_subTotal_' + columnIndex);\\n\\n //get summarize value\\n subTotalValue = getSummarizeByColumn(columnIndex);\\n\\n //check if sub total cell is not null\\n if (subTotalCell != null) {\\n //set sub total cell\\n subTotalCell.html(subTotalValue);\\n\\n //attach title value\\n subTotalCell.attr('title', subTotalValue);\\n }\\n }\\n });\\n }\\n\\n //check whether the pivot mode is classical\\n if (that.pivotMode === 'classical')\\n that._classicalMinMax = getClassicalMinMaxValues(that._rows);\\n\\n //set conditional format\\n setConditionalFormat(that._rows, 0);\\n };\\n\\n let buildSubRows = function (div, divID, row, depth) {\\n //declare variables\\n var increasedDepth = depth + 1,\\n html = '',\\n firstCol = null,\\n subRowElements = null,\\n subBtns = null,\\n subID = '',\\n subDiv = null,\\n rowIndex = 0,\\n subs = row.sub;\\n\\n //check whether the rows has sub\\n if (subs != null && subs.length > 0) {\\n //get first col\\n firstCol = getColByName(that._rowNames[increasedDepth]);\\n firstCol.width = getColByName(that._rowNames[0]).width;\\n\\n //iterate all sub rows\\n subs.forEach(function (row, index) {\\n //set sub cell id\\n subID = divID + '_row_' + index + '_sub';\\n\\n //build html\\n html += '<tr id=\\\"' + that.container + '_subs_' + increasedDepth + '\\\" class=\\\"pagos-grid-sub-row ' + that.container + '_subRows_' + increasedDepth + '\\\">';\\n html += getSubCellContent(row, firstCol, index, 0, (depth + 1), divID);\\n\\n //iterate all columns\\n that.columns.forEach(function (column) {\\n //check whether the col behavior is data\\n if (column.direction === 'data') {\\n //increase col index\\n var colIndex = getColIndexByID(column.fieldID);\\n\\n //get cell html\\n html += getSubCellContent(row, column, index, colIndex, (depth + 0), divID);\\n\\n //set min value\\n if (row[column.fieldName] < that._minMaxValues['min' + column.fieldName])\\n that._minMaxValues['min' + column.fieldName] = row[column.fieldName];\\n\\n //set max value\\n if (row[column.fieldName] > that._minMaxValues['max' + column.fieldName])\\n that._minMaxValues['max' + column.fieldName] = row[column.fieldName];\\n }\\n });\\n\\n //closure for row\\n html += '</tr>';\\n html += '<tr id=\\\"' + subID + '\\\" class=\\\"pagos-grid-sub-row-container\\\"><td colspan=\\\"' + (that.columns.length - 1) + '\\\"></td></tr>';\\n });\\n }\\n\\n //set sub content\\n div.children().first().html('<table border=\\\"0\\\" cellpadding=\\\"0\\\" cellspacing=\\\"0\\\">' + html + '</table>');\\n\\n //set sub row elements\\n subRowElements = $('.' + that.container + '_subRows_' + increasedDepth);\\n\\n //check if sub row eelemnts is not null\\n if (subRowElements.length) {\\n //set click event\\n subRowElements.on(\\\"click\\\", function (index) {\\n //get item\\n var item = $(this);\\n\\n //remove selected class\\n subRowElements.removeClass('pagos-grid-row-selected');\\n\\n //add selected class\\n item.addClass('pagos-grid-row-selected');\\n });\\n }\\n\\n //get sub buttons\\n subBtns = $('.' + that.container + '_subBtns_' + increasedDepth);\\n\\n //check if subButtons are not null\\n if (subBtns.length) {\\n //attach click event to sub buttons\\n subBtns.on(\\\"click\\\", function (index) {\\n //get item\\n var item = $(this);\\n\\n //set row index\\n rowIndex = parseInt(item.attr('rowindex'));\\n\\n //get sub content div\\n subDiv = $('#' + that.container + '_row_' + rowIndex + '_sub');\\n\\n //set sub button class\\n if (item.hasClass('pagos-grid-minus'))\\n item.removeClass('pagos-grid-minus');\\n else\\n item.addClass('pagos-grid-minus');\\n\\n //check if expanded\\n if (item.hasClass('pagos-grid-minus')) {\\n //show subs\\n subDiv.css('display', 'table-row');\\n\\n //build sub rows\\n buildSubRows(subDiv, '#' + that.container + '_row_' + rowIndex + '_sub', subs[rowIndex], increasedDepth);\\n } else {\\n //hide subs\\n subDiv.css('display', 'none');\\n }\\n });\\n }\\n\\n //set conditional format\\n setConditionalFormat(subs, depth, divID);\\n };\\n\\n let getSummarizeValueForColumn = function (column, row, rowIndex) {\\n let abs = row[column.fieldName];\\n\\n //gets count of the rows\\n let getSubRowCount = function () {\\n let cnt = 0;\\n row.sub.forEach(function (d) {\\n if (d[column.fieldName] != null)\\n cnt++;\\n });\\n return cnt;\\n };\\n\\n if (row.sub && row.sub.length) {\\n let totalValue = d3.sum(row.sub, function (d) { return d[column.fieldName]; });\\n let subRowsCount = getSubRowCount();\\n\\n //switch expression\\n switch (column.expression) {\\n case 'count':\\n abs = subRowsCount;\\n case 'sum':\\n abs = totalValue;\\n break;\\n case 'avg':\\n {\\n abs = totalValue / subRowsCount;\\n }\\n break;\\n case 'min':\\n abs = d3.min(row.sub, function (d) { return d[column.fieldName]; });\\n break;\\n case 'max':\\n abs = d3.max(row.sub, function (d) { return d[column.fieldName]; });\\n break;\\n default:\\n abs = totalValue;\\n break;\\n }\\n }\\n\\n\\n return abs;\\n }\\n\\n let getCellContent = function (row, column, rowIndex, colIndex, depth) {\\n //declare variables\\n let html = '',\\n cellID = that.container + '_row_' + rowIndex + '_col_' + colIndex + '_depth_' + depth,\\n subs = row['sub'],\\n bSub = '',\\n actualColumnValue = row[column.fieldName],\\n formattedColumnValue = formatCell(row[column.fieldName], column),\\n cellStyle = 'width: ' + column.width + 'px; text-align: ' + column.labelPosition + '; ';\\n\\n if (that.type === \\\"pivot\\\" && column.direction === \\\"data\\\") {\\n actualColumnValue = column.expression === \\\"avg\\\" ? +row[column.fieldName] : getSummarizeValueForColumn(column, row, rowIndex);\\n formattedColumnValue = formatCell(actualColumnValue, column);\\n }\\n\\n //check col index\\n if (colIndex === that.columns.length - 1 && that._totalColWidth > container.width())\\n cellStyle = 'width: ' + (column.width - 2) + 'px; text-align: ' + column.labelPosition + '; ';\\n\\n //set sub button\\n if (colIndex === 0 && subs != null && that.behavior !== 'tabular')\\n bSub = '<i class=\\\"pagos-grid-plus ' + that.container + '_subBtns_0 fa fa-plus\\\" rowindex=\\\"' + rowIndex + '\\\" colindex=\\\"' + colIndex + '\\\" depth=\\\"0\\\"></i> ';\\n\\n //set html\\n html += '<td id=\\\"' + cellID + '\\\" title=\\\"' + formattedColumnValue + '\\\" value=\\\"' + actualColumnValue + '\\\" class=\\\"pagos-grid-cell pagos-grid-row-vlines ' + that.container + '_rowCol_' + colIndex + '\\\"';\\n\\n //chek whether the first index\\n if (rowIndex == 0)\\n html += ' style=\\\"' + cellStyle + '\\\"';\\n\\n //cell clas\\n var cellClass = that.container + '_rowCol_' + colIndex;\\n\\n //set gauge\\n if (column.conditionalFormat.type !== 'bars')\\n cellClass += ' pagos-grid-cell-padding';\\n\\n //create cell\\n html += '><div id=\\\"' + cellID + '_div\\\" style=\\\"' + cellStyle + '\\\" class=\\\"' + cellClass + '\\\">';\\n\\n //set value if values are shown\\n if (!column.hideValues) {\\n html += bSub + formattedColumnValue;\\n } else {\\n html += bSub;\\n }\\n\\n //closure for cell\\n html += '</div></td>';\\n\\n //return generated cell content\\n return html;\\n };\\n\\n let getSubCellContent = function (row, column, rowIndex, colIndex, depth, baseDivID) {\\n //declare needed variables\\n let idStart = baseDivID.startsWith(\\\"#\\\") ? baseDivID.replace(\\\"#\\\", \\\"\\\") : baseDivID,\\n cellID = idStart + '_row_' + rowIndex + '_col_' + colIndex + '_depth_' + depth,\\n subs = row.sub,\\n subID = idStart + '_row_' + rowIndex + '_sub',\\n bSub = '',\\n topBorder = '',\\n cellStyle = 'width: ' + column.width + 'px; text-align: ' + column.labelPosition + '; ',\\n actualColumnValue = row[column.fieldName],\\n formattedColumnValue = formatCell(row[column.fieldName], column),\\n html = '';\\n\\n if (that.type === \\\"pivot\\\" && column.direction === \\\"data\\\") {\\n actualColumnValue = getSummarizeValueForColumn(column, row);\\n formattedColumnValue = formatCell(actualColumnValue, column);\\n }\\n\\n //check col index\\n if (colIndex === that.columns.length - 1 && that._totalColWidth > container.width())\\n cellStyle = 'width: ' + (column.width - 2) + 'px; text-align: ' + column.labelPosition + '; ';\\n\\n //check if row index === 0 then create a top border\\n if (rowIndex === 0)\\n topBorder = ' border-top: 1px solid #85b9f6; '\\n\\n //check if first col\\n if (colIndex === 0 && subs != null)\\n bSub = '<i class=\\\"pagos-grid-plus ' + that.container + '_subBtns_' + depth + '\\\" sid=\\\"' + subID + '\\\" rowindex=\\\"' + rowIndex + '\\\" colindex=\\\"' + colIndex + '\\\" depth=\\\"' + depth + '\\\"></i> ';\\n\\n //set \\n\\n //create cell\\n html += '<td id=\\\"' + cellID + '\\\" title=\\\"' + formattedColumnValue + '\\\" value=\\\"' + actualColumnValue + '\\\" class=\\\"pagos-grid-cell pagos-grid-row-vlines ' + that.container + '_rowCol_' + colIndex + '\\\" style=\\\"' + cellStyle + topBorder + '\\\">';\\n\\n //update cell style\\n if (colIndex === 0)\\n cellStyle += 'padding-left: ' + ((depth * 16) + 5) + 'px; padding-right: 5px';\\n else\\n cellStyle += 'padding-right: 5px';\\n\\n //cell clas\\n var cellClass = that.container + '_rowCol_' + colIndex;\\n\\n //set gauge\\n if (column.conditionalFormat.type !== 'bars')\\n cellClass += ' pagos-grid-cell-padding';\\n\\n //set cell div\\n html += '<div id=\\\"' + cellID + '_div\\\" style=\\\"' + cellStyle + '\\\" class=\\\"' + cellClass + '\\\">';\\n\\n //set value if values are shown\\n if (!column.hideValues)\\n html += bSub + formattedColumnValue;\\n else\\n html += bSub;\\n\\n //finalize html\\n html += '</div></td>';\\n\\n //return generated cell content\\n return html;\\n };\\n\\n let formatCell = function (data, column) {\\n //handle error\\n if (data == null) return '';\\n\\n //declare variables\\n let formattedValue = data,\\n dateValue = null;\\n\\n //check column type\\n if (column.columnType === 'datetime') {\\n //declare default format\\n let defaultFormat = column.labelFormat == '' ? '%x' : column.labelFormat;\\n\\n if (column.includeTime)\\n defaultFormat += ' %X';\\n\\n formattedValue = e.formatDate(data, defaultFormat);\\n } else if (column.columnType === 'numeric') {\\n //create data\\n formattedValue = e.formatNumber(data, column.labelFormat);\\n }\\n\\n //handle formatted value's null values\\n if (formattedValue == null || formattedValue == 'null' || formattedValue == 'nan' || formattedValue == 'NaN' || formattedValue == 'Nan' || formattedValue == NaN || formattedValue == Infinity || formattedValue == 'Infinity' || formattedValue == 'infinity')\\n formattedValue = '';\\n\\n //return formatted value\\n return formattedValue;\\n };\\n\\n let setConditionalFormat = function (rows, depth, baseDivID) {\\n //declare variables\\n let cell = null,\\n minMaxVals = null,\\n min = 0,\\n max = 0,\\n ratio = 0,\\n cellID = '',\\n iterationColumns = null,\\n value = 0,\\n cond = null,\\n negativeValues = {},\\n positiveValues = {},\\n minPositive = {}, maxPositive = {},\\n minNegative = {}, maxNegative = {},\\n dividerRatio = {};\\n\\n //clear gauges\\n that._gauges.length = 0;\\n\\n //set min max values\\n if (that.behavior === 'tabular') {\\n //set columns\\n iterationColumns = that.columns;\\n } else {\\n //arrayify iteration columns\\n iterationColumns = [];\\n\\n //set iteration columns from rows\\n getRows().forEach(function (r) {\\n //push current row into the iteration columns\\n iterationColumns.push(r);\\n });\\n\\n //set iteration columns from measures\\n getMeasures().forEach(function (r) {\\n //push current measure into the iteration columns\\n iterationColumns.push(r);\\n });\\n }\\n\\n //iterate all rows\\n for (let rowIndex = 0; rowIndex < rows.length; rowIndex++) {\\n //get current row\\n let row = rows[rowIndex];\\n\\n //iterate all columns\\n iterationColumns.forEach(function (column, colIndex) {\\n //set condition\\n cond = column.conditionalFormat;\\n \\n //check whether the condition is not empty\\n if (cond && cond.type !== \\\"none\\\") {\\n //get min max\\n minMaxVals = getMinMaxValues(column.fieldName);\\n min = minMaxVals.min;\\n max = minMaxVals.max;\\n\\n //set min if null\\n if (min == null || min == undefined)\\n min = 0;\\n\\n //check whether the column has start from zero flag\\n if (column.startFromZero != null && column.startFromZero === true)\\n min = 0;\\n\\n //set min and max positives for the column\\n minNegative[column.fieldName] = min < 0 ? min : 0;\\n maxNegative[column.fieldName] = max >= 0 ? 0 : max;\\n minPositive[column.fieldName] = min < 0 ? 0 : min;\\n maxPositive[column.fieldName] = max >= 0 ? max : 0;\\n\\n //set cell id\\n cellID = that.container + '_row_' + rowIndex + '_col_' + colIndex + '_depth_' + depth;\\n\\n //check if basedivid is not null\\n if (baseDivID != null)\\n cellID = baseDivID + '_row_' + rowIndex + '_col_' + colIndex + '_depth_' + depth;\\n\\n //set cell element\\n if (cellID.startsWith(\\\"#\\\"))\\n cell = $(cellID);\\n else\\n cell = $('#' + cellID);\\n\\n //get current value of cell\\n value = parseFloat(cell.attr('value'));\\n\\n //set ratio\\n if (min < 0) {\\n ratio = ((Math.abs(value)) * 100) / (max);\\n } else {\\n ratio = ((Math.abs(value) - min) * 100) / (max - min);\\n }\\n\\n //handle ratio instabilities\\n if (ratio < 0) ratio = 0;\\n if (ratio > 100) ratio = 100;\\n if (isNaN(value)) ratio = 0;\\n\\n //switch condition type\\n switch (cond.type) {\\n case 'bars':\\n {\\n //declare bars variables\\n let cellDiv = cell.children().first();\\n let widthRange = max - min;\\n let widthPercent = Math.abs(value) / widthRange * 100 - (min / widthRange * 100);\\n let barWidth = column.width * widthPercent / 100;\\n let cellDivHtml = '';\\n let data = null;\\n\\n //clear cell content\\n cell.css('padding', '0px 0px 0px 0px !important');\\n cellDiv.css('padding', '0px 0px 0px 0px !important');\\n cellDiv.css('height', '20px');\\n cellDiv.css('position', 'relative');\\n cellDiv.html('');\\n\\n //round percent\\n widthPercent = Math.round(widthPercent);\\n\\n //do number formatting if exists\\n if (column.labelFormat != '') {\\n if (value == 0)\\n value = '';\\n else\\n value = eve.formatNumber(value, column.labelFormat);\\n }\\n\\n //set label data\\n data = (isNaN(value) && column.labelFormat == '') ? '' : value;\\n if (data.toString().indexOf('NaN') != -1)\\n data = '';\\n\\n //set div html\\n if (data === \\\"\\\") {\\n cellDivHtml += '<div style=\\\"width:100%; height:20px; text-align: ' + column.labelPosition + '; position: absolute; top: 0; z-index:2; padding: 0;\\\" class=\\\"pagos-grid-cell-padding\\\">' + data + '</div>';\\n } else {\\n //if hide values flag is selected\\n if (column.hideValues)\\n data = '';\\n\\n //set div content\\n cellDivHtml += '<div style=\\\"width:100%; height:20px; text-align: ' + column.labelPosition + '; position: absolute; padding: 0; top: 0; z-index:2;\\\" class=\\\"pagos-grid-cell-padding\\\">' + data + '</div>';\\n\\n //check whether the value is less than zero\\n if (widthPercent != 0)\\n cellDivHtml += '<div style=\\\"width:' + widthPercent + '%; height: 20px; text-align: ' + column.labelPosition + '; position: absolute; top: 0; background: ' + cond.startColor + '; padding: 0;\\\" class=\\\"pagos-grid-cell-padding\\\"></div>';\\n\\n cellDiv.html(cellDivHtml);\\n }\\n }\\n break;\\n case \\\"gradient\\\":\\n {\\n //declare gradient variables\\n let gradient = e.gridGradient(cond.startColor, cond.endColor, ratio);\\n\\n //set cell value\\n if (value == 0) {\\n value = '';\\n cell.html(value);\\n }\\n\\n //set cell background color\\n if (!isNaN(value)) {\\n if (value != 0 || column.startFromZero) {\\n cell.css('backgroundColor', gradient);\\n }\\n }\\n }\\n break;\\n }\\n \\n }\\n });\\n }\\n };\\n\\n let getMeasures = function () {\\n //declare variables\\n let measures = [];\\n\\n //iterate all cols\\n that.columns.forEach(function (c) {\\n //check behavior\\n if (c.direction === 'data')\\n measures.push(e.clone(c));\\n });\\n\\n //return founded measures\\n return measures;\\n };\\n\\n let getRows = function () {\\n //declare variables\\n let rows = [];\\n\\n //iterate all cols\\n that.columns.forEach(function (c) {\\n //check behavior\\n if (c.direction === 'row')\\n rows.push(e.clone(c));\\n });\\n\\n //return founded measures\\n return rows;\\n };\\n\\n let getColByName = function (name) {\\n //declare needed variables\\n let col = null;\\n\\n //iterate all columns\\n that.columns.forEach(function (column) {\\n //check if columnname matches with the given\\n if (column.fieldName === name)\\n col = column;\\n });\\n\\n //return founded column\\n return col;\\n };\\n\\n let getSelectedRow = function () {\\n return that._selectedRow;\\n };\\n\\n let getColIndexByfieldName = function (fieldName) {\\n //declare needed variables\\n let index = -1;\\n\\n //iterate all columns to find index\\n that.columns.forEach(function (c, i) {\\n //check if current col field matches with the given\\n if (c.fieldName === fieldName)\\n index = i;\\n });\\n\\n //return found index\\n return index;\\n };\\n\\n let getMinMaxValues = function (fieldName) {\\n //declare needed variables\\n let min = 0, max = 0;\\n let rows = that._rows;\\n\\n //check whether the vis is grid\\n if (that.behavior === \\\"tabular\\\") {\\n //set min and max values\\n min = parseFloat(that._minMaxValues[0][fieldName + \\\"_min\\\"]);\\n max = parseFloat(that._minMaxValues[0][fieldName + \\\"_max\\\"]);\\n\\n //return calculated min and max\\n return {\\n min: min,\\n max: max\\n };\\n }\\n\\n //check whether the pivot mode is classical\\n if (that.pivotMode === 'classical') {\\n //get row count\\n let rowsArray = getRows(),\\n rowNames = [];\\n\\n //iterate all rows\\n rowsArray.forEach(function (r) {\\n //push current row into the rownames\\n rowNames.push(r.fieldName);\\n });\\n\\n //iterate all rows to set max\\n rows.forEach(function (row, index) {\\n //check row index\\n for (var key in row) {\\n //check key\\n if (rowNames.indexOf(key) == -1) {\\n //check if current value bigger than max\\n if (row[key] > max)\\n max = parseFloat(row[key]);\\n }\\n }\\n });\\n\\n //set min as max\\n min = max;\\n\\n //iterate all rows to set min\\n rows.forEach(function (row, index) {\\n //check row index\\n for (var key in row) {\\n //check key\\n if (rowNames.indexOf(key) == -1) {\\n //check if current value bigger than max\\n if (row[key] != null)\\n if (row[key] < min)\\n min = parseFloat(row[key]);\\n }\\n }\\n });\\n\\n //return calculated min and max\\n return {\\n min: min,\\n max: max\\n };\\n } else {\\n //iterate all rows to set max\\n rows.forEach(function (row, index) {\\n //check whether the current cell is not null or undefined\\n if (row[fieldName] != null && row[fieldName] != undefined && !isNaN(row[fieldName])) {\\n //set max value\\n if (row[fieldName] > max)\\n max = parseFloat(row[fieldName]);\\n }\\n });\\n\\n //set min as max\\n min = max;\\n\\n //iterate all rows to set min\\n rows.forEach(function (row, index) {\\n //check whether the current cell is not null or undefined\\n if (row[fieldName] != null && row[fieldName] != undefined && !isNaN(row[fieldName])) {\\n //set min value\\n if (row[fieldName] < min)\\n min = parseFloat(row[fieldName]);\\n }\\n });\\n\\n //return calculated min and max\\n return {\\n min: min,\\n max: max\\n };\\n }\\n };\\n\\n let getClassicalMinMaxValues = function (rows) {\\n //declare needed variables\\n let min = 0, max = 0;\\n\\n //iterate all rows\\n rows.forEach(function (row, rowIndex) {\\n //iterate all columns\\n that.columns.forEach(function (column, colIndex) {\\n //check whether the current column behavior is data\\n if (column.direction === 'data') {\\n //check whether the current cell value is not null or undefined\\n if (row[column.fieldName] != null && row[column.fieldName] != undefined && !isNaN(row[column.fieldName])) {\\n //check whether the max\\n if (row[column.fieldName] > max)\\n max = row[column.fieldName];\\n }\\n }\\n });\\n });\\n\\n //set mins\\n min = max;\\n\\n //iterate all rows\\n rows.forEach(function (row, rowIndex) {\\n //iterate all columns\\n that.columns.forEach(function (column, colIndex) {\\n //check whether the current column behavior is data\\n if (column.direction === 'data') {\\n //check whether the current cell value is not null or undefined\\n if (row[column.fieldName] != null && row[column.fieldName] != undefined && !isNaN(row[column.fieldName])) {\\n //check whether the min\\n if (row[column.fieldName] < min)\\n min = row[column.fieldName];\\n }\\n }\\n });\\n });\\n\\n //return min max\\n return {\\n min: min,\\n max: max\\n };\\n };\\n\\n let getSummarizeByColumn = function (colIndex) {\\n //declare needed variables\\n let col = that.columns[colIndex],\\n valueArray = [],\\n subRowsCount = 0,\\n min = 0, max = 0, abs = 0, total = 0;\\n\\n //iterate all rows\\n that._rows.forEach(function (row) {\\n //get column value\\n let currentValue = parseFloat(row[col.fieldName]);\\n\\n //check if current value is not nan\\n if (!isNaN(currentValue)) {\\n //push current value into stack\\n valueArray.push(currentValue);\\n\\n //increase total value\\n total += currentValue;\\n }\\n\\n if (row[col.fieldName] != null)\\n subRowsCount++;\\n });\\n\\n //sort value array\\n valueArray.sort();\\n\\n //switch expression\\n switch (col.expression) {\\n case 'count':\\n abs = subRowsCount;\\n case 'sum':\\n abs = total;\\n break;\\n case 'avg':\\n abs = total / subRowsCount;\\n break;\\n case 'min':\\n abs = d3.min(valueArray);\\n break;\\n case 'max':\\n abs = d3.max(valueArray);\\n break;\\n default:\\n abs = total;\\n break;\\n }\\n\\n //return formatted value\\n return formatCell(abs, col);\\n };\\n\\n let getColIndexByID = function (colID) {\\n //declare needed variables\\n var index = -1;\\n\\n //iterate all columns to find index\\n that.columns.forEach(function (c, i) {\\n //check if current col field matches with the given\\n if (c.fieldID === colID)\\n index = i;\\n });\\n\\n //return found index\\n return index;\\n };\\n\\n //attach update dataset\\n this.update = function (data) {\\n //handle errors\\n if (data == null) return false;\\n\\n //declare variables\\n var that = this; \\n\\n //switch grid behavior\\n switch (that.behavior) {\\n case 'tabular':\\n bindGrid(data);\\n break;\\n case 'pivot':\\n bindPivot(data);\\n break;\\n }\\n\\n //assign resizable to each cols\\n $('.' + that.container + '_cols').each(function (index) {\\n //attach resizable\\n $(this).resizable({\\n handles: 'e',\\n resize: function (e, ui) {\\n //declare needed variables\\n var currentColField = $(this).attr('colid'),\\n currentColIndex = getColIndexByID(currentColField);\\n\\n //update col size\\n that.columns[currentColIndex].width = ui.size.width;\\n\\n //resize columns\\n $('.' + that.container + '_rowCol_' + currentColIndex).css('width', ui.size.width + 'px');\\n },\\n stop: function (e, ui) {\\n \\n }\\n });\\n });\\n };\\n\\n //check document ready\\n $(document).ready(function () {\\n //initialize grid\\n initGrid();\\n });\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"52056d0689414f518fcf33688752104b","score":"0.7925451","text":"function createGrid(){\n for (var j = 0; j < rows; j++) {\n for (var i = 0; i < cols; i++) {\n var cell = new Cell(i, j, w);\n cell = makeCellProperty(cell, j, i);\n grid.push(cell);\n }\n }\n }","title":""},{"docid":"7d99aec89fb428a740e316433067ba75","score":"0.78829706","text":"function Grid() {}","title":""},{"docid":"718dc8e66102c189292f708634399c00","score":"0.7642126","text":"function createGrid() {\n for (let i=0; i < layout.length; i++) {\n const square = document.createElement('div');\n grid.appendChild(square);\n squares.push(square);\n\n // add layout to the board\n if (layout[i] === 0) {\n squares[i].classList.add('pac-dot', 'dot');\n } else if (layout[i] === 1) {\n squares[i].classList.add('wall');\n } else if (layout[i] === 2) {\n squares[i].classList.add('ghost-lair')\n } else if (layout[i] === 3) {\n squares[i].classList.add('power-pellet');\n }\n }\n }","title":""},{"docid":"f797501ad3ac0b322736bc14ebd11305","score":"0.75573134","text":"function Grid() {\n\t\tthis.rows = [];\n\t}","title":""},{"docid":"7fbbb5e9154230a7da07160f8ddb5857","score":"0.7507087","text":"constructor() {\r\n this.grid = [];\r\n this.rows = 0;\r\n this.cols = 0;\r\n }","title":""},{"docid":"a9168cc199b9e136c3a7aec208f22e0c","score":"0.7500231","text":"constructor() {\n this.grid = [];\n this.rows = 0;\n this.cols = 0;\n }","title":""},{"docid":"da3d76d5d90ad961e9bb7836fdfb85c0","score":"0.7483778","text":"gridCreate() {\n const grid = [];\n for (let x = 0; x < this.sizeX; x++) {\n grid[x] = [];\n for (let y = 0; y < this.sizeY; y++) {\n grid[x][y] = 0;\n }\n }\n\n this.Grid = grid;\n }","title":""},{"docid":"6086d8c8f6caea1c780a4db859175b2f","score":"0.74627477","text":"function createAbstractGridPanels (params) {\n\n\t /////////////////////////////////\n\t var x = params.x;\n \t var y = params.y;\n \t var height = params.height;\n \t var width = params.width;\n \t var AmountX = params.AmountX;\n \t var AmountY = params.AmountY;\n\n\t /////////////////////////////////\n\n\n\n\tvar i,j;\n var x1 = x;\n var y1 = y;\n var pm = 0;\n var all = 0;\n\n\t\tvar grid = new Array();\n\n\nfor (j=0;j < (AmountY) ;j++) {\n\n for (i=0;i < (AmountX) ;i++) {\n\n pm = ((width/AmountX)*i);\n\n x1 = (x+pm);\n y1 = (y+((height/AmountY)*j));\n\n grid[all] = {x1: x1, y1: y1};\n all++;\n\n }\n\n}\n\nreturn grid;\n\n}","title":""},{"docid":"05317f987c81265d27f598a42263a4fd","score":"0.74231374","text":"function createAbstractGrid (params) {\n\n\t//params: x,y,height,width,AmountX,AmountY\n\n\tvar x = params.x;\n\tvar y = params.y;\n\tvar height = params.height;\n\tvar width = params.width;\n\tvar AmountX = params.AmountX;\n\tvar AmountY = params.AmountY;\n\n\tvar i,j;\n\tvar x1 = x;\n\tvar y1 = y;\n\tvar x2;\n\tvar y2;\n\tvar pm = 0;\n\tvar all = 0;\n\tvar offset = 0;\n\tvar border = 0;\n\n\tvar grid = new Array();\n\n for (i=0;i <= (AmountX) ;i++) {\n\n\t pm = ((width/AmountX)*i);\n\t x1 = (x+pm);\n\t y1 = y;\n\n\t\t\t\t\tx2 = x1;\n\t y2 = (y+height);\n\n\t\t\t\t\tgrid[all] = {x1: x1, y1: y1, x2: x2, y2: y2};\n\t all++;\n\n }\n\n\t for (j=0;j <= (AmountY) ;j++) {\n\n pm = ((height/AmountY)*j);\n\t\t\t\t x1 = x;\n\t\t\t\t y1 = (y+pm);\n\n\t\t\t\t x2 = (x+width);\n\t\t\t\t y2 = y1;\n\n\t\t grid[all] = {x1: x1, y1: y1, x2: x2, y2: y2};\n\t\t all++;\n\n\t }\n\nreturn grid;\n\n}","title":""},{"docid":"45816b78609a50d984637c200cfb1f58","score":"0.74115014","text":"create_grid() {\n let table = document.createElement('table');\n this._cells = [];\n\n for (var i = 0; i < this._rows; i++) {\n let line = document.createElement('tr');\n this._cells[i] = [];\n for (let j = 0; j < this._columns; j++) {\n let cell = new Cell();\n\n line.appendChild(cell.element);\n this._cells[i][j] = cell;\n }\n table.appendChild(line);\n }\n\n this._table.appendChild(table);\n }","title":""},{"docid":"e0bf509968b35c584459a39859f62b56","score":"0.7372793","text":"createGrid() {\n let gridRow;\n let gridRowVisited;\n // let totalRows = this.#width / this.#cellSize;\n // let totalCols = this.#height / this.#cellSize;\n for (let row = 0; row < this.#height; row++) {\n gridRow = [];\n gridRowVisited = [];\n for (let col = 0; col < this.#width; col++) {\n gridRow[col] = new Cell(this.#cellSize, row, col);\n gridRowVisited[col] = false;\n }\n this.#girdArray[row] = gridRow;\n this.#visited[row] = gridRowVisited;\n }\n\n // Mark the initial cell top-left cell as visited\n this.#visited[0][0] = true;\n\n this.#girdArray[0][0].setIsVisited();\n\n // Add the top left cell to the stack\n // so that the stack won't be empty.\n this.#stack.pushData(this.#girdArray[0][0]);\n }","title":""},{"docid":"45fe0d359823e4e4e6d12ea23992babe","score":"0.73622036","text":"createGrid(gamegrid) {\r\n this.dotCount = 0;\r\n this.grid = [];\r\n this.DOMGrid.innerHTML = \"\";\r\n // First set correct amount of columns based on Grid Size and the size of each cell is based on Cell Size\r\n this.DOMGrid.style.cssText = `grid-template-columns: repeat(${GRID_SIZE}, ${CELL_SIZE}px);`;\r\n\r\n //loop through the gaemboard array, and create each element in the array\r\n gamegrid.forEach((square) => {\r\n const div = document.createElement(\"div\");\r\n\r\n //check value of current element and match it to classlist to get what object it's supposed to be\r\n div.classList.add(\"square\", CLASS_LIST[square]);\r\n div.style.cssText = `width: ${CELL_SIZE}px; height: ${CELL_SIZE}px;`;\r\n this.DOMGrid.appendChild(div);\r\n this.grid.push(div);\r\n\r\n // Add dots, keep track of the number of dots\r\n if (CLASS_LIST[square] === OBJECT_TYPE.DOT) this.dotCount++;\r\n });\r\n }","title":""},{"docid":"07c69556055950d62ceefd3040bfa5dc","score":"0.735816","text":"function createAbstractGridNodes (params) {\n\n\t /////////////////////////////////\n\n\t var x = params.x;\n \t var y = params.y;\n \t var height = params.height;\n \t var width = params.width;\n \t var AmountX = params.AmountX;\n \t var AmountY = params.AmountY;\n\n\t /////////////////////////////////\n\n\n\n\t\tvar i,j;\n var x1 = x;\n var y1 = y;\n var pm = 0;\n var all = 0;\n var offset = 0;\n var border = 0;\n\n\t\tvar grid = new Array();\n\nfor (j=offset;j <= (AmountY+border) ;j++) {\n\n for (i=offset;i <= (AmountX+border) ;i++) {\n\n pm = ((width/AmountX)*i);\n x1 = (x+pm);\n y1 = (y+((height/AmountY)*j));\n\n grid[all] = {x1: x1, y1: y1};\n all++;\n\n }\n\n}\n\nreturn grid;\n\n}","title":""},{"docid":"8091f17361b095431ef130009689f0c1","score":"0.73541343","text":"createGrid(){\n\t\tconst grid = [];\n\n\t\tfor(let i = 0; i < this.size; i++){\n\t\t\tconst row = [];\n\n\t\t\tfor(let j = 0; j < this.size; j++){\n\t\t\t\trow.push(new Cell());\n\t\t\t}\n\t\t\tgrid.push(row);\n\t\t}\n\n\t\treturn grid;\n\t}","title":""},{"docid":"863f92287063873feed1120b8abed647","score":"0.7339761","text":"initialize(grid){}","title":""},{"docid":"28521b80f1f9e3f9d8dd201c4ca63e66","score":"0.73147345","text":"function Grid() {\n}","title":""},{"docid":"2a05be37a29690108f8fbd4508737212","score":"0.72700906","text":"function Grid() { \n this.BLOCK_SCALER = 0.045; //percent of height a block should be\n \n this.position_x = 10;\n this.position_y = 10;\n \n this.BORDER_WIDTH = 3;\n \n this.gridData = this.generateEmptyGrid();\n}","title":""},{"docid":"567fd81b5db131c0fa77957db55cff4a","score":"0.7221458","text":"GridStyle(total_x, total_y, w, h, srcImage_Path)\n {\n\n if(!(this.grid instanceof Array))\n {\n this.grid = [];\n }\n\n function GridUnit(x, y, w, h, srcImage_Path){\n\n var size = new Gamelab.Vector(w, h),\n position = new Gamelab.Vector(x, y);\n\n var sprite;\n\n if(srcImage_Path)\n {\n sprite = new Gamelab.Sprite(srcImage_Path);\n sprite.Size(size);\n sprite.Pos(position);\n\n Gamelab.game_windows[0].add(sprite);\n }\n\n return {\n size:size,\n position:position\n };\n };\n\n for(var y = 0; y < total_y; y++)\n {\n\n for(var x = 0; x < total_x; x++)\n {\n\n this.grid.push(new GridUnit(x * w, y * h, w, h, srcImage_Path));\n\n }\n\n }\n return this;\n }","title":""},{"docid":"1219affe9a5655510324920fd381ef1b","score":"0.721846","text":"function createGrid (params) {\n\n\n\t var el = params.el;\n\t\tvar layer = params.layer;\n\t\tvar transform = params.transform;\n\t\tvar x = params.x;\n \tvar y = params.y;\n\t\tvar height = params.height;\n\t\tvar width = params.width;\n\t\tvar AmountX = params.AmountX;\n\t\tvar AmountY = params.AmountY;\n\t\tvar style = params.style;\n\n\n\n\t\tparams = {x:x,y:y,height:height,width:width,AmountX:AmountX,AmountY:AmountY};\n\t var AbstractGrid =createAbstractGrid(params);\n\n\n\t\tvar grid = el.g({layer:layer, transform:transform});\n\n\n for (i=0; i<AbstractGrid.length;i++) {\n\n params = {layer: grid.id, x1 : AbstractGrid[i].x1, y1: AbstractGrid[i].y1, x2: AbstractGrid[i].x2, y2:AbstractGrid[i].y2, style: style};\n el.line(params);\n\n\t}\n\n return grid;\n}","title":""},{"docid":"882e76b3f7b22a49c108c26e3d66e0bb","score":"0.7201928","text":"function newGrid() {\n\tfor (var i = 0; i < 16; i++) {\n\t\t\n\t\t$(\".grid-container\").append( \"<div class=\" + \"grid-row-\" + i + \"></div>\");\n\n\t\tfor (var j = 0; j < 32; j++) {\n\t\t\t$(\".grid-row-\" + i).append(\"<div class=grid-elem></div>\");\n\t\t}\n\t}\n}","title":""},{"docid":"4c4868b04bcf190f4adbbdaae4e86c35","score":"0.716425","text":"function grid(top,left){ //,width,height\n this.top = top;\n this.left = left;\n //Store in board since width and height is same for all grids.\n //Dont store width height here.\n // this.w = width;\n // this.h = height;\n }","title":""},{"docid":"c3fa41e869aef62980055f4913331c27","score":"0.71577024","text":"function createGrid() {\n\t\tfor(var i = 1; i < Math.pow(rAndC, 2); i++) {\n\t\t\tvar box = document.createElement(\"div\");\n\t\t\tbox.className = \"box\";\n\t\t\tdocument.getElementById(\"puzzlearea\").appendChild(box);\t\n\t\t}\n\t\tstyleBoxes();\n\t}","title":""},{"docid":"d2fdb36c89c79c1ab935dd7f6b441a16","score":"0.71308196","text":"function makeGrid(rows, cols) {\n container.style.setProperty('--grid-rows', rows);\n container.style.setProperty('--grid-cols', cols);\n for(i=0; i < rows*cols; i++) {\n let item = document.createElement(\"div\");\n container.appendChild(item).className = \"grid-item\";\n }\n}","title":""},{"docid":"2c7d3a83078013e9b3906414ab7d096c","score":"0.70996404","text":"gridSetup() {\n this.grid = [];\n this.temp = [];\n //create canvas at appropriate size\n this.canvas.width = (this.width - 2) * this.cellSize;\n this.canvas.height = (this.height - 2) * this.cellSize;\n this.ctx.fillStyle = \"black\";\n this.ctx.fillRect(0, 0, 3000, 3000);\n //instantiate spaces in arrays\n for (let y = 0; y < this.height; y++) {\n this.grid[y] = [[]];\n this.temp[y] = [[]];\n for (let x = 0; x < this.width; x++) {\n //fill with random values\n this.grid[y][x] = [Math.round(Math.random()), 0];\n this.temp[y][x] = [0, 0];\n //create border\n if (x == 0 || y == 0 || x == this.width - 1 || y == this.height - 1) {\n this.grid[y][x] = 0;\n }\n }\n }\n }","title":""},{"docid":"18f05ca2733ae1c50efaee666b0d9251","score":"0.70886385","text":"createGrid() {\n // loop to create the 8 rows\n for (let row = 0; row < 8; row++) {\n this.grid[row] = [];\n // push in 8 columns of nulls\n for (let column = 0; column < 8; column++) {\n this.grid[row].push(null);\n }\n }\n }","title":""},{"docid":"18f05ca2733ae1c50efaee666b0d9251","score":"0.70886385","text":"createGrid() {\n // loop to create the 8 rows\n for (let row = 0; row < 8; row++) {\n this.grid[row] = [];\n // push in 8 columns of nulls\n for (let column = 0; column < 8; column++) {\n this.grid[row].push(null);\n }\n }\n }","title":""},{"docid":"2bcf46a1d1099f1058390f9f2a23a015","score":"0.70827866","text":"function createGrids(){\n var no_keys = 8;\n var title = [\"RGB-audio-peak-visualiser\",\"whatmovie-php\",\"xor_openvpn_bash\",\"mouseshiver\",\"CSGO_SIMPLE_EXTERNAL\",\"photoorganiser\",\"ticket-collector\",\"whatmovie-js\"]\n var description = [\"A C++/C# application that loopbacks the playback output to create a visualiser with RGB strips.\",\"Original movie reccomendation generator written in PHP using themoviedb API.\",\"Creates a OXR OpenVPN server on Linux.\",\"Moves the mouse according to the microphone input level.\",\"External Code for Counter-Strike: Global Offensive.\",\"Organises a mass of photos into corresponding files.\",\"Bot to get tickets automatically.\",\"Old website ported and removed redundent dependencies. \"]\n var language = [\"Python\",\"PHP\",\"Bash\",\"C++/Python\",\"C++\",\"Python\",\"JS\",\"JS\"]\n\n // Rows\n row_iter = 0\n for(x = 0; x < (no_keys - no_keys % 4)/4; x++){\n // Columns\n for(col=1; col < 5; col++){\n generateBlock(\"column\"+col.toString(), title[row_iter], description[row_iter] , language[row_iter]);\n row_iter +=1\n }\n }\n}","title":""},{"docid":"52b6f293050ba018bc43e1092d9a0166","score":"0.7078038","text":"function gridCreation() {\n $('.wrapper').append('<div class=\"neon-wrapper\"><div class=\"neon-text\">2048</div></div>');\n $('.wrapper').after('<div class=\"score\">Score : ' + '<span id=\"newScore\">' + score + '</span>' + '</div>');\n for (var rows = 0; rows < 4; rows++) {\n for (var columns = 0; columns < 4; columns++) {\n $('#container').append('<div class=\"grid\" id=\"' + rows + columns + '\"></div>');\n };\n };\n }","title":""},{"docid":"9eaceb82ad861585db07ea46be57d841","score":"0.7072934","text":"function buildGrid(width, height, id, columnClassName, cellClassName) {\n const grid = document.createElement('div');\n // Create number of columns based upon \"width\":\n for (let i = 0; i < width; i++) {\n const column = document.createElement('div');\n column.className = columnClassName;\n // Create number of cells based upon \"height\":\n for (let j = 0; j < height; j++) {\n const cell = document.createElement('div');\n cell.className = cellClassName;\n cell.style.background = 'rgb(255, 255, 255)'; // All cells start white\n // Apply data attributes only to \"canvas\" grid (used in applying fill):\n if (id === 'canvas') {\n addCellAttributes(cell, i, j);\n }\n column.appendChild(cell);\n }\n grid.appendChild(column);\n }\n grid.id = id;\n return grid;\n }","title":""},{"docid":"1a77ba9f2b35916bda19486c5f9f00a2","score":"0.7065965","text":"function createGrid() {\n for (let y = cellSize; y < canvas.height; y += cellSize) {\n for (let x = 0; x < canvas.width; x += cellSize) {\n grid.push(new Cell(x, y)) //create new cell\n }\n }\n}","title":""},{"docid":"d96a740e7d7adfdd0272af0d7ed36d48","score":"0.7060533","text":"function initialGrid(){\n for (var i = 0; i < 256; i++) {\n let cell = document.createElement('div');\n cell.setAttribute(\"id\", i);\n cell.setAttribute(\"class\", \"cell\")\n container.appendChild(cell);\n }\n }","title":""},{"docid":"093e30a6d10937854191d31c96acd774","score":"0.705077","text":"function Grid() {\n this.cells = new Array(9);\n}","title":""},{"docid":"34983d118adc8809dd0fb77e1f7c1541","score":"0.70377487","text":"initialise_grid(element) {\n const [width, height] = [document.body.offsetWidth, document.body.offsetHeight];\n this.grid = new DOM.Canvas(null, width, height, { class: \"grid\" });\n element.add(this.grid);\n this.update_grid();\n }","title":""},{"docid":"7cd1593d69b95dcef65f7d1c51b7c4cb","score":"0.7027327","text":"function createGrid(gridSize){\n createRow(gridSize);\n createCells(gridSize);\n}","title":""},{"docid":"f05ec71adb491b2aea82963113353909","score":"0.70269346","text":"function makeGrid() {\n\n for (var h = 0; h < height; h++) {\n let row = canvas.insertRow(h);\n\n for (var w = 0; w < width; w++) {\n let cell = row.insertCell(w);\n }\n }\n\n } //End of makeGrid function","title":""},{"docid":"c884e7a2edd3b1aa3c28b1ba8d84884f","score":"0.7026639","text":"loadGrid(){\r\n for(var i = 0; i < this.cols; i++){ // columns of rows\r\n this.grid[i] = [];\r\n for(var j = 0; j < this.rows; j++){\r\n this.grid[i][j] = new Cell(this, vector2d((i*this.w), (j*this.w)), ++cellId);\r\n\r\n }\r\n }\r\n\r\n }","title":""},{"docid":"678f329cc418005407995e31cbd7087a","score":"0.7022549","text":"function gridMaker(row,col){\n \n //set css variable for grid rows and grid col\n gridContainer.style.setProperty('--grid-rows',row);\n gridContainer.style.setProperty('--grid-cols',col); \n //loop for number of cells in grid\n console.log(row)\n console.log(col)\n for(let i = 0;i < (row*col);i++){\n //create a cell div for the grid\n const cell = document.createElement('div');\n //add textcontent to div\n // cell.textContent = 'x';\n //append div to gridContainer with classs\n gridContainer.appendChild(cell).className = \"grid-item\";\n }\n \n}","title":""},{"docid":"fdb078f74b643a155862751953ebe015","score":"0.70214385","text":"function makeGrid() {\n // Set Canvas size as N by M grid\n let gridHeight = INPUT_HEIGHT.val();\n let gridWidth = INPUT_WIDTH.val();\n\n /* Max value = 50(for higher values) */\n if (gridHeight > 40) {\n gridHeight = 40;\n }\n\n if (gridWidth > 40) {\n gridWidth = 40;\n }\n\n // Clear the canvas\n CANVAS.empty();\n\n //Make rows (1 row per height)\n for (let lines = 0; lines < gridHeight; lines++) {\n const line = $(\"<tr></tr>\");\n CANVAS.append(line);\n\n //Make columns (1 column in each row)\n for (let columns = 0; columns < gridWidth; columns++) {\n line.append(\"<td></td>\");\n }\n }\n }","title":""},{"docid":"478a4180a02ba661d0774e3fd9fe0828","score":"0.7020364","text":"function GridClass(width, height, name, args){\n\tvar self = this;\n\tthis.add_bound_properties(this, ['get_target', 'mask', 'add_control', 'controls', 'receive', 'get_button', 'reset', 'clear_buttons', 'sub_grid', 'clear_translations', 'button_coords']);\n\t//lcl_debug('making GridClass:', width, height, name, args, this._bound_properties);\n\t//this._bound_properties = ['receive'];\n\tvar contents = [];\n\tfor(var i = 0; i < width; i++){\n\t\tcontents[i] = [];\n\t\tfor(var j = 0; j < height; j++){\n\t\t\tcontents[i][j] = undefined;\n\t\t}\n\t}\n\tthis._grid = contents;\n\tthis.width = function(){return width;}\n\tthis.height = function(){return height;}\n\tthis.size = function(){return width * height;}\n\tGridClass.super_.call(this, name, args);\n}","title":""},{"docid":"97b1780cd04243754609fd9aedefa919","score":"0.7015143","text":"function Grid() {\n\tthis.grid = createArray(GRID_SIZE);\n\tfor (var i = 0; i < GRID_SIZE; i++){\n\t\tif (i == 0) {\n\t\t\tthis.grid[i] = TOP_LABEL;\n\t\t\tcontinue;\n\t\t}\n\t\tfor (var j = 0; j < GRID_SIZE; j++){\n\t\t\tif (j == 0){\n\t\t\t\tthis.grid[i][j] = SIDE_LABEL[i];\n\t\t\t} else {\n\t\t\tthis.grid[i][j] = EMPTY_SPACE;\n\t\t\t}\n\t\t}\n\t}\n\treturn this.grid;\n}","title":""},{"docid":"a8fbddedc49450760e00e944708f586e","score":"0.7000697","text":"function makeGrid(width,height) {\n\tmakeRows(height);\n\tfillRows(width);\n\tstyleBorder();\n}","title":""},{"docid":"c56dd5a43e75aec0b8136d176fa1a141","score":"0.69821644","text":"createGrid() {\n // loop to create the 8 rows\n for (let row = 0; row < 8; row++) {\n this.grid[row] = [];\n // push in 8 columns of nulls\n for (let column = 0; column < 8; column++) {\n this.grid[row].push(null);\n } \n }\n }","title":""},{"docid":"00a1c059f5fa689db6d28cf6146400e8","score":"0.6963781","text":"function Grid() {\n $.jqplot.ElemContainer.call(this);\n // Group: Properties\n \n // prop: drawGridlines\n // whether to draw the gridlines on the plot.\n this.drawGridlines = true;\n // prop: gridLineColor\n // color of the grid lines.\n this.gridLineColor = '#cccccc';\n // prop: gridLineWidth\n // width of the grid lines.\n this.gridLineWidth = 1.0;\n // prop: background\n // css spec for the background color.\n this.background = '#fffdf6';\n // prop: borderColor\n // css spec for the color of the grid border.\n this.borderColor = '#999999';\n // prop: borderWidth\n // width of the border in pixels.\n this.borderWidth = 2.0;\n // prop: drawBorder\n // True to draw border around grid.\n this.drawBorder = true;\n // prop: shadow\n // whether to show a shadow behind the grid.\n this.shadow = true;\n // prop: shadowAngle\n // shadow angle in degrees\n this.shadowAngle = 45;\n // prop: shadowOffset\n // Offset of each shadow stroke from the border in pixels\n this.shadowOffset = 1.5;\n // prop: shadowWidth\n // width of the stoke for the shadow\n this.shadowWidth = 3;\n // prop: shadowDepth\n // Number of times shadow is stroked, each stroke offset shadowOffset from the last.\n this.shadowDepth = 3;\n // prop: shadowColor\n // an optional css color spec for the shadow in 'rgba(n, n, n, n)' form\n this.shadowColor = null;\n // prop: shadowAlpha\n // Alpha channel transparency of shadow. 0 = transparent.\n this.shadowAlpha = '0.07';\n this._left;\n this._top;\n this._right;\n this._bottom;\n this._width;\n this._height;\n this._axes = [];\n // prop: renderer\n // Instance of a renderer which will actually render the grid,\n // see <$.jqplot.CanvasGridRenderer>.\n this.renderer = $.jqplot.CanvasGridRenderer;\n // prop: rendererOptions\n // Options to pass on to the renderer,\n // see <$.jqplot.CanvasGridRenderer>.\n this.rendererOptions = {};\n this._offsets = {top:null, bottom:null, left:null, right:null};\n }","title":""},{"docid":"0dc852e9526190ceb5b621e98f6fafaa","score":"0.6947224","text":"function Grid() {\n\n /* two-dimensional dynamic grid */\n this._grid = [[]];\n /* always point to the last line of the grid */\n this._x = 0;\n /* completed elements count of current line */\n this._y = 0;\n\n /* default handler */\n this._handler = function (element, next) {\n if (Arsenal.isFunction(element)) { element(); }\n if (Arsenal.isFunction(next)) { next(); }\n };\n\n }","title":""},{"docid":"1b0ace8b0ee1fd21a2fe666adb18427b","score":"0.6945931","text":"constructor() {\n this.grid = null;\n }","title":""},{"docid":"2d845457e36b9c5e40324f7f3716fc00","score":"0.6934508","text":"function createGrid(num) {\n\tfor (var i = 1; i <= num; i++) {\n\t\t// creates each individual grid square\n\t\tfor (var j = 1; j <= num; j++) {\n\t\t\t$('#container').append('<div class=\"grid\"></div>');\n\t\t}\n\t\t// creates each new row\n\t\t$('#container').append('<div class=\"newRow\"></div>');\n\t}\n\n\t// sets the grid width and height based on the number of grids fit in\n\t// the grid's container\n\tsquare = (totalLength / num) -2;\n\t$('#container > .grid').css({\"width\": square,\n\t\t\t\t\t\t\t\t\"height\": square});\n}","title":""},{"docid":"5a2ae3a2360ad95b140ed956aa8b6107","score":"0.692754","text":"function makeGrid(a) {\n\tgetRidGrid();\n\tmakeRows(a);\n\tmakeColumns(a);\n}","title":""},{"docid":"263b504950f80007a88cb72df20464bd","score":"0.69260645","text":"function createGrid() {\n for (let y = globals.blockSize; y < canvas.height; y += globals.blockSize) {\n for (let x = 0; x < canvas.width; x += globals.blockSize) {\n grid.push(new Block(x, y));\n }\n }\n}","title":""},{"docid":"8523a199c02e53e008d4f137355a7efd","score":"0.69212663","text":"createDataStructure() {\n this.grid = new Array(this.size.width);\n\n for (let w = 0; w < this.size.width; ++w) {\n this.grid[w] = new Array(this.size.height).fill(false);\n }\n\n this.registerStep();\n }","title":""},{"docid":"3c6ca47ab7be891617800bc90c94005c","score":"0.6910542","text":"function initialization() {\n cols = floor(width / w)\n rows = floor(height / w)\n\n for (let j = 0; j < rows; j++) {\n for (let i = 0; i < cols; i++) {\n let cell = new Cell(i, j)\n grid.push(cell)\n }\n }\n current = grid[0]\n}","title":""},{"docid":"1f4a228f97e19b2e4cf8f2e2ea13de36","score":"0.6905521","text":"constructor( columns,rows ){\n\t\tthis.grid = [];\n\t\tthis.columns = columns;\n\t\tthis.rows = rows;\n\t\tthis.minMatch = 3;\n\t\tthis.init();\n\n\n\t}","title":""},{"docid":"6cc3e5822997103f8ec16ae295701b6b","score":"0.69006443","text":"function createGrid() {\n for(let row = 0; row < num_rows; row++) {\n nodes[row] = [];\n for(let col = 0; col < num_cols; col++) {\n nodes[row][col] = {\n x: col *(rectWidth + 1),\n y: row * (rectHeight + 1),\n state: STATE.EMPTY,\n prevState: STATE.EMPTY // used for when the start/end nodes are being moved\n };\n }\n }\n nodes[startNode.row][startNode.col].state = STATE.START;\n nodes[finishNode.row][finishNode.col].state = STATE.FINISH;\n}","title":""},{"docid":"f07d3414748d8d0366a978b61daa7f85","score":"0.6898993","text":"function createGrid(gridTemplate) {\n clearContainer();\n createDivs(gridTemplate);\n addGridTemplate(gridTemplate[1]);\n drawing();\n}","title":""},{"docid":"22854613512cb6659efbda6b67ba55fa","score":"0.68909115","text":"function createGrid(){\n var rows = 11;\n var columns = 11;\n var $row = $(\"<div />\", {\n class: 'row'\n });\n var $square = $(\"<div />\", {\n class: 'square'\n });\n\n var letras = [\"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\"];\n var numeros = [];\n\n for (var i = 1; i < 11; i++) {\n numeros.push(i);\n }\n\n var tablero = [];\n\n //add columns to the the temp row object\n for (var i = 0; i < columns; i++) {\n var currentRow = $row.clone();\n if(i > 0){\n tablero.push([]);\n }\n\n $('#shipPlace').append(currentRow);\n for (var j = 0; j < rows; j++) {\n var currentSquare = $square.clone().attr(\"id\", letras[j-1]+(i));\n currentRow.append(currentSquare);\n if(i > 0 && j > 0){\n tablero[i-1].push(currentSquare);\n }\n if(i === 0 || j === 0){\n currentSquare.addClass(\"vacio\");\n }\n if(i === 0 && j > 0){\n currentSquare.text(letras[j-1]);\n }\n if(i > 0 && j === 0){\n currentSquare.text(numeros[i-1]);\n }\n }\n }\n}","title":""},{"docid":"9769d54db59dbd3a681eb40ca662b62a","score":"0.6885528","text":"function Grid( _num_items_horiz, _num_items_vert, _grid_w, _grid_h, _startx, _starty ) {\n\n if ( _num_items_horiz == undefined ) _num_items_horiz = 1;\n if ( _num_items_vert == undefined ) _num_items_vert = 1;\n var _horiz = _num_items_horiz || 1;\n var _vert = _num_items_vert || 1;\n this.length = 0;\n this.spacing_x;\n this.spacing_y;\n this.c = rgb( 200 );\n this.num_items_horiz = 0;\n this.num_items_vert = 0;\n\n this.start = {\n x: _startx || 0,\n y: _starty || 0\n };\n\n this.grid_w = this.w = _grid_w || w;\n this.grid_h = this.h = _grid_h || h;\n\n this.width = _grid_w || w;\n this.height = _grid_h || h;\n this.centre = {\n x: this.start.x + this.width / 2,\n y: this.start.y + this.height / 2\n }\n this.grid = [];\n this.edge = [];\n this.x = [];\n this.y = [];\n this.rows = [];\n this.cols = [];\n this.pos = [];\n\n this.add = function ( _horiz, _vert ) {\n\n this.num_items_horiz += _horiz || 1;\n this.num_items_vert += _vert || 1;\n\n this.spacing_x = this.width / this.num_items_horiz;\n this.spacing_y = this.height / this.num_items_vert;\n this.spacing = new Vector( this.spacing_x, this.spacing_y );\n this.createGrid();\n\n return this;\n\n }\n\n\n this.setStart = function ( _x, _y ) {\n\n this.start = {\n x: _x || 0,\n y: _y || 0\n };\n createGrid();\n\n }\n\n this.createGrid = function () {\n var r = 0;\n this.spacing_x = this.width / this.num_items_horiz;\n this.spacing_y = this.height / this.num_items_vert;\n this.spacing = new Vector( this.spacing_x, this.spacing_y );\n // console.log(this.start.x);\n // console.log(this.width);\n this.cols = [];\n\n for ( var y = 0; y < this.num_items_vert; y++ ) {\n\n var c = 0;\n var row = [];\n //this.cols[y] = [];\n var yy = y * this.spacing_y + this.spacing_y / 2 + this.start.y;\n\n\n for ( var x = 0; x < this.num_items_horiz; x++ ) {\n\n var edge = false;\n var xx = x * this.spacing_x + this.spacing_x / 2 + this.start.x;\n\n //console.log(this.start.y);\n // see if it's a point on the outside\n if ( ( y == this.start.y || y == this.num_items_vert ) && ( x == this.start.x || x == this.num_items_horiz ) ) {\n edge = true;\n }\n\n this.x.push( xx );\n this.y.push( yy );\n this.pos.push( {\n row: r,\n col: c,\n x: xx,\n y: yy\n } );\n row.push( {\n x: xx,\n y: yy\n } );\n\n this.edge.push( edge );\n this.grid.push( {\n row: y,\n col: x,\n x: xx,\n y: yy,\n edge: edge,\n c: this.c,\n r: 255,\n g: 255,\n b: 255\n } );\n c++;\n\n }\n\n this.cols[ x ] = {\n col: x,\n x: xx,\n y: yy,\n };\n this.rows[ r ] = {\n row: r,\n items: this.num_items_horiz,\n pos: row\n };\n r++;\n //console.log(row);\n };\n //console.log(this.rows);\n this.length = this.num_items_vert * this.num_items_horiz;\n this.grid.push( {\n row: this.rows,\n col: this.cols\n } );\n\n }\n\n this.add( _horiz, _vert );\n\n //console.log(this);\n return this;\n\n}","title":""},{"docid":"33767016a92e1af18559ff5a8b074f79","score":"0.68836576","text":"generate() {\n let generator = new Generator(this);\n this.grid = generator.generate();\n }","title":""},{"docid":"55c3285cb1b725793f0bd1cc45ae2aff","score":"0.68817014","text":"static createGameBoard(DOMGrid, gamegrid) {\r\n //creating the empty gameboard using the previously defined constructor\r\n const board = new this(DOMGrid);\r\n\r\n //populate gameboard with the hardcoded array passed in from basics\r\n\r\n board.createGrid(gamegrid);\r\n return board;\r\n }","title":""},{"docid":"42873e16e4f82bf44735d6f1d59a1e03","score":"0.6879884","text":"function grid(rows, cols) {\n\tthis.rows = rows;\n\tthis.cols = cols;\n\tthis.cells = [];\n\tfor (i = 0; i < rows; i++) {\n\t\tthis.cells[i] = {};\n\t\tfor (j = 0; j < cols; j++) {\n\t\t\tthis.cells[i][j] = 0;\n\t\t}\n\t}\n\t\n\tthis.set = function(xpos, ypos, object_id) {\n\t\tthis.cells[xpos][ypos] = object_id;\n\t};\n}","title":""},{"docid":"ff7a872032a500dcbc75eb955d11883b","score":"0.68780506","text":"function createGrid() {\n // varaibles related to game logic\n const grid = [];\n document.documentElement.style.setProperty(\"--rows\", ROWS);\n document.documentElement.style.setProperty(\"--cols\", COLS);\n\n Array(ROWS)\n .fill(0)\n .forEach((_, rowIndex) => {\n const row = document.createElement(\"div\");\n row.classList.add(\"flex\");\n grid.push([]);\n\n Array(COLS)\n .fill(0)\n .forEach((_, colIndex) => {\n const cell = new Cell(rowIndex, colIndex);\n // adding cell to DOM\n cell.create(row);\n grid[rowIndex].push(cell);\n });\n\n outerBox.appendChild(row);\n });\n\n return grid;\n}","title":""},{"docid":"29262a185e962a09b27b56c8f6e3454b","score":"0.6868702","text":"function Grid(width, height) {\n\t\tthis.width = width;\n\t\tthis.height = height;\n\t}","title":""},{"docid":"1917df1f4934bc75dae878542eef359e","score":"0.6866311","text":"function Grid(xSize, ySize) {\n this.xSize = xSize;\n this.ySize = ySize;\n this.grd = createArray(xSize, ySize);\n}","title":""},{"docid":"c6622701e2745ff293118babb3fcc07c","score":"0.6866287","text":"function defaultGrid() {\n createGrid(16);\n}","title":""},{"docid":"86a2e635c16b04e283b80c77a072a6a2","score":"0.68593735","text":"function _makeGrid () {\n //initialize an 8 x 8 array \n\n var myGrid = [...Array(8)].map(e => Array(8)); \n\n //place the pieces down \n //like arr[space - 1][space - 1] = new Piece(with the the color)\n\n myGrid[3][3] = new Piece('white');\n myGrid[4][4] = new Piece('white');\n myGrid[3][4] = new Piece('black');\n myGrid[4][3] = new Piece('black');\n\n return myGrid; \n}","title":""},{"docid":"671fad44014dba0e94c092b72b9ab663","score":"0.6850482","text":"function buildGrid(root) {\n for (let i = 0; i < 10; i++) {\n for (let j = 0; j < 10; j++) {\n let cell = $('<div>').addClass('cell');\n cell.attr('data-row', i).attr('data-col', j);\n // cells.push(cell);\n root.append(cell);\n }\n }\n }","title":""},{"docid":"f38e23b6e2b21b7ce3d38290c7724a50","score":"0.6847373","text":"function makeGrid() {\n let noOfRows = height.val();\n let noOfCols = width.val();\n canvas.find('tbody').remove()\n canvas.append('<tbody></tbody>')\n let table = canvas.find('tbody');\n for (let i = 0; i < noOfRows; i++) {\n table.append('<tr></tr>')\n }\n for (let i = 0; i < noOfCols; i++) {\n canvas.find('tr').append('<td class=\"background\"></td>');\n }\n }","title":""},{"docid":"db0a1f3868f8d14e28e91d93cfa5374f","score":"0.684587","text":"function defaultGrid() {\n makeRows(16);\n makeColumns(16);\n}","title":""},{"docid":"e8d4bf201ab39bb1217ddf61235533db","score":"0.68457836","text":"function buildGrid(vars) {\n vars = vars || {};\n var container = document.createElement(\"div\"),\n rows = vars.grid[0] || 5,\n cols = vars.grid[1] || 5,\n width = vars.width || 100,\n gutter = vars.gutter || 1,\n className = vars.className || \"\",\n w = (width - cols * gutter) / cols,\n parent = (typeof (vars.parent) === \"string\") ? document.querySelector(vars.parent) : vars.parent ? vars.parent : document.body,\n css = \"display: inline-block; margin: 0 \" + (gutter / width * 100) + \"% \" + (gutter / width * 100) + \"% 0; width: \" + (w / width * 100) + \"%;\",\n l = rows * cols,\n i, box;\n for (i = 0; i < l; i++) {\n box = document.createElement(\"div\");\n box.style.cssText = css;\n box.setAttribute(\"class\", className);\n box.index = i;\n box.setAttribute(\"data-index\", i);\n if (vars.onCellClick) {\n box.addEventListener(\"click\", vars.onCellClick);\n }\n container.appendChild(box);\n }\n container.style.cssText = \"width:\" + width + \"px; line-height: 0; padding:\" + gutter + \"px 0 0 \" + gutter + \"px; display:inline-block;\";\n parent.appendChild(container);\n return container;\n}","title":""},{"docid":"ccf1e1140fc4617d5723099175ac447a","score":"0.6840106","text":"function newGrid(){\n unsketch();\n removeOldSquares();\n resetGridTemplate();\n howManySquares();\n setGridRow();\n setGridColumn();\n createGrid();\n addEventListeners();\n}","title":""},{"docid":"5402192c91455666f79bd6704884d8ea","score":"0.68360233","text":"initGrid() {\r\n let gridContainer = document.getElementById(\"grid-container\");\r\n let tableRoot = document.createElement(\"table\");\r\n tableRoot.id = \"grid-table\";\r\n\r\n for (let i = 0; i < this.numberOfRows; i++) {\r\n let tableRow = document.createElement(\"tr\");\r\n this.cellModelMatrix[i] = new Array(this.numberOfCols);\r\n this.tableCellMatrix[i] = new Array(this.numberOfCols);\r\n\r\n for (let j = 0; j < this.numberOfCols; j++) {\r\n // Draw table cell\r\n let tableCell = document.createElement(\"td\");\r\n tableRow.appendChild(tableCell);\r\n\r\n let cellView = new CellView(tableCell);\r\n let cellModel = new CellModel(i, j, cellView);\r\n this.cellModelMatrix[i][j] = cellModel;\r\n this.tableCellMatrix[i][j] = tableCell;\r\n }\r\n\r\n tableRoot.appendChild(tableRow);\r\n }\r\n\r\n gridContainer.appendChild(tableRoot);\r\n }","title":""},{"docid":"c9bae3abae3be5829f83ad442613cf0d","score":"0.68275607","text":"function makeGrid() {\n\n // Your code goes here!\n \n }","title":""},{"docid":"405e5ba076fe58ded20e4a607d3053b3","score":"0.68270236","text":"function drawGrid () {\n var gridHTML = '';\n for (var key in grids) {\n gridHTML += '<div id=\"' + key + '\" class=\"grid ' +grids[key].type+ '\" style=\"top:' +grids[key].top+ 'px; left:' +grids[key].left+ 'px; width:' +small_tile_size+ 'px; height:' +small_tile_size+ 'px;\">' +key+ '</div>';\n }\n $('.tiles-container').append(gridHTML);\n }","title":""},{"docid":"89b653f8033d24ea07799e90f207ee51","score":"0.6826665","text":"function createGrid() {\n\t\t\n\t\t// Clear rows & blocks inside the grid\n\t\tgrid.innerHTML = '';\n\t\t\n\t\t// Remove these classes in case the previous game had been won or lost\n\t\t$('#grid').removeClass(\"won lost\");\n\t\trunning = true;\n\n\t\t// For height rows and width columns: create a block object, create an HTML block,\n\t\t// and give the block object a reference to its HTML block.\n\t\tfor (let i = 0; i < height; i++) {\n\t\t\tlet row = document.createElement('div');\n\t\t\trow.classList.add('row');\n\t\t\t$('#grid').append(row);\n\t\t\tfor (let j = 0; j < width; j++) {\n\t\t\t\t\tlet block = document.createElement(\"div\");\n\t\t\t\t\tblock.classList.add('block');\n\t\t\t\t\trow.append(block);\n\t\t\t\t\tblockList.push(new Block(i, j, block));\n\t\t\t}\n\t\t}\n\n\t\t\n\t\t\n\t\t$('.block').click(function(e) {\n\t\t\tlet row = $(this).parent().index();\n\t\t\tlet column = $(this).index();\n\t\t\tlet block = getBlock(row, column);\n\t\t\t\n\t\t\t// Left-clicking uncovers the block.\n\t\t\tif (!e.shiftKey){\n\t\t\t\tblock.click(false);\n\t\t\t\t\n\t\t\t// Shift-clicking flags the block.\n\t\t\t} else {\n\t\t\t\tblock.rightClick(false);\n\t\t\t}\n\t\t});\n\n\t\t// Right-clicking flags the block.\n\t\t$('.block').contextmenu(function() {\n\t\t\tlet row = $(this).parent().index();\n\t\t\tlet column = $(this).index();\n\t\t\tgetBlock(row, column).rightClick(false);\n\t\t});\n\t}","title":""},{"docid":"0d43a2e9c1a4e112cc1b54b924dea82c","score":"0.68176556","text":"function createGrid(x, y) {\n // Setting the CSS variables\n document.documentElement.style.setProperty('--numCol', x);\n document.documentElement.style.setProperty('--numRow', y);\n let board = document.createElement('div')\n board.setAttribute('id', 'wrapper')\n bodyDoc.appendChild(board);\n\n for (let i = 0; i < (x * y); i++) {\n newDiv = document.createElement('div');\n newDiv.classList.add('block');\n newDiv.setAttribute('id', (i + 1));\n board.appendChild(newDiv);\n }\n\n createCleanButton();\n}","title":""},{"docid":"886f05e577dd169e0276611b32301bc6","score":"0.6811965","text":"function grid() {\n //loop for grid\n for(let i = 0; i < 256; i++) {\n let item = document.createElement('div')\n item.classList.add('gridItem')\n item.style.border = '1px solid white';\n \n // add to the container\n gridContainer.appendChild(item);\n }\n}","title":""},{"docid":"f0574f3e4cd8ba2d091f8ee14f0811b2","score":"0.68106735","text":"function grid(sizeX,sizeY)\r\n{\r\n this.caseSizeX = WIDTH/sizeX;\r\n this.caseSizeY = HEIGHT/sizeY;\r\n this.ID = 0;\r\n this.caseGrid = new Array();\r\n for(var i =0;i<sizeX;i++)\r\n this.caseGrid[i] = new Array();\r\n for(var i = 0;i<sizeX;i++)\r\n {\r\n for(var j=0;j<sizeY;j++)\r\n {\r\n this.caseGrid[i][j] = new gridCase(i*this.caseSizeX,j*this.caseSizeY,this.caseSizeX,this.caseSizeY,\"DEAD\");\r\n }\r\n }\r\n this.size = new Object();\r\n this.sizeX =sizeX;\r\n this.sizeY = sizeY;\r\n}","title":""},{"docid":"6b77fef295728f25962ffea126969fa3","score":"0.6809633","text":"function Grid(width, height) {\n this.space = new Array(width * height); // area of the grid as an array. Note how the grid is translated from a two dimensional string (as shown above in the plan array) to an array of one dimension. \n this.width = width;\n this.height = height;\n}","title":""},{"docid":"57f3e92bf318e346a96a1ad70c5e5b05","score":"0.67984366","text":"function intializeGrids() {\n let worldrow = this.worldSize.row;\n for (let row = 0; row < worldrow; row++) {\n let worldcol = this.worldSize.col;\n let matrix = [];\n matrix[row] = [];\n for (let col = 0; col < worldcol; col++) {\n matrix[row][col] = document.createElement(\"div\");\n matrix[row][col].style[\"grid-area\"] = `${row + 1} / ${col + 1} / ${\n row + 2\n } / ${col + 1}`;\n matrix[row][col].setAttribute(\"data-row\", row + 1);\n matrix[row][col].setAttribute(\"data-col\", col + 1);\n matrix[row][col].classList.add(\"tile\");\n if (row < 13) {\n matrix[row][col].classList.add(this.comp.main);\n } else if (row < 14) {\n matrix[row][col].classList.add(this.comp.element4.el);\n } else {\n matrix[row][col].classList.add(this.comp.element1.el);\n }\n this.gameWorld.appendChild(matrix[row][col]);\n }\n }\n}","title":""},{"docid":"eb5a27a82e70cafe33c57e538240ba5e","score":"0.6798139","text":"function Grid(cellList) {\n this.cellList = cellList;\n}","title":""},{"docid":"5345cec1985ee21a45bf23370b378684","score":"0.67942667","text":"function defaultGrid() {\n makeRows(100);\n makeColumns(50);\n}","title":""},{"docid":"07e806a4f43f71984e819c4d0b9d8c7a","score":"0.67900527","text":"initCells() {\n for (let rowIdx = 0; rowIdx < this.degree * this.degree; rowIdx++) {\n let row = this.table.insertRow();\n this.grid.push([]);\n for (let colIdx = 0; colIdx < this.degree * this.degree; colIdx++) {\n let cell = row.insertCell();\n this.grid[rowIdx].push(cell);\n cell.classList.add(\"sudoku-cell\");\n\n // add sudoku-top, sudoku-bottom, sudoku-left, sudoku-right CSS classes\n function setEdgeClasses(idx, degree, firstSuffix, lastSuffix) {\n if (idx % degree === 0)\n cell.classList.add(\"sudoku-\" + firstSuffix);\n else if (idx % degree === degree - 1)\n cell.classList.add(\"sudoku-\" + lastSuffix);\n }\n setEdgeClasses(rowIdx, this.degree, \"top\", \"bottom\");\n setEdgeClasses(colIdx, this.degree, \"left\", \"right\");\n }\n }\n }","title":""},{"docid":"e151e1d34d3d1d34e76ed7ca5675262c","score":"0.67888397","text":"_createGrid (type, cols, rows) {\n\t\tlet grid = [],\n\t\t\ttile;\n\t\tfor (let i = 0; i < cols; i++) {\n\t\t\tlet row = [];\n\t\t\tfor (let j = 0; j < rows; j++) {\n\t\t\t\tlet random = Math.random();\n\t\t\t\t// Creates border around map\n\t\t\t\t// i controls height and j controls width; below set to 8 because glitch if set to 7\n\t\t\t\tif (i < 7 || j < 7 || i > this.state.mapSize - 8 || j > this.state.mapSize - 7) {\n\t\t\t\t\ttile = 'R';\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\t// Adjust to generate random obstacles for testing\n\t\t\t\t\t// Randomly generate grass or rock on tile\n\t\t\t\t\t//tile = random > 0.4 ? '_' : 'R';\n\t\t\t\t\ttile = 'R'\n\t\t\t\t}\n\t\t\t\trow.push(tile)\n\t\t\t}\n\t\t\tgrid.push(row);\n\t\t}\n\t\treturn grid\n\t}","title":""},{"docid":"061b4ac84617c38705fccc2a8dd7415d","score":"0.67844236","text":"__buildGrid() {\n var grid = [];\n var colSpans = [];\n var rowSpans = [];\n\n var maxRowIndex = -1;\n var maxColIndex = -1;\n\n var children = this._getLayoutChildren();\n\n for (var i = 0, l = children.length; i < l; i++) {\n var child = children[i];\n var props = child.getLayoutProperties();\n\n var row = props.row;\n var column = props.column;\n\n props.colSpan = props.colSpan || 1;\n props.rowSpan = props.rowSpan || 1;\n\n // validate arguments\n if (row == null || column == null) {\n throw new Error(\n \"The layout properties 'row' and 'column' of the child widget '\" +\n child +\n \"' must be defined!\"\n );\n }\n\n if (grid[row] && grid[row][column]) {\n throw new Error(\n \"Cannot add widget '\" +\n child +\n \"'!. \" +\n \"There is already a widget '\" +\n grid[row][column] +\n \"' in this cell (\" +\n row +\n \", \" +\n column +\n \") for '\" +\n this +\n \"'\"\n );\n }\n\n for (var x = column; x < column + props.colSpan; x++) {\n for (var y = row; y < row + props.rowSpan; y++) {\n if (grid[y] == undefined) {\n grid[y] = [];\n }\n\n grid[y][x] = child;\n\n maxColIndex = Math.max(maxColIndex, x);\n maxRowIndex = Math.max(maxRowIndex, y);\n }\n }\n\n if (props.rowSpan > 1) {\n rowSpans.push(child);\n }\n\n if (props.colSpan > 1) {\n colSpans.push(child);\n }\n }\n\n // make sure all columns are defined so that accessing the grid using\n // this.__grid[column][row] will never raise an exception\n for (var y = 0; y <= maxRowIndex; y++) {\n if (grid[y] == undefined) {\n grid[y] = [];\n }\n }\n\n this.__grid = grid;\n\n this.__colSpans = colSpans;\n this.__rowSpans = rowSpans;\n\n this.__maxRowIndex = maxRowIndex;\n this.__maxColIndex = maxColIndex;\n\n this.__rowHeights = null;\n this.__colWidths = null;\n\n // Clear invalidation marker\n delete this._invalidChildrenCache;\n }","title":""},{"docid":"aa6f5d0fde46a70451b30fbed94188a4","score":"0.674396","text":"function GridRenderer()\n{\n\tthis.pInstance = null;\n}","title":""},{"docid":"0bf5031ab8a3d564cc3443bd55e1442b","score":"0.672891","text":"generate_grid_css() {\n let gutter = '3';\n\n jss.set(`.${this.row_class}`, {\n width: '98%'\n });\n jss.set(`.${this.row_class}:after`, {\n clear: 'both'\n });\n jss.set(`.${this.row_class}:before, .${this.row_class}:after`, {\n display: 'table',\n 'line-height': '0',\n 'content': '\"\"'\n });\n\n jss.set(`.${this.column_class}`, {\n 'display': 'block',\n 'float': 'left',\n 'width': '100%',\n 'min-height': '30px',\n 'box-sizing': 'border-box'\n });\n\n let margin_space = (this.n_columns - 1) * gutter;\n let computable_space = 100 - margin_space;\n let minimun_column_width = computable_space / this.n_columns;\n\n for (let i = 1; i <= this.n_columns; i++) {\n let column_width = minimun_column_width * i;\n let margin_width = gutter * (i - 1);\n\n jss.set(`[data-column-size=\"${i}\"]`, {\n 'width': column_width + margin_width + '%',\n 'margin-left': gutter + '%'\n });\n }\n\n jss.set(`.${this.column_class}:nth-of-type(1)`, {\n 'margin-left': '0'\n });\n }","title":""},{"docid":"32f4079d83fcdd64810b3cbc3daff589","score":"0.6726885","text":"function createGrid(gridSize) {\n etchScreen.style.gridTemplateColumns = `repeat(${gridSize}, 1fr)`;\n etchScreen.style.gridTemplateRows = `repeat(${gridSize}, 1fr)`;\n for (let i = 0; i < gridSize * gridSize; i++){\n let cell = document.createElement(\"div\");\n cell.classList.add('cell');\n etchScreen.appendChild(cell);\n }\n\n let grid = document.querySelectorAll('.cell');\n grid.forEach ((cell) => {\n cell.addEventListener('mouseover', (e) => {\n cell.classList.add('active');\n }); \n });\n}","title":""},{"docid":"1a9710b215f54badc0eb8de8d71788d0","score":"0.6724433","text":"function _crearGrid(fila, columna){\n\n const newGridLayout = new GridLayout();\n newGridLayout.columns = pageData.getColOp; \n newGridLayout.row=fila;\n newGridLayout.col=columna;\n\n return newGridLayout;\n}","title":""},{"docid":"b5d0f946dc1ed56b79361e2ff7a1a304","score":"0.6723441","text":"function Grid(width,height){\n\tthis.width=width;\n\tthis.height=height;\n\tthis.nodes=this.makenodes(width,height);\n\tthis.hillweight=12;\n\tthis.valleyweight=1;\n\tthis.normal=5;\n}","title":""},{"docid":"08e82c952aaaed4ec3340505a04d491b","score":"0.6721336","text":"function initGrid(gridColumns = 16, gridRows = 16,\n containerWidth = 100, containerHeight = 100) {\n const gridContainer = document.querySelector(\"#grid-container\");\n gridContainer.style.gridTemplateColumns = `repeat(${gridColumns}, ${containerWidth/gridColumns}px)`;\n gridContainer.style.gridTemplateRows = `repeat(${gridRows}, ${containerHeight/gridRows}px)`;\n for (let i = 0; i < gridRows; ++i) {\n for (let j = 0; j < gridColumns; ++j) {\n const newGrid = document.createElement(\"div\");\n newGrid.classList.add(\"grid\");\n newGrid.style.width = `${containerWidth/gridColumns}px`;\n newGrid.style.height = `${containerHeight/gridRows}px`;\n newGrid.style.backgroundColor = \"#FFFFFF\";\n newGrid.addEventListener(\"mouseover\", fillGrid);\n newGrid.id = `grid${j}-${i}`;\n gridContainer.appendChild(newGrid);\n }\n }\n}","title":""},{"docid":"4eccef2bfae702d755adb117ab7e205f","score":"0.67155963","text":"function Grid(width, height, boundsWidth, boundsHeight, widthStep, heightStep) {\n\n\tthis.width = width * parseInt(widthStep);\n\tthis.height = height * parseInt(heightStep);\n\tthis.boundsWidth = boundsWidth * parseInt(widthStep);\n\tthis.boundsHeight = boundsHeight * parseInt(heightStep);\n\tthis.widthStep = widthStep;\n\tthis.heightStep = heightStep;\n\tthis.cells = [];\n\tthis.container = $('#grid');\n\tthis.parentContainer = $('#boundsForGrid');\n\tthis.cellSelected = false;\n this.acceptKeyPress = false\n\tthis.init();\n}","title":""},{"docid":"d95552b02ef2097ab138b0bd4ccbba64","score":"0.6701398","text":"function createGrid(array) {\n array.forEach(obj => createTile(obj));\n document.getElementById('dino-compare').style.display = 'none';\n document.getElementById('grid').style.display = 'flex';\n }","title":""},{"docid":"14d4fd18902704505249bd609d3388ee","score":"0.66956353","text":"function Grid(width, height) {\n this.space = new Array(width * height);\n this.width = width;\n this.height = height;\n}","title":""},{"docid":"9153ed0610ec5710725e3c3d47cc667d","score":"0.66943413","text":"function makeGrid() {\n CANVAS.find('tbody').remove();\n\n // \"submit\" the size form to update the grid size\n let gridRows = heightInput.val();\n let gridCol = widthInput.val();\n\n // set tbody to the table\n CANVAS.append('<tbody></tbody>');\n\n let canvasBody = CANVAS.find('tbody');\n\n // draw grid row\n for (let i = 0; i < gridRows; i++) {\n canvasBody.append('<tr></tr>');\n }\n\n // draw grid col\n for (let i = 0; i < gridCol; i++) {\n CANVAS.find('tr').append('<td class=\"transparent\"></td>');\n }\n\n }","title":""},{"docid":"d5ea0614c42f44136a75b56ea5080c67","score":"0.66924417","text":"function createGrid(rows, columns) {\n gridContainer.style.setProperty(\"--grid-rows\", rows);\n gridContainer.style.setProperty(\"--grid-columns\", columns);\n\n for (let i = 0; i < rows * columns; i++) {\n let cell = document.createElement(\"div\");\n cell.className = \"grid-cell\";\n gridContainer.appendChild(cell);\n }\n}","title":""},{"docid":"69f8efaefa5475275f4cb00d293a7858","score":"0.6688942","text":"function createGrid() {\n\t\tvar positions = [],\n\t\t\ti,\n\t\t\tj;\n\t\t\n\t\t// Go through each row.\n\t\tfor ( i = 0; i < 8; i++ ) {\n\t\t\t// Go through each button in row.\n\t\t\tfor ( j = 0; j < 8; j++ ) {\n\t\t\t\tpositions.push( i * 16 + j );\n\t\t\t}\n\t\t}\n\t\t\n\t\t// Return positions.\n\t\treturn positions;\n\t}","title":""},{"docid":"949fb1214e4eaa7de280ccef4b1cc31c","score":"0.6683842","text":"function createGameGrid() {\n for (let y = CELL_SIZE.height + 10; y <= 6 * CELL_SIZE.height; y += CELL_SIZE.height) {\n for (let x = 3 * CELL_SIZE.width; x <= 11 * CELL_SIZE.width; x += CELL_SIZE.width) {\n gameGrid.push(new Cell(x, y))\n }\n }\n}","title":""},{"docid":"efe1566abad1d6940109c300e8ef9a4e","score":"0.66798645","text":"generateGrid() {\n let board = document.getElementsByClassName(\"board\")[0];\n let totalCells = this.gridSize * this.gridSize;\n for (let i = 0; i < totalCells; i++) {\n console.log(i, \"I\");\n let tile = document.createElement(\"div\");\n tile.className = \"tile\";\n console.log(tile, \"TILE\");\n board.appendChild(tile);\n }\n }","title":""},{"docid":"f30b862633583e5bf35f2c8811b7ae66","score":"0.6670902","text":"function createGrid(gridSize = 20){\n initializeSlider(gridSize);\n sketchContainer.setAttribute('style',`grid-template-columns: repeat(${gridSize}, 1fr);, grid-template-rows: repeat(${gridSize}, 1fr);` )\n appendPixels(gridSize);\n}","title":""},{"docid":"d838cf7b03e017c1472e21a21cb12219","score":"0.6663743","text":"function buildGrid(size) {\r\n for (let i = 0; i < size ** 2; i++) {\r\n let square = document.createElement('div');\r\n square.className = \"square\";\r\n GRID.appendChild(square);\r\n }\r\n enableGrid()\r\n}","title":""},{"docid":"24a1996cd11ed29cce9bb2aa1ec40708","score":"0.66600376","text":"function createGrid(num) {\n var gridNum = num\n var divNodeSize = 320 / num;\n \n //Removes any .div-wrapper from the page\n $(\".div-wrapper\").each(function() {\n $(this).remove();\n });\n \n //Adds a .div-wrapper then loops through adding num .div-wrapper(s) every num .div-node(s)\n $(\"#div-grid\").append(\"<div class = 'div-wrapper' </div>\");\n for (var i = 0; i < gridNum; i++) {\n for (var j = 0; j < gridNum; j++) {\n $(\".div-wrapper\").last().append(\"<div class = 'div-node' </div>\");\n }\n $(\"#div-grid\").append(\"<div class = 'div-wrapper' </div>\");\n }\n \n //CSS styling ensures the #div-grid size remains constant and the .div-nodes are square\n $(\".div-node\").css(\"height\", divNodeSize);\n $(\".div-node\").css(\"width\", divNodeSize);\n $(\".div-node\").css(\"background-color\", backgroundOrigin);\n \n colorStay();\n}","title":""},{"docid":"cecbad5cbe5942017e28089a89fa64df","score":"0.6656861","text":"function createBoard () {\n for (let i = 0; i < layout.length; i++) {\n const square = document.createElement ('div')\n grid.appendChild(square)\n squares.push(square)\n\n // add layout to the board\n\n if(layout[i] === 1) {\n squares[i].classList.add('wall')\n } else if (layout[i] === 2) {\n squares[i].classList.add('ghost-lair')\n } else if (layout[i]=== 3) {\n squares[i].classList.add('power-pellet')\n } else if (layout[i] === 4) {\n squares[i].classList.add('pac-dot')\n }\n }\n}","title":""},{"docid":"bfbcc88cf2de50eac2caea46b48675fc","score":"0.66353303","text":"function createNewGrid(size){\n container.setAttribute(\n \"style\", `display: grid; background-color: white; grid-template-columns: repeat(${newGridSize}, 1fr); grid-template-rows: repeat(${newGridSize}, 1fr); width: 75vmin;\n height: 75vmin;`);\n for (var i = 0; i < (`${newGridSize}` * `${newGridSize}`); i++) {\n let cell = document.createElement('div');\n cell.setAttribute(\"id\", i);\n cell.setAttribute(\"class\", \"cell\")\n container.appendChild(cell);\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"52056d0689414f518fcf33688752104b\",\n \"score\": \"0.7925451\",\n \"text\": \"function createGrid(){\\n for (var j = 0; j < rows; j++) {\\n for (var i = 0; i < cols; i++) {\\n var cell = new Cell(i, j, w);\\n cell = makeCellProperty(cell, j, i);\\n grid.push(cell);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d99aec89fb428a740e316433067ba75\",\n \"score\": \"0.78829706\",\n \"text\": \"function Grid() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"718dc8e66102c189292f708634399c00\",\n \"score\": \"0.7642126\",\n \"text\": \"function createGrid() {\\n for (let i=0; i < layout.length; i++) {\\n const square = document.createElement('div');\\n grid.appendChild(square);\\n squares.push(square);\\n\\n // add layout to the board\\n if (layout[i] === 0) {\\n squares[i].classList.add('pac-dot', 'dot');\\n } else if (layout[i] === 1) {\\n squares[i].classList.add('wall');\\n } else if (layout[i] === 2) {\\n squares[i].classList.add('ghost-lair')\\n } else if (layout[i] === 3) {\\n squares[i].classList.add('power-pellet');\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f797501ad3ac0b322736bc14ebd11305\",\n \"score\": \"0.75573134\",\n \"text\": \"function Grid() {\\n\\t\\tthis.rows = [];\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7fbbb5e9154230a7da07160f8ddb5857\",\n \"score\": \"0.7507087\",\n \"text\": \"constructor() {\\r\\n this.grid = [];\\r\\n this.rows = 0;\\r\\n this.cols = 0;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9168cc199b9e136c3a7aec208f22e0c\",\n \"score\": \"0.7500231\",\n \"text\": \"constructor() {\\n this.grid = [];\\n this.rows = 0;\\n this.cols = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da3d76d5d90ad961e9bb7836fdfb85c0\",\n \"score\": \"0.7483778\",\n \"text\": \"gridCreate() {\\n const grid = [];\\n for (let x = 0; x < this.sizeX; x++) {\\n grid[x] = [];\\n for (let y = 0; y < this.sizeY; y++) {\\n grid[x][y] = 0;\\n }\\n }\\n\\n this.Grid = grid;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6086d8c8f6caea1c780a4db859175b2f\",\n \"score\": \"0.74627477\",\n \"text\": \"function createAbstractGridPanels (params) {\\n\\n\\t /////////////////////////////////\\n\\t var x = params.x;\\n \\t var y = params.y;\\n \\t var height = params.height;\\n \\t var width = params.width;\\n \\t var AmountX = params.AmountX;\\n \\t var AmountY = params.AmountY;\\n\\n\\t /////////////////////////////////\\n\\n\\n\\n\\tvar i,j;\\n var x1 = x;\\n var y1 = y;\\n var pm = 0;\\n var all = 0;\\n\\n\\t\\tvar grid = new Array();\\n\\n\\nfor (j=0;j < (AmountY) ;j++) {\\n\\n for (i=0;i < (AmountX) ;i++) {\\n\\n pm = ((width/AmountX)*i);\\n\\n x1 = (x+pm);\\n y1 = (y+((height/AmountY)*j));\\n\\n grid[all] = {x1: x1, y1: y1};\\n all++;\\n\\n }\\n\\n}\\n\\nreturn grid;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05317f987c81265d27f598a42263a4fd\",\n \"score\": \"0.74231374\",\n \"text\": \"function createAbstractGrid (params) {\\n\\n\\t//params: x,y,height,width,AmountX,AmountY\\n\\n\\tvar x = params.x;\\n\\tvar y = params.y;\\n\\tvar height = params.height;\\n\\tvar width = params.width;\\n\\tvar AmountX = params.AmountX;\\n\\tvar AmountY = params.AmountY;\\n\\n\\tvar i,j;\\n\\tvar x1 = x;\\n\\tvar y1 = y;\\n\\tvar x2;\\n\\tvar y2;\\n\\tvar pm = 0;\\n\\tvar all = 0;\\n\\tvar offset = 0;\\n\\tvar border = 0;\\n\\n\\tvar grid = new Array();\\n\\n for (i=0;i <= (AmountX) ;i++) {\\n\\n\\t pm = ((width/AmountX)*i);\\n\\t x1 = (x+pm);\\n\\t y1 = y;\\n\\n\\t\\t\\t\\t\\tx2 = x1;\\n\\t y2 = (y+height);\\n\\n\\t\\t\\t\\t\\tgrid[all] = {x1: x1, y1: y1, x2: x2, y2: y2};\\n\\t all++;\\n\\n }\\n\\n\\t for (j=0;j <= (AmountY) ;j++) {\\n\\n pm = ((height/AmountY)*j);\\n\\t\\t\\t\\t x1 = x;\\n\\t\\t\\t\\t y1 = (y+pm);\\n\\n\\t\\t\\t\\t x2 = (x+width);\\n\\t\\t\\t\\t y2 = y1;\\n\\n\\t\\t grid[all] = {x1: x1, y1: y1, x2: x2, y2: y2};\\n\\t\\t all++;\\n\\n\\t }\\n\\nreturn grid;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45816b78609a50d984637c200cfb1f58\",\n \"score\": \"0.74115014\",\n \"text\": \"create_grid() {\\n let table = document.createElement('table');\\n this._cells = [];\\n\\n for (var i = 0; i < this._rows; i++) {\\n let line = document.createElement('tr');\\n this._cells[i] = [];\\n for (let j = 0; j < this._columns; j++) {\\n let cell = new Cell();\\n\\n line.appendChild(cell.element);\\n this._cells[i][j] = cell;\\n }\\n table.appendChild(line);\\n }\\n\\n this._table.appendChild(table);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0bf509968b35c584459a39859f62b56\",\n \"score\": \"0.7372793\",\n \"text\": \"createGrid() {\\n let gridRow;\\n let gridRowVisited;\\n // let totalRows = this.#width / this.#cellSize;\\n // let totalCols = this.#height / this.#cellSize;\\n for (let row = 0; row < this.#height; row++) {\\n gridRow = [];\\n gridRowVisited = [];\\n for (let col = 0; col < this.#width; col++) {\\n gridRow[col] = new Cell(this.#cellSize, row, col);\\n gridRowVisited[col] = false;\\n }\\n this.#girdArray[row] = gridRow;\\n this.#visited[row] = gridRowVisited;\\n }\\n\\n // Mark the initial cell top-left cell as visited\\n this.#visited[0][0] = true;\\n\\n this.#girdArray[0][0].setIsVisited();\\n\\n // Add the top left cell to the stack\\n // so that the stack won't be empty.\\n this.#stack.pushData(this.#girdArray[0][0]);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45fe0d359823e4e4e6d12ea23992babe\",\n \"score\": \"0.73622036\",\n \"text\": \"createGrid(gamegrid) {\\r\\n this.dotCount = 0;\\r\\n this.grid = [];\\r\\n this.DOMGrid.innerHTML = \\\"\\\";\\r\\n // First set correct amount of columns based on Grid Size and the size of each cell is based on Cell Size\\r\\n this.DOMGrid.style.cssText = `grid-template-columns: repeat(${GRID_SIZE}, ${CELL_SIZE}px);`;\\r\\n\\r\\n //loop through the gaemboard array, and create each element in the array\\r\\n gamegrid.forEach((square) => {\\r\\n const div = document.createElement(\\\"div\\\");\\r\\n\\r\\n //check value of current element and match it to classlist to get what object it's supposed to be\\r\\n div.classList.add(\\\"square\\\", CLASS_LIST[square]);\\r\\n div.style.cssText = `width: ${CELL_SIZE}px; height: ${CELL_SIZE}px;`;\\r\\n this.DOMGrid.appendChild(div);\\r\\n this.grid.push(div);\\r\\n\\r\\n // Add dots, keep track of the number of dots\\r\\n if (CLASS_LIST[square] === OBJECT_TYPE.DOT) this.dotCount++;\\r\\n });\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07c69556055950d62ceefd3040bfa5dc\",\n \"score\": \"0.735816\",\n \"text\": \"function createAbstractGridNodes (params) {\\n\\n\\t /////////////////////////////////\\n\\n\\t var x = params.x;\\n \\t var y = params.y;\\n \\t var height = params.height;\\n \\t var width = params.width;\\n \\t var AmountX = params.AmountX;\\n \\t var AmountY = params.AmountY;\\n\\n\\t /////////////////////////////////\\n\\n\\n\\n\\t\\tvar i,j;\\n var x1 = x;\\n var y1 = y;\\n var pm = 0;\\n var all = 0;\\n var offset = 0;\\n var border = 0;\\n\\n\\t\\tvar grid = new Array();\\n\\nfor (j=offset;j <= (AmountY+border) ;j++) {\\n\\n for (i=offset;i <= (AmountX+border) ;i++) {\\n\\n pm = ((width/AmountX)*i);\\n x1 = (x+pm);\\n y1 = (y+((height/AmountY)*j));\\n\\n grid[all] = {x1: x1, y1: y1};\\n all++;\\n\\n }\\n\\n}\\n\\nreturn grid;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8091f17361b095431ef130009689f0c1\",\n \"score\": \"0.73541343\",\n \"text\": \"createGrid(){\\n\\t\\tconst grid = [];\\n\\n\\t\\tfor(let i = 0; i < this.size; i++){\\n\\t\\t\\tconst row = [];\\n\\n\\t\\t\\tfor(let j = 0; j < this.size; j++){\\n\\t\\t\\t\\trow.push(new Cell());\\n\\t\\t\\t}\\n\\t\\t\\tgrid.push(row);\\n\\t\\t}\\n\\n\\t\\treturn grid;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"863f92287063873feed1120b8abed647\",\n \"score\": \"0.7339761\",\n \"text\": \"initialize(grid){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28521b80f1f9e3f9d8dd201c4ca63e66\",\n \"score\": \"0.73147345\",\n \"text\": \"function Grid() {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a05be37a29690108f8fbd4508737212\",\n \"score\": \"0.72700906\",\n \"text\": \"function Grid() { \\n this.BLOCK_SCALER = 0.045; //percent of height a block should be\\n \\n this.position_x = 10;\\n this.position_y = 10;\\n \\n this.BORDER_WIDTH = 3;\\n \\n this.gridData = this.generateEmptyGrid();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"567fd81b5db131c0fa77957db55cff4a\",\n \"score\": \"0.7221458\",\n \"text\": \"GridStyle(total_x, total_y, w, h, srcImage_Path)\\n {\\n\\n if(!(this.grid instanceof Array))\\n {\\n this.grid = [];\\n }\\n\\n function GridUnit(x, y, w, h, srcImage_Path){\\n\\n var size = new Gamelab.Vector(w, h),\\n position = new Gamelab.Vector(x, y);\\n\\n var sprite;\\n\\n if(srcImage_Path)\\n {\\n sprite = new Gamelab.Sprite(srcImage_Path);\\n sprite.Size(size);\\n sprite.Pos(position);\\n\\n Gamelab.game_windows[0].add(sprite);\\n }\\n\\n return {\\n size:size,\\n position:position\\n };\\n };\\n\\n for(var y = 0; y < total_y; y++)\\n {\\n\\n for(var x = 0; x < total_x; x++)\\n {\\n\\n this.grid.push(new GridUnit(x * w, y * h, w, h, srcImage_Path));\\n\\n }\\n\\n }\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1219affe9a5655510324920fd381ef1b\",\n \"score\": \"0.721846\",\n \"text\": \"function createGrid (params) {\\n\\n\\n\\t var el = params.el;\\n\\t\\tvar layer = params.layer;\\n\\t\\tvar transform = params.transform;\\n\\t\\tvar x = params.x;\\n \\tvar y = params.y;\\n\\t\\tvar height = params.height;\\n\\t\\tvar width = params.width;\\n\\t\\tvar AmountX = params.AmountX;\\n\\t\\tvar AmountY = params.AmountY;\\n\\t\\tvar style = params.style;\\n\\n\\n\\n\\t\\tparams = {x:x,y:y,height:height,width:width,AmountX:AmountX,AmountY:AmountY};\\n\\t var AbstractGrid =createAbstractGrid(params);\\n\\n\\n\\t\\tvar grid = el.g({layer:layer, transform:transform});\\n\\n\\n for (i=0; i<AbstractGrid.length;i++) {\\n\\n params = {layer: grid.id, x1 : AbstractGrid[i].x1, y1: AbstractGrid[i].y1, x2: AbstractGrid[i].x2, y2:AbstractGrid[i].y2, style: style};\\n el.line(params);\\n\\n\\t}\\n\\n return grid;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"882e76b3f7b22a49c108c26e3d66e0bb\",\n \"score\": \"0.7201928\",\n \"text\": \"function newGrid() {\\n\\tfor (var i = 0; i < 16; i++) {\\n\\t\\t\\n\\t\\t$(\\\".grid-container\\\").append( \\\"<div class=\\\" + \\\"grid-row-\\\" + i + \\\"></div>\\\");\\n\\n\\t\\tfor (var j = 0; j < 32; j++) {\\n\\t\\t\\t$(\\\".grid-row-\\\" + i).append(\\\"<div class=grid-elem></div>\\\");\\n\\t\\t}\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c4868b04bcf190f4adbbdaae4e86c35\",\n \"score\": \"0.716425\",\n \"text\": \"function grid(top,left){ //,width,height\\n this.top = top;\\n this.left = left;\\n //Store in board since width and height is same for all grids.\\n //Dont store width height here.\\n // this.w = width;\\n // this.h = height;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3fa41e869aef62980055f4913331c27\",\n \"score\": \"0.71577024\",\n \"text\": \"function createGrid() {\\n\\t\\tfor(var i = 1; i < Math.pow(rAndC, 2); i++) {\\n\\t\\t\\tvar box = document.createElement(\\\"div\\\");\\n\\t\\t\\tbox.className = \\\"box\\\";\\n\\t\\t\\tdocument.getElementById(\\\"puzzlearea\\\").appendChild(box);\\t\\n\\t\\t}\\n\\t\\tstyleBoxes();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2fdb36c89c79c1ab935dd7f6b441a16\",\n \"score\": \"0.71308196\",\n \"text\": \"function makeGrid(rows, cols) {\\n container.style.setProperty('--grid-rows', rows);\\n container.style.setProperty('--grid-cols', cols);\\n for(i=0; i < rows*cols; i++) {\\n let item = document.createElement(\\\"div\\\");\\n container.appendChild(item).className = \\\"grid-item\\\";\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c7d3a83078013e9b3906414ab7d096c\",\n \"score\": \"0.70996404\",\n \"text\": \"gridSetup() {\\n this.grid = [];\\n this.temp = [];\\n //create canvas at appropriate size\\n this.canvas.width = (this.width - 2) * this.cellSize;\\n this.canvas.height = (this.height - 2) * this.cellSize;\\n this.ctx.fillStyle = \\\"black\\\";\\n this.ctx.fillRect(0, 0, 3000, 3000);\\n //instantiate spaces in arrays\\n for (let y = 0; y < this.height; y++) {\\n this.grid[y] = [[]];\\n this.temp[y] = [[]];\\n for (let x = 0; x < this.width; x++) {\\n //fill with random values\\n this.grid[y][x] = [Math.round(Math.random()), 0];\\n this.temp[y][x] = [0, 0];\\n //create border\\n if (x == 0 || y == 0 || x == this.width - 1 || y == this.height - 1) {\\n this.grid[y][x] = 0;\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18f05ca2733ae1c50efaee666b0d9251\",\n \"score\": \"0.70886385\",\n \"text\": \"createGrid() {\\n // loop to create the 8 rows\\n for (let row = 0; row < 8; row++) {\\n this.grid[row] = [];\\n // push in 8 columns of nulls\\n for (let column = 0; column < 8; column++) {\\n this.grid[row].push(null);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18f05ca2733ae1c50efaee666b0d9251\",\n \"score\": \"0.70886385\",\n \"text\": \"createGrid() {\\n // loop to create the 8 rows\\n for (let row = 0; row < 8; row++) {\\n this.grid[row] = [];\\n // push in 8 columns of nulls\\n for (let column = 0; column < 8; column++) {\\n this.grid[row].push(null);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bcf46a1d1099f1058390f9f2a23a015\",\n \"score\": \"0.70827866\",\n \"text\": \"function createGrids(){\\n var no_keys = 8;\\n var title = [\\\"RGB-audio-peak-visualiser\\\",\\\"whatmovie-php\\\",\\\"xor_openvpn_bash\\\",\\\"mouseshiver\\\",\\\"CSGO_SIMPLE_EXTERNAL\\\",\\\"photoorganiser\\\",\\\"ticket-collector\\\",\\\"whatmovie-js\\\"]\\n var description = [\\\"A C++/C# application that loopbacks the playback output to create a visualiser with RGB strips.\\\",\\\"Original movie reccomendation generator written in PHP using themoviedb API.\\\",\\\"Creates a OXR OpenVPN server on Linux.\\\",\\\"Moves the mouse according to the microphone input level.\\\",\\\"External Code for Counter-Strike: Global Offensive.\\\",\\\"Organises a mass of photos into corresponding files.\\\",\\\"Bot to get tickets automatically.\\\",\\\"Old website ported and removed redundent dependencies. \\\"]\\n var language = [\\\"Python\\\",\\\"PHP\\\",\\\"Bash\\\",\\\"C++/Python\\\",\\\"C++\\\",\\\"Python\\\",\\\"JS\\\",\\\"JS\\\"]\\n\\n // Rows\\n row_iter = 0\\n for(x = 0; x < (no_keys - no_keys % 4)/4; x++){\\n // Columns\\n for(col=1; col < 5; col++){\\n generateBlock(\\\"column\\\"+col.toString(), title[row_iter], description[row_iter] , language[row_iter]);\\n row_iter +=1\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52b6f293050ba018bc43e1092d9a0166\",\n \"score\": \"0.7078038\",\n \"text\": \"function gridCreation() {\\n $('.wrapper').append('<div class=\\\"neon-wrapper\\\"><div class=\\\"neon-text\\\">2048</div></div>');\\n $('.wrapper').after('<div class=\\\"score\\\">Score : ' + '<span id=\\\"newScore\\\">' + score + '</span>' + '</div>');\\n for (var rows = 0; rows < 4; rows++) {\\n for (var columns = 0; columns < 4; columns++) {\\n $('#container').append('<div class=\\\"grid\\\" id=\\\"' + rows + columns + '\\\"></div>');\\n };\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eaceb82ad861585db07ea46be57d841\",\n \"score\": \"0.7072934\",\n \"text\": \"function buildGrid(width, height, id, columnClassName, cellClassName) {\\n const grid = document.createElement('div');\\n // Create number of columns based upon \\\"width\\\":\\n for (let i = 0; i < width; i++) {\\n const column = document.createElement('div');\\n column.className = columnClassName;\\n // Create number of cells based upon \\\"height\\\":\\n for (let j = 0; j < height; j++) {\\n const cell = document.createElement('div');\\n cell.className = cellClassName;\\n cell.style.background = 'rgb(255, 255, 255)'; // All cells start white\\n // Apply data attributes only to \\\"canvas\\\" grid (used in applying fill):\\n if (id === 'canvas') {\\n addCellAttributes(cell, i, j);\\n }\\n column.appendChild(cell);\\n }\\n grid.appendChild(column);\\n }\\n grid.id = id;\\n return grid;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a77ba9f2b35916bda19486c5f9f00a2\",\n \"score\": \"0.7065965\",\n \"text\": \"function createGrid() {\\n for (let y = cellSize; y < canvas.height; y += cellSize) {\\n for (let x = 0; x < canvas.width; x += cellSize) {\\n grid.push(new Cell(x, y)) //create new cell\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d96a740e7d7adfdd0272af0d7ed36d48\",\n \"score\": \"0.7060533\",\n \"text\": \"function initialGrid(){\\n for (var i = 0; i < 256; i++) {\\n let cell = document.createElement('div');\\n cell.setAttribute(\\\"id\\\", i);\\n cell.setAttribute(\\\"class\\\", \\\"cell\\\")\\n container.appendChild(cell);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"093e30a6d10937854191d31c96acd774\",\n \"score\": \"0.705077\",\n \"text\": \"function Grid() {\\n this.cells = new Array(9);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34983d118adc8809dd0fb77e1f7c1541\",\n \"score\": \"0.70377487\",\n \"text\": \"initialise_grid(element) {\\n const [width, height] = [document.body.offsetWidth, document.body.offsetHeight];\\n this.grid = new DOM.Canvas(null, width, height, { class: \\\"grid\\\" });\\n element.add(this.grid);\\n this.update_grid();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7cd1593d69b95dcef65f7d1c51b7c4cb\",\n \"score\": \"0.7027327\",\n \"text\": \"function createGrid(gridSize){\\n createRow(gridSize);\\n createCells(gridSize);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f05ec71adb491b2aea82963113353909\",\n \"score\": \"0.70269346\",\n \"text\": \"function makeGrid() {\\n\\n for (var h = 0; h < height; h++) {\\n let row = canvas.insertRow(h);\\n\\n for (var w = 0; w < width; w++) {\\n let cell = row.insertCell(w);\\n }\\n }\\n\\n } //End of makeGrid function\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c884e7a2edd3b1aa3c28b1ba8d84884f\",\n \"score\": \"0.7026639\",\n \"text\": \"loadGrid(){\\r\\n for(var i = 0; i < this.cols; i++){ // columns of rows\\r\\n this.grid[i] = [];\\r\\n for(var j = 0; j < this.rows; j++){\\r\\n this.grid[i][j] = new Cell(this, vector2d((i*this.w), (j*this.w)), ++cellId);\\r\\n\\r\\n }\\r\\n }\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"678f329cc418005407995e31cbd7087a\",\n \"score\": \"0.7022549\",\n \"text\": \"function gridMaker(row,col){\\n \\n //set css variable for grid rows and grid col\\n gridContainer.style.setProperty('--grid-rows',row);\\n gridContainer.style.setProperty('--grid-cols',col); \\n //loop for number of cells in grid\\n console.log(row)\\n console.log(col)\\n for(let i = 0;i < (row*col);i++){\\n //create a cell div for the grid\\n const cell = document.createElement('div');\\n //add textcontent to div\\n // cell.textContent = 'x';\\n //append div to gridContainer with classs\\n gridContainer.appendChild(cell).className = \\\"grid-item\\\";\\n }\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fdb078f74b643a155862751953ebe015\",\n \"score\": \"0.70214385\",\n \"text\": \"function makeGrid() {\\n // Set Canvas size as N by M grid\\n let gridHeight = INPUT_HEIGHT.val();\\n let gridWidth = INPUT_WIDTH.val();\\n\\n /* Max value = 50(for higher values) */\\n if (gridHeight > 40) {\\n gridHeight = 40;\\n }\\n\\n if (gridWidth > 40) {\\n gridWidth = 40;\\n }\\n\\n // Clear the canvas\\n CANVAS.empty();\\n\\n //Make rows (1 row per height)\\n for (let lines = 0; lines < gridHeight; lines++) {\\n const line = $(\\\"<tr></tr>\\\");\\n CANVAS.append(line);\\n\\n //Make columns (1 column in each row)\\n for (let columns = 0; columns < gridWidth; columns++) {\\n line.append(\\\"<td></td>\\\");\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"478a4180a02ba661d0774e3fd9fe0828\",\n \"score\": \"0.7020364\",\n \"text\": \"function GridClass(width, height, name, args){\\n\\tvar self = this;\\n\\tthis.add_bound_properties(this, ['get_target', 'mask', 'add_control', 'controls', 'receive', 'get_button', 'reset', 'clear_buttons', 'sub_grid', 'clear_translations', 'button_coords']);\\n\\t//lcl_debug('making GridClass:', width, height, name, args, this._bound_properties);\\n\\t//this._bound_properties = ['receive'];\\n\\tvar contents = [];\\n\\tfor(var i = 0; i < width; i++){\\n\\t\\tcontents[i] = [];\\n\\t\\tfor(var j = 0; j < height; j++){\\n\\t\\t\\tcontents[i][j] = undefined;\\n\\t\\t}\\n\\t}\\n\\tthis._grid = contents;\\n\\tthis.width = function(){return width;}\\n\\tthis.height = function(){return height;}\\n\\tthis.size = function(){return width * height;}\\n\\tGridClass.super_.call(this, name, args);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97b1780cd04243754609fd9aedefa919\",\n \"score\": \"0.7015143\",\n \"text\": \"function Grid() {\\n\\tthis.grid = createArray(GRID_SIZE);\\n\\tfor (var i = 0; i < GRID_SIZE; i++){\\n\\t\\tif (i == 0) {\\n\\t\\t\\tthis.grid[i] = TOP_LABEL;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tfor (var j = 0; j < GRID_SIZE; j++){\\n\\t\\t\\tif (j == 0){\\n\\t\\t\\t\\tthis.grid[i][j] = SIDE_LABEL[i];\\n\\t\\t\\t} else {\\n\\t\\t\\tthis.grid[i][j] = EMPTY_SPACE;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn this.grid;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8fbddedc49450760e00e944708f586e\",\n \"score\": \"0.7000697\",\n \"text\": \"function makeGrid(width,height) {\\n\\tmakeRows(height);\\n\\tfillRows(width);\\n\\tstyleBorder();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c56dd5a43e75aec0b8136d176fa1a141\",\n \"score\": \"0.69821644\",\n \"text\": \"createGrid() {\\n // loop to create the 8 rows\\n for (let row = 0; row < 8; row++) {\\n this.grid[row] = [];\\n // push in 8 columns of nulls\\n for (let column = 0; column < 8; column++) {\\n this.grid[row].push(null);\\n } \\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00a1c059f5fa689db6d28cf6146400e8\",\n \"score\": \"0.6963781\",\n \"text\": \"function Grid() {\\n $.jqplot.ElemContainer.call(this);\\n // Group: Properties\\n \\n // prop: drawGridlines\\n // whether to draw the gridlines on the plot.\\n this.drawGridlines = true;\\n // prop: gridLineColor\\n // color of the grid lines.\\n this.gridLineColor = '#cccccc';\\n // prop: gridLineWidth\\n // width of the grid lines.\\n this.gridLineWidth = 1.0;\\n // prop: background\\n // css spec for the background color.\\n this.background = '#fffdf6';\\n // prop: borderColor\\n // css spec for the color of the grid border.\\n this.borderColor = '#999999';\\n // prop: borderWidth\\n // width of the border in pixels.\\n this.borderWidth = 2.0;\\n // prop: drawBorder\\n // True to draw border around grid.\\n this.drawBorder = true;\\n // prop: shadow\\n // whether to show a shadow behind the grid.\\n this.shadow = true;\\n // prop: shadowAngle\\n // shadow angle in degrees\\n this.shadowAngle = 45;\\n // prop: shadowOffset\\n // Offset of each shadow stroke from the border in pixels\\n this.shadowOffset = 1.5;\\n // prop: shadowWidth\\n // width of the stoke for the shadow\\n this.shadowWidth = 3;\\n // prop: shadowDepth\\n // Number of times shadow is stroked, each stroke offset shadowOffset from the last.\\n this.shadowDepth = 3;\\n // prop: shadowColor\\n // an optional css color spec for the shadow in 'rgba(n, n, n, n)' form\\n this.shadowColor = null;\\n // prop: shadowAlpha\\n // Alpha channel transparency of shadow. 0 = transparent.\\n this.shadowAlpha = '0.07';\\n this._left;\\n this._top;\\n this._right;\\n this._bottom;\\n this._width;\\n this._height;\\n this._axes = [];\\n // prop: renderer\\n // Instance of a renderer which will actually render the grid,\\n // see <$.jqplot.CanvasGridRenderer>.\\n this.renderer = $.jqplot.CanvasGridRenderer;\\n // prop: rendererOptions\\n // Options to pass on to the renderer,\\n // see <$.jqplot.CanvasGridRenderer>.\\n this.rendererOptions = {};\\n this._offsets = {top:null, bottom:null, left:null, right:null};\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0dc852e9526190ceb5b621e98f6fafaa\",\n \"score\": \"0.6947224\",\n \"text\": \"function Grid() {\\n\\n /* two-dimensional dynamic grid */\\n this._grid = [[]];\\n /* always point to the last line of the grid */\\n this._x = 0;\\n /* completed elements count of current line */\\n this._y = 0;\\n\\n /* default handler */\\n this._handler = function (element, next) {\\n if (Arsenal.isFunction(element)) { element(); }\\n if (Arsenal.isFunction(next)) { next(); }\\n };\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b0ace8b0ee1fd21a2fe666adb18427b\",\n \"score\": \"0.6945931\",\n \"text\": \"constructor() {\\n this.grid = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d845457e36b9c5e40324f7f3716fc00\",\n \"score\": \"0.6934508\",\n \"text\": \"function createGrid(num) {\\n\\tfor (var i = 1; i <= num; i++) {\\n\\t\\t// creates each individual grid square\\n\\t\\tfor (var j = 1; j <= num; j++) {\\n\\t\\t\\t$('#container').append('<div class=\\\"grid\\\"></div>');\\n\\t\\t}\\n\\t\\t// creates each new row\\n\\t\\t$('#container').append('<div class=\\\"newRow\\\"></div>');\\n\\t}\\n\\n\\t// sets the grid width and height based on the number of grids fit in\\n\\t// the grid's container\\n\\tsquare = (totalLength / num) -2;\\n\\t$('#container > .grid').css({\\\"width\\\": square,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\\"height\\\": square});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a2ae3a2360ad95b140ed956aa8b6107\",\n \"score\": \"0.692754\",\n \"text\": \"function makeGrid(a) {\\n\\tgetRidGrid();\\n\\tmakeRows(a);\\n\\tmakeColumns(a);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"263b504950f80007a88cb72df20464bd\",\n \"score\": \"0.69260645\",\n \"text\": \"function createGrid() {\\n for (let y = globals.blockSize; y < canvas.height; y += globals.blockSize) {\\n for (let x = 0; x < canvas.width; x += globals.blockSize) {\\n grid.push(new Block(x, y));\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8523a199c02e53e008d4f137355a7efd\",\n \"score\": \"0.69212663\",\n \"text\": \"createDataStructure() {\\n this.grid = new Array(this.size.width);\\n\\n for (let w = 0; w < this.size.width; ++w) {\\n this.grid[w] = new Array(this.size.height).fill(false);\\n }\\n\\n this.registerStep();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c6ca47ab7be891617800bc90c94005c\",\n \"score\": \"0.6910542\",\n \"text\": \"function initialization() {\\n cols = floor(width / w)\\n rows = floor(height / w)\\n\\n for (let j = 0; j < rows; j++) {\\n for (let i = 0; i < cols; i++) {\\n let cell = new Cell(i, j)\\n grid.push(cell)\\n }\\n }\\n current = grid[0]\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f4a228f97e19b2e4cf8f2e2ea13de36\",\n \"score\": \"0.6905521\",\n \"text\": \"constructor( columns,rows ){\\n\\t\\tthis.grid = [];\\n\\t\\tthis.columns = columns;\\n\\t\\tthis.rows = rows;\\n\\t\\tthis.minMatch = 3;\\n\\t\\tthis.init();\\n\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6cc3e5822997103f8ec16ae295701b6b\",\n \"score\": \"0.69006443\",\n \"text\": \"function createGrid() {\\n for(let row = 0; row < num_rows; row++) {\\n nodes[row] = [];\\n for(let col = 0; col < num_cols; col++) {\\n nodes[row][col] = {\\n x: col *(rectWidth + 1),\\n y: row * (rectHeight + 1),\\n state: STATE.EMPTY,\\n prevState: STATE.EMPTY // used for when the start/end nodes are being moved\\n };\\n }\\n }\\n nodes[startNode.row][startNode.col].state = STATE.START;\\n nodes[finishNode.row][finishNode.col].state = STATE.FINISH;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f07d3414748d8d0366a978b61daa7f85\",\n \"score\": \"0.6898993\",\n \"text\": \"function createGrid(gridTemplate) {\\n clearContainer();\\n createDivs(gridTemplate);\\n addGridTemplate(gridTemplate[1]);\\n drawing();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22854613512cb6659efbda6b67ba55fa\",\n \"score\": \"0.68909115\",\n \"text\": \"function createGrid(){\\n var rows = 11;\\n var columns = 11;\\n var $row = $(\\\"<div />\\\", {\\n class: 'row'\\n });\\n var $square = $(\\\"<div />\\\", {\\n class: 'square'\\n });\\n\\n var letras = [\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"D\\\", \\\"E\\\", \\\"F\\\", \\\"G\\\", \\\"H\\\", \\\"I\\\", \\\"J\\\"];\\n var numeros = [];\\n\\n for (var i = 1; i < 11; i++) {\\n numeros.push(i);\\n }\\n\\n var tablero = [];\\n\\n //add columns to the the temp row object\\n for (var i = 0; i < columns; i++) {\\n var currentRow = $row.clone();\\n if(i > 0){\\n tablero.push([]);\\n }\\n\\n $('#shipPlace').append(currentRow);\\n for (var j = 0; j < rows; j++) {\\n var currentSquare = $square.clone().attr(\\\"id\\\", letras[j-1]+(i));\\n currentRow.append(currentSquare);\\n if(i > 0 && j > 0){\\n tablero[i-1].push(currentSquare);\\n }\\n if(i === 0 || j === 0){\\n currentSquare.addClass(\\\"vacio\\\");\\n }\\n if(i === 0 && j > 0){\\n currentSquare.text(letras[j-1]);\\n }\\n if(i > 0 && j === 0){\\n currentSquare.text(numeros[i-1]);\\n }\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9769d54db59dbd3a681eb40ca662b62a\",\n \"score\": \"0.6885528\",\n \"text\": \"function Grid( _num_items_horiz, _num_items_vert, _grid_w, _grid_h, _startx, _starty ) {\\n\\n if ( _num_items_horiz == undefined ) _num_items_horiz = 1;\\n if ( _num_items_vert == undefined ) _num_items_vert = 1;\\n var _horiz = _num_items_horiz || 1;\\n var _vert = _num_items_vert || 1;\\n this.length = 0;\\n this.spacing_x;\\n this.spacing_y;\\n this.c = rgb( 200 );\\n this.num_items_horiz = 0;\\n this.num_items_vert = 0;\\n\\n this.start = {\\n x: _startx || 0,\\n y: _starty || 0\\n };\\n\\n this.grid_w = this.w = _grid_w || w;\\n this.grid_h = this.h = _grid_h || h;\\n\\n this.width = _grid_w || w;\\n this.height = _grid_h || h;\\n this.centre = {\\n x: this.start.x + this.width / 2,\\n y: this.start.y + this.height / 2\\n }\\n this.grid = [];\\n this.edge = [];\\n this.x = [];\\n this.y = [];\\n this.rows = [];\\n this.cols = [];\\n this.pos = [];\\n\\n this.add = function ( _horiz, _vert ) {\\n\\n this.num_items_horiz += _horiz || 1;\\n this.num_items_vert += _vert || 1;\\n\\n this.spacing_x = this.width / this.num_items_horiz;\\n this.spacing_y = this.height / this.num_items_vert;\\n this.spacing = new Vector( this.spacing_x, this.spacing_y );\\n this.createGrid();\\n\\n return this;\\n\\n }\\n\\n\\n this.setStart = function ( _x, _y ) {\\n\\n this.start = {\\n x: _x || 0,\\n y: _y || 0\\n };\\n createGrid();\\n\\n }\\n\\n this.createGrid = function () {\\n var r = 0;\\n this.spacing_x = this.width / this.num_items_horiz;\\n this.spacing_y = this.height / this.num_items_vert;\\n this.spacing = new Vector( this.spacing_x, this.spacing_y );\\n // console.log(this.start.x);\\n // console.log(this.width);\\n this.cols = [];\\n\\n for ( var y = 0; y < this.num_items_vert; y++ ) {\\n\\n var c = 0;\\n var row = [];\\n //this.cols[y] = [];\\n var yy = y * this.spacing_y + this.spacing_y / 2 + this.start.y;\\n\\n\\n for ( var x = 0; x < this.num_items_horiz; x++ ) {\\n\\n var edge = false;\\n var xx = x * this.spacing_x + this.spacing_x / 2 + this.start.x;\\n\\n //console.log(this.start.y);\\n // see if it's a point on the outside\\n if ( ( y == this.start.y || y == this.num_items_vert ) && ( x == this.start.x || x == this.num_items_horiz ) ) {\\n edge = true;\\n }\\n\\n this.x.push( xx );\\n this.y.push( yy );\\n this.pos.push( {\\n row: r,\\n col: c,\\n x: xx,\\n y: yy\\n } );\\n row.push( {\\n x: xx,\\n y: yy\\n } );\\n\\n this.edge.push( edge );\\n this.grid.push( {\\n row: y,\\n col: x,\\n x: xx,\\n y: yy,\\n edge: edge,\\n c: this.c,\\n r: 255,\\n g: 255,\\n b: 255\\n } );\\n c++;\\n\\n }\\n\\n this.cols[ x ] = {\\n col: x,\\n x: xx,\\n y: yy,\\n };\\n this.rows[ r ] = {\\n row: r,\\n items: this.num_items_horiz,\\n pos: row\\n };\\n r++;\\n //console.log(row);\\n };\\n //console.log(this.rows);\\n this.length = this.num_items_vert * this.num_items_horiz;\\n this.grid.push( {\\n row: this.rows,\\n col: this.cols\\n } );\\n\\n }\\n\\n this.add( _horiz, _vert );\\n\\n //console.log(this);\\n return this;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33767016a92e1af18559ff5a8b074f79\",\n \"score\": \"0.68836576\",\n \"text\": \"generate() {\\n let generator = new Generator(this);\\n this.grid = generator.generate();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55c3285cb1b725793f0bd1cc45ae2aff\",\n \"score\": \"0.68817014\",\n \"text\": \"static createGameBoard(DOMGrid, gamegrid) {\\r\\n //creating the empty gameboard using the previously defined constructor\\r\\n const board = new this(DOMGrid);\\r\\n\\r\\n //populate gameboard with the hardcoded array passed in from basics\\r\\n\\r\\n board.createGrid(gamegrid);\\r\\n return board;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42873e16e4f82bf44735d6f1d59a1e03\",\n \"score\": \"0.6879884\",\n \"text\": \"function grid(rows, cols) {\\n\\tthis.rows = rows;\\n\\tthis.cols = cols;\\n\\tthis.cells = [];\\n\\tfor (i = 0; i < rows; i++) {\\n\\t\\tthis.cells[i] = {};\\n\\t\\tfor (j = 0; j < cols; j++) {\\n\\t\\t\\tthis.cells[i][j] = 0;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tthis.set = function(xpos, ypos, object_id) {\\n\\t\\tthis.cells[xpos][ypos] = object_id;\\n\\t};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff7a872032a500dcbc75eb955d11883b\",\n \"score\": \"0.68780506\",\n \"text\": \"function createGrid() {\\n // varaibles related to game logic\\n const grid = [];\\n document.documentElement.style.setProperty(\\\"--rows\\\", ROWS);\\n document.documentElement.style.setProperty(\\\"--cols\\\", COLS);\\n\\n Array(ROWS)\\n .fill(0)\\n .forEach((_, rowIndex) => {\\n const row = document.createElement(\\\"div\\\");\\n row.classList.add(\\\"flex\\\");\\n grid.push([]);\\n\\n Array(COLS)\\n .fill(0)\\n .forEach((_, colIndex) => {\\n const cell = new Cell(rowIndex, colIndex);\\n // adding cell to DOM\\n cell.create(row);\\n grid[rowIndex].push(cell);\\n });\\n\\n outerBox.appendChild(row);\\n });\\n\\n return grid;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29262a185e962a09b27b56c8f6e3454b\",\n \"score\": \"0.6868702\",\n \"text\": \"function Grid(width, height) {\\n\\t\\tthis.width = width;\\n\\t\\tthis.height = height;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1917df1f4934bc75dae878542eef359e\",\n \"score\": \"0.6866311\",\n \"text\": \"function Grid(xSize, ySize) {\\n this.xSize = xSize;\\n this.ySize = ySize;\\n this.grd = createArray(xSize, ySize);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6622701e2745ff293118babb3fcc07c\",\n \"score\": \"0.6866287\",\n \"text\": \"function defaultGrid() {\\n createGrid(16);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86a2e635c16b04e283b80c77a072a6a2\",\n \"score\": \"0.68593735\",\n \"text\": \"function _makeGrid () {\\n //initialize an 8 x 8 array \\n\\n var myGrid = [...Array(8)].map(e => Array(8)); \\n\\n //place the pieces down \\n //like arr[space - 1][space - 1] = new Piece(with the the color)\\n\\n myGrid[3][3] = new Piece('white');\\n myGrid[4][4] = new Piece('white');\\n myGrid[3][4] = new Piece('black');\\n myGrid[4][3] = new Piece('black');\\n\\n return myGrid; \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"671fad44014dba0e94c092b72b9ab663\",\n \"score\": \"0.6850482\",\n \"text\": \"function buildGrid(root) {\\n for (let i = 0; i < 10; i++) {\\n for (let j = 0; j < 10; j++) {\\n let cell = $('<div>').addClass('cell');\\n cell.attr('data-row', i).attr('data-col', j);\\n // cells.push(cell);\\n root.append(cell);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f38e23b6e2b21b7ce3d38290c7724a50\",\n \"score\": \"0.6847373\",\n \"text\": \"function makeGrid() {\\n let noOfRows = height.val();\\n let noOfCols = width.val();\\n canvas.find('tbody').remove()\\n canvas.append('<tbody></tbody>')\\n let table = canvas.find('tbody');\\n for (let i = 0; i < noOfRows; i++) {\\n table.append('<tr></tr>')\\n }\\n for (let i = 0; i < noOfCols; i++) {\\n canvas.find('tr').append('<td class=\\\"background\\\"></td>');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db0a1f3868f8d14e28e91d93cfa5374f\",\n \"score\": \"0.684587\",\n \"text\": \"function defaultGrid() {\\n makeRows(16);\\n makeColumns(16);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8d4bf201ab39bb1217ddf61235533db\",\n \"score\": \"0.68457836\",\n \"text\": \"function buildGrid(vars) {\\n vars = vars || {};\\n var container = document.createElement(\\\"div\\\"),\\n rows = vars.grid[0] || 5,\\n cols = vars.grid[1] || 5,\\n width = vars.width || 100,\\n gutter = vars.gutter || 1,\\n className = vars.className || \\\"\\\",\\n w = (width - cols * gutter) / cols,\\n parent = (typeof (vars.parent) === \\\"string\\\") ? document.querySelector(vars.parent) : vars.parent ? vars.parent : document.body,\\n css = \\\"display: inline-block; margin: 0 \\\" + (gutter / width * 100) + \\\"% \\\" + (gutter / width * 100) + \\\"% 0; width: \\\" + (w / width * 100) + \\\"%;\\\",\\n l = rows * cols,\\n i, box;\\n for (i = 0; i < l; i++) {\\n box = document.createElement(\\\"div\\\");\\n box.style.cssText = css;\\n box.setAttribute(\\\"class\\\", className);\\n box.index = i;\\n box.setAttribute(\\\"data-index\\\", i);\\n if (vars.onCellClick) {\\n box.addEventListener(\\\"click\\\", vars.onCellClick);\\n }\\n container.appendChild(box);\\n }\\n container.style.cssText = \\\"width:\\\" + width + \\\"px; line-height: 0; padding:\\\" + gutter + \\\"px 0 0 \\\" + gutter + \\\"px; display:inline-block;\\\";\\n parent.appendChild(container);\\n return container;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ccf1e1140fc4617d5723099175ac447a\",\n \"score\": \"0.6840106\",\n \"text\": \"function newGrid(){\\n unsketch();\\n removeOldSquares();\\n resetGridTemplate();\\n howManySquares();\\n setGridRow();\\n setGridColumn();\\n createGrid();\\n addEventListeners();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5402192c91455666f79bd6704884d8ea\",\n \"score\": \"0.68360233\",\n \"text\": \"initGrid() {\\r\\n let gridContainer = document.getElementById(\\\"grid-container\\\");\\r\\n let tableRoot = document.createElement(\\\"table\\\");\\r\\n tableRoot.id = \\\"grid-table\\\";\\r\\n\\r\\n for (let i = 0; i < this.numberOfRows; i++) {\\r\\n let tableRow = document.createElement(\\\"tr\\\");\\r\\n this.cellModelMatrix[i] = new Array(this.numberOfCols);\\r\\n this.tableCellMatrix[i] = new Array(this.numberOfCols);\\r\\n\\r\\n for (let j = 0; j < this.numberOfCols; j++) {\\r\\n // Draw table cell\\r\\n let tableCell = document.createElement(\\\"td\\\");\\r\\n tableRow.appendChild(tableCell);\\r\\n\\r\\n let cellView = new CellView(tableCell);\\r\\n let cellModel = new CellModel(i, j, cellView);\\r\\n this.cellModelMatrix[i][j] = cellModel;\\r\\n this.tableCellMatrix[i][j] = tableCell;\\r\\n }\\r\\n\\r\\n tableRoot.appendChild(tableRow);\\r\\n }\\r\\n\\r\\n gridContainer.appendChild(tableRoot);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9bae3abae3be5829f83ad442613cf0d\",\n \"score\": \"0.68275607\",\n \"text\": \"function makeGrid() {\\n\\n // Your code goes here!\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"405e5ba076fe58ded20e4a607d3053b3\",\n \"score\": \"0.68270236\",\n \"text\": \"function drawGrid () {\\n var gridHTML = '';\\n for (var key in grids) {\\n gridHTML += '<div id=\\\"' + key + '\\\" class=\\\"grid ' +grids[key].type+ '\\\" style=\\\"top:' +grids[key].top+ 'px; left:' +grids[key].left+ 'px; width:' +small_tile_size+ 'px; height:' +small_tile_size+ 'px;\\\">' +key+ '</div>';\\n }\\n $('.tiles-container').append(gridHTML);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89b653f8033d24ea07799e90f207ee51\",\n \"score\": \"0.6826665\",\n \"text\": \"function createGrid() {\\n\\t\\t\\n\\t\\t// Clear rows & blocks inside the grid\\n\\t\\tgrid.innerHTML = '';\\n\\t\\t\\n\\t\\t// Remove these classes in case the previous game had been won or lost\\n\\t\\t$('#grid').removeClass(\\\"won lost\\\");\\n\\t\\trunning = true;\\n\\n\\t\\t// For height rows and width columns: create a block object, create an HTML block,\\n\\t\\t// and give the block object a reference to its HTML block.\\n\\t\\tfor (let i = 0; i < height; i++) {\\n\\t\\t\\tlet row = document.createElement('div');\\n\\t\\t\\trow.classList.add('row');\\n\\t\\t\\t$('#grid').append(row);\\n\\t\\t\\tfor (let j = 0; j < width; j++) {\\n\\t\\t\\t\\t\\tlet block = document.createElement(\\\"div\\\");\\n\\t\\t\\t\\t\\tblock.classList.add('block');\\n\\t\\t\\t\\t\\trow.append(block);\\n\\t\\t\\t\\t\\tblockList.push(new Block(i, j, block));\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t\\n\\t\\t\\n\\t\\t$('.block').click(function(e) {\\n\\t\\t\\tlet row = $(this).parent().index();\\n\\t\\t\\tlet column = $(this).index();\\n\\t\\t\\tlet block = getBlock(row, column);\\n\\t\\t\\t\\n\\t\\t\\t// Left-clicking uncovers the block.\\n\\t\\t\\tif (!e.shiftKey){\\n\\t\\t\\t\\tblock.click(false);\\n\\t\\t\\t\\t\\n\\t\\t\\t// Shift-clicking flags the block.\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tblock.rightClick(false);\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\t// Right-clicking flags the block.\\n\\t\\t$('.block').contextmenu(function() {\\n\\t\\t\\tlet row = $(this).parent().index();\\n\\t\\t\\tlet column = $(this).index();\\n\\t\\t\\tgetBlock(row, column).rightClick(false);\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d43a2e9c1a4e112cc1b54b924dea82c\",\n \"score\": \"0.68176556\",\n \"text\": \"function createGrid(x, y) {\\n // Setting the CSS variables\\n document.documentElement.style.setProperty('--numCol', x);\\n document.documentElement.style.setProperty('--numRow', y);\\n let board = document.createElement('div')\\n board.setAttribute('id', 'wrapper')\\n bodyDoc.appendChild(board);\\n\\n for (let i = 0; i < (x * y); i++) {\\n newDiv = document.createElement('div');\\n newDiv.classList.add('block');\\n newDiv.setAttribute('id', (i + 1));\\n board.appendChild(newDiv);\\n }\\n\\n createCleanButton();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"886f05e577dd169e0276611b32301bc6\",\n \"score\": \"0.6811965\",\n \"text\": \"function grid() {\\n //loop for grid\\n for(let i = 0; i < 256; i++) {\\n let item = document.createElement('div')\\n item.classList.add('gridItem')\\n item.style.border = '1px solid white';\\n \\n // add to the container\\n gridContainer.appendChild(item);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0574f3e4cd8ba2d091f8ee14f0811b2\",\n \"score\": \"0.68106735\",\n \"text\": \"function grid(sizeX,sizeY)\\r\\n{\\r\\n this.caseSizeX = WIDTH/sizeX;\\r\\n this.caseSizeY = HEIGHT/sizeY;\\r\\n this.ID = 0;\\r\\n this.caseGrid = new Array();\\r\\n for(var i =0;i<sizeX;i++)\\r\\n this.caseGrid[i] = new Array();\\r\\n for(var i = 0;i<sizeX;i++)\\r\\n {\\r\\n for(var j=0;j<sizeY;j++)\\r\\n {\\r\\n this.caseGrid[i][j] = new gridCase(i*this.caseSizeX,j*this.caseSizeY,this.caseSizeX,this.caseSizeY,\\\"DEAD\\\");\\r\\n }\\r\\n }\\r\\n this.size = new Object();\\r\\n this.sizeX =sizeX;\\r\\n this.sizeY = sizeY;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b77fef295728f25962ffea126969fa3\",\n \"score\": \"0.6809633\",\n \"text\": \"function Grid(width, height) {\\n this.space = new Array(width * height); // area of the grid as an array. Note how the grid is translated from a two dimensional string (as shown above in the plan array) to an array of one dimension. \\n this.width = width;\\n this.height = height;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57f3e92bf318e346a96a1ad70c5e5b05\",\n \"score\": \"0.67984366\",\n \"text\": \"function intializeGrids() {\\n let worldrow = this.worldSize.row;\\n for (let row = 0; row < worldrow; row++) {\\n let worldcol = this.worldSize.col;\\n let matrix = [];\\n matrix[row] = [];\\n for (let col = 0; col < worldcol; col++) {\\n matrix[row][col] = document.createElement(\\\"div\\\");\\n matrix[row][col].style[\\\"grid-area\\\"] = `${row + 1} / ${col + 1} / ${\\n row + 2\\n } / ${col + 1}`;\\n matrix[row][col].setAttribute(\\\"data-row\\\", row + 1);\\n matrix[row][col].setAttribute(\\\"data-col\\\", col + 1);\\n matrix[row][col].classList.add(\\\"tile\\\");\\n if (row < 13) {\\n matrix[row][col].classList.add(this.comp.main);\\n } else if (row < 14) {\\n matrix[row][col].classList.add(this.comp.element4.el);\\n } else {\\n matrix[row][col].classList.add(this.comp.element1.el);\\n }\\n this.gameWorld.appendChild(matrix[row][col]);\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb5a27a82e70cafe33c57e538240ba5e\",\n \"score\": \"0.6798139\",\n \"text\": \"function Grid(cellList) {\\n this.cellList = cellList;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5345cec1985ee21a45bf23370b378684\",\n \"score\": \"0.67942667\",\n \"text\": \"function defaultGrid() {\\n makeRows(100);\\n makeColumns(50);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07e806a4f43f71984e819c4d0b9d8c7a\",\n \"score\": \"0.67900527\",\n \"text\": \"initCells() {\\n for (let rowIdx = 0; rowIdx < this.degree * this.degree; rowIdx++) {\\n let row = this.table.insertRow();\\n this.grid.push([]);\\n for (let colIdx = 0; colIdx < this.degree * this.degree; colIdx++) {\\n let cell = row.insertCell();\\n this.grid[rowIdx].push(cell);\\n cell.classList.add(\\\"sudoku-cell\\\");\\n\\n // add sudoku-top, sudoku-bottom, sudoku-left, sudoku-right CSS classes\\n function setEdgeClasses(idx, degree, firstSuffix, lastSuffix) {\\n if (idx % degree === 0)\\n cell.classList.add(\\\"sudoku-\\\" + firstSuffix);\\n else if (idx % degree === degree - 1)\\n cell.classList.add(\\\"sudoku-\\\" + lastSuffix);\\n }\\n setEdgeClasses(rowIdx, this.degree, \\\"top\\\", \\\"bottom\\\");\\n setEdgeClasses(colIdx, this.degree, \\\"left\\\", \\\"right\\\");\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e151e1d34d3d1d34e76ed7ca5675262c\",\n \"score\": \"0.67888397\",\n \"text\": \"_createGrid (type, cols, rows) {\\n\\t\\tlet grid = [],\\n\\t\\t\\ttile;\\n\\t\\tfor (let i = 0; i < cols; i++) {\\n\\t\\t\\tlet row = [];\\n\\t\\t\\tfor (let j = 0; j < rows; j++) {\\n\\t\\t\\t\\tlet random = Math.random();\\n\\t\\t\\t\\t// Creates border around map\\n\\t\\t\\t\\t// i controls height and j controls width; below set to 8 because glitch if set to 7\\n\\t\\t\\t\\tif (i < 7 || j < 7 || i > this.state.mapSize - 8 || j > this.state.mapSize - 7) {\\n\\t\\t\\t\\t\\ttile = 'R';\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t// Adjust to generate random obstacles for testing\\n\\t\\t\\t\\t\\t// Randomly generate grass or rock on tile\\n\\t\\t\\t\\t\\t//tile = random > 0.4 ? '_' : 'R';\\n\\t\\t\\t\\t\\ttile = 'R'\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trow.push(tile)\\n\\t\\t\\t}\\n\\t\\t\\tgrid.push(row);\\n\\t\\t}\\n\\t\\treturn grid\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"061b4ac84617c38705fccc2a8dd7415d\",\n \"score\": \"0.67844236\",\n \"text\": \"__buildGrid() {\\n var grid = [];\\n var colSpans = [];\\n var rowSpans = [];\\n\\n var maxRowIndex = -1;\\n var maxColIndex = -1;\\n\\n var children = this._getLayoutChildren();\\n\\n for (var i = 0, l = children.length; i < l; i++) {\\n var child = children[i];\\n var props = child.getLayoutProperties();\\n\\n var row = props.row;\\n var column = props.column;\\n\\n props.colSpan = props.colSpan || 1;\\n props.rowSpan = props.rowSpan || 1;\\n\\n // validate arguments\\n if (row == null || column == null) {\\n throw new Error(\\n \\\"The layout properties 'row' and 'column' of the child widget '\\\" +\\n child +\\n \\\"' must be defined!\\\"\\n );\\n }\\n\\n if (grid[row] && grid[row][column]) {\\n throw new Error(\\n \\\"Cannot add widget '\\\" +\\n child +\\n \\\"'!. \\\" +\\n \\\"There is already a widget '\\\" +\\n grid[row][column] +\\n \\\"' in this cell (\\\" +\\n row +\\n \\\", \\\" +\\n column +\\n \\\") for '\\\" +\\n this +\\n \\\"'\\\"\\n );\\n }\\n\\n for (var x = column; x < column + props.colSpan; x++) {\\n for (var y = row; y < row + props.rowSpan; y++) {\\n if (grid[y] == undefined) {\\n grid[y] = [];\\n }\\n\\n grid[y][x] = child;\\n\\n maxColIndex = Math.max(maxColIndex, x);\\n maxRowIndex = Math.max(maxRowIndex, y);\\n }\\n }\\n\\n if (props.rowSpan > 1) {\\n rowSpans.push(child);\\n }\\n\\n if (props.colSpan > 1) {\\n colSpans.push(child);\\n }\\n }\\n\\n // make sure all columns are defined so that accessing the grid using\\n // this.__grid[column][row] will never raise an exception\\n for (var y = 0; y <= maxRowIndex; y++) {\\n if (grid[y] == undefined) {\\n grid[y] = [];\\n }\\n }\\n\\n this.__grid = grid;\\n\\n this.__colSpans = colSpans;\\n this.__rowSpans = rowSpans;\\n\\n this.__maxRowIndex = maxRowIndex;\\n this.__maxColIndex = maxColIndex;\\n\\n this.__rowHeights = null;\\n this.__colWidths = null;\\n\\n // Clear invalidation marker\\n delete this._invalidChildrenCache;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa6f5d0fde46a70451b30fbed94188a4\",\n \"score\": \"0.674396\",\n \"text\": \"function GridRenderer()\\n{\\n\\tthis.pInstance = null;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bf5031ab8a3d564cc3443bd55e1442b\",\n \"score\": \"0.672891\",\n \"text\": \"generate_grid_css() {\\n let gutter = '3';\\n\\n jss.set(`.${this.row_class}`, {\\n width: '98%'\\n });\\n jss.set(`.${this.row_class}:after`, {\\n clear: 'both'\\n });\\n jss.set(`.${this.row_class}:before, .${this.row_class}:after`, {\\n display: 'table',\\n 'line-height': '0',\\n 'content': '\\\"\\\"'\\n });\\n\\n jss.set(`.${this.column_class}`, {\\n 'display': 'block',\\n 'float': 'left',\\n 'width': '100%',\\n 'min-height': '30px',\\n 'box-sizing': 'border-box'\\n });\\n\\n let margin_space = (this.n_columns - 1) * gutter;\\n let computable_space = 100 - margin_space;\\n let minimun_column_width = computable_space / this.n_columns;\\n\\n for (let i = 1; i <= this.n_columns; i++) {\\n let column_width = minimun_column_width * i;\\n let margin_width = gutter * (i - 1);\\n\\n jss.set(`[data-column-size=\\\"${i}\\\"]`, {\\n 'width': column_width + margin_width + '%',\\n 'margin-left': gutter + '%'\\n });\\n }\\n\\n jss.set(`.${this.column_class}:nth-of-type(1)`, {\\n 'margin-left': '0'\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32f4079d83fcdd64810b3cbc3daff589\",\n \"score\": \"0.6726885\",\n \"text\": \"function createGrid(gridSize) {\\n etchScreen.style.gridTemplateColumns = `repeat(${gridSize}, 1fr)`;\\n etchScreen.style.gridTemplateRows = `repeat(${gridSize}, 1fr)`;\\n for (let i = 0; i < gridSize * gridSize; i++){\\n let cell = document.createElement(\\\"div\\\");\\n cell.classList.add('cell');\\n etchScreen.appendChild(cell);\\n }\\n\\n let grid = document.querySelectorAll('.cell');\\n grid.forEach ((cell) => {\\n cell.addEventListener('mouseover', (e) => {\\n cell.classList.add('active');\\n }); \\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a9710b215f54badc0eb8de8d71788d0\",\n \"score\": \"0.6724433\",\n \"text\": \"function _crearGrid(fila, columna){\\n\\n const newGridLayout = new GridLayout();\\n newGridLayout.columns = pageData.getColOp; \\n newGridLayout.row=fila;\\n newGridLayout.col=columna;\\n\\n return newGridLayout;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5d0f946dc1ed56b79361e2ff7a1a304\",\n \"score\": \"0.6723441\",\n \"text\": \"function Grid(width,height){\\n\\tthis.width=width;\\n\\tthis.height=height;\\n\\tthis.nodes=this.makenodes(width,height);\\n\\tthis.hillweight=12;\\n\\tthis.valleyweight=1;\\n\\tthis.normal=5;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08e82c952aaaed4ec3340505a04d491b\",\n \"score\": \"0.6721336\",\n \"text\": \"function initGrid(gridColumns = 16, gridRows = 16,\\n containerWidth = 100, containerHeight = 100) {\\n const gridContainer = document.querySelector(\\\"#grid-container\\\");\\n gridContainer.style.gridTemplateColumns = `repeat(${gridColumns}, ${containerWidth/gridColumns}px)`;\\n gridContainer.style.gridTemplateRows = `repeat(${gridRows}, ${containerHeight/gridRows}px)`;\\n for (let i = 0; i < gridRows; ++i) {\\n for (let j = 0; j < gridColumns; ++j) {\\n const newGrid = document.createElement(\\\"div\\\");\\n newGrid.classList.add(\\\"grid\\\");\\n newGrid.style.width = `${containerWidth/gridColumns}px`;\\n newGrid.style.height = `${containerHeight/gridRows}px`;\\n newGrid.style.backgroundColor = \\\"#FFFFFF\\\";\\n newGrid.addEventListener(\\\"mouseover\\\", fillGrid);\\n newGrid.id = `grid${j}-${i}`;\\n gridContainer.appendChild(newGrid);\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4eccef2bfae702d755adb117ab7e205f\",\n \"score\": \"0.67155963\",\n \"text\": \"function Grid(width, height, boundsWidth, boundsHeight, widthStep, heightStep) {\\n\\n\\tthis.width = width * parseInt(widthStep);\\n\\tthis.height = height * parseInt(heightStep);\\n\\tthis.boundsWidth = boundsWidth * parseInt(widthStep);\\n\\tthis.boundsHeight = boundsHeight * parseInt(heightStep);\\n\\tthis.widthStep = widthStep;\\n\\tthis.heightStep = heightStep;\\n\\tthis.cells = [];\\n\\tthis.container = $('#grid');\\n\\tthis.parentContainer = $('#boundsForGrid');\\n\\tthis.cellSelected = false;\\n this.acceptKeyPress = false\\n\\tthis.init();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d95552b02ef2097ab138b0bd4ccbba64\",\n \"score\": \"0.6701398\",\n \"text\": \"function createGrid(array) {\\n array.forEach(obj => createTile(obj));\\n document.getElementById('dino-compare').style.display = 'none';\\n document.getElementById('grid').style.display = 'flex';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14d4fd18902704505249bd609d3388ee\",\n \"score\": \"0.66956353\",\n \"text\": \"function Grid(width, height) {\\n this.space = new Array(width * height);\\n this.width = width;\\n this.height = height;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9153ed0610ec5710725e3c3d47cc667d\",\n \"score\": \"0.66943413\",\n \"text\": \"function makeGrid() {\\n CANVAS.find('tbody').remove();\\n\\n // \\\"submit\\\" the size form to update the grid size\\n let gridRows = heightInput.val();\\n let gridCol = widthInput.val();\\n\\n // set tbody to the table\\n CANVAS.append('<tbody></tbody>');\\n\\n let canvasBody = CANVAS.find('tbody');\\n\\n // draw grid row\\n for (let i = 0; i < gridRows; i++) {\\n canvasBody.append('<tr></tr>');\\n }\\n\\n // draw grid col\\n for (let i = 0; i < gridCol; i++) {\\n CANVAS.find('tr').append('<td class=\\\"transparent\\\"></td>');\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5ea0614c42f44136a75b56ea5080c67\",\n \"score\": \"0.66924417\",\n \"text\": \"function createGrid(rows, columns) {\\n gridContainer.style.setProperty(\\\"--grid-rows\\\", rows);\\n gridContainer.style.setProperty(\\\"--grid-columns\\\", columns);\\n\\n for (let i = 0; i < rows * columns; i++) {\\n let cell = document.createElement(\\\"div\\\");\\n cell.className = \\\"grid-cell\\\";\\n gridContainer.appendChild(cell);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69f8efaefa5475275f4cb00d293a7858\",\n \"score\": \"0.6688942\",\n \"text\": \"function createGrid() {\\n\\t\\tvar positions = [],\\n\\t\\t\\ti,\\n\\t\\t\\tj;\\n\\t\\t\\n\\t\\t// Go through each row.\\n\\t\\tfor ( i = 0; i < 8; i++ ) {\\n\\t\\t\\t// Go through each button in row.\\n\\t\\t\\tfor ( j = 0; j < 8; j++ ) {\\n\\t\\t\\t\\tpositions.push( i * 16 + j );\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Return positions.\\n\\t\\treturn positions;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"949fb1214e4eaa7de280ccef4b1cc31c\",\n \"score\": \"0.6683842\",\n \"text\": \"function createGameGrid() {\\n for (let y = CELL_SIZE.height + 10; y <= 6 * CELL_SIZE.height; y += CELL_SIZE.height) {\\n for (let x = 3 * CELL_SIZE.width; x <= 11 * CELL_SIZE.width; x += CELL_SIZE.width) {\\n gameGrid.push(new Cell(x, y))\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efe1566abad1d6940109c300e8ef9a4e\",\n \"score\": \"0.66798645\",\n \"text\": \"generateGrid() {\\n let board = document.getElementsByClassName(\\\"board\\\")[0];\\n let totalCells = this.gridSize * this.gridSize;\\n for (let i = 0; i < totalCells; i++) {\\n console.log(i, \\\"I\\\");\\n let tile = document.createElement(\\\"div\\\");\\n tile.className = \\\"tile\\\";\\n console.log(tile, \\\"TILE\\\");\\n board.appendChild(tile);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f30b862633583e5bf35f2c8811b7ae66\",\n \"score\": \"0.6670902\",\n \"text\": \"function createGrid(gridSize = 20){\\n initializeSlider(gridSize);\\n sketchContainer.setAttribute('style',`grid-template-columns: repeat(${gridSize}, 1fr);, grid-template-rows: repeat(${gridSize}, 1fr);` )\\n appendPixels(gridSize);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d838cf7b03e017c1472e21a21cb12219\",\n \"score\": \"0.6663743\",\n \"text\": \"function buildGrid(size) {\\r\\n for (let i = 0; i < size ** 2; i++) {\\r\\n let square = document.createElement('div');\\r\\n square.className = \\\"square\\\";\\r\\n GRID.appendChild(square);\\r\\n }\\r\\n enableGrid()\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24a1996cd11ed29cce9bb2aa1ec40708\",\n \"score\": \"0.66600376\",\n \"text\": \"function createGrid(num) {\\n var gridNum = num\\n var divNodeSize = 320 / num;\\n \\n //Removes any .div-wrapper from the page\\n $(\\\".div-wrapper\\\").each(function() {\\n $(this).remove();\\n });\\n \\n //Adds a .div-wrapper then loops through adding num .div-wrapper(s) every num .div-node(s)\\n $(\\\"#div-grid\\\").append(\\\"<div class = 'div-wrapper' </div>\\\");\\n for (var i = 0; i < gridNum; i++) {\\n for (var j = 0; j < gridNum; j++) {\\n $(\\\".div-wrapper\\\").last().append(\\\"<div class = 'div-node' </div>\\\");\\n }\\n $(\\\"#div-grid\\\").append(\\\"<div class = 'div-wrapper' </div>\\\");\\n }\\n \\n //CSS styling ensures the #div-grid size remains constant and the .div-nodes are square\\n $(\\\".div-node\\\").css(\\\"height\\\", divNodeSize);\\n $(\\\".div-node\\\").css(\\\"width\\\", divNodeSize);\\n $(\\\".div-node\\\").css(\\\"background-color\\\", backgroundOrigin);\\n \\n colorStay();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cecbad5cbe5942017e28089a89fa64df\",\n \"score\": \"0.6656861\",\n \"text\": \"function createBoard () {\\n for (let i = 0; i < layout.length; i++) {\\n const square = document.createElement ('div')\\n grid.appendChild(square)\\n squares.push(square)\\n\\n // add layout to the board\\n\\n if(layout[i] === 1) {\\n squares[i].classList.add('wall')\\n } else if (layout[i] === 2) {\\n squares[i].classList.add('ghost-lair')\\n } else if (layout[i]=== 3) {\\n squares[i].classList.add('power-pellet')\\n } else if (layout[i] === 4) {\\n squares[i].classList.add('pac-dot')\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfbcc88cf2de50eac2caea46b48675fc\",\n \"score\": \"0.66353303\",\n \"text\": \"function createNewGrid(size){\\n container.setAttribute(\\n \\\"style\\\", `display: grid; background-color: white; grid-template-columns: repeat(${newGridSize}, 1fr); grid-template-rows: repeat(${newGridSize}, 1fr); width: 75vmin;\\n height: 75vmin;`);\\n for (var i = 0; i < (`${newGridSize}` * `${newGridSize}`); i++) {\\n let cell = document.createElement('div');\\n cell.setAttribute(\\\"id\\\", i);\\n cell.setAttribute(\\\"class\\\", \\\"cell\\\")\\n container.appendChild(cell);\\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":73,"cells":{"query_id":{"kind":"string","value":"cd40fba3b398a94f9d8cd86d381a995e"},"query":{"kind":"string","value":"A lot faster than stringify/parse"},"positive_passages":{"kind":"list like","value":[{"docid":"41541930bdf25afb14c392749adb7c07","score":"0.0","text":"function cloneBounds(bounds /*: Bounds*/) /*: Bounds*/ {\n return {\n left: bounds.left,\n top: bounds.top,\n right: bounds.right,\n bottom: bounds.bottom\n };\n}","title":""}],"string":"[\n {\n \"docid\": \"41541930bdf25afb14c392749adb7c07\",\n \"score\": \"0.0\",\n \"text\": \"function cloneBounds(bounds /*: Bounds*/) /*: Bounds*/ {\\n return {\\n left: bounds.left,\\n top: bounds.top,\\n right: bounds.right,\\n bottom: bounds.bottom\\n };\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"a377fdb4ac27e03b22388b7c4db145c6","score":"0.61210936","text":"function stringify() {\n return parser.stringify();\n }","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"6dab958f55359b8b37c49dde68fd5c58","score":"0.5834731","text":"serialize() {}","title":""},{"docid":"eee5d156e67b52b26d5863e9e69f2ada","score":"0.5787522","text":"function stringify(data) {\n\t\tif(JSON)\n\t\t\treturn(JSON.stringify(data));\n\t\telse {\n\t\t\t//Throw exception\n\t\t\t//TODO: Is there any other solution for non JSON? caniuse say there is a 96.58% coverage for JSON parsing...\n\t\t\tthrowEx('No JSON support.');\n\t\t\treturn(data);\t\t\t\t\n\t\t}\n\t}","title":""},{"docid":"5f637ddd60af67cf2b9040391237570d","score":"0.57447946","text":"function serialize(o) {\n var p = 0, sb = [], ht = [], hv = 1;\n var classname = function(o) {\n if (typeof(o) == \"undefined\" || typeof(o.constructor) == \"undefined\") return '';\n var c = o.constructor.toString();\n c = utf16to8(c.substr(0, c.indexOf('(')).replace(/(^\\s*function\\s*)|(\\s*$)/ig, ''));\n return ((c == '') ? 'Object' : c);\n };\n var is_int = function(n) {\n var s = n.toString(), l = s.length;\n if (l > 11) return false;\n for (var i = (s.charAt(0) == '-') ? 1 : 0; i < l; i++) {\n switch (s.charAt(i)) {\n case '0':\n case '1':\n case '2':\n case '3':\n case '4':\n case '5':\n case '6':\n case '7':\n case '8':\n case '9': break;\n default : return false;\n }\n }\n return !(n < -2147483648 || n > 2147483647);\n };\n var in_ht = function(o) {\n for (k in ht) if (ht[k] === o) return k;\n return false;\n };\n var ser_null = function() {\n sb[p++] = 'N;';\n };\n var ser_boolean = function(b) {\n sb[p++] = (b ? 'b:1;' : 'b:0;');\n };\n var ser_integer = function(i) {\n sb[p++] = 'i:' + i + ';';\n };\n var ser_double = function(d) {\n if (isNaN(d)) d = 'NAN';\n else if (d == Number.POSITIVE_INFINITY) d = 'INF';\n else if (d == Number.NEGATIVE_INFINITY) d = '-INF';\n sb[p++] = 'd:' + d + ';';\n };\n var ser_string = function(s) {\n var utf8 = utf16to8(s);\n sb[p++] = 's:' + utf8.length + ':\"';\n sb[p++] = utf8;\n sb[p++] = '\";';\n };\n var ser_array = function(a) {\n sb[p++] = 'a:';\n var lp = p;\n sb[p++] = 0;\n sb[p++] = ':{';\n for (var k in a) {\n if (typeof(a[k]) != 'function') {\n is_int(k) ? ser_integer(k) : ser_string(k);\n __serialize(a[k]);\n sb[lp]++;\n }\n }\n sb[p++] = '}';\n };\n var ser_object = function(o) {\n var cn = classname(o);\n if (cn == '') ser_null();\n else if (typeof(o.serialize) != 'function') {\n sb[p++] = 'O:' + cn.length + ':\"';\n sb[p++] = cn;\n sb[p++] = '\":';\n var lp = p;\n sb[p++] = 0;\n sb[p++] = ':{';\n if (typeof(o.__sleep) == 'function') {\n var a = o.__sleep();\n for (var kk in a) {\n ser_string(a[kk]);\n __serialize(o[a[kk]]);\n sb[lp]++;\n }\n }\n else {\n for (var k in o) {\n if (typeof(o[k]) != 'function') {\n ser_string(k);\n __serialize(o[k]);\n sb[lp]++;\n }\n }\n }\n sb[p++] = '}';\n }\n else {\n var cs = o.serialize();\n sb[p++] = 'C:' + cn.length + ':\"';\n sb[p++] = cn;\n sb[p++] = '\":' + cs.length + ':{';\n sb[p++] = cs;\n sb[p++] = \"}\";\n }\n };\n var ser_pointref = function(R) {\n sb[p++] = \"R:\" + R + \";\";\n };\n var ser_ref = function(r) {\n sb[p++] = \"r:\" + r + \";\";\n };\n var __serialize = function(o) {\n if (o == null || o.constructor == Function) {\n hv++;\n ser_null();\n }\n else switch (o.constructor) {\n case Boolean: {\n hv++;\n ser_boolean(o);\n break;\n }\n case Number: {\n hv++;\n is_int(o) ? ser_integer(o) : ser_double(o);\n break;\n }\n case String: {\n hv++;\n ser_string(o);\n break;\n }\n/*@cc_on @*/\n/*@if (@_jscript)\n case VBArray: {\n o = o.toArray();\n }\n@end @*/\n case Array: {\n var r = in_ht(o);\n if (r) {\n ser_pointref(r);\n }\n else {\n ht[hv++] = o;\n ser_array(o);\n }\n break;\n }\n default: {\n var r = in_ht(o);\n if (r) {\n hv++;\n ser_ref(r);\n }\n else {\n ht[hv++] = o;\n ser_object(o);\n }\n break;\n }\n }\n };\n __serialize(o);\n return sb.join('');\n}","title":""},{"docid":"2fa09b02a98402beffbb47d1f8ff97ce","score":"0.5707002","text":"function compareParse() {\n\n\tparseableStrings.forEach(function(test) {\n\tconsole.log(test);\n console.log(\"parseJSON = \" + parseJSON(test)); \n \n console.log(\"JSON.parse = \" + JSON.parse(test));\n\n console.log(\"stringified parseJSON = \" + JSON.stringify(parseJSON(test)));\n console.log(\"stringified JSON.parse = \" + JSON.stringify(JSON.parse(test)));\n\n console.log(\"=======================================\");\n });\n\n}","title":""},{"docid":"482416b96898c2bd085576c17fd6952e","score":"0.5667786","text":"static stringParseEncodedObject(serializedObject,scope={},name='scope'){if(serializedObject.endsWith('.json')&&Tools.isFileSync(serializedObject))serializedObject=fileSystem.readFileSync(serializedObject,{encoding:'utf-8'});if(!serializedObject.startsWith('{'))serializedObject=eval('Buffer').from(serializedObject,'base64').toString('utf8');let result;try{result=new Function(name,`return ${serializedObject}`)(scope)}catch(error){}if(typeof result==='object')return result;return null}","title":""},{"docid":"0304f5550677505366a922aaf93f208a","score":"0.5634791","text":"function test(){ /** JSON.stringify() and large integers */\r\n\tvar obj={\"largest non-double\":2147483647, \"smallest non-double\": -2147483648, \"the time - a double\":1278339272556}\r\n\tobj[16777215]='#ffffff in decimal, now as property name';\r\n\tvar str=JSON.stringify(obj);\r\n\tvar passed = str.indexOf( '16777215' ) >-1 &&\r\n\t\tstr.indexOf( '2147483647' ) >-1 &&\r\n\t\tstr.indexOf( '-2147483648' ) >-1 &&\r\n\t\tstr.indexOf( '16777215' ) >-1 &&\r\n\t\tstr.indexOf( '1278339272556' ) >-1 ; /* the last one is double internally but is expected to stringify fine.. */\r\n\treturn passed;\r\n}","title":""},{"docid":"a63808ab29d4d3a7207e21adaf2bded9","score":"0.55503386","text":"function JSON_stringify(s, emit_unicode) {\n if (s) {\n var json = JSON.stringify(s);\n if (json) {\n return emit_unicode ? json : json.replace(jsonRegex, jsonRegexReplace);\n }\n else {\n return json;\n }\n }\n else {\n return s;\n }\n}","title":""},{"docid":"600e0fe69d9c8c60512a120c50605725","score":"0.5545554","text":"function serializeJson(obj) {\r\n // firefox provides uneval()\r\n if (typeof uneval === \"function\") {\r\n var json = uneval(obj);\r\n return json.substring(1, json.length-1);\r\n }\r\n // others\r\n var buf = \"\";\r\n for (var attr in obj) {\r\n buf += \" \" + attr + \": \" + obj[attr];\r\n }\r\n return \"{\" + buf + \" }\";\r\n }","title":""},{"docid":"d5ba8640e0a6e45a466ac3aeb373774d","score":"0.54870814","text":"function stringifyNumbers(obj) {\n\n}","title":""},{"docid":"df8c54c53ee8f089d27995bf2ad98d67","score":"0.54802066","text":"function unserialize(data) {\n // discuss at: http://phpjs.org/functions/unserialize/\n // original by: Arpad Ray (mailto:arpad@php.net)\n // improved by: Pedro Tainha (http://www.pedrotainha.com)\n // improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)\n // improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)\n // improved by: Chris\n // improved by: James\n // improved by: Le Torbi\n // improved by: Eli Skeggs\n // bugfixed by: dptr1988\n // bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)\n // bugfixed by: Brett Zamir (http://brett-zamir.me)\n // revised by: d3x\n // input by: Brett Zamir (http://brett-zamir.me)\n // input by: Martin (http://www.erlenwiese.de/)\n // input by: kilops\n // input by: Jaroslaw Czarniak\n // note: We feel the main purpose of this function should be to ease the transport of data between php & js\n // note: Aiming for PHP-compatibility, we have to translate objects to arrays\n // example 1: unserialize('a:3:{i:0;s:5:\"Kevin\";i:1;s:3:\"van\";i:2;s:9:\"Zonneveld\";}');\n // returns 1: ['Kevin', 'van', 'Zonneveld']\n // example 2: unserialize('a:3:{s:9:\"firstName\";s:5:\"Kevin\";s:7:\"midName\";s:3:\"van\";s:7:\"surName\";s:9:\"Zonneveld\";}');\n // returns 2: {firstName: 'Kevin', midName: 'van', surName: 'Zonneveld'}\n\n var that = this,\n utf8Overhead = function(chr) {\n // http://phpjs.org/functions/unserialize:571#comment_95906\n var code = chr.charCodeAt(0);\n if (code < 0x0080) {\n return 0;\n }\n if (code < 0x0800) {\n return 1;\n }\n return 2;\n };\n error = function(type, msg, filename, line) {\n throw new that.window[type](msg, filename, line);\n };\n read_until = function(data, offset, stopchr) {\n var i = 2,\n buf = [],\n chr = data.slice(offset, offset + 1);\n\n while (chr != stopchr) {\n if ((i + offset) > data.length) {\n error('Error', 'Invalid');\n }\n buf.push(chr);\n chr = data.slice(offset + (i - 1), offset + i);\n i += 1;\n }\n return [buf.length, buf.join('')];\n };\n read_chrs = function(data, offset, length) {\n var i, chr, buf;\n\n buf = [];\n for (i = 0; i < length; i++) {\n chr = data.slice(offset + (i - 1), offset + i);\n buf.push(chr);\n length -= utf8Overhead(chr);\n }\n return [buf.length, buf.join('')];\n };\n _unserialize = function(data, offset) {\n var dtype, dataoffset, keyandchrs, keys, contig,\n length, array, readdata, readData, ccount,\n stringlength, i, key, kprops, kchrs, vprops,\n vchrs, value, chrs = 0,\n typeconvert = function(x) {\n return x;\n };\n\n if (!offset) {\n offset = 0;\n }\n dtype = (data.slice(offset, offset + 1))\n .toLowerCase();\n\n dataoffset = offset + 2;\n\n switch (dtype) {\n case 'i':\n typeconvert = function(x) {\n return parseInt(x, 10);\n };\n readData = read_until(data, dataoffset, ';');\n chrs = readData[0];\n readdata = readData[1];\n dataoffset += chrs + 1;\n break;\n case 'b':\n typeconvert = function(x) {\n return parseInt(x, 10) !== 0;\n };\n readData = read_until(data, dataoffset, ';');\n chrs = readData[0];\n readdata = readData[1];\n dataoffset += chrs + 1;\n break;\n case 'd':\n typeconvert = function(x) {\n return parseFloat(x);\n };\n readData = read_until(data, dataoffset, ';');\n chrs = readData[0];\n readdata = readData[1];\n dataoffset += chrs + 1;\n break;\n case 'n':\n readdata = null;\n break;\n case 's':\n ccount = read_until(data, dataoffset, ':');\n chrs = ccount[0];\n stringlength = ccount[1];\n dataoffset += chrs + 2;\n\n readData = read_chrs(data, dataoffset + 1, parseInt(stringlength, 10));\n chrs = readData[0];\n readdata = readData[1];\n dataoffset += chrs + 2;\n if (chrs != parseInt(stringlength, 10) && chrs != readdata.length) {\n error('SyntaxError', 'String length mismatch');\n }\n break;\n case 'a':\n readdata = {};\n\n keyandchrs = read_until(data, dataoffset, ':');\n chrs = keyandchrs[0];\n keys = keyandchrs[1];\n dataoffset += chrs + 2;\n\n length = parseInt(keys, 10);\n contig = true;\n\n for (i = 0; i < length; i++) {\n kprops = _unserialize(data, dataoffset);\n kchrs = kprops[1];\n key = kprops[2];\n dataoffset += kchrs;\n\n vprops = _unserialize(data, dataoffset);\n vchrs = vprops[1];\n value = vprops[2];\n dataoffset += vchrs;\n\n if (key !== i)\n contig = false;\n\n readdata[key] = value;\n }\n\n if (contig) {\n array = new Array(length);\n for (i = 0; i < length; i++)\n array[i] = readdata[i];\n readdata = array;\n }\n\n dataoffset += 1;\n break;\n default:\n error('SyntaxError', 'Unknown / Unhandled data type(s): ' + dtype);\n break;\n }\n return [dtype, dataoffset - offset, typeconvert(readdata)];\n };\n\n return _unserialize((data + ''), 0)[2];\n }","title":""},{"docid":"9e84cd011ad1b05e34bf73b467724df6","score":"0.5476022","text":"function ser (value){//why do you exist!! arrrrgh!!!\n return value = null ? null :\n JSON.parse(JSON.stringify(value))\n }","title":""},{"docid":"bf743dd036e4621722e58873389e3324","score":"0.54716957","text":"serialize (target, encoding = \"json\") {\n const ref = new WeakMap()\n const simplify = (target, path) => {\n let result\n if (typeof target !== \"object\" && typeof target !== \"function\")\n result = target.valueOf()\n else {\n if (ref.has(target))\n result = { $t: \"Ref\", $d: [ ref.get(target) ] }\n else {\n ref.set(target, path)\n if (typeof target === \"object\") {\n if (target instanceof RegExp)\n result = { $t: \"RegExp\", $d: [ target.source, target.flags ] }\n else if (target instanceof Date)\n result = { $t: \"Date\", $d: [ target.valueOf() ] }\n else if (target instanceof Map)\n result = { $t: \"Map\", $d: Array.from(target.entries()).map((entry) => {\n entry[1] = simplify(entry[1], simoUtil.concatPath(path, entry[0]))\n return entry\n }) }\n else if (target instanceof Set) {\n let i = 0\n result = { $t: \"Set\", $d: Array.from(target.values()).map((val) =>\n simplify(val, simoUtil.concatPath(path, i++))\n ) }\n }\n else if (target instanceof Array) {\n let i = 0\n result = target.map((val) => simplify(val, simoUtil.concatPath(path, i++)))\n }\n else {\n /* store an Object in \"entries\" form to preserve ordering */\n result = { $t: \"Object\", $d: Array.from(Object.entries.call(null, target))\n .sort((a, b) => b[0].localeCompare(a[0]))\n .map((entry) => {\n entry[1] = simplify(entry[1], simoUtil.concatPath(path, entry[0]))\n return entry\n })\n }\n }\n }\n else if (typeof target === \"function\") {\n result = {\n $t: \"Function\",\n $d: [ target.toString(),\n Array.from(Object.entries.call(null, target))\n .sort((a, b) => b[0].localeCompare(a[0]))\n .map((entry) => {\n entry[1] = simplify(entry[1], simoUtil.concatPath(path, entry[0]))\n return entry\n })\n ]\n }\n }\n }\n }\n return result\n }\n const obj = simplify(target, \"\")\n const blob = JSON.stringify(obj)\n return blob\n }","title":""},{"docid":"5c824e3bff966c67cbbe04607f834ba9","score":"0.5466052","text":"function unitTest_s_1()\n{\n var obj = 7;\n\n simpleStringifyTest(obj, null, '{\"jss\":1,\"v\":7}');\n}","title":""},{"docid":"bdee9f3fe543c2c08867b14283239287","score":"0.54462427","text":"function str(text) {\n return JSON.stringify(text);\n}","title":""},{"docid":"37690bafef745c053183a9a004eeaeea","score":"0.5443979","text":"function string(str) {\n return _serializeString(str);\n}","title":""},{"docid":"4fc2bc61fb96c5e7d0d58bea8f4fbc0b","score":"0.54351455","text":"function stringify(attrs) {\n function walk(attr) {\n for (var k in attr) {\n if (isPlainObject(attr[k])) {\n walk(attr[k]);\n } else if (Array.isArray(attr[k])) {\n for (var i = 0; i < attr[k].length; i++) {\n walk(attr[k][i]);\n }\n } else {\n // as JSON.stringify(/test/) // => {}\n if (attr[k] instanceof RegExp) {\n attr[k] = attr[k].toString();\n }\n }\n }\n }\n walk(attrs);\n }","title":""},{"docid":"05b1d15b3c03e31b7f2b57fd73fad8fc","score":"0.54343134","text":"function unStringify(str){\n // Searches for \" or ' at the Start and End index\n if((startIndex === '\\\"' || startIndex === '\\'') && (endIndex === '\\\"' || endIndex === '\\'')){\n //\n return str.slice(startIndex, endIndex);\n }\n return str;\n }","title":""},{"docid":"e5a3382d787f2aa33cf0fc5039b7079f","score":"0.5431235","text":"function stringify(attrs) {\n function walk(attr) {\n for(var k in attr) {\n if(isPlainObject(attr[k])) {\n walk(attr[k]);\n } else if(Array.isArray(attr[k])) {\n for(var i = 0; i < attr[k].length; i++) {\n walk(attr[k][i]);\n }\n } else {\n // as JSON.stringify(/test/) // => {}\n if(attr[k] instanceof RegExp) {\n attr[k] = attr[k].toString();\n }\n }\n }\n }\n\n walk(attrs);\n}","title":""},{"docid":"b7eb035441d727ae26bb78f01ede7b02","score":"0.5429552","text":"function fastAndSafeJsonStringify(rec) {\n try {\n return JSON.stringify(rec);\n } catch (ex) {\n try {\n return JSON.stringify(rec, safeCycles());\n } catch (e) {\n if (safeJsonStringify) {\n return safeJsonStringify(rec);\n } else {\n var dedupKey = e.stack.split(/\\n/g, 3).join('\\n');\n _warn('bunyan: ERROR: Exception in '\n + '`JSON.stringify(rec)`. You can install the '\n + '\"safe-json-stringify\" module to have Bunyan fallback '\n + 'to safer stringification. Record:\\n'\n + _indent(format('%s\\n%s', util.inspect(rec), e.stack)),\n dedupKey);\n return format('(Exception in JSON.stringify(rec): %j. '\n + 'See stderr for details.)', e.message);\n }\n }\n }\n}","title":""},{"docid":"7bab4cea78745cd072e34e03e684543d","score":"0.54169923","text":"function testStringify(x) {\n var t = JSON.stringify(x);\n print(typeof t, t);\n}","title":""},{"docid":"6bdf5209038d5854713fd2237777ebfe","score":"0.54151595","text":"function dstring(ostr) {\n // mapOnce(); // no longer needed, we compute contructors using getConstructor()\n var str = ostr;\n\n // to consider, should refmap be integrated into reviver ???\n var reviver = (key, value) => key === 'frameSaver' && !nwfs ? undefined : value; // TODO generalize or ...??? stephen 21/01/2017\n // var o = JSON.parse(str, reviver);\n let obj;\n //?? todo, separate yaml case by start with { or [}\n let isjson = ostr[0] === '{' || ostr[0] === '[';\n if (isjson)\n obj = JSON.parse(str, reviver);\n else\n obj = jsyaml.safeLoad(str);\n\n const map = isjson ? {} : 'NO MAP FOR YAML'; // map from #k to (possibly transformed) object\n var maxd = 0; // depth control\n var visited = isjson ? 'NO VISITED FOR JSON' : new Set(); // visited objects, to stop visit recursion\n var gxref = 0; // count to keep track of xref, used to patch missing array #k\n obj = refmap(obj, 0); // pass to recreate classes and compute #xref map if isjson\n if (isjson) {\n gxref = 0; // count to keep track of xref, used for debug\n repmap(obj, 0, ''); // map in the duplicate references #k/#xref\n }\n // log ('dstring maxd', maxd);\n return obj;\n\n // add class information from name2class, and call their Init() function if present\n // and make a map of all object references (isjson only)\n function refmap(o, d) {\n if (o === null) return;\n if (typeof o !== 'object') return o; // why did I not have that before???\n\n if (isjson) {\n const myxref = gxref;\n if (o['#k'] !== myxref) {\n if (o['#xref'] !== undefined) // its an xref object, does not count\n return o;\n else if (o instanceof Array)\n o['#k'] = myxref; // it's an Array and its #k field was lost by serialization\n else\n log('refmap', o['#k'], myxref, o); // something really is wrong\n }\n if ('#xref' in o) return o; // ref in JSON case\n gxref++;\n } else {\n // for yaml, which has already expanded multiple/circular references\n // note only the unclassed object will be polluted by #replaced, so no need to clean it up\n if (o['#replaced']) // revisit to yaml class object\n return o['#replaced']; //\n if (visited.has(o)) return o; // revisit to yaml non-call object\n visited.add(o);\n }\n\n // common to yaml or no yaml\n if (d > maxd) maxd = d;\n if (d > 25)\n log(\"stack?\", d);\n if (d > 30)\n throwe('stack overload in refmap');\n if (typeof o === \"object\") {\n // mark and recurse first, before we add extra prototype detail\n for (var i in o)\n if (i === 'frameSaver') // gets confused with frameSaver, we should have avoided saving it\n o[i] = undefined;\n else {\n let soi = o[i]; // remember old for debug\n // o[i] will change when a ##c Class object is replaced by a new Class object\n o[i] = refmap(o[i], map, d + 1);\n // o = o; // debug\n }\n\n // make an object of the correct class if such a class is defined\n const classname = o['##c'];\n if (classname) {\n //PJT when loading CSynth from website in Safari, I was seeing this fail to as lots of things had 'initGlobals.' prepended to name...\n //(as of this writing, the server isn't running on my dev machine for some reason, so not tested this change...)\n // const cl2 = name2class[classname] ? name2class[classname] : name2class['initGlobals.' + classname];\n let con2 = xconstructors[classname];\n if (!con2) con2 = xconstructors[classname] = getConstructor(classname);\n if (!con2) serious('no constructor found for class', classname);\n const newo = new con2(); // we have found the class, make a new objects\n if (typeof o.Init === \"function\") o.Init(); // call Init if there\n for (let k in o) // and copy over all the non-pollution fields\n if (k !== '##c') newo[k] = o[k];\n if (!isjson) o['#replaced'] = newo; // o is un-classed, newo is classed equivalent, save for yaml revisits\n o = newo;\n } else {\n if (typeof o.Init === \"function\") o.Init();\n } // classname\n\n }\n if ('#k' in o) {\n if (isjson)\n map[o['#k']] = o; // remember the object for its key, it will be the class object if appropriate\n else\n console.error('unexpected #k field for yaml in object', o)\n }\n return o;\n }\n\n\n // substitute all xref references with the appropriate object\n // does not apply in yaml case, yaml has done this work\n // will not be called in yaml case as map will be empty\n function repmap(o, d, path) { // ccc counts up xref\n if (d > 25)\n log(\"stack?\", d);\n if (o === null) return;\n if (typeof o === \"object\") {\n if (o['#k'] !== gxref && o['#k'] !== undefined)\n log('remap', o['#k'], gxref);\n // history note ... Array was special case becuase serialization lost #k field. Now handled in refmap above\n // #k serves two purposes.\n // One it to allow the cross references to be mapped (in refmap above)\n // The other is to ensure that the logic below applies to saved objects exactly once\n // and that no attempt is made to apply it to unsaved objects (eg recreated during class csontruction/Init)\n // Other undefined can be because of fields not saved in original serialization\n // but created by class reconstruction: eg Dispobj will automatically create a THREE.Scene\n if (o['#k'] === undefined) // && !(o instanceof Array))\n return;\n delete o['#k'];\n gxref++;\n for (var i in o) {\n var pd = Object.getOwnPropertyDescriptor(o, i);\n //if (!(i === \"constructor\" && !o.hasOwnProperty(\"constructor\")))\n if (!(pd && 'value' in pd)) continue;\n var oi = o[i];\n if (!oi) continue;\n var xref = oi['#xref'];\n delete oi['#xref']; // no need, xref object has done its task and is now orphaned\n if (xref !== undefined) {\n o[i] = map[xref];\n if (o[i] === undefined)\n console.log(\"unexpected #xref found: \" + xref);\n } else {\n repmap(oi, map, path + '.' + i);\n }\n }\n }\n }\n}","title":""},{"docid":"09e6e553e7a00a3595ba8e75c0233582","score":"0.53645307","text":"function i(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"09e6e553e7a00a3595ba8e75c0233582","score":"0.53645307","text":"function i(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"09e6e553e7a00a3595ba8e75c0233582","score":"0.53645307","text":"function i(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"55a755858c8a79d3d85a0d01940886ee","score":"0.53421676","text":"_stringify(d){\n return JSON.stringify(d);\n }","title":""},{"docid":"dfff9a4dc481f85bed462b64c8f4febc","score":"0.5338041","text":"serialize(value) {\n return value.toString();\n }","title":""},{"docid":"bff46aa20ae280c1765952410bd550c4","score":"0.5331462","text":"function jsStringify(str) {\n return JSON.stringify(str);\n}","title":""},{"docid":"bff46aa20ae280c1765952410bd550c4","score":"0.5331462","text":"function jsStringify(str) {\n return JSON.stringify(str);\n}","title":""},{"docid":"bff46aa20ae280c1765952410bd550c4","score":"0.5331462","text":"function jsStringify(str) {\n return JSON.stringify(str);\n}","title":""},{"docid":"68c55086033d51e601e850db05af3559","score":"0.53208774","text":"function r(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"68c55086033d51e601e850db05af3559","score":"0.53208774","text":"function r(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"68c55086033d51e601e850db05af3559","score":"0.53208774","text":"function r(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"82822987966636f51e145df775e24711","score":"0.5312066","text":"function str(val) {\n\treturn { \"@string\": val };\n}","title":""},{"docid":"e9abbb520076a43a02913b313fcb9e98","score":"0.53008306","text":"function stringify(o) {\n\t\tvar stack = [];\n\n\t\tfunction _serialize(h, key) {\n\t\t\tvar value = h[key],\n\t\t\t\tt\t = typeof value,\n\t\t\t\ta\t = [],\n\t\t\t\tCOLON = ':',\n\t\t\t\tCOMMA = ',',\n\t\t\t\tNULL = 'null',\n\t\t\t\tarr, i, keys, k, v;\n\n\t\t\t// Per the ECMA 5 spec, toJSON is applied before the replacer is\n\t\t\t// called. Also per the spec, Date.prototype.toJSON has been added, so\n\t\t\t// Date instances should be serialized prior to exposure to the\n\t\t\t// replacer. I disagree with this decision, but the spec is the spec.\n\t\t\tif (value && typeof value === 'object' && typeof value.toJSON === 'function') {\n\t\t\t\tvalue = value.toJSON(key);\n\t\t\t}\n\n\t\t\tif (value !== h[key]) {\n\t\t\t\tt = typeof value;\n\t\t\t}\n\n\t\t\tif (value === null) return NULL;\n\n\t\t\tswitch (t) {\n\t\t\t\tcase 'object' : break;\n\t\t\t\tcase 'string' : return _string(value);\n\t\t\t\tcase 'number' : return isFinite(value) ? value + '' : NULL;\n\t\t\t\tcase 'boolean':\n\t\t\t\tdefault\t : return String(value);\n\t\t\t}\n\n\t\t\t// Check for cyclical references in nested objects\n\t\t\tfor (i = stack.length - 1; i >= 0; --i) {\n\t\t\t\tif (stack[i] === value) {\n\t\t\t\t\tthrow new Error(\"JSON.stringify. Cyclical reference\");\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tarr = toString.call(value) === '[object Array]' || (('length' in value) && value.slice);\n\n\t\t\t// Add the object to the processing stack\n\t\t\tstack.push(value);\n\n\t\t\tif (arr) { // Array\n\t\t\t\tfor (i = value.length - 1; i >= 0; --i) {\n\t\t\t\t\ta[i] = _serialize(value, i) || NULL;\n\t\t\t\t}\n\t\t\t} else { // Object\n\t\t\t\t// If whitelist provided, take only those keys\n\t\t\t\tkeys = value;\n\t\t\t\ti = 0;\n\n\t\t\t\tfor (k in keys) {\n\t\t\t\t\tif (keys.hasOwnProperty(k)) {\n\t\t\t\t\t\tv = _serialize(value, k);\n\t\t\t\t\t\tif (v) {\n\t\t\t\t\t\t\ta[i++] = _string(k) + COLON + v;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// remove the array from the stack\n\t\t\tstack.pop();\n\n\t\t\treturn arr ? '[' + a.join(COMMA) + ']': '{' + a.join(COMMA) + '}';\n\t\t}\n\n\t\t// process the input\n\t\treturn _serialize({'':o}, '');\n\t}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""},{"docid":"aa9dab14fff55bcd625896a14045a8f9","score":"0.52875483","text":"function n(t){return null==t?\"\":\"object\"==typeof t?JSON.stringify(t,null,2):String(t)}","title":""}],"string":"[\n {\n \"docid\": \"a377fdb4ac27e03b22388b7c4db145c6\",\n \"score\": \"0.61210936\",\n \"text\": \"function stringify() {\\n return parser.stringify();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dab958f55359b8b37c49dde68fd5c58\",\n \"score\": \"0.5834731\",\n \"text\": \"serialize() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eee5d156e67b52b26d5863e9e69f2ada\",\n \"score\": \"0.5787522\",\n \"text\": \"function stringify(data) {\\n\\t\\tif(JSON)\\n\\t\\t\\treturn(JSON.stringify(data));\\n\\t\\telse {\\n\\t\\t\\t//Throw exception\\n\\t\\t\\t//TODO: Is there any other solution for non JSON? caniuse say there is a 96.58% coverage for JSON parsing...\\n\\t\\t\\tthrowEx('No JSON support.');\\n\\t\\t\\treturn(data);\\t\\t\\t\\t\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f637ddd60af67cf2b9040391237570d\",\n \"score\": \"0.57447946\",\n \"text\": \"function serialize(o) {\\n var p = 0, sb = [], ht = [], hv = 1;\\n var classname = function(o) {\\n if (typeof(o) == \\\"undefined\\\" || typeof(o.constructor) == \\\"undefined\\\") return '';\\n var c = o.constructor.toString();\\n c = utf16to8(c.substr(0, c.indexOf('(')).replace(/(^\\\\s*function\\\\s*)|(\\\\s*$)/ig, ''));\\n return ((c == '') ? 'Object' : c);\\n };\\n var is_int = function(n) {\\n var s = n.toString(), l = s.length;\\n if (l > 11) return false;\\n for (var i = (s.charAt(0) == '-') ? 1 : 0; i < l; i++) {\\n switch (s.charAt(i)) {\\n case '0':\\n case '1':\\n case '2':\\n case '3':\\n case '4':\\n case '5':\\n case '6':\\n case '7':\\n case '8':\\n case '9': break;\\n default : return false;\\n }\\n }\\n return !(n < -2147483648 || n > 2147483647);\\n };\\n var in_ht = function(o) {\\n for (k in ht) if (ht[k] === o) return k;\\n return false;\\n };\\n var ser_null = function() {\\n sb[p++] = 'N;';\\n };\\n var ser_boolean = function(b) {\\n sb[p++] = (b ? 'b:1;' : 'b:0;');\\n };\\n var ser_integer = function(i) {\\n sb[p++] = 'i:' + i + ';';\\n };\\n var ser_double = function(d) {\\n if (isNaN(d)) d = 'NAN';\\n else if (d == Number.POSITIVE_INFINITY) d = 'INF';\\n else if (d == Number.NEGATIVE_INFINITY) d = '-INF';\\n sb[p++] = 'd:' + d + ';';\\n };\\n var ser_string = function(s) {\\n var utf8 = utf16to8(s);\\n sb[p++] = 's:' + utf8.length + ':\\\"';\\n sb[p++] = utf8;\\n sb[p++] = '\\\";';\\n };\\n var ser_array = function(a) {\\n sb[p++] = 'a:';\\n var lp = p;\\n sb[p++] = 0;\\n sb[p++] = ':{';\\n for (var k in a) {\\n if (typeof(a[k]) != 'function') {\\n is_int(k) ? ser_integer(k) : ser_string(k);\\n __serialize(a[k]);\\n sb[lp]++;\\n }\\n }\\n sb[p++] = '}';\\n };\\n var ser_object = function(o) {\\n var cn = classname(o);\\n if (cn == '') ser_null();\\n else if (typeof(o.serialize) != 'function') {\\n sb[p++] = 'O:' + cn.length + ':\\\"';\\n sb[p++] = cn;\\n sb[p++] = '\\\":';\\n var lp = p;\\n sb[p++] = 0;\\n sb[p++] = ':{';\\n if (typeof(o.__sleep) == 'function') {\\n var a = o.__sleep();\\n for (var kk in a) {\\n ser_string(a[kk]);\\n __serialize(o[a[kk]]);\\n sb[lp]++;\\n }\\n }\\n else {\\n for (var k in o) {\\n if (typeof(o[k]) != 'function') {\\n ser_string(k);\\n __serialize(o[k]);\\n sb[lp]++;\\n }\\n }\\n }\\n sb[p++] = '}';\\n }\\n else {\\n var cs = o.serialize();\\n sb[p++] = 'C:' + cn.length + ':\\\"';\\n sb[p++] = cn;\\n sb[p++] = '\\\":' + cs.length + ':{';\\n sb[p++] = cs;\\n sb[p++] = \\\"}\\\";\\n }\\n };\\n var ser_pointref = function(R) {\\n sb[p++] = \\\"R:\\\" + R + \\\";\\\";\\n };\\n var ser_ref = function(r) {\\n sb[p++] = \\\"r:\\\" + r + \\\";\\\";\\n };\\n var __serialize = function(o) {\\n if (o == null || o.constructor == Function) {\\n hv++;\\n ser_null();\\n }\\n else switch (o.constructor) {\\n case Boolean: {\\n hv++;\\n ser_boolean(o);\\n break;\\n }\\n case Number: {\\n hv++;\\n is_int(o) ? ser_integer(o) : ser_double(o);\\n break;\\n }\\n case String: {\\n hv++;\\n ser_string(o);\\n break;\\n }\\n/*@cc_on @*/\\n/*@if (@_jscript)\\n case VBArray: {\\n o = o.toArray();\\n }\\n@end @*/\\n case Array: {\\n var r = in_ht(o);\\n if (r) {\\n ser_pointref(r);\\n }\\n else {\\n ht[hv++] = o;\\n ser_array(o);\\n }\\n break;\\n }\\n default: {\\n var r = in_ht(o);\\n if (r) {\\n hv++;\\n ser_ref(r);\\n }\\n else {\\n ht[hv++] = o;\\n ser_object(o);\\n }\\n break;\\n }\\n }\\n };\\n __serialize(o);\\n return sb.join('');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fa09b02a98402beffbb47d1f8ff97ce\",\n \"score\": \"0.5707002\",\n \"text\": \"function compareParse() {\\n\\n\\tparseableStrings.forEach(function(test) {\\n\\tconsole.log(test);\\n console.log(\\\"parseJSON = \\\" + parseJSON(test)); \\n \\n console.log(\\\"JSON.parse = \\\" + JSON.parse(test));\\n\\n console.log(\\\"stringified parseJSON = \\\" + JSON.stringify(parseJSON(test)));\\n console.log(\\\"stringified JSON.parse = \\\" + JSON.stringify(JSON.parse(test)));\\n\\n console.log(\\\"=======================================\\\");\\n });\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"482416b96898c2bd085576c17fd6952e\",\n \"score\": \"0.5667786\",\n \"text\": \"static stringParseEncodedObject(serializedObject,scope={},name='scope'){if(serializedObject.endsWith('.json')&&Tools.isFileSync(serializedObject))serializedObject=fileSystem.readFileSync(serializedObject,{encoding:'utf-8'});if(!serializedObject.startsWith('{'))serializedObject=eval('Buffer').from(serializedObject,'base64').toString('utf8');let result;try{result=new Function(name,`return ${serializedObject}`)(scope)}catch(error){}if(typeof result==='object')return result;return null}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0304f5550677505366a922aaf93f208a\",\n \"score\": \"0.5634791\",\n \"text\": \"function test(){ /** JSON.stringify() and large integers */\\r\\n\\tvar obj={\\\"largest non-double\\\":2147483647, \\\"smallest non-double\\\": -2147483648, \\\"the time - a double\\\":1278339272556}\\r\\n\\tobj[16777215]='#ffffff in decimal, now as property name';\\r\\n\\tvar str=JSON.stringify(obj);\\r\\n\\tvar passed = str.indexOf( '16777215' ) >-1 &&\\r\\n\\t\\tstr.indexOf( '2147483647' ) >-1 &&\\r\\n\\t\\tstr.indexOf( '-2147483648' ) >-1 &&\\r\\n\\t\\tstr.indexOf( '16777215' ) >-1 &&\\r\\n\\t\\tstr.indexOf( '1278339272556' ) >-1 ; /* the last one is double internally but is expected to stringify fine.. */\\r\\n\\treturn passed;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a63808ab29d4d3a7207e21adaf2bded9\",\n \"score\": \"0.55503386\",\n \"text\": \"function JSON_stringify(s, emit_unicode) {\\n if (s) {\\n var json = JSON.stringify(s);\\n if (json) {\\n return emit_unicode ? json : json.replace(jsonRegex, jsonRegexReplace);\\n }\\n else {\\n return json;\\n }\\n }\\n else {\\n return s;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"600e0fe69d9c8c60512a120c50605725\",\n \"score\": \"0.5545554\",\n \"text\": \"function serializeJson(obj) {\\r\\n // firefox provides uneval()\\r\\n if (typeof uneval === \\\"function\\\") {\\r\\n var json = uneval(obj);\\r\\n return json.substring(1, json.length-1);\\r\\n }\\r\\n // others\\r\\n var buf = \\\"\\\";\\r\\n for (var attr in obj) {\\r\\n buf += \\\" \\\" + attr + \\\": \\\" + obj[attr];\\r\\n }\\r\\n return \\\"{\\\" + buf + \\\" }\\\";\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5ba8640e0a6e45a466ac3aeb373774d\",\n \"score\": \"0.54870814\",\n \"text\": \"function stringifyNumbers(obj) {\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df8c54c53ee8f089d27995bf2ad98d67\",\n \"score\": \"0.54802066\",\n \"text\": \"function unserialize(data) {\\n // discuss at: http://phpjs.org/functions/unserialize/\\n // original by: Arpad Ray (mailto:arpad@php.net)\\n // improved by: Pedro Tainha (http://www.pedrotainha.com)\\n // improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)\\n // improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)\\n // improved by: Chris\\n // improved by: James\\n // improved by: Le Torbi\\n // improved by: Eli Skeggs\\n // bugfixed by: dptr1988\\n // bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)\\n // bugfixed by: Brett Zamir (http://brett-zamir.me)\\n // revised by: d3x\\n // input by: Brett Zamir (http://brett-zamir.me)\\n // input by: Martin (http://www.erlenwiese.de/)\\n // input by: kilops\\n // input by: Jaroslaw Czarniak\\n // note: We feel the main purpose of this function should be to ease the transport of data between php & js\\n // note: Aiming for PHP-compatibility, we have to translate objects to arrays\\n // example 1: unserialize('a:3:{i:0;s:5:\\\"Kevin\\\";i:1;s:3:\\\"van\\\";i:2;s:9:\\\"Zonneveld\\\";}');\\n // returns 1: ['Kevin', 'van', 'Zonneveld']\\n // example 2: unserialize('a:3:{s:9:\\\"firstName\\\";s:5:\\\"Kevin\\\";s:7:\\\"midName\\\";s:3:\\\"van\\\";s:7:\\\"surName\\\";s:9:\\\"Zonneveld\\\";}');\\n // returns 2: {firstName: 'Kevin', midName: 'van', surName: 'Zonneveld'}\\n\\n var that = this,\\n utf8Overhead = function(chr) {\\n // http://phpjs.org/functions/unserialize:571#comment_95906\\n var code = chr.charCodeAt(0);\\n if (code < 0x0080) {\\n return 0;\\n }\\n if (code < 0x0800) {\\n return 1;\\n }\\n return 2;\\n };\\n error = function(type, msg, filename, line) {\\n throw new that.window[type](msg, filename, line);\\n };\\n read_until = function(data, offset, stopchr) {\\n var i = 2,\\n buf = [],\\n chr = data.slice(offset, offset + 1);\\n\\n while (chr != stopchr) {\\n if ((i + offset) > data.length) {\\n error('Error', 'Invalid');\\n }\\n buf.push(chr);\\n chr = data.slice(offset + (i - 1), offset + i);\\n i += 1;\\n }\\n return [buf.length, buf.join('')];\\n };\\n read_chrs = function(data, offset, length) {\\n var i, chr, buf;\\n\\n buf = [];\\n for (i = 0; i < length; i++) {\\n chr = data.slice(offset + (i - 1), offset + i);\\n buf.push(chr);\\n length -= utf8Overhead(chr);\\n }\\n return [buf.length, buf.join('')];\\n };\\n _unserialize = function(data, offset) {\\n var dtype, dataoffset, keyandchrs, keys, contig,\\n length, array, readdata, readData, ccount,\\n stringlength, i, key, kprops, kchrs, vprops,\\n vchrs, value, chrs = 0,\\n typeconvert = function(x) {\\n return x;\\n };\\n\\n if (!offset) {\\n offset = 0;\\n }\\n dtype = (data.slice(offset, offset + 1))\\n .toLowerCase();\\n\\n dataoffset = offset + 2;\\n\\n switch (dtype) {\\n case 'i':\\n typeconvert = function(x) {\\n return parseInt(x, 10);\\n };\\n readData = read_until(data, dataoffset, ';');\\n chrs = readData[0];\\n readdata = readData[1];\\n dataoffset += chrs + 1;\\n break;\\n case 'b':\\n typeconvert = function(x) {\\n return parseInt(x, 10) !== 0;\\n };\\n readData = read_until(data, dataoffset, ';');\\n chrs = readData[0];\\n readdata = readData[1];\\n dataoffset += chrs + 1;\\n break;\\n case 'd':\\n typeconvert = function(x) {\\n return parseFloat(x);\\n };\\n readData = read_until(data, dataoffset, ';');\\n chrs = readData[0];\\n readdata = readData[1];\\n dataoffset += chrs + 1;\\n break;\\n case 'n':\\n readdata = null;\\n break;\\n case 's':\\n ccount = read_until(data, dataoffset, ':');\\n chrs = ccount[0];\\n stringlength = ccount[1];\\n dataoffset += chrs + 2;\\n\\n readData = read_chrs(data, dataoffset + 1, parseInt(stringlength, 10));\\n chrs = readData[0];\\n readdata = readData[1];\\n dataoffset += chrs + 2;\\n if (chrs != parseInt(stringlength, 10) && chrs != readdata.length) {\\n error('SyntaxError', 'String length mismatch');\\n }\\n break;\\n case 'a':\\n readdata = {};\\n\\n keyandchrs = read_until(data, dataoffset, ':');\\n chrs = keyandchrs[0];\\n keys = keyandchrs[1];\\n dataoffset += chrs + 2;\\n\\n length = parseInt(keys, 10);\\n contig = true;\\n\\n for (i = 0; i < length; i++) {\\n kprops = _unserialize(data, dataoffset);\\n kchrs = kprops[1];\\n key = kprops[2];\\n dataoffset += kchrs;\\n\\n vprops = _unserialize(data, dataoffset);\\n vchrs = vprops[1];\\n value = vprops[2];\\n dataoffset += vchrs;\\n\\n if (key !== i)\\n contig = false;\\n\\n readdata[key] = value;\\n }\\n\\n if (contig) {\\n array = new Array(length);\\n for (i = 0; i < length; i++)\\n array[i] = readdata[i];\\n readdata = array;\\n }\\n\\n dataoffset += 1;\\n break;\\n default:\\n error('SyntaxError', 'Unknown / Unhandled data type(s): ' + dtype);\\n break;\\n }\\n return [dtype, dataoffset - offset, typeconvert(readdata)];\\n };\\n\\n return _unserialize((data + ''), 0)[2];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e84cd011ad1b05e34bf73b467724df6\",\n \"score\": \"0.5476022\",\n \"text\": \"function ser (value){//why do you exist!! arrrrgh!!!\\n return value = null ? null :\\n JSON.parse(JSON.stringify(value))\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf743dd036e4621722e58873389e3324\",\n \"score\": \"0.54716957\",\n \"text\": \"serialize (target, encoding = \\\"json\\\") {\\n const ref = new WeakMap()\\n const simplify = (target, path) => {\\n let result\\n if (typeof target !== \\\"object\\\" && typeof target !== \\\"function\\\")\\n result = target.valueOf()\\n else {\\n if (ref.has(target))\\n result = { $t: \\\"Ref\\\", $d: [ ref.get(target) ] }\\n else {\\n ref.set(target, path)\\n if (typeof target === \\\"object\\\") {\\n if (target instanceof RegExp)\\n result = { $t: \\\"RegExp\\\", $d: [ target.source, target.flags ] }\\n else if (target instanceof Date)\\n result = { $t: \\\"Date\\\", $d: [ target.valueOf() ] }\\n else if (target instanceof Map)\\n result = { $t: \\\"Map\\\", $d: Array.from(target.entries()).map((entry) => {\\n entry[1] = simplify(entry[1], simoUtil.concatPath(path, entry[0]))\\n return entry\\n }) }\\n else if (target instanceof Set) {\\n let i = 0\\n result = { $t: \\\"Set\\\", $d: Array.from(target.values()).map((val) =>\\n simplify(val, simoUtil.concatPath(path, i++))\\n ) }\\n }\\n else if (target instanceof Array) {\\n let i = 0\\n result = target.map((val) => simplify(val, simoUtil.concatPath(path, i++)))\\n }\\n else {\\n /* store an Object in \\\"entries\\\" form to preserve ordering */\\n result = { $t: \\\"Object\\\", $d: Array.from(Object.entries.call(null, target))\\n .sort((a, b) => b[0].localeCompare(a[0]))\\n .map((entry) => {\\n entry[1] = simplify(entry[1], simoUtil.concatPath(path, entry[0]))\\n return entry\\n })\\n }\\n }\\n }\\n else if (typeof target === \\\"function\\\") {\\n result = {\\n $t: \\\"Function\\\",\\n $d: [ target.toString(),\\n Array.from(Object.entries.call(null, target))\\n .sort((a, b) => b[0].localeCompare(a[0]))\\n .map((entry) => {\\n entry[1] = simplify(entry[1], simoUtil.concatPath(path, entry[0]))\\n return entry\\n })\\n ]\\n }\\n }\\n }\\n }\\n return result\\n }\\n const obj = simplify(target, \\\"\\\")\\n const blob = JSON.stringify(obj)\\n return blob\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c824e3bff966c67cbbe04607f834ba9\",\n \"score\": \"0.5466052\",\n \"text\": \"function unitTest_s_1()\\n{\\n var obj = 7;\\n\\n simpleStringifyTest(obj, null, '{\\\"jss\\\":1,\\\"v\\\":7}');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bdee9f3fe543c2c08867b14283239287\",\n \"score\": \"0.54462427\",\n \"text\": \"function str(text) {\\n return JSON.stringify(text);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37690bafef745c053183a9a004eeaeea\",\n \"score\": \"0.5443979\",\n \"text\": \"function string(str) {\\n return _serializeString(str);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fc2bc61fb96c5e7d0d58bea8f4fbc0b\",\n \"score\": \"0.54351455\",\n \"text\": \"function stringify(attrs) {\\n function walk(attr) {\\n for (var k in attr) {\\n if (isPlainObject(attr[k])) {\\n walk(attr[k]);\\n } else if (Array.isArray(attr[k])) {\\n for (var i = 0; i < attr[k].length; i++) {\\n walk(attr[k][i]);\\n }\\n } else {\\n // as JSON.stringify(/test/) // => {}\\n if (attr[k] instanceof RegExp) {\\n attr[k] = attr[k].toString();\\n }\\n }\\n }\\n }\\n walk(attrs);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05b1d15b3c03e31b7f2b57fd73fad8fc\",\n \"score\": \"0.54343134\",\n \"text\": \"function unStringify(str){\\n // Searches for \\\" or ' at the Start and End index\\n if((startIndex === '\\\\\\\"' || startIndex === '\\\\'') && (endIndex === '\\\\\\\"' || endIndex === '\\\\'')){\\n //\\n return str.slice(startIndex, endIndex);\\n }\\n return str;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5a3382d787f2aa33cf0fc5039b7079f\",\n \"score\": \"0.5431235\",\n \"text\": \"function stringify(attrs) {\\n function walk(attr) {\\n for(var k in attr) {\\n if(isPlainObject(attr[k])) {\\n walk(attr[k]);\\n } else if(Array.isArray(attr[k])) {\\n for(var i = 0; i < attr[k].length; i++) {\\n walk(attr[k][i]);\\n }\\n } else {\\n // as JSON.stringify(/test/) // => {}\\n if(attr[k] instanceof RegExp) {\\n attr[k] = attr[k].toString();\\n }\\n }\\n }\\n }\\n\\n walk(attrs);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7eb035441d727ae26bb78f01ede7b02\",\n \"score\": \"0.5429552\",\n \"text\": \"function fastAndSafeJsonStringify(rec) {\\n try {\\n return JSON.stringify(rec);\\n } catch (ex) {\\n try {\\n return JSON.stringify(rec, safeCycles());\\n } catch (e) {\\n if (safeJsonStringify) {\\n return safeJsonStringify(rec);\\n } else {\\n var dedupKey = e.stack.split(/\\\\n/g, 3).join('\\\\n');\\n _warn('bunyan: ERROR: Exception in '\\n + '`JSON.stringify(rec)`. You can install the '\\n + '\\\"safe-json-stringify\\\" module to have Bunyan fallback '\\n + 'to safer stringification. Record:\\\\n'\\n + _indent(format('%s\\\\n%s', util.inspect(rec), e.stack)),\\n dedupKey);\\n return format('(Exception in JSON.stringify(rec): %j. '\\n + 'See stderr for details.)', e.message);\\n }\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bab4cea78745cd072e34e03e684543d\",\n \"score\": \"0.54169923\",\n \"text\": \"function testStringify(x) {\\n var t = JSON.stringify(x);\\n print(typeof t, t);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6bdf5209038d5854713fd2237777ebfe\",\n \"score\": \"0.54151595\",\n \"text\": \"function dstring(ostr) {\\n // mapOnce(); // no longer needed, we compute contructors using getConstructor()\\n var str = ostr;\\n\\n // to consider, should refmap be integrated into reviver ???\\n var reviver = (key, value) => key === 'frameSaver' && !nwfs ? undefined : value; // TODO generalize or ...??? stephen 21/01/2017\\n // var o = JSON.parse(str, reviver);\\n let obj;\\n //?? todo, separate yaml case by start with { or [}\\n let isjson = ostr[0] === '{' || ostr[0] === '[';\\n if (isjson)\\n obj = JSON.parse(str, reviver);\\n else\\n obj = jsyaml.safeLoad(str);\\n\\n const map = isjson ? {} : 'NO MAP FOR YAML'; // map from #k to (possibly transformed) object\\n var maxd = 0; // depth control\\n var visited = isjson ? 'NO VISITED FOR JSON' : new Set(); // visited objects, to stop visit recursion\\n var gxref = 0; // count to keep track of xref, used to patch missing array #k\\n obj = refmap(obj, 0); // pass to recreate classes and compute #xref map if isjson\\n if (isjson) {\\n gxref = 0; // count to keep track of xref, used for debug\\n repmap(obj, 0, ''); // map in the duplicate references #k/#xref\\n }\\n // log ('dstring maxd', maxd);\\n return obj;\\n\\n // add class information from name2class, and call their Init() function if present\\n // and make a map of all object references (isjson only)\\n function refmap(o, d) {\\n if (o === null) return;\\n if (typeof o !== 'object') return o; // why did I not have that before???\\n\\n if (isjson) {\\n const myxref = gxref;\\n if (o['#k'] !== myxref) {\\n if (o['#xref'] !== undefined) // its an xref object, does not count\\n return o;\\n else if (o instanceof Array)\\n o['#k'] = myxref; // it's an Array and its #k field was lost by serialization\\n else\\n log('refmap', o['#k'], myxref, o); // something really is wrong\\n }\\n if ('#xref' in o) return o; // ref in JSON case\\n gxref++;\\n } else {\\n // for yaml, which has already expanded multiple/circular references\\n // note only the unclassed object will be polluted by #replaced, so no need to clean it up\\n if (o['#replaced']) // revisit to yaml class object\\n return o['#replaced']; //\\n if (visited.has(o)) return o; // revisit to yaml non-call object\\n visited.add(o);\\n }\\n\\n // common to yaml or no yaml\\n if (d > maxd) maxd = d;\\n if (d > 25)\\n log(\\\"stack?\\\", d);\\n if (d > 30)\\n throwe('stack overload in refmap');\\n if (typeof o === \\\"object\\\") {\\n // mark and recurse first, before we add extra prototype detail\\n for (var i in o)\\n if (i === 'frameSaver') // gets confused with frameSaver, we should have avoided saving it\\n o[i] = undefined;\\n else {\\n let soi = o[i]; // remember old for debug\\n // o[i] will change when a ##c Class object is replaced by a new Class object\\n o[i] = refmap(o[i], map, d + 1);\\n // o = o; // debug\\n }\\n\\n // make an object of the correct class if such a class is defined\\n const classname = o['##c'];\\n if (classname) {\\n //PJT when loading CSynth from website in Safari, I was seeing this fail to as lots of things had 'initGlobals.' prepended to name...\\n //(as of this writing, the server isn't running on my dev machine for some reason, so not tested this change...)\\n // const cl2 = name2class[classname] ? name2class[classname] : name2class['initGlobals.' + classname];\\n let con2 = xconstructors[classname];\\n if (!con2) con2 = xconstructors[classname] = getConstructor(classname);\\n if (!con2) serious('no constructor found for class', classname);\\n const newo = new con2(); // we have found the class, make a new objects\\n if (typeof o.Init === \\\"function\\\") o.Init(); // call Init if there\\n for (let k in o) // and copy over all the non-pollution fields\\n if (k !== '##c') newo[k] = o[k];\\n if (!isjson) o['#replaced'] = newo; // o is un-classed, newo is classed equivalent, save for yaml revisits\\n o = newo;\\n } else {\\n if (typeof o.Init === \\\"function\\\") o.Init();\\n } // classname\\n\\n }\\n if ('#k' in o) {\\n if (isjson)\\n map[o['#k']] = o; // remember the object for its key, it will be the class object if appropriate\\n else\\n console.error('unexpected #k field for yaml in object', o)\\n }\\n return o;\\n }\\n\\n\\n // substitute all xref references with the appropriate object\\n // does not apply in yaml case, yaml has done this work\\n // will not be called in yaml case as map will be empty\\n function repmap(o, d, path) { // ccc counts up xref\\n if (d > 25)\\n log(\\\"stack?\\\", d);\\n if (o === null) return;\\n if (typeof o === \\\"object\\\") {\\n if (o['#k'] !== gxref && o['#k'] !== undefined)\\n log('remap', o['#k'], gxref);\\n // history note ... Array was special case becuase serialization lost #k field. Now handled in refmap above\\n // #k serves two purposes.\\n // One it to allow the cross references to be mapped (in refmap above)\\n // The other is to ensure that the logic below applies to saved objects exactly once\\n // and that no attempt is made to apply it to unsaved objects (eg recreated during class csontruction/Init)\\n // Other undefined can be because of fields not saved in original serialization\\n // but created by class reconstruction: eg Dispobj will automatically create a THREE.Scene\\n if (o['#k'] === undefined) // && !(o instanceof Array))\\n return;\\n delete o['#k'];\\n gxref++;\\n for (var i in o) {\\n var pd = Object.getOwnPropertyDescriptor(o, i);\\n //if (!(i === \\\"constructor\\\" && !o.hasOwnProperty(\\\"constructor\\\")))\\n if (!(pd && 'value' in pd)) continue;\\n var oi = o[i];\\n if (!oi) continue;\\n var xref = oi['#xref'];\\n delete oi['#xref']; // no need, xref object has done its task and is now orphaned\\n if (xref !== undefined) {\\n o[i] = map[xref];\\n if (o[i] === undefined)\\n console.log(\\\"unexpected #xref found: \\\" + xref);\\n } else {\\n repmap(oi, map, path + '.' + i);\\n }\\n }\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09e6e553e7a00a3595ba8e75c0233582\",\n \"score\": \"0.53645307\",\n \"text\": \"function i(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09e6e553e7a00a3595ba8e75c0233582\",\n \"score\": \"0.53645307\",\n \"text\": \"function i(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09e6e553e7a00a3595ba8e75c0233582\",\n \"score\": \"0.53645307\",\n \"text\": \"function i(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55a755858c8a79d3d85a0d01940886ee\",\n \"score\": \"0.53421676\",\n \"text\": \"_stringify(d){\\n return JSON.stringify(d);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfff9a4dc481f85bed462b64c8f4febc\",\n \"score\": \"0.5338041\",\n \"text\": \"serialize(value) {\\n return value.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bff46aa20ae280c1765952410bd550c4\",\n \"score\": \"0.5331462\",\n \"text\": \"function jsStringify(str) {\\n return JSON.stringify(str);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bff46aa20ae280c1765952410bd550c4\",\n \"score\": \"0.5331462\",\n \"text\": \"function jsStringify(str) {\\n return JSON.stringify(str);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bff46aa20ae280c1765952410bd550c4\",\n \"score\": \"0.5331462\",\n \"text\": \"function jsStringify(str) {\\n return JSON.stringify(str);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68c55086033d51e601e850db05af3559\",\n \"score\": \"0.53208774\",\n \"text\": \"function r(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68c55086033d51e601e850db05af3559\",\n \"score\": \"0.53208774\",\n \"text\": \"function r(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68c55086033d51e601e850db05af3559\",\n \"score\": \"0.53208774\",\n \"text\": \"function r(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82822987966636f51e145df775e24711\",\n \"score\": \"0.5312066\",\n \"text\": \"function str(val) {\\n\\treturn { \\\"@string\\\": val };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9abbb520076a43a02913b313fcb9e98\",\n \"score\": \"0.53008306\",\n \"text\": \"function stringify(o) {\\n\\t\\tvar stack = [];\\n\\n\\t\\tfunction _serialize(h, key) {\\n\\t\\t\\tvar value = h[key],\\n\\t\\t\\t\\tt\\t = typeof value,\\n\\t\\t\\t\\ta\\t = [],\\n\\t\\t\\t\\tCOLON = ':',\\n\\t\\t\\t\\tCOMMA = ',',\\n\\t\\t\\t\\tNULL = 'null',\\n\\t\\t\\t\\tarr, i, keys, k, v;\\n\\n\\t\\t\\t// Per the ECMA 5 spec, toJSON is applied before the replacer is\\n\\t\\t\\t// called. Also per the spec, Date.prototype.toJSON has been added, so\\n\\t\\t\\t// Date instances should be serialized prior to exposure to the\\n\\t\\t\\t// replacer. I disagree with this decision, but the spec is the spec.\\n\\t\\t\\tif (value && typeof value === 'object' && typeof value.toJSON === 'function') {\\n\\t\\t\\t\\tvalue = value.toJSON(key);\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (value !== h[key]) {\\n\\t\\t\\t\\tt = typeof value;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (value === null) return NULL;\\n\\n\\t\\t\\tswitch (t) {\\n\\t\\t\\t\\tcase 'object' : break;\\n\\t\\t\\t\\tcase 'string' : return _string(value);\\n\\t\\t\\t\\tcase 'number' : return isFinite(value) ? value + '' : NULL;\\n\\t\\t\\t\\tcase 'boolean':\\n\\t\\t\\t\\tdefault\\t : return String(value);\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Check for cyclical references in nested objects\\n\\t\\t\\tfor (i = stack.length - 1; i >= 0; --i) {\\n\\t\\t\\t\\tif (stack[i] === value) {\\n\\t\\t\\t\\t\\tthrow new Error(\\\"JSON.stringify. Cyclical reference\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tarr = toString.call(value) === '[object Array]' || (('length' in value) && value.slice);\\n\\n\\t\\t\\t// Add the object to the processing stack\\n\\t\\t\\tstack.push(value);\\n\\n\\t\\t\\tif (arr) { // Array\\n\\t\\t\\t\\tfor (i = value.length - 1; i >= 0; --i) {\\n\\t\\t\\t\\t\\ta[i] = _serialize(value, i) || NULL;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else { // Object\\n\\t\\t\\t\\t// If whitelist provided, take only those keys\\n\\t\\t\\t\\tkeys = value;\\n\\t\\t\\t\\ti = 0;\\n\\n\\t\\t\\t\\tfor (k in keys) {\\n\\t\\t\\t\\t\\tif (keys.hasOwnProperty(k)) {\\n\\t\\t\\t\\t\\t\\tv = _serialize(value, k);\\n\\t\\t\\t\\t\\t\\tif (v) {\\n\\t\\t\\t\\t\\t\\t\\ta[i++] = _string(k) + COLON + v;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t// remove the array from the stack\\n\\t\\t\\tstack.pop();\\n\\n\\t\\t\\treturn arr ? '[' + a.join(COMMA) + ']': '{' + a.join(COMMA) + '}';\\n\\t\\t}\\n\\n\\t\\t// process the input\\n\\t\\treturn _serialize({'':o}, '');\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9dab14fff55bcd625896a14045a8f9\",\n \"score\": \"0.52875483\",\n \"text\": \"function n(t){return null==t?\\\"\\\":\\\"object\\\"==typeof t?JSON.stringify(t,null,2):String(t)}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":74,"cells":{"query_id":{"kind":"string","value":"c87d94629de56989a7c39ae00829b47c"},"query":{"kind":"string","value":"The individual responsible for making the annotation."},"positive_passages":{"kind":"list like","value":[{"docid":"d91fa62431420ca8b177433d3e98a2f2","score":"0.0","text":"get authorReference () {\r\n\t\treturn this._authorReference;\r\n\t}","title":""}],"string":"[\n {\n \"docid\": \"d91fa62431420ca8b177433d3e98a2f2\",\n \"score\": \"0.0\",\n \"text\": \"get authorReference () {\\r\\n\\t\\treturn this._authorReference;\\r\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"94373dcf82a3cd1e2265778b0ab87d07","score":"0.612936","text":"get individual() {\n\t\treturn this.__individual;\n\t}","title":""},{"docid":"fe54ec14db14fbf1803d31950d9eb52c","score":"0.59623784","text":"function Annotation() {\n this.guid_ = tr.b.GUID.allocateSimple();\n this.view_ = undefined;\n }","title":""},{"docid":"14bd28df2d121ae40c16c68c421da651","score":"0.57922035","text":"enterAnnotation_identifier(ctx) {\n\t}","title":""},{"docid":"1c4620fcc70ee8f4fd2b1e4f8ffbe67d","score":"0.565819","text":"createBaseAnnotation(page, rect, contents, author) {\n let annot = new parser_1.Annotation();\n annot.type = \"/Annot\",\n annot.page = page,\n annot.object_id = this.parser.getFreeObjectId(),\n annot.id = this.generateUniqueIdentifier(),\n annot.rect = rect,\n annot.author = author,\n annot.pageReference = this.parser.getPage(page),\n annot.updateDate = util_1.Util.convertDateToPDFDate(new Date()),\n annot.contents = contents,\n annot.border = this.createDefaultBorder();\n return annot;\n }","title":""},{"docid":"9e091eafd88fa0251fa9b4f9a878d953","score":"0.56517684","text":"function Annotation(annotationType, tmpSource, tmpTarget) {\n this.base = Relationship;\n this.base(\"Annotation\", \n tmpSource, \n tmpTarget, \n new Array(MASH_EVENT.OBJECT_MOVE), \n new Array(MASH_EVENT.OBJECT_MOVE)\n );\n this.type = annotationType;\n}","title":""},{"docid":"d73a8e8017cd5dcc9c8b1570576cd793","score":"0.5615035","text":"function createAnnotation() {\n var annObj = {\n filename: fileNameStr,\n submitted_by: cudEmailStr,\n };\n\n if (currentHeaderPos || currentHeaderPos === 0) {\n annObj.position = currentHeaderPos\n }\n\n return annObj;\n}","title":""},{"docid":"4a81170f66360026cc93be9583207009","score":"0.5560231","text":"get type() {\n return \"xeogl.Annotation\";\n }","title":""},{"docid":"c9731a8b608d9803010baafb4e433a5b","score":"0.5529988","text":"add(annotation) {\n // this.SetPrint(annotation);\n this.doAdd(annotation);\n }","title":""},{"docid":"c9731a8b608d9803010baafb4e433a5b","score":"0.5529988","text":"add(annotation) {\n // this.SetPrint(annotation);\n this.doAdd(annotation);\n }","title":""},{"docid":"0cc0a736b1b520191a5cfe745511e3b3","score":"0.54946357","text":"function createAnnotation(type) {\n var component;\n var instanceName;\n if (type == TokenType.Font) {\n component = figma.currentPage.findOne(n => n.name === \"Token Annotation / Typography\");\n instanceName = \"Font Annotation\";\n }\n else {\n component = figma.currentPage.findOne(n => n.name === \"Token Annotation / Color\");\n instanceName = \"Color Token Annotation\";\n }\n if (component != undefined) {\n var instance = component.createInstance();\n instance.name = instanceName;\n return instance;\n }\n else {\n console.log(\"Error: Could not creat annotation instance\");\n }\n}","title":""},{"docid":"40d074b6245858948ac4d590503e8168","score":"0.5455473","text":"function saveAnnotation(e)\n{\n // This can be an event in more than one way with more than one\n // object\n if (this.wrapper)\n {\n var anot = this.wrapper;\n }\n else\n {\n var anot = this;\n }\n\n jsonCall\n (\n 'Annotate',\n 'message=' + anot.contentEl.value\n + '&url=' + encodeURIComponent(currentPage)\n + '&element_id=' + anot.subjectElement.id\n + '&uniqid=' + anot.uniqid\n + '&x_pos=' + (parseInt(anot.style.left) - getOffset(anot.subjectElement, 'Left'))\n + '&y_pos=' + (parseInt(anot.style.top) - getOffset(anot.subjectElement, 'Top')),\n (function() { }),\n displayServerError\n );\n\n anot.inEdit = false;\n}","title":""},{"docid":"c8c658dfbcfda7439e82ca9868a448e7","score":"0.54195315","text":"postAnnotation(req) {\n let annotation = req.body\n if (!annotation || !req.user) {\n return Promise.resolve(null)\n }\n // Set creator\n if (!annotation.creator) {\n annotation.creator = {\n id: req.user.uri,\n name: req.user.name\n }\n }\n // Add created and modified dates.\n let date = (new Date()).toISOString()\n if (!annotation.created) {\n annotation.created = date\n }\n // Remove type property\n _.unset(annotation, \"type\")\n // TODO: Validate annotation\n\n // Add _id and URI\n annotation._id = util.uuid()\n annotation.id = util.getBaseUrl(req) + \"annotations/\" + annotation._id\n // Make sure URI is a https URI (except in tests)\n if (!config.env == \"test\") {\n annotation.uri.replace(\"http:\", \"https:\")\n }\n // Save annotation\n return this.collection.insertOne(annotation)\n .then(() => {\n return annotation\n })\n .catch(error => {\n console.log(error)\n return null\n })\n }","title":""},{"docid":"1ea8df3cead1370c2b74878da2fb2be4","score":"0.5355796","text":"enterAnnotation_constructor(ctx) {\n\t}","title":""},{"docid":"d205fc19c3da52d0c410a75077b4757e","score":"0.5326361","text":"enterAnnotation_argument(ctx) {\n\t}","title":""},{"docid":"b6f9c5729a2ac7673633f451dfa835f8","score":"0.53062373","text":"function Annotator() {\n this.wavesurfer;\n this.playBar;\n this.stages;\n this.workflowBtns;\n this.tasks = [];\n this.currentTask;\n this.numRemainingTasks;\n this.taskStartTime;\n this.hiddenImage;\n // only automatically open instructions modal when first loaded\n this.instructionsViewed = false;\n // Boolean, true if currently sending http post request\n this.sendingResponse = false;\n\n // Create color map for spectrogram\n var spectrogramColorMap = colormap({\n colormap: magma,\n nshades: 256,\n format: 'rgb',\n alpha: 1\n });\n\n // Create wavesurfer (audio visualization component)\n var height = 256;\n this.wavesurfer = Object.create(WaveSurfer);\n this.wavesurfer.init({\n container: '.audio_visual',\n waveColor: '#FF00FF',\n progressColor: '#FF00FF',\n // For the spectrogram the height is half the number of fftSamples\n fftSamples: height * 2,\n height: height,\n colorMap: spectrogramColorMap\n });\n\n // Create labels (labels that appear above each region)\n var labels = Object.create(WaveSurfer.Labels);\n labels.init({\n wavesurfer: this.wavesurfer,\n container: '.labels'\n });\n\n // Create hiddenImage, an image that is slowly revealed to a user as they annotate\n // (only for this.currentTask.data.content.feedback === 'hiddenImage')\n this.hiddenImage = new HiddenImg('.hidden_img', 100);\n this.hiddenImage.create();\n\n // Create the play button and time that appear below the wavesurfer\n this.playBar = new PlayBar(this.wavesurfer);\n this.playBar.create();\n\n // Create the annotation stages that appear below the wavesurfer. The stages contain tags\n // the users use to label a region in the audio clip\n this.stages = new AnnotationStages(this.wavesurfer, this.hiddenImage);\n this.stages.create();\n\n // Create Workflow btns (submit and exit)\n this.workflowBtns = new WorkflowBtns('/experiments/' + experiment_id + '/workflow/next');\n this.workflowBtns.create();\n\n this.addEvents();\n}","title":""},{"docid":"5cd48759e0c4fedab707e3c257ef6658","score":"0.5271769","text":"function Person(){\n this[\"@context\"] = \"http://vitali.web.cs.unibo.it/twiki/pub/TechWeb16/context.json\";\n this[\"@type\"] = \"person\";\n this[\"@id\"] = \"mailto:\"+$scope.reviewer.email;\n this[\"name\"] = $scope.reviewer.given_name+\" \"+$scope.reviewer.family_name;\n this[\"as\"] = {\n \"@id\": \"#role1\",\n \"@type\": \"role\",\n \"role_type\": \"pro:reviewer\",\n \"in\": \"\"\n }\n }","title":""},{"docid":"8f7c275663f3cfcca185e229ce41d6f2","score":"0.52520084","text":"static async addAnnotation({title, type, content}={}) {\n const editor = atom.workspace.getActiveTextEditor()\n if (!atom.workspace.isTextEditor(editor)) {\n atom.notifications.addInfo(\n 'Annotations can only be added to text editors.'\n )\n return\n }\n const cursors = (\n atom.workspace\n .getActiveTextEditor()\n .getCursorBufferPositions()\n )\n if (cursors.length > 1) {\n atom.notifications.addInfo(\n 'Adding an annotation to multiple cursors is not supported.'\n )\n return\n }\n const lineNumber = cursors[0].row + 1\n const annotationsDb = await AnnotationsDb.getInstance(\n editor,\n {createIfNeeded: true},\n )\n\n if (!title) {\n const titleDialog = new Dialog({\n prompt: 'Enter the title!',\n iconClass: 'tag',\n attach: true,\n handleConfirm: input => {\n if (input.length > 0) {\n return input\n }\n throw new ValueError('Annotation title must not be empty!')\n }\n })\n title = await titleDialog.awaitConfirm()\n }\n\n const possibleTypes = (\n Object.entries(RendererRegistry.getRenderers())\n .map(([name, {type}]) => type)\n )\n if (!type) {\n const typeDialog = new Dialog({\n prompt: (\n 'Choose the annotation type! Possible values: '\n + possibleTypes.join(', ')\n ),\n iconClass: 'paintcan',\n initialText: 'html',\n select: true,\n attach: true,\n handleConfirm: input => {\n input = input.toLowerCase()\n if (possibleTypes.indexOf(input) >= 0) {\n return input\n }\n throw new ValueError('Enter a valid annotation type!')\n }\n })\n type = await typeDialog.awaitConfirm()\n }\n else {\n if (!possibleTypes.includes(type)) {\n throw new Error(`Invalid annotation type '${type}'.`)\n }\n }\n\n if (!content) {\n try {\n content = await Annotation.askForContent(type, title)\n }\n catch (error) {\n if (error instanceof AbortError) {\n atom.notifications.addInfo(\n 'Annotation was not created. '\n + 'No annotations were deleted.'\n )\n return\n }\n else {\n throw error\n }\n }\n }\n\n const rawAnnotations = annotationsDb.getAnnotations()\n const similarRawAnnotations = (\n rawAnnotations\n .filter(({title: otherTitle, lineNumber: otherLineNumber}) =>\n otherTitle.toLowerCase() === title.toLowerCase()\n && otherLineNumber === lineNumber\n )\n )\n\n const numSimilar = similarRawAnnotations.length\n if (numSimilar > 0) {\n if (Config.get('dialogs.showReplaceConfirm')) {\n const message = REPLACE_CONFIRM_MESSAGE(similarRawAnnotations)\n const buttonIndex = await showMessageBox({\n message,\n buttons: ['Replace', 'Cancel'],\n })\n if (buttonIndex === 0) {\n annotationsDb.delete(similarRawAnnotations)\n }\n }\n }\n\n await annotationsDb.add([{\n lineNumber,\n title,\n content,\n type,\n }])\n // Either add an icon to the gutter or update the list of annotations\n // associated with an icon (if the new annotation is on the same line\n // as others).\n if (this.initializedEditors.has(editor)) {\n const annotations = await AnnotationsDb.getAnnotations(\n editor,\n lineNumber,\n )\n // The new annotation requires a new gutter icon.\n if (annotations.length === 1) {\n this._addGutterIcon(editor, lineNumber)\n }\n }\n // The annotation was already added to the DB thus it will be displayed\n // after initialization.\n else {\n await this._initEditor(editor)\n }\n }","title":""},{"docid":"21f54793d60b764a8d2bbfb620856d17","score":"0.5225284","text":"of(value) {\n return new Annotation(this, value);\n }","title":""},{"docid":"7be37114f42558e9d3f0323f59ceeb8c","score":"0.5186521","text":"function annotationSave() {\n $UI.message.add('Annotation Saved');\n}","title":""},{"docid":"4f2e92e5986d9626848e49807c94878b","score":"0.51731116","text":"function SaveAnnotationEventHandler(sender) {\n this.sender = sender;\n }","title":""},{"docid":"4f2e92e5986d9626848e49807c94878b","score":"0.51731116","text":"function SaveAnnotationEventHandler(sender) {\n this.sender = sender;\n }","title":""},{"docid":"63cc972b8bcc0294b358714f07a7da2c","score":"0.51709664","text":"function initializeSubmitEditAnnotationButtonEventListener() {\n videoBase.elements.annotations.addEventListener('click', function(e) {\n var target = e.target;\n \n if(target.classList.contains('submit-edit-annotation')) {\n // submit edited annotation\n var annotationElement = target.closest(videoBase.selectors.annotationWrapper);\n var annotationElementBody = annotationElement.querySelector(videoBase.selectors.annotationBody);\n var annotationUserId = annotationElement.dataset['authorId'];\n var annotationId = annotationElement.dataset['id'];\n var newAnnotationComment = annotationElementBody.querySelector(videoBase.selectors.editAnnotationText).value;\n \n var existingAnnotation = new videoModel.ExistingAnnotation(annotationUserId, newAnnotationComment, annotationId);\n existingAnnotation.edit(annotationElementBody);\n }\n })\n}","title":""},{"docid":"9176a26e1daec7013bfd2a746579cdcf","score":"0.51653624","text":"function annotation ( item, prop, value, resource, status ) {\n\t\tthis.item = item;\n\t\tthis.prop = prop;\n\t\tthis.value = value;\n\t\tthis.resource = resource;\n\t\tthis.status = status;\n\t}","title":""},{"docid":"11c879ba5f8cd9bb219dfa04766130e1","score":"0.51370984","text":"function displayAnnotation(annotation) {\n note.innerHTML = annotation;\n}","title":""},{"docid":"11c879ba5f8cd9bb219dfa04766130e1","score":"0.51370984","text":"function displayAnnotation(annotation) {\n note.innerHTML = annotation;\n}","title":""},{"docid":"1aed4f6bf73203224cdcf305a9c0fd8f","score":"0.5119922","text":"visitAnnotation(ctx) {\r\n\t return this.visitChildren(ctx);\r\n\t}","title":""},{"docid":"2f3674adb1d654851109f2551f7615de","score":"0.5083335","text":"function ThisTypeAnnotation() {\n this.push(\"this\");\n}","title":""},{"docid":"5d1f0a4d0bc79707ae1fa5817b4541e4","score":"0.5047791","text":"enterAnnotation_argument_name(ctx) {\n\t}","title":""},{"docid":"7303ae8616cc38f3e7f906af56bec791","score":"0.5045275","text":"writeAnnotationObject(annot) {\n if (!annot.author)\n annot.author = \"\";\n if (!annot.contents)\n annot.contents = \"\";\n if (!annot.object_id)\n throw Error(\"No object_id\");\n let ret = writer_util_1.WriterUtil.writeReferencePointer(annot.object_id);\n ret.push(Writer.SPACE);\n ret = ret.concat(Writer.OBJ);\n ret.push(Writer.SPACE);\n ret = ret.concat(Writer.DICT_START);\n ret = ret.concat(Writer.TYPE_ANNOT);\n ret.push(Writer.SPACE);\n if (annot.rect && annot.rect.length > 0) {\n ret = ret.concat(Writer.RECT);\n ret.push(Writer.SPACE);\n ret = ret.concat(writer_util_1.WriterUtil.writeNumberArray(annot.rect));\n ret.push(Writer.SPACE);\n }\n ret = ret.concat(Writer.SUBTYPE);\n ret.push(Writer.SPACE);\n ret = ret.concat(this.convertSubtype(annot.type));\n ret.push(Writer.SPACE);\n ret = ret.concat(Writer.UPDATE_DATE);\n ret.push(Writer.SPACE);\n ret = ret.concat(util_1.Util.convertStringToAscii(annot.updateDate));\n ret.push(Writer.SPACE);\n ret = ret.concat(Writer.AUTHOR);\n ret.push(Writer.SPACE);\n ret.push(Writer.BRACKET_START);\n ret = ret.concat(util_1.Util.convertStringToAscii(annot.author));\n ret.push(Writer.BRACKET_END);\n ret.push(Writer.SPACE);\n if (annot.contents) {\n ret = ret.concat(Writer.CONTENTS);\n ret.push(Writer.SPACE);\n ret.push(Writer.BRACKET_START);\n ret = ret.concat(util_1.Util.convertStringToAscii(annot.contents));\n ret.push(Writer.BRACKET_END);\n ret.push(Writer.SPACE);\n }\n ret = ret.concat(Writer.ID);\n ret.push(Writer.SPACE);\n ret = ret.concat(util_1.Util.convertStringToAscii(annot.id));\n ret.push(Writer.SPACE);\n if (annot.annotation_flag) {\n ret = ret.concat(Writer.FLAG);\n ret.push(Writer.SPACE);\n ret = ret.concat(util_1.Util.convertNumberToCharArray(annot.annotation_flag));\n ret.push(Writer.SPACE);\n }\n if (annot.color) {\n if (annot.color.r > 1)\n annot.color.r /= 255;\n if (annot.color.g > 1)\n annot.color.g /= 255;\n if (annot.color.b > 1)\n annot.color.b /= 255;\n ret.push(Writer.SPACE);\n ret = ret.concat(Writer.COLOR);\n ret.push(Writer.SPACE);\n ret = ret.concat(writer_util_1.WriterUtil.writeNumberArray([annot.color.r, annot.color.g, annot.color.b]));\n ret.push(Writer.SPACE);\n }\n let opacity = annot.opacity;\n if (opacity) {\n ret = ret.concat(Writer.OPACITY);\n ret.push(Writer.SPACE);\n ret = ret.concat(util_1.Util.convertNumberToCharArray(opacity));\n ret.push(Writer.SPACE);\n }\n if (annot.border) {\n ret.push(Writer.SPACE);\n ret = ret.concat(Writer.BORDER);\n ret.push(Writer.SPACE);\n ret = ret.concat(writer_util_1.WriterUtil.writeNumberArray([annot.border.horizontal_corner_radius, annot.border.vertical_corner_radius, annot.border.border_width]));\n ret.push(Writer.SPACE);\n }\n if (annot.defaultAppearance) {\n ret.push(Writer.SPACE);\n ret = ret.concat(Writer.DEFAULT_APPEARANCE);\n ret.push(Writer.SPACE);\n ret.push(Writer.BRACKET_START);\n ret = ret.concat(util_1.Util.convertStringToAscii(annot.defaultAppearance));\n ret.push(Writer.BRACKET_END);\n ret.push(Writer.SPACE);\n }\n if (!annot.pageReference)\n throw Error(\"No page reference\");\n if (annot.pageReference.object_id) {\n ret.push(Writer.SPACE);\n ret = ret.concat(Writer.PAGE_REFERENCE);\n ret.push(Writer.SPACE);\n ret = ret.concat(writer_util_1.WriterUtil.writeReferencePointer(annot.pageReference.object_id, true));\n ret.push(Writer.SPACE);\n }\n if (annot.quadPoints) {\n ret = ret.concat(Writer.QUADPOINTS);\n ret.push(Writer.SPACE);\n ret = ret.concat(writer_util_1.WriterUtil.writeNumberArray(annot.quadPoints));\n ret.push(Writer.SPACE);\n }\n if (annot.vertices) {\n ret = ret.concat(Writer.VERTICES);\n ret.push(Writer.SPACE);\n ret = ret.concat(writer_util_1.WriterUtil.writeNumberArray(annot.vertices));\n ret.push(Writer.SPACE);\n }\n if (annot.stampType) {\n ret = ret.concat(Writer.NAME);\n ret.push(Writer.SPACE);\n ret = ret.concat(Writer.DRAFT);\n ret.push(Writer.SPACE);\n }\n if (annot.caretSymbol) {\n ret = ret.concat(Writer.SY);\n ret.push(Writer.SPACE);\n ret.push(Writer.P);\n ret.push(Writer.SPACE);\n }\n if (annot.inkList) {\n ret = ret.concat(Writer.INKLIST);\n ret.push(Writer.SPACE);\n ret = ret.concat(writer_util_1.WriterUtil.writeNestedNumberArray(annot.inkList));\n ret.push(Writer.SPACE);\n }\n ret = ret.concat(Writer.DICT_END);\n ret.push(Writer.SPACE);\n ret = ret.concat(Writer.ENDOBJ);\n ret.push(Writer.CR);\n ret.push(Writer.LF);\n return { ptr: annot.object_id, data: ret };\n }","title":""},{"docid":"b09c0a6839aa5ec958d701cc5da9160d","score":"0.5033636","text":"function CreateNewAnnotation( latitude , longitude , image , title , subtitle , isMyCar , priceFormatted , availableSpots )\n{\n var newID = null ;\n if( isMyCar )\n {\n // Nothing to do\n }\n else\n {\n newID = latitude.toString() + \"_\" + longitude.toString() ;\n if( newID in arAnnotations )\n {\n // Remove the previous annotation\n $.map.removeAnnotation( arAnnotations[newID].annotation ) ;\n }\n }\n\n var newAnnotation = Alloy.Globals.Map.createAnnotation(\n {\n id: newID ,\n latitude: latitude ,\n longitude: longitude ,\n image: image ,\n title: title ,\n subtitle: subtitle\n } ) ;\n\n if( typeof priceFormatted !== 'undefined' && priceFormatted != null )\n {\n newAnnotation.myPriceFormatted = priceFormatted ;\n }\n if( typeof availableSpots !== 'undefined' && availableSpots != null )\n {\n newAnnotation.myAvailableSpots = availableSpots ;\n }\n\n var leftView = null ;\n if( OS_IOS )\n {\n newAnnotation.setRightButton( Ti.UI.iPhone.SystemButton.INFO_LIGHT ) ;\n\n // iOS will use an ImageView\n leftView = Titanium.UI.createImageView(\n {\n image: '/images/navigator.png' ,\n width: 30 ,\n height: 30\n } ) ;\n }\n else\n {\n // Android will use a Button\n leftView = Ti.UI.createButton( { backgroundImage: '/images/navigator.png' } ) ;\n }\n newAnnotation.setLeftView( leftView ) ;\n\n $.map.addAnnotation( newAnnotation ) ;\n\n if( isMyCar )\n {\n newAnnotation.myId = 'car' ;\n }\n else\n {\n arAnnotations[newID] =\n {\n annotation: newAnnotation ,\n timestamp: new Date().getTime()\n } ;\n }\n\n return newAnnotation ;\n}","title":""},{"docid":"7c58ef8b05fefd5f97c6a3673f5a8c96","score":"0.5031994","text":"addAnnotationText(annotation_text) {\n this.annotation_texts[annotation_text.annotation_text_id] = annotation_text;\n }","title":""},{"docid":"e452ea3b288fcd1cfc722e5b1396e3ff","score":"0.5016232","text":"function setup (saveAnnotationText) {\n _saveAnnotationText = saveAnnotationText\n}","title":""},{"docid":"3722fdcfdcf77f0ac330dd2727ac536a","score":"0.49887326","text":"function Agente(nombre) {\n // heredar el constructor de personas\n Persona.call(this, nombre);// call o Apply llaman a la función con el this que me apetezca \n}","title":""},{"docid":"3ced044bd6127d3884246707d05cfb28","score":"0.49775723","text":"createStampAnnotation(page, contents, author, stampType = \"Draft\", color = { r: 1, g: 1, b: 0 }) {\n let annot = Object.assign(this.createBaseAnnotation(page, [50, 50, 80, 80], contents, author), {\n opacity: 1,\n initiallyOpen: false,\n annotation_flag: 4,\n color: color,\n stampType: stampType\n });\n annot.type = \"/Stamp\";\n this.annotations.push(annot);\n }","title":""},{"docid":"d8a1ff1141aeb2f4780b854ee6e71d99","score":"0.49690145","text":"function Target () { }","title":""},{"docid":"035c34e1d11beeb60170fac2f9e1cd9e","score":"0.49558005","text":"function AnnotationBase(control) {\n this.control = control;\n }","title":""},{"docid":"aaadd585d0ee6c00c66fdda996dfd240","score":"0.49542597","text":"function saveAnnotation() {\n annoCallback.call(null, {\n id:\n $UI.annotOptPanel.setting.formSchemas[$UI.annotOptPanel._select_.value]\n .id,\n data: $UI.annotOptPanel._form_.value,\n });\n}","title":""},{"docid":"1f9bf6397718a605f32b3c5900decb31","score":"0.49201268","text":"function annotationInitialize() {\n annotationGroupObject = new AnnotationGroup(graph, 0, 970);\n annotationAddButton = new AddAnnotationButton(svg, 30, 30, (width + margin.left * 1.2), (margin.top * 0.8));\n }","title":""},{"docid":"e639e9415b75862c947e210c9bebcaf7","score":"0.49183327","text":"function annotate(fn, annotation) {\n fn.annotations = fn.annotations || [];\n fn.annotations.push(annotation);\n}","title":""},{"docid":"e639e9415b75862c947e210c9bebcaf7","score":"0.49183327","text":"function annotate(fn, annotation) {\n fn.annotations = fn.annotations || [];\n fn.annotations.push(annotation);\n}","title":""},{"docid":"8e78a6ab3a534a1600ed69341b2a5335","score":"0.4917513","text":"gatherDataAndSave() {\n\t\tvar annotation = this.props.activeAnnotation;\n\t\tvar data = {};\n\t\tif(this.state.classifications.length > 0) {\n\t\t\tdata['classifications'] = this.state.classifications;\n\t\t}\n\t\tif(this.state.comments.length > 0) {\n\t\t\tdata['comments'] = this.state.comments\n\t\t}\n\t\tif(this.state.links.length > 0) {\n\t\t\tdata['links'] = this.state.links\n\t\t}\n\t\tannotation.data = data;\n\t\tthis.props.saveAnnotation(annotation);\n\t}","title":""},{"docid":"6fcd49b016dc017520818ee86229d954","score":"0.4912916","text":"get annotations() {\n return this.internalAnnotations;\n }","title":""},{"docid":"6fcd49b016dc017520818ee86229d954","score":"0.4912916","text":"get annotations() {\n return this.internalAnnotations;\n }","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""},{"docid":"1dd811f4e418982558eaa8e5e698cf94","score":"0.48914364","text":"function OwnerID() {}","title":""}],"string":"[\n {\n \"docid\": \"94373dcf82a3cd1e2265778b0ab87d07\",\n \"score\": \"0.612936\",\n \"text\": \"get individual() {\\n\\t\\treturn this.__individual;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe54ec14db14fbf1803d31950d9eb52c\",\n \"score\": \"0.59623784\",\n \"text\": \"function Annotation() {\\n this.guid_ = tr.b.GUID.allocateSimple();\\n this.view_ = undefined;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14bd28df2d121ae40c16c68c421da651\",\n \"score\": \"0.57922035\",\n \"text\": \"enterAnnotation_identifier(ctx) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c4620fcc70ee8f4fd2b1e4f8ffbe67d\",\n \"score\": \"0.565819\",\n \"text\": \"createBaseAnnotation(page, rect, contents, author) {\\n let annot = new parser_1.Annotation();\\n annot.type = \\\"/Annot\\\",\\n annot.page = page,\\n annot.object_id = this.parser.getFreeObjectId(),\\n annot.id = this.generateUniqueIdentifier(),\\n annot.rect = rect,\\n annot.author = author,\\n annot.pageReference = this.parser.getPage(page),\\n annot.updateDate = util_1.Util.convertDateToPDFDate(new Date()),\\n annot.contents = contents,\\n annot.border = this.createDefaultBorder();\\n return annot;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e091eafd88fa0251fa9b4f9a878d953\",\n \"score\": \"0.56517684\",\n \"text\": \"function Annotation(annotationType, tmpSource, tmpTarget) {\\n this.base = Relationship;\\n this.base(\\\"Annotation\\\", \\n tmpSource, \\n tmpTarget, \\n new Array(MASH_EVENT.OBJECT_MOVE), \\n new Array(MASH_EVENT.OBJECT_MOVE)\\n );\\n this.type = annotationType;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d73a8e8017cd5dcc9c8b1570576cd793\",\n \"score\": \"0.5615035\",\n \"text\": \"function createAnnotation() {\\n var annObj = {\\n filename: fileNameStr,\\n submitted_by: cudEmailStr,\\n };\\n\\n if (currentHeaderPos || currentHeaderPos === 0) {\\n annObj.position = currentHeaderPos\\n }\\n\\n return annObj;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a81170f66360026cc93be9583207009\",\n \"score\": \"0.5560231\",\n \"text\": \"get type() {\\n return \\\"xeogl.Annotation\\\";\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9731a8b608d9803010baafb4e433a5b\",\n \"score\": \"0.5529988\",\n \"text\": \"add(annotation) {\\n // this.SetPrint(annotation);\\n this.doAdd(annotation);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9731a8b608d9803010baafb4e433a5b\",\n \"score\": \"0.5529988\",\n \"text\": \"add(annotation) {\\n // this.SetPrint(annotation);\\n this.doAdd(annotation);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cc0a736b1b520191a5cfe745511e3b3\",\n \"score\": \"0.54946357\",\n \"text\": \"function createAnnotation(type) {\\n var component;\\n var instanceName;\\n if (type == TokenType.Font) {\\n component = figma.currentPage.findOne(n => n.name === \\\"Token Annotation / Typography\\\");\\n instanceName = \\\"Font Annotation\\\";\\n }\\n else {\\n component = figma.currentPage.findOne(n => n.name === \\\"Token Annotation / Color\\\");\\n instanceName = \\\"Color Token Annotation\\\";\\n }\\n if (component != undefined) {\\n var instance = component.createInstance();\\n instance.name = instanceName;\\n return instance;\\n }\\n else {\\n console.log(\\\"Error: Could not creat annotation instance\\\");\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40d074b6245858948ac4d590503e8168\",\n \"score\": \"0.5455473\",\n \"text\": \"function saveAnnotation(e)\\n{\\n // This can be an event in more than one way with more than one\\n // object\\n if (this.wrapper)\\n {\\n var anot = this.wrapper;\\n }\\n else\\n {\\n var anot = this;\\n }\\n\\n jsonCall\\n (\\n 'Annotate',\\n 'message=' + anot.contentEl.value\\n + '&url=' + encodeURIComponent(currentPage)\\n + '&element_id=' + anot.subjectElement.id\\n + '&uniqid=' + anot.uniqid\\n + '&x_pos=' + (parseInt(anot.style.left) - getOffset(anot.subjectElement, 'Left'))\\n + '&y_pos=' + (parseInt(anot.style.top) - getOffset(anot.subjectElement, 'Top')),\\n (function() { }),\\n displayServerError\\n );\\n\\n anot.inEdit = false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8c658dfbcfda7439e82ca9868a448e7\",\n \"score\": \"0.54195315\",\n \"text\": \"postAnnotation(req) {\\n let annotation = req.body\\n if (!annotation || !req.user) {\\n return Promise.resolve(null)\\n }\\n // Set creator\\n if (!annotation.creator) {\\n annotation.creator = {\\n id: req.user.uri,\\n name: req.user.name\\n }\\n }\\n // Add created and modified dates.\\n let date = (new Date()).toISOString()\\n if (!annotation.created) {\\n annotation.created = date\\n }\\n // Remove type property\\n _.unset(annotation, \\\"type\\\")\\n // TODO: Validate annotation\\n\\n // Add _id and URI\\n annotation._id = util.uuid()\\n annotation.id = util.getBaseUrl(req) + \\\"annotations/\\\" + annotation._id\\n // Make sure URI is a https URI (except in tests)\\n if (!config.env == \\\"test\\\") {\\n annotation.uri.replace(\\\"http:\\\", \\\"https:\\\")\\n }\\n // Save annotation\\n return this.collection.insertOne(annotation)\\n .then(() => {\\n return annotation\\n })\\n .catch(error => {\\n console.log(error)\\n return null\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ea8df3cead1370c2b74878da2fb2be4\",\n \"score\": \"0.5355796\",\n \"text\": \"enterAnnotation_constructor(ctx) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d205fc19c3da52d0c410a75077b4757e\",\n \"score\": \"0.5326361\",\n \"text\": \"enterAnnotation_argument(ctx) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6f9c5729a2ac7673633f451dfa835f8\",\n \"score\": \"0.53062373\",\n \"text\": \"function Annotator() {\\n this.wavesurfer;\\n this.playBar;\\n this.stages;\\n this.workflowBtns;\\n this.tasks = [];\\n this.currentTask;\\n this.numRemainingTasks;\\n this.taskStartTime;\\n this.hiddenImage;\\n // only automatically open instructions modal when first loaded\\n this.instructionsViewed = false;\\n // Boolean, true if currently sending http post request\\n this.sendingResponse = false;\\n\\n // Create color map for spectrogram\\n var spectrogramColorMap = colormap({\\n colormap: magma,\\n nshades: 256,\\n format: 'rgb',\\n alpha: 1\\n });\\n\\n // Create wavesurfer (audio visualization component)\\n var height = 256;\\n this.wavesurfer = Object.create(WaveSurfer);\\n this.wavesurfer.init({\\n container: '.audio_visual',\\n waveColor: '#FF00FF',\\n progressColor: '#FF00FF',\\n // For the spectrogram the height is half the number of fftSamples\\n fftSamples: height * 2,\\n height: height,\\n colorMap: spectrogramColorMap\\n });\\n\\n // Create labels (labels that appear above each region)\\n var labels = Object.create(WaveSurfer.Labels);\\n labels.init({\\n wavesurfer: this.wavesurfer,\\n container: '.labels'\\n });\\n\\n // Create hiddenImage, an image that is slowly revealed to a user as they annotate\\n // (only for this.currentTask.data.content.feedback === 'hiddenImage')\\n this.hiddenImage = new HiddenImg('.hidden_img', 100);\\n this.hiddenImage.create();\\n\\n // Create the play button and time that appear below the wavesurfer\\n this.playBar = new PlayBar(this.wavesurfer);\\n this.playBar.create();\\n\\n // Create the annotation stages that appear below the wavesurfer. The stages contain tags\\n // the users use to label a region in the audio clip\\n this.stages = new AnnotationStages(this.wavesurfer, this.hiddenImage);\\n this.stages.create();\\n\\n // Create Workflow btns (submit and exit)\\n this.workflowBtns = new WorkflowBtns('/experiments/' + experiment_id + '/workflow/next');\\n this.workflowBtns.create();\\n\\n this.addEvents();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cd48759e0c4fedab707e3c257ef6658\",\n \"score\": \"0.5271769\",\n \"text\": \"function Person(){\\n this[\\\"@context\\\"] = \\\"http://vitali.web.cs.unibo.it/twiki/pub/TechWeb16/context.json\\\";\\n this[\\\"@type\\\"] = \\\"person\\\";\\n this[\\\"@id\\\"] = \\\"mailto:\\\"+$scope.reviewer.email;\\n this[\\\"name\\\"] = $scope.reviewer.given_name+\\\" \\\"+$scope.reviewer.family_name;\\n this[\\\"as\\\"] = {\\n \\\"@id\\\": \\\"#role1\\\",\\n \\\"@type\\\": \\\"role\\\",\\n \\\"role_type\\\": \\\"pro:reviewer\\\",\\n \\\"in\\\": \\\"\\\"\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f7c275663f3cfcca185e229ce41d6f2\",\n \"score\": \"0.52520084\",\n \"text\": \"static async addAnnotation({title, type, content}={}) {\\n const editor = atom.workspace.getActiveTextEditor()\\n if (!atom.workspace.isTextEditor(editor)) {\\n atom.notifications.addInfo(\\n 'Annotations can only be added to text editors.'\\n )\\n return\\n }\\n const cursors = (\\n atom.workspace\\n .getActiveTextEditor()\\n .getCursorBufferPositions()\\n )\\n if (cursors.length > 1) {\\n atom.notifications.addInfo(\\n 'Adding an annotation to multiple cursors is not supported.'\\n )\\n return\\n }\\n const lineNumber = cursors[0].row + 1\\n const annotationsDb = await AnnotationsDb.getInstance(\\n editor,\\n {createIfNeeded: true},\\n )\\n\\n if (!title) {\\n const titleDialog = new Dialog({\\n prompt: 'Enter the title!',\\n iconClass: 'tag',\\n attach: true,\\n handleConfirm: input => {\\n if (input.length > 0) {\\n return input\\n }\\n throw new ValueError('Annotation title must not be empty!')\\n }\\n })\\n title = await titleDialog.awaitConfirm()\\n }\\n\\n const possibleTypes = (\\n Object.entries(RendererRegistry.getRenderers())\\n .map(([name, {type}]) => type)\\n )\\n if (!type) {\\n const typeDialog = new Dialog({\\n prompt: (\\n 'Choose the annotation type! Possible values: '\\n + possibleTypes.join(', ')\\n ),\\n iconClass: 'paintcan',\\n initialText: 'html',\\n select: true,\\n attach: true,\\n handleConfirm: input => {\\n input = input.toLowerCase()\\n if (possibleTypes.indexOf(input) >= 0) {\\n return input\\n }\\n throw new ValueError('Enter a valid annotation type!')\\n }\\n })\\n type = await typeDialog.awaitConfirm()\\n }\\n else {\\n if (!possibleTypes.includes(type)) {\\n throw new Error(`Invalid annotation type '${type}'.`)\\n }\\n }\\n\\n if (!content) {\\n try {\\n content = await Annotation.askForContent(type, title)\\n }\\n catch (error) {\\n if (error instanceof AbortError) {\\n atom.notifications.addInfo(\\n 'Annotation was not created. '\\n + 'No annotations were deleted.'\\n )\\n return\\n }\\n else {\\n throw error\\n }\\n }\\n }\\n\\n const rawAnnotations = annotationsDb.getAnnotations()\\n const similarRawAnnotations = (\\n rawAnnotations\\n .filter(({title: otherTitle, lineNumber: otherLineNumber}) =>\\n otherTitle.toLowerCase() === title.toLowerCase()\\n && otherLineNumber === lineNumber\\n )\\n )\\n\\n const numSimilar = similarRawAnnotations.length\\n if (numSimilar > 0) {\\n if (Config.get('dialogs.showReplaceConfirm')) {\\n const message = REPLACE_CONFIRM_MESSAGE(similarRawAnnotations)\\n const buttonIndex = await showMessageBox({\\n message,\\n buttons: ['Replace', 'Cancel'],\\n })\\n if (buttonIndex === 0) {\\n annotationsDb.delete(similarRawAnnotations)\\n }\\n }\\n }\\n\\n await annotationsDb.add([{\\n lineNumber,\\n title,\\n content,\\n type,\\n }])\\n // Either add an icon to the gutter or update the list of annotations\\n // associated with an icon (if the new annotation is on the same line\\n // as others).\\n if (this.initializedEditors.has(editor)) {\\n const annotations = await AnnotationsDb.getAnnotations(\\n editor,\\n lineNumber,\\n )\\n // The new annotation requires a new gutter icon.\\n if (annotations.length === 1) {\\n this._addGutterIcon(editor, lineNumber)\\n }\\n }\\n // The annotation was already added to the DB thus it will be displayed\\n // after initialization.\\n else {\\n await this._initEditor(editor)\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21f54793d60b764a8d2bbfb620856d17\",\n \"score\": \"0.5225284\",\n \"text\": \"of(value) {\\n return new Annotation(this, value);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7be37114f42558e9d3f0323f59ceeb8c\",\n \"score\": \"0.5186521\",\n \"text\": \"function annotationSave() {\\n $UI.message.add('Annotation Saved');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f2e92e5986d9626848e49807c94878b\",\n \"score\": \"0.51731116\",\n \"text\": \"function SaveAnnotationEventHandler(sender) {\\n this.sender = sender;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f2e92e5986d9626848e49807c94878b\",\n \"score\": \"0.51731116\",\n \"text\": \"function SaveAnnotationEventHandler(sender) {\\n this.sender = sender;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63cc972b8bcc0294b358714f07a7da2c\",\n \"score\": \"0.51709664\",\n \"text\": \"function initializeSubmitEditAnnotationButtonEventListener() {\\n videoBase.elements.annotations.addEventListener('click', function(e) {\\n var target = e.target;\\n \\n if(target.classList.contains('submit-edit-annotation')) {\\n // submit edited annotation\\n var annotationElement = target.closest(videoBase.selectors.annotationWrapper);\\n var annotationElementBody = annotationElement.querySelector(videoBase.selectors.annotationBody);\\n var annotationUserId = annotationElement.dataset['authorId'];\\n var annotationId = annotationElement.dataset['id'];\\n var newAnnotationComment = annotationElementBody.querySelector(videoBase.selectors.editAnnotationText).value;\\n \\n var existingAnnotation = new videoModel.ExistingAnnotation(annotationUserId, newAnnotationComment, annotationId);\\n existingAnnotation.edit(annotationElementBody);\\n }\\n })\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9176a26e1daec7013bfd2a746579cdcf\",\n \"score\": \"0.51653624\",\n \"text\": \"function annotation ( item, prop, value, resource, status ) {\\n\\t\\tthis.item = item;\\n\\t\\tthis.prop = prop;\\n\\t\\tthis.value = value;\\n\\t\\tthis.resource = resource;\\n\\t\\tthis.status = status;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11c879ba5f8cd9bb219dfa04766130e1\",\n \"score\": \"0.51370984\",\n \"text\": \"function displayAnnotation(annotation) {\\n note.innerHTML = annotation;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11c879ba5f8cd9bb219dfa04766130e1\",\n \"score\": \"0.51370984\",\n \"text\": \"function displayAnnotation(annotation) {\\n note.innerHTML = annotation;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1aed4f6bf73203224cdcf305a9c0fd8f\",\n \"score\": \"0.5119922\",\n \"text\": \"visitAnnotation(ctx) {\\r\\n\\t return this.visitChildren(ctx);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f3674adb1d654851109f2551f7615de\",\n \"score\": \"0.5083335\",\n \"text\": \"function ThisTypeAnnotation() {\\n this.push(\\\"this\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d1f0a4d0bc79707ae1fa5817b4541e4\",\n \"score\": \"0.5047791\",\n \"text\": \"enterAnnotation_argument_name(ctx) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7303ae8616cc38f3e7f906af56bec791\",\n \"score\": \"0.5045275\",\n \"text\": \"writeAnnotationObject(annot) {\\n if (!annot.author)\\n annot.author = \\\"\\\";\\n if (!annot.contents)\\n annot.contents = \\\"\\\";\\n if (!annot.object_id)\\n throw Error(\\\"No object_id\\\");\\n let ret = writer_util_1.WriterUtil.writeReferencePointer(annot.object_id);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(Writer.OBJ);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(Writer.DICT_START);\\n ret = ret.concat(Writer.TYPE_ANNOT);\\n ret.push(Writer.SPACE);\\n if (annot.rect && annot.rect.length > 0) {\\n ret = ret.concat(Writer.RECT);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(writer_util_1.WriterUtil.writeNumberArray(annot.rect));\\n ret.push(Writer.SPACE);\\n }\\n ret = ret.concat(Writer.SUBTYPE);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(this.convertSubtype(annot.type));\\n ret.push(Writer.SPACE);\\n ret = ret.concat(Writer.UPDATE_DATE);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(util_1.Util.convertStringToAscii(annot.updateDate));\\n ret.push(Writer.SPACE);\\n ret = ret.concat(Writer.AUTHOR);\\n ret.push(Writer.SPACE);\\n ret.push(Writer.BRACKET_START);\\n ret = ret.concat(util_1.Util.convertStringToAscii(annot.author));\\n ret.push(Writer.BRACKET_END);\\n ret.push(Writer.SPACE);\\n if (annot.contents) {\\n ret = ret.concat(Writer.CONTENTS);\\n ret.push(Writer.SPACE);\\n ret.push(Writer.BRACKET_START);\\n ret = ret.concat(util_1.Util.convertStringToAscii(annot.contents));\\n ret.push(Writer.BRACKET_END);\\n ret.push(Writer.SPACE);\\n }\\n ret = ret.concat(Writer.ID);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(util_1.Util.convertStringToAscii(annot.id));\\n ret.push(Writer.SPACE);\\n if (annot.annotation_flag) {\\n ret = ret.concat(Writer.FLAG);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(util_1.Util.convertNumberToCharArray(annot.annotation_flag));\\n ret.push(Writer.SPACE);\\n }\\n if (annot.color) {\\n if (annot.color.r > 1)\\n annot.color.r /= 255;\\n if (annot.color.g > 1)\\n annot.color.g /= 255;\\n if (annot.color.b > 1)\\n annot.color.b /= 255;\\n ret.push(Writer.SPACE);\\n ret = ret.concat(Writer.COLOR);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(writer_util_1.WriterUtil.writeNumberArray([annot.color.r, annot.color.g, annot.color.b]));\\n ret.push(Writer.SPACE);\\n }\\n let opacity = annot.opacity;\\n if (opacity) {\\n ret = ret.concat(Writer.OPACITY);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(util_1.Util.convertNumberToCharArray(opacity));\\n ret.push(Writer.SPACE);\\n }\\n if (annot.border) {\\n ret.push(Writer.SPACE);\\n ret = ret.concat(Writer.BORDER);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(writer_util_1.WriterUtil.writeNumberArray([annot.border.horizontal_corner_radius, annot.border.vertical_corner_radius, annot.border.border_width]));\\n ret.push(Writer.SPACE);\\n }\\n if (annot.defaultAppearance) {\\n ret.push(Writer.SPACE);\\n ret = ret.concat(Writer.DEFAULT_APPEARANCE);\\n ret.push(Writer.SPACE);\\n ret.push(Writer.BRACKET_START);\\n ret = ret.concat(util_1.Util.convertStringToAscii(annot.defaultAppearance));\\n ret.push(Writer.BRACKET_END);\\n ret.push(Writer.SPACE);\\n }\\n if (!annot.pageReference)\\n throw Error(\\\"No page reference\\\");\\n if (annot.pageReference.object_id) {\\n ret.push(Writer.SPACE);\\n ret = ret.concat(Writer.PAGE_REFERENCE);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(writer_util_1.WriterUtil.writeReferencePointer(annot.pageReference.object_id, true));\\n ret.push(Writer.SPACE);\\n }\\n if (annot.quadPoints) {\\n ret = ret.concat(Writer.QUADPOINTS);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(writer_util_1.WriterUtil.writeNumberArray(annot.quadPoints));\\n ret.push(Writer.SPACE);\\n }\\n if (annot.vertices) {\\n ret = ret.concat(Writer.VERTICES);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(writer_util_1.WriterUtil.writeNumberArray(annot.vertices));\\n ret.push(Writer.SPACE);\\n }\\n if (annot.stampType) {\\n ret = ret.concat(Writer.NAME);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(Writer.DRAFT);\\n ret.push(Writer.SPACE);\\n }\\n if (annot.caretSymbol) {\\n ret = ret.concat(Writer.SY);\\n ret.push(Writer.SPACE);\\n ret.push(Writer.P);\\n ret.push(Writer.SPACE);\\n }\\n if (annot.inkList) {\\n ret = ret.concat(Writer.INKLIST);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(writer_util_1.WriterUtil.writeNestedNumberArray(annot.inkList));\\n ret.push(Writer.SPACE);\\n }\\n ret = ret.concat(Writer.DICT_END);\\n ret.push(Writer.SPACE);\\n ret = ret.concat(Writer.ENDOBJ);\\n ret.push(Writer.CR);\\n ret.push(Writer.LF);\\n return { ptr: annot.object_id, data: ret };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b09c0a6839aa5ec958d701cc5da9160d\",\n \"score\": \"0.5033636\",\n \"text\": \"function CreateNewAnnotation( latitude , longitude , image , title , subtitle , isMyCar , priceFormatted , availableSpots )\\n{\\n var newID = null ;\\n if( isMyCar )\\n {\\n // Nothing to do\\n }\\n else\\n {\\n newID = latitude.toString() + \\\"_\\\" + longitude.toString() ;\\n if( newID in arAnnotations )\\n {\\n // Remove the previous annotation\\n $.map.removeAnnotation( arAnnotations[newID].annotation ) ;\\n }\\n }\\n\\n var newAnnotation = Alloy.Globals.Map.createAnnotation(\\n {\\n id: newID ,\\n latitude: latitude ,\\n longitude: longitude ,\\n image: image ,\\n title: title ,\\n subtitle: subtitle\\n } ) ;\\n\\n if( typeof priceFormatted !== 'undefined' && priceFormatted != null )\\n {\\n newAnnotation.myPriceFormatted = priceFormatted ;\\n }\\n if( typeof availableSpots !== 'undefined' && availableSpots != null )\\n {\\n newAnnotation.myAvailableSpots = availableSpots ;\\n }\\n\\n var leftView = null ;\\n if( OS_IOS )\\n {\\n newAnnotation.setRightButton( Ti.UI.iPhone.SystemButton.INFO_LIGHT ) ;\\n\\n // iOS will use an ImageView\\n leftView = Titanium.UI.createImageView(\\n {\\n image: '/images/navigator.png' ,\\n width: 30 ,\\n height: 30\\n } ) ;\\n }\\n else\\n {\\n // Android will use a Button\\n leftView = Ti.UI.createButton( { backgroundImage: '/images/navigator.png' } ) ;\\n }\\n newAnnotation.setLeftView( leftView ) ;\\n\\n $.map.addAnnotation( newAnnotation ) ;\\n\\n if( isMyCar )\\n {\\n newAnnotation.myId = 'car' ;\\n }\\n else\\n {\\n arAnnotations[newID] =\\n {\\n annotation: newAnnotation ,\\n timestamp: new Date().getTime()\\n } ;\\n }\\n\\n return newAnnotation ;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c58ef8b05fefd5f97c6a3673f5a8c96\",\n \"score\": \"0.5031994\",\n \"text\": \"addAnnotationText(annotation_text) {\\n this.annotation_texts[annotation_text.annotation_text_id] = annotation_text;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e452ea3b288fcd1cfc722e5b1396e3ff\",\n \"score\": \"0.5016232\",\n \"text\": \"function setup (saveAnnotationText) {\\n _saveAnnotationText = saveAnnotationText\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3722fdcfdcf77f0ac330dd2727ac536a\",\n \"score\": \"0.49887326\",\n \"text\": \"function Agente(nombre) {\\n // heredar el constructor de personas\\n Persona.call(this, nombre);// call o Apply llaman a la función con el this que me apetezca \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ced044bd6127d3884246707d05cfb28\",\n \"score\": \"0.49775723\",\n \"text\": \"createStampAnnotation(page, contents, author, stampType = \\\"Draft\\\", color = { r: 1, g: 1, b: 0 }) {\\n let annot = Object.assign(this.createBaseAnnotation(page, [50, 50, 80, 80], contents, author), {\\n opacity: 1,\\n initiallyOpen: false,\\n annotation_flag: 4,\\n color: color,\\n stampType: stampType\\n });\\n annot.type = \\\"/Stamp\\\";\\n this.annotations.push(annot);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8a1ff1141aeb2f4780b854ee6e71d99\",\n \"score\": \"0.49690145\",\n \"text\": \"function Target () { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"035c34e1d11beeb60170fac2f9e1cd9e\",\n \"score\": \"0.49558005\",\n \"text\": \"function AnnotationBase(control) {\\n this.control = control;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aaadd585d0ee6c00c66fdda996dfd240\",\n \"score\": \"0.49542597\",\n \"text\": \"function saveAnnotation() {\\n annoCallback.call(null, {\\n id:\\n $UI.annotOptPanel.setting.formSchemas[$UI.annotOptPanel._select_.value]\\n .id,\\n data: $UI.annotOptPanel._form_.value,\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f9bf6397718a605f32b3c5900decb31\",\n \"score\": \"0.49201268\",\n \"text\": \"function annotationInitialize() {\\n annotationGroupObject = new AnnotationGroup(graph, 0, 970);\\n annotationAddButton = new AddAnnotationButton(svg, 30, 30, (width + margin.left * 1.2), (margin.top * 0.8));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e639e9415b75862c947e210c9bebcaf7\",\n \"score\": \"0.49183327\",\n \"text\": \"function annotate(fn, annotation) {\\n fn.annotations = fn.annotations || [];\\n fn.annotations.push(annotation);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e639e9415b75862c947e210c9bebcaf7\",\n \"score\": \"0.49183327\",\n \"text\": \"function annotate(fn, annotation) {\\n fn.annotations = fn.annotations || [];\\n fn.annotations.push(annotation);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e78a6ab3a534a1600ed69341b2a5335\",\n \"score\": \"0.4917513\",\n \"text\": \"gatherDataAndSave() {\\n\\t\\tvar annotation = this.props.activeAnnotation;\\n\\t\\tvar data = {};\\n\\t\\tif(this.state.classifications.length > 0) {\\n\\t\\t\\tdata['classifications'] = this.state.classifications;\\n\\t\\t}\\n\\t\\tif(this.state.comments.length > 0) {\\n\\t\\t\\tdata['comments'] = this.state.comments\\n\\t\\t}\\n\\t\\tif(this.state.links.length > 0) {\\n\\t\\t\\tdata['links'] = this.state.links\\n\\t\\t}\\n\\t\\tannotation.data = data;\\n\\t\\tthis.props.saveAnnotation(annotation);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fcd49b016dc017520818ee86229d954\",\n \"score\": \"0.4912916\",\n \"text\": \"get annotations() {\\n return this.internalAnnotations;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fcd49b016dc017520818ee86229d954\",\n \"score\": \"0.4912916\",\n \"text\": \"get annotations() {\\n return this.internalAnnotations;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd811f4e418982558eaa8e5e698cf94\",\n \"score\": \"0.48914364\",\n \"text\": \"function OwnerID() {}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":75,"cells":{"query_id":{"kind":"string","value":"720b63c3b931b6dc2b076ce4a16a40f2"},"query":{"kind":"string","value":"_[static]_ Determine if a given layer group contains base layers"},"positive_passages":{"kind":"list like","value":[{"docid":"8c55b8f00c55b5d8282cd9199f6d66f0","score":"0.82641727","text":"static isBaseGroup(grp) {\n if (grp instanceof LayerGroup) {\n const lyrs = grp.getLayers().getArray();\n return lyrs.length && lyrs[0].get('type') === 'base';\n }\n else {\n return false;\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"8c55b8f00c55b5d8282cd9199f6d66f0\",\n \"score\": \"0.82641727\",\n \"text\": \"static isBaseGroup(grp) {\\n if (grp instanceof LayerGroup) {\\n const lyrs = grp.getLayers().getArray();\\n return lyrs.length && lyrs[0].get('type') === 'base';\\n }\\n else {\\n return false;\\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"a668d1a3a92a83b0bc4c3051dc769456","score":"0.6448219","text":"static ensureTopVisibleBaseLayerShown(map, groupSelectStyle) {\n let lastVisibleBaseLyr;\n LayerSwitcher.forEachRecursive(map, function (lyr, _idx, _arr) {\n if (lyr.get('type') === 'base' && lyr.getVisible()) {\n lastVisibleBaseLyr = lyr;\n }\n });\n if (lastVisibleBaseLyr)\n LayerSwitcher.setVisible_(map, lastVisibleBaseLyr, true, groupSelectStyle);\n }","title":""},{"docid":"35bcb885644ed6b154582ab38c8e3cf3","score":"0.6379424","text":"wantsLayer(layer) {\n return (this.getOptimizedStyleSet(this.m_tmpOptimizedSubSetKey.set(layer, undefined)).length > 0);\n }","title":""},{"docid":"73c8125aa05df7e3cf983df7264cba35","score":"0.61369467","text":"_hasLayer(name) {\r\n return !!this._piximData.layers[name];\r\n }","title":""},{"docid":"688d42351e23616635e1143e7f984bc9","score":"0.6126718","text":"function checkLayer(name, context) {\n var checkOut;\n for (var i = 0; i < context.length; i++) {\n if (layer[i].name === name) {\n checkOut = true;\n break;\n }\n else {\n checkOut = false;\n };\n };\n return checkOut;\n}","title":""},{"docid":"0488891325279a52041040844037141c","score":"0.597779","text":"function hasLayer(name) {\n\tvar result = false;\n\tif (isNav4) {\n\t\tif (document.layers[name]!=null) result=true;\n\t} else if (isIE) {\n\t\tif (eval('document.all.' + name)!=null) result=true;\n\t} else if (isNav) {\n\t\tvar theElements = document.getElementsByTagName(\"DIV\");\n\t\tvar theObj;\n\t\tvar j = -1;\n\t\tfor (i=0;i<theElements.length;i++) {\n\t\t\tif (theElements[i].id==name) result=true;\n\t\t}\n }\n\treturn result;\n}","title":""},{"docid":"7318c74f29e3c0d3ad7f62eefb6fa2c9","score":"0.59645474","text":"hasLayers(json_maps) {\n let has_layers = true\n\n if(this.json_map) {\n if(json_maps.length && json_maps.length > 1) {\n json_maps.forEach(jm => {\n if(!this.map.hasLayer(jm)) {\n has_layers = false\n }\n })\n } else {\n if(!this.map.hasLayer(json_maps)) {\n has_layers = false\n } \n }\n } else {\n has_layers = false\n }\n\n return has_layers\n }","title":""},{"docid":"41406a2b3f8cfc140ee84bb123dff979","score":"0.5905909","text":"function map_layer_check(map, layer)\n{\n\t\tif(!_.isUndefined(_.find(map.getLayers().getArray(), function(d){return d == layer;})))\n\t\t{return true;}\n\t\telse{return false;}\n}","title":""},{"docid":"fc713d5bed369d3ccb7a074c1b22a539","score":"0.58716214","text":"function isLayerSpec(spec) {\n return spec['layer'] !== undefined;\n}","title":""},{"docid":"a1decb2664a1521db73ea16f463b5fdb","score":"0.58487064","text":"function hasLayers() {\r\n var doc = activeDocument;\r\n if (doc.layers.length == 1 && doc.activeLayer.isBackgroundLayer) {\r\n alert('The active document has no layers.', 'No Layers', false);\r\n return false;\r\n }\r\n else {\r\n return true;\r\n }\r\n}","title":""},{"docid":"14da9b57dcb57c3beab977832a605bec","score":"0.58110213","text":"function checkIfActiveLayerAvailable() {\n\treturn true;\n}","title":""},{"docid":"917e157cef78a47fdc3e39ab2273bd07","score":"0.5764354","text":"async function checkLayer() {\n await layerCenterGroup.clearLayers();\n await layerBuildingGroup.clearLayers();\n await layerStoreGroup.clearLayers();\n //if (map.hasLayer(layerStoreGroup)) {\n // await map.removeLayer(layerCenterGroup);\n // await map.removeLayer(layerStoreGroup);\n // await map.removeLayer(layerBuildingGroup);\n // layerCenterGroup = await new L.LayerGroup();\n // layerStoreGroup = await new L.LayerGroup();\n // layerBuildingGroup = await new L.LayerGroup();\n //}\n}","title":""},{"docid":"4953e12f059616712a4058504f226229","score":"0.57239014","text":"function addBaseMapLayers(layerObj) {\n var baseMapLayer;\n\n switch (layerObj.layerType.toLowerCase()) {\n case \"imagewms\":\n baseMapLayer = new ol.layer.Image({\n title: layerObj.title,\n type: \"base\",\n visible: layerObj.options.visible,\n source: new ol.source.ImageWMS({\n url: layerObj.url,\n params: {\n VERSION: \"1.1.1\",\n LAYERS: layerObj.params.layers,\n FORMAT: layerObj.params.format\n },\n wrapX: false\n }),\n name: layerObj.title\n });\n break;\n case \"tilewms\":\n baseMapLayer = new ol.layer.Tile({\n title: layerObj.title,\n type: \"base\",\n visible: layerObj.options.visible,\n source: new ol.source.TileWMS({\n url: layerObj.url,\n params: {\n VERSION: \"1.1.1\",\n LAYERS: layerObj.params.layers,\n FORMAT: layerObj.params.format\n },\n wrapX: false\n }),\n name: layerObj.title\n });\n break;\n case \"xyz\":\n baseMapLayer = new ol.layer.Tile({\n title: layerObj.title,\n type: \"base\",\n visible: layerObj.options.visible,\n source: new ol.source.XYZ({\n url: layerObj.url,\n wrapX: false\n }),\n name: layerObj.title\n });\n break;\n }\n\n if (baseMapLayer != null) {\n // Add layer(s) to the layerSwitcher control\n baseMapGroup.getLayers().push(baseMapLayer);\n }\n }","title":""},{"docid":"a1f0128fbd8deb80ae4a31d7ca516296","score":"0.5687244","text":"function floorHasThisLayer(floorPins, layer) {\n for (var i = 0; i < floorPins.length; i++) {\n var pin = floorPins[i];\n if (pin.LayerId === layer.Id) { // Case: the current floor has a pin corresponding to the given amenity/layer , return true\n return true;\n }\n }\n return false;\n}","title":""},{"docid":"9957a9a3c6ccea12a5530294e841d71c","score":"0.5679239","text":"function validateLayer( __layer )\n{\n\tif ( __layer.kind == LayerKind.NORMAL ) {\n\t\tif ( __layer.typename == \"ArtLayer\" ) {\n\t\t\tif ( __layer.visible == true) {\n\t\t\t\t// if ( __layer.blendMode == BlendMode.NORMAL ) {\n\t\t\t\t\treturn true;\n\t\t\t\t// }\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n}","title":""},{"docid":"4f707a27bbe0b9dddd6f3d3a10761b87","score":"0.5572033","text":"function isConnectedToBase( stackElem, without, dbg_count )\n\t{\n\t\tif (typeof(dbg_count) == \"undefined\")\n\t\t\tdbg_count = 0;\n\t\t\t\n\t\tif (typeof(without) == \"undefined\")\n\t\t\twithout = null;\n\t\t\t\n\t\t$.bp( dbg_count > 150 );\t// oops, got stuck in a loop...\n\n\t\tif (stackElem == null)\n\t\t\treturn false;\n\t\t\t\n\t\tif (stackElem == without)\n\t\t\treturn false;\n\t\t\t\n\t\tif (stackElem.fConnectedTo == stackElem)\n\t\t\treturn true;\t\t// Already at base\n\t\treturn isConnectedToBase( stackElem.fConnectedTo, without, dbg_count + 1 );\n\t}","title":""},{"docid":"e44e72ede576687d34c9de98bd8bd837","score":"0.55500525","text":"function ArtLayerNameCheck(name)\n{\n \n //check if layer name matches Rule Tile naming\n return Contains(name, \n [ \n \"Top\",\"Bottom\",\n \"Right\", \"Left\",\n \"Outer\", \"Inner\",\n \"Single\",\"Double\",\n \"Triple\", \"Quad\",\n ]);\n}","title":""},{"docid":"6729c646f779bf244ce6eb77837bb8eb","score":"0.5548346","text":"drawGroupLayer(ctx, layer) {\n const { game } = this.props;\n\n const layerPosition = {\n x: (layer.x + layer.startx) * game.map.tilewidth + (layer.offsetx || 0),\n y: (layer.y + layer.starty) * game.map.tileheight + (layer.offsety || 0)\n };\n\n ctx.save();\n ctx.translate(layerPosition.x, layerPosition.x);\n\n layer.layers.forEach(layer => {\n this.drawLayer(ctx, layer);\n });\n\n ctx.restore();\n\n // Not cacheable as a whole, but all sublayers will be cached if possible.\n return false;\n }","title":""},{"docid":"af1a49184064c00a37985bb4c879c5c3","score":"0.553538","text":"function layerIdsExist(occurence, network) {\n for (var i in occurence) {\n // Check all items in the occurence\n if (!layerIdExists(occurence[i].matchID, network)) {\n // Layer does not exist\n return false;\n }\n }\n return true; // All layers exist\n}","title":""},{"docid":"abe99a46aa87c29090f0e40783d0d4c9","score":"0.5527155","text":"function removeAllEmptyLayerSets(obj) {\n var foundEmpty = true;\n for( var i = obj.layerSets.length-1; 0 <= i; i--) {\n if( removeAllEmptyLayerSets(obj.layerSets[i])) {\n obj.layerSets[i].remove();\n } else {\n foundEmpty = false;\n }\n }\n if (obj.artLayers.length > 0) {\n\t\tfoundEmpty = false;\n\t}\n return foundEmpty;\n}","title":""},{"docid":"854fcb799628e1b64576cc58d3f2a1c4","score":"0.54907084","text":"function checkWin(){\n\t\tif(layerAmount == layerInD.length){\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}","title":""},{"docid":"ff7d6245d9e5ef73955ccb9214c204d2","score":"0.5413825","text":"isNewPosInBounds(layer, x, y, width, height){\n\t\tvar _x = layer.x;\n\t\tvar _y = layer.y;\n\t\tvar _width = layer.width;\n\t\tvar _height = layer.height;\n\t\t\n\t\tlayer.x = x;\n\t\tlayer.y = y;\n\t\tlayer.width = width;\n\t\tlayer.height = height;\n\t\t\n\t\tvar inbounds = true;\n\t\tlayer.getCorners().forEach(corner => {\n\t\t\tvar pos = Canvas.absolutePoint(corner.x, corner.y, layer.x, layer.y, layer.rotation);\n\t\t\tif (pos.x < 0 || pos.x > this.width || pos.y < 0 || pos.y > this.width) {\n\t\t\t\tinbounds = false;\n\t\t\t}\n\t\t});\n\t\tlayer.x = _x;\n\t\tlayer.y = _y;\n\t\tlayer.width = _width;\n\t\tlayer.height = _height;\n\t\treturn inbounds;\n\t}","title":""},{"docid":"4d54898cc112548a20a93eac7f60ef65","score":"0.5383998","text":"hasBalancedGrouping(tokens) {\n const openStack = [];\n _.each(tokens, (token) => {\n if (token.type !== 'grouping') return;\n\n if (this.isOpenGroupToken(token)) {\n openStack.push(token);\n return;\n }\n\n if (this.openTokenMatchesCloser(_.last(openStack), token)) {\n openStack.pop();\n }\n });\n\n return _.isEmpty(openStack);\n }","title":""},{"docid":"63f9d5f48dde0e30b57fcc888536c872","score":"0.5375178","text":"function isNeedExportLayer(layer) {\n\tif(layer.kind == LayerKind.TEXT || layer.visible == false) return false;\n\tvar type = getCtrlType(layer);\n\tfor each(var val in ArrNoNeedExport) {\n\t\tif(val == type) return false;\n\t}\n var arrParam = layer.name.split(\"_\");\n if(arrParam.length > 1) {\n return false;//公共资源不导出\n }\n\treturn true;\n}","title":""},{"docid":"1e10aef4851a07c504845b2d411157ea","score":"0.5373188","text":"createLayer() {\n assert('BaseLayer\\'s \\'createLayer\\' should be overridden.');\n }","title":""},{"docid":"8554046f868fa499de22e5c6d2184eee","score":"0.53403306","text":"function layerIdExists(id, network) {\n for (var i in network.layers) {\n // Iterate over all layers in the Network\n if (network.layers[i].id === id) {\n // Check if it has the searched ID\n return true;\n }\n }\n return false; // No layer with the searched ID\n}","title":""},{"docid":"f3bf60a606e258341d8b34570770bad1","score":"0.53284216","text":"onlyDisplayValidLayers() {\n const validSource = 'regional';\n\n // get the layer list from the config file\n const { TMSLayers } = mapConfig;\n const layers = store.getStateItem('mapLayerDisplayStatus');\n\n // filter the layers based on current source\n Object.keys(layers).forEach((layer) => {\n const asource = TMSLayers.filter(TMSlayer => (\n TMSlayer.id === layer && TMSlayer.source === validSource\n ));\n\n // layer is on and not part of the tabs data so it needs to be off\n if (layers[layer] && asource.length === 0) {\n this.mapComponent.toggleVisLayerOff(layer);\n }\n\n // layer is on IS part of the tabs data os it needs to be on\n if (layers[layer] && asource.length > 0) {\n this.mapComponent.toggleVisLayerOn(layer);\n }\n });\n }","title":""},{"docid":"9cc998aa1b3267c97f212a2b6307045f","score":"0.5327151","text":"getLayers(layerTypes) {\n //get the map layers\n var allLayers = this.map.getStyle().layers;\n //iterate through the layers to get the matching ones\n return allLayers.filter((layer) => {\n if (\n layer.hasOwnProperty(\"metadata\") &&\n layer.metadata.hasOwnProperty(\"type\")\n ) {\n return layerTypes.includes(layer.metadata.type);\n } else {\n return false;\n }\n });\n }","title":""},{"docid":"21928ec3553e3d38980664aa03ebcf05","score":"0.5323436","text":"function CheckLayers(docLayers)\r{\r var list = STYLE_FABRIC_LAYERS.split(',');\r var listCount = list.length;\r var ontbreekt = \"\";\r var errorMsg = \"\";\r var meerDanEen = false;\r\r for ( i = 0; i < listCount; i++ )\r {\r\r var bestaat = false;\r var layerName = new String(list[i]);\r bestaat = IsElementOf(layerName, docLayers);\r\r if ( ! bestaat )\r {\r if ( ontbreekt != \"\" )\r {\r ontbreekt = ontbreekt + ', ';\r meerDanEen = true;\r }\r ontbreekt = ontbreekt + layerName\r }\r }\r if ( ontbreekt != \"\" ) {\r if ( meerDanEen )\r errorMsg = \"De volgende lagen ontbreken: \" + ontbreekt\r else\r errorMsg = \"De volgend laag ontbreekt: \" + ontbreekt;\r throw(errorMsg);\r }\r}","title":""},{"docid":"d6d98a695e218f50f5d1e2949b619216","score":"0.5304599","text":"if (layer.name().startsWith('__') || layer.name().startsWith(SCType.SCBackground)) {\n continue;\n }","title":""},{"docid":"ceb088b8bf8b7a2840df3cbaaf085ef0","score":"0.5286423","text":"function is_group_valid(group)\n{\n\tif (group.length <= 2)\n\t\treturn false;\n\t\n\tvar follow_num = true;\n\tvar same_colour = true;\n\tvar same_number = true;\n\tvar diffrent_colours = true;\n\t\n\tvar counter = null;\n\tvar colour = null;\n\tvar number = null;\n\tvar colours = [];\n\tfor (var i = 0; i < group.length; i++)\n\t{\n\t\tvar tile = group[i];\n\t\tif (counter == null)\n\t\t\tcounter = tile.number;\n\t\telse\n\t\t\tif (tile.number != ++counter)\n\t\t\t\tfollow_num = false;\n\t\t\n\t\tif (colour == null)\n\t\t\tcolour = tile.colour;\n\t\telse\n\t\t\tif (tile.colour != colour)\n\t\t\t\tsame_colour = false;\n\t\t\n\t\tif (number == null)\n\t\t\tnumber = tile.number;\n\t\telse\n\t\t\tif (tile.number != number)\n\t\t\t\tsame_number = false;\n\t\t\n\t\tif (colours.indexOf(tile.colour) != -1)\n\t\t\tdiffrent_colours = false;\n\t\tcolours.push(tile.colour);\n\t}\n\t\n\treturn (follow_num && same_colour) || (same_number && diffrent_colours);\n}","title":""},{"docid":"09bba25c85050ce4c586ce3a784ae7b1","score":"0.5275984","text":"function isRoutingLayer(layer) {\n markers = placesLayer.eachLayer(function(marker) {return marker});\n numMarkers = markers.length;\n\n totalCount = 0\n latLonCount = 0\n layer.eachLayer(function(layer) {\n count += 1;\n if (layer.hasOwnProperty('_latlng')) {\n latLonCount += 1\n }\n });\n if (totalCount == numMarkers + 1 && latLonCount == totalCount - 1) {\n return true\n } else {\n return false\n }\n}","title":""},{"docid":"237127f526c3c950bad7e97f84c7e157","score":"0.5243351","text":"_getBoundingBox() {\n assert('BaseLayer\\'s \\'_getBoundingBox\\' should be overridden.');\n }","title":""},{"docid":"2381a1f6c828bb3ff5c72fb4bc31a639","score":"0.5239474","text":"function checkLayers(cat) {\n\t\t\t\tvar obj = this;\n\t\t\t\tentityIdx=pinLayers[cat];\n\t\t\t\tl=layers[cat];\n\t\t\t\tif((l!=undefined)&&(l.length!=0)) {\n\t\t\t\t\tif ( l[0].getVisible() ) {\n\t\t\t\t\t\t$('div#'+cat).removeClass('on');\n\t\t\t\t\t\t$('div#'+cat).children('ul.point-list').slideUp(); // to keep only one open - make option??\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif ( (cat != 'property') && (cat != 'featurepoint')) {\n\t\t\t\t\t\t\t$('.feature-list').each(function() {\n\t\t\t\t\t\t\t\tif ($(this).hasClass('on')) {\n\t\t\t\t\t\t\t\t\tvar featureid = $(this).attr('id').toString().substr(13);\n\t\t\t\t\t\t\t\t\tvar pinidx = getPinIndex(featureid);\n\t\t\t\t\t\t\t\t\tl2=layers[featureid];\n\n\t\t\t\t\t\t\t\t\t$('div#feature-list-'+featureid).removeClass('on');\n\t\t\t\t\t\t\t\t\t$('div#feature-list-'+featureid).addClass('off');\n\t\t\t\t\t\t\t\t\t$(this).removeClass('on');\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\tvar cats = cat===null?categories:[cat];\n\t\t\t\t\t\t\t$.each(cats, function(i, val) {\n\t\t\t\t\t\t\t\tvar shapes = [];\n\t\t\t\t\t\t\t\t$.each(items, function(j) {\n\t\t\t\t\t\t\t\t\tvar catSelectedArray = new Array( );\n\t\t\t\t\t\t\t\t\tvar currarray = String(items[j].category);\n\t\t\t\t\t\t\t\t\tcatSelectedArray = currarray.split(\",\");\n\n\t\t\t\t\t\t\t\t\tfor (x in catSelectedArray){\n\t\t\t\t\t\t\t\t\t\tif(catSelectedArray[x]==val) {\n\t\t\t\t\t\t\t\t\t\t\tvar loc = getCenterPoint(j);\n\t\t\t\t\t\t\t\t\t\t\tcenterArray.push(loc);\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\tcenterArray = $.uniqueArray(centerArray);\n\t\t\t\t\t\t\tsetBestView();\n\t\t\t\t\t\t}\n\n\n\t\t\t\t\t\t$('div#'+cat).removeClass('off');\n\t\t\t\t\t\t$('div#'+cat).addClass('on');\n\t\t\t\t\t}\n\t\t\t\t\tfor (i = 0; i < l.length; i++) {\n\t\t\t\t\t\tif(l[i]!=undefined) {\n\t\t\t\t\t\t\tif(l[i].getVisible() == true) {\n\t\t\t\t\t\t\t\tl[i].setVisible(false);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tl[i].setVisible(true);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}","title":""},{"docid":"b1d242ad78a323d300b350d194e49e09","score":"0.52298504","text":"function checkWFSLayers() {\n\t var layer = map.layers;\n\t var layerCounter = 0;\n\t for(var a = 0; a < layer.length; a++ ) {\n\t\tif(layer[a].CLASS_NAME == 'OpenLayers.Layer.Vector') {\n\t\t if(layer[a].getVisibility() == true) {\n\t\t\tlayerCounter = layerCounter + 1;\n\t\t }\n\t\t}\n\t };\n\t return layerCounter;\n\t}","title":""},{"docid":"34d4d935ad1e09c08b34615895e8b1f8","score":"0.5203372","text":"function le(t) {\n return null !== t.collectionGroup;\n}","title":""},{"docid":"d2cc1da5603e1bdaaadeda9ccf5d24db","score":"0.519801","text":"_hasAncestorOfType(type){return!1}","title":""},{"docid":"daa7d220bcc918a7b9e91eb8a46ecf41","score":"0.51847816","text":"static isGroupLoaded(groupId) {\n return this._loadedGroups.indexOf(groupId) !== -1;\n }","title":""},{"docid":"47a706f2344f2219734127039dc63755","score":"0.516996","text":"function getLayerVisibility() {\n var layers = {},\n hex = document.getElementById('hex'),\n points = document.getElementById('points');\n if (hex && points) {\n // If we have the controls, use their state as the config\n layers.hex = hex.checked;\n layers.points = points.checked;\n }\n return layers;\n }","title":""},{"docid":"d26d926eadaa56c83812f8752d289c28","score":"0.51573086","text":"static getGroupsAndLayers(grp, filterFn) {\n const layers = [];\n filterFn =\n filterFn ||\n function (_lyr, _idx, _arr) {\n return true;\n };\n LayerSwitcher.forEachRecursive(grp, function (lyr, idx, arr) {\n if (lyr.get('title')) {\n if (filterFn(lyr, idx, arr)) {\n layers.push(lyr);\n }\n }\n });\n return layers;\n }","title":""},{"docid":"5a9107c2f6635f91f102c5634a8b20a4","score":"0.51570123","text":"isValidGroup() {\n // To ensure we can find the keyboard root node to appropriately respond to\n // visibility changes, never mark it as invalid.\n return true;\n }","title":""},{"docid":"2711b7a6ac010d04fab534b2ee60280c","score":"0.5141496","text":"function fn(t) {\n return null !== t.collectionGroup;\n}","title":""},{"docid":"dc4a7cf104c3769355c16a0b64089ea5","score":"0.5136749","text":"wantsFeature(layer, geometryType) {\n return (this.getOptimizedStyleSet(this.m_tmpOptimizedSubSetKey.set(layer, geometryType))\n .length > 0);\n }","title":""},{"docid":"2ee1aa9936796cedd707f906ce9804e6","score":"0.5131374","text":"function Zt(t) {\n return null !== t.collectionGroup;\n}","title":""},{"docid":"91285eec97e78f0a8d88318090aea2dc","score":"0.5129392","text":"function ge(t) {\n return null !== t.collectionGroup;\n}","title":""},{"docid":"72be0dc6ceb1741bc3006bdfd1a891ba","score":"0.5121702","text":"function shouldFetchGroup(state)\n{\n const group = state.group;\n\n if (!group.group) {\n return true;\n } else if (group.isFetching) {\n return false;\n } else {\n return group.didInvalidate;\n }\n}","title":""},{"docid":"4466839ec01b64202caf6c48e0dc9272","score":"0.5116094","text":"function getSublayers(d) {\r\n //If object d has a sublayers property, return it\r\n if (d.hasOwnProperty('sublayers')) {\r\n return d.sublayers\r\n }\r\n //Otherwise return 0\r\n return 0\r\n }","title":""},{"docid":"af74911eae8d75669825b833a3decaac","score":"0.50863","text":"isComposite() {\n return this.regions.length > 0;\n }","title":""},{"docid":"dfb3e948e8cacd63571dc93bed31e55d","score":"0.5078097","text":"static isBitmapFontsLoaded(groupId) {\n if (!this._lazyBitmapFontsToLoad.find((elem) => {\n return elem.group.indexOf(groupId) !== -1;\n })) {\n return true;\n }\n return this._bitmapFontsLoadedGroups.indexOf(groupId) !== -1;\n }","title":""},{"docid":"1d45507be926dda29267316d8f29fcb9","score":"0.5058799","text":"static isAssetsLoaded(groupId) {\n if (!this._lazyAssetToLoad.find((elem) => {\n return elem.group.indexOf(groupId) !== -1;\n })) {\n return true;\n }\n return this._assetsLoadedGroups.indexOf(groupId) !== -1;\n }","title":""},{"docid":"50e6e108716f2777a028d75a1b38802b","score":"0.50476176","text":"function groupLayers(myComp,startIndex){\r \r var layers = myComp.layers;\r var refLayer = myComp.layer(startIndex);\r var refInPoint = refLayer.inPoint;\r var refOutPoint = refLayer.outPoint;\r var groupArray = new Array;\r groupArray.push(refLayer.index);\r alert(refInPoint);\r for (l=refLayer.index-1; l>=1; l--){\r var curLayerInPoint = layers[l].inPoint; \r var curLayerOutPoint = layers[l].outPoint; \r if((curLayerInPoint >= refInPoint)&&(curLayerOutPoint <= refOutPoint)){\r groupArray.push(layers[l].index);\r if(l==1){\r shotsArray.push(groupArray);\r }\r }else {\r shotsArray.push(groupArray);\r groupLayers(myComp,l);\r }\r \r }\r}","title":""},{"docid":"96a7a6398b4baab89d4aa97d1b36c314","score":"0.5033604","text":"function hasCustomParameters (layerName) {\r\tvar result = false;\r\tif (layerName.search(patternRotate) != -1 || layerName.search(patternScale) != -1) {\r\t\tresult = true;\r\t}\r\r\treturn result;\r}","title":""},{"docid":"e36de5d42f6a5b65b3c65fa3974f8312","score":"0.5026706","text":"function enableBaselayers(){\n\n // Store baselayer tiles\n var OpenStreetMap_HOT = L.tileLayer('http://{s}.tile.openstreetmap.fr/hot/{z}/{x}/{y}.png', {\n maxZoom: 19,\n attribution: '© <a href=\"http://www.openstreetmap.org/copyright\">OpenStreetMap</a>, Tiles courtesy of <a href=\"http://hot.openstreetmap.org/\" target=\"_blank\">Humanitarian OpenStreetMap Team</a>'\n });\n\n var Stamen_Watercolor = L.tileLayer('http://stamen-tiles-{s}.a.ssl.fastly.net/watercolor/{z}/{x}/{y}.png', {\n attribution: 'Map tiles by <a href=\"http://stamen.com\">Stamen Design</a>, <a href=\"http://creativecommons.org/licenses/by/3.0\">CC BY 3.0</a> — Map data © <a href=\"http://www.openstreetmap.org/copyright\">OpenStreetMap</a>',\n subdomains: 'abcd',\n minZoom: 1,\n maxZoom: 16,\n ext: 'png'\n });\n\n var Stamen_Toner = L.tileLayer('http://stamen-tiles-{s}.a.ssl.fastly.net/toner/{z}/{x}/{y}.png', {\n attribution: 'Map tiles by <a href=\"http://stamen.com\">Stamen Design</a>, <a href=\"http://creativecommons.org/licenses/by/3.0\">CC BY 3.0</a> — Map data © <a href=\"http://www.openstreetmap.org/copyright\">OpenStreetMap</a>',\n subdomains: 'abcd',\n minZoom: 0,\n maxZoom: 20,\n ext: 'png'\n });\n\n // Store above tiles in baselayers object - will iterate through object and add to DOM\n window.baselayers = {\n 0: {name: \"OSM HOT\", layer: OpenStreetMap_HOT},\n 1: {name: \"Stamen Watercolor\", layer: Stamen_Watercolor},\n 2: {name: \"Stamen Toner\", layer: Stamen_Toner}\n }\n\n // Turn on default baselayer or chosen layer from last session\n var selectedBaseLayer = document.cookie.replace(/(?:(?:^|.*;\\s*)selectedBaseLayer\\s*\\=\\s*([^;]*).*$)|^.*$/, \"$1\");\n if(selectedBaseLayer){\n map.addLayer(baselayers[selectedBaseLayer].layer); \n } else {\n map.addLayer(baselayers[0].layer);\n }\n\n // Populate basemap switcher dropdown menu\n for(x in baselayers){\n console.log(baselayers[x].name);\n $('#baselayersMenu').append('<li><a href=\"#\" onclick=\"switchBaselayer('+x+')\">'+baselayers[x].name+'</a></li>');\n \n // Show a loading css div when basemap tiles are loading\n $(baselayers[x].layer).on('loading', function(){\n $('#loaders').fadeIn();\n }); \n // Hide loading css when baselayer has finished loading\n $(baselayers[x].layer).on('load', function(){\n $('#loaders').fadeOut();\n });\n }\n}","title":""},{"docid":"fb58395069ea9f569749b9f3e787985f","score":"0.49983126","text":"function initLayers() {\n\n var mapBaseTile = null;\n var mapGroundTile = null;\n\n for (var key in tilesets) {\n var tileset = tilesets[key];\n\n if (tileset.did === 0) {\n mapBaseTile = tileset;\n } else if (tileset.did === 1) {\n mapGroundTile = tileset;\n }\n if (isDefined(mapBaseTile) && isDefined(mapGroundTile)) {\n break;\n }\n }\n\n if (isDefined(mapBaseTile) && isDefined(mapBaseTile.image)) {\n tileMap.initBaseLayer({\n path: assetdir + mapBaseTile.image\n });\n }\n\n if (isDefined(mapGroundTile) && isDefined(mapGroundTile.image)) {\n tileMap.initGroundLayer({\n path: assetdir + mapGroundTile.image\n });\n }\n\n tileMap.setupGroundLayers();\n }","title":""},{"docid":"cd55b23080305bf97668532c6a25063a","score":"0.49925822","text":"function isBaseClassOf(apiItem) {\n return apiItem.hasOwnProperty(_isOptional);\n }","title":""},{"docid":"5df15c4ed2437867f45af9dfa82a60e2","score":"0.49903056","text":"checkIfDefault(group) {\n if(group.properties.default === null) { \n return true;\n \n } else { \n return false;\n }\n \n }","title":""},{"docid":"7e3e4b84b01d531906ab346296b79867","score":"0.4983518","text":"function featureGroupOverRadiusCircle() {\n // Make sure groups are on map before bringing to front\n // if (json_group_four._map !== null) {\n // json_group_four.bringToFront();\n // }\n if (json_group_two._map !== null) {\n json_group_two.bringToFront();\n }\n if (json_group._map !== null) {\n json_group.bringToFront();\n }\n // if (json_group_three._map !== null) {\n // json_group_three.bringToFront();\n // }\n }","title":""},{"docid":"2e477837d4d36cf57b4c9936fb5f1727","score":"0.49817175","text":"function toggleLayer(group, layer, toggle){\r\n\t \tif(group == 'null' || layer == 'null')\r\n\t\t\treturn;\r\n\r\n\t\t//toggle selection\r\n\t\tif(!toggle) {\r\n\t\t\t$('li[layer=\"' + layer +'\"][group=\"' + group +'\"]').toggleClass(\"active\");\r\n\t\t}\r\n\t\tfor (var i in layers[group][layer]) {\r\n//set search url\r\n\t\t\t$( \"#search\" ).combogrid( \"option\", \"url\", layers[group][layer][i][\"search_url\"]);\r\n\t\t\t//set grid url\r\n\t\t\tgrid_base_url = layers[group][layer][i][\"grid_url\"];\r\n\t\t\tupdateSiteGrid();\t\r\n\t\t\tswitch(layers[group][layer][i][\"type\"]){\r\n\t\t\t\r\n\t\t\t\tcase \"WMS\":\r\n\t\t\t\t\tif(layers[group][layer][i][\"layer\"] == undefined){\r\n\t\t\t\t\t\tlayers[group][layer][i][\"layer\"] = buildWMS(layer, layers[group][layer][i][\"url\"], layers[group][layer][i][\"options\"]);\r\n\t\t\t\t\t\tmap.addLayer(layers[group][layer][i][\"layer\"]);\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\tmap.removeLayer(layers[group][layer][i][\"layer\"]);\r\n\t\t\t\t\t\tdelete layers[group][layer][i][\"layer\"];\r\n\t\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\t\t\t\tcase \"KML\":\r\n\t\t\t\t\tif(layers[group][layer][i][\"layer\"] == undefined){\r\n\t\t\t\t\t \r\n\t\t\t\t\t\tlayers[group][layer][i][\"layer\"] = buildKML(layer, layers[group][layer][i][\"url\"]);\r\n\t\t\t\t\t\tmap.addLayer(layers[group][layer][i][\"layer\"]);\r\n\t\t\t\t\t\t//add cell tech legend\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tmap.removeLayer(layers[group][layer][i][\"layer\"]);\r\n\t\t\t\t\t\tdelete layers[group][layer][i][\"layer\"];\r\n\t\t\t\t\t\t//remove cell tech legend\r\n\t\t\t\t\t\tvar legend_url = layers[group][layer][i][\"legend_url\"];\r\n\t\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t}","title":""},{"docid":"1836d23d3d4cd85803cb6ba76ddd98e6","score":"0.49779212","text":"function initBaseLayer() {\n // set basemap tilelayer URL if it does not already exist\n if (!self.basemapUrl) {\n self.basemapUrl = self.getScopeDefaults().basemapUrl;\n }\n\n self._baseLayer = L.tileLayer(self.basemapUrl).addTo(self._map);\n }","title":""},{"docid":"192c3316bbf6e0c79f1647df63ce7e23","score":"0.49665502","text":"function WLayer_isRendered()\n{\n return this.rendered;\n}","title":""},{"docid":"70391fc080ea0c894f0fa106fa885ba0","score":"0.49649334","text":"connected(layer) {\n switch (true) {\n case (this.countAllToAll(layer) == this.size * layer.size) :\n return Layer.connectionType.ALL_TO_ALL;\n\n case (this.countOneToOne(layer) == this.size) :\n return Layer.connectionType.ONE_TO_ONE;\n }\n }","title":""},{"docid":"0b7be3b1f3bccc2a113d781d5796c2b4","score":"0.49629086","text":"function updateDoubleBaseLayer()\n\t{\n\t\tmap = report.getComponent(\"map\");\n\t\tactiveMap = report.getComponent(\"activeMap\");\n\t\tmapData.noneBaseLayers = []; // Remove non-base layers from layer list.\n\n\t\tif (mapData.baseLayers.length > 1)\n\t\t{\n\t\t\tvar layer = mapData.baseLayers[1];\n\t\t\tlayer.dataField = dataGroup.thematic.getDataField();\n\t\t\tlayer.highlightColor = report.highlightColor;\n\t\t\tlayer.selectionColor = report.selectionColor;\n\t\t\tlayer.highlightOpacity = report.highlightOpacity;\n\t\t\tlayer.selectionOpacity = report.selectionOpacity;\n\t\t\tif (!layer.displayLabelsOnly) layer.interactive = true;\n\t\t\tlayer.dataLabel = report.config.getComponent(\"map\").getProperty(\"tip\"+dataGroup.suffix);\n\t\t\tlayer.tipFunction = function(item)\n\t\t\t{\n\t\t\t\tvar s = ia.tipFunction(item, \"map\", dataGroup.suffix);\n\t\t\t\treturn s;\n\t\t\t};\n\n\t\t\tif (report.config.template == ia.DOUBLE_BASELAYER_REPORT)\n\t\t\t{\n\t\t\t\tinteractionGroup.addComponent(layer);\n\t\t\t}\n\t\t\tif (report.config.template == ia.DOUBLE_BASELAYER_REPORT_NEW)\n\t\t\t{\n\t\t\t\tlayer.selectable = false;\n\t\t\t}\n\t\t\tmap.addLayer(layer);\n\t\t}\n\t}","title":""},{"docid":"c3d61ffb1b281ff912c2249ed792d5fe","score":"0.49577332","text":"function hasAnyFeatures() {\n var has_features = false;\n markers.eachLayer(function (layer) {\n if (!$.isEmptyObject(layer)) {\n has_features = true;\n }\n });\n return has_features;\n }","title":""},{"docid":"952cebeb6a5a23ed1bf31a388898c1fc","score":"0.49522424","text":"function addLayer(l)\n{\nvar added = false;\nfor (var i = 0;i<layers.length;i++ )\n{\nif (l.index == layers[i].index)\n{\nadded = true;\nbreak;\n}\n}\nif (!added) layers.push(l);\n}","title":""},{"docid":"9b3f9303817758e531d26618227bdf51","score":"0.49454865","text":"function checkGroup(name, context) {\n var checkOut;\n for (var i = 0; i < context.length; i++) {\n if (group[i].name === name) {\n checkOut = true;\n break;\n }\n else {\n checkOut = false;\n };\n };\n return checkOut;\n}","title":""},{"docid":"34b8e34fed4e412daf3d623fb0301f05","score":"0.49447358","text":"function getVisibleLayers() {\n // use .filter to count boolean true values\n // TODO: make nicer\n return layerRegistry.getLayersByType(Geo.Layer.Types.ESRI_FEATURE).concat(layerRegistry.getLayersByType(Geo.Layer.Types.ESRI_DYNAMIC)).filter(function (l) {\n return l.visibleAtMapScale;\n }).concat(layerRegistry.getLayersByType(Geo.Layer.Types.OGC_WMS)).length;\n }","title":""},{"docid":"401b460edcf8797db6546abffb950f24","score":"0.4942818","text":"function hasMinorGroup(map)\n{\n for (var index in map)\n {\n if (index != 'weight')\n return true;\n }\n return false;\n}","title":""},{"docid":"8ed752a112b8bd542b42a214d25560e2","score":"0.49340457","text":"triggerToggleLayerGroup() {\n const datasetID = this.props.dataset.id;\n const addLayerGroup = !this.props.isLayerGroupAdded(datasetID);\n this.props.toggleLayerGroup(datasetID, addLayerGroup);\n }","title":""},{"docid":"57e475776d15dd1582662ccd88bdcc16","score":"0.4932358","text":"get basicGeometryLoaded() {\n for (const kind of this.m_basicGeometryKinds) {\n if (!this.m_geometryKindsLoaded.has(kind)) {\n return false;\n }\n }\n return true;\n }","title":""},{"docid":"061fedf6e20f22aa795f1fa31c3e1330","score":"0.4931768","text":"function removeLayer_check(map, layer)\n{\n\tif(map_layer_check(map, layer))\n\t{map.removeLayer(layer);}\n}","title":""},{"docid":"ef540859bd2dd94a60a0fe3664bd87a3","score":"0.4923869","text":"function collectClippingLayers( )\n{\n\tvar i = layerIndex;\n\tvar currentLayer = layerParent.layers[ i ];\n\n\twhile ( currentLayer.grouped == true )\n\t{\n\t\tcurrentLayer = layerParent.layers[ i ];\n\t\tvar isvalid = validateLayer( currentLayer );\n\n\t\tif ( currentLayer.typename == \"LayerSet\" ) {\n\t\t\tcollectLayersBelow( 0, currentLayer );\n\t\t} else if ( isvalid == true ) {\n\t\t\tcollectedLayers.push( currentLayer );\n\t\t}\n\n\t\ti++;\n\t}\n}","title":""},{"docid":"f41482e15fba3f442457017a702ffa71","score":"0.49200445","text":"function changeBaselayer(tmpDiv) {\n //***Remove old layer\n var layerDivs = d3.select(\"#baselayerListDropdown\").selectAll(\"div\");\n \n layerDivs[0].forEach(function(tmpLayer) {\n if(d3.select(tmpLayer).select(\"span\").style(\"visibility\") == \"visible\") {\n d3.select(tmpLayer).select(\"span\").style(\"visibility\", \"hidden\");\n map.removeLayer(layerNames.baseLayers.values[d3.select(tmpLayer).property(\"value\")]);\n }\n });\n\n //***Add new layer\n d3.select(tmpDiv).select(\"span\").style(\"visibility\", \"visible\");\n map.addLayer(layerNames.baseLayers.values[tmpDiv.value]);\n layerNames.baseLayers.values[tmpDiv.value].bringToBack(); \n }","title":""},{"docid":"209d83f4c2a784e4409611812b6f5086","score":"0.49195316","text":"_isMountsBound () {\n log.trace('_isMountsBound')\n return !!this.boundMounts.length\n }","title":""},{"docid":"e740f099a0d874a07b86f6240f43c152","score":"0.48781425","text":"function isBoundingBoxDrawn() {\n if (ll == undefined || ur == undefined) {\n return false;\n }\n var wblon = ll.lon.toFixed(2);\n var eblon = ur.lon.toFixed(2);\n var nblat = ur.lat.toFixed(2);\n var sblat = ll.lat.toFixed(2);\n if (!isNaN(wblon) && !isNaN(eblon) && !isNaN(nblat) && !isNaN(sblat) && submitFlag == 1) {\n return true;\n }\n return false;\n}","title":""},{"docid":"143c9acf535d81ae36fcfcf6c1164c9f","score":"0.4876944","text":"static _isExistsContextName(group) {\n const context = GameState.current;\n\n if (group === undefined || group.state === undefined) {\n return false;\n }\n\n if (group.state.config.name !== context.config.name) {\n return false;\n }\n\n return true;\n }","title":""},{"docid":"7a4dff19970926b1f8d402692aef09cc","score":"0.48754674","text":"_portalContainsElement(element) {\n // This might break our control when used inside a Layer...\n return false;\n //return element && !!this._root && FluentUIBaseComponent portalContainsElement(element, this._root.current);\n }","title":""},{"docid":"c5fb08854375933314f956354fc305eb","score":"0.4871643","text":"function ae(t) {\n return null !== t.collectionGroup;\n}","title":""},{"docid":"dceb73816ad93a996a4afad28eebde4c","score":"0.4855741","text":"function isGroupGeometry(geometry, state) {\n\t\treturn isGroupComponent(geometry, getGeometryData(state)[/* groupCountMap */8]);\n\t}","title":""},{"docid":"c4a69b22d5a198cd94623dc0a7d3c90e","score":"0.48534796","text":"function hasOverlap(fabric, outputObj) {\n // iterate through all points included in the shape and determine if any have already been visited\n for (let i = outputObj.x; i < outputObj.xMax; i++) {\n for (let j = outputObj.y; j < outputObj.yMax; j++) {\n if (fabric[i][j] > 1){\n return true;\n }\n }\n }\n return false;\n}","title":""},{"docid":"f0a144652b84a7c44f4b6faa7235102b","score":"0.48515216","text":"function checkCrsForLayer(layer, crs) {\n var result = false;\n for (var i = 0; i < layer.crs.length; i++) {\n console.log(\"layer.crs[i]: \" + layer.crs[i]);\n if (layer.crs[i] === crs) {\n result = true;\n break;\n }\n }\n return result;\n}","title":""},{"docid":"cff327f22a663d2ce2588559a841a53b","score":"0.48443058","text":"static hasTrainings(weeks) {\n function blockHasTrainings(block) {\n return Boolean(block.training_module_ids && block.training_module_ids.length);\n }\n function weekHasTrainings(week) {\n if (!week.blocks.length) { return false; }\n return Boolean(find(week.blocks, blockHasTrainings));\n }\n if (!weeks.length) { return false; }\n return Boolean(find(weeks, weekHasTrainings));\n }","title":""},{"docid":"82fe04e621a2500be8aa190abc1f2841","score":"0.48433942","text":"function getTotal() {\n\n return layers.length;\n\n }","title":""},{"docid":"652ac6e098765b48418a93b253ed097c","score":"0.48330906","text":"function isRequiredmentLayerAdded(reqid){\n var f=false;\n for(var i=0;i<$rootScope.capasreq.length;i++){\n var reqId=$rootScope.capasreq[i].nombre;\n if(reqId==reqid){\n f=true;\n break;\n }\n }\n return f;\n\n }","title":""},{"docid":"98586ebb88248f5a14944825858a5215","score":"0.48305976","text":"hasGameParent(){\n\t\tlet parent = this.parent;\n\t\twhile( parent ){\n\t\t\tif( parent instanceof Game )\n\t\t\t\treturn true;\n\t\t\tparent = parent.parent;\n\t\t}\n\t}","title":""},{"docid":"662c4c4e378a342a35a0eef12a584070","score":"0.48297822","text":"computeHasRelatedTabGroupsOrBookmarks_() {\n return this.memory.relatedTabGroups.length > 0 ||\n this.memory.bookmarks.length > 0;\n }","title":""},{"docid":"7a1de65555655773f8f6e9bc29735f28","score":"0.48295438","text":"function switchBaselayer(layerNum){\n // Ask map if chosen layer already on: true / false\n var alreadyOn = map.hasLayer(baselayers[layerNum].layer);\n // If false remove current baselayer by looping thorugh baselayers object and removing all baselayers from map\n // better way to do this? layer ID?\n if(!alreadyOn){\n for(var x in baselayers){\n map.removeLayer(baselayers[x].layer);\n }\n }\n map.addLayer(baselayers[layerNum].layer);\n \n // Add base layer selected to cookie\n document.cookie = \"selectedBaseLayer=\"+layerNum;\n}","title":""},{"docid":"43aec3377e364eab0712809e36569bb8","score":"0.48261786","text":"function calculateBase(groupItem) {\n var extent;\n var baseAxis = groupItem.axis;\n var seriesModels = groupItem.seriesModels;\n var seriesCount = seriesModels.length;\n var boxWidthList = groupItem.boxWidthList = [];\n var boxOffsetList = groupItem.boxOffsetList = [];\n var boundList = [];\n var bandWidth;\n\n if (baseAxis.type === 'category') {\n bandWidth = baseAxis.getBandWidth();\n } else {\n var maxDataCount = 0;\n each(seriesModels, function (seriesModel) {\n maxDataCount = Math.max(maxDataCount, seriesModel.getData().count());\n });\n extent = baseAxis.getExtent(), Math.abs(extent[1] - extent[0]) / maxDataCount;\n }\n\n each(seriesModels, function (seriesModel) {\n var boxWidthBound = seriesModel.get('boxWidth');\n\n if (!zrUtil.isArray(boxWidthBound)) {\n boxWidthBound = [boxWidthBound, boxWidthBound];\n }\n\n boundList.push([parsePercent(boxWidthBound[0], bandWidth) || 0, parsePercent(boxWidthBound[1], bandWidth) || 0]);\n });\n var availableWidth = bandWidth * 0.8 - 2;\n var boxGap = availableWidth / seriesCount * 0.3;\n var boxWidth = (availableWidth - boxGap * (seriesCount - 1)) / seriesCount;\n var base = boxWidth / 2 - availableWidth / 2;\n each(seriesModels, function (seriesModel, idx) {\n boxOffsetList.push(base);\n base += boxGap + boxWidth;\n boxWidthList.push(Math.min(Math.max(boxWidth, boundList[idx][0]), boundList[idx][1]));\n });\n}","title":""},{"docid":"43aec3377e364eab0712809e36569bb8","score":"0.48261786","text":"function calculateBase(groupItem) {\n var extent;\n var baseAxis = groupItem.axis;\n var seriesModels = groupItem.seriesModels;\n var seriesCount = seriesModels.length;\n var boxWidthList = groupItem.boxWidthList = [];\n var boxOffsetList = groupItem.boxOffsetList = [];\n var boundList = [];\n var bandWidth;\n\n if (baseAxis.type === 'category') {\n bandWidth = baseAxis.getBandWidth();\n } else {\n var maxDataCount = 0;\n each(seriesModels, function (seriesModel) {\n maxDataCount = Math.max(maxDataCount, seriesModel.getData().count());\n });\n extent = baseAxis.getExtent(), Math.abs(extent[1] - extent[0]) / maxDataCount;\n }\n\n each(seriesModels, function (seriesModel) {\n var boxWidthBound = seriesModel.get('boxWidth');\n\n if (!zrUtil.isArray(boxWidthBound)) {\n boxWidthBound = [boxWidthBound, boxWidthBound];\n }\n\n boundList.push([parsePercent(boxWidthBound[0], bandWidth) || 0, parsePercent(boxWidthBound[1], bandWidth) || 0]);\n });\n var availableWidth = bandWidth * 0.8 - 2;\n var boxGap = availableWidth / seriesCount * 0.3;\n var boxWidth = (availableWidth - boxGap * (seriesCount - 1)) / seriesCount;\n var base = boxWidth / 2 - availableWidth / 2;\n each(seriesModels, function (seriesModel, idx) {\n boxOffsetList.push(base);\n base += boxGap + boxWidth;\n boxWidthList.push(Math.min(Math.max(boxWidth, boundList[idx][0]), boundList[idx][1]));\n });\n}","title":""},{"docid":"070c1249a87b16da8c03d7fd24676459","score":"0.48242676","text":"function layerType(layerObj){//WIP\r try{\r var curLayer, instanceOfArray, instanceOfArrayLength, result;\r function avLayerType(lObj){\r try{\r var l= lObj;\r var iSource=l.source;\r var lMainSource= lSource.mainSource;\r var lFile= lMainSource.file;\r if(!l.hasVideo){\r return \"AudioLayer\"\r }\r else if(lSource instanceof CompItem){\r return \"PreCompLayer\"\r }\r else if(lSource.frameDuration<1){\r if(lMainSource instanceof PlaceholderSource){\r return \"PlaceholderVideoLayer\"; \r }\r else if(lSource.name.toString().indexOf(\"].\")!=(-1)){ //name [000-0001] CHEAT\r return \"ImageSequenceLayer\"; \r }\r else{\r return \"VideoLayer\"\r }\r }else if(lSource.frameDuration==1){\r \r }\r }catch(err){alert(err.line.toString() +\"\\r\" +err.toString())}\r }\r curLayer=layerObj;\r instanceOfArray= new Array(AVLayer,CameraLayer,LightLayer, ShapeLAyer, TextLayer);\r instanceOfArrayLength= instanceOfArray.length;\r for(var a=0;a<instanceOfArrayLength;a++){\r if(curLayer.guideLayer){\r return \"GuideLayer\";\r }\r else if(curLayer.isTrackMatte){ return \"TrackMatteLayer\";}\r else if(curLayer.adjustmentLayer){return \"AdjustmentLayer\";}\r else if(curLayer instanceof instanceOfArray[a]){\r result=instanceOfArray[a].name;\r break;\r }\r }\r if(result==\"AVLayer\"){\r result= avLayerType(curLayer);\r }\r return result;\r }\r catch(err){alert(err.line.toString() +\"\\r\" +err.toString())}\r }","title":""},{"docid":"8d5ac7c49c37772ea0b63b73eba1d31a","score":"0.4822939","text":"getLayerCount() {\n return this.layers.length;\n }","title":""},{"docid":"280ef5110f510d29adb4441d6d9ad672","score":"0.48185524","text":"function viewLayerGroup(layer, groupLayer) {\n console.log(\"entro al admin de capas!!\");\n if (layer.getVisible()) {\n groupLayer.setVisible(false);\n layer.setVisible(false);\n } else {\n groupLayer.setVisible(true);\n layer.setVisible(true);\n }\n }","title":""},{"docid":"2b898d88e9c3da8e542356ac3d5060e3","score":"0.48140097","text":"function buildLeafBaseLayers() {\n\n\t\t// Create the default layers\n\t\tstreetMapLayer = L.tileLayer('https://api.tiles.mapbox.com/v4/{id}/{z}/{x}/{y}.png?access_token={accessToken}', {\n\t\t\tattribution: 'Imagery from <a href=\"http://mapbox.com/about/maps/\">MapBox</a> — Map data © <a href=\"http://www.openstreetmap.org/copyright\">OpenStreetMap</a>',\n\t\t\tsubdomains: 'abcd',\n\t\t\tid: 'juzzbott.mn25f8nc',\n\t\t\taccessToken: 'pk.eyJ1IjoianV6emJvdHQiLCJhIjoiMDlmN2JlMzMxMWI2YmNmNGY2NjFkZGFiYTFiZWVmNTQifQ.iKlZsVrsih0VuiUCzLZ1Lg'\n\t\t});\n\n\t\ttopoMapLayer = L.tileLayer('https://api.tiles.mapbox.com/v4/{id}/{z}/{x}/{y}.png?access_token={accessToken}', {\n\t\t\tattribution: 'Imagery from <a href=\"http://mapbox.com/about/maps/\">MapBox</a> — Map data © <a href=\"http://www.openstreetmap.org/copyright\">OpenStreetMap</a>',\n\t\t\tsubdomains: 'abcd',\n\t\t\tid: 'juzzbott.mn24imf3',\n\t\t\taccessToken: 'pk.eyJ1IjoianV6emJvdHQiLCJhIjoiMDlmN2JlMzMxMWI2YmNmNGY2NjFkZGFiYTFiZWVmNTQifQ.iKlZsVrsih0VuiUCzLZ1Lg'\n\t\t});\n\n\t\taerialMapLayer = L.tileLayer('https://api.tiles.mapbox.com/v4/{id}/{z}/{x}/{y}.png?access_token={accessToken}', {\n\t\t\tattribution: 'Imagery from <a href=\"http://mapbox.com/about/maps/\">MapBox</a> — Map data © <a href=\"http://www.openstreetmap.org/copyright\">OpenStreetMap</a>',\n\t\t\tsubdomains: 'abcd',\n\t\t\tid: 'juzzbott.mn74md27',\n\t\t\taccessToken: 'pk.eyJ1IjoianV6emJvdHQiLCJhIjoiMDlmN2JlMzMxMWI2YmNmNGY2NjFkZGFiYTFiZWVmNTQifQ.iKlZsVrsih0VuiUCzLZ1Lg',\n\t\t\tmaxZoom: 17\n\t\t});\n\t}","title":""},{"docid":"c9e83b4b1b237765e0e481721d116cbb","score":"0.4811098","text":"get hasGroupableColumns() {\n return this.columnList.some((col) => col.groupable && !col.columnGroup);\n }","title":""},{"docid":"c9e83b4b1b237765e0e481721d116cbb","score":"0.4811098","text":"get hasGroupableColumns() {\n return this.columnList.some((col) => col.groupable && !col.columnGroup);\n }","title":""},{"docid":"6ec6f2110a81053fa3e7950eaf2baca9","score":"0.4810479","text":"function isAncestor(instA, instB) {\n !('_hostNode' in instA) ? \"development\" !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n !('_hostNode' in instB) ? \"development\" !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\n\n while (instB) {\n if (instB === instA) {\n return true;\n }\n instB = instB._hostParent;\n }\n return false;\n}","title":""},{"docid":"9c32897a4ce8ea3b199b1e17cdf7c0dd","score":"0.48101634","text":"canResizeActiveLayer(width, height){\n\t\tconst inBounds = this.isNewPosInBounds(this.activeLayer, this.activeLayer.x, this.activeLayer.y, width, height);\n\t\tif(this.activeLayer.forceBoundary && !inBounds) return false;\n\t\t\n\t\tvar w = this.activeLayer.width;\n\t\tvar h = this.activeLayer.height;\n\t\tthis.activeLayer.width = w;\n\t\tthis.activeLayer.height = h;\n\t\t\n\t\tvar canResize = true;\n\t\tfor(var i=0; i<this.layers.length; i++){\n\t\t\tif(this.layers[i] === this.activeLayer) continue;\n\t\t\tif(this.activeLayer.allowOverlap && this.layers[i].allowOverlap) continue;\n\t\t\tif(this.doLayersOverlap(this.activeLayer, this.layers[i])){\n\t\t\t\tcanResize = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tthis.activeLayer.width = w;\n\t\tthis.activeLayer.height = h;\n\t\t\n\t\treturn canResize;\n\t}","title":""},{"docid":"d434011069ef39ce793a6e4cbb9bd9be","score":"0.48099244","text":"function calculateBase(groupItem) {\n var extent;\n var baseAxis = groupItem.axis;\n var seriesModels = groupItem.seriesModels;\n var seriesCount = seriesModels.length;\n var boxWidthList = groupItem.boxWidthList = [];\n var boxOffsetList = groupItem.boxOffsetList = [];\n var boundList = [];\n var bandWidth;\n\n if (baseAxis.type === 'category') {\n bandWidth = baseAxis.getBandWidth();\n } else {\n var maxDataCount = 0;\n each$18(seriesModels, function (seriesModel) {\n maxDataCount = Math.max(maxDataCount, seriesModel.getData().count());\n });\n extent = baseAxis.getExtent(), Math.abs(extent[1] - extent[0]) / maxDataCount;\n }\n\n each$18(seriesModels, function (seriesModel) {\n var boxWidthBound = seriesModel.get('boxWidth');\n\n if (!util.isArray(boxWidthBound)) {\n boxWidthBound = [boxWidthBound, boxWidthBound];\n }\n\n boundList.push([parsePercent$9(boxWidthBound[0], bandWidth) || 0, parsePercent$9(boxWidthBound[1], bandWidth) || 0]);\n });\n var availableWidth = bandWidth * 0.8 - 2;\n var boxGap = availableWidth / seriesCount * 0.3;\n var boxWidth = (availableWidth - boxGap * (seriesCount - 1)) / seriesCount;\n var base = boxWidth / 2 - availableWidth / 2;\n each$18(seriesModels, function (seriesModel, idx) {\n boxOffsetList.push(base);\n base += boxGap + boxWidth;\n boxWidthList.push(Math.min(Math.max(boxWidth, boundList[idx][0]), boundList[idx][1]));\n });\n}","title":""},{"docid":"27ea22856010b55c3bc1c37f4e58a386","score":"0.4809611","text":"function collectVisibleLayers(theParent, allLayers) {\n if (!allLayers) {\n var allLayers = new Array;\n }\n var len = theParent.layers.length;\n for (var m = len - 1; m >= 0; m--) {\n var theLayer = theParent.layers[m];\n if (theLayer.typename == \"ArtLayer\") {\n if (isNeedExportLayer (theLayer)) {\n allLayers.push(theLayer);\n }\n } else {\n allLayers = (collectVisibleLayers(theLayer, allLayers)); // apply the function to layersets;\n }\n };\n return allLayers\n}","title":""},{"docid":"3b2055bcb26188dc4922125c089fc695","score":"0.48010752","text":"update(instance) {\n\n // Remember visibility state of base layers.\n forEachLayer(instance.map.getLayerGroup(), (layer) => {\n if (layer.get('type') === 'base') {\n this.remember(layer);\n }\n });\n }","title":""},{"docid":"b5afa827674bed2c64431762931eeb9b","score":"0.4788467","text":"check(layer){\n let correctKeys = [];\n let keys = Object.keys(layer);\n let safeLayers ={};\n let pass = 0;\n\n //prevents absurd abounts of layers by remapping layer keys\n var safeKeys = keys.map((item ,index)=>{\n let parsed = parseInt(item)\n if(!parsed){\n this.error('invaild Bubble layer key');\n\n }else if(keys.length > 10){\n this.error('too many layers...shorten to at most 10 layers');\n\n }else{\n safeLayers[index + 1] = layer[keys[index]];\n\n }\n });\n\n let layerNum = 0;\n this.test = [];\n let subsitute = Object.keys(safeLayers).map((Layer ,index)=>{\n layerNum++;\n let composeToReactComponent = safeLayers[Layer].map((items ,_index)=>{\n //this get each element in ech array\n // let createLayerItems = React.createElement(items[0],\n // {ref:'Bubble-layer'+_index,key:UID(),className:`_bubbles-${layerNum}`}\n // ,items.splice(1,items.length));\n let createLayerItems = <BubblesItem key={UID()} elm={'bubble-items-'+_index}>{items.splice(1,items.length)}</BubblesItem>\n\n //console.log(createLayerItems)\n return createLayerItems;\n });\n\n this.test.push(\n <BubblesLayer elm={'Bubble-layer-'+Layer} key={UID()}>\n {composeToReactComponent}\n </BubblesLayer>\n );\n\n\n //this.safe[Layer] = composeToReactComponent;\n });\n //console.log(test)\n pass = 1;\n //console.warn(keys , safeLayers)\n return pass;\n }","title":""},{"docid":"a45634835b921986515a7006d5fb431d","score":"0.4783255","text":"function collectLayersBelow( __index, __parent )\n{\n\tfor ( var i = __index; i < __parent.layers.length; i++ ) {\n\n\t\tvar currentLayer = __parent.layers[ i ];\n\t\tvar isvalid = validateLayer( currentLayer );\n\n\t\tif ( currentLayer.typename == \"LayerSet\" ) {\n\t\t\tcollectLayersBelow( 0, currentLayer );\n\t\t} else if ( isvalid == true ) {\n\t\t\tcollectedLayers.push( currentLayer );\n\t\t\tcurrentLayer.allLocked = false;\n\t\t}\n\t}\n}","title":""}],"string":"[\n {\n \"docid\": \"a668d1a3a92a83b0bc4c3051dc769456\",\n \"score\": \"0.6448219\",\n \"text\": \"static ensureTopVisibleBaseLayerShown(map, groupSelectStyle) {\\n let lastVisibleBaseLyr;\\n LayerSwitcher.forEachRecursive(map, function (lyr, _idx, _arr) {\\n if (lyr.get('type') === 'base' && lyr.getVisible()) {\\n lastVisibleBaseLyr = lyr;\\n }\\n });\\n if (lastVisibleBaseLyr)\\n LayerSwitcher.setVisible_(map, lastVisibleBaseLyr, true, groupSelectStyle);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35bcb885644ed6b154582ab38c8e3cf3\",\n \"score\": \"0.6379424\",\n \"text\": \"wantsLayer(layer) {\\n return (this.getOptimizedStyleSet(this.m_tmpOptimizedSubSetKey.set(layer, undefined)).length > 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73c8125aa05df7e3cf983df7264cba35\",\n \"score\": \"0.61369467\",\n \"text\": \"_hasLayer(name) {\\r\\n return !!this._piximData.layers[name];\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"688d42351e23616635e1143e7f984bc9\",\n \"score\": \"0.6126718\",\n \"text\": \"function checkLayer(name, context) {\\n var checkOut;\\n for (var i = 0; i < context.length; i++) {\\n if (layer[i].name === name) {\\n checkOut = true;\\n break;\\n }\\n else {\\n checkOut = false;\\n };\\n };\\n return checkOut;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0488891325279a52041040844037141c\",\n \"score\": \"0.597779\",\n \"text\": \"function hasLayer(name) {\\n\\tvar result = false;\\n\\tif (isNav4) {\\n\\t\\tif (document.layers[name]!=null) result=true;\\n\\t} else if (isIE) {\\n\\t\\tif (eval('document.all.' + name)!=null) result=true;\\n\\t} else if (isNav) {\\n\\t\\tvar theElements = document.getElementsByTagName(\\\"DIV\\\");\\n\\t\\tvar theObj;\\n\\t\\tvar j = -1;\\n\\t\\tfor (i=0;i<theElements.length;i++) {\\n\\t\\t\\tif (theElements[i].id==name) result=true;\\n\\t\\t}\\n }\\n\\treturn result;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7318c74f29e3c0d3ad7f62eefb6fa2c9\",\n \"score\": \"0.59645474\",\n \"text\": \"hasLayers(json_maps) {\\n let has_layers = true\\n\\n if(this.json_map) {\\n if(json_maps.length && json_maps.length > 1) {\\n json_maps.forEach(jm => {\\n if(!this.map.hasLayer(jm)) {\\n has_layers = false\\n }\\n })\\n } else {\\n if(!this.map.hasLayer(json_maps)) {\\n has_layers = false\\n } \\n }\\n } else {\\n has_layers = false\\n }\\n\\n return has_layers\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41406a2b3f8cfc140ee84bb123dff979\",\n \"score\": \"0.5905909\",\n \"text\": \"function map_layer_check(map, layer)\\n{\\n\\t\\tif(!_.isUndefined(_.find(map.getLayers().getArray(), function(d){return d == layer;})))\\n\\t\\t{return true;}\\n\\t\\telse{return false;}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc713d5bed369d3ccb7a074c1b22a539\",\n \"score\": \"0.58716214\",\n \"text\": \"function isLayerSpec(spec) {\\n return spec['layer'] !== undefined;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1decb2664a1521db73ea16f463b5fdb\",\n \"score\": \"0.58487064\",\n \"text\": \"function hasLayers() {\\r\\n var doc = activeDocument;\\r\\n if (doc.layers.length == 1 && doc.activeLayer.isBackgroundLayer) {\\r\\n alert('The active document has no layers.', 'No Layers', false);\\r\\n return false;\\r\\n }\\r\\n else {\\r\\n return true;\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14da9b57dcb57c3beab977832a605bec\",\n \"score\": \"0.58110213\",\n \"text\": \"function checkIfActiveLayerAvailable() {\\n\\treturn true;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"917e157cef78a47fdc3e39ab2273bd07\",\n \"score\": \"0.5764354\",\n \"text\": \"async function checkLayer() {\\n await layerCenterGroup.clearLayers();\\n await layerBuildingGroup.clearLayers();\\n await layerStoreGroup.clearLayers();\\n //if (map.hasLayer(layerStoreGroup)) {\\n // await map.removeLayer(layerCenterGroup);\\n // await map.removeLayer(layerStoreGroup);\\n // await map.removeLayer(layerBuildingGroup);\\n // layerCenterGroup = await new L.LayerGroup();\\n // layerStoreGroup = await new L.LayerGroup();\\n // layerBuildingGroup = await new L.LayerGroup();\\n //}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4953e12f059616712a4058504f226229\",\n \"score\": \"0.57239014\",\n \"text\": \"function addBaseMapLayers(layerObj) {\\n var baseMapLayer;\\n\\n switch (layerObj.layerType.toLowerCase()) {\\n case \\\"imagewms\\\":\\n baseMapLayer = new ol.layer.Image({\\n title: layerObj.title,\\n type: \\\"base\\\",\\n visible: layerObj.options.visible,\\n source: new ol.source.ImageWMS({\\n url: layerObj.url,\\n params: {\\n VERSION: \\\"1.1.1\\\",\\n LAYERS: layerObj.params.layers,\\n FORMAT: layerObj.params.format\\n },\\n wrapX: false\\n }),\\n name: layerObj.title\\n });\\n break;\\n case \\\"tilewms\\\":\\n baseMapLayer = new ol.layer.Tile({\\n title: layerObj.title,\\n type: \\\"base\\\",\\n visible: layerObj.options.visible,\\n source: new ol.source.TileWMS({\\n url: layerObj.url,\\n params: {\\n VERSION: \\\"1.1.1\\\",\\n LAYERS: layerObj.params.layers,\\n FORMAT: layerObj.params.format\\n },\\n wrapX: false\\n }),\\n name: layerObj.title\\n });\\n break;\\n case \\\"xyz\\\":\\n baseMapLayer = new ol.layer.Tile({\\n title: layerObj.title,\\n type: \\\"base\\\",\\n visible: layerObj.options.visible,\\n source: new ol.source.XYZ({\\n url: layerObj.url,\\n wrapX: false\\n }),\\n name: layerObj.title\\n });\\n break;\\n }\\n\\n if (baseMapLayer != null) {\\n // Add layer(s) to the layerSwitcher control\\n baseMapGroup.getLayers().push(baseMapLayer);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1f0128fbd8deb80ae4a31d7ca516296\",\n \"score\": \"0.5687244\",\n \"text\": \"function floorHasThisLayer(floorPins, layer) {\\n for (var i = 0; i < floorPins.length; i++) {\\n var pin = floorPins[i];\\n if (pin.LayerId === layer.Id) { // Case: the current floor has a pin corresponding to the given amenity/layer , return true\\n return true;\\n }\\n }\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9957a9a3c6ccea12a5530294e841d71c\",\n \"score\": \"0.5679239\",\n \"text\": \"function validateLayer( __layer )\\n{\\n\\tif ( __layer.kind == LayerKind.NORMAL ) {\\n\\t\\tif ( __layer.typename == \\\"ArtLayer\\\" ) {\\n\\t\\t\\tif ( __layer.visible == true) {\\n\\t\\t\\t\\t// if ( __layer.blendMode == BlendMode.NORMAL ) {\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t// }\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f707a27bbe0b9dddd6f3d3a10761b87\",\n \"score\": \"0.5572033\",\n \"text\": \"function isConnectedToBase( stackElem, without, dbg_count )\\n\\t{\\n\\t\\tif (typeof(dbg_count) == \\\"undefined\\\")\\n\\t\\t\\tdbg_count = 0;\\n\\t\\t\\t\\n\\t\\tif (typeof(without) == \\\"undefined\\\")\\n\\t\\t\\twithout = null;\\n\\t\\t\\t\\n\\t\\t$.bp( dbg_count > 150 );\\t// oops, got stuck in a loop...\\n\\n\\t\\tif (stackElem == null)\\n\\t\\t\\treturn false;\\n\\t\\t\\t\\n\\t\\tif (stackElem == without)\\n\\t\\t\\treturn false;\\n\\t\\t\\t\\n\\t\\tif (stackElem.fConnectedTo == stackElem)\\n\\t\\t\\treturn true;\\t\\t// Already at base\\n\\t\\treturn isConnectedToBase( stackElem.fConnectedTo, without, dbg_count + 1 );\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e44e72ede576687d34c9de98bd8bd837\",\n \"score\": \"0.55500525\",\n \"text\": \"function ArtLayerNameCheck(name)\\n{\\n \\n //check if layer name matches Rule Tile naming\\n return Contains(name, \\n [ \\n \\\"Top\\\",\\\"Bottom\\\",\\n \\\"Right\\\", \\\"Left\\\",\\n \\\"Outer\\\", \\\"Inner\\\",\\n \\\"Single\\\",\\\"Double\\\",\\n \\\"Triple\\\", \\\"Quad\\\",\\n ]);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6729c646f779bf244ce6eb77837bb8eb\",\n \"score\": \"0.5548346\",\n \"text\": \"drawGroupLayer(ctx, layer) {\\n const { game } = this.props;\\n\\n const layerPosition = {\\n x: (layer.x + layer.startx) * game.map.tilewidth + (layer.offsetx || 0),\\n y: (layer.y + layer.starty) * game.map.tileheight + (layer.offsety || 0)\\n };\\n\\n ctx.save();\\n ctx.translate(layerPosition.x, layerPosition.x);\\n\\n layer.layers.forEach(layer => {\\n this.drawLayer(ctx, layer);\\n });\\n\\n ctx.restore();\\n\\n // Not cacheable as a whole, but all sublayers will be cached if possible.\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af1a49184064c00a37985bb4c879c5c3\",\n \"score\": \"0.553538\",\n \"text\": \"function layerIdsExist(occurence, network) {\\n for (var i in occurence) {\\n // Check all items in the occurence\\n if (!layerIdExists(occurence[i].matchID, network)) {\\n // Layer does not exist\\n return false;\\n }\\n }\\n return true; // All layers exist\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abe99a46aa87c29090f0e40783d0d4c9\",\n \"score\": \"0.5527155\",\n \"text\": \"function removeAllEmptyLayerSets(obj) {\\n var foundEmpty = true;\\n for( var i = obj.layerSets.length-1; 0 <= i; i--) {\\n if( removeAllEmptyLayerSets(obj.layerSets[i])) {\\n obj.layerSets[i].remove();\\n } else {\\n foundEmpty = false;\\n }\\n }\\n if (obj.artLayers.length > 0) {\\n\\t\\tfoundEmpty = false;\\n\\t}\\n return foundEmpty;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"854fcb799628e1b64576cc58d3f2a1c4\",\n \"score\": \"0.54907084\",\n \"text\": \"function checkWin(){\\n\\t\\tif(layerAmount == layerInD.length){\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff7d6245d9e5ef73955ccb9214c204d2\",\n \"score\": \"0.5413825\",\n \"text\": \"isNewPosInBounds(layer, x, y, width, height){\\n\\t\\tvar _x = layer.x;\\n\\t\\tvar _y = layer.y;\\n\\t\\tvar _width = layer.width;\\n\\t\\tvar _height = layer.height;\\n\\t\\t\\n\\t\\tlayer.x = x;\\n\\t\\tlayer.y = y;\\n\\t\\tlayer.width = width;\\n\\t\\tlayer.height = height;\\n\\t\\t\\n\\t\\tvar inbounds = true;\\n\\t\\tlayer.getCorners().forEach(corner => {\\n\\t\\t\\tvar pos = Canvas.absolutePoint(corner.x, corner.y, layer.x, layer.y, layer.rotation);\\n\\t\\t\\tif (pos.x < 0 || pos.x > this.width || pos.y < 0 || pos.y > this.width) {\\n\\t\\t\\t\\tinbounds = false;\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tlayer.x = _x;\\n\\t\\tlayer.y = _y;\\n\\t\\tlayer.width = _width;\\n\\t\\tlayer.height = _height;\\n\\t\\treturn inbounds;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d54898cc112548a20a93eac7f60ef65\",\n \"score\": \"0.5383998\",\n \"text\": \"hasBalancedGrouping(tokens) {\\n const openStack = [];\\n _.each(tokens, (token) => {\\n if (token.type !== 'grouping') return;\\n\\n if (this.isOpenGroupToken(token)) {\\n openStack.push(token);\\n return;\\n }\\n\\n if (this.openTokenMatchesCloser(_.last(openStack), token)) {\\n openStack.pop();\\n }\\n });\\n\\n return _.isEmpty(openStack);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63f9d5f48dde0e30b57fcc888536c872\",\n \"score\": \"0.5375178\",\n \"text\": \"function isNeedExportLayer(layer) {\\n\\tif(layer.kind == LayerKind.TEXT || layer.visible == false) return false;\\n\\tvar type = getCtrlType(layer);\\n\\tfor each(var val in ArrNoNeedExport) {\\n\\t\\tif(val == type) return false;\\n\\t}\\n var arrParam = layer.name.split(\\\"_\\\");\\n if(arrParam.length > 1) {\\n return false;//公共资源不导出\\n }\\n\\treturn true;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e10aef4851a07c504845b2d411157ea\",\n \"score\": \"0.5373188\",\n \"text\": \"createLayer() {\\n assert('BaseLayer\\\\'s \\\\'createLayer\\\\' should be overridden.');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8554046f868fa499de22e5c6d2184eee\",\n \"score\": \"0.53403306\",\n \"text\": \"function layerIdExists(id, network) {\\n for (var i in network.layers) {\\n // Iterate over all layers in the Network\\n if (network.layers[i].id === id) {\\n // Check if it has the searched ID\\n return true;\\n }\\n }\\n return false; // No layer with the searched ID\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3bf60a606e258341d8b34570770bad1\",\n \"score\": \"0.53284216\",\n \"text\": \"onlyDisplayValidLayers() {\\n const validSource = 'regional';\\n\\n // get the layer list from the config file\\n const { TMSLayers } = mapConfig;\\n const layers = store.getStateItem('mapLayerDisplayStatus');\\n\\n // filter the layers based on current source\\n Object.keys(layers).forEach((layer) => {\\n const asource = TMSLayers.filter(TMSlayer => (\\n TMSlayer.id === layer && TMSlayer.source === validSource\\n ));\\n\\n // layer is on and not part of the tabs data so it needs to be off\\n if (layers[layer] && asource.length === 0) {\\n this.mapComponent.toggleVisLayerOff(layer);\\n }\\n\\n // layer is on IS part of the tabs data os it needs to be on\\n if (layers[layer] && asource.length > 0) {\\n this.mapComponent.toggleVisLayerOn(layer);\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9cc998aa1b3267c97f212a2b6307045f\",\n \"score\": \"0.5327151\",\n \"text\": \"getLayers(layerTypes) {\\n //get the map layers\\n var allLayers = this.map.getStyle().layers;\\n //iterate through the layers to get the matching ones\\n return allLayers.filter((layer) => {\\n if (\\n layer.hasOwnProperty(\\\"metadata\\\") &&\\n layer.metadata.hasOwnProperty(\\\"type\\\")\\n ) {\\n return layerTypes.includes(layer.metadata.type);\\n } else {\\n return false;\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21928ec3553e3d38980664aa03ebcf05\",\n \"score\": \"0.5323436\",\n \"text\": \"function CheckLayers(docLayers)\\r{\\r var list = STYLE_FABRIC_LAYERS.split(',');\\r var listCount = list.length;\\r var ontbreekt = \\\"\\\";\\r var errorMsg = \\\"\\\";\\r var meerDanEen = false;\\r\\r for ( i = 0; i < listCount; i++ )\\r {\\r\\r var bestaat = false;\\r var layerName = new String(list[i]);\\r bestaat = IsElementOf(layerName, docLayers);\\r\\r if ( ! bestaat )\\r {\\r if ( ontbreekt != \\\"\\\" )\\r {\\r ontbreekt = ontbreekt + ', ';\\r meerDanEen = true;\\r }\\r ontbreekt = ontbreekt + layerName\\r }\\r }\\r if ( ontbreekt != \\\"\\\" ) {\\r if ( meerDanEen )\\r errorMsg = \\\"De volgende lagen ontbreken: \\\" + ontbreekt\\r else\\r errorMsg = \\\"De volgend laag ontbreekt: \\\" + ontbreekt;\\r throw(errorMsg);\\r }\\r}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6d98a695e218f50f5d1e2949b619216\",\n \"score\": \"0.5304599\",\n \"text\": \"if (layer.name().startsWith('__') || layer.name().startsWith(SCType.SCBackground)) {\\n continue;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ceb088b8bf8b7a2840df3cbaaf085ef0\",\n \"score\": \"0.5286423\",\n \"text\": \"function is_group_valid(group)\\n{\\n\\tif (group.length <= 2)\\n\\t\\treturn false;\\n\\t\\n\\tvar follow_num = true;\\n\\tvar same_colour = true;\\n\\tvar same_number = true;\\n\\tvar diffrent_colours = true;\\n\\t\\n\\tvar counter = null;\\n\\tvar colour = null;\\n\\tvar number = null;\\n\\tvar colours = [];\\n\\tfor (var i = 0; i < group.length; i++)\\n\\t{\\n\\t\\tvar tile = group[i];\\n\\t\\tif (counter == null)\\n\\t\\t\\tcounter = tile.number;\\n\\t\\telse\\n\\t\\t\\tif (tile.number != ++counter)\\n\\t\\t\\t\\tfollow_num = false;\\n\\t\\t\\n\\t\\tif (colour == null)\\n\\t\\t\\tcolour = tile.colour;\\n\\t\\telse\\n\\t\\t\\tif (tile.colour != colour)\\n\\t\\t\\t\\tsame_colour = false;\\n\\t\\t\\n\\t\\tif (number == null)\\n\\t\\t\\tnumber = tile.number;\\n\\t\\telse\\n\\t\\t\\tif (tile.number != number)\\n\\t\\t\\t\\tsame_number = false;\\n\\t\\t\\n\\t\\tif (colours.indexOf(tile.colour) != -1)\\n\\t\\t\\tdiffrent_colours = false;\\n\\t\\tcolours.push(tile.colour);\\n\\t}\\n\\t\\n\\treturn (follow_num && same_colour) || (same_number && diffrent_colours);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09bba25c85050ce4c586ce3a784ae7b1\",\n \"score\": \"0.5275984\",\n \"text\": \"function isRoutingLayer(layer) {\\n markers = placesLayer.eachLayer(function(marker) {return marker});\\n numMarkers = markers.length;\\n\\n totalCount = 0\\n latLonCount = 0\\n layer.eachLayer(function(layer) {\\n count += 1;\\n if (layer.hasOwnProperty('_latlng')) {\\n latLonCount += 1\\n }\\n });\\n if (totalCount == numMarkers + 1 && latLonCount == totalCount - 1) {\\n return true\\n } else {\\n return false\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"237127f526c3c950bad7e97f84c7e157\",\n \"score\": \"0.5243351\",\n \"text\": \"_getBoundingBox() {\\n assert('BaseLayer\\\\'s \\\\'_getBoundingBox\\\\' should be overridden.');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2381a1f6c828bb3ff5c72fb4bc31a639\",\n \"score\": \"0.5239474\",\n \"text\": \"function checkLayers(cat) {\\n\\t\\t\\t\\tvar obj = this;\\n\\t\\t\\t\\tentityIdx=pinLayers[cat];\\n\\t\\t\\t\\tl=layers[cat];\\n\\t\\t\\t\\tif((l!=undefined)&&(l.length!=0)) {\\n\\t\\t\\t\\t\\tif ( l[0].getVisible() ) {\\n\\t\\t\\t\\t\\t\\t$('div#'+cat).removeClass('on');\\n\\t\\t\\t\\t\\t\\t$('div#'+cat).children('ul.point-list').slideUp(); // to keep only one open - make option??\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tif ( (cat != 'property') && (cat != 'featurepoint')) {\\n\\t\\t\\t\\t\\t\\t\\t$('.feature-list').each(function() {\\n\\t\\t\\t\\t\\t\\t\\t\\tif ($(this).hasClass('on')) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tvar featureid = $(this).attr('id').toString().substr(13);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tvar pinidx = getPinIndex(featureid);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tl2=layers[featureid];\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t$('div#feature-list-'+featureid).removeClass('on');\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t$('div#feature-list-'+featureid).addClass('off');\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t$(this).removeClass('on');\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\t\\tvar cats = cat===null?categories:[cat];\\n\\t\\t\\t\\t\\t\\t\\t$.each(cats, function(i, val) {\\n\\t\\t\\t\\t\\t\\t\\t\\tvar shapes = [];\\n\\t\\t\\t\\t\\t\\t\\t\\t$.each(items, function(j) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tvar catSelectedArray = new Array( );\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tvar currarray = String(items[j].category);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcatSelectedArray = currarray.split(\\\",\\\");\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (x in catSelectedArray){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(catSelectedArray[x]==val) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tvar loc = getCenterPoint(j);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcenterArray.push(loc);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\t\\tcenterArray = $.uniqueArray(centerArray);\\n\\t\\t\\t\\t\\t\\t\\tsetBestView();\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t\\t\\t$('div#'+cat).removeClass('off');\\n\\t\\t\\t\\t\\t\\t$('div#'+cat).addClass('on');\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tfor (i = 0; i < l.length; i++) {\\n\\t\\t\\t\\t\\t\\tif(l[i]!=undefined) {\\n\\t\\t\\t\\t\\t\\t\\tif(l[i].getVisible() == true) {\\n\\t\\t\\t\\t\\t\\t\\t\\tl[i].setVisible(false);\\n\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\tl[i].setVisible(true);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1d242ad78a323d300b350d194e49e09\",\n \"score\": \"0.52298504\",\n \"text\": \"function checkWFSLayers() {\\n\\t var layer = map.layers;\\n\\t var layerCounter = 0;\\n\\t for(var a = 0; a < layer.length; a++ ) {\\n\\t\\tif(layer[a].CLASS_NAME == 'OpenLayers.Layer.Vector') {\\n\\t\\t if(layer[a].getVisibility() == true) {\\n\\t\\t\\tlayerCounter = layerCounter + 1;\\n\\t\\t }\\n\\t\\t}\\n\\t };\\n\\t return layerCounter;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34d4d935ad1e09c08b34615895e8b1f8\",\n \"score\": \"0.5203372\",\n \"text\": \"function le(t) {\\n return null !== t.collectionGroup;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2cc1da5603e1bdaaadeda9ccf5d24db\",\n \"score\": \"0.519801\",\n \"text\": \"_hasAncestorOfType(type){return!1}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"daa7d220bcc918a7b9e91eb8a46ecf41\",\n \"score\": \"0.51847816\",\n \"text\": \"static isGroupLoaded(groupId) {\\n return this._loadedGroups.indexOf(groupId) !== -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a706f2344f2219734127039dc63755\",\n \"score\": \"0.516996\",\n \"text\": \"function getLayerVisibility() {\\n var layers = {},\\n hex = document.getElementById('hex'),\\n points = document.getElementById('points');\\n if (hex && points) {\\n // If we have the controls, use their state as the config\\n layers.hex = hex.checked;\\n layers.points = points.checked;\\n }\\n return layers;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d26d926eadaa56c83812f8752d289c28\",\n \"score\": \"0.51573086\",\n \"text\": \"static getGroupsAndLayers(grp, filterFn) {\\n const layers = [];\\n filterFn =\\n filterFn ||\\n function (_lyr, _idx, _arr) {\\n return true;\\n };\\n LayerSwitcher.forEachRecursive(grp, function (lyr, idx, arr) {\\n if (lyr.get('title')) {\\n if (filterFn(lyr, idx, arr)) {\\n layers.push(lyr);\\n }\\n }\\n });\\n return layers;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a9107c2f6635f91f102c5634a8b20a4\",\n \"score\": \"0.51570123\",\n \"text\": \"isValidGroup() {\\n // To ensure we can find the keyboard root node to appropriately respond to\\n // visibility changes, never mark it as invalid.\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2711b7a6ac010d04fab534b2ee60280c\",\n \"score\": \"0.5141496\",\n \"text\": \"function fn(t) {\\n return null !== t.collectionGroup;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc4a7cf104c3769355c16a0b64089ea5\",\n \"score\": \"0.5136749\",\n \"text\": \"wantsFeature(layer, geometryType) {\\n return (this.getOptimizedStyleSet(this.m_tmpOptimizedSubSetKey.set(layer, geometryType))\\n .length > 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ee1aa9936796cedd707f906ce9804e6\",\n \"score\": \"0.5131374\",\n \"text\": \"function Zt(t) {\\n return null !== t.collectionGroup;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91285eec97e78f0a8d88318090aea2dc\",\n \"score\": \"0.5129392\",\n \"text\": \"function ge(t) {\\n return null !== t.collectionGroup;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72be0dc6ceb1741bc3006bdfd1a891ba\",\n \"score\": \"0.5121702\",\n \"text\": \"function shouldFetchGroup(state)\\n{\\n const group = state.group;\\n\\n if (!group.group) {\\n return true;\\n } else if (group.isFetching) {\\n return false;\\n } else {\\n return group.didInvalidate;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4466839ec01b64202caf6c48e0dc9272\",\n \"score\": \"0.5116094\",\n \"text\": \"function getSublayers(d) {\\r\\n //If object d has a sublayers property, return it\\r\\n if (d.hasOwnProperty('sublayers')) {\\r\\n return d.sublayers\\r\\n }\\r\\n //Otherwise return 0\\r\\n return 0\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af74911eae8d75669825b833a3decaac\",\n \"score\": \"0.50863\",\n \"text\": \"isComposite() {\\n return this.regions.length > 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfb3e948e8cacd63571dc93bed31e55d\",\n \"score\": \"0.5078097\",\n \"text\": \"static isBitmapFontsLoaded(groupId) {\\n if (!this._lazyBitmapFontsToLoad.find((elem) => {\\n return elem.group.indexOf(groupId) !== -1;\\n })) {\\n return true;\\n }\\n return this._bitmapFontsLoadedGroups.indexOf(groupId) !== -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d45507be926dda29267316d8f29fcb9\",\n \"score\": \"0.5058799\",\n \"text\": \"static isAssetsLoaded(groupId) {\\n if (!this._lazyAssetToLoad.find((elem) => {\\n return elem.group.indexOf(groupId) !== -1;\\n })) {\\n return true;\\n }\\n return this._assetsLoadedGroups.indexOf(groupId) !== -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50e6e108716f2777a028d75a1b38802b\",\n \"score\": \"0.50476176\",\n \"text\": \"function groupLayers(myComp,startIndex){\\r \\r var layers = myComp.layers;\\r var refLayer = myComp.layer(startIndex);\\r var refInPoint = refLayer.inPoint;\\r var refOutPoint = refLayer.outPoint;\\r var groupArray = new Array;\\r groupArray.push(refLayer.index);\\r alert(refInPoint);\\r for (l=refLayer.index-1; l>=1; l--){\\r var curLayerInPoint = layers[l].inPoint; \\r var curLayerOutPoint = layers[l].outPoint; \\r if((curLayerInPoint >= refInPoint)&&(curLayerOutPoint <= refOutPoint)){\\r groupArray.push(layers[l].index);\\r if(l==1){\\r shotsArray.push(groupArray);\\r }\\r }else {\\r shotsArray.push(groupArray);\\r groupLayers(myComp,l);\\r }\\r \\r }\\r}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96a7a6398b4baab89d4aa97d1b36c314\",\n \"score\": \"0.5033604\",\n \"text\": \"function hasCustomParameters (layerName) {\\r\\tvar result = false;\\r\\tif (layerName.search(patternRotate) != -1 || layerName.search(patternScale) != -1) {\\r\\t\\tresult = true;\\r\\t}\\r\\r\\treturn result;\\r}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e36de5d42f6a5b65b3c65fa3974f8312\",\n \"score\": \"0.5026706\",\n \"text\": \"function enableBaselayers(){\\n\\n // Store baselayer tiles\\n var OpenStreetMap_HOT = L.tileLayer('http://{s}.tile.openstreetmap.fr/hot/{z}/{x}/{y}.png', {\\n maxZoom: 19,\\n attribution: '© <a href=\\\"http://www.openstreetmap.org/copyright\\\">OpenStreetMap</a>, Tiles courtesy of <a href=\\\"http://hot.openstreetmap.org/\\\" target=\\\"_blank\\\">Humanitarian OpenStreetMap Team</a>'\\n });\\n\\n var Stamen_Watercolor = L.tileLayer('http://stamen-tiles-{s}.a.ssl.fastly.net/watercolor/{z}/{x}/{y}.png', {\\n attribution: 'Map tiles by <a href=\\\"http://stamen.com\\\">Stamen Design</a>, <a href=\\\"http://creativecommons.org/licenses/by/3.0\\\">CC BY 3.0</a> — Map data © <a href=\\\"http://www.openstreetmap.org/copyright\\\">OpenStreetMap</a>',\\n subdomains: 'abcd',\\n minZoom: 1,\\n maxZoom: 16,\\n ext: 'png'\\n });\\n\\n var Stamen_Toner = L.tileLayer('http://stamen-tiles-{s}.a.ssl.fastly.net/toner/{z}/{x}/{y}.png', {\\n attribution: 'Map tiles by <a href=\\\"http://stamen.com\\\">Stamen Design</a>, <a href=\\\"http://creativecommons.org/licenses/by/3.0\\\">CC BY 3.0</a> — Map data © <a href=\\\"http://www.openstreetmap.org/copyright\\\">OpenStreetMap</a>',\\n subdomains: 'abcd',\\n minZoom: 0,\\n maxZoom: 20,\\n ext: 'png'\\n });\\n\\n // Store above tiles in baselayers object - will iterate through object and add to DOM\\n window.baselayers = {\\n 0: {name: \\\"OSM HOT\\\", layer: OpenStreetMap_HOT},\\n 1: {name: \\\"Stamen Watercolor\\\", layer: Stamen_Watercolor},\\n 2: {name: \\\"Stamen Toner\\\", layer: Stamen_Toner}\\n }\\n\\n // Turn on default baselayer or chosen layer from last session\\n var selectedBaseLayer = document.cookie.replace(/(?:(?:^|.*;\\\\s*)selectedBaseLayer\\\\s*\\\\=\\\\s*([^;]*).*$)|^.*$/, \\\"$1\\\");\\n if(selectedBaseLayer){\\n map.addLayer(baselayers[selectedBaseLayer].layer); \\n } else {\\n map.addLayer(baselayers[0].layer);\\n }\\n\\n // Populate basemap switcher dropdown menu\\n for(x in baselayers){\\n console.log(baselayers[x].name);\\n $('#baselayersMenu').append('<li><a href=\\\"#\\\" onclick=\\\"switchBaselayer('+x+')\\\">'+baselayers[x].name+'</a></li>');\\n \\n // Show a loading css div when basemap tiles are loading\\n $(baselayers[x].layer).on('loading', function(){\\n $('#loaders').fadeIn();\\n }); \\n // Hide loading css when baselayer has finished loading\\n $(baselayers[x].layer).on('load', function(){\\n $('#loaders').fadeOut();\\n });\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb58395069ea9f569749b9f3e787985f\",\n \"score\": \"0.49983126\",\n \"text\": \"function initLayers() {\\n\\n var mapBaseTile = null;\\n var mapGroundTile = null;\\n\\n for (var key in tilesets) {\\n var tileset = tilesets[key];\\n\\n if (tileset.did === 0) {\\n mapBaseTile = tileset;\\n } else if (tileset.did === 1) {\\n mapGroundTile = tileset;\\n }\\n if (isDefined(mapBaseTile) && isDefined(mapGroundTile)) {\\n break;\\n }\\n }\\n\\n if (isDefined(mapBaseTile) && isDefined(mapBaseTile.image)) {\\n tileMap.initBaseLayer({\\n path: assetdir + mapBaseTile.image\\n });\\n }\\n\\n if (isDefined(mapGroundTile) && isDefined(mapGroundTile.image)) {\\n tileMap.initGroundLayer({\\n path: assetdir + mapGroundTile.image\\n });\\n }\\n\\n tileMap.setupGroundLayers();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd55b23080305bf97668532c6a25063a\",\n \"score\": \"0.49925822\",\n \"text\": \"function isBaseClassOf(apiItem) {\\n return apiItem.hasOwnProperty(_isOptional);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5df15c4ed2437867f45af9dfa82a60e2\",\n \"score\": \"0.49903056\",\n \"text\": \"checkIfDefault(group) {\\n if(group.properties.default === null) { \\n return true;\\n \\n } else { \\n return false;\\n }\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e3e4b84b01d531906ab346296b79867\",\n \"score\": \"0.4983518\",\n \"text\": \"function featureGroupOverRadiusCircle() {\\n // Make sure groups are on map before bringing to front\\n // if (json_group_four._map !== null) {\\n // json_group_four.bringToFront();\\n // }\\n if (json_group_two._map !== null) {\\n json_group_two.bringToFront();\\n }\\n if (json_group._map !== null) {\\n json_group.bringToFront();\\n }\\n // if (json_group_three._map !== null) {\\n // json_group_three.bringToFront();\\n // }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e477837d4d36cf57b4c9936fb5f1727\",\n \"score\": \"0.49817175\",\n \"text\": \"function toggleLayer(group, layer, toggle){\\r\\n\\t \\tif(group == 'null' || layer == 'null')\\r\\n\\t\\t\\treturn;\\r\\n\\r\\n\\t\\t//toggle selection\\r\\n\\t\\tif(!toggle) {\\r\\n\\t\\t\\t$('li[layer=\\\"' + layer +'\\\"][group=\\\"' + group +'\\\"]').toggleClass(\\\"active\\\");\\r\\n\\t\\t}\\r\\n\\t\\tfor (var i in layers[group][layer]) {\\r\\n//set search url\\r\\n\\t\\t\\t$( \\\"#search\\\" ).combogrid( \\\"option\\\", \\\"url\\\", layers[group][layer][i][\\\"search_url\\\"]);\\r\\n\\t\\t\\t//set grid url\\r\\n\\t\\t\\tgrid_base_url = layers[group][layer][i][\\\"grid_url\\\"];\\r\\n\\t\\t\\tupdateSiteGrid();\\t\\r\\n\\t\\t\\tswitch(layers[group][layer][i][\\\"type\\\"]){\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\tcase \\\"WMS\\\":\\r\\n\\t\\t\\t\\t\\tif(layers[group][layer][i][\\\"layer\\\"] == undefined){\\r\\n\\t\\t\\t\\t\\t\\tlayers[group][layer][i][\\\"layer\\\"] = buildWMS(layer, layers[group][layer][i][\\\"url\\\"], layers[group][layer][i][\\\"options\\\"]);\\r\\n\\t\\t\\t\\t\\t\\tmap.addLayer(layers[group][layer][i][\\\"layer\\\"]);\\r\\n\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\tmap.removeLayer(layers[group][layer][i][\\\"layer\\\"]);\\r\\n\\t\\t\\t\\t\\t\\tdelete layers[group][layer][i][\\\"layer\\\"];\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase \\\"KML\\\":\\r\\n\\t\\t\\t\\t\\tif(layers[group][layer][i][\\\"layer\\\"] == undefined){\\r\\n\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\tlayers[group][layer][i][\\\"layer\\\"] = buildKML(layer, layers[group][layer][i][\\\"url\\\"]);\\r\\n\\t\\t\\t\\t\\t\\tmap.addLayer(layers[group][layer][i][\\\"layer\\\"]);\\r\\n\\t\\t\\t\\t\\t\\t//add cell tech legend\\r\\n\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\tmap.removeLayer(layers[group][layer][i][\\\"layer\\\"]);\\r\\n\\t\\t\\t\\t\\t\\tdelete layers[group][layer][i][\\\"layer\\\"];\\r\\n\\t\\t\\t\\t\\t\\t//remove cell tech legend\\r\\n\\t\\t\\t\\t\\t\\tvar legend_url = layers[group][layer][i][\\\"legend_url\\\"];\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1836d23d3d4cd85803cb6ba76ddd98e6\",\n \"score\": \"0.49779212\",\n \"text\": \"function initBaseLayer() {\\n // set basemap tilelayer URL if it does not already exist\\n if (!self.basemapUrl) {\\n self.basemapUrl = self.getScopeDefaults().basemapUrl;\\n }\\n\\n self._baseLayer = L.tileLayer(self.basemapUrl).addTo(self._map);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"192c3316bbf6e0c79f1647df63ce7e23\",\n \"score\": \"0.49665502\",\n \"text\": \"function WLayer_isRendered()\\n{\\n return this.rendered;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70391fc080ea0c894f0fa106fa885ba0\",\n \"score\": \"0.49649334\",\n \"text\": \"connected(layer) {\\n switch (true) {\\n case (this.countAllToAll(layer) == this.size * layer.size) :\\n return Layer.connectionType.ALL_TO_ALL;\\n\\n case (this.countOneToOne(layer) == this.size) :\\n return Layer.connectionType.ONE_TO_ONE;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b7be3b1f3bccc2a113d781d5796c2b4\",\n \"score\": \"0.49629086\",\n \"text\": \"function updateDoubleBaseLayer()\\n\\t{\\n\\t\\tmap = report.getComponent(\\\"map\\\");\\n\\t\\tactiveMap = report.getComponent(\\\"activeMap\\\");\\n\\t\\tmapData.noneBaseLayers = []; // Remove non-base layers from layer list.\\n\\n\\t\\tif (mapData.baseLayers.length > 1)\\n\\t\\t{\\n\\t\\t\\tvar layer = mapData.baseLayers[1];\\n\\t\\t\\tlayer.dataField = dataGroup.thematic.getDataField();\\n\\t\\t\\tlayer.highlightColor = report.highlightColor;\\n\\t\\t\\tlayer.selectionColor = report.selectionColor;\\n\\t\\t\\tlayer.highlightOpacity = report.highlightOpacity;\\n\\t\\t\\tlayer.selectionOpacity = report.selectionOpacity;\\n\\t\\t\\tif (!layer.displayLabelsOnly) layer.interactive = true;\\n\\t\\t\\tlayer.dataLabel = report.config.getComponent(\\\"map\\\").getProperty(\\\"tip\\\"+dataGroup.suffix);\\n\\t\\t\\tlayer.tipFunction = function(item)\\n\\t\\t\\t{\\n\\t\\t\\t\\tvar s = ia.tipFunction(item, \\\"map\\\", dataGroup.suffix);\\n\\t\\t\\t\\treturn s;\\n\\t\\t\\t};\\n\\n\\t\\t\\tif (report.config.template == ia.DOUBLE_BASELAYER_REPORT)\\n\\t\\t\\t{\\n\\t\\t\\t\\tinteractionGroup.addComponent(layer);\\n\\t\\t\\t}\\n\\t\\t\\tif (report.config.template == ia.DOUBLE_BASELAYER_REPORT_NEW)\\n\\t\\t\\t{\\n\\t\\t\\t\\tlayer.selectable = false;\\n\\t\\t\\t}\\n\\t\\t\\tmap.addLayer(layer);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3d61ffb1b281ff912c2249ed792d5fe\",\n \"score\": \"0.49577332\",\n \"text\": \"function hasAnyFeatures() {\\n var has_features = false;\\n markers.eachLayer(function (layer) {\\n if (!$.isEmptyObject(layer)) {\\n has_features = true;\\n }\\n });\\n return has_features;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"952cebeb6a5a23ed1bf31a388898c1fc\",\n \"score\": \"0.49522424\",\n \"text\": \"function addLayer(l)\\n{\\nvar added = false;\\nfor (var i = 0;i<layers.length;i++ )\\n{\\nif (l.index == layers[i].index)\\n{\\nadded = true;\\nbreak;\\n}\\n}\\nif (!added) layers.push(l);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b3f9303817758e531d26618227bdf51\",\n \"score\": \"0.49454865\",\n \"text\": \"function checkGroup(name, context) {\\n var checkOut;\\n for (var i = 0; i < context.length; i++) {\\n if (group[i].name === name) {\\n checkOut = true;\\n break;\\n }\\n else {\\n checkOut = false;\\n };\\n };\\n return checkOut;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34b8e34fed4e412daf3d623fb0301f05\",\n \"score\": \"0.49447358\",\n \"text\": \"function getVisibleLayers() {\\n // use .filter to count boolean true values\\n // TODO: make nicer\\n return layerRegistry.getLayersByType(Geo.Layer.Types.ESRI_FEATURE).concat(layerRegistry.getLayersByType(Geo.Layer.Types.ESRI_DYNAMIC)).filter(function (l) {\\n return l.visibleAtMapScale;\\n }).concat(layerRegistry.getLayersByType(Geo.Layer.Types.OGC_WMS)).length;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"401b460edcf8797db6546abffb950f24\",\n \"score\": \"0.4942818\",\n \"text\": \"function hasMinorGroup(map)\\n{\\n for (var index in map)\\n {\\n if (index != 'weight')\\n return true;\\n }\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ed752a112b8bd542b42a214d25560e2\",\n \"score\": \"0.49340457\",\n \"text\": \"triggerToggleLayerGroup() {\\n const datasetID = this.props.dataset.id;\\n const addLayerGroup = !this.props.isLayerGroupAdded(datasetID);\\n this.props.toggleLayerGroup(datasetID, addLayerGroup);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57e475776d15dd1582662ccd88bdcc16\",\n \"score\": \"0.4932358\",\n \"text\": \"get basicGeometryLoaded() {\\n for (const kind of this.m_basicGeometryKinds) {\\n if (!this.m_geometryKindsLoaded.has(kind)) {\\n return false;\\n }\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"061fedf6e20f22aa795f1fa31c3e1330\",\n \"score\": \"0.4931768\",\n \"text\": \"function removeLayer_check(map, layer)\\n{\\n\\tif(map_layer_check(map, layer))\\n\\t{map.removeLayer(layer);}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef540859bd2dd94a60a0fe3664bd87a3\",\n \"score\": \"0.4923869\",\n \"text\": \"function collectClippingLayers( )\\n{\\n\\tvar i = layerIndex;\\n\\tvar currentLayer = layerParent.layers[ i ];\\n\\n\\twhile ( currentLayer.grouped == true )\\n\\t{\\n\\t\\tcurrentLayer = layerParent.layers[ i ];\\n\\t\\tvar isvalid = validateLayer( currentLayer );\\n\\n\\t\\tif ( currentLayer.typename == \\\"LayerSet\\\" ) {\\n\\t\\t\\tcollectLayersBelow( 0, currentLayer );\\n\\t\\t} else if ( isvalid == true ) {\\n\\t\\t\\tcollectedLayers.push( currentLayer );\\n\\t\\t}\\n\\n\\t\\ti++;\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f41482e15fba3f442457017a702ffa71\",\n \"score\": \"0.49200445\",\n \"text\": \"function changeBaselayer(tmpDiv) {\\n //***Remove old layer\\n var layerDivs = d3.select(\\\"#baselayerListDropdown\\\").selectAll(\\\"div\\\");\\n \\n layerDivs[0].forEach(function(tmpLayer) {\\n if(d3.select(tmpLayer).select(\\\"span\\\").style(\\\"visibility\\\") == \\\"visible\\\") {\\n d3.select(tmpLayer).select(\\\"span\\\").style(\\\"visibility\\\", \\\"hidden\\\");\\n map.removeLayer(layerNames.baseLayers.values[d3.select(tmpLayer).property(\\\"value\\\")]);\\n }\\n });\\n\\n //***Add new layer\\n d3.select(tmpDiv).select(\\\"span\\\").style(\\\"visibility\\\", \\\"visible\\\");\\n map.addLayer(layerNames.baseLayers.values[tmpDiv.value]);\\n layerNames.baseLayers.values[tmpDiv.value].bringToBack(); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"209d83f4c2a784e4409611812b6f5086\",\n \"score\": \"0.49195316\",\n \"text\": \"_isMountsBound () {\\n log.trace('_isMountsBound')\\n return !!this.boundMounts.length\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e740f099a0d874a07b86f6240f43c152\",\n \"score\": \"0.48781425\",\n \"text\": \"function isBoundingBoxDrawn() {\\n if (ll == undefined || ur == undefined) {\\n return false;\\n }\\n var wblon = ll.lon.toFixed(2);\\n var eblon = ur.lon.toFixed(2);\\n var nblat = ur.lat.toFixed(2);\\n var sblat = ll.lat.toFixed(2);\\n if (!isNaN(wblon) && !isNaN(eblon) && !isNaN(nblat) && !isNaN(sblat) && submitFlag == 1) {\\n return true;\\n }\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"143c9acf535d81ae36fcfcf6c1164c9f\",\n \"score\": \"0.4876944\",\n \"text\": \"static _isExistsContextName(group) {\\n const context = GameState.current;\\n\\n if (group === undefined || group.state === undefined) {\\n return false;\\n }\\n\\n if (group.state.config.name !== context.config.name) {\\n return false;\\n }\\n\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a4dff19970926b1f8d402692aef09cc\",\n \"score\": \"0.48754674\",\n \"text\": \"_portalContainsElement(element) {\\n // This might break our control when used inside a Layer...\\n return false;\\n //return element && !!this._root && FluentUIBaseComponent portalContainsElement(element, this._root.current);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5fb08854375933314f956354fc305eb\",\n \"score\": \"0.4871643\",\n \"text\": \"function ae(t) {\\n return null !== t.collectionGroup;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dceb73816ad93a996a4afad28eebde4c\",\n \"score\": \"0.4855741\",\n \"text\": \"function isGroupGeometry(geometry, state) {\\n\\t\\treturn isGroupComponent(geometry, getGeometryData(state)[/* groupCountMap */8]);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4a69b22d5a198cd94623dc0a7d3c90e\",\n \"score\": \"0.48534796\",\n \"text\": \"function hasOverlap(fabric, outputObj) {\\n // iterate through all points included in the shape and determine if any have already been visited\\n for (let i = outputObj.x; i < outputObj.xMax; i++) {\\n for (let j = outputObj.y; j < outputObj.yMax; j++) {\\n if (fabric[i][j] > 1){\\n return true;\\n }\\n }\\n }\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0a144652b84a7c44f4b6faa7235102b\",\n \"score\": \"0.48515216\",\n \"text\": \"function checkCrsForLayer(layer, crs) {\\n var result = false;\\n for (var i = 0; i < layer.crs.length; i++) {\\n console.log(\\\"layer.crs[i]: \\\" + layer.crs[i]);\\n if (layer.crs[i] === crs) {\\n result = true;\\n break;\\n }\\n }\\n return result;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cff327f22a663d2ce2588559a841a53b\",\n \"score\": \"0.48443058\",\n \"text\": \"static hasTrainings(weeks) {\\n function blockHasTrainings(block) {\\n return Boolean(block.training_module_ids && block.training_module_ids.length);\\n }\\n function weekHasTrainings(week) {\\n if (!week.blocks.length) { return false; }\\n return Boolean(find(week.blocks, blockHasTrainings));\\n }\\n if (!weeks.length) { return false; }\\n return Boolean(find(weeks, weekHasTrainings));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82fe04e621a2500be8aa190abc1f2841\",\n \"score\": \"0.48433942\",\n \"text\": \"function getTotal() {\\n\\n return layers.length;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"652ac6e098765b48418a93b253ed097c\",\n \"score\": \"0.48330906\",\n \"text\": \"function isRequiredmentLayerAdded(reqid){\\n var f=false;\\n for(var i=0;i<$rootScope.capasreq.length;i++){\\n var reqId=$rootScope.capasreq[i].nombre;\\n if(reqId==reqid){\\n f=true;\\n break;\\n }\\n }\\n return f;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98586ebb88248f5a14944825858a5215\",\n \"score\": \"0.48305976\",\n \"text\": \"hasGameParent(){\\n\\t\\tlet parent = this.parent;\\n\\t\\twhile( parent ){\\n\\t\\t\\tif( parent instanceof Game )\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\tparent = parent.parent;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"662c4c4e378a342a35a0eef12a584070\",\n \"score\": \"0.48297822\",\n \"text\": \"computeHasRelatedTabGroupsOrBookmarks_() {\\n return this.memory.relatedTabGroups.length > 0 ||\\n this.memory.bookmarks.length > 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a1de65555655773f8f6e9bc29735f28\",\n \"score\": \"0.48295438\",\n \"text\": \"function switchBaselayer(layerNum){\\n // Ask map if chosen layer already on: true / false\\n var alreadyOn = map.hasLayer(baselayers[layerNum].layer);\\n // If false remove current baselayer by looping thorugh baselayers object and removing all baselayers from map\\n // better way to do this? layer ID?\\n if(!alreadyOn){\\n for(var x in baselayers){\\n map.removeLayer(baselayers[x].layer);\\n }\\n }\\n map.addLayer(baselayers[layerNum].layer);\\n \\n // Add base layer selected to cookie\\n document.cookie = \\\"selectedBaseLayer=\\\"+layerNum;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43aec3377e364eab0712809e36569bb8\",\n \"score\": \"0.48261786\",\n \"text\": \"function calculateBase(groupItem) {\\n var extent;\\n var baseAxis = groupItem.axis;\\n var seriesModels = groupItem.seriesModels;\\n var seriesCount = seriesModels.length;\\n var boxWidthList = groupItem.boxWidthList = [];\\n var boxOffsetList = groupItem.boxOffsetList = [];\\n var boundList = [];\\n var bandWidth;\\n\\n if (baseAxis.type === 'category') {\\n bandWidth = baseAxis.getBandWidth();\\n } else {\\n var maxDataCount = 0;\\n each(seriesModels, function (seriesModel) {\\n maxDataCount = Math.max(maxDataCount, seriesModel.getData().count());\\n });\\n extent = baseAxis.getExtent(), Math.abs(extent[1] - extent[0]) / maxDataCount;\\n }\\n\\n each(seriesModels, function (seriesModel) {\\n var boxWidthBound = seriesModel.get('boxWidth');\\n\\n if (!zrUtil.isArray(boxWidthBound)) {\\n boxWidthBound = [boxWidthBound, boxWidthBound];\\n }\\n\\n boundList.push([parsePercent(boxWidthBound[0], bandWidth) || 0, parsePercent(boxWidthBound[1], bandWidth) || 0]);\\n });\\n var availableWidth = bandWidth * 0.8 - 2;\\n var boxGap = availableWidth / seriesCount * 0.3;\\n var boxWidth = (availableWidth - boxGap * (seriesCount - 1)) / seriesCount;\\n var base = boxWidth / 2 - availableWidth / 2;\\n each(seriesModels, function (seriesModel, idx) {\\n boxOffsetList.push(base);\\n base += boxGap + boxWidth;\\n boxWidthList.push(Math.min(Math.max(boxWidth, boundList[idx][0]), boundList[idx][1]));\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43aec3377e364eab0712809e36569bb8\",\n \"score\": \"0.48261786\",\n \"text\": \"function calculateBase(groupItem) {\\n var extent;\\n var baseAxis = groupItem.axis;\\n var seriesModels = groupItem.seriesModels;\\n var seriesCount = seriesModels.length;\\n var boxWidthList = groupItem.boxWidthList = [];\\n var boxOffsetList = groupItem.boxOffsetList = [];\\n var boundList = [];\\n var bandWidth;\\n\\n if (baseAxis.type === 'category') {\\n bandWidth = baseAxis.getBandWidth();\\n } else {\\n var maxDataCount = 0;\\n each(seriesModels, function (seriesModel) {\\n maxDataCount = Math.max(maxDataCount, seriesModel.getData().count());\\n });\\n extent = baseAxis.getExtent(), Math.abs(extent[1] - extent[0]) / maxDataCount;\\n }\\n\\n each(seriesModels, function (seriesModel) {\\n var boxWidthBound = seriesModel.get('boxWidth');\\n\\n if (!zrUtil.isArray(boxWidthBound)) {\\n boxWidthBound = [boxWidthBound, boxWidthBound];\\n }\\n\\n boundList.push([parsePercent(boxWidthBound[0], bandWidth) || 0, parsePercent(boxWidthBound[1], bandWidth) || 0]);\\n });\\n var availableWidth = bandWidth * 0.8 - 2;\\n var boxGap = availableWidth / seriesCount * 0.3;\\n var boxWidth = (availableWidth - boxGap * (seriesCount - 1)) / seriesCount;\\n var base = boxWidth / 2 - availableWidth / 2;\\n each(seriesModels, function (seriesModel, idx) {\\n boxOffsetList.push(base);\\n base += boxGap + boxWidth;\\n boxWidthList.push(Math.min(Math.max(boxWidth, boundList[idx][0]), boundList[idx][1]));\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"070c1249a87b16da8c03d7fd24676459\",\n \"score\": \"0.48242676\",\n \"text\": \"function layerType(layerObj){//WIP\\r try{\\r var curLayer, instanceOfArray, instanceOfArrayLength, result;\\r function avLayerType(lObj){\\r try{\\r var l= lObj;\\r var iSource=l.source;\\r var lMainSource= lSource.mainSource;\\r var lFile= lMainSource.file;\\r if(!l.hasVideo){\\r return \\\"AudioLayer\\\"\\r }\\r else if(lSource instanceof CompItem){\\r return \\\"PreCompLayer\\\"\\r }\\r else if(lSource.frameDuration<1){\\r if(lMainSource instanceof PlaceholderSource){\\r return \\\"PlaceholderVideoLayer\\\"; \\r }\\r else if(lSource.name.toString().indexOf(\\\"].\\\")!=(-1)){ //name [000-0001] CHEAT\\r return \\\"ImageSequenceLayer\\\"; \\r }\\r else{\\r return \\\"VideoLayer\\\"\\r }\\r }else if(lSource.frameDuration==1){\\r \\r }\\r }catch(err){alert(err.line.toString() +\\\"\\\\r\\\" +err.toString())}\\r }\\r curLayer=layerObj;\\r instanceOfArray= new Array(AVLayer,CameraLayer,LightLayer, ShapeLAyer, TextLayer);\\r instanceOfArrayLength= instanceOfArray.length;\\r for(var a=0;a<instanceOfArrayLength;a++){\\r if(curLayer.guideLayer){\\r return \\\"GuideLayer\\\";\\r }\\r else if(curLayer.isTrackMatte){ return \\\"TrackMatteLayer\\\";}\\r else if(curLayer.adjustmentLayer){return \\\"AdjustmentLayer\\\";}\\r else if(curLayer instanceof instanceOfArray[a]){\\r result=instanceOfArray[a].name;\\r break;\\r }\\r }\\r if(result==\\\"AVLayer\\\"){\\r result= avLayerType(curLayer);\\r }\\r return result;\\r }\\r catch(err){alert(err.line.toString() +\\\"\\\\r\\\" +err.toString())}\\r }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d5ac7c49c37772ea0b63b73eba1d31a\",\n \"score\": \"0.4822939\",\n \"text\": \"getLayerCount() {\\n return this.layers.length;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"280ef5110f510d29adb4441d6d9ad672\",\n \"score\": \"0.48185524\",\n \"text\": \"function viewLayerGroup(layer, groupLayer) {\\n console.log(\\\"entro al admin de capas!!\\\");\\n if (layer.getVisible()) {\\n groupLayer.setVisible(false);\\n layer.setVisible(false);\\n } else {\\n groupLayer.setVisible(true);\\n layer.setVisible(true);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b898d88e9c3da8e542356ac3d5060e3\",\n \"score\": \"0.48140097\",\n \"text\": \"function buildLeafBaseLayers() {\\n\\n\\t\\t// Create the default layers\\n\\t\\tstreetMapLayer = L.tileLayer('https://api.tiles.mapbox.com/v4/{id}/{z}/{x}/{y}.png?access_token={accessToken}', {\\n\\t\\t\\tattribution: 'Imagery from <a href=\\\"http://mapbox.com/about/maps/\\\">MapBox</a> — Map data © <a href=\\\"http://www.openstreetmap.org/copyright\\\">OpenStreetMap</a>',\\n\\t\\t\\tsubdomains: 'abcd',\\n\\t\\t\\tid: 'juzzbott.mn25f8nc',\\n\\t\\t\\taccessToken: 'pk.eyJ1IjoianV6emJvdHQiLCJhIjoiMDlmN2JlMzMxMWI2YmNmNGY2NjFkZGFiYTFiZWVmNTQifQ.iKlZsVrsih0VuiUCzLZ1Lg'\\n\\t\\t});\\n\\n\\t\\ttopoMapLayer = L.tileLayer('https://api.tiles.mapbox.com/v4/{id}/{z}/{x}/{y}.png?access_token={accessToken}', {\\n\\t\\t\\tattribution: 'Imagery from <a href=\\\"http://mapbox.com/about/maps/\\\">MapBox</a> — Map data © <a href=\\\"http://www.openstreetmap.org/copyright\\\">OpenStreetMap</a>',\\n\\t\\t\\tsubdomains: 'abcd',\\n\\t\\t\\tid: 'juzzbott.mn24imf3',\\n\\t\\t\\taccessToken: 'pk.eyJ1IjoianV6emJvdHQiLCJhIjoiMDlmN2JlMzMxMWI2YmNmNGY2NjFkZGFiYTFiZWVmNTQifQ.iKlZsVrsih0VuiUCzLZ1Lg'\\n\\t\\t});\\n\\n\\t\\taerialMapLayer = L.tileLayer('https://api.tiles.mapbox.com/v4/{id}/{z}/{x}/{y}.png?access_token={accessToken}', {\\n\\t\\t\\tattribution: 'Imagery from <a href=\\\"http://mapbox.com/about/maps/\\\">MapBox</a> — Map data © <a href=\\\"http://www.openstreetmap.org/copyright\\\">OpenStreetMap</a>',\\n\\t\\t\\tsubdomains: 'abcd',\\n\\t\\t\\tid: 'juzzbott.mn74md27',\\n\\t\\t\\taccessToken: 'pk.eyJ1IjoianV6emJvdHQiLCJhIjoiMDlmN2JlMzMxMWI2YmNmNGY2NjFkZGFiYTFiZWVmNTQifQ.iKlZsVrsih0VuiUCzLZ1Lg',\\n\\t\\t\\tmaxZoom: 17\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9e83b4b1b237765e0e481721d116cbb\",\n \"score\": \"0.4811098\",\n \"text\": \"get hasGroupableColumns() {\\n return this.columnList.some((col) => col.groupable && !col.columnGroup);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9e83b4b1b237765e0e481721d116cbb\",\n \"score\": \"0.4811098\",\n \"text\": \"get hasGroupableColumns() {\\n return this.columnList.some((col) => col.groupable && !col.columnGroup);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ec6f2110a81053fa3e7950eaf2baca9\",\n \"score\": \"0.4810479\",\n \"text\": \"function isAncestor(instA, instB) {\\n !('_hostNode' in instA) ? \\\"development\\\" !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n !('_hostNode' in instB) ? \\\"development\\\" !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : _prodInvariant('35') : void 0;\\n\\n while (instB) {\\n if (instB === instA) {\\n return true;\\n }\\n instB = instB._hostParent;\\n }\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c32897a4ce8ea3b199b1e17cdf7c0dd\",\n \"score\": \"0.48101634\",\n \"text\": \"canResizeActiveLayer(width, height){\\n\\t\\tconst inBounds = this.isNewPosInBounds(this.activeLayer, this.activeLayer.x, this.activeLayer.y, width, height);\\n\\t\\tif(this.activeLayer.forceBoundary && !inBounds) return false;\\n\\t\\t\\n\\t\\tvar w = this.activeLayer.width;\\n\\t\\tvar h = this.activeLayer.height;\\n\\t\\tthis.activeLayer.width = w;\\n\\t\\tthis.activeLayer.height = h;\\n\\t\\t\\n\\t\\tvar canResize = true;\\n\\t\\tfor(var i=0; i<this.layers.length; i++){\\n\\t\\t\\tif(this.layers[i] === this.activeLayer) continue;\\n\\t\\t\\tif(this.activeLayer.allowOverlap && this.layers[i].allowOverlap) continue;\\n\\t\\t\\tif(this.doLayersOverlap(this.activeLayer, this.layers[i])){\\n\\t\\t\\t\\tcanResize = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tthis.activeLayer.width = w;\\n\\t\\tthis.activeLayer.height = h;\\n\\t\\t\\n\\t\\treturn canResize;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d434011069ef39ce793a6e4cbb9bd9be\",\n \"score\": \"0.48099244\",\n \"text\": \"function calculateBase(groupItem) {\\n var extent;\\n var baseAxis = groupItem.axis;\\n var seriesModels = groupItem.seriesModels;\\n var seriesCount = seriesModels.length;\\n var boxWidthList = groupItem.boxWidthList = [];\\n var boxOffsetList = groupItem.boxOffsetList = [];\\n var boundList = [];\\n var bandWidth;\\n\\n if (baseAxis.type === 'category') {\\n bandWidth = baseAxis.getBandWidth();\\n } else {\\n var maxDataCount = 0;\\n each$18(seriesModels, function (seriesModel) {\\n maxDataCount = Math.max(maxDataCount, seriesModel.getData().count());\\n });\\n extent = baseAxis.getExtent(), Math.abs(extent[1] - extent[0]) / maxDataCount;\\n }\\n\\n each$18(seriesModels, function (seriesModel) {\\n var boxWidthBound = seriesModel.get('boxWidth');\\n\\n if (!util.isArray(boxWidthBound)) {\\n boxWidthBound = [boxWidthBound, boxWidthBound];\\n }\\n\\n boundList.push([parsePercent$9(boxWidthBound[0], bandWidth) || 0, parsePercent$9(boxWidthBound[1], bandWidth) || 0]);\\n });\\n var availableWidth = bandWidth * 0.8 - 2;\\n var boxGap = availableWidth / seriesCount * 0.3;\\n var boxWidth = (availableWidth - boxGap * (seriesCount - 1)) / seriesCount;\\n var base = boxWidth / 2 - availableWidth / 2;\\n each$18(seriesModels, function (seriesModel, idx) {\\n boxOffsetList.push(base);\\n base += boxGap + boxWidth;\\n boxWidthList.push(Math.min(Math.max(boxWidth, boundList[idx][0]), boundList[idx][1]));\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27ea22856010b55c3bc1c37f4e58a386\",\n \"score\": \"0.4809611\",\n \"text\": \"function collectVisibleLayers(theParent, allLayers) {\\n if (!allLayers) {\\n var allLayers = new Array;\\n }\\n var len = theParent.layers.length;\\n for (var m = len - 1; m >= 0; m--) {\\n var theLayer = theParent.layers[m];\\n if (theLayer.typename == \\\"ArtLayer\\\") {\\n if (isNeedExportLayer (theLayer)) {\\n allLayers.push(theLayer);\\n }\\n } else {\\n allLayers = (collectVisibleLayers(theLayer, allLayers)); // apply the function to layersets;\\n }\\n };\\n return allLayers\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b2055bcb26188dc4922125c089fc695\",\n \"score\": \"0.48010752\",\n \"text\": \"update(instance) {\\n\\n // Remember visibility state of base layers.\\n forEachLayer(instance.map.getLayerGroup(), (layer) => {\\n if (layer.get('type') === 'base') {\\n this.remember(layer);\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5afa827674bed2c64431762931eeb9b\",\n \"score\": \"0.4788467\",\n \"text\": \"check(layer){\\n let correctKeys = [];\\n let keys = Object.keys(layer);\\n let safeLayers ={};\\n let pass = 0;\\n\\n //prevents absurd abounts of layers by remapping layer keys\\n var safeKeys = keys.map((item ,index)=>{\\n let parsed = parseInt(item)\\n if(!parsed){\\n this.error('invaild Bubble layer key');\\n\\n }else if(keys.length > 10){\\n this.error('too many layers...shorten to at most 10 layers');\\n\\n }else{\\n safeLayers[index + 1] = layer[keys[index]];\\n\\n }\\n });\\n\\n let layerNum = 0;\\n this.test = [];\\n let subsitute = Object.keys(safeLayers).map((Layer ,index)=>{\\n layerNum++;\\n let composeToReactComponent = safeLayers[Layer].map((items ,_index)=>{\\n //this get each element in ech array\\n // let createLayerItems = React.createElement(items[0],\\n // {ref:'Bubble-layer'+_index,key:UID(),className:`_bubbles-${layerNum}`}\\n // ,items.splice(1,items.length));\\n let createLayerItems = <BubblesItem key={UID()} elm={'bubble-items-'+_index}>{items.splice(1,items.length)}</BubblesItem>\\n\\n //console.log(createLayerItems)\\n return createLayerItems;\\n });\\n\\n this.test.push(\\n <BubblesLayer elm={'Bubble-layer-'+Layer} key={UID()}>\\n {composeToReactComponent}\\n </BubblesLayer>\\n );\\n\\n\\n //this.safe[Layer] = composeToReactComponent;\\n });\\n //console.log(test)\\n pass = 1;\\n //console.warn(keys , safeLayers)\\n return pass;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a45634835b921986515a7006d5fb431d\",\n \"score\": \"0.4783255\",\n \"text\": \"function collectLayersBelow( __index, __parent )\\n{\\n\\tfor ( var i = __index; i < __parent.layers.length; i++ ) {\\n\\n\\t\\tvar currentLayer = __parent.layers[ i ];\\n\\t\\tvar isvalid = validateLayer( currentLayer );\\n\\n\\t\\tif ( currentLayer.typename == \\\"LayerSet\\\" ) {\\n\\t\\t\\tcollectLayersBelow( 0, currentLayer );\\n\\t\\t} else if ( isvalid == true ) {\\n\\t\\t\\tcollectedLayers.push( currentLayer );\\n\\t\\t\\tcurrentLayer.allLocked = false;\\n\\t\\t}\\n\\t}\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":76,"cells":{"query_id":{"kind":"string","value":"fd0c67607d6c812e726cedbe2f21dc2f"},"query":{"kind":"string","value":"12.14 The try statement"},"positive_passages":{"kind":"list like","value":[{"docid":"99f65120aaed9c240ef9328e5d120b74","score":"0.0","text":"function parseCatchClause() {\n var param;\n\n expectKeyword('catch');\n\n expect('(');\n if (!match(')')) {\n param = parseExpression();\n // 12.14.1\n if (strict && param.type === Syntax.Identifier && isRestrictedWord(param.name)) {\n throwErrorTolerant({}, Messages.StrictCatchVariable);\n }\n }\n expect(')');\n\n return {\n type: Syntax.CatchClause,\n param: param,\n body: parseBlock()\n };\n }","title":""}],"string":"[\n {\n \"docid\": \"99f65120aaed9c240ef9328e5d120b74\",\n \"score\": \"0.0\",\n \"text\": \"function parseCatchClause() {\\n var param;\\n\\n expectKeyword('catch');\\n\\n expect('(');\\n if (!match(')')) {\\n param = parseExpression();\\n // 12.14.1\\n if (strict && param.type === Syntax.Identifier && isRestrictedWord(param.name)) {\\n throwErrorTolerant({}, Messages.StrictCatchVariable);\\n }\\n }\\n expect(')');\\n\\n return {\\n type: Syntax.CatchClause,\\n param: param,\\n body: parseBlock()\\n };\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"45bc8c5537a1add033f26edd26a30e10","score":"0.7532619","text":"function TryStatement() {\n}","title":""},{"docid":"524c3505676eb6dd7c51e2b094e45785","score":"0.7301539","text":"function attempt () {\n\t\t\t\t\t\t\ttry {\n\n\t\t\t\t\t\t\t} catch (f) {\n\n\t\t\t\t\t\t\t} finally {\n\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}","title":""},{"docid":"86da8a80007f0bf4ecec98e79e955a15","score":"0.7276756","text":"function attempt () {\n\t\t\t\t\t\t\t\ttry {\n\n\t\t\t\t\t\t\t\t} catch (f) {\n\n\t\t\t\t\t\t\t\t} finally {\n\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}","title":""},{"docid":"86da8a80007f0bf4ecec98e79e955a15","score":"0.7276756","text":"function attempt () {\n\t\t\t\t\t\t\t\ttry {\n\n\t\t\t\t\t\t\t\t} catch (f) {\n\n\t\t\t\t\t\t\t\t} finally {\n\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}","title":""},{"docid":"72492361401407146944d246f2aaa7f9","score":"0.7259928","text":"function tryCatch() {\n if (false) {\n console.log(\"try\");\n return \"try\";\n } else {\n throw new Error(\"thrown error code 13\");\n }\n }","title":""},{"docid":"80c0e34b5840eb67e71d98f4ffc0c8c1","score":"0.7144046","text":"function attempt () {\n\t\t\t\t\ttry {\n\n\t\t\t\t\t} catch (f) {\n\n\t\t\t\t\t} finally {\n\n\t\t\t\t\t}\n\t\t\t\t}","title":""},{"docid":"80c0e34b5840eb67e71d98f4ffc0c8c1","score":"0.7144046","text":"function attempt () {\n\t\t\t\t\ttry {\n\n\t\t\t\t\t} catch (f) {\n\n\t\t\t\t\t} finally {\n\n\t\t\t\t\t}\n\t\t\t\t}","title":""},{"docid":"1fab972b921a7efe40cd0adae2a56498","score":"0.679478","text":"function parseTryStatement() {\n var block, handlers = [], param, finalizer = null;\n\n expectKeyword('try');\n\n block = parseBlock();\n\n if (matchKeyword('catch')) {\n lex();\n expect('(');\n if (!match(')')) {\n param = parseExpression();\n }\n expect(')');\n\n handlers.push({\n type: Syntax.CatchClause,\n param: param,\n guard: null,\n body: parseBlock()\n });\n }\n\n if (matchKeyword('finally')) {\n lex();\n finalizer = parseBlock();\n }\n\n if (handlers.length === 0 && !finalizer) {\n throwError(Messages.NoCatchOrFinally);\n }\n\n return {\n type: Syntax.TryStatement,\n block: block,\n handlers: handlers,\n finalizer: finalizer\n };\n }","title":""},{"docid":"ad73440658104eb4fd1ba2f43e9dd6b4","score":"0.6732451","text":"function parseTryStatement() {\n var node = createNode(225 /* TryStatement */);\n parseExpected(102 /* TryKeyword */);\n node.tryBlock = parseBlock(/*ignoreMissingOpenBrace*/ false);\n node.catchClause = token() === 74 /* CatchKeyword */ ? parseCatchClause() : undefined;\n // If we don't have a catch clause, then we must have a finally clause. Try to parse\n // one out no matter what.\n if (!node.catchClause || token() === 87 /* FinallyKeyword */) {\n parseExpected(87 /* FinallyKeyword */);\n node.finallyBlock = parseBlock(/*ignoreMissingOpenBrace*/ false);\n }\n return finishNode(node);\n }","title":""},{"docid":"63394db955e9f9294ab550a3c555c303","score":"0.67314404","text":"function parseTryStatement() {\n var node = createNode(225 /* TryStatement */);\n parseExpected(102 /* TryKeyword */);\n node.tryBlock = parseBlock( /*ignoreMissingOpenBrace*/false);\n node.catchClause = token() === 74 /* CatchKeyword */ ? parseCatchClause() : undefined;\n // If we don't have a catch clause, then we must have a finally clause. Try to parse\n // one out no matter what.\n if (!node.catchClause || token() === 87 /* FinallyKeyword */) {\n parseExpected(87 /* FinallyKeyword */);\n node.finallyBlock = parseBlock( /*ignoreMissingOpenBrace*/false);\n }\n return finishNode(node);\n }","title":""},{"docid":"caeb22b55da85b7185f00fe5a69bedcf","score":"0.6696703","text":"function k(a){var b={tryLoc:a[0]};1 in a&&(b.catchLoc=a[1]),2 in a&&(b.finallyLoc=a[2],b.afterLoc=a[3]),this.tryEntries.push(b)}","title":""},{"docid":"8d4af1a248a4af01d738910028a83ba5","score":"0.66153383","text":"function parseTryStatement() {\n var node = createNode(223 /* TryStatement */);\n parseExpected(101 /* TryKeyword */);\n node.tryBlock = parseBlock( /*ignoreMissingOpenBrace*/false);\n node.catchClause = token() === 73 /* CatchKeyword */ ? parseCatchClause() : undefined;\n // If we don't have a catch clause, then we must have a finally clause. Try to parse\n // one out no matter what.\n if (!node.catchClause || token() === 86 /* FinallyKeyword */) {\n parseExpected(86 /* FinallyKeyword */);\n node.finallyBlock = parseBlock( /*ignoreMissingOpenBrace*/false);\n }\n return finishNode(node);\n }","title":""},{"docid":"24b96ed49e3701b6af6cf2263ed88c68","score":"0.65369165","text":"visitTryStatement(ctx) {\n\t return this.visitChildren(ctx);\n\t}","title":""},{"docid":"e6fa6e333b0b7021c3f78aaf447b079e","score":"0.6387802","text":"function visitTryStatement(node) {\n return ts.visitEachChild(node, nestedElementVisitor, context);\n }","title":""},{"docid":"e6fa6e333b0b7021c3f78aaf447b079e","score":"0.6387802","text":"function visitTryStatement(node) {\n return ts.visitEachChild(node, nestedElementVisitor, context);\n }","title":""},{"docid":"bceef1ecaa4caf7bb3c0ccacbed8a6f9","score":"0.6383057","text":"function tryCatch(fn,obj,arg){try{return{type:\"normal\",arg:fn.call(obj,arg)};}catch(err){return{type:\"throw\",arg:err};}}","title":""},{"docid":"bceef1ecaa4caf7bb3c0ccacbed8a6f9","score":"0.6383057","text":"function tryCatch(fn,obj,arg){try{return{type:\"normal\",arg:fn.call(obj,arg)};}catch(err){return{type:\"throw\",arg:err};}}","title":""},{"docid":"bceef1ecaa4caf7bb3c0ccacbed8a6f9","score":"0.6383057","text":"function tryCatch(fn,obj,arg){try{return{type:\"normal\",arg:fn.call(obj,arg)};}catch(err){return{type:\"throw\",arg:err};}}","title":""},{"docid":"bceef1ecaa4caf7bb3c0ccacbed8a6f9","score":"0.6383057","text":"function tryCatch(fn,obj,arg){try{return{type:\"normal\",arg:fn.call(obj,arg)};}catch(err){return{type:\"throw\",arg:err};}}","title":""},{"docid":"bceef1ecaa4caf7bb3c0ccacbed8a6f9","score":"0.6383057","text":"function tryCatch(fn,obj,arg){try{return{type:\"normal\",arg:fn.call(obj,arg)};}catch(err){return{type:\"throw\",arg:err};}}","title":""},{"docid":"6504a40317d7b0904c343627d87c309a","score":"0.63821334","text":"function tryCatchFn() {\n try {\n var x = ()=>this\n ;\n } catch (e) {\n var t = ()=>e + this\n ;\n } finally{\n var m = ()=>this + ''\n ;\n }\n}","title":""},{"docid":"bc5504a5e0273bdf69edde0deee3dff7","score":"0.6378831","text":"function tryCatch(fn, obj, arg) { // 60\n try { // 61\n return { type: \"normal\", arg: fn.call(obj, arg) }; // 62\n } catch (err) { // 63\n return { type: \"throw\", arg: err }; // 64\n } // 65\n } // 66","title":""},{"docid":"8ea68ca42e6dc20ca17bc0b6180bf543","score":"0.63754964","text":"function tryCatch(fn,obj,arg){try{return{type:\"normal\",arg:fn.call(obj,arg)}}catch(err){return{type:\"throw\",arg:err}}}","title":""},{"docid":"3260f3b7ae141cd763d540c4ce02a03b","score":"0.6326985","text":"function HostTry() {}","title":""},{"docid":"1dc49376ab538541a6648df75a982fd7","score":"0.6311919","text":"function findException(){\n try{\n\n }\n catch{\n\n }\n throw{\n \n }\n}","title":""},{"docid":"4799e53b9a20994922e7e0ace7599a8e","score":"0.6304574","text":"function tryCatchFn() {\n try {\n var _this = this;\n var x = function() {\n return _this;\n };\n } catch (e) {\n var _this = this;\n var t = function() {\n return e + _this;\n };\n } finally{\n var _this1 = this;\n var m = function() {\n return _this1 + '';\n };\n }\n}","title":""},{"docid":"5fe45980ea393086302d95fd3c6fecd2","score":"0.62937653","text":"function visitTryStatement(node) {\n return ts.visitEachChild(node, nestedElementVisitor, context);\n }","title":""},{"docid":"6af83b675cc06f70300f8ee1079d482f","score":"0.62712455","text":"function disruptiveTryCatchStatement() {\n try {\n nonExistentFunction();\n }\n catch (error) {\n console.error(error);\n // expected output: ReferenceError: nonExistentFunction is not defined\n // Note - error messages will vary depending on browser\n }\n}","title":""},{"docid":"1d3d9ef7075223b643f837c4f59089f3","score":"0.6256077","text":"function is_try_catch_statement(stmt) {\n return is_tagged_list(stmt, \"try_statement\");\n}","title":""},{"docid":"2421cab3a60d081d93ff9ac93d64a8be","score":"0.6214726","text":"function attempt () {\n\t\t\t\t\t\t\t\t\t}","title":""},{"docid":"19a8e6cb847c5766a4d67185338ded36","score":"0.6090445","text":"visitTryBlock(ctx) {\n\t return this.visitChildren(ctx);\n\t}","title":""},{"docid":"8ef2230fcd22141e457d7dfd63b0e0d7","score":"0.6068556","text":"function myFunction1(){\n try{\n return 1;\n }\n catch(err){\n \t$ERROR('#1.1: \"return 1\" inside function does not lead to throwing exception');\n return 0;\n }\n return 2;\n}","title":""},{"docid":"c0a90bacda35029b3e709492966a060f","score":"0.60683924","text":"function test0() {\n while (undefined) {\n if (undefined) {\n continue;\n }\n try {\n continue;\n } catch (ex) {\n } finally {\n break;\n }\n }\n}","title":""},{"docid":"ecaab9af482b5cd646b0a71dce5eb76a","score":"0.6049597","text":"function CatchStatement() {\n}","title":""},{"docid":"e4f0c7ef3200a684038357b57f59bacd","score":"0.5960382","text":"function e(){\n try {\n(function(){\n try {\neval(o3);\n}catch(e){}\n })();\n}catch(Infinity){}\n }","title":""},{"docid":"dd8665c38196328631d97a60b8789560","score":"0.5903276","text":"function tryCatch(\n fn,\n obj,\n arg\n ) {\n try {\n return {\n type: \"normal\",\n arg: fn.call(\n obj,\n arg\n ),\n };\n } catch (err) {\n return {\n type: \"throw\",\n arg: err,\n };\n }\n }","title":""},{"docid":"8d6e53c2d37d22ec925bbce70e59c7dd","score":"0.58820075","text":"visitFunctionTryBlock(ctx) {\n\t return this.visitChildren(ctx);\n\t}","title":""},{"docid":"215f677a8c1eb26121c7687eb107e969","score":"0.58675355","text":"function foo(){\n try {\n console.log( '42' );\n }\n finally {\n console.log( 'this always runs');\n }\n console.log( 'never runs' );\n}","title":""},{"docid":"ead7f4e0a656aa8258d8a5ada8647e4a","score":"0.58610326","text":"function tryCatch(fn, obj, arg) {\n try {\n return {\n type: \"normal\",\n arg: fn.call(obj, arg),\n };\n } catch (err) {\n return {\n type: \"throw\",\n arg: err,\n };\n }\n }","title":""},{"docid":"688e94eaf928a6a89f79624c778d95c5","score":"0.58520275","text":"function f0() {\n var v00 = 0; // Break 1\n var v01 = 1;\n // Normal function call in a catch scope.\n try {\n throw 1;\n } catch (e) {\n try {\n f1();\n } catch (e) {\n var v02 = 2; // Break 13\n }\n }\n var v03 = 3;\n var v04 = 4;\n eval('var v05 = 5; // Break 14');\n var v06 = 6; // Break 15\n}","title":""},{"docid":"8bc90fc72207316d30bdc104458430da","score":"0.5847576","text":"function beginExceptionBlock() {\n var startLabel = defineLabel();\n var endLabel = defineLabel();\n markLabel(startLabel);\n beginBlock({\n kind: 0 /* Exception */,\n state: 0 /* Try */,\n startLabel: startLabel,\n endLabel: endLabel\n });\n emitNop();\n return endLabel;\n }","title":""},{"docid":"6d73950f8c1d074508051ffec342a6ee","score":"0.5839103","text":"function attempt () {\n\ttry {\n\n\t\t(function () {\n\t\t\t\n\t\t\t// do work ... send(), send(), send()\n\t\t\tfunction send() {\n\n\t\t\t\ttry {\n\n\t\t\t\t\t(function () {\n\t\t\t\t\t\t\n\t\t\t\t\t\t// do work ... send(), send(), send()\n\t\t\t\t\t\tfunction send() {\n\n\t\t\t\t\t\t\ttry {\n\n\t\t\t\t\t\t\t\t(function () {\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t// do work ... send(), send(), send()\n\t\t\t\t\t\t\t\t\t// throw || attempt()\n\n\t\t\t\t\t\t\t\t\tfunction attempt () {\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}) ();\n\n\t\t\t\t\t\t\t} catch (f) {\n\n\t\t\t\t\t\t\t} finally {\n\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// throw || attempt()\n\n\t\t\t\t\t\tfunction attempt () {\n\t\t\t\t\t\t}\n\t\t\t\t\t}) ();\n\n\t\t\t\t} catch (f) {\n\n\t\t\t\t} finally {\n\n\t\t\t\t}\n\t\t\t}\n\t\t\t// throw || attempt()\n\n\t\t\tfunction attempt () {\n\t\t\t\ttry {\n\n\t\t\t\t\t(function () {\n\t\t\t\t\t\t\n\t\t\t\t\t\t// do work ... send(), send(), send()\n\t\t\t\t\t\t// throw || attempt()\n\n\t\t\t\t\t\tfunction attempt () {\n\t\t\t\t\t\t\ttry {\n\n\t\t\t\t\t\t\t} catch (f) {\n\n\t\t\t\t\t\t\t} finally {\n\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}) ();\n\n\t\t\t\t} catch (f) {\n\n\t\t\t\t\ttry {\n\t\t\t\t\t\t(function () {\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t// do work ... send(), send(), send()\n\t\t\t\t\t\t\t// throw || attempt()\n\n\t\t\t\t\t\t\tfunction attempt () {\n\t\t\t\t\t\t\t\ttry {\n\n\t\t\t\t\t\t\t\t} catch (f) {\n\n\t\t\t\t\t\t\t\t} finally {\n\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}) ();\n\t\t\t\t\t} catch (e) {\n\n\t\t\t\t\t} finally {\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t} finally {\n\n\t\t\t\t\ttry {\n\t\t\t\t\t\t(function () {\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t// do work ... send(), send(), send()\n\t\t\t\t\t\t\t// throw || attempt()\n\n\t\t\t\t\t\t\tfunction attempt () {\n\t\t\t\t\t\t\t\ttry {\n\n\t\t\t\t\t\t\t\t} catch (f) {\n\n\t\t\t\t\t\t\t\t} finally {\n\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}) ();\n\t\t\t\t\t} catch (e) {\n\n\t\t\t\t\t} finally {\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}) ();\n\n\t} catch (e) {\n\n\t\ttry {\n\t\t\t(function () {\n\t\t\t\t\n\t\t\t\t// do work ... send(), send(), send()\n\t\t\t\t// throw || attempt()\n\n\t\t\t\tfunction attempt () {\n\t\t\t\t\ttry {\n\n\t\t\t\t\t} catch (f) {\n\n\t\t\t\t\t} finally {\n\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}) ();\n\t\t} catch (e) {\n\n\t\t} finally {\n\t\t\t\n\t\t}\n\t\t\n\t} finally {\n\n\t\ttry {\n\t\t\t(function () {\n\t\t\t\t\n\t\t\t\t// do work ... send(), send(), send()\n\t\t\t\t// throw || attempt()\n\n\t\t\t\tfunction attempt () {\n\t\t\t\t\ttry {\n\n\t\t\t\t\t} catch (f) {\n\n\t\t\t\t\t} finally {\n\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}) ();\n\t\t} catch (e) {\n\n\t\t} finally {\n\t\t\t\n\t\t}\n\t\t\n\t}\n}","title":""},{"docid":"3e36a75e3049f30946df1950819a9b4a","score":"0.5837848","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return {\n\t type: \"normal\",\n\t arg: fn.call(obj, arg)\n\t };\n\t } catch (err) {\n\t return {\n\t type: \"throw\",\n\t arg: err\n\t };\n\t }\n\t }","title":""},{"docid":"3e36a75e3049f30946df1950819a9b4a","score":"0.5837848","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return {\n\t type: \"normal\",\n\t arg: fn.call(obj, arg)\n\t };\n\t } catch (err) {\n\t return {\n\t type: \"throw\",\n\t arg: err\n\t };\n\t }\n\t }","title":""},{"docid":"3e36a75e3049f30946df1950819a9b4a","score":"0.5837848","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return {\n\t type: \"normal\",\n\t arg: fn.call(obj, arg)\n\t };\n\t } catch (err) {\n\t return {\n\t type: \"throw\",\n\t arg: err\n\t };\n\t }\n\t }","title":""},{"docid":"a7f0c158c92274d2972a75f9a68952ff","score":"0.5836678","text":"function beginExceptionBlock() {\n var startLabel = defineLabel();\n var endLabel = defineLabel();\n markLabel(startLabel);\n beginBlock({\n kind: 0 /* Exception */\n , state: 0 /* Try */\n , startLabel: startLabel,\n endLabel: endLabel\n });\n emitNop();\n return endLabel;\n }","title":""},{"docid":"a7f0c158c92274d2972a75f9a68952ff","score":"0.5836678","text":"function beginExceptionBlock() {\n var startLabel = defineLabel();\n var endLabel = defineLabel();\n markLabel(startLabel);\n beginBlock({\n kind: 0 /* Exception */\n , state: 0 /* Try */\n , startLabel: startLabel,\n endLabel: endLabel\n });\n emitNop();\n return endLabel;\n }","title":""},{"docid":"c680b83a9fb7e5b9ba3322715a63f5bb","score":"0.58107996","text":"function foo(a) {\n try {\n a();\n } catch (e) {\n try {\n e();\n } catch (e) {\n e();\n }\n finally {\n e();\n }\n }\n finally {\n a();\n }\n}","title":""},{"docid":"f7603c00da0defa6a217ce431e44df51","score":"0.5798332","text":"async function tryCatch(day) {\n try{\n const result = await cekHariKerja(day)\n console.log(result)\n }catch(error){\n throw error\n }\n}","title":""},{"docid":"4438536b091d2f169c6d984bc908a9d2","score":"0.5792823","text":"function _TryStatementEmitter() {\n}","title":""},{"docid":"48e0459a3b5ff3bfd0e70570a5841f51","score":"0.57907176","text":"function TryStatement(node, print) {\n this.keyword(\"try\");\n print.plain(node.block);\n this.space();\n\n // Esprima bug puts the catch clause in a `handlers` array.\n // see https://code.google.com/p/esprima/issues/detail?id=433\n // We run into this from regenerator generated ast.\n if (node.handlers) {\n print.plain(node.handlers[0]);\n } else {\n print.plain(node.handler);\n }\n\n if (node.finalizer) {\n this.space();\n this.push(\"finally \");\n print.plain(node.finalizer);\n }\n}","title":""},{"docid":"7811aad9e7ecf22ce00b7fd50dce5ea0","score":"0.57882094","text":"async function someFunc() {\n //\"Try/catch\" blocks are how we handle the errors\n try {\n const result = await delayedAddition(2, 3);\n console.log(result); \n }\n catch(err) {\n console.log(\"Whoops, we had an error! \" + err.message);\n }\n //THIS BLOCK WILL JUMP TO THE CATCH BC THERE IS AN ERROR\n //(The delayedAddition function only wants numbers)\n try {\n const resultTwo = await delayedAddition(\"two\", \"three\");\n console.log(resultTwo);\n }\n catch(err) {\n console.log(err);\n }\n}","title":""},{"docid":"4ab771b33df5d26c30e56236b3fb1d3f","score":"0.5785981","text":"function Serializer$CatchStatement$E() {\n}","title":""},{"docid":"6ea035506ca3c2f76df499dc9a3d15f9","score":"0.57758105","text":"function f(){\n try{\n console.log(0);\n throw 'bogus';\n }\n catch(e){\n console.log(1);\n return true;\n console.log(2);\n \n }\n finally{\n console.log(3);\n return true; //this override all other throws and returns\n console.log(4);\n }\n \n console.log(5);\n}","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"7862258461b721ef5008aaa7289f270f","score":"0.5760709","text":"function tryCatch(fn, obj, arg) {\n\t try {\n\t return { type: \"normal\", arg: fn.call(obj, arg) };\n\t } catch (err) {\n\t return { type: \"throw\", arg: err };\n\t }\n\t }","title":""},{"docid":"45f4a7ac5d8d7e326d26268fcd6bf161","score":"0.57139766","text":"function f()\n{\n try\n {\n eval(this.badSyntax);\n }\n catch(e)\n {\n return cnErrorCaught;\n }\n return cnErrorNotCaught;\n}","title":""},{"docid":"06d56bf951c0b725fc6355a29be92b89","score":"0.57110333","text":"function tryCatch(fn, obj, arg) {\n try {\n return { type: \"normal\", arg: fn.call(obj, arg) };\n } catch (err) {\n return { type: \"throw\", arg: err };\n }\n }","title":""},{"docid":"73c35a45c7872b650a58e81042599db7","score":"0.5709922","text":"function attempt(func, errorFunc) {\n try {\n func();\n } catch (exception) {\n if (errorFunc) {\n errorFunc();\n }\n }\n }","title":""},{"docid":"73c35a45c7872b650a58e81042599db7","score":"0.5709922","text":"function attempt(func, errorFunc) {\n try {\n func();\n } catch (exception) {\n if (errorFunc) {\n errorFunc();\n }\n }\n }","title":""},{"docid":"73c35a45c7872b650a58e81042599db7","score":"0.5709922","text":"function attempt(func, errorFunc) {\n try {\n func();\n } catch (exception) {\n if (errorFunc) {\n errorFunc();\n }\n }\n }","title":""},{"docid":"b3b818d60887f9c217f55c0cf51e1418","score":"0.56928635","text":"function foo() {\n \n try {\n let z = bar(); // assume bar() throws error\n } catch (error) {\n console.log(z); // nope! z is undefined due to let's block scoping. \n }\n}","title":""},{"docid":"66db129179bb224aed38134d4cb4f0e4","score":"0.5689045","text":"function tryCatch(fn, obj, arg) {\n try {\n return {\n type: \"normal\",\n arg: fn.call(obj, arg),\n };\n } catch (err) {\n return {\n type: \"throw\",\n arg: err,\n };\n }\n }","title":""},{"docid":"13a3083117b2cc21b5763c0f6b3593b1","score":"0.5683483","text":"function o0()\n{\n var o892 = o839.o883.o893;\n try {\n(o421.o368 + 1) & 0xFF;\n}catch(e){}\n var o3 = 0;\n\n try {\nfor (var o2 = 4; o2 < 10; o2++)\n {\n try {\nif (o1 % 2 == 0)\n try { {} } catch(e) {}try { {} } catch(e) {}\n else\n {\n try {\nModule.abort = o3;\n}catch(o1){}\n }\n}catch(e){}\n }\n}catch(e){}\n try {\nreturn o3;\n}catch(e){}\n}","title":""},{"docid":"b92fd076183815c40ea665b5f3b08fd2","score":"0.5669337","text":"function tryFn(fn, err) {\n try {\n return fn();\n }\n catch (e) {\n return err(e);\n }\n}","title":""},{"docid":"5dc72286e624d1d2386e1aeba1765f2e","score":"0.56646806","text":"function tryCatch(fn, obj, arg) {\r\n try {\r\n return {\r\n type: \"normal\",\r\n arg: fn.call(obj, arg)\r\n };\r\n } catch (err) {\r\n return {\r\n type: \"throw\",\r\n arg: err\r\n };\r\n }\r\n }","title":""},{"docid":"e38a4cfea0f83cc3047efed332db6d9f","score":"0.5652838","text":"function fail() {\r\n try {\r\n console.loog('this works');\r\n }\r\n catch (error) {\r\n // also have error.name, error.stack, error.message\r\n console.log('error', error, error.stack);\r\n }\r\n finally {\r\n return 'a wild finally appears';\r\n }\r\n}","title":""},{"docid":"3b5afe245667826b722c640041399b2d","score":"0.56432265","text":"function tryCatch(fn, obj, arg) {\n try {\n return {\n type: \"normal\",\n arg: fn.call(obj, arg)\n };\n } catch (err) {\n return {\n type: \"throw\",\n arg: err\n };\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"45bc8c5537a1add033f26edd26a30e10\",\n \"score\": \"0.7532619\",\n \"text\": \"function TryStatement() {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"524c3505676eb6dd7c51e2b094e45785\",\n \"score\": \"0.7301539\",\n \"text\": \"function attempt () {\\n\\t\\t\\t\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86da8a80007f0bf4ecec98e79e955a15\",\n \"score\": \"0.7276756\",\n \"text\": \"function attempt () {\\n\\t\\t\\t\\t\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86da8a80007f0bf4ecec98e79e955a15\",\n \"score\": \"0.7276756\",\n \"text\": \"function attempt () {\\n\\t\\t\\t\\t\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72492361401407146944d246f2aaa7f9\",\n \"score\": \"0.7259928\",\n \"text\": \"function tryCatch() {\\n if (false) {\\n console.log(\\\"try\\\");\\n return \\\"try\\\";\\n } else {\\n throw new Error(\\\"thrown error code 13\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80c0e34b5840eb67e71d98f4ffc0c8c1\",\n \"score\": \"0.7144046\",\n \"text\": \"function attempt () {\\n\\t\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80c0e34b5840eb67e71d98f4ffc0c8c1\",\n \"score\": \"0.7144046\",\n \"text\": \"function attempt () {\\n\\t\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fab972b921a7efe40cd0adae2a56498\",\n \"score\": \"0.679478\",\n \"text\": \"function parseTryStatement() {\\n var block, handlers = [], param, finalizer = null;\\n\\n expectKeyword('try');\\n\\n block = parseBlock();\\n\\n if (matchKeyword('catch')) {\\n lex();\\n expect('(');\\n if (!match(')')) {\\n param = parseExpression();\\n }\\n expect(')');\\n\\n handlers.push({\\n type: Syntax.CatchClause,\\n param: param,\\n guard: null,\\n body: parseBlock()\\n });\\n }\\n\\n if (matchKeyword('finally')) {\\n lex();\\n finalizer = parseBlock();\\n }\\n\\n if (handlers.length === 0 && !finalizer) {\\n throwError(Messages.NoCatchOrFinally);\\n }\\n\\n return {\\n type: Syntax.TryStatement,\\n block: block,\\n handlers: handlers,\\n finalizer: finalizer\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad73440658104eb4fd1ba2f43e9dd6b4\",\n \"score\": \"0.6732451\",\n \"text\": \"function parseTryStatement() {\\n var node = createNode(225 /* TryStatement */);\\n parseExpected(102 /* TryKeyword */);\\n node.tryBlock = parseBlock(/*ignoreMissingOpenBrace*/ false);\\n node.catchClause = token() === 74 /* CatchKeyword */ ? parseCatchClause() : undefined;\\n // If we don't have a catch clause, then we must have a finally clause. Try to parse\\n // one out no matter what.\\n if (!node.catchClause || token() === 87 /* FinallyKeyword */) {\\n parseExpected(87 /* FinallyKeyword */);\\n node.finallyBlock = parseBlock(/*ignoreMissingOpenBrace*/ false);\\n }\\n return finishNode(node);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63394db955e9f9294ab550a3c555c303\",\n \"score\": \"0.67314404\",\n \"text\": \"function parseTryStatement() {\\n var node = createNode(225 /* TryStatement */);\\n parseExpected(102 /* TryKeyword */);\\n node.tryBlock = parseBlock( /*ignoreMissingOpenBrace*/false);\\n node.catchClause = token() === 74 /* CatchKeyword */ ? parseCatchClause() : undefined;\\n // If we don't have a catch clause, then we must have a finally clause. Try to parse\\n // one out no matter what.\\n if (!node.catchClause || token() === 87 /* FinallyKeyword */) {\\n parseExpected(87 /* FinallyKeyword */);\\n node.finallyBlock = parseBlock( /*ignoreMissingOpenBrace*/false);\\n }\\n return finishNode(node);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"caeb22b55da85b7185f00fe5a69bedcf\",\n \"score\": \"0.6696703\",\n \"text\": \"function k(a){var b={tryLoc:a[0]};1 in a&&(b.catchLoc=a[1]),2 in a&&(b.finallyLoc=a[2],b.afterLoc=a[3]),this.tryEntries.push(b)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d4af1a248a4af01d738910028a83ba5\",\n \"score\": \"0.66153383\",\n \"text\": \"function parseTryStatement() {\\n var node = createNode(223 /* TryStatement */);\\n parseExpected(101 /* TryKeyword */);\\n node.tryBlock = parseBlock( /*ignoreMissingOpenBrace*/false);\\n node.catchClause = token() === 73 /* CatchKeyword */ ? parseCatchClause() : undefined;\\n // If we don't have a catch clause, then we must have a finally clause. Try to parse\\n // one out no matter what.\\n if (!node.catchClause || token() === 86 /* FinallyKeyword */) {\\n parseExpected(86 /* FinallyKeyword */);\\n node.finallyBlock = parseBlock( /*ignoreMissingOpenBrace*/false);\\n }\\n return finishNode(node);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24b96ed49e3701b6af6cf2263ed88c68\",\n \"score\": \"0.65369165\",\n \"text\": \"visitTryStatement(ctx) {\\n\\t return this.visitChildren(ctx);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6fa6e333b0b7021c3f78aaf447b079e\",\n \"score\": \"0.6387802\",\n \"text\": \"function visitTryStatement(node) {\\n return ts.visitEachChild(node, nestedElementVisitor, context);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6fa6e333b0b7021c3f78aaf447b079e\",\n \"score\": \"0.6387802\",\n \"text\": \"function visitTryStatement(node) {\\n return ts.visitEachChild(node, nestedElementVisitor, context);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bceef1ecaa4caf7bb3c0ccacbed8a6f9\",\n \"score\": \"0.6383057\",\n \"text\": \"function tryCatch(fn,obj,arg){try{return{type:\\\"normal\\\",arg:fn.call(obj,arg)};}catch(err){return{type:\\\"throw\\\",arg:err};}}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bceef1ecaa4caf7bb3c0ccacbed8a6f9\",\n \"score\": \"0.6383057\",\n \"text\": \"function tryCatch(fn,obj,arg){try{return{type:\\\"normal\\\",arg:fn.call(obj,arg)};}catch(err){return{type:\\\"throw\\\",arg:err};}}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bceef1ecaa4caf7bb3c0ccacbed8a6f9\",\n \"score\": \"0.6383057\",\n \"text\": \"function tryCatch(fn,obj,arg){try{return{type:\\\"normal\\\",arg:fn.call(obj,arg)};}catch(err){return{type:\\\"throw\\\",arg:err};}}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bceef1ecaa4caf7bb3c0ccacbed8a6f9\",\n \"score\": \"0.6383057\",\n \"text\": \"function tryCatch(fn,obj,arg){try{return{type:\\\"normal\\\",arg:fn.call(obj,arg)};}catch(err){return{type:\\\"throw\\\",arg:err};}}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bceef1ecaa4caf7bb3c0ccacbed8a6f9\",\n \"score\": \"0.6383057\",\n \"text\": \"function tryCatch(fn,obj,arg){try{return{type:\\\"normal\\\",arg:fn.call(obj,arg)};}catch(err){return{type:\\\"throw\\\",arg:err};}}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6504a40317d7b0904c343627d87c309a\",\n \"score\": \"0.63821334\",\n \"text\": \"function tryCatchFn() {\\n try {\\n var x = ()=>this\\n ;\\n } catch (e) {\\n var t = ()=>e + this\\n ;\\n } finally{\\n var m = ()=>this + ''\\n ;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc5504a5e0273bdf69edde0deee3dff7\",\n \"score\": \"0.6378831\",\n \"text\": \"function tryCatch(fn, obj, arg) { // 60\\n try { // 61\\n return { type: \\\"normal\\\", arg: fn.call(obj, arg) }; // 62\\n } catch (err) { // 63\\n return { type: \\\"throw\\\", arg: err }; // 64\\n } // 65\\n } // 66\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ea68ca42e6dc20ca17bc0b6180bf543\",\n \"score\": \"0.63754964\",\n \"text\": \"function tryCatch(fn,obj,arg){try{return{type:\\\"normal\\\",arg:fn.call(obj,arg)}}catch(err){return{type:\\\"throw\\\",arg:err}}}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3260f3b7ae141cd763d540c4ce02a03b\",\n \"score\": \"0.6326985\",\n \"text\": \"function HostTry() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dc49376ab538541a6648df75a982fd7\",\n \"score\": \"0.6311919\",\n \"text\": \"function findException(){\\n try{\\n\\n }\\n catch{\\n\\n }\\n throw{\\n \\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4799e53b9a20994922e7e0ace7599a8e\",\n \"score\": \"0.6304574\",\n \"text\": \"function tryCatchFn() {\\n try {\\n var _this = this;\\n var x = function() {\\n return _this;\\n };\\n } catch (e) {\\n var _this = this;\\n var t = function() {\\n return e + _this;\\n };\\n } finally{\\n var _this1 = this;\\n var m = function() {\\n return _this1 + '';\\n };\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5fe45980ea393086302d95fd3c6fecd2\",\n \"score\": \"0.62937653\",\n \"text\": \"function visitTryStatement(node) {\\n return ts.visitEachChild(node, nestedElementVisitor, context);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6af83b675cc06f70300f8ee1079d482f\",\n \"score\": \"0.62712455\",\n \"text\": \"function disruptiveTryCatchStatement() {\\n try {\\n nonExistentFunction();\\n }\\n catch (error) {\\n console.error(error);\\n // expected output: ReferenceError: nonExistentFunction is not defined\\n // Note - error messages will vary depending on browser\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d3d9ef7075223b643f837c4f59089f3\",\n \"score\": \"0.6256077\",\n \"text\": \"function is_try_catch_statement(stmt) {\\n return is_tagged_list(stmt, \\\"try_statement\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2421cab3a60d081d93ff9ac93d64a8be\",\n \"score\": \"0.6214726\",\n \"text\": \"function attempt () {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19a8e6cb847c5766a4d67185338ded36\",\n \"score\": \"0.6090445\",\n \"text\": \"visitTryBlock(ctx) {\\n\\t return this.visitChildren(ctx);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ef2230fcd22141e457d7dfd63b0e0d7\",\n \"score\": \"0.6068556\",\n \"text\": \"function myFunction1(){\\n try{\\n return 1;\\n }\\n catch(err){\\n \\t$ERROR('#1.1: \\\"return 1\\\" inside function does not lead to throwing exception');\\n return 0;\\n }\\n return 2;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0a90bacda35029b3e709492966a060f\",\n \"score\": \"0.60683924\",\n \"text\": \"function test0() {\\n while (undefined) {\\n if (undefined) {\\n continue;\\n }\\n try {\\n continue;\\n } catch (ex) {\\n } finally {\\n break;\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecaab9af482b5cd646b0a71dce5eb76a\",\n \"score\": \"0.6049597\",\n \"text\": \"function CatchStatement() {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4f0c7ef3200a684038357b57f59bacd\",\n \"score\": \"0.5960382\",\n \"text\": \"function e(){\\n try {\\n(function(){\\n try {\\neval(o3);\\n}catch(e){}\\n })();\\n}catch(Infinity){}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd8665c38196328631d97a60b8789560\",\n \"score\": \"0.5903276\",\n \"text\": \"function tryCatch(\\n fn,\\n obj,\\n arg\\n ) {\\n try {\\n return {\\n type: \\\"normal\\\",\\n arg: fn.call(\\n obj,\\n arg\\n ),\\n };\\n } catch (err) {\\n return {\\n type: \\\"throw\\\",\\n arg: err,\\n };\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d6e53c2d37d22ec925bbce70e59c7dd\",\n \"score\": \"0.58820075\",\n \"text\": \"visitFunctionTryBlock(ctx) {\\n\\t return this.visitChildren(ctx);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"215f677a8c1eb26121c7687eb107e969\",\n \"score\": \"0.58675355\",\n \"text\": \"function foo(){\\n try {\\n console.log( '42' );\\n }\\n finally {\\n console.log( 'this always runs');\\n }\\n console.log( 'never runs' );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ead7f4e0a656aa8258d8a5ada8647e4a\",\n \"score\": \"0.58610326\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n try {\\n return {\\n type: \\\"normal\\\",\\n arg: fn.call(obj, arg),\\n };\\n } catch (err) {\\n return {\\n type: \\\"throw\\\",\\n arg: err,\\n };\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"688e94eaf928a6a89f79624c778d95c5\",\n \"score\": \"0.58520275\",\n \"text\": \"function f0() {\\n var v00 = 0; // Break 1\\n var v01 = 1;\\n // Normal function call in a catch scope.\\n try {\\n throw 1;\\n } catch (e) {\\n try {\\n f1();\\n } catch (e) {\\n var v02 = 2; // Break 13\\n }\\n }\\n var v03 = 3;\\n var v04 = 4;\\n eval('var v05 = 5; // Break 14');\\n var v06 = 6; // Break 15\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bc90fc72207316d30bdc104458430da\",\n \"score\": \"0.5847576\",\n \"text\": \"function beginExceptionBlock() {\\n var startLabel = defineLabel();\\n var endLabel = defineLabel();\\n markLabel(startLabel);\\n beginBlock({\\n kind: 0 /* Exception */,\\n state: 0 /* Try */,\\n startLabel: startLabel,\\n endLabel: endLabel\\n });\\n emitNop();\\n return endLabel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d73950f8c1d074508051ffec342a6ee\",\n \"score\": \"0.5839103\",\n \"text\": \"function attempt () {\\n\\ttry {\\n\\n\\t\\t(function () {\\n\\t\\t\\t\\n\\t\\t\\t// do work ... send(), send(), send()\\n\\t\\t\\tfunction send() {\\n\\n\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t(function () {\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t// do work ... send(), send(), send()\\n\\t\\t\\t\\t\\t\\tfunction send() {\\n\\n\\t\\t\\t\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t(function () {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// do work ... send(), send(), send()\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// throw || attempt()\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfunction attempt () {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}) ();\\n\\n\\t\\t\\t\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t// throw || attempt()\\n\\n\\t\\t\\t\\t\\t\\tfunction attempt () {\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}) ();\\n\\n\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// throw || attempt()\\n\\n\\t\\t\\tfunction attempt () {\\n\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t(function () {\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t// do work ... send(), send(), send()\\n\\t\\t\\t\\t\\t\\t// throw || attempt()\\n\\n\\t\\t\\t\\t\\t\\tfunction attempt () {\\n\\t\\t\\t\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}) ();\\n\\n\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\t(function () {\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t// do work ... send(), send(), send()\\n\\t\\t\\t\\t\\t\\t\\t// throw || attempt()\\n\\n\\t\\t\\t\\t\\t\\t\\tfunction attempt () {\\n\\t\\t\\t\\t\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}) ();\\n\\t\\t\\t\\t\\t} catch (e) {\\n\\n\\t\\t\\t\\t\\t} finally {\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\t(function () {\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t// do work ... send(), send(), send()\\n\\t\\t\\t\\t\\t\\t\\t// throw || attempt()\\n\\n\\t\\t\\t\\t\\t\\t\\tfunction attempt () {\\n\\t\\t\\t\\t\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}) ();\\n\\t\\t\\t\\t\\t} catch (e) {\\n\\n\\t\\t\\t\\t\\t} finally {\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}) ();\\n\\n\\t} catch (e) {\\n\\n\\t\\ttry {\\n\\t\\t\\t(function () {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// do work ... send(), send(), send()\\n\\t\\t\\t\\t// throw || attempt()\\n\\n\\t\\t\\t\\tfunction attempt () {\\n\\t\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}) ();\\n\\t\\t} catch (e) {\\n\\n\\t\\t} finally {\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t} finally {\\n\\n\\t\\ttry {\\n\\t\\t\\t(function () {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// do work ... send(), send(), send()\\n\\t\\t\\t\\t// throw || attempt()\\n\\n\\t\\t\\t\\tfunction attempt () {\\n\\t\\t\\t\\t\\ttry {\\n\\n\\t\\t\\t\\t\\t} catch (f) {\\n\\n\\t\\t\\t\\t\\t} finally {\\n\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}) ();\\n\\t\\t} catch (e) {\\n\\n\\t\\t} finally {\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e36a75e3049f30946df1950819a9b4a\",\n \"score\": \"0.5837848\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return {\\n\\t type: \\\"normal\\\",\\n\\t arg: fn.call(obj, arg)\\n\\t };\\n\\t } catch (err) {\\n\\t return {\\n\\t type: \\\"throw\\\",\\n\\t arg: err\\n\\t };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e36a75e3049f30946df1950819a9b4a\",\n \"score\": \"0.5837848\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return {\\n\\t type: \\\"normal\\\",\\n\\t arg: fn.call(obj, arg)\\n\\t };\\n\\t } catch (err) {\\n\\t return {\\n\\t type: \\\"throw\\\",\\n\\t arg: err\\n\\t };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e36a75e3049f30946df1950819a9b4a\",\n \"score\": \"0.5837848\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return {\\n\\t type: \\\"normal\\\",\\n\\t arg: fn.call(obj, arg)\\n\\t };\\n\\t } catch (err) {\\n\\t return {\\n\\t type: \\\"throw\\\",\\n\\t arg: err\\n\\t };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7f0c158c92274d2972a75f9a68952ff\",\n \"score\": \"0.5836678\",\n \"text\": \"function beginExceptionBlock() {\\n var startLabel = defineLabel();\\n var endLabel = defineLabel();\\n markLabel(startLabel);\\n beginBlock({\\n kind: 0 /* Exception */\\n , state: 0 /* Try */\\n , startLabel: startLabel,\\n endLabel: endLabel\\n });\\n emitNop();\\n return endLabel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7f0c158c92274d2972a75f9a68952ff\",\n \"score\": \"0.5836678\",\n \"text\": \"function beginExceptionBlock() {\\n var startLabel = defineLabel();\\n var endLabel = defineLabel();\\n markLabel(startLabel);\\n beginBlock({\\n kind: 0 /* Exception */\\n , state: 0 /* Try */\\n , startLabel: startLabel,\\n endLabel: endLabel\\n });\\n emitNop();\\n return endLabel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c680b83a9fb7e5b9ba3322715a63f5bb\",\n \"score\": \"0.58107996\",\n \"text\": \"function foo(a) {\\n try {\\n a();\\n } catch (e) {\\n try {\\n e();\\n } catch (e) {\\n e();\\n }\\n finally {\\n e();\\n }\\n }\\n finally {\\n a();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7603c00da0defa6a217ce431e44df51\",\n \"score\": \"0.5798332\",\n \"text\": \"async function tryCatch(day) {\\n try{\\n const result = await cekHariKerja(day)\\n console.log(result)\\n }catch(error){\\n throw error\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4438536b091d2f169c6d984bc908a9d2\",\n \"score\": \"0.5792823\",\n \"text\": \"function _TryStatementEmitter() {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48e0459a3b5ff3bfd0e70570a5841f51\",\n \"score\": \"0.57907176\",\n \"text\": \"function TryStatement(node, print) {\\n this.keyword(\\\"try\\\");\\n print.plain(node.block);\\n this.space();\\n\\n // Esprima bug puts the catch clause in a `handlers` array.\\n // see https://code.google.com/p/esprima/issues/detail?id=433\\n // We run into this from regenerator generated ast.\\n if (node.handlers) {\\n print.plain(node.handlers[0]);\\n } else {\\n print.plain(node.handler);\\n }\\n\\n if (node.finalizer) {\\n this.space();\\n this.push(\\\"finally \\\");\\n print.plain(node.finalizer);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7811aad9e7ecf22ce00b7fd50dce5ea0\",\n \"score\": \"0.57882094\",\n \"text\": \"async function someFunc() {\\n //\\\"Try/catch\\\" blocks are how we handle the errors\\n try {\\n const result = await delayedAddition(2, 3);\\n console.log(result); \\n }\\n catch(err) {\\n console.log(\\\"Whoops, we had an error! \\\" + err.message);\\n }\\n //THIS BLOCK WILL JUMP TO THE CATCH BC THERE IS AN ERROR\\n //(The delayedAddition function only wants numbers)\\n try {\\n const resultTwo = await delayedAddition(\\\"two\\\", \\\"three\\\");\\n console.log(resultTwo);\\n }\\n catch(err) {\\n console.log(err);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ab771b33df5d26c30e56236b3fb1d3f\",\n \"score\": \"0.5785981\",\n \"text\": \"function Serializer$CatchStatement$E() {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ea035506ca3c2f76df499dc9a3d15f9\",\n \"score\": \"0.57758105\",\n \"text\": \"function f(){\\n try{\\n console.log(0);\\n throw 'bogus';\\n }\\n catch(e){\\n console.log(1);\\n return true;\\n console.log(2);\\n \\n }\\n finally{\\n console.log(3);\\n return true; //this override all other throws and returns\\n console.log(4);\\n }\\n \\n console.log(5);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7862258461b721ef5008aaa7289f270f\",\n \"score\": \"0.5760709\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n\\t try {\\n\\t return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\\t } catch (err) {\\n\\t return { type: \\\"throw\\\", arg: err };\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45f4a7ac5d8d7e326d26268fcd6bf161\",\n \"score\": \"0.57139766\",\n \"text\": \"function f()\\n{\\n try\\n {\\n eval(this.badSyntax);\\n }\\n catch(e)\\n {\\n return cnErrorCaught;\\n }\\n return cnErrorNotCaught;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06d56bf951c0b725fc6355a29be92b89\",\n \"score\": \"0.57110333\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n try {\\n return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n } catch (err) {\\n return { type: \\\"throw\\\", arg: err };\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73c35a45c7872b650a58e81042599db7\",\n \"score\": \"0.5709922\",\n \"text\": \"function attempt(func, errorFunc) {\\n try {\\n func();\\n } catch (exception) {\\n if (errorFunc) {\\n errorFunc();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73c35a45c7872b650a58e81042599db7\",\n \"score\": \"0.5709922\",\n \"text\": \"function attempt(func, errorFunc) {\\n try {\\n func();\\n } catch (exception) {\\n if (errorFunc) {\\n errorFunc();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73c35a45c7872b650a58e81042599db7\",\n \"score\": \"0.5709922\",\n \"text\": \"function attempt(func, errorFunc) {\\n try {\\n func();\\n } catch (exception) {\\n if (errorFunc) {\\n errorFunc();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3b818d60887f9c217f55c0cf51e1418\",\n \"score\": \"0.56928635\",\n \"text\": \"function foo() {\\n \\n try {\\n let z = bar(); // assume bar() throws error\\n } catch (error) {\\n console.log(z); // nope! z is undefined due to let's block scoping. \\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66db129179bb224aed38134d4cb4f0e4\",\n \"score\": \"0.5689045\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n try {\\n return {\\n type: \\\"normal\\\",\\n arg: fn.call(obj, arg),\\n };\\n } catch (err) {\\n return {\\n type: \\\"throw\\\",\\n arg: err,\\n };\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13a3083117b2cc21b5763c0f6b3593b1\",\n \"score\": \"0.5683483\",\n \"text\": \"function o0()\\n{\\n var o892 = o839.o883.o893;\\n try {\\n(o421.o368 + 1) & 0xFF;\\n}catch(e){}\\n var o3 = 0;\\n\\n try {\\nfor (var o2 = 4; o2 < 10; o2++)\\n {\\n try {\\nif (o1 % 2 == 0)\\n try { {} } catch(e) {}try { {} } catch(e) {}\\n else\\n {\\n try {\\nModule.abort = o3;\\n}catch(o1){}\\n }\\n}catch(e){}\\n }\\n}catch(e){}\\n try {\\nreturn o3;\\n}catch(e){}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b92fd076183815c40ea665b5f3b08fd2\",\n \"score\": \"0.5669337\",\n \"text\": \"function tryFn(fn, err) {\\n try {\\n return fn();\\n }\\n catch (e) {\\n return err(e);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5dc72286e624d1d2386e1aeba1765f2e\",\n \"score\": \"0.56646806\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\r\\n try {\\r\\n return {\\r\\n type: \\\"normal\\\",\\r\\n arg: fn.call(obj, arg)\\r\\n };\\r\\n } catch (err) {\\r\\n return {\\r\\n type: \\\"throw\\\",\\r\\n arg: err\\r\\n };\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e38a4cfea0f83cc3047efed332db6d9f\",\n \"score\": \"0.5652838\",\n \"text\": \"function fail() {\\r\\n try {\\r\\n console.loog('this works');\\r\\n }\\r\\n catch (error) {\\r\\n // also have error.name, error.stack, error.message\\r\\n console.log('error', error, error.stack);\\r\\n }\\r\\n finally {\\r\\n return 'a wild finally appears';\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b5afe245667826b722c640041399b2d\",\n \"score\": \"0.56432265\",\n \"text\": \"function tryCatch(fn, obj, arg) {\\n try {\\n return {\\n type: \\\"normal\\\",\\n arg: fn.call(obj, arg)\\n };\\n } catch (err) {\\n return {\\n type: \\\"throw\\\",\\n arg: err\\n };\\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":77,"cells":{"query_id":{"kind":"string","value":"36c6772bab287aaa63d16de68d72ffcb"},"query":{"kind":"string","value":"Frontend sends a request to play all songs in the queue database table"},"positive_passages":{"kind":"list like","value":[{"docid":"6ccf4a8c0d738eb4e72badd7156a0d83","score":"0.0","text":"playQue(e) {\n fetch(`${window.MyAppGlobals.serverURL}playQue`).then(res => res.json())\n .then(res => { \n this.result = Object.values(res); \n console.log(\"resultatet var: \" + this.result[0])\n \n })\n }","title":""}],"string":"[\n {\n \"docid\": \"6ccf4a8c0d738eb4e72badd7156a0d83\",\n \"score\": \"0.0\",\n \"text\": \"playQue(e) {\\n fetch(`${window.MyAppGlobals.serverURL}playQue`).then(res => res.json())\\n .then(res => { \\n this.result = Object.values(res); \\n console.log(\\\"resultatet var: \\\" + this.result[0])\\n \\n })\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"33015abca3bd17896615732c60959f80","score":"0.68767816","text":"async function playlist() { \n const response = await fetch('http://localhost:3001/playlist')\n if (response.ok){\n registerMetric('play-clicked', 1)\n var i=0\n const jsonResponse = await response.json()\n const playlist = document.getElementById('playlist')\n let html = ''\n for (song of jsonResponse) {\n html += `<div>${song.name} - <audio controls>\n <source src=\"http://localhost:3000/${song.file}\" type=\"audio/ogg\"> \n </audio></div>`\n }\n playlist.innerHTML = html \n }\n}","title":""},{"docid":"a35b76f2b3666c49529d35645223d408","score":"0.67186356","text":"function playSong(query, speaker) {\n query = querystring.stringify({media: 'music', term: query})\n console.log(query);\n\n var songUrl = 0;\n request('https://itunes.apple.com/search' + '?' + query, function(error, response, body) {\n console.log('search');\n console.log('error:', error); // Print the error if one occurred\n console.log('statusCode:', response && response.statusCode); // Print the response status code if a response was received\n // console.log(); Print the HTML for the Google homepage.\n var results = JSON.parse(body).results\n var item = results[0]\n // console.log(prettyjson.render(item));\n var id = 0;\n\n var trackUrl = new URL(item.trackViewUrl);\n var id = trackUrl.searchParams.get('i');\n var songUrl = '/' + speaker + '/applemusic/now/song:' + id\n console.log(songUrl);\n\n request(baseUrl + songUrl, function(error, response, body) {\n console.log('queueing');\n console.log('error:', error); // Print the error if one occurred\n console.log('statusCode:', response && response.statusCode); // Print the response status code if a response was received\n\n request(baseUrl + '/Basement/play', function(error, response, body) {\n console.log('playing');\n console.log('error:', error); // Print the error if one occurred\n console.log('statusCode:', response && response.statusCode); // Print the response status code if a response was received\n });\n });\n });\n}","title":""},{"docid":"f78514922cc786d6c918c235286cbe5b","score":"0.66887623","text":"function enqueue() {\n\tqueue.add(this.id);\n\tqueue.draw();\n\tif (queue.length() == 1) {\n\t\tchangeSong(this.id);\n\t}\n}","title":""},{"docid":"430f54f617ccc58b436a8d361942cfba","score":"0.66359943","text":"function call(){\n request(\"api/nowplaying\", \"\", function(result){\n var data = JSON.parse(result);\n var test = currentSong =! null ? currentSong : data.song.id;\n if(test == data.song.id) { // same song\n onSongRefresh(data);\n }\n else { // new song\n onSongChange(data);\n onSongRefresh(data);\n currentSong = data.song.id;\n }\n }, function(data){\n stopCall();\n $(\"#connection-error-alert\").modal({\n keyboard: false,\n backdrop:\"static\"\n }).modal(\"show\");\n });\n request(\"api/queue?limit=3\", \"\", function(result){\n var data = JSON.parse(result);\n onQueueRefresh(data);\n }, function(){\n stopCall();\n $(\"#connection-error-alert\").modal({\n keyboard: false,\n backdrop:\"static\"\n }).modal(\"show\");\n });\n}","title":""},{"docid":"745bf970420fcada187fbf8572a0bc2e","score":"0.65192026","text":"function playSong() {\n\t\tfor (var i = 0; i < songTracks.length; i++)\n\t\t\tsongTracks[i].play();\n\t}","title":""},{"docid":"8e2f32a7e54014f7b1b885a114efca4a","score":"0.64914626","text":"function listenAjax() {\n //calls query with music as only criteria first\n\n $.ajax({\n url: 'https://api.spotify.com/v1/search',\n data: {\n q: iWant.selectedNoun,\n type: 'track'\n },\n\n success: function (response) {\n // console.log('spotify', response);\n\n\n for (i = 0; i < response.tracks.items.length; i++) {\n\n var tracks = response.tracks.items[i];\n\n var song = {\n artist: tracks.artists[0].name,\n album: tracks.album.name,\n title: tracks.name,\n picture: tracks.album.images[0].url,\n audio: tracks.preview_url,\n link: tracks.external_urls.spotify\n };\n\n iWant.queueArray.push(song);\n }\n\n displayListen();\n\n\n }\n });\n}","title":""},{"docid":"60a166903008ab63a6da7723b78662b2","score":"0.6456316","text":"enqueue(song) {\r\n this.items.push(song);\r\n }","title":""},{"docid":"38447d88ecedb8eb1da4edc8ab89f305","score":"0.64547926","text":"function playNextSong(guild) {\r\n\t\tlet voiceConn = guild.voiceConn;\r\n\t\tlet queue = guild.queue;\r\n\t\t\r\n\t\tif (queue.length > 0) {\r\n\t\t\tconsole.log(\"Now playing: \" + queue[0].title + \"; \" + queue[0].url);\t\t\t\r\n\t\t\tvoiceConn.play(queue[0].url);\r\n\t\t}\r\n\t}","title":""},{"docid":"e2efb807d4487f741c5dccce96453e9c","score":"0.64454484","text":"function playSongFromQueue(song) {\n setCurrentVideoId(song.videoId)\n context.player.loadVideoById(song.videoId)\n updateContext({ currentSong: song });\n }","title":""},{"docid":"205c28d14117bf5ffe97b68377e37d90","score":"0.6424254","text":"function getQueue($play, $seek) {\n $.ajax({\n url: '/controller.php',\n dataType: 'json',\n data: 'r=getQueue',\n async: false,\n success: function(d) {\n _QUEUE.init(d.queue);\n skip = d.timestamp - d.queue[0].startplay; \n\n _QUEUE.updateQueue(d.queue);\n\n if (window.fluid) window.fluid.dockBadge = _QUEUE.length()-_QUEUE.ptr;\n refreshQueueDisplay(); \n refreshListeners(d.listeners); \n refreshRequestBadge(d.pendingRequests);\n }\n });\n}","title":""},{"docid":"db5260d3bcfb9046c024bb63d02cd363","score":"0.6399509","text":"function list(message, serverQueue) {\n if (!serverQueue) {\n return message.channel.send(`${eAttention}` + \"There are no songs in the queue to list.\");\n } else {\n let playList = `${ePlaying} Playing: ` + serverQueue.songs[0].title + \"\\n\";\n for (let i = 1; i < serverQueue.songs.length; i++)\n playList = playList + `${eNext}` + (i) + \" - \" + serverQueue.songs[i].title + \"\\n\";\n message.channel.send(playList);\n }\n}","title":""},{"docid":"14f8f5d7d123a516f1e0ebf580a64e7a","score":"0.63866895","text":"function playPlaylist(sequenceInPlaylist) {\n\t\tvar nextSongInSequence = 0;\n\t\tconsole.log(queuePlaylist);\n\t\t// Se sono arrivato all'ultima canzone, la successiva sarà la prima della coda\n\t\tif (sequenceInPlaylist === queuePlaylist.length - 1) {\n\t\t\tnextSongInSequence = 0;\n\t\t} else {\n\t\t\tnextSongInSequence = 1 + sequenceInPlaylist;\n\t\t}\n\n\t\tconsole.log(nextSongInSequence);\n\t\t\n\t\tserverServices.getSongPath(queuePlaylist[sequenceInPlaylist], function (response) {\n\t\t\tif (response.error) return;\n\t\t\telse {\n\t\t\t\tsessionStorage.setItem(\"songInReproductionId\", queuePlaylist[sequenceInPlaylist]);\n\t\t\t\tsessionStorage.setItem(\"nextSongInSequence\", nextSongInSequence);\n\n\t\t\t\tvar audioTag = document.getElementById(\"reproductionSong\");\n\t\t\t\t// rimuovo la canzone attualmente in esecuzione, se c'è\n\t\t\t\tif (document.getElementById('songInReproduction')) {\n\t\t\t\t\taudioTag.removeChild(document.getElementById('songInReproduction'));\n\t\t\t\t}\n\t\t\t\tvar songInfoEl = document.getElementById(\"songInfo\");\n\t\t\t\tif (songInfoEl.firstChild) {\n\t\t\t\t\tsongInfoEl.removeChild(songInfoEl.firstChild);\n\t\t\t\t}\n\t\t\t\tvar songEl = document.createElement('source');\n\t\t\t\tsongEl.id = \"songInReproduction\";\n\t\t\t\tsongEl.type = \"audio/mpeg\";\t\n\t\t\t\tvar text = response.title + \" - \" + response.author;\n\t\t\t\tvar path = response.path;\n\t\t\t\tsongInfoEl.appendChild(document.createTextNode(text));\n\t\t\t\tsongEl.src = path;\n\t\t\t\taudioTag.appendChild(songEl);\n\t\t\t\taudioTag.load();\n\t\t\t\taudioTag.oncanplay = function (event) {event.preventDefault(); audioTag.play()};\n\t\t\t\taudioTag.onpause = function (event) {event.preventDefault(); saveSongContext(parseInt(sessionStorage.getItem(\"songInReproductionId\")), false);};\n\t\t\t\t/* Per fare in modo che finita la canzone attuale parta la successiva della playlist */\n\t\t\t\taudioTag.onended = function (event) {event.preventDefault(); playPlaylist(parseInt(sessionStorage.getItem(\"nextSongInSequence\")))};\n\t\t\t}\n\t\t})\n\t}","title":""},{"docid":"d4e5611b1d4dacce89f26e26c99c3ce9","score":"0.63387156","text":"async function listSongs() {\n const songs = await API.graphql(graphqlOperation(ListSongs))\n updateSongs(songs.data.listSongs.items)\n }","title":""},{"docid":"8ee2d0f03a0a33d9ad80ae8c34efb8ba","score":"0.62686175","text":"handleQueue(){\n this.props.GetQueue(this.props.data_be.data_be._id,this.props.token.token);\n this.props.handleCurrentPlayList(null);\n this.props.SetIsQueue(true);\n }","title":""},{"docid":"7209f876574ec43f8a07b52937010766","score":"0.62595564","text":"showSong(){\r\n\t\tvar div = this._div,\r\n\t\t\tsongs = this._songs,\r\n\t\t\taudio = this._audio;\r\n\t\tthis.msglog = ajaxRequest(this._id+'/songs', 'GET');\t\t\r\n\t\tthis.msglog = this.msglog.data.songs;\r\n\t\tfor( var i=0; i< this.msglog.length; i++){\r\n\t\t\tthis._arrSongs[i] = new Song(i, this.msglog[i].name, this.msglog[i].url, songs, audio);\t\t\t\r\n\t\t\tthis._arrSongs[i].toView();\r\n\t\t}\r\n\t\t//this._arrSongs[0].play();\r\n\t\t//arrPLlist[div.id].playSong(arrPLlist[div.id]._arrSongs[this.getAttribute(\"data-id\")].url, audio);\r\n\t\t//audio.src=this.msglog[0].url;\r\n\t}","title":""},{"docid":"8ef0cb33450e641604925fa95d18a5db","score":"0.621503","text":"function playNext() {\n if (songName != -1) {\n var i = 0;\n for (element of request) {\n if (element.nombre_cancion == songName) {\n break;\n } else {\n i++\n }\n }\n console.log(request[i + 1]);\n if (i < request.length - 1) {\n getSongData(request[i + 1]);\n player.loadVideoById(songKey);\n isPlaying = true;\n } else {\n getSongData(request[i]);\n player.loadVideoById(songKey);\n isPlaying = true;\n }\n } else {\n getSongData(request[i]);\n player.loadVideoById(songKey);\n isPlaying = true;\n }\n}","title":""},{"docid":"37d8865bf0db4beab696233bd818333f","score":"0.6213636","text":"function loadQueue() {\n showLoadingDialog();\n $.ajax({\n type: 'GET',\n url: '/getQueue',\n dataType: 'json',\n success: (data) => {\n // Queue has been loaded. Display the media items as a grid on screen.\n hideLoadingDialog();\n showPreview(data.parameters, data.photos);\n hideLoadingDialog();\n console.log('Loaded queue.');\n },\n error: (data) => {\n hideLoadingDialog();\n handleError('Could not load queue', data)\n }\n });\n}","title":""},{"docid":"da22c429edaa1be6b514fa8b7ca2f083","score":"0.6179073","text":"function songClick(id){\n\n var song = getSongFromId(id);\n var simpleSong = convertSong(song);\n var address= getExactAddress();\n\n console.log(JSON.stringify(simpleSong));\n\n //make sure its hidden at at the correct html render location\n document.getElementById('queue').style.visibility=\"visible\";\n\n //sent to the TBA que to be checked\n $.ajax({\n type: \"POST\",\n url: address+\"/queueSong\",\n contentType: \"application/Json\",\n data: JSON.stringify(simpleSong),\n success: function(response){\n console.log(\"sent to TBAqueue\");\n },\n error: function(jqXhr, textStatus, errorMessage){\n console.log(errorMessage);\n }\n });\n\n\n}","title":""},{"docid":"c2772a3e078ca09d85ff85c1a8c4ce0d","score":"0.61762756","text":"async play() {\n if (!this.stillThere || !this.queue.length) return this.PlayerShutdown()\n this.current = this.queue.shift()\n await this.player.playTrack(this.current.track);\n }","title":""},{"docid":"367b60e7bd01d7b0f9cf62893e6439af","score":"0.61721975","text":"async function song_() {\r\n\r\n //if no tracks found return info msg\r\n\r\n if (!res.tracks[0])\r\n return message.reply({embeds: [new MessageEmbed()\r\n .setColor(ee.wrongcolor)\r\n .setTitle(String(\"❌ Error | Found nothing for: **`\" + search).substr(0, 256 - 3) + \"`**\")\r\n .setDescription(eval(client.la[ls][\"handlers\"][\"playermanagers\"][\"request\"][\"variable1\"]))\r\n ]}).catch(e => console.log(String(e).grey.italic.dim));\r\n //create a player if not created\r\n\r\n //if the player is not connected, then connect and create things\r\n if (player.state !== \"CONNECTED\") {\r\n //set the variables\r\n player.set(\"message\", message);\r\n player.set(\"playerauthor\", message.author.id);\r\n player.connect();\r\n message.react(\"863876115584385074\").catch(e => console.log(String(e).grey.italic.dim));\r\n //add track\r\n player.queue.add(res.tracks[0]);\r\n //play track\r\n player.play();\r\n player.pause(false);\r\n } else if (!player.queue || !player.queue.current) {\r\n //add track\r\n player.queue.add(res.tracks[0]);\r\n //play track\r\n player.play();\r\n player.pause(false);\r\n }\r\n //otherwise\r\n else {\r\n //add track\r\n player.queue.add(res.tracks[0]);\r\n }\r\n }","title":""},{"docid":"aa65283fedcde3c38626bba6760bfcbe","score":"0.6115202","text":"function all() {\n var url = user_id == 'demo' ?\n \"/assets/demo-data/a-playlists.json\" :\n \"https://api.spotify.com/v1/users/\"+user_id+\"/playlists\";\n \n return query(url,\n new Resolver(function(data){\n this.deferred.notify(data);\n if (data.next) {\n send_ajax(data.next, this);\n } else {\n this.deferred.resolve();\n }\n }));\n }","title":""},{"docid":"e8f74c06df1b983911ccd2af01ead6af","score":"0.6035787","text":"function playSong(url, username){\n\t\tsocket.emit('playSong', {\n\t\t\tpath: url,\n\t\t\tartist: username\n\t\t});\n\t}","title":""},{"docid":"f6cb9c4eb2762dfebd61939784ea6cab","score":"0.60207254","text":"function startPlay() {\n // Listen for the click on the play button\n $(document).on('click', '.results .play-button', function () {\n // Get the video id\n var id = $(this).data('video-id'),\n // Get the object id\n objectId = $(this).data('object-id'),\n // Fetch the video object from the foundVideos array based on\n // the found id\n obj = foundVideos[objectId];\n\n // Create the song object\n currentSong = {\n 'position': count,\n 'videoId': id,\n 'title': obj['snippet']['title'],\n 'duration': convert_time(obj['contentDetails']['duration']),\n 'thumbnail': obj['snippet']['thumbnails']['high']['url']\n };\n\n // Start the song\n player.loadVideoById(id);\n\n // Set the bottom player equal to the current song\n displayCurrentSong();\n\n // If the queue is non-existent we have to display\n // suggestions based on the current song\n if (queue.length == 0 || queue.length < 1) {\n showSuggestions(id);\n }\n });\n}","title":""},{"docid":"ac417b5162c1bfb6ebb2a6073514dd77","score":"0.6019753","text":"function play(connection, message){\n\n\t\t\t\tvar server = servers[message.guild.id];\n\t\t\t\tvar server2 = played[message.guild.id];\n\n\t\t\t\tserver.dispatcher = connection.play(ytdl(server.queue[0], { filter: format => format.container === 'mp4' }));\n\n\t\t\t\t// Saving music on permanent history\n\t\t\t\tfs.appendFile('./history/played-musics.txt', server.queue[0].slice(0) + \"\\n\" , (err) => {\n \t\t\t\tif(err) throw err;\n \t\t\t\t});\n\n \t\t\t\t// Saving music on recent history\n\t\t\t\tserver2.queue.push(server.queue[0].slice(0));\n\n\t\t\t\t//remove a música que acabou de tocar da queue\n\t\t\t\tserver.queue.shift();\n\n\t\t\t\tserver.dispatcher.on(\"end\",function(){\n\t\t\t\t\tif(server.queue[0]){\n\t\t\t\t\t\tplay(connection, message);\n\t\t\t\t\t} else{\n\t\t\t\t\t\tconnection.disconnect();\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}","title":""},{"docid":"2b9e83be6358be3b649359e93087ccae","score":"0.6003361","text":"function sendPlay()\n{\n\tsocket.emit(\"play\");\n}","title":""},{"docid":"485191a20d80da9c98eae0d1b67e84d2","score":"0.5992443","text":"startPartyEventLoop() {\n let allParties = db['parties'].find();\n allParties.forEach((globParty) => {\n if (currentEventLoopParties[globParty.id] === undefined) {\n console.log(`[MUSIC] Starting party ${globParty.id}`);\n currentEventLoopParties[globParty.id] = setInterval(async () => {\n if (playerOutgoingSocket.length > 0) {\n let message = getMessageFromQueue();\n console.log(message);\n playerIO.to(message.partyId).emit(message.event, message.data);\n }\n\n if (frontOutgoingSocket.length > 0) {\n let message = getMessageFromFrontQueue();\n frontIO.to(message.partyId).emit(message.event, message.data);\n }\n\n try {\n let party = db['parties'].findOne({id: globParty.id});\n addMessageToFrontQueue(new Message(globParty.id, 'update', party));\n switch (party.state) {\n case 0: // currently playing\n if ((party.oldStatus === 0 || party.oldStatus === 1) && party.status === 1) {\n updatePartyState(party.id, 1);\n }\n break;\n case 1: // currently idle\n if (party.playlist.length > 0) {\n updatePartyState(party.id, 2);\n }\n break;\n case 2: // playing next song\n console.log('playing next song state');\n let song = party.playlist.shift();\n console.log({song});\n if (song) {\n db['parties'].update({\n id: party.id\n }, {\n playlist: party.playlist\n });\n console.log('emit the play event');\n db['parties'].update({\n id: party.id\n }, {\n currentlyPlaying: song\n });\n addMessageToQueue(new Message(party.id, 'play', {\n path: song.songUrl,\n mode: 'name'\n }));\n updatePartyState(party.id, 0);\n } else {\n updatePartyState(party.id, 1);\n }\n break;\n }\n updatePartyOldState(party.id);\n } catch (e) {\n console.error(`Error in the main party thread with party: ${globParty.id}`);\n console.log(e);\n }\n }, 500);\n }\n });\n }","title":""},{"docid":"38b8755a7f7d66d3b82e3d9d7859542d","score":"0.5984368","text":"function playSong(song, enqueueAll) {\n var filesToPlay = [];\n var toPlay = path.join(musicRootDir, song);\n if (!toPlay) {\n return;\n }\n var ls = null;\n try {\n ls = fs.lstatSync(toPlay);\n } catch (e) {}\n\n if (ls && ls.isDirectory()) {\n filesToPlay = utils.songsInDir(toPlay).map(function(song) {\n return path.join(toPlay, song);\n });\n if (!enqueueAll) {\n if (filesToPlay.length >= 1) {\n player.play(filesToPlay[0]);\n }\n if (filesToPlay.length >= 2) {\n player.enqueue(filesToPlay.slice(1));\n }\n currPlayIndex = 0;\n } else {\n player.enqueue(filesToPlay);\n }\n\n\n } else {\n if (toPlay) {\n filesToPlay = [toPlay];\n if (!enqueueAll) {\n currPlayIndex = 0;\n player.play(toPlay);\n } else {\n player.enqueue(toPlay);\n }\n }\n }\n\n var pl = filesToPlay.map(function(fileToPlay) {\n return { fileName: path.relative(musicRootDir, fileToPlay) };\n });\n if (!enqueueAll) {\n playlist = pl;\n currPlayIndex = 0;\n } else {\n playlist = playlist.concat(pl);\n }\n //get song info for existing files (not urls)\n if (ls) {\n player.getSongInfo(filesToPlay, function(result) {\n console.log(result);\n result.forEach(function(item) {\n item.fileName = path.relative(musicRootDir, item.fileName);\n });\n if (!enqueueAll) {\n playlist = result;\n } else {\n playlist = playlist.concat(result);\n }\n\n });\n }\n}","title":""},{"docid":"6b43ceaea677f27e8aa847d14b5194aa","score":"0.597619","text":"function listPlaylists() {\r\n return gapi.client.youtube.playlists.list({\r\n \"part\": \"snippet\",\r\n \"maxResults\": 50,\r\n \"mine\": true\r\n })\r\n .then(function(response) {\r\n // Handle the results here (response.result has the parsed body).\r\n console.log(\"Response\", response);\r\n\r\n let length = response.result.items.length;\r\n for(let i=0; i<length; i++){\r\n if(response.result.items[i].snippet.title === \"Queue\"){\r\n chrome.storage.sync.set({'playlistId': response.result.items[i].id});\r\n return;\r\n }\r\n }\r\n insertQueuePlaylist();\r\n },\r\n function(err) { console.error(\"Execute error\", err); });\r\n}","title":""},{"docid":"e5ccf533b333e6bc6f5d920151de2da9","score":"0.59649646","text":"addToQue(songUrl) {\n if (this.state.playArray.has(songUrl)) {\n this.state.playArray.get(songUrl).pause()\n this.state.playArray.delete(songUrl)\n console.log( \"Sound removed\",this.state.playArray)\n } else {\n this.state.playArray.set(songUrl,new Audio(songUrl))\n console.log(\"Sound added\",this.state.playArray)\n }\n }","title":""},{"docid":"fa982a7f3b9633f15335e4c8fb192730","score":"0.5959077","text":"function startPlayList() {\n\t\t//play first track\n\t\tif (_playList.length > 0) {\n\t\t\tplayTrackRow(_playList[0]);\n\t\t}\n\t}","title":""},{"docid":"cc9c508c7002ec1157addba7ceb68834","score":"0.59550816","text":"async function execute(message, serverQueue) {\n const args = message.content.split(' ');\n\n //Join voice channel if not already joined\n if(!serverQueue || serverQueue.afk) {\n if(!await join(message, serverQueue)) {\n //Something went wrong when joining voicechannel\n return false;\n }\n serverQueue = serverMap.get(message.guild.id);\n }\n //Store searching message for later editing/deletion\n let msg;\n\n //Let the user know we read the command\n message.channel.send(\"Searching...\").then((m) => {\n msg = m;\n });\n\n const request = message.content.substr(6).trim();\n let searchTerm = request;\n\n //Check if searchTerm is a link\n if(!request.includes(\"https://\")) {\n searchTerm = \"ytsearch:\" + searchTerm;\n }\n\n //Get song info from ytdl\n await getInfo(searchTerm).then((info) => {\n //Is true for playlists\n if(info.partial) {\n info.on('video', (v) => {\n //Create new song object\n const song = {\n title: v.title,\n url: v.webpage_url.toString(),\n };\n\n //Push song to queue\n serverQueue.songs.push(song);\n\n console.log(`Song added: ${song.title}`);\n console.log(song);\n\n //We are not already playing a song\n if(!serverQueue.playing) {\n try {\n //Play music\n console.log(\"Trying to play song\");\n play(message.guild, serverQueue.songs[0]);\n console.log(\"Executed play function\");\n serverQueue.playing = true;\n message.channel.send(`Now playing: ${serverQueue.songs[0].title}`);\n } catch (err) {\n serverQueue.playing = false;\n serverQueue.songs.clear();\n execute(message, serverQueue);\n }\n }\n\n if(msg != null) {\n msg.edit(`Adding songs to queue...`);\n } else {\n message.channel.send(`Adding songs to queue...`);\n }\n });\n info.on('done', () => {\n if(msg != null) {\n return msg.edit(`${info.items.length} songs added to queue`);\n } else {\n return message.channel.send(`${info.items.length} songs added to queue`);\n }\n })\n } else {\n //Single song\n //Create new song object\n const song = {\n title: info.items[0].title,\n url: info.items[0].webpage_url.toString(),\n };\n\n //Push song to queue\n serverQueue.songs.push(song);\n\n console.log(`Song added: ${song.title}`);\n console.log(song);\n\n //We are not already playing a song\n if(!serverQueue.playing) {\n try {\n //Play music\n play(message.guild, serverQueue.songs[0]);\n serverQueue.playing = true;\n } catch(err) {\n serverQueue.playing = false;\n serverQueue.songs.clear();\n execute(message, serverQueue);\n }\n if(msg != null) {\n msg.edit(`Now playing: ${serverQueue.songs[0].title}`);\n return true;\n } else {\n message.channel.send(`Now playing: ${serverQueue.songs[0].title}`);\n return true;\n }\n } else {\n if(msg != null) {\n msg.edit(`${song.title} added to queue`);\n return true;\n } else {\n message.channel.send(`${song.title} added to queue`);\n return true;\n }\n }\n }\n }).catch((err) => {\n console.log(err);\n if(msg != null) {\n msg.edit(`Could not find any song matching ${searchTerm}`);\n return false;\n } else {\n message.channel.send(`Could not find any song matching ${searchTerm}`);\n return false;\n }\n });\n return true;\n}","title":""},{"docid":"c7e1f16c708289ca0fee61558b8c25ec","score":"0.5953034","text":"function song(client, message, args, type) {\n var search, res, player, state, song_, playlist_;\n return regeneratorRuntime.async(function song$(_context3) {\n while (1) {\n switch (_context3.prev = _context3.next) {\n case 0:\n playlist_ = function _ref2() {\n var playlistembed;\n return regeneratorRuntime.async(function playlist_$(_context2) {\n while (1) {\n switch (_context2.prev = _context2.next) {\n case 0:\n if (res.tracks[0]) {\n _context2.next = 2;\n break;\n }\n\n return _context2.abrupt(\"return\", message.channel.send(new MessageEmbed().setColor(ee.wrongcolor).setFooter(ee.footertext, ee.footericon).setTitle(String(\"Found nothing for: **`\" + search).substr(0, 256 - 3) + \"`**\").setDescription(\"Please retry!\")));\n\n case 2:\n //if the player is not connected, then connect and create things\n if (player.state !== \"CONNECTED\") {\n //set the variables\n player.set(\"message\", message);\n player.set(\"playerauthor\", message.author.id);\n player.connect(); //add track\n\n player.queue.add(res.tracks); //play track\n\n player.play();\n player.pause(false);\n } else if (!player.queue || !player.queue.current) {\n //add track\n player.queue.add(res.tracks); //play track\n\n player.play();\n player.pause(false);\n } else {\n //add the tracks\n player.queue.add(res.tracks);\n } //send information\n\n\n playlistembed = new MessageEmbed().setTitle(\"Added Playlist \\uD83E\\uDE78 **`\".concat(res.playlist.name).substr(0, 256 - 3) + \"`**\").setURL(res.playlist.uri).setColor(ee.color).setFooter(ee.footertext, ee.footericon).setThumbnail(\"https://img.youtube.com/vi/\".concat(res.tracks[0].identifier, \"/mqdefault.jpg\")).addField(\"⌛ Duration: \", \"`\".concat(format(res.playlist.duration), \"`\"), true).addField(\"🔂 Queue length: \", \"`\".concat(player.queue.length, \" Songs`\"), true).setFooter(\"Requested by: \".concat(message.author.tag), message.author.displayAvatarURL({\n dynamic: true\n }));\n message.channel.send(playlistembed).then(function (msg) {\n if (msg) msg[\"delete\"]({\n timeout: 4000\n })[\"catch\"](function (e) {\n return console.log(\"couldn't delete message this is a catch to prevent a crash\".grey);\n });\n });\n\n case 5:\n case \"end\":\n return _context2.stop();\n }\n }\n });\n };\n\n song_ = function _ref() {\n var playembed;\n return regeneratorRuntime.async(function song_$(_context) {\n while (1) {\n switch (_context.prev = _context.next) {\n case 0:\n if (!(player.state !== \"CONNECTED\")) {\n _context.next = 9;\n break;\n }\n\n //set the variables\n player.set(\"message\", message);\n player.set(\"playerauthor\", message.author.id); //connect\n\n player.connect(); //add track\n\n player.queue.add(res.tracks[0]); //play track\n\n player.play();\n player.pause(false);\n _context.next = 18;\n break;\n\n case 9:\n if (!(!player.queue || !player.queue.current)) {\n _context.next = 15;\n break;\n }\n\n //add track\n player.queue.add(res.tracks[0]); //play track\n\n player.play();\n player.pause(false);\n _context.next = 18;\n break;\n\n case 15:\n //add the latest track\n player.queue.add(res.tracks[0]); //send track information\n\n playembed = new MessageEmbed().setTitle(\"Added to Queue \\uD83E\\uDE78 **`\".concat(res.tracks[0].title).substr(0, 256 - 3) + \"`**\").setURL(res.tracks[0].uri).setColor(ee.color).setFooter(ee.footertext, ee.footericon).setThumbnail(\"https://img.youtube.com/vi/\".concat(res.tracks[0].identifier, \"/mqdefault.jpg\")).addField(\"⌛ Duration: \", \"`\".concat(res.tracks[0].isStream ? \"LIVE STREAM\" : format(res.tracks[0].duration), \"`\"), true).addField(\"💯 Song By: \", \"`\".concat(res.tracks[0].author, \"`\"), true).addField(\"🔂 Queue length: \", \"`\".concat(player.queue.length, \" Songs`\"), true).setFooter(\"Requested by: \".concat(res.tracks[0].requester.tag), res.tracks[0].requester.displayAvatarURL({\n dynamic: true\n }));\n return _context.abrupt(\"return\", message.channel.send(playembed).then(function (msg) {\n if (msg) msg[\"delete\"]({\n timeout: 4000\n })[\"catch\"](function (e) {\n return console.log(\"couldn't delete message this is a catch to prevent a crash\".grey);\n });\n }));\n\n case 18:\n case \"end\":\n return _context.stop();\n }\n }\n });\n };\n\n search = args.join(\" \");\n player = client.manager.players.get(message.guild.id);\n\n if (player) {\n _context3.next = 8;\n break;\n }\n\n if (message.member.voice.channel) {\n _context3.next = 7;\n break;\n }\n\n throw \"NOT IN A VC\";\n\n case 7:\n player = client.manager.create({\n guild: message.guild.id,\n voiceChannel: message.member.voice.channel.id,\n textChannel: message.channel.id,\n selfDeafen: config.settings.selfDeaf\n });\n\n case 8:\n state = player.state;\n\n if (state !== \"CONNECTED\") {\n //set the variables\n player.set(\"message\", message);\n player.set(\"playerauthor\", message.author.id);\n player.connect();\n player.stop();\n }\n\n _context3.prev = 10;\n\n if (!(type.split(\":\")[1] === \"youtube\" || type.split(\":\")[1] === \"soundcloud\")) {\n _context3.next = 17;\n break;\n }\n\n _context3.next = 14;\n return regeneratorRuntime.awrap(client.manager.search({\n query: search,\n source: type.split(\":\")[1]\n }, message.author));\n\n case 14:\n res = _context3.sent;\n _context3.next = 20;\n break;\n\n case 17:\n _context3.next = 19;\n return regeneratorRuntime.awrap(client.manager.search(search, message.author));\n\n case 19:\n res = _context3.sent;\n\n case 20:\n if (!(res.loadType === \"LOAD_FAILED\")) {\n _context3.next = 24;\n break;\n }\n\n throw res.exception;\n\n case 24:\n if (res.loadType === \"PLAYLIST_LOADED\") {\n playlist_();\n } else {\n song_();\n }\n\n case 25:\n _context3.next = 31;\n break;\n\n case 27:\n _context3.prev = 27;\n _context3.t0 = _context3[\"catch\"](10);\n console.log(String(_context3.t0.stack).red);\n return _context3.abrupt(\"return\", message.channel.send(new MessageEmbed().setColor(ee.wrongcolor).setFooter(ee.footertext, ee.footericon).setTitle(\"There was an error while searching:\").setDescription(\"```\".concat(_context3.t0.message, \"```\"))));\n\n case 31:\n if (res.tracks[0]) {\n _context3.next = 33;\n break;\n }\n\n return _context3.abrupt(\"return\", message.channel.send(new MessageEmbed().setColor(ee.wrongcolor).setFooter(ee.footertext, ee.footericon).setTitle(String(\"Found nothing for: **`\" + search).substr(0, 256 - 3) + \"`**\").setDescription(\"Please retry!\")));\n\n case 33:\n case \"end\":\n return _context3.stop();\n }\n }\n }, null, null, [[10, 27]]);\n}","title":""},{"docid":"1ed43eee33ab9d2f7974d21b20b28a60","score":"0.5936916","text":"function syncUserSong() {\n $.get(\"/musicify/sync-user-song/\"+host)\n .done(function(data) {\n var audioPlayer = $(\"#id-music-player\");\n var currentSong = audioPlayer[0];\n\n // The song only plays when the user is in his channel\n if (data.track_id !== '' && !isUserLeftChannel && parseInt(data.start_time) <= parseInt(data.length)){\n $('#id-loading').hide();\n $('#id-waiting-content').hide();\n $('#id-not-live-icon').hide();\n $('#id-live-icon').show();\n $(\"#id-page-content\").show();\n $(\"#messaging-content\").removeClass('col-md').addClass('col-md-6');\n if (current_track_id !== data.track_id){\n $(\"#id-cover\").attr(\"src\", data.cover);\n $(\"#id-name\").text(parseHtmlEnteties(data.name));\n $(\"#id-artist\").text(parseHtmlEnteties(data.artist));\n $(\"#id-track\").val(data.track_id);\n current_track_id = data.track_id;\n $(\"#id-page-content\").show();\n start_time = parseInt(data.start_time);\n\n // Play song from current data\n audioPlayer.attr(\"src\", data.preview);\n currentSong.currentTime = data.start_time;\n }\n\n if (data.status !== 'Playing' && currentSong.played){\n currentSong.pause();\n } else if (data.status === 'Playing' && currentSong.paused) {\n // Use this to avoid the race condition between play() and pause()\n setTimeout(function () {\n currentSong.play();\n }, 150);\n }\n } else { // User NOT in their channel:\n $('#id-loading').show();\n $(\"#id-page-content\").hide();\n $(\"#messaging-content\").removeClass('col-md-6').addClass('col-md');\n $('#id-waiting-content').show();\n $('#id-not-live-icon').show();\n $('#id-live-icon').hide();\n if (currentSong.played){\n currentSong.pause();\n }\n }\n })\n}","title":""},{"docid":"c4ae5f5d871356ea76cb5f232b172fd5","score":"0.59364337","text":"async function playsongyes(message, queue, song) {\n const emojiList = {\n PlayPause: \"851372996660428824\",\n Next: \"851372996023418902\",\n Backward: \"851372995779887126\",\n Forward: \"851372995518791710\",\n Stop: \"851372996051861504\",\n Loop: \"851372997000429589\",\n Queue: \"851372999684915200\",\n VolumeUp: \"851372997763399720\",\n VolumeDown: \"851372997678989312\",\n Refresh: \"851377294739374091\",\n };\n playingMessage;\n try {\n let isPaused = await client.distube.isPaused(message);\n let embed1 = new Discord.MessageEmbed()\n .setColor(\"#0099ff\")\n .setTitle(isPaused ? \"Paused\" : \"Now Playing\")\n .setDescription(\n `Playing ${song.name}\\nDuration: **${\n song.formattedDuration\n }**\\nDuration ${queue.formattedCurrentTime} / ${\n song.formattedDuration\n }\\nRequested by: ${song.user}\\nAutoplay: ${\n queue.autoplay ? \"✅\" : \"❌\"\n }\\nVolume: ${queue.volume}%\\n Loop: ${\n queue.repeatMode\n ? queue.repeatMode === 2\n ? \"✅ Queue\"\n : \"✅ Song\"\n : \"Off\"\n }\\nFilter: ${queue.filter || \"❌\"}`\n )\n .setFooter(\n message.author.tag,\n message.member.user.displayAvatarURL({ dynamic: true })\n )\n .setThumbnail(song.thumbnail);\n var playingMessage = await message.channel.send(embed1);\n try {\n await playingMessage.react(emojiList.Stop);\n await playingMessage.react(emojiList.Next);\n await playingMessage.react(emojiList.PlayPause);\n await playingMessage.react(emojiList.Backward);\n await playingMessage.react(emojiList.Forward);\n await playingMessage.react(emojiList.VolumeDown);\n await playingMessage.react(emojiList.VolumeUp);\n await playingMessage.react(emojiList.Loop);\n await playingMessage.react(emojiList.Queue);\n await playingMessage.react(emojiList.Refresh);\n } catch (error) {\n message.reply(\"Missing permissions, i need to add reactions!\");\n console.log(error);\n }\n const emojiName = {\n PlayPause: client.emojis.cache.get(emojiList.PlayPause).name,\n Next: client.emojis.cache.get(emojiList.Next).name,\n Backward: client.emojis.cache.get(emojiList.Backward).name,\n Forward: client.emojis.cache.get(emojiList.Forward).name,\n Stop: client.emojis.cache.get(emojiList.Stop).name,\n Loop: client.emojis.cache.get(emojiList.Loop).name,\n Queue: client.emojis.cache.get(emojiList.Queue).name,\n VolumeUp: client.emojis.cache.get(emojiList.VolumeUp).name,\n VolumeDown: client.emojis.cache.get(emojiList.VolumeDown).name,\n Refresh: client.emojis.cache.get(emojiList.Refresh).name,\n };\n const filter = (reaction, user) =>\n [emojiName] && user.id !== message.client.user.id;\n var collector = playingMessage.createReactionCollector(filter, {\n time: song.duration > 0 ? song.duration * 1000 : 600000,\n });\n collector.on(\"collect\", async (reaction, user) => {\n let isPaused = await client.distube.isPaused(message);\n let queue = await client.distube.getQueue(message);\n if (!message.member.voice.channel) {\n reaction.users.remove(user).catch(console.error);\n return message.channel.send(\n \"You must be in a voice channel to use the reaction commands.\"\n );\n }\n if (!queue) return;\n const member = message.guild.member(user);\n if (\n member.voice.connection &&\n member.voice.connection !== member.guild.me.voice.connection\n )\n return;\n\n switch (reaction.emoji.name) {\n case emojiName.Next:\n client.distube.skip(message);\n embedbuilder(\n client,\n message,\n \"#0099ff8\",\n \"SKIPPED!\",\n `Skipped the song`\n ).then((message) =>\n message.delete({ timeout: 3000 }).catch(console.error)\n );\n playingMessage.reactions.removeAll().catch(console.error);\n break;\n\n case emojiName.Stop:\n client.distube.stop(message);\n const stopEmbed = new Discord.MessageEmbed()\n .setColor(\"#0099ff\")\n .setTitle(\"STOPPED\")\n .setDescription(\"Thanks for using the bot bye! byee!👋\");\n message.channel.send(stopEmbed);\n playingMessage.reactions.removeAll().catch(console.error);\n break;\n\n case emojiName.VolumeDown:\n reaction.users.remove(user).catch(console.error);\n await client.distube.setVolume(message, Number(queue.volume) - 10);\n embedbuilder(\n client,\n message,\n \"#0099ff\",\n \"Volume!\",\n `Redused the Volume to \\`${queue.volume}\\``\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\n await playingMessage.edit(curembed(message)).catch(console.error);\n break;\n\n case emojiName.VolumeUp:\n reaction.users.remove(user).catch(console.error);\n await client.distube.setVolume(message, Number(queue.volume) + 10);\n embedbuilder(\n client,\n message,\n \"#0099ff\",\n \"Volume!\",\n `Raised the Volume to \\`${queue.volume}\\``\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\n await playingMessage.edit(curembed(message)).catch(console.error);\n break;\n\n case emojiName.Backward:\n reaction.users.remove(user).catch(console.error);\n let seektime = queue.currentTime - 10000;\n if (seektime < 0) seektime = 0;\n await client.distube.seek(message, Number(seektime));\n playingMessage.edit(curembed(message)).catch(console.error);\n embedbuilder(\n client,\n message,\n \"#0099ff\",\n \"Seeked!\",\n `Seeked the song for \\`-10 seconds\\``\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\n\n break;\n\n case emojiName.Forward:\n reaction.users.remove(user).catch(console.error);\n let seektime2 = queue.currentTime + 10000;\n if (seektime2 >= queue.songs[0].duration * 1000) {\n seektime2 = queue.songs[0].duration * 1000 - 1;\n }\n console.log(seektime2);\n await client.distube.seek(message, seektime2);\n playingMessage.edit(curembed(message)).catch(console.error);\n embedbuilder(\n client,\n message,\n \"#0099ff\",\n \"Seeked!\",\n `Seeked the song for \\`+10 seconds\\``\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\n break;\n case emojiName.PlayPause:\n reaction.users.remove(user).catch(console.error);\n if (isPaused) {\n client.distube.resume(message, queue);\n } else if (!isPaused) {\n client.distube.pause(message, queue);\n }\n playingMessage.edit(curembed(message)).catch(console.error);\n embedbuilder(\n client,\n message,\n \"#0099ff\",\n isPaused ? \"Resume\" : \"Paused\",\n `The music was ${isPaused ? \"resume\" : \"paused\"}`\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\n break;\n case emojiName.Queue:\n reaction.users.remove(user).catch(console.error);\n let currentPage = 0;\n if (!queue)\n return embedbuilder(\n client,\n message,\n \"RED\",\n \"There is nothing playing!\"\n ).then((msg) => msg.delete({ timeout: 5000 }).catch(console.error));\n\n const embeds = QueueEmbed(queue.songs);\n const queueEmbed = await message.channel.send(\n `\n **Current Page - ${currentPage + 1}/${embeds.length}**`,\n embeds[currentPage]\n );\n try {\n await queueEmbed.react(\"⬅️\");\n await queueEmbed.react(\"⏹\");\n await queueEmbed.react(\"➡️\");\n } catch (error) {\n console.error(error);\n }\n const filter = (reaction, user) =>\n [\"⬅️\", \"⏹\", \"➡️\"].includes(reaction.emoji.name) &&\n message.author.id === user.id;\n const collector = queueEmbed.createReactionCollector(filter, {\n time: 60000,\n });\n collector.on(\"collect\", async (reaction, user) => {\n try {\n if (reaction.emoji.name === \"➡️\") {\n if (currentPage < embeds.length - 1) {\n currentPage++;\n queueEmbed.edit(\n `**Current Page - ${currentPage + 1}/${embeds.length}**`,\n embeds[currentPage]\n );\n }\n } else if (reaction.emoji.name === \"⬅️\") {\n if (currentPage !== 0) {\n --currentPage;\n queueEmbed.edit(\n `**Current Page - ${currentPage + 1}/${embeds.length}**`,\n embeds[currentPage]\n );\n }\n } else {\n collector.stop();\n reaction.message.reactions.removeAll();\n }\n await reaction.users.remove(message.author.id);\n } catch (error) {\n console.error(error);\n }\n });\n break;\n\n case emojiName.Loop:\n client.distube.setRepeatMode(message);\n playingMessage.edit(curembed(message)).catch(console.error);\n embedbuilder(\n client,\n message,\n \"#0099ff\",\n `Loop ${\n queue.repeatMode\n ? queue.repeatMode === 2\n ? \"✅ Queue\"\n : \"✅ Song\"\n : \"Off\"\n }`,\n `Loop: ${\n queue.repeatMode\n ? queue.repeatMode === 2\n ? \"✅ Queue\"\n : \"✅ Song\"\n : \"Off\"\n }`\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\n await reaction.users.remove(message.author.id);\n break;\n case emojiName.Refresh:\n reaction.users.remove(user).catch(console.error);\n playingMessage.edit(curembed(message)).catch(console.error);\n await reaction.users.remove(message.author.id);\n break;\n default:\n reaction.users.remove(user).catch(console.error);\n break;\n }\n });\n collector.on(\"end\", () => {\n playingMessage.reactions.removeAll().catch(console.error);\n });\n } catch (error) {\n console.log(error);\n }\n}","title":""},{"docid":"d81db74c0eef0ba65707e91c65005c51","score":"0.59339184","text":"function getSongs() {\n $.ajax({\n type: 'GET',\n url: '/songs',\n success: function(data) {\n $('#song-list').empty();\n // append each song to the DOM\n data.forEach(function(song, i) {\n appendDOM(song);\n });\n }\n });\n }","title":""},{"docid":"e13c8b61078c4368397109ea7df6c35a","score":"0.59332544","text":"function playQueue(position) {\n //If empty queue, just return\n if (localStorage.getItem(\"length\") === null) {\n return;\n }\n\n //If top title doesn't exist insert it\n if(!$('#top-search-form').length) {\n insertTopSearchBar();\n $(\"#ppQueue\").empty();\n $(\"#ppQueue\").append(\"<button onclick='pauseQueue(0)'><i class='fa fa-pause'></i></button>\");\n }\n\n //Gets top of list on queue\n var found = false;\n var i = position;\n\n // Continues to find the next song that is available closest to the position\n while (!found) {\n //At the end of length\n if(i == parseInt(localStorage.getItem('length')) && loop == false) {\n closeAllVideo();\n $(\"#ppQueue\").empty();\n $(\"#ppQueue\").append(\"<button onclick='playQueue(0)'><i class='fa fa-play'></i></button>\");\n return;\n }\n else if (i == parseInt(localStorage.getItem('length')) && loop == true) {\n playQueue(0);\n return;\n }\n\n if (localStorage.getItem(i.toString()) != null) {\n found = true; \n // Highlights the song on the queue bar\n $('#li' + i).css('background-color','#71B500');\n $('#li' + i + ' button').css('background-color','#71B500');\n // Set the position to the song currently playing position\n setCurrentPosition(i.toString());\n // Go to displaying song if youtube or soundcloud\n displayVideoOrTrack(localStorage.getItem(i.toString())); \n }\n ++i;\n }\n}","title":""},{"docid":"e11972240dfe87e208a5b82241d4cf4d","score":"0.5924375","text":"youtubePlayer (msg) {\r\n msg.member.voiceChannel.join()\r\n .then(connection => {\r\n ytSearch(musicQue.playList[0])\r\n .then((data) => {\r\n const stream = ytdl(data.link, { filter: 'audioonly' });\r\n const dispatcher = connection.playStream(stream);\r\n dispatcher.on('end', () => {\r\n if (musicQue.playList[1]) {\r\n musicQue.playList.shift();\r\n msg.say('Now playing ' + musicQue.playList[0])\r\n this.youtubePlayer(msg)\r\n } else {\r\n msg.member.voiceChannel.leave(),\r\n musicQue.playList.shift()\r\n }\r\n })\r\n })\r\n })\r\n }","title":""},{"docid":"7be7de194b93e05ace6d0bff04e8d361","score":"0.5916247","text":"function playNowFromQueue() {\n // Listen for a click\n $(document).on('click', '.video-queue .play-now', function () {\n // Fetch the passed video id\n var videoId = $(this).data('video-id');\n // Fetch the position of the chosen song\n var position = $(this).data('position');\n\n // Remove the clicked element\n $('#' + position).remove();\n\n // If the queue is empty\n if (queue.length == 0 || queue.length < 1) {\n // We need to build the currentSong from the suggestions list\n currentSong = {\n 'position': position,\n 'videoId': videoId,\n 'title': suggestions[position]['snippet']['title'],\n 'duration': convert_time(suggestions[position]['contentDetails']['duration']),\n 'thumbnail': suggestions[position]['snippet']['thumbnails']['high']['url']\n };\n // If there is a queue\n } else {\n // Get the song from the queue list based on it's position\n currentSong = findElement(queue, 'position', position);\n\n // Start the video\n player.loadVideoById(currentSong['videoId']);\n\n // If the previous song was in queue\n if (findElement(queue, 'videoId', currentSong['videoId']) !== 'undefined') {\n // Remove it\n findAndRemove(queue, 'videoId', currentSong['videoId']);\n }\n\n // Show suggestions based on the new song\n showSuggestions(videoId);\n }\n\n // Show suggestions based on the new song\n showSuggestions(currentSong['videoId']);\n // Start the new song\n player.loadVideoById(currentSong['videoId']);\n // Display the song information in the bottom tray\n displayCurrentSong();\n });\n}","title":""},{"docid":"d1fc5c3154fa802869630bc1956f740d","score":"0.59047335","text":"function sendQueue() {\n\tfor (var i = 0; i < queue.length; ++i) {\n\t\tvar record = queue[i];\n\t\tfetch('/api/v1/records', {\n\t\t\tmethod: 'POST', // *GET, POST, PUT, DELETE, etc.\n\t\t\tmode: 'same-origin', // no-cors, *cors, same-origin\n\t\t\tcache: 'no-cache', // *default, no-cache, reload, force-cache, only-if-cached\n\t\t\tcredentials: 'same-origin', // include, *same-origin, omit\n\t\t\theaders: {\n\t\t\t\t// 'Content-Type': 'application/json'\n\t\t\t\t// 'Content-Type': 'application/x-www-form-urlencoded',\n\t\t\t\t'Content-Type': 'application/vnd.api+json'\n\t\t\t},\n\t\t\tredirect: 'follow', // manual, *follow, error\n\t\t\treferrerPolicy: 'no-referrer', // no-referrer, *no-referrer-when-downgrade, origin, origin-when-cross-origin, same-origin, strict-origin, strict-origin-when-cross-origin, unsafe-url\n\t\t\tbody: JSON.stringify({\n\t\t\t\tdata: {\n\t\t\t\t\ttype: 'records',\n\t\t\t\t\tattributes: {\n\t\t\t\t\t\tgeohash: record.hash,\n\t\t\t\t\t\thits: record.hits,\n\t\t\t\t\t\treaction: record.type\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}) // body data type must match \"Content-Type\" header\n\t\t}).then((response) => {\n\t\t\treturn response.json();\n\t\t}).then((data) => {\n\t\t\tconsole.log(data);\n\t\t});\n\t}\n}","title":""},{"docid":"3f53c520cd3bb04a9d2deedfa059e52a","score":"0.58983886","text":"async function Start() {\n var temp = await getAllSoundtracks();\n temp = globalSongs;\n request = temp;\n}","title":""},{"docid":"b486325a4bdb0f565d9b74eca00c54fe","score":"0.58809793","text":"function updateUserQueue(updated_queue) {\n queue = updated_queue[getCookie(\"user_id\")];\n console.log(\"Updating user queue!\");\n document.getElementById(\"userQueue\").innerHTML = \"\";\n for (let song of queue) {\n var songInfo = song[0];\n // Note: songInfo[0] is song URI\n var albumImg = song[1];\n var queueImg = document.createElement(\"img\");\n queueImg.src = albumImg;\n queueImg.style.width = \"100%\";\n document.getElementById(\"userQueue\").appendChild(queueImg);\n }\n}","title":""},{"docid":"eb5ec7a6d6ee9d63e57a8d9952c2ad45","score":"0.5866461","text":"function refreshSongList() {\r\n masterGame = $('#game').val();\r\n masterSongList = [];\r\n utils_socket.emit('game', gameDict[masterGame]);\r\n}","title":""},{"docid":"a632e4de63cc102e54d4a678d9b9fe81","score":"0.5863859","text":"function playsong() {\n\t$('.play_song_class').click(function() {\n\t\tvar song_id = $(this).data('song');\n\t\tvar song_name = $(this).data('song_name');\n\t\tvar artist_name = $(this).data('artist_name');\n\t\tvar artist_id = $(this).data('artist_id');\n\t\tvar album_id = $(this).data('album_id');\n\t\tvar cover = $(this).data('cover');\n\n\t\t// set jquery sessions for playbar\n\t\t$.session.set('song_id', song_id);\n\t\t$.session.set('song_name', song_name);\n\t\t$.session.set('artist_name', artist_name);\n\t\t$.session.set('artist_id', artist_id);\n\t\t$.session.set('album_id', album_id);\n\t\t$.session.set('cover', cover);\n\n\t\t// add 1 play\n\t\t$.ajax({\n\t\t\turl: 'classes/class.artist.php',\n\t\t\ttype: \"POST\",\n\t\t\tdata: {\n\t\t\t\tsong_id: song_id,\n\t\t\t\taction: 'add_play',\n\t\t\t},\n\t\t\tsuccess: function(response) {\n\t\t\t\tconsole.log(response);\n\t\t\t}\n\t\t});\n\n\t\t// load playbar again for setting new song data\n\t\t$('#playbar_wrapper_loader').load('includes/playbar.php');\n\t\tsetTimeout(function(){\n\t\t\t$('#play-btn').trigger('click');\n\t\t}, 300);\n\t});\n}","title":""},{"docid":"49136c7384c0910a6889faaa183a4963","score":"0.58592504","text":"componentDidMount() {\n this.socket = io();\n let that = this;\n $.ajax({\n method: 'GET',\n url: \"http://192.168.1.19:3000/songQueue\",\n contentType: 'application/json',\n dataTyle: 'json',\n success: data => {\n that.setState({\n firstSong: data.shift(),\n songInfo: data\n });\n // listen for playSong emit events\n this.socket.on('playSong', this.handleServerPlayEvent);\n }\n });\n }","title":""},{"docid":"55b3df5cab1b0fd8a5760a462feb9545","score":"0.5851971","text":"function loadSongs() {\n API.getSongs()\n .then((res) => setSongs(res.data))\n .catch((err) => console.log(err));\n }","title":""},{"docid":"5b8c0f59737e1e7ac0e9de9a96debbfa","score":"0.584566","text":"function refreshPlayList () {\n\t\tplayList = []\t\t\n\t\tvar trs = $('#tabla_usuario tr')\n\t\ttrs.each(function() {\n\t\t\tvar nombre = $(this).find('.nombre_de_cancion a').attr('data-nombre')\n\t\t\tvar mp3 = $(this).find('.nombre_de_cancion a').attr('data-url')\n\t\t\tvar item_id = $(this).attr('id')\n\t\t\tplayList.push({ nombre: nombre, mp3: mp3, item_id: item_id })\t\t\t\t\n\t\t})\t\n\t\tif (playList.length == 1) {\t\t\t\n\t\t\t$('#jquery_jplayer_1').jPlayer(\"setMedia\", {\n\t \tmp3: playList[0].mp3\n \t\t})\n \t\t$(\"#jquery_jplayer_1\").jPlayer(\"play\"); \n\t\t $('.jp-title ul li').text(playList[0].nombre)\n\t\t} \t\t\t\t\t\n\t}","title":""},{"docid":"e1c6c1ea7f9752c049d6eec398ae5514","score":"0.5840909","text":"async function songClicked($this) {\n\tconsole.log('songClicked');\n\t// update the current song\n\tawait updateSong($this);\n\t// render the room\n\trenderRoom();\n}","title":""},{"docid":"bd8e2a4ee3f4c28a26d0fae0c11bf143","score":"0.58402884","text":"getAllSounds() {\n this.get('api').request('getAllSounds');\n }","title":""},{"docid":"c3dbedfa0a14a74ee46c58cd102499a5","score":"0.58387405","text":"function songs(){\n const spotify = new Spotify({\n id: keys.spotify.id,\n secret: keys.spotify.secret\n });\n \n spotify.search({ type: \"track\", query: info }, function(err, data) {\n if (!err) {\n for(var i = 0; i < data.tracks.items.length; i++){\n var songData = data.tracks.items[i];\n //artist\n console.log(\"Artist: \" + songData.artists[0].name);\n //song name\n console.log(\"Song: \" + songData.name);\n //spotify preview link\n console.log(\"Preview URL: \" + songData.preview_url);\n //album name\n console.log(\"Album: \" + songData.album.name);\n console.log(\"------------------------------------------------------------------------------\");\n }\n }\n else{\n console.log('Error occurred.');\n }\n \n });\n \n }","title":""},{"docid":"ea41e0a8cefa004a2d1de2a71dbbbdb8","score":"0.58370084","text":"function play(connection, message) {\n var server = servers[message.guild.id];\n // Download link to YT video, and plays it\n // Filter out the video to save bandwidth\n server.dispatcher = connection.playStream(ytdl(server.queue[0], {filter: \"audioonly\"}));\n server.queue.shift();\n server.dispatcher.on(\"end\", function() {\n // If there is another song to play in the queue\n if (server.queue[0]) {\n play(connection, message);\n } else {\n connection.disconnect();\n }\n });\n\n }","title":""},{"docid":"a5352eb6566128cb50c3943a21b0d32e","score":"0.58366114","text":"function requestPlay(i){\n ipcRenderer.send('playRequest', i);\n ipcRenderer.on('toPlay', (event, file) => {\n\tconsole.log('voy a intentar reproducir a ver que pasa');\n\t//file.appendTo('body');\n })\n}","title":""},{"docid":"b15474c1fb31bc8d854b1a78e24e2621","score":"0.58319867","text":"function index (req, res, next) {\n Playlist.find({ owner: req.decoded._id}, {songs: 0}, function(err, playlists){\n if (err) return console.log(err)\n\n res.json(playlists);\n })\n}","title":""},{"docid":"33704cd22264f6a568b5cf02449fc6ab","score":"0.5826362","text":"function getPlayingSong(req,res,next){\n\tvar query = \"SELECT title,artist,album,nsurl FROM users u, currentSongs c WHERE c.clientID='\" + req.params.clientID + \"' and c.clientID = u.clientID;\";\t\n\tconsole.log(query);\t\n\tconnection.query(query, function(err, results) {\n if(err) res.send(400);\n res.send(results);\n next();\n \t});\n}","title":""},{"docid":"d75bdba9a35a54518efb816de0e93ba3","score":"0.5824579","text":"playSong() {\n const { track } = this.props;\n if (track) {\n // update the song to show as playing so the list will not\n // reorder and move this item\n Meteor.collection('tracks').update(track._id, {\n $set: {\n playing: true,\n },\n });\n if (this.state.initialized) {\n fade(true);\n SpotifyAuth.playURI(track.uri, () => {\n setPlaying(track.uri);\n this.startPlayBackPositionTimer();\n });\n }\n }\n }","title":""},{"docid":"3176ba659db5a14de84ef78291bffd85","score":"0.5820786","text":"async function execute(message, serverQueue) {\n const args = message.content.split(' ');\n const voiceChannel = message.member.voiceChannel;\n if(!voiceChannel) return message.channel.send('You need to be in a voice channel to play music!');\n const permissions = voiceChannel.permissionsFor(message.client.user);\n if(!permissions.has('CONNECT') || !permissions.has('SPEAK')) {\n return message.channel.send('I need the permissions to join and speak in your voice channel!')\n }\n\n //get song info and save into a song object\n const songInfo = await ytdl.getInfo(args[2])\n const song = {\n title: songInfo.title,\n url: songInfo.video_url,\n };\n\n //create a contract we can add to our queue\n if(!serverQueue) {\n const queueContruct = {\n textChannel: message.channel,\n voiceChannel: voiceChannel,\n connection: null,\n songs: [],\n volume: 5,\n playing: true,\n };\n\n queue.set(message.guild.id, queueContruct);\n\n queueContruct.songs.push(song);\n\n try {\n var connection = await voiceChannel.join();\n queueContruct.connection = connection;\n play(message.guild, queueContruct.songs[0]);\n } catch (err) {\n console.log(err);\n queue.delete(message.guild.id);\n return message.channel.send(err);\n }\n }\n else {\n serverQueue.songs.push(song);\n console.log(serverQueue.song);\n return message.channel.send(`${song.title} has been added to the queue!`);\n }\n\n}//end execute","title":""},{"docid":"192e2d4af15a6e70fe176f254b0cff64","score":"0.5820023","text":"function getMusic() {\r\n var artist = document.getElementById('artist').value;\r\n itunes.getMusicByArtist(artist).then(drawSongs);\r\n}","title":""},{"docid":"ba3d58f7f52f953e6caeab08d0967169","score":"0.58180237","text":"async function getSongs (req,res){\n try{\n var songs = await controller.findAllSongs();\n res.status(200).send(songs);\n }\n catch(e){\n res.status(500).send('hubo un error al mostrar la lista de canciones' + e);\n }\n}","title":""},{"docid":"60a68988a5a00c67a4413e29ba5e16db","score":"0.58156514","text":"function playSong(id) {\n //Stop the sound from playing\n\t\n soundManager.destroySound(mySound);\n\t\n\t//console.log('playing song id => '+ id);\n //If we're under, just go to the end!\n if (id < 0)\n id = songs.length - 1;\n \n //If we're over, choose what to do via the repeat flag\n if (id >= songs.length)\n id = 0;\n \n //Save some variables\n playingSongId = id;\n playingSong = songs[playingSongId];\n\tsetCoverart(playingSong.visual);\n //Toggle the pause\n setPauseState(soundManager.togglePause(mySound).paused);\n \n var track_url = playingSong.filepath.replace('/home/galizur/public_html/', 'http://www.galizur.com/'); \n $.post('http://www.galizur.com/home/mobile/update_play', {myid : playingSong.myid}, 'activate', 'jsonp');\n //Create the sound and begin playing whenever!\n \n soundManager.setup({\n\t\turl :'swf/',useHTML5Audio: true,\n\t\tpreferFlash: true,\n\t\tonready: function() {\n // SM2 has started - now you can create and play sounds!\n soundManager.createSound({\n id: mySound,\n url: track_url,\n autoPlay: true,\n stream: true,\n onplay: function () {\n setPlayingInfo(playingSong.basename);\n setPauseState(false);\n setPlayTime();\n\t\t\t\t\t\t//playerFooter.prepend($('<div>'+playingSong.basename+'</div>')).fadeIn('Slow');\n playerFooter.html('<div>'+playingSong.basename+'</div>').fadeIn('Slow');\n\n },\n onfinish: function() {\n //We'll only continue if we're shuffling or repeating if we past the end...\n if (shuffle == false && (playingSongId + 1 >= songs.length) && repeat == false) {\n //No more songs...\n setPlayingInfo();\n setPauseState(false);\n setPlayTime();\n playingSong = null;\n playingSongId = null;\n return;\n }\n else {\n playNextSong();\n }\n },\n onload: function () {\n playingSong.duration = this.duration / 1000;\n },\n whileplaying: function () {\n setPlayTime(this.position / 1000, playingSong.duration, this.durationEstimate / 1000);\n }\n });\n\t\n\t}\n\t\n});\n \n}","title":""},{"docid":"ff1990570c783568d5ab221c3fbac0f2","score":"0.58079493","text":"getNowPlaying(){\n getNowPlaying()\n .then(data => {\n this.setState({items: data.results}, this.setAvailableGenres);\n this.updateList()},\n (error) => {this.error(error)});\n }","title":""},{"docid":"651726732fd29831116ddb54cffd8a45","score":"0.58070487","text":"function deezer_play(query) {\n DZ.api('/search/?q=' + query + '&index=0&nb_items=5&output=json', function(response) {\n var tracks = $.map(response.data, function(track) { return track.id })\n if(tracks.length) {\n DZ.player.playTracks(tracks);\n }\n });\n}","title":""},{"docid":"56010b1b1ae077ce489fcda15c215f34","score":"0.5806765","text":"_onSubmit(event) {\n event.preventDefault();\n\n this.audioPlayer.setSong(this.songThemeMap.songValue);\n this.audioPlayer.setKickCallback(this._onKick);\n this.audioPlayer.play();\n }","title":""},{"docid":"9a2cf44e2ce8039571a9dc40f4823daf","score":"0.5804129","text":"function updatePlayCount() {\n /*\n Richiama la pagina contenente la query che aggiorna il database aggiungendo 1 al numero di riproduzioni della\n traccia attualmente riprodotta dall'utente.\n */\n\n $.ajaxSetup({\n headers: {\n 'X-CSRF-TOKEN': $('meta[name=\"csrf-token\"]').attr('content')\n }\n });\n $.post(\"/listened/\" + parseInt(Amplitude.getActiveSongMetadata().id), {}, function (data, status, xhr) {}, \"json\");\n}","title":""},{"docid":"946c832274c5b15f6aa46d374486a8f3","score":"0.579815","text":"playNextVox() {\n console.log(\"playNextVox this.vox_queue = \", this.vox_queue);\n var data = this.vox_queue.shift(); // unshift PUTS elements\n console.log(\"voxEnd event dispatched\");\n if (this.vox_queue.length !== 0) {\n var doPlay = (delay) => {\n if (this.vox_queue[0].state() !== \"loaded\") {\n setTimeout(doPlay, Math.min(1000, delay * 2));\n console.log(\"Waiting for voice to load.\");\n return;\n } else {\n this.vox_queue[0].play();\n console.log(\"Voice loaded.\");\n }\n }\n doPlay(50);\n } else {\n document.dispatchEvent(\n new CustomEvent('allVoxEnd', {\n detail: {\n name: data._src.substring(data._src.lastIndexOf(\"/\"))\n }\n })\n );\n console.log(\"allVoxEnd event dispatched\");\n return;\n }\n }","title":""},{"docid":"21256a8c31549cf467d3ad87b6049c3b","score":"0.57952654","text":"function jElectroPlay() {\n playSong2();\n }","title":""},{"docid":"25ad071e68efac18b9037f7150ed40be","score":"0.57764596","text":"play() {\n\t\tthis.updatePlayState();\n\t\tthis.callback('play');\n\t}","title":""},{"docid":"67ee76174a071a12c87c6d365477810a","score":"0.57713926","text":"function play(guild, song) {\n const serverQueue = queue.get(guild.id);\n\n if (!song) {\n serverQueue.voiceChannel.leave();\n queue.delete(guild.id);\n return;\n }\n\n // after that, start playing song with playStream function and URL of our song\n // this is a recursive function, so it cal itself over and over again = play the next song when the song is finished\n const dispatcher = serverQueue.connection\n .playStream(ytdl(song.url))\n .on(\"end\", () => {\n console.log(\"Music ended !\");\n // Deöete the finished song from the queue\n serverQueue.songs.shift();\n // call the PLAY() again with next song\n play(guild, serverQueue.songs[0]);\n })\n .on(\"error\", error => {\n console.error(error);\n });\n dispatcher.setVolumeLogarithmic(serverQueue.volume / 5);\n}","title":""},{"docid":"1466a1187b37fb69f12f3175b661c7fe","score":"0.57701373","text":"async function searchSong() {\n let response = await fetch(\n 'https://yt-music-api.herokuapp.com/api/yt/songs/' + input,\n )\n let result = await response.json()\n setSongs(result.content)\n }","title":""},{"docid":"da53deb8cdec509dfa41622e7fddad8f","score":"0.5769967","text":"onUpdate() {\n if (this._player) {\n if (!this.is_progress_dirty) {\n this.setState({\n progress: this._player.currentTime / this._player.duration\n });\n }\n if (this._player.ended){\n var songID=this.props.data_be.data_be.queue.find(el => el == this.props.song.song._id)\n if(songID!==undefined){\n this.props.RemoveQueue(songID,this.props.data_be.data_be._id,this.props.token.token,this.props.isQueue.isQueue)\n }\n if(this.props.isQueue.isQueue === false && this.props.currentPlaylist.currentPlaylist)\n {\n this.onPlayerNext();\n }\n else if(this.props.isQueue.isQueue === true && this.props.queue.queue)\n {\n this.props.PlayTheFooter(this.props.queue.queue[0])\n }\n }\n }\n }","title":""},{"docid":"b1b8c3cd4e198c1e801f0edea61d7658","score":"0.57626903","text":"addEventsToQueue(events) {\n console.log('PlaybackStore::addEventsToQueue()');\n\n for (var e of events) {\n var songs = Array();\n var _pbstore = this;\n e.eventArtists.forEach(function (ea) {\n ea.artist.songs.forEach(function (s) {\n _pbstore.songQueue.push(s);\n });\n });\n }\n\n this.currentSong = this.songQueue[this.positionInQueue];\n this.storeUpdated();\n }","title":""},{"docid":"d3cd03fa716b5b049b73ca2cddf75afb","score":"0.57624626","text":"handleSongFinished() {\n this.next();\n }","title":""},{"docid":"9f7ac128d101dd2c9e579d503aaa2671","score":"0.5761812","text":"async play(db, text) {\n let res = await axios.post(`http://${this.host}:${this.port}/voiceDB/local/play`, {\n db,\n text\n })\n return res.data;\n }","title":""},{"docid":"101f3d60498502dfc8e42a2c9b883433","score":"0.57597923","text":"next ()\n {\n // Try to pop an item from the queue and start playing it.\n let next = this.queue.shift();\n\n if(next)\n {\n // Move on to playing the next thing\n this.context.startPlay(next);\n }\n else\n {\n // Done playing everything.\n this.context.stopPlay();\n }\n }","title":""},{"docid":"052acc29aebd6d0a58e753f099e3b1dc","score":"0.5755538","text":"function play(guild, song) {\n const serverQueue = queue.get(guild.id);\n if (!song) {\n serverQueue.voiceChannel.leave();\n queue.delete(guild.id);\n return;\n }\n const dispatcher = serverQueue.connection\n .play(ytdl(song.url, {quality: 'highestaudio', highWaterMark: 1 << 25}))\n .on(\"finish\", () => {\n serverQueue.songs.shift();\n play(guild, serverQueue.songs[0]);\n })\n .on(\"error\", error => console.error(error));\n dispatcher.setVolumeLogarithmic(serverQueue.volume / 5);\n serverQueue.textChannel.send(`${ePlaying}Start playing: **${song.title}**`);\n}","title":""},{"docid":"4485d3e1d8e273cad2e38b699ae8c208","score":"0.5755535","text":"function playSong0(){\n currentIndex = 0;\n var nextIndex = currentIndex;\n playTrack(nextIndex)\n }","title":""},{"docid":"c3fa30f7377c5c77382417662f06cb23","score":"0.57506824","text":"function playSong1(){\n currentIndex = 1;\n var nextIndex = currentIndex;\n playTrack(nextIndex);\n console.log(\"playing J-hip-hop\");\n }","title":""},{"docid":"71f5830d812564cecdea8cd986868c02","score":"0.57422894","text":"getMusic(e) {\n e.preventDefault();\n var artist = e.target.artist.value;\n //changes the button to loading while songs load\n //@ts-ignore\n $('#get-music-button').text('LOADING....');\n itunesService.getMusicByArtist(artist).then(results => {\n drawSongs(results)\n //changes button back to GET MUSIC once songs are loaded\n //@ts-ignore\n $('#get-music-button').text('GET MUSIC');\n })\n }","title":""},{"docid":"c6a6858b6f3a3acce04b1e240125115c","score":"0.57409316","text":"function jTraditional() {\n playSong0();\n console.log('playing song1');\n }","title":""},{"docid":"b9d457ecf57366c8bfaa3112575274a8","score":"0.574017","text":"play(nextSong) {\n const channel = this.client.channels.get(this.message.member.voiceChannelID);\n\n channel.join().then(connection => {\n\n if (nextSong && nextSong.url) {\n this.message.reply(nextSong.url);\n this.playYoutubeSong(nextSong, connection);\n } else {\n return this.getYoutubeSearchResults().then(song => {\n this.message.reply(song.url);\n this.playYoutubeSong(song, connection)\n });\n }\n });\n }","title":""},{"docid":"ea2996ba1d8a7c371e9db5467ee2ee30","score":"0.57393384","text":"function playSound(){\n songObj.song.play();\n \n }","title":""},{"docid":"0f976f3b55de45c8dceea9dea1b89116","score":"0.5737815","text":"function showSongsList(){\n\t\n\t $.mobile.changePage(\"#showSongsLists\");\n\t $.each(songs, function(key, data){\n\t\tvar a = $(\"<a href='#player'><h5 class='ui-li-heading'>\" + data.basename + \"</h5>\\n\\n\\\n\t\t<p>Artist: \"+data.artist+\" </p><p> <span class='ui-li-count'>plays \"+ data.plays +\"</span></p></a>\");\n $(a).click({ id: key }, function (event) {\n playSong(event.data.id);\n });\n $('#playlistsSongs').append($(\"<li></li>\").html(a));\n\t\t\n\t\t});\n\t\t$('#playlistsSongs').listview('refresh');\n\t\t\n\treturn false;\n}","title":""},{"docid":"9fe53e808a098909ce70bf0a5475dde9","score":"0.57362247","text":"@action\n start() {\n const proms = this.players.map(player => this.api.savePlayer(player.name));\n Promise.all(proms)\n .then(result => result.map(res => res.data))\n .catch(console.error);\n }","title":""},{"docid":"fc49c3d033559667aee6a72df2c9df7b","score":"0.57353073","text":"function BL_updateNowPlaying() {\n var title = BL_getTrack();\n var artist = BL_getArtist();\n var duration = BL_getDuration();\n var newTrack = title + \" \" + artist;\n\n // Update scrobbler if necessary\n if ( newTrack != \" \" && newTrack != BL_LAST_TRACK && duration > 0 ) {\n //console.log(\"Submitting a now playing request. artist: \"+artist+\", title: \"+title+\", duration: \"+duration);\n\n BL_LAST_TRACK = newTrack;\n chrome.runtime.sendMessage({type: 'validate', artist: artist, track: title}, function(response) {\n if (response != false) {\n // submit the validated song for scrobbling\n var song = response;\n chrome.runtime.sendMessage({type: 'nowPlaying', artist: song.artist, track: song.track, duration: duration});\n } else {\n // on failure send nowPlaying 'unknown song'\n console.log( \"Song validation failed!\" );\n chrome.runtime.sendMessage({type: 'nowPlaying', duration: duration});\n }\n });\n }\n}","title":""},{"docid":"42bda0f3200f45c9417c0d13694d3822","score":"0.57342213","text":"function refreshSongList(){\n\n\t// load in current songs to the player\n\t$.ajax({\n\t\ttype: \"GET\",\n\t\turl: 'http://localhost:3000/api/get_song_list',\n\t\tdataType: 'json',\n\t\tsuccess: function(res) {\n\t\t\tcurrentDisplayedSongs = res;\n\n\t\t\t// empty previous list\n\t\t\t$(\"#song_list\").empty();\n\n\t\t\t// if there are songs to display\n\t\t\tif (res.length > 0) {\n\n\t\t\t\t// display current playing song\n\t\t\t\tvar image = new Image();\n\t\t if (res[0].cover_url != null) image.src = res[0].cover_url;\n\t\t \n\t\t // insert image\n\t\t var html = \"<li class=\\\"li_live\\\"><img class=\\\"song_album_art_live\\\" src=\\\"\"+image.src+\"\\\" />\";\n\n\t\t // insert track info\n\t\t html += \"<div class=\\\"song_group_live\\\" >\";\n\t\t html += \"<div class=\\\"song_name_live\\\" >\"+res[0].name+\"</div>\";\n\t\t html += \"<div class=\\\"song_artist_live\\\" > \"+res[0].artist+\"</div>\";\n\t\t html += \"<div class=\\\"song_album_live\\\">\"+res[0].album+\"</div></div></li><br>\";\n\t\t // add song to list\n\t\t $('#song_list').append(html);\n\n\n\t\t\t\t// fill the other songs in\n\t\t\t\tfor (var x = 1; x < res.length; x++)\n\t\t\t\t{\n\t\t\t\t\timage = new Image();\n\t\t\t if (res[x].cover_url != null) image.src = res[x].cover_url;\n\t\t\t \n\t\t\t // insert image\n\t\t\t var html = \"<li><img class=\\\"song_album_art\\\" src=\\\"\"+image.src+\"\\\" />\";\n\n\t\t\t // insert track info\n\t\t\t html += \"<div class=\\\"song_group\\\" >\";\n\t\t\t html += \"<div class=\\\"song_name\\\" >\"+res[x].name+\"</div>\";\n\t\t\t html += \"<div class=\\\"song_artist\\\" > \"+res[x].artist+\"</div>\";\n\t\t\t html += \"<div class=\\\"song_album\\\">\"+res[x].album+\"</div></div>\";\n\n\t\t\t // insert voting box\n\t\t\t html +=\t\"<div class=\\\"song_voteBox\\\">\";\n\t\t\t html += \"<button class=\\\"song_voteUp\\\" id=\\\"up-\"+x+\"\\\"> /\\\\ </button>\"\n\t\t\t html += \"<button class=\\\"song_voteDwn\\\" id=\\\"dwn-\"+x+\"\\\"> \\\\/ </button>\"\n\t\t\t html += \"</div><div class=\\\"song_voteNum\\\">\"+res[x].votes+\"</div>\"\n\t\t\t\t\thtml += \"</li><br>\";\n\n\t\t\t // add song to list\n\t\t\t $('#song_list').append(html);\n\n\t\t\t // apply listener to song_voteUp buton\n\t\t\t\t\t$('#up-'+x).click(function() {\n\n\t\t\t\t\t\t// get song id \n\t\t\t\t\t\tvar tokens = $(this).attr('id').split(\"-\");\n \t\t\t\t\t\tvar songID = tokens[1];\n\n\t\t\t\t\t\t// post song vote\n\t\t\t\t\t\t$.ajax({\n\t\t\t\t\t\t\ttype: \"POST\",\n\t\t\t\t\t\t\turl: 'http://localhost:3000/api/vote_for_song',\n\t\t\t\t\t\t\tdata: {\n\t\t\t\t\t\t\t\t'song': currentDisplayedSongs[songID].uri,\n\t\t\t\t\t\t\t\t'vote': 'up'\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tdataType: 'json'\n\t\t\t\t\t\t});\t\n\t\t\t\t\t});\n\n\t\t\t\t\t// apply listener to song_voteDwn buton\n\t\t\t\t\t$('#dwn-'+x).click(function() {\n\n\t\t\t\t\t\t// get song id \n\t\t\t\t\t\tvar tokens = $(this).attr('id').split(\"-\");\n \t\t\t\t\t\tvar songID = tokens[1];\n\n\t\t\t\t\t\t// post song vote\n\t\t\t\t\t\t$.ajax({\n\t\t\t\t\t\t\ttype: \"POST\",\n\t\t\t\t\t\t\turl: 'http://localhost:3000/api/vote_for_song',\n\t\t\t\t\t\t\tdata: {\n\t\t\t\t\t\t\t\t'song': currentDisplayedSongs[songID].uri,\n\t\t\t\t\t\t\t\t'vote': 'dwn'\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tdataType: 'json'\n\t\t\t\t\t\t});\n\t\t\t\t\t});\n\t\t\t }\n\t\t\t}\n\t\t}\n\t});\n}","title":""},{"docid":"d07c43b0f563c077e63e70519a4f1ca1","score":"0.5733467","text":"function addSongsToViewMusic(sentSongs) {\n\n if (sentSongs === null ) { // If there are no songs sent to it then get the song info from the local songCollection Object\n sentSongs = songCollection;\n }\n let songString = \"\";\n $.each(sentSongs, (i, currentSong) => { \n songString += `<div class=\"row\" db-key=\"${i}\">`; // Gives each <li> song item a special key based on the database key\n songString += `<div class=\"col-xs-2\">`;\n songString += `<span class=\"glyphicon glyphicon-trash dlt-song\" aria-hidden=\"true\"></span>`;\n songString += `<span class=\"glyphicon glyphicon-edit edit-song\" aria-hidden=\"true\"></span>`;\n songString += `</div>`;\n songString += `<div class=\"col-xs-10\">`;\n songString += `<li>`;\n songString += `${currentSong.title} > ${currentSong.artist} on the album ${currentSong.album}`.replace(/[|;$!%@\"<()+,*]/g, \"\").replace(/\\>/g, \"-\");\n songString += `</li>`;\n songString += `</div>`;\n songString += `</div>`;\n });\n $(\"#song-holder-list\").prepend(songString);\n}","title":""},{"docid":"b6862ddeae092b98f5db1132f02504eb","score":"0.5731922","text":"async getSongsForFrontend( songId = null ) {\n\t\tlet songs = [];\n\t\tlet args = { getAll: true }\n\t\tif ( songId != null ) args = { id: songId, getAll: false };\n\t\tlet { data, more } = await this.getSongs( args );\n\t\tfor ( let songdata of data ) {\n\t\t\tsongdata.arrangement = {}\n\n\t\t\tlet res = await this.getSongArrangements( { songId: songdata.id } );\n\t\t\tif ( res.data.length > 0 ) {\n\t\t\t\tsongdata.arrangement = res.data[ 0 ];\n\t\t\t\tlet song = this.songFromSongDataWithArrangement( songdata );\n\t\t\t\tsongs.push( song );\n\t\t\t}\n\t\t}\n\t\treturn songs;\n\t}","title":""},{"docid":"2b27165a1a13fffaa9d81b5738713b16","score":"0.57242966","text":"play() {\n this.setStatus({isPlaying: true, isBuffering: true});\n this.sendControlRequest(\"play\");\n }","title":""},{"docid":"f6d3643b386c888679894e5bff254e38","score":"0.5720337","text":"_play() {\n \tthis.audioPlayer = new AudioPlayer();\n\tthis.audioPlayer.setSong(this.obj.songValue);\n this.playButton = new PlayButton(this._pause, this._replay);\n\tthis.gifDisplay = new GifDisplay(this.Info, this._showMusicPage);\n\tthis.audioPlayer.setKickCallback(this.gifDisplay._nextGif);\n }","title":""},{"docid":"8d075d1519ee7580c5bbafc0f324cca4","score":"0.5718855","text":"createPlaylist (list) {\r\n console.log (\"Creating new playlist\");\r\n var jsonObj = {\r\n SongList : list\r\n }\r\n let promise = fetch (`https://localhost:5001/api/mediaplayer`, {\r\n method: \"POST\",\r\n headers: {\r\n \"Content-Type\": \"application/json\"\r\n },\r\n body: JSON.stringify(jsonObj)\r\n });\r\n\r\n return promise;\r\n }","title":""},{"docid":"ab49e073b45cce733443bb6d854e23c0","score":"0.57166684","text":"function findSong() {\n\n\tvar search = $('#tbx_search').val();\n\n\t// send request\n\t$.ajax({\n\t\t\ttype: \"GET\",\n\t\t\turl: 'http://localhost:3000/api/find_song',\n\t\t\tdata: {\n\t\t\t\tsrch: search,\n\t\t\t\t'access_token': access_token\n\t\t\t},\n\t\t\tdataType: 'json',\n\t\t\tsuccess: function(found){\n\n\t\t\t\t// on receiving songs, add them to the search list\n\n\t\t\t\t// empty previous search and populate new search\n\t\t\t\t$(\"#search_list\").empty();\n\t\t\t\tcurrentSearchedSongs = found;\n\n\t\t\t\tfor (var x = 0; x < found.tracks.length; x++)\n\t\t\t\t{\n\t\t\t\t\tvar image = new Image();\n\t\t\t if (found.tracks[x].cover_url != null) image.src = found.tracks[x].cover_url;\n\t\t\t \n\t\t\t // insert image\n\t\t\t var html = \"<li><img class=\\\"song_album_art\\\" id=\\\"link-\"+x+\"\\\" src=\\\"\"+image.src+\"\\\" />\";\n\n\t\t\t // insert track info\n\t\t\t html += \"<div class=\\\"song_group\\\" >\";\n\t\t\t html += \"<div class=\\\"song_name\\\" >\"+found.tracks[x].name+\"</div>\";\n\t\t\t html += \"<div class=\\\"song_artist\\\" > \"+found.tracks[x].artist+\"</div>\";\n\t\t\t html += \"<div class=\\\"song_album\\\">\"+found.tracks[x].album+\"</div></div></li><br>\";\n\n\t\t\t // add song to list\n\t\t\t $('#search_list').append(html);\n\n\t\t\t // apply listener to image\n\t\t\t\t\t$('#link-'+x).click(function() {\n\n\t\t\t\t\t\t// get song id \n\t\t\t\t\t\tvar tokens = $(this).attr('id').split(\"-\");\n \t\t\t\t\t\tvar songID = tokens[1];\n\n\t\t\t\t\t\t// post song to be added\n\t\t\t\t\t\t$.ajax({\n\t\t\t\t\t\t\ttype: \"POST\",\n\t\t\t\t\t\t\turl: 'http://localhost:3000/api/choose_song',\n\t\t\t\t\t\t\tdata: {\n\t\t\t\t\t\t\t\t'song': currentSearchedSongs.tracks[songID]\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tdataType: 'json'\n\t\t\t\t\t\t});\n\n\t\t\t\t\t\tsetTimeout(function() {\n\t\t\t\t\t \trefreshSongList();\n\t\t\t\t\t \tupdateLiveSong();\n\t\t\t\t\t }, 1000);\n\t\t\t\t\t});\n\t\t\t }\n\t\t\t},\n\t\t});\n}","title":""},{"docid":"3060ba74901720c6a495cee37e50f69c","score":"0.57113075","text":"function gotAllSongs(err) {\n console.log(\"gotAllSongs()\");\n\n // report an error, you'd want to do something better than this in production\n if (err) {\n console.log(\"error loading data\");\n console.error(err);\n return;\n }\n\n // call functions to log and show the books\n consoleLogSongs();\n showSongs();\n}","title":""},{"docid":"7e16575199b248e6165e2a4ffaaabea7","score":"0.5707014","text":"function playSong() {\n console.log(\"song is playing\")\n uno.style.display = 'none'\n due.style.display = 'block'\n song.loop();\n }","title":""},{"docid":"ca1dcc0681940edd9e64666e75c28c44","score":"0.57033116","text":"async start() {\n for (let current of this.active) {\n const isPlaying =\n current.currentTime > 0 &&\n !current.paused &&\n !current.ended &&\n current.readyState > current.HAVE_CURRENT_DATA;\n // because there is sometimes an error that the pause() was interrupted by the play() I tried to make sure the sound is paused.\n // It is sometimes still show that error and I know its because the pause() and play() are asynchronous but I didn't manage to completely solve it.\n if (!isPlaying) {\n await current.play().catch((error) => {\n console.error(error);\n });\n }\n }\n }","title":""},{"docid":"57be5c3cb794a36558267e9e62e5473c","score":"0.5691717","text":"getMusic(e) {\n e.preventDefault();\n var artist = e.target.artist.value;\n //changes the button to loading while songs load\n document.querySelector('#get-music-button').textContent = 'LOADING....'\n itunesService.getMusicByArtist(artist, drawSongs)\n }","title":""},{"docid":"dd1eea10fdb5a7b781eda78fc911514a","score":"0.5684153","text":"getAllSongs () {\r\n console.log (\"Getting all songs\");\r\n let promise = fetch (`https://localhost:5001/api/mediaplayer`, {\r\n method: \"GET\",\r\n headers: {\r\n \"Content-Type\": \"application/json\"\r\n // \"Authorization\":t\r\n }\r\n });\r\n return promise;\r\n }","title":""},{"docid":"b43025e16ade4b1f7e42396f53e005f2","score":"0.56813","text":"function play(connection, message) {\n var server = servers[message.guild.id];\n\n server.dispatcher = connection.playStream(ytdl(server.queue[0], {filter: \"audioonly\"}));\n\n server.queue.shift()\n\n server.dispatcher.on(\"end\", function() {\n if(server.queue[0]) play(connection, message);\n else connection.disconnect;\n })\n}","title":""},{"docid":"8607b1f76e077dbd74b6a1553cb86402","score":"0.56798357","text":"function handleAPILoaded() {\n requestUserUploadsPlaylistId();\n}","title":""},{"docid":"229de91cb96f6b911a6aed3de7520bb2","score":"0.5665038","text":"function runPlayLinkCommand(message, args, mgid) {\r\n if (!message.member.voice.channel) {\r\n return;\r\n }\r\n if (!args[1]) {\r\n if (dispatcherMap[mgid] && dispatcherMapStatus[message.member.voice.channel] === \"pause\") {\r\n message.channel.send(\"*playing*\");\r\n }\r\n return message.channel.send(\"Where's the link? I can't read your mind... unfortunately.\");\r\n }\r\n if (!args[1].includes(\".\")) {\r\n // message.channel.send(\"*I think you should be using \" + prefixMap[mgid] + \"d but ok then...*\");\r\n return runDatabasePlayCommand(args, message, mgid, false, false);\r\n }\r\n if (!servers[mgid])\r\n servers[mgid] = {\r\n queue: [],\r\n queueHistory: []\r\n };\r\n // in case of force disconnect\r\n if (\r\n !message.guild.client.voice ||\r\n !message.guild.voice ||\r\n !message.guild.voice.channel\r\n ) {\r\n servers[mgid].queue = [];\r\n servers[mgid].queueHistory = [];\r\n }\r\n let queueWasEmpty = false\r\n if (servers[mgid].queue.length < 1) {\r\n queueWasEmpty = true;\r\n }\r\n let pNums = 1;\r\n while (args[pNums]) {\r\n let linkZ = args[pNums];\r\n if (linkZ.substring(linkZ.length - 1) === \",\") {\r\n linkZ = linkZ.substring(0, linkZ.length - 1);\r\n }\r\n // push to queue\r\n servers[mgid].queue.push(args[pNums]);\r\n pNums += 1;\r\n }\r\n // make pNums the number of added songs\r\n pNums--;\r\n // if queue was empty then play\r\n if (queueWasEmpty) {\r\n playSongToVC(message, args[1], message.member.voice.channel, true);\r\n } else if (pNums < 2) {\r\n message.channel.send(\"*added to queue*\");\r\n } else {\r\n message.channel.send(\"*added \" + pNums + \" to queue*\");\r\n }\r\n}","title":""},{"docid":"40cc7b8ea2773ec89a52fb6a0a4394e9","score":"0.5662432","text":"handleSubmitNextRound(e, i) {\n e.preventDefault();\n const { totalRounds } = this.props;\n\n if(i + 1 === totalRounds) {\n const audio = new Audio();\n audio.src = 'assets/sounds/Ryan_VanEerde_Sci-Fi_Explosion_2_20.mp3';\n audio.play();\n } else {\n const audio = new Audio();\n audio.src = 'assets/sounds/zapsplat_science_fiction_vehicles_zoom_by_ultra_sonic_whoosh_002_55942.mp3';\n audio.play();\n }\n this.props.handleNextRound();\n }","title":""},{"docid":"8b11c718ec3dc77f9e3469db0a900acc","score":"0.5660637","text":"function playAll() {\n\t\tfor (var i = 0; i < threads.length; i++) {\n\t\t\tthreads[i].play();\n\t\t}\n\t}","title":""},{"docid":"464cab870ee54ab9e09391d4d8ff19fc","score":"0.5656447","text":"async updateQueueTracksInfo({ state }, token) {\n state.queueNextTracks = [];\n\n var i;\n var tempTrackUrl;\n var songId;\n\n for (i = 0; i < state.queueTracks.length; i++) {\n tempTrackUrl = state.queueTracks[i];\n\n songId = tempTrackUrl.slice(\n tempTrackUrl.indexOf(\"/tracks/\") + \"/tracks/\".length,\n tempTrackUrl.length\n );\n if (state.trackId == songId) {\n break;\n }\n }\n\n var tracks = [];\n\n //request the data\n for (var j = i + 1; j < state.queueTracks.length; j++) {\n tempTrackUrl = state.queueTracks[j];\n\n let songID = tempTrackUrl.slice(\n tempTrackUrl.indexOf(\"/tracks/\") + \"/tracks/\".length,\n tempTrackUrl.length\n );\n\n var track = {\n name: undefined,\n artistName: undefined\n };\n\n await axios\n .get(\"/v1/users/track/\" + songID, {\n headers: {\n Authorization: token\n }\n })\n .then(response => {\n let trackData = response.data;\n\n track.name = trackData.name;\n track.durationMs = trackData.durationMs;\n\n track.artistName = trackData.artist.name;\n\n track.trackAlbumName = trackData.album.name;\n });\n tracks.push(track);\n }\n state.queueNextTracks = tracks;\n\n state.isCurTrkReady = true;\n }","title":""},{"docid":"ca54bc282d3d3ebead644b0ffc3a81ef","score":"0.56523633","text":"getMusic(e) {\n e.preventDefault();\n var artist = e.target.artist.value;\n //changes the button to loading while songs load\n $('#get-music-button').text('LOADING....');\n itunesService.getMusicByArtist(artist).then(results => {\n drawSongs(results)\n //changes button back to GET MUSIC once songs are loaded\n $('#get-music-button').text('GET MUSIC');\n })\n }","title":""}],"string":"[\n {\n \"docid\": \"33015abca3bd17896615732c60959f80\",\n \"score\": \"0.68767816\",\n \"text\": \"async function playlist() { \\n const response = await fetch('http://localhost:3001/playlist')\\n if (response.ok){\\n registerMetric('play-clicked', 1)\\n var i=0\\n const jsonResponse = await response.json()\\n const playlist = document.getElementById('playlist')\\n let html = ''\\n for (song of jsonResponse) {\\n html += `<div>${song.name} - <audio controls>\\n <source src=\\\"http://localhost:3000/${song.file}\\\" type=\\\"audio/ogg\\\"> \\n </audio></div>`\\n }\\n playlist.innerHTML = html \\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a35b76f2b3666c49529d35645223d408\",\n \"score\": \"0.67186356\",\n \"text\": \"function playSong(query, speaker) {\\n query = querystring.stringify({media: 'music', term: query})\\n console.log(query);\\n\\n var songUrl = 0;\\n request('https://itunes.apple.com/search' + '?' + query, function(error, response, body) {\\n console.log('search');\\n console.log('error:', error); // Print the error if one occurred\\n console.log('statusCode:', response && response.statusCode); // Print the response status code if a response was received\\n // console.log(); Print the HTML for the Google homepage.\\n var results = JSON.parse(body).results\\n var item = results[0]\\n // console.log(prettyjson.render(item));\\n var id = 0;\\n\\n var trackUrl = new URL(item.trackViewUrl);\\n var id = trackUrl.searchParams.get('i');\\n var songUrl = '/' + speaker + '/applemusic/now/song:' + id\\n console.log(songUrl);\\n\\n request(baseUrl + songUrl, function(error, response, body) {\\n console.log('queueing');\\n console.log('error:', error); // Print the error if one occurred\\n console.log('statusCode:', response && response.statusCode); // Print the response status code if a response was received\\n\\n request(baseUrl + '/Basement/play', function(error, response, body) {\\n console.log('playing');\\n console.log('error:', error); // Print the error if one occurred\\n console.log('statusCode:', response && response.statusCode); // Print the response status code if a response was received\\n });\\n });\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f78514922cc786d6c918c235286cbe5b\",\n \"score\": \"0.66887623\",\n \"text\": \"function enqueue() {\\n\\tqueue.add(this.id);\\n\\tqueue.draw();\\n\\tif (queue.length() == 1) {\\n\\t\\tchangeSong(this.id);\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"430f54f617ccc58b436a8d361942cfba\",\n \"score\": \"0.66359943\",\n \"text\": \"function call(){\\n request(\\\"api/nowplaying\\\", \\\"\\\", function(result){\\n var data = JSON.parse(result);\\n var test = currentSong =! null ? currentSong : data.song.id;\\n if(test == data.song.id) { // same song\\n onSongRefresh(data);\\n }\\n else { // new song\\n onSongChange(data);\\n onSongRefresh(data);\\n currentSong = data.song.id;\\n }\\n }, function(data){\\n stopCall();\\n $(\\\"#connection-error-alert\\\").modal({\\n keyboard: false,\\n backdrop:\\\"static\\\"\\n }).modal(\\\"show\\\");\\n });\\n request(\\\"api/queue?limit=3\\\", \\\"\\\", function(result){\\n var data = JSON.parse(result);\\n onQueueRefresh(data);\\n }, function(){\\n stopCall();\\n $(\\\"#connection-error-alert\\\").modal({\\n keyboard: false,\\n backdrop:\\\"static\\\"\\n }).modal(\\\"show\\\");\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"745bf970420fcada187fbf8572a0bc2e\",\n \"score\": \"0.65192026\",\n \"text\": \"function playSong() {\\n\\t\\tfor (var i = 0; i < songTracks.length; i++)\\n\\t\\t\\tsongTracks[i].play();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e2f32a7e54014f7b1b885a114efca4a\",\n \"score\": \"0.64914626\",\n \"text\": \"function listenAjax() {\\n //calls query with music as only criteria first\\n\\n $.ajax({\\n url: 'https://api.spotify.com/v1/search',\\n data: {\\n q: iWant.selectedNoun,\\n type: 'track'\\n },\\n\\n success: function (response) {\\n // console.log('spotify', response);\\n\\n\\n for (i = 0; i < response.tracks.items.length; i++) {\\n\\n var tracks = response.tracks.items[i];\\n\\n var song = {\\n artist: tracks.artists[0].name,\\n album: tracks.album.name,\\n title: tracks.name,\\n picture: tracks.album.images[0].url,\\n audio: tracks.preview_url,\\n link: tracks.external_urls.spotify\\n };\\n\\n iWant.queueArray.push(song);\\n }\\n\\n displayListen();\\n\\n\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60a166903008ab63a6da7723b78662b2\",\n \"score\": \"0.6456316\",\n \"text\": \"enqueue(song) {\\r\\n this.items.push(song);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"38447d88ecedb8eb1da4edc8ab89f305\",\n \"score\": \"0.64547926\",\n \"text\": \"function playNextSong(guild) {\\r\\n\\t\\tlet voiceConn = guild.voiceConn;\\r\\n\\t\\tlet queue = guild.queue;\\r\\n\\t\\t\\r\\n\\t\\tif (queue.length > 0) {\\r\\n\\t\\t\\tconsole.log(\\\"Now playing: \\\" + queue[0].title + \\\"; \\\" + queue[0].url);\\t\\t\\t\\r\\n\\t\\t\\tvoiceConn.play(queue[0].url);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2efb807d4487f741c5dccce96453e9c\",\n \"score\": \"0.64454484\",\n \"text\": \"function playSongFromQueue(song) {\\n setCurrentVideoId(song.videoId)\\n context.player.loadVideoById(song.videoId)\\n updateContext({ currentSong: song });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"205c28d14117bf5ffe97b68377e37d90\",\n \"score\": \"0.6424254\",\n \"text\": \"function getQueue($play, $seek) {\\n $.ajax({\\n url: '/controller.php',\\n dataType: 'json',\\n data: 'r=getQueue',\\n async: false,\\n success: function(d) {\\n _QUEUE.init(d.queue);\\n skip = d.timestamp - d.queue[0].startplay; \\n\\n _QUEUE.updateQueue(d.queue);\\n\\n if (window.fluid) window.fluid.dockBadge = _QUEUE.length()-_QUEUE.ptr;\\n refreshQueueDisplay(); \\n refreshListeners(d.listeners); \\n refreshRequestBadge(d.pendingRequests);\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db5260d3bcfb9046c024bb63d02cd363\",\n \"score\": \"0.6399509\",\n \"text\": \"function list(message, serverQueue) {\\n if (!serverQueue) {\\n return message.channel.send(`${eAttention}` + \\\"There are no songs in the queue to list.\\\");\\n } else {\\n let playList = `${ePlaying} Playing: ` + serverQueue.songs[0].title + \\\"\\\\n\\\";\\n for (let i = 1; i < serverQueue.songs.length; i++)\\n playList = playList + `${eNext}` + (i) + \\\" - \\\" + serverQueue.songs[i].title + \\\"\\\\n\\\";\\n message.channel.send(playList);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14f8f5d7d123a516f1e0ebf580a64e7a\",\n \"score\": \"0.63866895\",\n \"text\": \"function playPlaylist(sequenceInPlaylist) {\\n\\t\\tvar nextSongInSequence = 0;\\n\\t\\tconsole.log(queuePlaylist);\\n\\t\\t// Se sono arrivato all'ultima canzone, la successiva sarà la prima della coda\\n\\t\\tif (sequenceInPlaylist === queuePlaylist.length - 1) {\\n\\t\\t\\tnextSongInSequence = 0;\\n\\t\\t} else {\\n\\t\\t\\tnextSongInSequence = 1 + sequenceInPlaylist;\\n\\t\\t}\\n\\n\\t\\tconsole.log(nextSongInSequence);\\n\\t\\t\\n\\t\\tserverServices.getSongPath(queuePlaylist[sequenceInPlaylist], function (response) {\\n\\t\\t\\tif (response.error) return;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tsessionStorage.setItem(\\\"songInReproductionId\\\", queuePlaylist[sequenceInPlaylist]);\\n\\t\\t\\t\\tsessionStorage.setItem(\\\"nextSongInSequence\\\", nextSongInSequence);\\n\\n\\t\\t\\t\\tvar audioTag = document.getElementById(\\\"reproductionSong\\\");\\n\\t\\t\\t\\t// rimuovo la canzone attualmente in esecuzione, se c'è\\n\\t\\t\\t\\tif (document.getElementById('songInReproduction')) {\\n\\t\\t\\t\\t\\taudioTag.removeChild(document.getElementById('songInReproduction'));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tvar songInfoEl = document.getElementById(\\\"songInfo\\\");\\n\\t\\t\\t\\tif (songInfoEl.firstChild) {\\n\\t\\t\\t\\t\\tsongInfoEl.removeChild(songInfoEl.firstChild);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tvar songEl = document.createElement('source');\\n\\t\\t\\t\\tsongEl.id = \\\"songInReproduction\\\";\\n\\t\\t\\t\\tsongEl.type = \\\"audio/mpeg\\\";\\t\\n\\t\\t\\t\\tvar text = response.title + \\\" - \\\" + response.author;\\n\\t\\t\\t\\tvar path = response.path;\\n\\t\\t\\t\\tsongInfoEl.appendChild(document.createTextNode(text));\\n\\t\\t\\t\\tsongEl.src = path;\\n\\t\\t\\t\\taudioTag.appendChild(songEl);\\n\\t\\t\\t\\taudioTag.load();\\n\\t\\t\\t\\taudioTag.oncanplay = function (event) {event.preventDefault(); audioTag.play()};\\n\\t\\t\\t\\taudioTag.onpause = function (event) {event.preventDefault(); saveSongContext(parseInt(sessionStorage.getItem(\\\"songInReproductionId\\\")), false);};\\n\\t\\t\\t\\t/* Per fare in modo che finita la canzone attuale parta la successiva della playlist */\\n\\t\\t\\t\\taudioTag.onended = function (event) {event.preventDefault(); playPlaylist(parseInt(sessionStorage.getItem(\\\"nextSongInSequence\\\")))};\\n\\t\\t\\t}\\n\\t\\t})\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4e5611b1d4dacce89f26e26c99c3ce9\",\n \"score\": \"0.63387156\",\n \"text\": \"async function listSongs() {\\n const songs = await API.graphql(graphqlOperation(ListSongs))\\n updateSongs(songs.data.listSongs.items)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ee2d0f03a0a33d9ad80ae8c34efb8ba\",\n \"score\": \"0.62686175\",\n \"text\": \"handleQueue(){\\n this.props.GetQueue(this.props.data_be.data_be._id,this.props.token.token);\\n this.props.handleCurrentPlayList(null);\\n this.props.SetIsQueue(true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7209f876574ec43f8a07b52937010766\",\n \"score\": \"0.62595564\",\n \"text\": \"showSong(){\\r\\n\\t\\tvar div = this._div,\\r\\n\\t\\t\\tsongs = this._songs,\\r\\n\\t\\t\\taudio = this._audio;\\r\\n\\t\\tthis.msglog = ajaxRequest(this._id+'/songs', 'GET');\\t\\t\\r\\n\\t\\tthis.msglog = this.msglog.data.songs;\\r\\n\\t\\tfor( var i=0; i< this.msglog.length; i++){\\r\\n\\t\\t\\tthis._arrSongs[i] = new Song(i, this.msglog[i].name, this.msglog[i].url, songs, audio);\\t\\t\\t\\r\\n\\t\\t\\tthis._arrSongs[i].toView();\\r\\n\\t\\t}\\r\\n\\t\\t//this._arrSongs[0].play();\\r\\n\\t\\t//arrPLlist[div.id].playSong(arrPLlist[div.id]._arrSongs[this.getAttribute(\\\"data-id\\\")].url, audio);\\r\\n\\t\\t//audio.src=this.msglog[0].url;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ef0cb33450e641604925fa95d18a5db\",\n \"score\": \"0.621503\",\n \"text\": \"function playNext() {\\n if (songName != -1) {\\n var i = 0;\\n for (element of request) {\\n if (element.nombre_cancion == songName) {\\n break;\\n } else {\\n i++\\n }\\n }\\n console.log(request[i + 1]);\\n if (i < request.length - 1) {\\n getSongData(request[i + 1]);\\n player.loadVideoById(songKey);\\n isPlaying = true;\\n } else {\\n getSongData(request[i]);\\n player.loadVideoById(songKey);\\n isPlaying = true;\\n }\\n } else {\\n getSongData(request[i]);\\n player.loadVideoById(songKey);\\n isPlaying = true;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37d8865bf0db4beab696233bd818333f\",\n \"score\": \"0.6213636\",\n \"text\": \"function loadQueue() {\\n showLoadingDialog();\\n $.ajax({\\n type: 'GET',\\n url: '/getQueue',\\n dataType: 'json',\\n success: (data) => {\\n // Queue has been loaded. Display the media items as a grid on screen.\\n hideLoadingDialog();\\n showPreview(data.parameters, data.photos);\\n hideLoadingDialog();\\n console.log('Loaded queue.');\\n },\\n error: (data) => {\\n hideLoadingDialog();\\n handleError('Could not load queue', data)\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da22c429edaa1be6b514fa8b7ca2f083\",\n \"score\": \"0.6179073\",\n \"text\": \"function songClick(id){\\n\\n var song = getSongFromId(id);\\n var simpleSong = convertSong(song);\\n var address= getExactAddress();\\n\\n console.log(JSON.stringify(simpleSong));\\n\\n //make sure its hidden at at the correct html render location\\n document.getElementById('queue').style.visibility=\\\"visible\\\";\\n\\n //sent to the TBA que to be checked\\n $.ajax({\\n type: \\\"POST\\\",\\n url: address+\\\"/queueSong\\\",\\n contentType: \\\"application/Json\\\",\\n data: JSON.stringify(simpleSong),\\n success: function(response){\\n console.log(\\\"sent to TBAqueue\\\");\\n },\\n error: function(jqXhr, textStatus, errorMessage){\\n console.log(errorMessage);\\n }\\n });\\n\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2772a3e078ca09d85ff85c1a8c4ce0d\",\n \"score\": \"0.61762756\",\n \"text\": \"async play() {\\n if (!this.stillThere || !this.queue.length) return this.PlayerShutdown()\\n this.current = this.queue.shift()\\n await this.player.playTrack(this.current.track);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"367b60e7bd01d7b0f9cf62893e6439af\",\n \"score\": \"0.61721975\",\n \"text\": \"async function song_() {\\r\\n\\r\\n //if no tracks found return info msg\\r\\n\\r\\n if (!res.tracks[0])\\r\\n return message.reply({embeds: [new MessageEmbed()\\r\\n .setColor(ee.wrongcolor)\\r\\n .setTitle(String(\\\"❌ Error | Found nothing for: **`\\\" + search).substr(0, 256 - 3) + \\\"`**\\\")\\r\\n .setDescription(eval(client.la[ls][\\\"handlers\\\"][\\\"playermanagers\\\"][\\\"request\\\"][\\\"variable1\\\"]))\\r\\n ]}).catch(e => console.log(String(e).grey.italic.dim));\\r\\n //create a player if not created\\r\\n\\r\\n //if the player is not connected, then connect and create things\\r\\n if (player.state !== \\\"CONNECTED\\\") {\\r\\n //set the variables\\r\\n player.set(\\\"message\\\", message);\\r\\n player.set(\\\"playerauthor\\\", message.author.id);\\r\\n player.connect();\\r\\n message.react(\\\"863876115584385074\\\").catch(e => console.log(String(e).grey.italic.dim));\\r\\n //add track\\r\\n player.queue.add(res.tracks[0]);\\r\\n //play track\\r\\n player.play();\\r\\n player.pause(false);\\r\\n } else if (!player.queue || !player.queue.current) {\\r\\n //add track\\r\\n player.queue.add(res.tracks[0]);\\r\\n //play track\\r\\n player.play();\\r\\n player.pause(false);\\r\\n }\\r\\n //otherwise\\r\\n else {\\r\\n //add track\\r\\n player.queue.add(res.tracks[0]);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa65283fedcde3c38626bba6760bfcbe\",\n \"score\": \"0.6115202\",\n \"text\": \"function all() {\\n var url = user_id == 'demo' ?\\n \\\"/assets/demo-data/a-playlists.json\\\" :\\n \\\"https://api.spotify.com/v1/users/\\\"+user_id+\\\"/playlists\\\";\\n \\n return query(url,\\n new Resolver(function(data){\\n this.deferred.notify(data);\\n if (data.next) {\\n send_ajax(data.next, this);\\n } else {\\n this.deferred.resolve();\\n }\\n }));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8f74c06df1b983911ccd2af01ead6af\",\n \"score\": \"0.6035787\",\n \"text\": \"function playSong(url, username){\\n\\t\\tsocket.emit('playSong', {\\n\\t\\t\\tpath: url,\\n\\t\\t\\tartist: username\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6cb9c4eb2762dfebd61939784ea6cab\",\n \"score\": \"0.60207254\",\n \"text\": \"function startPlay() {\\n // Listen for the click on the play button\\n $(document).on('click', '.results .play-button', function () {\\n // Get the video id\\n var id = $(this).data('video-id'),\\n // Get the object id\\n objectId = $(this).data('object-id'),\\n // Fetch the video object from the foundVideos array based on\\n // the found id\\n obj = foundVideos[objectId];\\n\\n // Create the song object\\n currentSong = {\\n 'position': count,\\n 'videoId': id,\\n 'title': obj['snippet']['title'],\\n 'duration': convert_time(obj['contentDetails']['duration']),\\n 'thumbnail': obj['snippet']['thumbnails']['high']['url']\\n };\\n\\n // Start the song\\n player.loadVideoById(id);\\n\\n // Set the bottom player equal to the current song\\n displayCurrentSong();\\n\\n // If the queue is non-existent we have to display\\n // suggestions based on the current song\\n if (queue.length == 0 || queue.length < 1) {\\n showSuggestions(id);\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac417b5162c1bfb6ebb2a6073514dd77\",\n \"score\": \"0.6019753\",\n \"text\": \"function play(connection, message){\\n\\n\\t\\t\\t\\tvar server = servers[message.guild.id];\\n\\t\\t\\t\\tvar server2 = played[message.guild.id];\\n\\n\\t\\t\\t\\tserver.dispatcher = connection.play(ytdl(server.queue[0], { filter: format => format.container === 'mp4' }));\\n\\n\\t\\t\\t\\t// Saving music on permanent history\\n\\t\\t\\t\\tfs.appendFile('./history/played-musics.txt', server.queue[0].slice(0) + \\\"\\\\n\\\" , (err) => {\\n \\t\\t\\t\\tif(err) throw err;\\n \\t\\t\\t\\t});\\n\\n \\t\\t\\t\\t// Saving music on recent history\\n\\t\\t\\t\\tserver2.queue.push(server.queue[0].slice(0));\\n\\n\\t\\t\\t\\t//remove a música que acabou de tocar da queue\\n\\t\\t\\t\\tserver.queue.shift();\\n\\n\\t\\t\\t\\tserver.dispatcher.on(\\\"end\\\",function(){\\n\\t\\t\\t\\t\\tif(server.queue[0]){\\n\\t\\t\\t\\t\\t\\tplay(connection, message);\\n\\t\\t\\t\\t\\t} else{\\n\\t\\t\\t\\t\\t\\tconnection.disconnect();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b9e83be6358be3b649359e93087ccae\",\n \"score\": \"0.6003361\",\n \"text\": \"function sendPlay()\\n{\\n\\tsocket.emit(\\\"play\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"485191a20d80da9c98eae0d1b67e84d2\",\n \"score\": \"0.5992443\",\n \"text\": \"startPartyEventLoop() {\\n let allParties = db['parties'].find();\\n allParties.forEach((globParty) => {\\n if (currentEventLoopParties[globParty.id] === undefined) {\\n console.log(`[MUSIC] Starting party ${globParty.id}`);\\n currentEventLoopParties[globParty.id] = setInterval(async () => {\\n if (playerOutgoingSocket.length > 0) {\\n let message = getMessageFromQueue();\\n console.log(message);\\n playerIO.to(message.partyId).emit(message.event, message.data);\\n }\\n\\n if (frontOutgoingSocket.length > 0) {\\n let message = getMessageFromFrontQueue();\\n frontIO.to(message.partyId).emit(message.event, message.data);\\n }\\n\\n try {\\n let party = db['parties'].findOne({id: globParty.id});\\n addMessageToFrontQueue(new Message(globParty.id, 'update', party));\\n switch (party.state) {\\n case 0: // currently playing\\n if ((party.oldStatus === 0 || party.oldStatus === 1) && party.status === 1) {\\n updatePartyState(party.id, 1);\\n }\\n break;\\n case 1: // currently idle\\n if (party.playlist.length > 0) {\\n updatePartyState(party.id, 2);\\n }\\n break;\\n case 2: // playing next song\\n console.log('playing next song state');\\n let song = party.playlist.shift();\\n console.log({song});\\n if (song) {\\n db['parties'].update({\\n id: party.id\\n }, {\\n playlist: party.playlist\\n });\\n console.log('emit the play event');\\n db['parties'].update({\\n id: party.id\\n }, {\\n currentlyPlaying: song\\n });\\n addMessageToQueue(new Message(party.id, 'play', {\\n path: song.songUrl,\\n mode: 'name'\\n }));\\n updatePartyState(party.id, 0);\\n } else {\\n updatePartyState(party.id, 1);\\n }\\n break;\\n }\\n updatePartyOldState(party.id);\\n } catch (e) {\\n console.error(`Error in the main party thread with party: ${globParty.id}`);\\n console.log(e);\\n }\\n }, 500);\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"38b8755a7f7d66d3b82e3d9d7859542d\",\n \"score\": \"0.5984368\",\n \"text\": \"function playSong(song, enqueueAll) {\\n var filesToPlay = [];\\n var toPlay = path.join(musicRootDir, song);\\n if (!toPlay) {\\n return;\\n }\\n var ls = null;\\n try {\\n ls = fs.lstatSync(toPlay);\\n } catch (e) {}\\n\\n if (ls && ls.isDirectory()) {\\n filesToPlay = utils.songsInDir(toPlay).map(function(song) {\\n return path.join(toPlay, song);\\n });\\n if (!enqueueAll) {\\n if (filesToPlay.length >= 1) {\\n player.play(filesToPlay[0]);\\n }\\n if (filesToPlay.length >= 2) {\\n player.enqueue(filesToPlay.slice(1));\\n }\\n currPlayIndex = 0;\\n } else {\\n player.enqueue(filesToPlay);\\n }\\n\\n\\n } else {\\n if (toPlay) {\\n filesToPlay = [toPlay];\\n if (!enqueueAll) {\\n currPlayIndex = 0;\\n player.play(toPlay);\\n } else {\\n player.enqueue(toPlay);\\n }\\n }\\n }\\n\\n var pl = filesToPlay.map(function(fileToPlay) {\\n return { fileName: path.relative(musicRootDir, fileToPlay) };\\n });\\n if (!enqueueAll) {\\n playlist = pl;\\n currPlayIndex = 0;\\n } else {\\n playlist = playlist.concat(pl);\\n }\\n //get song info for existing files (not urls)\\n if (ls) {\\n player.getSongInfo(filesToPlay, function(result) {\\n console.log(result);\\n result.forEach(function(item) {\\n item.fileName = path.relative(musicRootDir, item.fileName);\\n });\\n if (!enqueueAll) {\\n playlist = result;\\n } else {\\n playlist = playlist.concat(result);\\n }\\n\\n });\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b43ceaea677f27e8aa847d14b5194aa\",\n \"score\": \"0.597619\",\n \"text\": \"function listPlaylists() {\\r\\n return gapi.client.youtube.playlists.list({\\r\\n \\\"part\\\": \\\"snippet\\\",\\r\\n \\\"maxResults\\\": 50,\\r\\n \\\"mine\\\": true\\r\\n })\\r\\n .then(function(response) {\\r\\n // Handle the results here (response.result has the parsed body).\\r\\n console.log(\\\"Response\\\", response);\\r\\n\\r\\n let length = response.result.items.length;\\r\\n for(let i=0; i<length; i++){\\r\\n if(response.result.items[i].snippet.title === \\\"Queue\\\"){\\r\\n chrome.storage.sync.set({'playlistId': response.result.items[i].id});\\r\\n return;\\r\\n }\\r\\n }\\r\\n insertQueuePlaylist();\\r\\n },\\r\\n function(err) { console.error(\\\"Execute error\\\", err); });\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5ccf533b333e6bc6f5d920151de2da9\",\n \"score\": \"0.59649646\",\n \"text\": \"addToQue(songUrl) {\\n if (this.state.playArray.has(songUrl)) {\\n this.state.playArray.get(songUrl).pause()\\n this.state.playArray.delete(songUrl)\\n console.log( \\\"Sound removed\\\",this.state.playArray)\\n } else {\\n this.state.playArray.set(songUrl,new Audio(songUrl))\\n console.log(\\\"Sound added\\\",this.state.playArray)\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa982a7f3b9633f15335e4c8fb192730\",\n \"score\": \"0.5959077\",\n \"text\": \"function startPlayList() {\\n\\t\\t//play first track\\n\\t\\tif (_playList.length > 0) {\\n\\t\\t\\tplayTrackRow(_playList[0]);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc9c508c7002ec1157addba7ceb68834\",\n \"score\": \"0.59550816\",\n \"text\": \"async function execute(message, serverQueue) {\\n const args = message.content.split(' ');\\n\\n //Join voice channel if not already joined\\n if(!serverQueue || serverQueue.afk) {\\n if(!await join(message, serverQueue)) {\\n //Something went wrong when joining voicechannel\\n return false;\\n }\\n serverQueue = serverMap.get(message.guild.id);\\n }\\n //Store searching message for later editing/deletion\\n let msg;\\n\\n //Let the user know we read the command\\n message.channel.send(\\\"Searching...\\\").then((m) => {\\n msg = m;\\n });\\n\\n const request = message.content.substr(6).trim();\\n let searchTerm = request;\\n\\n //Check if searchTerm is a link\\n if(!request.includes(\\\"https://\\\")) {\\n searchTerm = \\\"ytsearch:\\\" + searchTerm;\\n }\\n\\n //Get song info from ytdl\\n await getInfo(searchTerm).then((info) => {\\n //Is true for playlists\\n if(info.partial) {\\n info.on('video', (v) => {\\n //Create new song object\\n const song = {\\n title: v.title,\\n url: v.webpage_url.toString(),\\n };\\n\\n //Push song to queue\\n serverQueue.songs.push(song);\\n\\n console.log(`Song added: ${song.title}`);\\n console.log(song);\\n\\n //We are not already playing a song\\n if(!serverQueue.playing) {\\n try {\\n //Play music\\n console.log(\\\"Trying to play song\\\");\\n play(message.guild, serverQueue.songs[0]);\\n console.log(\\\"Executed play function\\\");\\n serverQueue.playing = true;\\n message.channel.send(`Now playing: ${serverQueue.songs[0].title}`);\\n } catch (err) {\\n serverQueue.playing = false;\\n serverQueue.songs.clear();\\n execute(message, serverQueue);\\n }\\n }\\n\\n if(msg != null) {\\n msg.edit(`Adding songs to queue...`);\\n } else {\\n message.channel.send(`Adding songs to queue...`);\\n }\\n });\\n info.on('done', () => {\\n if(msg != null) {\\n return msg.edit(`${info.items.length} songs added to queue`);\\n } else {\\n return message.channel.send(`${info.items.length} songs added to queue`);\\n }\\n })\\n } else {\\n //Single song\\n //Create new song object\\n const song = {\\n title: info.items[0].title,\\n url: info.items[0].webpage_url.toString(),\\n };\\n\\n //Push song to queue\\n serverQueue.songs.push(song);\\n\\n console.log(`Song added: ${song.title}`);\\n console.log(song);\\n\\n //We are not already playing a song\\n if(!serverQueue.playing) {\\n try {\\n //Play music\\n play(message.guild, serverQueue.songs[0]);\\n serverQueue.playing = true;\\n } catch(err) {\\n serverQueue.playing = false;\\n serverQueue.songs.clear();\\n execute(message, serverQueue);\\n }\\n if(msg != null) {\\n msg.edit(`Now playing: ${serverQueue.songs[0].title}`);\\n return true;\\n } else {\\n message.channel.send(`Now playing: ${serverQueue.songs[0].title}`);\\n return true;\\n }\\n } else {\\n if(msg != null) {\\n msg.edit(`${song.title} added to queue`);\\n return true;\\n } else {\\n message.channel.send(`${song.title} added to queue`);\\n return true;\\n }\\n }\\n }\\n }).catch((err) => {\\n console.log(err);\\n if(msg != null) {\\n msg.edit(`Could not find any song matching ${searchTerm}`);\\n return false;\\n } else {\\n message.channel.send(`Could not find any song matching ${searchTerm}`);\\n return false;\\n }\\n });\\n return true;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7e1f16c708289ca0fee61558b8c25ec\",\n \"score\": \"0.5953034\",\n \"text\": \"function song(client, message, args, type) {\\n var search, res, player, state, song_, playlist_;\\n return regeneratorRuntime.async(function song$(_context3) {\\n while (1) {\\n switch (_context3.prev = _context3.next) {\\n case 0:\\n playlist_ = function _ref2() {\\n var playlistembed;\\n return regeneratorRuntime.async(function playlist_$(_context2) {\\n while (1) {\\n switch (_context2.prev = _context2.next) {\\n case 0:\\n if (res.tracks[0]) {\\n _context2.next = 2;\\n break;\\n }\\n\\n return _context2.abrupt(\\\"return\\\", message.channel.send(new MessageEmbed().setColor(ee.wrongcolor).setFooter(ee.footertext, ee.footericon).setTitle(String(\\\"Found nothing for: **`\\\" + search).substr(0, 256 - 3) + \\\"`**\\\").setDescription(\\\"Please retry!\\\")));\\n\\n case 2:\\n //if the player is not connected, then connect and create things\\n if (player.state !== \\\"CONNECTED\\\") {\\n //set the variables\\n player.set(\\\"message\\\", message);\\n player.set(\\\"playerauthor\\\", message.author.id);\\n player.connect(); //add track\\n\\n player.queue.add(res.tracks); //play track\\n\\n player.play();\\n player.pause(false);\\n } else if (!player.queue || !player.queue.current) {\\n //add track\\n player.queue.add(res.tracks); //play track\\n\\n player.play();\\n player.pause(false);\\n } else {\\n //add the tracks\\n player.queue.add(res.tracks);\\n } //send information\\n\\n\\n playlistembed = new MessageEmbed().setTitle(\\\"Added Playlist \\\\uD83E\\\\uDE78 **`\\\".concat(res.playlist.name).substr(0, 256 - 3) + \\\"`**\\\").setURL(res.playlist.uri).setColor(ee.color).setFooter(ee.footertext, ee.footericon).setThumbnail(\\\"https://img.youtube.com/vi/\\\".concat(res.tracks[0].identifier, \\\"/mqdefault.jpg\\\")).addField(\\\"⌛ Duration: \\\", \\\"`\\\".concat(format(res.playlist.duration), \\\"`\\\"), true).addField(\\\"🔂 Queue length: \\\", \\\"`\\\".concat(player.queue.length, \\\" Songs`\\\"), true).setFooter(\\\"Requested by: \\\".concat(message.author.tag), message.author.displayAvatarURL({\\n dynamic: true\\n }));\\n message.channel.send(playlistembed).then(function (msg) {\\n if (msg) msg[\\\"delete\\\"]({\\n timeout: 4000\\n })[\\\"catch\\\"](function (e) {\\n return console.log(\\\"couldn't delete message this is a catch to prevent a crash\\\".grey);\\n });\\n });\\n\\n case 5:\\n case \\\"end\\\":\\n return _context2.stop();\\n }\\n }\\n });\\n };\\n\\n song_ = function _ref() {\\n var playembed;\\n return regeneratorRuntime.async(function song_$(_context) {\\n while (1) {\\n switch (_context.prev = _context.next) {\\n case 0:\\n if (!(player.state !== \\\"CONNECTED\\\")) {\\n _context.next = 9;\\n break;\\n }\\n\\n //set the variables\\n player.set(\\\"message\\\", message);\\n player.set(\\\"playerauthor\\\", message.author.id); //connect\\n\\n player.connect(); //add track\\n\\n player.queue.add(res.tracks[0]); //play track\\n\\n player.play();\\n player.pause(false);\\n _context.next = 18;\\n break;\\n\\n case 9:\\n if (!(!player.queue || !player.queue.current)) {\\n _context.next = 15;\\n break;\\n }\\n\\n //add track\\n player.queue.add(res.tracks[0]); //play track\\n\\n player.play();\\n player.pause(false);\\n _context.next = 18;\\n break;\\n\\n case 15:\\n //add the latest track\\n player.queue.add(res.tracks[0]); //send track information\\n\\n playembed = new MessageEmbed().setTitle(\\\"Added to Queue \\\\uD83E\\\\uDE78 **`\\\".concat(res.tracks[0].title).substr(0, 256 - 3) + \\\"`**\\\").setURL(res.tracks[0].uri).setColor(ee.color).setFooter(ee.footertext, ee.footericon).setThumbnail(\\\"https://img.youtube.com/vi/\\\".concat(res.tracks[0].identifier, \\\"/mqdefault.jpg\\\")).addField(\\\"⌛ Duration: \\\", \\\"`\\\".concat(res.tracks[0].isStream ? \\\"LIVE STREAM\\\" : format(res.tracks[0].duration), \\\"`\\\"), true).addField(\\\"💯 Song By: \\\", \\\"`\\\".concat(res.tracks[0].author, \\\"`\\\"), true).addField(\\\"🔂 Queue length: \\\", \\\"`\\\".concat(player.queue.length, \\\" Songs`\\\"), true).setFooter(\\\"Requested by: \\\".concat(res.tracks[0].requester.tag), res.tracks[0].requester.displayAvatarURL({\\n dynamic: true\\n }));\\n return _context.abrupt(\\\"return\\\", message.channel.send(playembed).then(function (msg) {\\n if (msg) msg[\\\"delete\\\"]({\\n timeout: 4000\\n })[\\\"catch\\\"](function (e) {\\n return console.log(\\\"couldn't delete message this is a catch to prevent a crash\\\".grey);\\n });\\n }));\\n\\n case 18:\\n case \\\"end\\\":\\n return _context.stop();\\n }\\n }\\n });\\n };\\n\\n search = args.join(\\\" \\\");\\n player = client.manager.players.get(message.guild.id);\\n\\n if (player) {\\n _context3.next = 8;\\n break;\\n }\\n\\n if (message.member.voice.channel) {\\n _context3.next = 7;\\n break;\\n }\\n\\n throw \\\"NOT IN A VC\\\";\\n\\n case 7:\\n player = client.manager.create({\\n guild: message.guild.id,\\n voiceChannel: message.member.voice.channel.id,\\n textChannel: message.channel.id,\\n selfDeafen: config.settings.selfDeaf\\n });\\n\\n case 8:\\n state = player.state;\\n\\n if (state !== \\\"CONNECTED\\\") {\\n //set the variables\\n player.set(\\\"message\\\", message);\\n player.set(\\\"playerauthor\\\", message.author.id);\\n player.connect();\\n player.stop();\\n }\\n\\n _context3.prev = 10;\\n\\n if (!(type.split(\\\":\\\")[1] === \\\"youtube\\\" || type.split(\\\":\\\")[1] === \\\"soundcloud\\\")) {\\n _context3.next = 17;\\n break;\\n }\\n\\n _context3.next = 14;\\n return regeneratorRuntime.awrap(client.manager.search({\\n query: search,\\n source: type.split(\\\":\\\")[1]\\n }, message.author));\\n\\n case 14:\\n res = _context3.sent;\\n _context3.next = 20;\\n break;\\n\\n case 17:\\n _context3.next = 19;\\n return regeneratorRuntime.awrap(client.manager.search(search, message.author));\\n\\n case 19:\\n res = _context3.sent;\\n\\n case 20:\\n if (!(res.loadType === \\\"LOAD_FAILED\\\")) {\\n _context3.next = 24;\\n break;\\n }\\n\\n throw res.exception;\\n\\n case 24:\\n if (res.loadType === \\\"PLAYLIST_LOADED\\\") {\\n playlist_();\\n } else {\\n song_();\\n }\\n\\n case 25:\\n _context3.next = 31;\\n break;\\n\\n case 27:\\n _context3.prev = 27;\\n _context3.t0 = _context3[\\\"catch\\\"](10);\\n console.log(String(_context3.t0.stack).red);\\n return _context3.abrupt(\\\"return\\\", message.channel.send(new MessageEmbed().setColor(ee.wrongcolor).setFooter(ee.footertext, ee.footericon).setTitle(\\\"There was an error while searching:\\\").setDescription(\\\"```\\\".concat(_context3.t0.message, \\\"```\\\"))));\\n\\n case 31:\\n if (res.tracks[0]) {\\n _context3.next = 33;\\n break;\\n }\\n\\n return _context3.abrupt(\\\"return\\\", message.channel.send(new MessageEmbed().setColor(ee.wrongcolor).setFooter(ee.footertext, ee.footericon).setTitle(String(\\\"Found nothing for: **`\\\" + search).substr(0, 256 - 3) + \\\"`**\\\").setDescription(\\\"Please retry!\\\")));\\n\\n case 33:\\n case \\\"end\\\":\\n return _context3.stop();\\n }\\n }\\n }, null, null, [[10, 27]]);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ed43eee33ab9d2f7974d21b20b28a60\",\n \"score\": \"0.5936916\",\n \"text\": \"function syncUserSong() {\\n $.get(\\\"/musicify/sync-user-song/\\\"+host)\\n .done(function(data) {\\n var audioPlayer = $(\\\"#id-music-player\\\");\\n var currentSong = audioPlayer[0];\\n\\n // The song only plays when the user is in his channel\\n if (data.track_id !== '' && !isUserLeftChannel && parseInt(data.start_time) <= parseInt(data.length)){\\n $('#id-loading').hide();\\n $('#id-waiting-content').hide();\\n $('#id-not-live-icon').hide();\\n $('#id-live-icon').show();\\n $(\\\"#id-page-content\\\").show();\\n $(\\\"#messaging-content\\\").removeClass('col-md').addClass('col-md-6');\\n if (current_track_id !== data.track_id){\\n $(\\\"#id-cover\\\").attr(\\\"src\\\", data.cover);\\n $(\\\"#id-name\\\").text(parseHtmlEnteties(data.name));\\n $(\\\"#id-artist\\\").text(parseHtmlEnteties(data.artist));\\n $(\\\"#id-track\\\").val(data.track_id);\\n current_track_id = data.track_id;\\n $(\\\"#id-page-content\\\").show();\\n start_time = parseInt(data.start_time);\\n\\n // Play song from current data\\n audioPlayer.attr(\\\"src\\\", data.preview);\\n currentSong.currentTime = data.start_time;\\n }\\n\\n if (data.status !== 'Playing' && currentSong.played){\\n currentSong.pause();\\n } else if (data.status === 'Playing' && currentSong.paused) {\\n // Use this to avoid the race condition between play() and pause()\\n setTimeout(function () {\\n currentSong.play();\\n }, 150);\\n }\\n } else { // User NOT in their channel:\\n $('#id-loading').show();\\n $(\\\"#id-page-content\\\").hide();\\n $(\\\"#messaging-content\\\").removeClass('col-md-6').addClass('col-md');\\n $('#id-waiting-content').show();\\n $('#id-not-live-icon').show();\\n $('#id-live-icon').hide();\\n if (currentSong.played){\\n currentSong.pause();\\n }\\n }\\n })\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4ae5f5d871356ea76cb5f232b172fd5\",\n \"score\": \"0.59364337\",\n \"text\": \"async function playsongyes(message, queue, song) {\\n const emojiList = {\\n PlayPause: \\\"851372996660428824\\\",\\n Next: \\\"851372996023418902\\\",\\n Backward: \\\"851372995779887126\\\",\\n Forward: \\\"851372995518791710\\\",\\n Stop: \\\"851372996051861504\\\",\\n Loop: \\\"851372997000429589\\\",\\n Queue: \\\"851372999684915200\\\",\\n VolumeUp: \\\"851372997763399720\\\",\\n VolumeDown: \\\"851372997678989312\\\",\\n Refresh: \\\"851377294739374091\\\",\\n };\\n playingMessage;\\n try {\\n let isPaused = await client.distube.isPaused(message);\\n let embed1 = new Discord.MessageEmbed()\\n .setColor(\\\"#0099ff\\\")\\n .setTitle(isPaused ? \\\"Paused\\\" : \\\"Now Playing\\\")\\n .setDescription(\\n `Playing ${song.name}\\\\nDuration: **${\\n song.formattedDuration\\n }**\\\\nDuration ${queue.formattedCurrentTime} / ${\\n song.formattedDuration\\n }\\\\nRequested by: ${song.user}\\\\nAutoplay: ${\\n queue.autoplay ? \\\"✅\\\" : \\\"❌\\\"\\n }\\\\nVolume: ${queue.volume}%\\\\n Loop: ${\\n queue.repeatMode\\n ? queue.repeatMode === 2\\n ? \\\"✅ Queue\\\"\\n : \\\"✅ Song\\\"\\n : \\\"Off\\\"\\n }\\\\nFilter: ${queue.filter || \\\"❌\\\"}`\\n )\\n .setFooter(\\n message.author.tag,\\n message.member.user.displayAvatarURL({ dynamic: true })\\n )\\n .setThumbnail(song.thumbnail);\\n var playingMessage = await message.channel.send(embed1);\\n try {\\n await playingMessage.react(emojiList.Stop);\\n await playingMessage.react(emojiList.Next);\\n await playingMessage.react(emojiList.PlayPause);\\n await playingMessage.react(emojiList.Backward);\\n await playingMessage.react(emojiList.Forward);\\n await playingMessage.react(emojiList.VolumeDown);\\n await playingMessage.react(emojiList.VolumeUp);\\n await playingMessage.react(emojiList.Loop);\\n await playingMessage.react(emojiList.Queue);\\n await playingMessage.react(emojiList.Refresh);\\n } catch (error) {\\n message.reply(\\\"Missing permissions, i need to add reactions!\\\");\\n console.log(error);\\n }\\n const emojiName = {\\n PlayPause: client.emojis.cache.get(emojiList.PlayPause).name,\\n Next: client.emojis.cache.get(emojiList.Next).name,\\n Backward: client.emojis.cache.get(emojiList.Backward).name,\\n Forward: client.emojis.cache.get(emojiList.Forward).name,\\n Stop: client.emojis.cache.get(emojiList.Stop).name,\\n Loop: client.emojis.cache.get(emojiList.Loop).name,\\n Queue: client.emojis.cache.get(emojiList.Queue).name,\\n VolumeUp: client.emojis.cache.get(emojiList.VolumeUp).name,\\n VolumeDown: client.emojis.cache.get(emojiList.VolumeDown).name,\\n Refresh: client.emojis.cache.get(emojiList.Refresh).name,\\n };\\n const filter = (reaction, user) =>\\n [emojiName] && user.id !== message.client.user.id;\\n var collector = playingMessage.createReactionCollector(filter, {\\n time: song.duration > 0 ? song.duration * 1000 : 600000,\\n });\\n collector.on(\\\"collect\\\", async (reaction, user) => {\\n let isPaused = await client.distube.isPaused(message);\\n let queue = await client.distube.getQueue(message);\\n if (!message.member.voice.channel) {\\n reaction.users.remove(user).catch(console.error);\\n return message.channel.send(\\n \\\"You must be in a voice channel to use the reaction commands.\\\"\\n );\\n }\\n if (!queue) return;\\n const member = message.guild.member(user);\\n if (\\n member.voice.connection &&\\n member.voice.connection !== member.guild.me.voice.connection\\n )\\n return;\\n\\n switch (reaction.emoji.name) {\\n case emojiName.Next:\\n client.distube.skip(message);\\n embedbuilder(\\n client,\\n message,\\n \\\"#0099ff8\\\",\\n \\\"SKIPPED!\\\",\\n `Skipped the song`\\n ).then((message) =>\\n message.delete({ timeout: 3000 }).catch(console.error)\\n );\\n playingMessage.reactions.removeAll().catch(console.error);\\n break;\\n\\n case emojiName.Stop:\\n client.distube.stop(message);\\n const stopEmbed = new Discord.MessageEmbed()\\n .setColor(\\\"#0099ff\\\")\\n .setTitle(\\\"STOPPED\\\")\\n .setDescription(\\\"Thanks for using the bot bye! byee!👋\\\");\\n message.channel.send(stopEmbed);\\n playingMessage.reactions.removeAll().catch(console.error);\\n break;\\n\\n case emojiName.VolumeDown:\\n reaction.users.remove(user).catch(console.error);\\n await client.distube.setVolume(message, Number(queue.volume) - 10);\\n embedbuilder(\\n client,\\n message,\\n \\\"#0099ff\\\",\\n \\\"Volume!\\\",\\n `Redused the Volume to \\\\`${queue.volume}\\\\``\\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\\n await playingMessage.edit(curembed(message)).catch(console.error);\\n break;\\n\\n case emojiName.VolumeUp:\\n reaction.users.remove(user).catch(console.error);\\n await client.distube.setVolume(message, Number(queue.volume) + 10);\\n embedbuilder(\\n client,\\n message,\\n \\\"#0099ff\\\",\\n \\\"Volume!\\\",\\n `Raised the Volume to \\\\`${queue.volume}\\\\``\\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\\n await playingMessage.edit(curembed(message)).catch(console.error);\\n break;\\n\\n case emojiName.Backward:\\n reaction.users.remove(user).catch(console.error);\\n let seektime = queue.currentTime - 10000;\\n if (seektime < 0) seektime = 0;\\n await client.distube.seek(message, Number(seektime));\\n playingMessage.edit(curembed(message)).catch(console.error);\\n embedbuilder(\\n client,\\n message,\\n \\\"#0099ff\\\",\\n \\\"Seeked!\\\",\\n `Seeked the song for \\\\`-10 seconds\\\\``\\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\\n\\n break;\\n\\n case emojiName.Forward:\\n reaction.users.remove(user).catch(console.error);\\n let seektime2 = queue.currentTime + 10000;\\n if (seektime2 >= queue.songs[0].duration * 1000) {\\n seektime2 = queue.songs[0].duration * 1000 - 1;\\n }\\n console.log(seektime2);\\n await client.distube.seek(message, seektime2);\\n playingMessage.edit(curembed(message)).catch(console.error);\\n embedbuilder(\\n client,\\n message,\\n \\\"#0099ff\\\",\\n \\\"Seeked!\\\",\\n `Seeked the song for \\\\`+10 seconds\\\\``\\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\\n break;\\n case emojiName.PlayPause:\\n reaction.users.remove(user).catch(console.error);\\n if (isPaused) {\\n client.distube.resume(message, queue);\\n } else if (!isPaused) {\\n client.distube.pause(message, queue);\\n }\\n playingMessage.edit(curembed(message)).catch(console.error);\\n embedbuilder(\\n client,\\n message,\\n \\\"#0099ff\\\",\\n isPaused ? \\\"Resume\\\" : \\\"Paused\\\",\\n `The music was ${isPaused ? \\\"resume\\\" : \\\"paused\\\"}`\\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\\n break;\\n case emojiName.Queue:\\n reaction.users.remove(user).catch(console.error);\\n let currentPage = 0;\\n if (!queue)\\n return embedbuilder(\\n client,\\n message,\\n \\\"RED\\\",\\n \\\"There is nothing playing!\\\"\\n ).then((msg) => msg.delete({ timeout: 5000 }).catch(console.error));\\n\\n const embeds = QueueEmbed(queue.songs);\\n const queueEmbed = await message.channel.send(\\n `\\n **Current Page - ${currentPage + 1}/${embeds.length}**`,\\n embeds[currentPage]\\n );\\n try {\\n await queueEmbed.react(\\\"⬅️\\\");\\n await queueEmbed.react(\\\"⏹\\\");\\n await queueEmbed.react(\\\"➡️\\\");\\n } catch (error) {\\n console.error(error);\\n }\\n const filter = (reaction, user) =>\\n [\\\"⬅️\\\", \\\"⏹\\\", \\\"➡️\\\"].includes(reaction.emoji.name) &&\\n message.author.id === user.id;\\n const collector = queueEmbed.createReactionCollector(filter, {\\n time: 60000,\\n });\\n collector.on(\\\"collect\\\", async (reaction, user) => {\\n try {\\n if (reaction.emoji.name === \\\"➡️\\\") {\\n if (currentPage < embeds.length - 1) {\\n currentPage++;\\n queueEmbed.edit(\\n `**Current Page - ${currentPage + 1}/${embeds.length}**`,\\n embeds[currentPage]\\n );\\n }\\n } else if (reaction.emoji.name === \\\"⬅️\\\") {\\n if (currentPage !== 0) {\\n --currentPage;\\n queueEmbed.edit(\\n `**Current Page - ${currentPage + 1}/${embeds.length}**`,\\n embeds[currentPage]\\n );\\n }\\n } else {\\n collector.stop();\\n reaction.message.reactions.removeAll();\\n }\\n await reaction.users.remove(message.author.id);\\n } catch (error) {\\n console.error(error);\\n }\\n });\\n break;\\n\\n case emojiName.Loop:\\n client.distube.setRepeatMode(message);\\n playingMessage.edit(curembed(message)).catch(console.error);\\n embedbuilder(\\n client,\\n message,\\n \\\"#0099ff\\\",\\n `Loop ${\\n queue.repeatMode\\n ? queue.repeatMode === 2\\n ? \\\"✅ Queue\\\"\\n : \\\"✅ Song\\\"\\n : \\\"Off\\\"\\n }`,\\n `Loop: ${\\n queue.repeatMode\\n ? queue.repeatMode === 2\\n ? \\\"✅ Queue\\\"\\n : \\\"✅ Song\\\"\\n : \\\"Off\\\"\\n }`\\n ).then((msg) => msg.delete({ timeout: 3000 }).catch(console.error));\\n await reaction.users.remove(message.author.id);\\n break;\\n case emojiName.Refresh:\\n reaction.users.remove(user).catch(console.error);\\n playingMessage.edit(curembed(message)).catch(console.error);\\n await reaction.users.remove(message.author.id);\\n break;\\n default:\\n reaction.users.remove(user).catch(console.error);\\n break;\\n }\\n });\\n collector.on(\\\"end\\\", () => {\\n playingMessage.reactions.removeAll().catch(console.error);\\n });\\n } catch (error) {\\n console.log(error);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d81db74c0eef0ba65707e91c65005c51\",\n \"score\": \"0.59339184\",\n \"text\": \"function getSongs() {\\n $.ajax({\\n type: 'GET',\\n url: '/songs',\\n success: function(data) {\\n $('#song-list').empty();\\n // append each song to the DOM\\n data.forEach(function(song, i) {\\n appendDOM(song);\\n });\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e13c8b61078c4368397109ea7df6c35a\",\n \"score\": \"0.59332544\",\n \"text\": \"function playQueue(position) {\\n //If empty queue, just return\\n if (localStorage.getItem(\\\"length\\\") === null) {\\n return;\\n }\\n\\n //If top title doesn't exist insert it\\n if(!$('#top-search-form').length) {\\n insertTopSearchBar();\\n $(\\\"#ppQueue\\\").empty();\\n $(\\\"#ppQueue\\\").append(\\\"<button onclick='pauseQueue(0)'><i class='fa fa-pause'></i></button>\\\");\\n }\\n\\n //Gets top of list on queue\\n var found = false;\\n var i = position;\\n\\n // Continues to find the next song that is available closest to the position\\n while (!found) {\\n //At the end of length\\n if(i == parseInt(localStorage.getItem('length')) && loop == false) {\\n closeAllVideo();\\n $(\\\"#ppQueue\\\").empty();\\n $(\\\"#ppQueue\\\").append(\\\"<button onclick='playQueue(0)'><i class='fa fa-play'></i></button>\\\");\\n return;\\n }\\n else if (i == parseInt(localStorage.getItem('length')) && loop == true) {\\n playQueue(0);\\n return;\\n }\\n\\n if (localStorage.getItem(i.toString()) != null) {\\n found = true; \\n // Highlights the song on the queue bar\\n $('#li' + i).css('background-color','#71B500');\\n $('#li' + i + ' button').css('background-color','#71B500');\\n // Set the position to the song currently playing position\\n setCurrentPosition(i.toString());\\n // Go to displaying song if youtube or soundcloud\\n displayVideoOrTrack(localStorage.getItem(i.toString())); \\n }\\n ++i;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e11972240dfe87e208a5b82241d4cf4d\",\n \"score\": \"0.5924375\",\n \"text\": \"youtubePlayer (msg) {\\r\\n msg.member.voiceChannel.join()\\r\\n .then(connection => {\\r\\n ytSearch(musicQue.playList[0])\\r\\n .then((data) => {\\r\\n const stream = ytdl(data.link, { filter: 'audioonly' });\\r\\n const dispatcher = connection.playStream(stream);\\r\\n dispatcher.on('end', () => {\\r\\n if (musicQue.playList[1]) {\\r\\n musicQue.playList.shift();\\r\\n msg.say('Now playing ' + musicQue.playList[0])\\r\\n this.youtubePlayer(msg)\\r\\n } else {\\r\\n msg.member.voiceChannel.leave(),\\r\\n musicQue.playList.shift()\\r\\n }\\r\\n })\\r\\n })\\r\\n })\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7be7de194b93e05ace6d0bff04e8d361\",\n \"score\": \"0.5916247\",\n \"text\": \"function playNowFromQueue() {\\n // Listen for a click\\n $(document).on('click', '.video-queue .play-now', function () {\\n // Fetch the passed video id\\n var videoId = $(this).data('video-id');\\n // Fetch the position of the chosen song\\n var position = $(this).data('position');\\n\\n // Remove the clicked element\\n $('#' + position).remove();\\n\\n // If the queue is empty\\n if (queue.length == 0 || queue.length < 1) {\\n // We need to build the currentSong from the suggestions list\\n currentSong = {\\n 'position': position,\\n 'videoId': videoId,\\n 'title': suggestions[position]['snippet']['title'],\\n 'duration': convert_time(suggestions[position]['contentDetails']['duration']),\\n 'thumbnail': suggestions[position]['snippet']['thumbnails']['high']['url']\\n };\\n // If there is a queue\\n } else {\\n // Get the song from the queue list based on it's position\\n currentSong = findElement(queue, 'position', position);\\n\\n // Start the video\\n player.loadVideoById(currentSong['videoId']);\\n\\n // If the previous song was in queue\\n if (findElement(queue, 'videoId', currentSong['videoId']) !== 'undefined') {\\n // Remove it\\n findAndRemove(queue, 'videoId', currentSong['videoId']);\\n }\\n\\n // Show suggestions based on the new song\\n showSuggestions(videoId);\\n }\\n\\n // Show suggestions based on the new song\\n showSuggestions(currentSong['videoId']);\\n // Start the new song\\n player.loadVideoById(currentSong['videoId']);\\n // Display the song information in the bottom tray\\n displayCurrentSong();\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1fc5c3154fa802869630bc1956f740d\",\n \"score\": \"0.59047335\",\n \"text\": \"function sendQueue() {\\n\\tfor (var i = 0; i < queue.length; ++i) {\\n\\t\\tvar record = queue[i];\\n\\t\\tfetch('/api/v1/records', {\\n\\t\\t\\tmethod: 'POST', // *GET, POST, PUT, DELETE, etc.\\n\\t\\t\\tmode: 'same-origin', // no-cors, *cors, same-origin\\n\\t\\t\\tcache: 'no-cache', // *default, no-cache, reload, force-cache, only-if-cached\\n\\t\\t\\tcredentials: 'same-origin', // include, *same-origin, omit\\n\\t\\t\\theaders: {\\n\\t\\t\\t\\t// 'Content-Type': 'application/json'\\n\\t\\t\\t\\t// 'Content-Type': 'application/x-www-form-urlencoded',\\n\\t\\t\\t\\t'Content-Type': 'application/vnd.api+json'\\n\\t\\t\\t},\\n\\t\\t\\tredirect: 'follow', // manual, *follow, error\\n\\t\\t\\treferrerPolicy: 'no-referrer', // no-referrer, *no-referrer-when-downgrade, origin, origin-when-cross-origin, same-origin, strict-origin, strict-origin-when-cross-origin, unsafe-url\\n\\t\\t\\tbody: JSON.stringify({\\n\\t\\t\\t\\tdata: {\\n\\t\\t\\t\\t\\ttype: 'records',\\n\\t\\t\\t\\t\\tattributes: {\\n\\t\\t\\t\\t\\t\\tgeohash: record.hash,\\n\\t\\t\\t\\t\\t\\thits: record.hits,\\n\\t\\t\\t\\t\\t\\treaction: record.type\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}) // body data type must match \\\"Content-Type\\\" header\\n\\t\\t}).then((response) => {\\n\\t\\t\\treturn response.json();\\n\\t\\t}).then((data) => {\\n\\t\\t\\tconsole.log(data);\\n\\t\\t});\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f53c520cd3bb04a9d2deedfa059e52a\",\n \"score\": \"0.58983886\",\n \"text\": \"async function Start() {\\n var temp = await getAllSoundtracks();\\n temp = globalSongs;\\n request = temp;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b486325a4bdb0f565d9b74eca00c54fe\",\n \"score\": \"0.58809793\",\n \"text\": \"function updateUserQueue(updated_queue) {\\n queue = updated_queue[getCookie(\\\"user_id\\\")];\\n console.log(\\\"Updating user queue!\\\");\\n document.getElementById(\\\"userQueue\\\").innerHTML = \\\"\\\";\\n for (let song of queue) {\\n var songInfo = song[0];\\n // Note: songInfo[0] is song URI\\n var albumImg = song[1];\\n var queueImg = document.createElement(\\\"img\\\");\\n queueImg.src = albumImg;\\n queueImg.style.width = \\\"100%\\\";\\n document.getElementById(\\\"userQueue\\\").appendChild(queueImg);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb5ec7a6d6ee9d63e57a8d9952c2ad45\",\n \"score\": \"0.5866461\",\n \"text\": \"function refreshSongList() {\\r\\n masterGame = $('#game').val();\\r\\n masterSongList = [];\\r\\n utils_socket.emit('game', gameDict[masterGame]);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a632e4de63cc102e54d4a678d9b9fe81\",\n \"score\": \"0.5863859\",\n \"text\": \"function playsong() {\\n\\t$('.play_song_class').click(function() {\\n\\t\\tvar song_id = $(this).data('song');\\n\\t\\tvar song_name = $(this).data('song_name');\\n\\t\\tvar artist_name = $(this).data('artist_name');\\n\\t\\tvar artist_id = $(this).data('artist_id');\\n\\t\\tvar album_id = $(this).data('album_id');\\n\\t\\tvar cover = $(this).data('cover');\\n\\n\\t\\t// set jquery sessions for playbar\\n\\t\\t$.session.set('song_id', song_id);\\n\\t\\t$.session.set('song_name', song_name);\\n\\t\\t$.session.set('artist_name', artist_name);\\n\\t\\t$.session.set('artist_id', artist_id);\\n\\t\\t$.session.set('album_id', album_id);\\n\\t\\t$.session.set('cover', cover);\\n\\n\\t\\t// add 1 play\\n\\t\\t$.ajax({\\n\\t\\t\\turl: 'classes/class.artist.php',\\n\\t\\t\\ttype: \\\"POST\\\",\\n\\t\\t\\tdata: {\\n\\t\\t\\t\\tsong_id: song_id,\\n\\t\\t\\t\\taction: 'add_play',\\n\\t\\t\\t},\\n\\t\\t\\tsuccess: function(response) {\\n\\t\\t\\t\\tconsole.log(response);\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\t// load playbar again for setting new song data\\n\\t\\t$('#playbar_wrapper_loader').load('includes/playbar.php');\\n\\t\\tsetTimeout(function(){\\n\\t\\t\\t$('#play-btn').trigger('click');\\n\\t\\t}, 300);\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49136c7384c0910a6889faaa183a4963\",\n \"score\": \"0.58592504\",\n \"text\": \"componentDidMount() {\\n this.socket = io();\\n let that = this;\\n $.ajax({\\n method: 'GET',\\n url: \\\"http://192.168.1.19:3000/songQueue\\\",\\n contentType: 'application/json',\\n dataTyle: 'json',\\n success: data => {\\n that.setState({\\n firstSong: data.shift(),\\n songInfo: data\\n });\\n // listen for playSong emit events\\n this.socket.on('playSong', this.handleServerPlayEvent);\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55b3df5cab1b0fd8a5760a462feb9545\",\n \"score\": \"0.5851971\",\n \"text\": \"function loadSongs() {\\n API.getSongs()\\n .then((res) => setSongs(res.data))\\n .catch((err) => console.log(err));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b8c0f59737e1e7ac0e9de9a96debbfa\",\n \"score\": \"0.584566\",\n \"text\": \"function refreshPlayList () {\\n\\t\\tplayList = []\\t\\t\\n\\t\\tvar trs = $('#tabla_usuario tr')\\n\\t\\ttrs.each(function() {\\n\\t\\t\\tvar nombre = $(this).find('.nombre_de_cancion a').attr('data-nombre')\\n\\t\\t\\tvar mp3 = $(this).find('.nombre_de_cancion a').attr('data-url')\\n\\t\\t\\tvar item_id = $(this).attr('id')\\n\\t\\t\\tplayList.push({ nombre: nombre, mp3: mp3, item_id: item_id })\\t\\t\\t\\t\\n\\t\\t})\\t\\n\\t\\tif (playList.length == 1) {\\t\\t\\t\\n\\t\\t\\t$('#jquery_jplayer_1').jPlayer(\\\"setMedia\\\", {\\n\\t \\tmp3: playList[0].mp3\\n \\t\\t})\\n \\t\\t$(\\\"#jquery_jplayer_1\\\").jPlayer(\\\"play\\\"); \\n\\t\\t $('.jp-title ul li').text(playList[0].nombre)\\n\\t\\t} \\t\\t\\t\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1c6c1ea7f9752c049d6eec398ae5514\",\n \"score\": \"0.5840909\",\n \"text\": \"async function songClicked($this) {\\n\\tconsole.log('songClicked');\\n\\t// update the current song\\n\\tawait updateSong($this);\\n\\t// render the room\\n\\trenderRoom();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd8e2a4ee3f4c28a26d0fae0c11bf143\",\n \"score\": \"0.58402884\",\n \"text\": \"getAllSounds() {\\n this.get('api').request('getAllSounds');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3dbedfa0a14a74ee46c58cd102499a5\",\n \"score\": \"0.58387405\",\n \"text\": \"function songs(){\\n const spotify = new Spotify({\\n id: keys.spotify.id,\\n secret: keys.spotify.secret\\n });\\n \\n spotify.search({ type: \\\"track\\\", query: info }, function(err, data) {\\n if (!err) {\\n for(var i = 0; i < data.tracks.items.length; i++){\\n var songData = data.tracks.items[i];\\n //artist\\n console.log(\\\"Artist: \\\" + songData.artists[0].name);\\n //song name\\n console.log(\\\"Song: \\\" + songData.name);\\n //spotify preview link\\n console.log(\\\"Preview URL: \\\" + songData.preview_url);\\n //album name\\n console.log(\\\"Album: \\\" + songData.album.name);\\n console.log(\\\"------------------------------------------------------------------------------\\\");\\n }\\n }\\n else{\\n console.log('Error occurred.');\\n }\\n \\n });\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea41e0a8cefa004a2d1de2a71dbbbdb8\",\n \"score\": \"0.58370084\",\n \"text\": \"function play(connection, message) {\\n var server = servers[message.guild.id];\\n // Download link to YT video, and plays it\\n // Filter out the video to save bandwidth\\n server.dispatcher = connection.playStream(ytdl(server.queue[0], {filter: \\\"audioonly\\\"}));\\n server.queue.shift();\\n server.dispatcher.on(\\\"end\\\", function() {\\n // If there is another song to play in the queue\\n if (server.queue[0]) {\\n play(connection, message);\\n } else {\\n connection.disconnect();\\n }\\n });\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5352eb6566128cb50c3943a21b0d32e\",\n \"score\": \"0.58366114\",\n \"text\": \"function requestPlay(i){\\n ipcRenderer.send('playRequest', i);\\n ipcRenderer.on('toPlay', (event, file) => {\\n\\tconsole.log('voy a intentar reproducir a ver que pasa');\\n\\t//file.appendTo('body');\\n })\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b15474c1fb31bc8d854b1a78e24e2621\",\n \"score\": \"0.58319867\",\n \"text\": \"function index (req, res, next) {\\n Playlist.find({ owner: req.decoded._id}, {songs: 0}, function(err, playlists){\\n if (err) return console.log(err)\\n\\n res.json(playlists);\\n })\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33704cd22264f6a568b5cf02449fc6ab\",\n \"score\": \"0.5826362\",\n \"text\": \"function getPlayingSong(req,res,next){\\n\\tvar query = \\\"SELECT title,artist,album,nsurl FROM users u, currentSongs c WHERE c.clientID='\\\" + req.params.clientID + \\\"' and c.clientID = u.clientID;\\\";\\t\\n\\tconsole.log(query);\\t\\n\\tconnection.query(query, function(err, results) {\\n if(err) res.send(400);\\n res.send(results);\\n next();\\n \\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d75bdba9a35a54518efb816de0e93ba3\",\n \"score\": \"0.5824579\",\n \"text\": \"playSong() {\\n const { track } = this.props;\\n if (track) {\\n // update the song to show as playing so the list will not\\n // reorder and move this item\\n Meteor.collection('tracks').update(track._id, {\\n $set: {\\n playing: true,\\n },\\n });\\n if (this.state.initialized) {\\n fade(true);\\n SpotifyAuth.playURI(track.uri, () => {\\n setPlaying(track.uri);\\n this.startPlayBackPositionTimer();\\n });\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3176ba659db5a14de84ef78291bffd85\",\n \"score\": \"0.5820786\",\n \"text\": \"async function execute(message, serverQueue) {\\n const args = message.content.split(' ');\\n const voiceChannel = message.member.voiceChannel;\\n if(!voiceChannel) return message.channel.send('You need to be in a voice channel to play music!');\\n const permissions = voiceChannel.permissionsFor(message.client.user);\\n if(!permissions.has('CONNECT') || !permissions.has('SPEAK')) {\\n return message.channel.send('I need the permissions to join and speak in your voice channel!')\\n }\\n\\n //get song info and save into a song object\\n const songInfo = await ytdl.getInfo(args[2])\\n const song = {\\n title: songInfo.title,\\n url: songInfo.video_url,\\n };\\n\\n //create a contract we can add to our queue\\n if(!serverQueue) {\\n const queueContruct = {\\n textChannel: message.channel,\\n voiceChannel: voiceChannel,\\n connection: null,\\n songs: [],\\n volume: 5,\\n playing: true,\\n };\\n\\n queue.set(message.guild.id, queueContruct);\\n\\n queueContruct.songs.push(song);\\n\\n try {\\n var connection = await voiceChannel.join();\\n queueContruct.connection = connection;\\n play(message.guild, queueContruct.songs[0]);\\n } catch (err) {\\n console.log(err);\\n queue.delete(message.guild.id);\\n return message.channel.send(err);\\n }\\n }\\n else {\\n serverQueue.songs.push(song);\\n console.log(serverQueue.song);\\n return message.channel.send(`${song.title} has been added to the queue!`);\\n }\\n\\n}//end execute\",\n \"title\": \"\"\n },\n {\n \"docid\": \"192e2d4af15a6e70fe176f254b0cff64\",\n \"score\": \"0.5820023\",\n \"text\": \"function getMusic() {\\r\\n var artist = document.getElementById('artist').value;\\r\\n itunes.getMusicByArtist(artist).then(drawSongs);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba3d58f7f52f953e6caeab08d0967169\",\n \"score\": \"0.58180237\",\n \"text\": \"async function getSongs (req,res){\\n try{\\n var songs = await controller.findAllSongs();\\n res.status(200).send(songs);\\n }\\n catch(e){\\n res.status(500).send('hubo un error al mostrar la lista de canciones' + e);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60a68988a5a00c67a4413e29ba5e16db\",\n \"score\": \"0.58156514\",\n \"text\": \"function playSong(id) {\\n //Stop the sound from playing\\n\\t\\n soundManager.destroySound(mySound);\\n\\t\\n\\t//console.log('playing song id => '+ id);\\n //If we're under, just go to the end!\\n if (id < 0)\\n id = songs.length - 1;\\n \\n //If we're over, choose what to do via the repeat flag\\n if (id >= songs.length)\\n id = 0;\\n \\n //Save some variables\\n playingSongId = id;\\n playingSong = songs[playingSongId];\\n\\tsetCoverart(playingSong.visual);\\n //Toggle the pause\\n setPauseState(soundManager.togglePause(mySound).paused);\\n \\n var track_url = playingSong.filepath.replace('/home/galizur/public_html/', 'http://www.galizur.com/'); \\n $.post('http://www.galizur.com/home/mobile/update_play', {myid : playingSong.myid}, 'activate', 'jsonp');\\n //Create the sound and begin playing whenever!\\n \\n soundManager.setup({\\n\\t\\turl :'swf/',useHTML5Audio: true,\\n\\t\\tpreferFlash: true,\\n\\t\\tonready: function() {\\n // SM2 has started - now you can create and play sounds!\\n soundManager.createSound({\\n id: mySound,\\n url: track_url,\\n autoPlay: true,\\n stream: true,\\n onplay: function () {\\n setPlayingInfo(playingSong.basename);\\n setPauseState(false);\\n setPlayTime();\\n\\t\\t\\t\\t\\t\\t//playerFooter.prepend($('<div>'+playingSong.basename+'</div>')).fadeIn('Slow');\\n playerFooter.html('<div>'+playingSong.basename+'</div>').fadeIn('Slow');\\n\\n },\\n onfinish: function() {\\n //We'll only continue if we're shuffling or repeating if we past the end...\\n if (shuffle == false && (playingSongId + 1 >= songs.length) && repeat == false) {\\n //No more songs...\\n setPlayingInfo();\\n setPauseState(false);\\n setPlayTime();\\n playingSong = null;\\n playingSongId = null;\\n return;\\n }\\n else {\\n playNextSong();\\n }\\n },\\n onload: function () {\\n playingSong.duration = this.duration / 1000;\\n },\\n whileplaying: function () {\\n setPlayTime(this.position / 1000, playingSong.duration, this.durationEstimate / 1000);\\n }\\n });\\n\\t\\n\\t}\\n\\t\\n});\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff1990570c783568d5ab221c3fbac0f2\",\n \"score\": \"0.58079493\",\n \"text\": \"getNowPlaying(){\\n getNowPlaying()\\n .then(data => {\\n this.setState({items: data.results}, this.setAvailableGenres);\\n this.updateList()},\\n (error) => {this.error(error)});\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"651726732fd29831116ddb54cffd8a45\",\n \"score\": \"0.58070487\",\n \"text\": \"function deezer_play(query) {\\n DZ.api('/search/?q=' + query + '&index=0&nb_items=5&output=json', function(response) {\\n var tracks = $.map(response.data, function(track) { return track.id })\\n if(tracks.length) {\\n DZ.player.playTracks(tracks);\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56010b1b1ae077ce489fcda15c215f34\",\n \"score\": \"0.5806765\",\n \"text\": \"_onSubmit(event) {\\n event.preventDefault();\\n\\n this.audioPlayer.setSong(this.songThemeMap.songValue);\\n this.audioPlayer.setKickCallback(this._onKick);\\n this.audioPlayer.play();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a2cf44e2ce8039571a9dc40f4823daf\",\n \"score\": \"0.5804129\",\n \"text\": \"function updatePlayCount() {\\n /*\\n Richiama la pagina contenente la query che aggiorna il database aggiungendo 1 al numero di riproduzioni della\\n traccia attualmente riprodotta dall'utente.\\n */\\n\\n $.ajaxSetup({\\n headers: {\\n 'X-CSRF-TOKEN': $('meta[name=\\\"csrf-token\\\"]').attr('content')\\n }\\n });\\n $.post(\\\"/listened/\\\" + parseInt(Amplitude.getActiveSongMetadata().id), {}, function (data, status, xhr) {}, \\\"json\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"946c832274c5b15f6aa46d374486a8f3\",\n \"score\": \"0.579815\",\n \"text\": \"playNextVox() {\\n console.log(\\\"playNextVox this.vox_queue = \\\", this.vox_queue);\\n var data = this.vox_queue.shift(); // unshift PUTS elements\\n console.log(\\\"voxEnd event dispatched\\\");\\n if (this.vox_queue.length !== 0) {\\n var doPlay = (delay) => {\\n if (this.vox_queue[0].state() !== \\\"loaded\\\") {\\n setTimeout(doPlay, Math.min(1000, delay * 2));\\n console.log(\\\"Waiting for voice to load.\\\");\\n return;\\n } else {\\n this.vox_queue[0].play();\\n console.log(\\\"Voice loaded.\\\");\\n }\\n }\\n doPlay(50);\\n } else {\\n document.dispatchEvent(\\n new CustomEvent('allVoxEnd', {\\n detail: {\\n name: data._src.substring(data._src.lastIndexOf(\\\"/\\\"))\\n }\\n })\\n );\\n console.log(\\\"allVoxEnd event dispatched\\\");\\n return;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21256a8c31549cf467d3ad87b6049c3b\",\n \"score\": \"0.57952654\",\n \"text\": \"function jElectroPlay() {\\n playSong2();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25ad071e68efac18b9037f7150ed40be\",\n \"score\": \"0.57764596\",\n \"text\": \"play() {\\n\\t\\tthis.updatePlayState();\\n\\t\\tthis.callback('play');\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67ee76174a071a12c87c6d365477810a\",\n \"score\": \"0.57713926\",\n \"text\": \"function play(guild, song) {\\n const serverQueue = queue.get(guild.id);\\n\\n if (!song) {\\n serverQueue.voiceChannel.leave();\\n queue.delete(guild.id);\\n return;\\n }\\n\\n // after that, start playing song with playStream function and URL of our song\\n // this is a recursive function, so it cal itself over and over again = play the next song when the song is finished\\n const dispatcher = serverQueue.connection\\n .playStream(ytdl(song.url))\\n .on(\\\"end\\\", () => {\\n console.log(\\\"Music ended !\\\");\\n // Deöete the finished song from the queue\\n serverQueue.songs.shift();\\n // call the PLAY() again with next song\\n play(guild, serverQueue.songs[0]);\\n })\\n .on(\\\"error\\\", error => {\\n console.error(error);\\n });\\n dispatcher.setVolumeLogarithmic(serverQueue.volume / 5);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1466a1187b37fb69f12f3175b661c7fe\",\n \"score\": \"0.57701373\",\n \"text\": \"async function searchSong() {\\n let response = await fetch(\\n 'https://yt-music-api.herokuapp.com/api/yt/songs/' + input,\\n )\\n let result = await response.json()\\n setSongs(result.content)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da53deb8cdec509dfa41622e7fddad8f\",\n \"score\": \"0.5769967\",\n \"text\": \"onUpdate() {\\n if (this._player) {\\n if (!this.is_progress_dirty) {\\n this.setState({\\n progress: this._player.currentTime / this._player.duration\\n });\\n }\\n if (this._player.ended){\\n var songID=this.props.data_be.data_be.queue.find(el => el == this.props.song.song._id)\\n if(songID!==undefined){\\n this.props.RemoveQueue(songID,this.props.data_be.data_be._id,this.props.token.token,this.props.isQueue.isQueue)\\n }\\n if(this.props.isQueue.isQueue === false && this.props.currentPlaylist.currentPlaylist)\\n {\\n this.onPlayerNext();\\n }\\n else if(this.props.isQueue.isQueue === true && this.props.queue.queue)\\n {\\n this.props.PlayTheFooter(this.props.queue.queue[0])\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1b8c3cd4e198c1e801f0edea61d7658\",\n \"score\": \"0.57626903\",\n \"text\": \"addEventsToQueue(events) {\\n console.log('PlaybackStore::addEventsToQueue()');\\n\\n for (var e of events) {\\n var songs = Array();\\n var _pbstore = this;\\n e.eventArtists.forEach(function (ea) {\\n ea.artist.songs.forEach(function (s) {\\n _pbstore.songQueue.push(s);\\n });\\n });\\n }\\n\\n this.currentSong = this.songQueue[this.positionInQueue];\\n this.storeUpdated();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3cd03fa716b5b049b73ca2cddf75afb\",\n \"score\": \"0.57624626\",\n \"text\": \"handleSongFinished() {\\n this.next();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f7ac128d101dd2c9e579d503aaa2671\",\n \"score\": \"0.5761812\",\n \"text\": \"async play(db, text) {\\n let res = await axios.post(`http://${this.host}:${this.port}/voiceDB/local/play`, {\\n db,\\n text\\n })\\n return res.data;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"101f3d60498502dfc8e42a2c9b883433\",\n \"score\": \"0.57597923\",\n \"text\": \"next ()\\n {\\n // Try to pop an item from the queue and start playing it.\\n let next = this.queue.shift();\\n\\n if(next)\\n {\\n // Move on to playing the next thing\\n this.context.startPlay(next);\\n }\\n else\\n {\\n // Done playing everything.\\n this.context.stopPlay();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"052acc29aebd6d0a58e753f099e3b1dc\",\n \"score\": \"0.5755538\",\n \"text\": \"function play(guild, song) {\\n const serverQueue = queue.get(guild.id);\\n if (!song) {\\n serverQueue.voiceChannel.leave();\\n queue.delete(guild.id);\\n return;\\n }\\n const dispatcher = serverQueue.connection\\n .play(ytdl(song.url, {quality: 'highestaudio', highWaterMark: 1 << 25}))\\n .on(\\\"finish\\\", () => {\\n serverQueue.songs.shift();\\n play(guild, serverQueue.songs[0]);\\n })\\n .on(\\\"error\\\", error => console.error(error));\\n dispatcher.setVolumeLogarithmic(serverQueue.volume / 5);\\n serverQueue.textChannel.send(`${ePlaying}Start playing: **${song.title}**`);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4485d3e1d8e273cad2e38b699ae8c208\",\n \"score\": \"0.5755535\",\n \"text\": \"function playSong0(){\\n currentIndex = 0;\\n var nextIndex = currentIndex;\\n playTrack(nextIndex)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3fa30f7377c5c77382417662f06cb23\",\n \"score\": \"0.57506824\",\n \"text\": \"function playSong1(){\\n currentIndex = 1;\\n var nextIndex = currentIndex;\\n playTrack(nextIndex);\\n console.log(\\\"playing J-hip-hop\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71f5830d812564cecdea8cd986868c02\",\n \"score\": \"0.57422894\",\n \"text\": \"getMusic(e) {\\n e.preventDefault();\\n var artist = e.target.artist.value;\\n //changes the button to loading while songs load\\n //@ts-ignore\\n $('#get-music-button').text('LOADING....');\\n itunesService.getMusicByArtist(artist).then(results => {\\n drawSongs(results)\\n //changes button back to GET MUSIC once songs are loaded\\n //@ts-ignore\\n $('#get-music-button').text('GET MUSIC');\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6a6858b6f3a3acce04b1e240125115c\",\n \"score\": \"0.57409316\",\n \"text\": \"function jTraditional() {\\n playSong0();\\n console.log('playing song1');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9d457ecf57366c8bfaa3112575274a8\",\n \"score\": \"0.574017\",\n \"text\": \"play(nextSong) {\\n const channel = this.client.channels.get(this.message.member.voiceChannelID);\\n\\n channel.join().then(connection => {\\n\\n if (nextSong && nextSong.url) {\\n this.message.reply(nextSong.url);\\n this.playYoutubeSong(nextSong, connection);\\n } else {\\n return this.getYoutubeSearchResults().then(song => {\\n this.message.reply(song.url);\\n this.playYoutubeSong(song, connection)\\n });\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea2996ba1d8a7c371e9db5467ee2ee30\",\n \"score\": \"0.57393384\",\n \"text\": \"function playSound(){\\n songObj.song.play();\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f976f3b55de45c8dceea9dea1b89116\",\n \"score\": \"0.5737815\",\n \"text\": \"function showSongsList(){\\n\\t\\n\\t $.mobile.changePage(\\\"#showSongsLists\\\");\\n\\t $.each(songs, function(key, data){\\n\\t\\tvar a = $(\\\"<a href='#player'><h5 class='ui-li-heading'>\\\" + data.basename + \\\"</h5>\\\\n\\\\n\\\\\\n\\t\\t<p>Artist: \\\"+data.artist+\\\" </p><p> <span class='ui-li-count'>plays \\\"+ data.plays +\\\"</span></p></a>\\\");\\n $(a).click({ id: key }, function (event) {\\n playSong(event.data.id);\\n });\\n $('#playlistsSongs').append($(\\\"<li></li>\\\").html(a));\\n\\t\\t\\n\\t\\t});\\n\\t\\t$('#playlistsSongs').listview('refresh');\\n\\t\\t\\n\\treturn false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fe53e808a098909ce70bf0a5475dde9\",\n \"score\": \"0.57362247\",\n \"text\": \"@action\\n start() {\\n const proms = this.players.map(player => this.api.savePlayer(player.name));\\n Promise.all(proms)\\n .then(result => result.map(res => res.data))\\n .catch(console.error);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc49c3d033559667aee6a72df2c9df7b\",\n \"score\": \"0.57353073\",\n \"text\": \"function BL_updateNowPlaying() {\\n var title = BL_getTrack();\\n var artist = BL_getArtist();\\n var duration = BL_getDuration();\\n var newTrack = title + \\\" \\\" + artist;\\n\\n // Update scrobbler if necessary\\n if ( newTrack != \\\" \\\" && newTrack != BL_LAST_TRACK && duration > 0 ) {\\n //console.log(\\\"Submitting a now playing request. artist: \\\"+artist+\\\", title: \\\"+title+\\\", duration: \\\"+duration);\\n\\n BL_LAST_TRACK = newTrack;\\n chrome.runtime.sendMessage({type: 'validate', artist: artist, track: title}, function(response) {\\n if (response != false) {\\n // submit the validated song for scrobbling\\n var song = response;\\n chrome.runtime.sendMessage({type: 'nowPlaying', artist: song.artist, track: song.track, duration: duration});\\n } else {\\n // on failure send nowPlaying 'unknown song'\\n console.log( \\\"Song validation failed!\\\" );\\n chrome.runtime.sendMessage({type: 'nowPlaying', duration: duration});\\n }\\n });\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42bda0f3200f45c9417c0d13694d3822\",\n \"score\": \"0.57342213\",\n \"text\": \"function refreshSongList(){\\n\\n\\t// load in current songs to the player\\n\\t$.ajax({\\n\\t\\ttype: \\\"GET\\\",\\n\\t\\turl: 'http://localhost:3000/api/get_song_list',\\n\\t\\tdataType: 'json',\\n\\t\\tsuccess: function(res) {\\n\\t\\t\\tcurrentDisplayedSongs = res;\\n\\n\\t\\t\\t// empty previous list\\n\\t\\t\\t$(\\\"#song_list\\\").empty();\\n\\n\\t\\t\\t// if there are songs to display\\n\\t\\t\\tif (res.length > 0) {\\n\\n\\t\\t\\t\\t// display current playing song\\n\\t\\t\\t\\tvar image = new Image();\\n\\t\\t if (res[0].cover_url != null) image.src = res[0].cover_url;\\n\\t\\t \\n\\t\\t // insert image\\n\\t\\t var html = \\\"<li class=\\\\\\\"li_live\\\\\\\"><img class=\\\\\\\"song_album_art_live\\\\\\\" src=\\\\\\\"\\\"+image.src+\\\"\\\\\\\" />\\\";\\n\\n\\t\\t // insert track info\\n\\t\\t html += \\\"<div class=\\\\\\\"song_group_live\\\\\\\" >\\\";\\n\\t\\t html += \\\"<div class=\\\\\\\"song_name_live\\\\\\\" >\\\"+res[0].name+\\\"</div>\\\";\\n\\t\\t html += \\\"<div class=\\\\\\\"song_artist_live\\\\\\\" > \\\"+res[0].artist+\\\"</div>\\\";\\n\\t\\t html += \\\"<div class=\\\\\\\"song_album_live\\\\\\\">\\\"+res[0].album+\\\"</div></div></li><br>\\\";\\n\\t\\t // add song to list\\n\\t\\t $('#song_list').append(html);\\n\\n\\n\\t\\t\\t\\t// fill the other songs in\\n\\t\\t\\t\\tfor (var x = 1; x < res.length; x++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\timage = new Image();\\n\\t\\t\\t if (res[x].cover_url != null) image.src = res[x].cover_url;\\n\\t\\t\\t \\n\\t\\t\\t // insert image\\n\\t\\t\\t var html = \\\"<li><img class=\\\\\\\"song_album_art\\\\\\\" src=\\\\\\\"\\\"+image.src+\\\"\\\\\\\" />\\\";\\n\\n\\t\\t\\t // insert track info\\n\\t\\t\\t html += \\\"<div class=\\\\\\\"song_group\\\\\\\" >\\\";\\n\\t\\t\\t html += \\\"<div class=\\\\\\\"song_name\\\\\\\" >\\\"+res[x].name+\\\"</div>\\\";\\n\\t\\t\\t html += \\\"<div class=\\\\\\\"song_artist\\\\\\\" > \\\"+res[x].artist+\\\"</div>\\\";\\n\\t\\t\\t html += \\\"<div class=\\\\\\\"song_album\\\\\\\">\\\"+res[x].album+\\\"</div></div>\\\";\\n\\n\\t\\t\\t // insert voting box\\n\\t\\t\\t html +=\\t\\\"<div class=\\\\\\\"song_voteBox\\\\\\\">\\\";\\n\\t\\t\\t html += \\\"<button class=\\\\\\\"song_voteUp\\\\\\\" id=\\\\\\\"up-\\\"+x+\\\"\\\\\\\"> /\\\\\\\\ </button>\\\"\\n\\t\\t\\t html += \\\"<button class=\\\\\\\"song_voteDwn\\\\\\\" id=\\\\\\\"dwn-\\\"+x+\\\"\\\\\\\"> \\\\\\\\/ </button>\\\"\\n\\t\\t\\t html += \\\"</div><div class=\\\\\\\"song_voteNum\\\\\\\">\\\"+res[x].votes+\\\"</div>\\\"\\n\\t\\t\\t\\t\\thtml += \\\"</li><br>\\\";\\n\\n\\t\\t\\t // add song to list\\n\\t\\t\\t $('#song_list').append(html);\\n\\n\\t\\t\\t // apply listener to song_voteUp buton\\n\\t\\t\\t\\t\\t$('#up-'+x).click(function() {\\n\\n\\t\\t\\t\\t\\t\\t// get song id \\n\\t\\t\\t\\t\\t\\tvar tokens = $(this).attr('id').split(\\\"-\\\");\\n \\t\\t\\t\\t\\t\\tvar songID = tokens[1];\\n\\n\\t\\t\\t\\t\\t\\t// post song vote\\n\\t\\t\\t\\t\\t\\t$.ajax({\\n\\t\\t\\t\\t\\t\\t\\ttype: \\\"POST\\\",\\n\\t\\t\\t\\t\\t\\t\\turl: 'http://localhost:3000/api/vote_for_song',\\n\\t\\t\\t\\t\\t\\t\\tdata: {\\n\\t\\t\\t\\t\\t\\t\\t\\t'song': currentDisplayedSongs[songID].uri,\\n\\t\\t\\t\\t\\t\\t\\t\\t'vote': 'up'\\n\\t\\t\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\t\\t\\tdataType: 'json'\\n\\t\\t\\t\\t\\t\\t});\\t\\n\\t\\t\\t\\t\\t});\\n\\n\\t\\t\\t\\t\\t// apply listener to song_voteDwn buton\\n\\t\\t\\t\\t\\t$('#dwn-'+x).click(function() {\\n\\n\\t\\t\\t\\t\\t\\t// get song id \\n\\t\\t\\t\\t\\t\\tvar tokens = $(this).attr('id').split(\\\"-\\\");\\n \\t\\t\\t\\t\\t\\tvar songID = tokens[1];\\n\\n\\t\\t\\t\\t\\t\\t// post song vote\\n\\t\\t\\t\\t\\t\\t$.ajax({\\n\\t\\t\\t\\t\\t\\t\\ttype: \\\"POST\\\",\\n\\t\\t\\t\\t\\t\\t\\turl: 'http://localhost:3000/api/vote_for_song',\\n\\t\\t\\t\\t\\t\\t\\tdata: {\\n\\t\\t\\t\\t\\t\\t\\t\\t'song': currentDisplayedSongs[songID].uri,\\n\\t\\t\\t\\t\\t\\t\\t\\t'vote': 'dwn'\\n\\t\\t\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\t\\t\\tdataType: 'json'\\n\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t }\\n\\t\\t\\t}\\n\\t\\t}\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d07c43b0f563c077e63e70519a4f1ca1\",\n \"score\": \"0.5733467\",\n \"text\": \"function addSongsToViewMusic(sentSongs) {\\n\\n if (sentSongs === null ) { // If there are no songs sent to it then get the song info from the local songCollection Object\\n sentSongs = songCollection;\\n }\\n let songString = \\\"\\\";\\n $.each(sentSongs, (i, currentSong) => { \\n songString += `<div class=\\\"row\\\" db-key=\\\"${i}\\\">`; // Gives each <li> song item a special key based on the database key\\n songString += `<div class=\\\"col-xs-2\\\">`;\\n songString += `<span class=\\\"glyphicon glyphicon-trash dlt-song\\\" aria-hidden=\\\"true\\\"></span>`;\\n songString += `<span class=\\\"glyphicon glyphicon-edit edit-song\\\" aria-hidden=\\\"true\\\"></span>`;\\n songString += `</div>`;\\n songString += `<div class=\\\"col-xs-10\\\">`;\\n songString += `<li>`;\\n songString += `${currentSong.title} > ${currentSong.artist} on the album ${currentSong.album}`.replace(/[|;$!%@\\\"<()+,*]/g, \\\"\\\").replace(/\\\\>/g, \\\"-\\\");\\n songString += `</li>`;\\n songString += `</div>`;\\n songString += `</div>`;\\n });\\n $(\\\"#song-holder-list\\\").prepend(songString);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6862ddeae092b98f5db1132f02504eb\",\n \"score\": \"0.5731922\",\n \"text\": \"async getSongsForFrontend( songId = null ) {\\n\\t\\tlet songs = [];\\n\\t\\tlet args = { getAll: true }\\n\\t\\tif ( songId != null ) args = { id: songId, getAll: false };\\n\\t\\tlet { data, more } = await this.getSongs( args );\\n\\t\\tfor ( let songdata of data ) {\\n\\t\\t\\tsongdata.arrangement = {}\\n\\n\\t\\t\\tlet res = await this.getSongArrangements( { songId: songdata.id } );\\n\\t\\t\\tif ( res.data.length > 0 ) {\\n\\t\\t\\t\\tsongdata.arrangement = res.data[ 0 ];\\n\\t\\t\\t\\tlet song = this.songFromSongDataWithArrangement( songdata );\\n\\t\\t\\t\\tsongs.push( song );\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn songs;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b27165a1a13fffaa9d81b5738713b16\",\n \"score\": \"0.57242966\",\n \"text\": \"play() {\\n this.setStatus({isPlaying: true, isBuffering: true});\\n this.sendControlRequest(\\\"play\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6d3643b386c888679894e5bff254e38\",\n \"score\": \"0.5720337\",\n \"text\": \"_play() {\\n \\tthis.audioPlayer = new AudioPlayer();\\n\\tthis.audioPlayer.setSong(this.obj.songValue);\\n this.playButton = new PlayButton(this._pause, this._replay);\\n\\tthis.gifDisplay = new GifDisplay(this.Info, this._showMusicPage);\\n\\tthis.audioPlayer.setKickCallback(this.gifDisplay._nextGif);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d075d1519ee7580c5bbafc0f324cca4\",\n \"score\": \"0.5718855\",\n \"text\": \"createPlaylist (list) {\\r\\n console.log (\\\"Creating new playlist\\\");\\r\\n var jsonObj = {\\r\\n SongList : list\\r\\n }\\r\\n let promise = fetch (`https://localhost:5001/api/mediaplayer`, {\\r\\n method: \\\"POST\\\",\\r\\n headers: {\\r\\n \\\"Content-Type\\\": \\\"application/json\\\"\\r\\n },\\r\\n body: JSON.stringify(jsonObj)\\r\\n });\\r\\n\\r\\n return promise;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab49e073b45cce733443bb6d854e23c0\",\n \"score\": \"0.57166684\",\n \"text\": \"function findSong() {\\n\\n\\tvar search = $('#tbx_search').val();\\n\\n\\t// send request\\n\\t$.ajax({\\n\\t\\t\\ttype: \\\"GET\\\",\\n\\t\\t\\turl: 'http://localhost:3000/api/find_song',\\n\\t\\t\\tdata: {\\n\\t\\t\\t\\tsrch: search,\\n\\t\\t\\t\\t'access_token': access_token\\n\\t\\t\\t},\\n\\t\\t\\tdataType: 'json',\\n\\t\\t\\tsuccess: function(found){\\n\\n\\t\\t\\t\\t// on receiving songs, add them to the search list\\n\\n\\t\\t\\t\\t// empty previous search and populate new search\\n\\t\\t\\t\\t$(\\\"#search_list\\\").empty();\\n\\t\\t\\t\\tcurrentSearchedSongs = found;\\n\\n\\t\\t\\t\\tfor (var x = 0; x < found.tracks.length; x++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tvar image = new Image();\\n\\t\\t\\t if (found.tracks[x].cover_url != null) image.src = found.tracks[x].cover_url;\\n\\t\\t\\t \\n\\t\\t\\t // insert image\\n\\t\\t\\t var html = \\\"<li><img class=\\\\\\\"song_album_art\\\\\\\" id=\\\\\\\"link-\\\"+x+\\\"\\\\\\\" src=\\\\\\\"\\\"+image.src+\\\"\\\\\\\" />\\\";\\n\\n\\t\\t\\t // insert track info\\n\\t\\t\\t html += \\\"<div class=\\\\\\\"song_group\\\\\\\" >\\\";\\n\\t\\t\\t html += \\\"<div class=\\\\\\\"song_name\\\\\\\" >\\\"+found.tracks[x].name+\\\"</div>\\\";\\n\\t\\t\\t html += \\\"<div class=\\\\\\\"song_artist\\\\\\\" > \\\"+found.tracks[x].artist+\\\"</div>\\\";\\n\\t\\t\\t html += \\\"<div class=\\\\\\\"song_album\\\\\\\">\\\"+found.tracks[x].album+\\\"</div></div></li><br>\\\";\\n\\n\\t\\t\\t // add song to list\\n\\t\\t\\t $('#search_list').append(html);\\n\\n\\t\\t\\t // apply listener to image\\n\\t\\t\\t\\t\\t$('#link-'+x).click(function() {\\n\\n\\t\\t\\t\\t\\t\\t// get song id \\n\\t\\t\\t\\t\\t\\tvar tokens = $(this).attr('id').split(\\\"-\\\");\\n \\t\\t\\t\\t\\t\\tvar songID = tokens[1];\\n\\n\\t\\t\\t\\t\\t\\t// post song to be added\\n\\t\\t\\t\\t\\t\\t$.ajax({\\n\\t\\t\\t\\t\\t\\t\\ttype: \\\"POST\\\",\\n\\t\\t\\t\\t\\t\\t\\turl: 'http://localhost:3000/api/choose_song',\\n\\t\\t\\t\\t\\t\\t\\tdata: {\\n\\t\\t\\t\\t\\t\\t\\t\\t'song': currentSearchedSongs.tracks[songID]\\n\\t\\t\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\t\\t\\tdataType: 'json'\\n\\t\\t\\t\\t\\t\\t});\\n\\n\\t\\t\\t\\t\\t\\tsetTimeout(function() {\\n\\t\\t\\t\\t\\t \\trefreshSongList();\\n\\t\\t\\t\\t\\t \\tupdateLiveSong();\\n\\t\\t\\t\\t\\t }, 1000);\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t }\\n\\t\\t\\t},\\n\\t\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3060ba74901720c6a495cee37e50f69c\",\n \"score\": \"0.57113075\",\n \"text\": \"function gotAllSongs(err) {\\n console.log(\\\"gotAllSongs()\\\");\\n\\n // report an error, you'd want to do something better than this in production\\n if (err) {\\n console.log(\\\"error loading data\\\");\\n console.error(err);\\n return;\\n }\\n\\n // call functions to log and show the books\\n consoleLogSongs();\\n showSongs();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e16575199b248e6165e2a4ffaaabea7\",\n \"score\": \"0.5707014\",\n \"text\": \"function playSong() {\\n console.log(\\\"song is playing\\\")\\n uno.style.display = 'none'\\n due.style.display = 'block'\\n song.loop();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca1dcc0681940edd9e64666e75c28c44\",\n \"score\": \"0.57033116\",\n \"text\": \"async start() {\\n for (let current of this.active) {\\n const isPlaying =\\n current.currentTime > 0 &&\\n !current.paused &&\\n !current.ended &&\\n current.readyState > current.HAVE_CURRENT_DATA;\\n // because there is sometimes an error that the pause() was interrupted by the play() I tried to make sure the sound is paused.\\n // It is sometimes still show that error and I know its because the pause() and play() are asynchronous but I didn't manage to completely solve it.\\n if (!isPlaying) {\\n await current.play().catch((error) => {\\n console.error(error);\\n });\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57be5c3cb794a36558267e9e62e5473c\",\n \"score\": \"0.5691717\",\n \"text\": \"getMusic(e) {\\n e.preventDefault();\\n var artist = e.target.artist.value;\\n //changes the button to loading while songs load\\n document.querySelector('#get-music-button').textContent = 'LOADING....'\\n itunesService.getMusicByArtist(artist, drawSongs)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd1eea10fdb5a7b781eda78fc911514a\",\n \"score\": \"0.5684153\",\n \"text\": \"getAllSongs () {\\r\\n console.log (\\\"Getting all songs\\\");\\r\\n let promise = fetch (`https://localhost:5001/api/mediaplayer`, {\\r\\n method: \\\"GET\\\",\\r\\n headers: {\\r\\n \\\"Content-Type\\\": \\\"application/json\\\"\\r\\n // \\\"Authorization\\\":t\\r\\n }\\r\\n });\\r\\n return promise;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b43025e16ade4b1f7e42396f53e005f2\",\n \"score\": \"0.56813\",\n \"text\": \"function play(connection, message) {\\n var server = servers[message.guild.id];\\n\\n server.dispatcher = connection.playStream(ytdl(server.queue[0], {filter: \\\"audioonly\\\"}));\\n\\n server.queue.shift()\\n\\n server.dispatcher.on(\\\"end\\\", function() {\\n if(server.queue[0]) play(connection, message);\\n else connection.disconnect;\\n })\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8607b1f76e077dbd74b6a1553cb86402\",\n \"score\": \"0.56798357\",\n \"text\": \"function handleAPILoaded() {\\n requestUserUploadsPlaylistId();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"229de91cb96f6b911a6aed3de7520bb2\",\n \"score\": \"0.5665038\",\n \"text\": \"function runPlayLinkCommand(message, args, mgid) {\\r\\n if (!message.member.voice.channel) {\\r\\n return;\\r\\n }\\r\\n if (!args[1]) {\\r\\n if (dispatcherMap[mgid] && dispatcherMapStatus[message.member.voice.channel] === \\\"pause\\\") {\\r\\n message.channel.send(\\\"*playing*\\\");\\r\\n }\\r\\n return message.channel.send(\\\"Where's the link? I can't read your mind... unfortunately.\\\");\\r\\n }\\r\\n if (!args[1].includes(\\\".\\\")) {\\r\\n // message.channel.send(\\\"*I think you should be using \\\" + prefixMap[mgid] + \\\"d but ok then...*\\\");\\r\\n return runDatabasePlayCommand(args, message, mgid, false, false);\\r\\n }\\r\\n if (!servers[mgid])\\r\\n servers[mgid] = {\\r\\n queue: [],\\r\\n queueHistory: []\\r\\n };\\r\\n // in case of force disconnect\\r\\n if (\\r\\n !message.guild.client.voice ||\\r\\n !message.guild.voice ||\\r\\n !message.guild.voice.channel\\r\\n ) {\\r\\n servers[mgid].queue = [];\\r\\n servers[mgid].queueHistory = [];\\r\\n }\\r\\n let queueWasEmpty = false\\r\\n if (servers[mgid].queue.length < 1) {\\r\\n queueWasEmpty = true;\\r\\n }\\r\\n let pNums = 1;\\r\\n while (args[pNums]) {\\r\\n let linkZ = args[pNums];\\r\\n if (linkZ.substring(linkZ.length - 1) === \\\",\\\") {\\r\\n linkZ = linkZ.substring(0, linkZ.length - 1);\\r\\n }\\r\\n // push to queue\\r\\n servers[mgid].queue.push(args[pNums]);\\r\\n pNums += 1;\\r\\n }\\r\\n // make pNums the number of added songs\\r\\n pNums--;\\r\\n // if queue was empty then play\\r\\n if (queueWasEmpty) {\\r\\n playSongToVC(message, args[1], message.member.voice.channel, true);\\r\\n } else if (pNums < 2) {\\r\\n message.channel.send(\\\"*added to queue*\\\");\\r\\n } else {\\r\\n message.channel.send(\\\"*added \\\" + pNums + \\\" to queue*\\\");\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40cc7b8ea2773ec89a52fb6a0a4394e9\",\n \"score\": \"0.5662432\",\n \"text\": \"handleSubmitNextRound(e, i) {\\n e.preventDefault();\\n const { totalRounds } = this.props;\\n\\n if(i + 1 === totalRounds) {\\n const audio = new Audio();\\n audio.src = 'assets/sounds/Ryan_VanEerde_Sci-Fi_Explosion_2_20.mp3';\\n audio.play();\\n } else {\\n const audio = new Audio();\\n audio.src = 'assets/sounds/zapsplat_science_fiction_vehicles_zoom_by_ultra_sonic_whoosh_002_55942.mp3';\\n audio.play();\\n }\\n this.props.handleNextRound();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b11c718ec3dc77f9e3469db0a900acc\",\n \"score\": \"0.5660637\",\n \"text\": \"function playAll() {\\n\\t\\tfor (var i = 0; i < threads.length; i++) {\\n\\t\\t\\tthreads[i].play();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"464cab870ee54ab9e09391d4d8ff19fc\",\n \"score\": \"0.5656447\",\n \"text\": \"async updateQueueTracksInfo({ state }, token) {\\n state.queueNextTracks = [];\\n\\n var i;\\n var tempTrackUrl;\\n var songId;\\n\\n for (i = 0; i < state.queueTracks.length; i++) {\\n tempTrackUrl = state.queueTracks[i];\\n\\n songId = tempTrackUrl.slice(\\n tempTrackUrl.indexOf(\\\"/tracks/\\\") + \\\"/tracks/\\\".length,\\n tempTrackUrl.length\\n );\\n if (state.trackId == songId) {\\n break;\\n }\\n }\\n\\n var tracks = [];\\n\\n //request the data\\n for (var j = i + 1; j < state.queueTracks.length; j++) {\\n tempTrackUrl = state.queueTracks[j];\\n\\n let songID = tempTrackUrl.slice(\\n tempTrackUrl.indexOf(\\\"/tracks/\\\") + \\\"/tracks/\\\".length,\\n tempTrackUrl.length\\n );\\n\\n var track = {\\n name: undefined,\\n artistName: undefined\\n };\\n\\n await axios\\n .get(\\\"/v1/users/track/\\\" + songID, {\\n headers: {\\n Authorization: token\\n }\\n })\\n .then(response => {\\n let trackData = response.data;\\n\\n track.name = trackData.name;\\n track.durationMs = trackData.durationMs;\\n\\n track.artistName = trackData.artist.name;\\n\\n track.trackAlbumName = trackData.album.name;\\n });\\n tracks.push(track);\\n }\\n state.queueNextTracks = tracks;\\n\\n state.isCurTrkReady = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca54bc282d3d3ebead644b0ffc3a81ef\",\n \"score\": \"0.56523633\",\n \"text\": \"getMusic(e) {\\n e.preventDefault();\\n var artist = e.target.artist.value;\\n //changes the button to loading while songs load\\n $('#get-music-button').text('LOADING....');\\n itunesService.getMusicByArtist(artist).then(results => {\\n drawSongs(results)\\n //changes button back to GET MUSIC once songs are loaded\\n $('#get-music-button').text('GET MUSIC');\\n })\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":78,"cells":{"query_id":{"kind":"string","value":"9d4216745a92021afb93dbc904b94b42"},"query":{"kind":"string","value":"is the current page a duckduckgo.com page? switch to the google url"},"positive_passages":{"kind":"list like","value":[{"docid":"f2290c7b60dccea7fe3b87fee9f6c9cc","score":"0.7803325","text":"function switchURL() {\n\tif (isDCK) {\n\t\tvar searchTerm;\n\t\tvar splitted = currentURL.split(/(\\?|\\&)/);\n\n\t\tfor (var i = 0; i < splitted.length; i++) {\t\n\t\t\tif (splitted[i].match(/^q=.*$/)) {\n \t\t\t\tsearchTerm = splitted[i];\n \t\t\t}\n\t\t}\n\t\t\n\t\tvar google_url = \"https://google.com/search?\" + searchTerm;\n\t\tbrowser.tabs.update({url: google_url});\n\t} else {\n\t\tconsole.log('Error: Not a duckduckgo.com site');\n\t}\n}","title":""}],"string":"[\n {\n \"docid\": \"f2290c7b60dccea7fe3b87fee9f6c9cc\",\n \"score\": \"0.7803325\",\n \"text\": \"function switchURL() {\\n\\tif (isDCK) {\\n\\t\\tvar searchTerm;\\n\\t\\tvar splitted = currentURL.split(/(\\\\?|\\\\&)/);\\n\\n\\t\\tfor (var i = 0; i < splitted.length; i++) {\\t\\n\\t\\t\\tif (splitted[i].match(/^q=.*$/)) {\\n \\t\\t\\t\\tsearchTerm = splitted[i];\\n \\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tvar google_url = \\\"https://google.com/search?\\\" + searchTerm;\\n\\t\\tbrowser.tabs.update({url: google_url});\\n\\t} else {\\n\\t\\tconsole.log('Error: Not a duckduckgo.com site');\\n\\t}\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"8b6ef607a5a36d73237da882b6d0cc97","score":"0.6438335","text":"function _gotoFirstPage() {\n window.location.href = \"/visitor_page\";\n\n return false\n}","title":""},{"docid":"43c67de9222b5883eb8d21f85f70db24","score":"0.63341933","text":"function whichPage(){\n if ((document.URL).includes(\"you-can-do-it\")) {\n return \"work\"\n }\n else {\n return \"relax\"\n }\n}","title":""},{"docid":"cc2a2ec72fcb7fa9d53ce71bfae7be64","score":"0.6312278","text":"function sys_jump_page(url){\r\n if(url){\r\n \twindow.location = url;\r\n }\r\n}","title":""},{"docid":"cd95d24da9ec21a09bf8d051c4ead9bd","score":"0.6306668","text":"function gotoUrl(){\n if(location.hash !== ''){\n var pageName = location.hash.split('#')[1];\n var contentData = location.href.split('#')[0] + '/projects/' + pageName + '.html';\n\n if( pageName === 'work' || pageName === 'about'){\n var contentData = location.href.split('#')[0] + '/' + pageName + '.html';\n }\n showPage(contentData, pageName);\n }\n }","title":""},{"docid":"a336b15bc472b83cde97e0023461b788","score":"0.63032496","text":"function detectUrlChange() {\n currentUrl = window.location.href\n if (currentUrl !== savedUrl){\n fLog('> Url changed to '+currentUrl, 3);\n if (currentUrl.indexOf('youtube.com/watch?') !== -1) {\n activateScript();\n }\n savedUrl = currentUrl;\n }\n}","title":""},{"docid":"2eae88cb54d4cf5ba0304d59962e72b3","score":"0.62838894","text":"function gotoUrl(url) {\r\n\twindow.location = url;\r\n}","title":""},{"docid":"2f8ed70ca198c617e458c744a4ec8ba9","score":"0.6184985","text":"function goTo(url) {\n window.location.href = url;\n}","title":""},{"docid":"de32576b2393f019b98906f0e3deba05","score":"0.61500293","text":"goToPage() {\n I.amOnPage(this.url);\n }","title":""},{"docid":"b986ce7ab3d42303838bab1f58679af1","score":"0.61274785","text":"function goHere(url) {\r\n\twindow.location=url;\r\n}","title":""},{"docid":"5b3524713abd99ce84fe00381f4fe86a","score":"0.6080684","text":"function MM_goToURL() { //v3.0\n var i, args=MM_goToURL.arguments; document.MM_returnValue = false;\n for (i=0; i<(args.length-1); i+=2) eval(args[i]+\".location='\"+args[i+1]+\"'\");\n}","title":""},{"docid":"a759679604bfeed10a0b692f8b606fcf","score":"0.60680616","text":"function goTo(url) {\n if (url.indexOf(\".html\") == -1) {\n window.location.href = url + \".html\";\n }\n else {\n window.location.href = url;\n }\n}","title":""},{"docid":"fac4a810518752fbfe1e1f8d18c1ba72","score":"0.6056887","text":"function goToURL(url){\n\twindow.location.href = url;\n}","title":""},{"docid":"6aeccbb3b469b05306b65809d4dc6a9c","score":"0.6049196","text":"function iGoTo(goTo){\n Cala.say(\"Going to: \" + goTo);\n window.location.href = goTo;\n}","title":""},{"docid":"788842a76e2f4ffff8c3c3d9e5d7f692","score":"0.6040291","text":"function goPage(go_page)\n{\n\ttop.location.href = go_page;\n return;\n} //end function: goPage();","title":""},{"docid":"4318d24b03afff745f034e89ebd62d04","score":"0.5999355","text":"function gotourl(url) {\n\twindow.location = url;\n}","title":""},{"docid":"af7d1c8b3791b7c1dbad3f06d521b978","score":"0.59751743","text":"function gotosite(site) {\r if (site != \"\") {\r window.location=site;\r }\r}","title":""},{"docid":"59b5985f2fbc7147964859f1ffd527f7","score":"0.5940114","text":"function Go_To_Next_Loterie()\r\n{\r\n\tvar host\t\t= Get_Host();\r\n\r\n\tvar current_loterie_found = false;\r\n\tvar next_loterie_url = '';\r\n\tfor (c_host in loteries)\r\n\t{\r\n\t\tif (current_loterie_found == true)\r\n\t\t{\r\n\t\t\tnext_loterie_url = loteries[c_host]['url'];\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tif (c_host == host)\r\n\t\t{\r\n\t\t\tcurrent_loterie_found = true;\r\n\t\t}\r\n\t}\r\n\tif (next_loterie_url != '')\r\n\t{\r\n\t\twindow.location.href = next_loterie_url;\r\n\t}\r\n}","title":""},{"docid":"8a0a36b426aac310f1f28e21bf891157","score":"0.59187555","text":"function goto(to){\n window.location = to;\n}","title":""},{"docid":"708952c4c88517ddcd2dc76201e299d5","score":"0.59117967","text":"function jump_site(){\n sitevar= document.searchForm.dropdown.selectedIndex;\n if(sitevar != 0){\n location.href = document.searchForm.dropdown.options[sitevar].value;\n }\n}","title":""},{"docid":"e9b2d04cba88978d34b87229a814d9e1","score":"0.5895727","text":"function isThisPageDorf1() { return (isPageDorf1(document.location.href)); }","title":""},{"docid":"37ad7dfd822c92bbe53e5909cf50b219","score":"0.5894809","text":"function goToDecks() {\n document.location = \"homepage.html\";\n}","title":""},{"docid":"2d235607b8d536a5159c4f70c40f8e53","score":"0.5894442","text":"goTo() {\n browser.get(this.url, this.timeout);\n }","title":""},{"docid":"89f10814a1590369e76d4ebe14c2707e","score":"0.5870659","text":"function navigateTo(url) {\n window.location = url;\n }","title":""},{"docid":"229c98ea3f13a97ecd25427f7d5d1edd","score":"0.5863665","text":"function VisitPage(url) {\n window.location = url;\n}","title":""},{"docid":"60c34067dbf9b6a18f2e0a750835eac8","score":"0.5857147","text":"function goToUrl(newPage) {\n window.location = newPage;\n}","title":""},{"docid":"5f4daa5ac5990331564f1a6cbeb3a94f","score":"0.58434886","text":"function gotosite(site) {\n if (site != \"\") {\n window.location=site;\n }\n}","title":""},{"docid":"ddcf002c1544c9ad6cb5d54eb55d1b32","score":"0.5817462","text":"async goToContact(url) {\n const {page} = this;\n await page.goto(url, {\n timeout: 0\n });\n }","title":""},{"docid":"90cccd716d70ed9b9e62ed319c1a0f43","score":"0.58030313","text":"function goTo() {\n\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\t\t\t\t\t\t\twindow.location.href=\"other.html\";\n\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\t\t\t\t\t\t\t}","title":""},{"docid":"f623681e0e807fe74f45e2260f22483a","score":"0.5788514","text":"function gotoseeker()\n{\n window.location.href=\"seeker.html\"\n}","title":""},{"docid":"6b2369c1f3c30fc8352a27bdee056782","score":"0.5775409","text":"function gotoNextPage(){\n setCurrentPageUrl(nextPageUrl)\n }","title":""},{"docid":"35234c52883148fc4cab56815981d8df","score":"0.576355","text":"function goHomeButtonClicked() {\n var page = document.getElementById(\"page\");\n page.stop();\n navigateTo(\"https://www.google.com/\")\n}","title":""},{"docid":"d5ca3e10b7f629d3920005d82fe937ff","score":"0.5763419","text":"function updateDCK() {\n\tvar pattern = /^(http|https):\\/\\/duckduckgo\\.com\\/[^\\s]*(\\?|\\&)q=.{1,}$/;\n\tisDCK = pattern.test(currentURL);\n}","title":""},{"docid":"5537d566b5eb59e98c0f5873291f06f2","score":"0.5751249","text":"function onPopAndStart(){\n\n var l = location.href;\n var pageName = l.substring(l.lastIndexOf(\"/\")+1);\n pageName = pageName || \"home\";\n\n showPage(pageName);\n }","title":""},{"docid":"20578ed82912c7e81007e5371e3ba779","score":"0.57439005","text":"function gotoBrowserWindow(url)\r\n\t{\r\n\t\tair.navigateToURL( new air.URLRequest( url ), \"_blank\" );\r\n\r\n\t\t$('sp_wpOr').innerHTML = lang['TELL_ME'];\r\n\t\t$('sp_wpOr').className='created';\r\n\t}","title":""},{"docid":"1bfa585f2d0546c5128bbf89c5b613ec","score":"0.57383114","text":"function getGoNext() {\n var href = window.location.href,\n goNext;\n return href.replace(window.location.protocol + \"//\" + window.location.host + \"/cgi-bin/setup.cgi?gonext=\", \"\");\n}","title":""},{"docid":"64c381624322e7ec840d145c36b8b1e9","score":"0.5735852","text":"function go_quicklink2(){\r\n var resultPage=document.sitebar2.siteChoice2;\r\n for (var i = 0; i < document.sitebar2.siteChoice2.length; i++)\r\n {\r\n if (resultPage.options[i].selected == true)\r\n if (resultPage.options[i].value != \"\")\r\n parent.location.href=resultPage.options[i].value;\r\n }\r\n }","title":""},{"docid":"88d7f8318f68ea006e50bc3c1c1c227f","score":"0.5728029","text":"function loadPageNoExplore() {\n window.location.href='/thesis/'\n }","title":""},{"docid":"253277eb4ec9375a45d0130406ba3f66","score":"0.57274765","text":"function go_quicklink(){\r\n var resultPage=document.sitebar1.siteChoice1;\r\n for (var i = 0; i < document.sitebar1.siteChoice1.length; i++)\r\n {\r\n if (resultPage.options[i].selected == true)\r\n if (resultPage.options[i].value != \"\")\r\n parent.location.href=resultPage.options[i].value;\r\n }\r\n }","title":""},{"docid":"b33a5dd070ea30e191f155d847670cad","score":"0.57145673","text":"function go_to_entrance() {\n /* Visit the entrance page. Depending on session state, it might\n present a login challenge or it might present the top-level\n contents associated with the logged-in account. */\n // Use a string url so our transit machinery registers a visit.\n $.mobile.changePage(my.combo_root_url); }","title":""},{"docid":"a9564bc7c65d4ca96e5811403873ccb0","score":"0.5711344","text":"function isThisPageVillage() { return isPageVillage(document.location.href); }","title":""},{"docid":"333bb631c8f88a3db9dd65dfdcd7f9ad","score":"0.5710735","text":"function Goto(valeur){\n var debuturl = window.location.origin;\n switch(valeur){\n case 1:window.location=debuturl+\"/Professionnel.html\";break;\n case 2:window.location=debuturl+\"/Piano.html\";break;\n case 3:window.location=debuturl+\"/News.html\";break;\n default: windows.location=debuturl;\n }\n}","title":""},{"docid":"a89a82047cb3e0adc82d011e23c6d5b1","score":"0.57092404","text":"function PageTurn (URL) {\n if (typeof URL !== 'string') { return 0; }\n\n if (URL.length > 0) { window.location = URL; }\n else { window.location.reload(true); }\n}","title":""},{"docid":"0bdc65c55ba445173f0cc915bed54505","score":"0.56878334","text":"checkLinkType() {\n // TODO: Make sure the website is not part of the stackexchange network and not limit ourselves to stackoverflow\n if (this.CURRENT_TAB != 'stackoverflow.com' && this.redirectLink.includes('/questions/')) {\n return 'question';\n } else {\n return 'unknown';\n }\n }","title":""},{"docid":"8c499cb0ac234efcdbfbbe53d66a7229","score":"0.568136","text":"function checkLink() {\n let buttons = $(\":button[go]\");\n for (const btn of buttons) {\n let go = $(btn).attr(\"go\");\n let index = window.location.href.indexOf(go);\n if (index >= 0) {\n let link = window.location.href.slice(index);\n link = link.split(\"/\").join(\"\");\n go = go.split(\"/\").join(\"\");\n if (link === go) {\n btnActivate($(btn).attr(\"id\"));\n break;\n }\n }\n }\n}","title":""},{"docid":"02c67fad8d7ade331d563ebbf3851c3c","score":"0.5680292","text":"function go_quicklink1(){\r\n var resultPage=document.sitebar1.siteChoice1;\r\n for (var i = 0; i < document.sitebar1.siteChoice1.length; i++)\r\n {\r\n if (resultPage.options[i].selected == true)\r\n if (resultPage.options[i].value != \"\")\r\n parent.location.href=resultPage.options[i].value;\r\n }\r\n }","title":""},{"docid":"1f1ec0ced37684251b44db303215b79f","score":"0.5675057","text":"function gotoP(page) {\n location.href = page;\n}","title":""},{"docid":"9a98dffdccf4b98d8afb01ac7843aa0d","score":"0.5672991","text":"function jumpTo(page){\n\tdocument.location.href =page;\n}","title":""},{"docid":"79743503c9a48e929f1b7be219b8e8c8","score":"0.5670163","text":"function navigate(url) {\n window.location.assign(url);\n chrome.tabs.query({\n active: true,\n currentWindow: true\n }, function(tabs) {\n chrome.tabs.update(tabs[0].id, {\n url: url\n });\n });\n}","title":""},{"docid":"de0887be9a2a9a350ac63280c2ce3733","score":"0.56680423","text":"function tieptucmuahang(base_url)\n{\n\twindow.location = base_url;\n}","title":""},{"docid":"6eac20b90662c0b074f9dcfd800f6923","score":"0.56596977","text":"function isThisPageDorf3() { return (isPageDorf3(document.location.href)); }","title":""},{"docid":"764fd89270c771ddde1fb735b4cba467","score":"0.5656237","text":"function changePage(url){\n location.replace(url);\n}","title":""},{"docid":"5bc88d97b007a60cb8dee335f807e536","score":"0.5639255","text":"function changePage(url) {\n location.replace(url);\n}","title":""},{"docid":"08c4fe789eb1156dbcf5036b9523faab","score":"0.56363654","text":"function start_url() {\t\n\tquery_id = \"\";\n\tfilterLabel = \"\";\n\ttimeout = 3;\t\n\t\n\tdasty_mainpage_name = findDastyHtmlPageName('page_name') + \".\" + findDastyHtmlPageName('ext_name');\n\tconfiguration();\n\tdefault_query_parameters();\n\t\n\tsetDastyURLParam();\n}","title":""},{"docid":"dff571e07085f2342e1147213e2da8e6","score":"0.5624279","text":"function discover() {\n //redirecting to profile page\n window.location = \"discover.html\";\n\n //Return true to jump out of the function, since we now have all we need\n return true;\n}","title":""},{"docid":"fa450e713e6478fefdddac04b7105e1f","score":"0.5607525","text":"function linkCurrentPage() {\r\n chrome.tabs.query({\r\n active: true,\r\n currentWindow: true\r\n }, function(tabs) {\r\n chrome.tabs.sendMessage(tabs[0].id, {\r\n action: 'link'\r\n }, function(response) {\r\n if (response) {\r\n // Looked for links successfully\r\n updateStatus(response.linkCount);\r\n } else {\r\n // Didn't get a response, might be on chrome page or page loading\r\n // Show no links found\r\n updateStatus(0);\r\n }\r\n });\r\n });\r\n }","title":""},{"docid":"f61c2f47077983f28433cc728e481fcd","score":"0.5606776","text":"async function navigateTo(url, page) {\n let navigated = false;\n try {\n await page.goto(url, {\n waitUntil: \"networkidle0\",\n timeout: configuration.timeoutms,\n });\n logger.logToConsole(\n {\n message: \"Navigated to URL : > \",\n info: url,\n },\n \"log\"\n );\n navigated = true;\n } catch (e) {\n logger.logToConsole(\n {\n message: \"Error: Wasn't able to Navigate to URL\",\n error: e,\n },\n \"error\"\n );\n }\n return navigated;\n}","title":""},{"docid":"283e7fa9e57405e6c252e9e436c8a572","score":"0.55848897","text":"function loginGoogle() {\n window.location.href = '/auth/google';\n}","title":""},{"docid":"484705ce0cade09dd4cf051cb15d510b","score":"0.5583128","text":"function redirect(){\r\n window.location.assign('https://www.bloggingprince.com');\r\n }","title":""},{"docid":"2715f946d98625e060cd5fbe08d5c642","score":"0.557622","text":"function doNotKnowTheProblem(){\n window.location = getNextUrlToDrill();\n}","title":""},{"docid":"40591ff17f662ab440e0d7c878d14691","score":"0.55753934","text":"function go(url, newWindow = false) {\r\n newWindow ? window.open(url) : window.location.href = url;\r\n}","title":""},{"docid":"3d4390c8d1e5b337ff873fe89ffb41a7","score":"0.55729705","text":"function gotoURL(a){\n\tchrome.tabs.create({'url': a});\n\tself.close();\n\t_gaq.push(['_trackEvent', 'gotoZippyshare', 'clicked']);\n}","title":""},{"docid":"571bf486244a42aa6f3e040a595ddb55","score":"0.55718064","text":"function jump_page(e) {\n var t = $(\"#\" + e).val();\n var n = $(\".url_jump\").val();\n window.location.href = n + t;\n}","title":""},{"docid":"0863af97adf352d48a4af67d24b51264","score":"0.5559143","text":"function checkForValidUrl(tabId, changeInfo, tab) {\n\t\t\t// Check if page is a presentation.\n\t\t\tif (tab.url.indexOf('docs.google.com/presentation') > -1) {\n\t\t\t\t// ... show the page action.\n\t\t\t\tchrome.pageAction.show(tabId);\n\t\t\t}\n\t\t}","title":""},{"docid":"2944ef92abea86f348c7ab3f5dfc6086","score":"0.55566496","text":"checkUrl( /*e*/ ) {\n var current = this.getFragment();\n // If the user pressed the back button, the iframe's hash will have\n // changed and we should use that for comparison.\n if (current === this.fragment && this.iframe) {\n current = this.getHash(this.iframe.contentWindow);\n }\n if (current === this.fragment) {\n return false;\n }\n if (this.iframe) {\n this.navigate(current);\n }\n this.loadUrl();\n }","title":""},{"docid":"5ad52c997e66b410aad11f95aaaf8101","score":"0.5556273","text":"function go_newfeeds( check1) {\r\n\r\n\tvar currentLocation = window.location;\r\n\r\n\tif ( currentLocation.pathname === \"/xti.php\" ) {\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif ( currentLocation.pathname === \"/home.php\" ) {\r\n\t\treturn true;\r\n\t} else {\r\n\t\ttmp_page = 0;\r\n\t}\r\n\r\n\tif (tmp_page !== 0 && check1 === 0) { \r\n\r\n\t\treturn true; \r\n\t}\r\n\tif (tmp_page === 0) {\r\n\t\ttmp_page = 1;\r\n\t}\r\n\r\n\tvar inputs2 = document.querySelector('div#feed_jewel a'); \r\n\tif ( inputs2 !== null) {\r\n\t\tinputs2.click();\r\n\t}\r\n\r\n}","title":""},{"docid":"6d58163556a212a9f1822b1e0ea976b0","score":"0.5554297","text":"function go2page(link) {\n $('.slide').hide();\n $('#' + link).show();\n $('.control').add($('#navbar_items a')).removeClass('hilite');\n $('#' + link + '_control').add($('#navbar_items a[href~=\"#' + link + '\"]')).addClass('hilite');\n \n //Inhaltsverzeichnis der Seite\n fixPageindex();\n\n // toggle position thesaurus pageindex, s.u.\n \n // track a page view\n _paq.push(['setCustomUrl', URI().href()]);\n _paq.push(['trackPageView']);\n }","title":""},{"docid":"2ac52a7c7d7194ff97e9f9f0f99a97a3","score":"0.55539715","text":"function isThisPageKarte2MapPage() { return (isPageKarte2MapPage(document.location.href)); }","title":""},{"docid":"e7bd14f04b61f3920325c59a2d7e208d","score":"0.554125","text":"function checkForValidUrl(tabId, changeInfo, tab) {\n if (tab.url.indexOf('.notonthehighstreet.com') > -1 || tab.url.indexOf('.noths.com') > -1) {\n chrome.pageAction.show(tabId);\n }\n}","title":""},{"docid":"77fbbce89bf3acd4e6fe50b5042d4ce0","score":"0.55335146","text":"function goto(page) {\n\tif(page === 'index') {\n\t\t// When goto command is issued for 'index', we goto to root\n\t\tpage = ''; \n\t}\n\tvar gotoURL = 'http://' + window.location.hostname + ':' + location.port + '/' + page;\n\tconsole.log('Redirecting to ' + gotoURL);\n\twindow.location.href = gotoURL;\n}","title":""},{"docid":"8348d3bfc7fdb5b1d6f6223a1deead6d","score":"0.55307555","text":"function showPage(url) {\n try {\n window.top.$j(\"#gsft_main\").attr('src', url);\n return false;\n } catch (ex) {\n jslog(errorLogPrefix + \" showPage: \" + ex.message);\n }\n}","title":""},{"docid":"71de1ed63b0825dd7dbeba687606ccec","score":"0.551412","text":"function checkURL() {\nvar currentLocation = window.location.href;\n\tif (currentLocation == \"https://kzlv.me/\") {\n\t\tdocument.getElementById('kai').innerHTML += \"<font face=\\\"verdana\\\"><font color=\\\"#FF69B4\\\">[kai]</font> official site</font>\";\n}\t\nelse {\n\t\tdocument.getElementById('kai').innerHTML += \"<font face=\\\"verdana\\\"><font color=\\\"#FF69B4\\\">[kai]</font> unverified site current site \" + window.location.href + \" differs from official site kzlv.me</font>\";\n\t}\n}","title":""},{"docid":"86e8d56bd785f6bff5cb5a5034302bb5","score":"0.55121624","text":"function go_page(link){ \r\n\tif (link=='#') {return false;}\r\n\t\r\n\t$.ajax({\r\n method: \"GET\",\r\n dataType: \"html\",\r\n url: link,\r\n beforeSend: function() {\r\n $(\".content-wrapper\").css(\"background-color\", 'white');\r\n $(\".load\").css(\"display\", 'block');\r\n $(\".content-wrapper2\").css(\"display\", 'none');\r\n\r\n },\r\n complete: function() {\r\n $(\".content-wrapper\").css(\"background-color\", '#ecf0f5');\r\n $(\".load\").css(\"display\", 'none');\r\n $(\".content-wrapper2\").css(\"display\", 'block');\r\n },\r\n success: function(res){\r\n $('.content-wrapper2').html(res);\r\n $('.ui-pnotify-closer').click();\r\n }\r\n });\r\n return false;\r\n}","title":""},{"docid":"40cd0f96792df66d4df265d45427baf5","score":"0.5511795","text":"function getCurrentPage(url){\n if(url.includes(\"play.google\")){\n return{\n name:\"Google-Play-Music-Config\",\n color:\"#FF5722\",\n color2:\"#ffffff\",\n fftUni:16384,\n bottom:90,\n }\n }\n else if(url.includes(\"music.youtube\")){\n return{\n name:\"YouTube-Music-Config\",\n color:\"#FFFFFF\",\n fftUni:16384,\n bottom:83,\n }\n }\n else if(url.includes(\"youtube\")){\n return{\n name:\"YouTube-Config\",\n color:\"#FF0000\",\n fftUni:8192,\n bottom:0,\n }\n }\n else{\n return{\n name:\"Default-Config\",\n color:\"#aaaaaa\",\n fftUni:16384,\n bottom:0,\n }\n }\n}","title":""},{"docid":"e999fd18672b227572761cb612148631","score":"0.55039865","text":"function wrapMe(){ //this gets called by each content page to check if it is wrapped or not.\r\n\t\t\tif (self.location.href == top.location.href){\r\n\t\t\t top.location.href = 'index.htm?zurl=' + self.location.href;\t\t\t \r\n\t\t\t}\r\n }","title":""},{"docid":"efacaa21a697a1621388a07d3ea44cba","score":"0.54999936","text":"function letsJQuery() {\r\n\t\tif($('a[href=\"#toggle_video\"]').text().indexOf(\"High Def\") != -1)\r\n\t\t {\r\n\t\t\t\r\n\t\t\tvar url = window.location.toString();\r\n\t\t\tvar query_char='?';\r\n\t\t\t\r\n\t\t\tif( url.indexOf('hd=1')!=-1)\r\n\t\t\t{\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tif( url.indexOf('?')!=-1)\r\n\t\t\t{\r\n\t\t\t\tquery_char='&';\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tif( url.indexOf('#')!=-1 )\r\n\t\t\t{\r\n\t\t\t\ttmp=url.split('#');\r\n\t\t\t\turl=tmp[0];\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\twindow.location.replace(url + query_char + 'hd=1');\r\n\t\t }\r\n }","title":""},{"docid":"fed04d87403855176616de7254279532","score":"0.5492463","text":"function onBeforeNavigate(details) {\n // check to see if redirect is enabled before redirecting\n chrome.storage.sync.get({[KEY_ENABLED]: true}, function(items) {\n if(items.enabled) {\n // redirect the tab\n let tabId = details.tabId;\n let url = details.url;\n setTabUrl(tabId, getRedirectedUrl(url));\n }\n });\n}","title":""},{"docid":"ce17225fdabb3a57b60d28b2b212d357","score":"0.54922706","text":"function goToLoftPage(page) {\n\tvar obj = {currentPage: page};\n\thistory.pushState(obj, \"\", window.location.href);\n\tSession.set(\"currentPage\", page); \n}","title":""},{"docid":"bcff056374609f9e13347c0d252f394a","score":"0.54901934","text":"function redirigirA(url) {\n win.location.href = urlBase + url;\n }","title":""},{"docid":"967ce126d2b6126a872df39bfb08869f","score":"0.54894596","text":"goToPage(page) {}","title":""},{"docid":"015f1e67a9e0eaa6a49d8c59871cc756","score":"0.54804206","text":"assertNavigation(result) {\n return this.doesItcontain(result, \"google.com\");\n }","title":""},{"docid":"23e8a098175fdf228116c203760d31cc","score":"0.5476007","text":"function isThisPageIGM() { return (isPageIGM(document.location.href)); }","title":""},{"docid":"1c9ae8c2276000878c104e21cd3706e2","score":"0.5475034","text":"function have_try(){\n\t\twindow.location.href = \"home.php\";\n\t}","title":""},{"docid":"b4737010ce9c112f1f0b06a4c9f063d5","score":"0.54735684","text":"function gotoBlog()\r\n\t{\t\r\n\t\tisInBlog=true;\r\n\t\tBee.Application.acceptDrag = true;\r\n\t\tselectPage('blogPage');\r\n\t\tsetBlogState('view', true);\r\n\t}","title":""},{"docid":"28067db3fbaaa2b423a82dac8943e4a9","score":"0.5469273","text":"function ni_LoadUrl(url, title, trigger)\n{ \n ni_TrackHit(NI_SE, NI_SC, \"\", NI_ST, NI_SV, trigger, \"\", \"\", title, url, NI_IW, \"\", \"\", \"\");\n document.location.href = url;\n}","title":""},{"docid":"6701595f50067a632f151cecef1bf112","score":"0.54655796","text":"function checkForUrl(tabId, changeInfo, tab) {\n if (tab.url.indexOf(HH_URL) == 0) {\n if (!added) {\n\t chrome.pageAction.onClicked.addListener(function(tab) {\n\t chrome.tabs.executeScript(tab.id, { 'code': 'start();' });\n\t });\n\t}\n\tadded = true;\n chrome.pageAction.show(tabId);\n }\n}","title":""},{"docid":"d3b01c6818bd48423673d4fdf8451f8f","score":"0.54607856","text":"function linkToGoogleSite() {\n linkToGoogleSiteWithTitle(\"Google Sites Publishing Page\");\n}","title":""},{"docid":"cd7395d01cf192834556a86811ca31ac","score":"0.5457359","text":"function seccheck(sa){\n\t\tif ( sa == 'y' ){\n\t\t\twindow.location.replace(\"other.html\")\n\t\t} else {\n\t\t\twindow.location.replace(\"b2b.html\")\n\t\t}\n }","title":""},{"docid":"9503a4f4afaa07399d36f12ad39b1bb0","score":"0.5457001","text":"function changePage() {\r\n var link = location.hash.replace(\"#\", \"\"); //delete # simvol from string\r\n if (link == ''){ //if hash empty then redirect to main page(first visit for example)\r\n link = \"mainPage\";\r\n } \r\n //rewrite main content content!\r\n $.get('pages/'+ link + '.php', function(data) {\r\n $('#main-content').html(data);\r\n lazy_img_load();\r\n $(window).scrollTop(0);\r\n $('#menu-list>li').removeClass('active');\r\n if (link.includes(\"orderbasket\")){\r\n link = \"orderbasket\";\r\n } \r\n if (link.includes(\"cms\") || link.includes(\"registration\") ){\r\n link = \"\";\r\n } else {\r\n $('.'+link).addClass('active');\r\n }\r\n })\r\n//If page not exist (if error)\r\n .fail(function() {\r\n $.get('pages/404.php', function(data) { \r\n $('#main-content').html(data);\r\n $(window).scrollTop(0);\r\n })\r\n })\r\n}","title":""},{"docid":"855dc947e93127a9a1436441abaf24e8","score":"0.5454894","text":"function check() {\n if (window.location.href.includes(\"/server/\")) {\n checkInject(function(shouldInject) {\n if (shouldInject) {\n go();\n }\n });\n }\n}","title":""},{"docid":"ee8a724540ba58765866dc7b02ceafad","score":"0.54546297","text":"function goToFrontpage(){\n window.location.replace(\"https://bigchungus420.github.io/EduGames/src/index.html\");\n}","title":""},{"docid":"abd22ed663ad46275c8be8e0c6fc0776","score":"0.54520464","text":"function tooYoung() {\n window.location.replace('https://disneyland.disney.go.com/');\n}","title":""},{"docid":"4f1d43cc0f336cf64c42d186b7eeca07","score":"0.54501975","text":"function navigate(num) {\n console.log(\"Navigating to \" + num);\n if (typeof num !== \"undefined\" && num != \"home\") {\n window.location.href = \"https://ithelp.uoregon.edu/Ticket/Display.html?id=\" + num;\n } else {\n window.location.href = \"https://ithelp.uoregon.edu\";\n }\n}","title":""},{"docid":"734a0ad93f6412a34ea84e5fdfec9627","score":"0.54458654","text":"function openPageCheckUrl(input) {\n if (input == \"y\" || input == \"yes\") {\n resetInputStream();\n openPage(tempUrl, true, true);\n } else if (input == \"n\" || input == \"no\") {\n resetInputStream();\n output(\"Action aborted.\");\n } else if (input == \"a\") {\n resetInputStream();\n openPage(\"http://\" + tempUrl);\n }\n}","title":""},{"docid":"6dcac1efb2b337b91393299b6e18b293","score":"0.5434316","text":"function redirectToHome() {\n switch (currentPageType) {\n case \"default\":\n window.open(\"index.html\", \"_self\");\n break;\n case \"user\":\n window.open(\"homepage.html\", \"_self\");\n break;\n case \"admin\":\n window.open(\"admin-profile.html\", \"_self\");\n break;\n }\n}","title":""},{"docid":"4b1849d447fc01135ead453a456515bb","score":"0.5433607","text":"function goToExplore() {\r\n console.log(\"Redirecting to explore page\");\r\n location.href = \"explorepage.html\";\r\n}","title":""},{"docid":"d22795739c54042eed5f8e524abc9fc1","score":"0.5433561","text":"function redirectToGoogleAuthentication() {\n window.location = '/auth/google';\n}","title":""},{"docid":"2dd3709d4aa600d72503eed95357d949","score":"0.54318386","text":"function askDestinationPage(response) {\n response.end(ASK_URL_TO_GET_PAGE);\n}","title":""},{"docid":"b81618da1b708b4cf4289c269cace8f5","score":"0.5428747","text":"function gotos(gotourl){\n\tvar URL4 = document.gotourl.gotosec.options[document.gotourl.gotosec.selectedIndex].value;\n\tif (URL4 != '') {\n\t\twindow.open(URL4);\n\t}\n}","title":""},{"docid":"b81112d1e0c382cc7d8465957605c32b","score":"0.5418758","text":"function is_page(name){\n return is_link(name,document.location.href);\n}","title":""},{"docid":"66e853eb93efdc349ad02358f0ccb811","score":"0.54173046","text":"function landing(){\n\tif(window.location.hash == \"#about\"){\n\t\tabout_open();\n\t}else if(window.location.hash == \"#projects\"){\n\t\tproject_open();\n\t}else if(window.location.hash == \"#contact\"){\n\t\tcontact_open();\n\t}\n}","title":""}],"string":"[\n {\n \"docid\": \"8b6ef607a5a36d73237da882b6d0cc97\",\n \"score\": \"0.6438335\",\n \"text\": \"function _gotoFirstPage() {\\n window.location.href = \\\"/visitor_page\\\";\\n\\n return false\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43c67de9222b5883eb8d21f85f70db24\",\n \"score\": \"0.63341933\",\n \"text\": \"function whichPage(){\\n if ((document.URL).includes(\\\"you-can-do-it\\\")) {\\n return \\\"work\\\"\\n }\\n else {\\n return \\\"relax\\\"\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc2a2ec72fcb7fa9d53ce71bfae7be64\",\n \"score\": \"0.6312278\",\n \"text\": \"function sys_jump_page(url){\\r\\n if(url){\\r\\n \\twindow.location = url;\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd95d24da9ec21a09bf8d051c4ead9bd\",\n \"score\": \"0.6306668\",\n \"text\": \"function gotoUrl(){\\n if(location.hash !== ''){\\n var pageName = location.hash.split('#')[1];\\n var contentData = location.href.split('#')[0] + '/projects/' + pageName + '.html';\\n\\n if( pageName === 'work' || pageName === 'about'){\\n var contentData = location.href.split('#')[0] + '/' + pageName + '.html';\\n }\\n showPage(contentData, pageName);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a336b15bc472b83cde97e0023461b788\",\n \"score\": \"0.63032496\",\n \"text\": \"function detectUrlChange() {\\n currentUrl = window.location.href\\n if (currentUrl !== savedUrl){\\n fLog('> Url changed to '+currentUrl, 3);\\n if (currentUrl.indexOf('youtube.com/watch?') !== -1) {\\n activateScript();\\n }\\n savedUrl = currentUrl;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2eae88cb54d4cf5ba0304d59962e72b3\",\n \"score\": \"0.62838894\",\n \"text\": \"function gotoUrl(url) {\\r\\n\\twindow.location = url;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f8ed70ca198c617e458c744a4ec8ba9\",\n \"score\": \"0.6184985\",\n \"text\": \"function goTo(url) {\\n window.location.href = url;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de32576b2393f019b98906f0e3deba05\",\n \"score\": \"0.61500293\",\n \"text\": \"goToPage() {\\n I.amOnPage(this.url);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b986ce7ab3d42303838bab1f58679af1\",\n \"score\": \"0.61274785\",\n \"text\": \"function goHere(url) {\\r\\n\\twindow.location=url;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b3524713abd99ce84fe00381f4fe86a\",\n \"score\": \"0.6080684\",\n \"text\": \"function MM_goToURL() { //v3.0\\n var i, args=MM_goToURL.arguments; document.MM_returnValue = false;\\n for (i=0; i<(args.length-1); i+=2) eval(args[i]+\\\".location='\\\"+args[i+1]+\\\"'\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a759679604bfeed10a0b692f8b606fcf\",\n \"score\": \"0.60680616\",\n \"text\": \"function goTo(url) {\\n if (url.indexOf(\\\".html\\\") == -1) {\\n window.location.href = url + \\\".html\\\";\\n }\\n else {\\n window.location.href = url;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fac4a810518752fbfe1e1f8d18c1ba72\",\n \"score\": \"0.6056887\",\n \"text\": \"function goToURL(url){\\n\\twindow.location.href = url;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6aeccbb3b469b05306b65809d4dc6a9c\",\n \"score\": \"0.6049196\",\n \"text\": \"function iGoTo(goTo){\\n Cala.say(\\\"Going to: \\\" + goTo);\\n window.location.href = goTo;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"788842a76e2f4ffff8c3c3d9e5d7f692\",\n \"score\": \"0.6040291\",\n \"text\": \"function goPage(go_page)\\n{\\n\\ttop.location.href = go_page;\\n return;\\n} //end function: goPage();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4318d24b03afff745f034e89ebd62d04\",\n \"score\": \"0.5999355\",\n \"text\": \"function gotourl(url) {\\n\\twindow.location = url;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af7d1c8b3791b7c1dbad3f06d521b978\",\n \"score\": \"0.59751743\",\n \"text\": \"function gotosite(site) {\\r if (site != \\\"\\\") {\\r window.location=site;\\r }\\r}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59b5985f2fbc7147964859f1ffd527f7\",\n \"score\": \"0.5940114\",\n \"text\": \"function Go_To_Next_Loterie()\\r\\n{\\r\\n\\tvar host\\t\\t= Get_Host();\\r\\n\\r\\n\\tvar current_loterie_found = false;\\r\\n\\tvar next_loterie_url = '';\\r\\n\\tfor (c_host in loteries)\\r\\n\\t{\\r\\n\\t\\tif (current_loterie_found == true)\\r\\n\\t\\t{\\r\\n\\t\\t\\tnext_loterie_url = loteries[c_host]['url'];\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t}\\r\\n\\t\\tif (c_host == host)\\r\\n\\t\\t{\\r\\n\\t\\t\\tcurrent_loterie_found = true;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\tif (next_loterie_url != '')\\r\\n\\t{\\r\\n\\t\\twindow.location.href = next_loterie_url;\\r\\n\\t}\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a0a36b426aac310f1f28e21bf891157\",\n \"score\": \"0.59187555\",\n \"text\": \"function goto(to){\\n window.location = to;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"708952c4c88517ddcd2dc76201e299d5\",\n \"score\": \"0.59117967\",\n \"text\": \"function jump_site(){\\n sitevar= document.searchForm.dropdown.selectedIndex;\\n if(sitevar != 0){\\n location.href = document.searchForm.dropdown.options[sitevar].value;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9b2d04cba88978d34b87229a814d9e1\",\n \"score\": \"0.5895727\",\n \"text\": \"function isThisPageDorf1() { return (isPageDorf1(document.location.href)); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37ad7dfd822c92bbe53e5909cf50b219\",\n \"score\": \"0.5894809\",\n \"text\": \"function goToDecks() {\\n document.location = \\\"homepage.html\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d235607b8d536a5159c4f70c40f8e53\",\n \"score\": \"0.5894442\",\n \"text\": \"goTo() {\\n browser.get(this.url, this.timeout);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89f10814a1590369e76d4ebe14c2707e\",\n \"score\": \"0.5870659\",\n \"text\": \"function navigateTo(url) {\\n window.location = url;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"229c98ea3f13a97ecd25427f7d5d1edd\",\n \"score\": \"0.5863665\",\n \"text\": \"function VisitPage(url) {\\n window.location = url;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60c34067dbf9b6a18f2e0a750835eac8\",\n \"score\": \"0.5857147\",\n \"text\": \"function goToUrl(newPage) {\\n window.location = newPage;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f4daa5ac5990331564f1a6cbeb3a94f\",\n \"score\": \"0.58434886\",\n \"text\": \"function gotosite(site) {\\n if (site != \\\"\\\") {\\n window.location=site;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ddcf002c1544c9ad6cb5d54eb55d1b32\",\n \"score\": \"0.5817462\",\n \"text\": \"async goToContact(url) {\\n const {page} = this;\\n await page.goto(url, {\\n timeout: 0\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90cccd716d70ed9b9e62ed319c1a0f43\",\n \"score\": \"0.58030313\",\n \"text\": \"function goTo() {\\n\\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\\t\\t\\t\\t\\t\\t\\twindow.location.href=\\\"other.html\\\";\\n\\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\\t\\t\\t\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f623681e0e807fe74f45e2260f22483a\",\n \"score\": \"0.5788514\",\n \"text\": \"function gotoseeker()\\n{\\n window.location.href=\\\"seeker.html\\\"\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b2369c1f3c30fc8352a27bdee056782\",\n \"score\": \"0.5775409\",\n \"text\": \"function gotoNextPage(){\\n setCurrentPageUrl(nextPageUrl)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35234c52883148fc4cab56815981d8df\",\n \"score\": \"0.576355\",\n \"text\": \"function goHomeButtonClicked() {\\n var page = document.getElementById(\\\"page\\\");\\n page.stop();\\n navigateTo(\\\"https://www.google.com/\\\")\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5ca3e10b7f629d3920005d82fe937ff\",\n \"score\": \"0.5763419\",\n \"text\": \"function updateDCK() {\\n\\tvar pattern = /^(http|https):\\\\/\\\\/duckduckgo\\\\.com\\\\/[^\\\\s]*(\\\\?|\\\\&)q=.{1,}$/;\\n\\tisDCK = pattern.test(currentURL);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5537d566b5eb59e98c0f5873291f06f2\",\n \"score\": \"0.5751249\",\n \"text\": \"function onPopAndStart(){\\n\\n var l = location.href;\\n var pageName = l.substring(l.lastIndexOf(\\\"/\\\")+1);\\n pageName = pageName || \\\"home\\\";\\n\\n showPage(pageName);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20578ed82912c7e81007e5371e3ba779\",\n \"score\": \"0.57439005\",\n \"text\": \"function gotoBrowserWindow(url)\\r\\n\\t{\\r\\n\\t\\tair.navigateToURL( new air.URLRequest( url ), \\\"_blank\\\" );\\r\\n\\r\\n\\t\\t$('sp_wpOr').innerHTML = lang['TELL_ME'];\\r\\n\\t\\t$('sp_wpOr').className='created';\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1bfa585f2d0546c5128bbf89c5b613ec\",\n \"score\": \"0.57383114\",\n \"text\": \"function getGoNext() {\\n var href = window.location.href,\\n goNext;\\n return href.replace(window.location.protocol + \\\"//\\\" + window.location.host + \\\"/cgi-bin/setup.cgi?gonext=\\\", \\\"\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64c381624322e7ec840d145c36b8b1e9\",\n \"score\": \"0.5735852\",\n \"text\": \"function go_quicklink2(){\\r\\n var resultPage=document.sitebar2.siteChoice2;\\r\\n for (var i = 0; i < document.sitebar2.siteChoice2.length; i++)\\r\\n {\\r\\n if (resultPage.options[i].selected == true)\\r\\n if (resultPage.options[i].value != \\\"\\\")\\r\\n parent.location.href=resultPage.options[i].value;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88d7f8318f68ea006e50bc3c1c1c227f\",\n \"score\": \"0.5728029\",\n \"text\": \"function loadPageNoExplore() {\\n window.location.href='/thesis/'\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"253277eb4ec9375a45d0130406ba3f66\",\n \"score\": \"0.57274765\",\n \"text\": \"function go_quicklink(){\\r\\n var resultPage=document.sitebar1.siteChoice1;\\r\\n for (var i = 0; i < document.sitebar1.siteChoice1.length; i++)\\r\\n {\\r\\n if (resultPage.options[i].selected == true)\\r\\n if (resultPage.options[i].value != \\\"\\\")\\r\\n parent.location.href=resultPage.options[i].value;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b33a5dd070ea30e191f155d847670cad\",\n \"score\": \"0.57145673\",\n \"text\": \"function go_to_entrance() {\\n /* Visit the entrance page. Depending on session state, it might\\n present a login challenge or it might present the top-level\\n contents associated with the logged-in account. */\\n // Use a string url so our transit machinery registers a visit.\\n $.mobile.changePage(my.combo_root_url); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9564bc7c65d4ca96e5811403873ccb0\",\n \"score\": \"0.5711344\",\n \"text\": \"function isThisPageVillage() { return isPageVillage(document.location.href); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"333bb631c8f88a3db9dd65dfdcd7f9ad\",\n \"score\": \"0.5710735\",\n \"text\": \"function Goto(valeur){\\n var debuturl = window.location.origin;\\n switch(valeur){\\n case 1:window.location=debuturl+\\\"/Professionnel.html\\\";break;\\n case 2:window.location=debuturl+\\\"/Piano.html\\\";break;\\n case 3:window.location=debuturl+\\\"/News.html\\\";break;\\n default: windows.location=debuturl;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a89a82047cb3e0adc82d011e23c6d5b1\",\n \"score\": \"0.57092404\",\n \"text\": \"function PageTurn (URL) {\\n if (typeof URL !== 'string') { return 0; }\\n\\n if (URL.length > 0) { window.location = URL; }\\n else { window.location.reload(true); }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bdc65c55ba445173f0cc915bed54505\",\n \"score\": \"0.56878334\",\n \"text\": \"checkLinkType() {\\n // TODO: Make sure the website is not part of the stackexchange network and not limit ourselves to stackoverflow\\n if (this.CURRENT_TAB != 'stackoverflow.com' && this.redirectLink.includes('/questions/')) {\\n return 'question';\\n } else {\\n return 'unknown';\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c499cb0ac234efcdbfbbe53d66a7229\",\n \"score\": \"0.568136\",\n \"text\": \"function checkLink() {\\n let buttons = $(\\\":button[go]\\\");\\n for (const btn of buttons) {\\n let go = $(btn).attr(\\\"go\\\");\\n let index = window.location.href.indexOf(go);\\n if (index >= 0) {\\n let link = window.location.href.slice(index);\\n link = link.split(\\\"/\\\").join(\\\"\\\");\\n go = go.split(\\\"/\\\").join(\\\"\\\");\\n if (link === go) {\\n btnActivate($(btn).attr(\\\"id\\\"));\\n break;\\n }\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02c67fad8d7ade331d563ebbf3851c3c\",\n \"score\": \"0.5680292\",\n \"text\": \"function go_quicklink1(){\\r\\n var resultPage=document.sitebar1.siteChoice1;\\r\\n for (var i = 0; i < document.sitebar1.siteChoice1.length; i++)\\r\\n {\\r\\n if (resultPage.options[i].selected == true)\\r\\n if (resultPage.options[i].value != \\\"\\\")\\r\\n parent.location.href=resultPage.options[i].value;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f1ec0ced37684251b44db303215b79f\",\n \"score\": \"0.5675057\",\n \"text\": \"function gotoP(page) {\\n location.href = page;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a98dffdccf4b98d8afb01ac7843aa0d\",\n \"score\": \"0.5672991\",\n \"text\": \"function jumpTo(page){\\n\\tdocument.location.href =page;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79743503c9a48e929f1b7be219b8e8c8\",\n \"score\": \"0.5670163\",\n \"text\": \"function navigate(url) {\\n window.location.assign(url);\\n chrome.tabs.query({\\n active: true,\\n currentWindow: true\\n }, function(tabs) {\\n chrome.tabs.update(tabs[0].id, {\\n url: url\\n });\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de0887be9a2a9a350ac63280c2ce3733\",\n \"score\": \"0.56680423\",\n \"text\": \"function tieptucmuahang(base_url)\\n{\\n\\twindow.location = base_url;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6eac20b90662c0b074f9dcfd800f6923\",\n \"score\": \"0.56596977\",\n \"text\": \"function isThisPageDorf3() { return (isPageDorf3(document.location.href)); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"764fd89270c771ddde1fb735b4cba467\",\n \"score\": \"0.5656237\",\n \"text\": \"function changePage(url){\\n location.replace(url);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bc88d97b007a60cb8dee335f807e536\",\n \"score\": \"0.5639255\",\n \"text\": \"function changePage(url) {\\n location.replace(url);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08c4fe789eb1156dbcf5036b9523faab\",\n \"score\": \"0.56363654\",\n \"text\": \"function start_url() {\\t\\n\\tquery_id = \\\"\\\";\\n\\tfilterLabel = \\\"\\\";\\n\\ttimeout = 3;\\t\\n\\t\\n\\tdasty_mainpage_name = findDastyHtmlPageName('page_name') + \\\".\\\" + findDastyHtmlPageName('ext_name');\\n\\tconfiguration();\\n\\tdefault_query_parameters();\\n\\t\\n\\tsetDastyURLParam();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dff571e07085f2342e1147213e2da8e6\",\n \"score\": \"0.5624279\",\n \"text\": \"function discover() {\\n //redirecting to profile page\\n window.location = \\\"discover.html\\\";\\n\\n //Return true to jump out of the function, since we now have all we need\\n return true;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa450e713e6478fefdddac04b7105e1f\",\n \"score\": \"0.5607525\",\n \"text\": \"function linkCurrentPage() {\\r\\n chrome.tabs.query({\\r\\n active: true,\\r\\n currentWindow: true\\r\\n }, function(tabs) {\\r\\n chrome.tabs.sendMessage(tabs[0].id, {\\r\\n action: 'link'\\r\\n }, function(response) {\\r\\n if (response) {\\r\\n // Looked for links successfully\\r\\n updateStatus(response.linkCount);\\r\\n } else {\\r\\n // Didn't get a response, might be on chrome page or page loading\\r\\n // Show no links found\\r\\n updateStatus(0);\\r\\n }\\r\\n });\\r\\n });\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f61c2f47077983f28433cc728e481fcd\",\n \"score\": \"0.5606776\",\n \"text\": \"async function navigateTo(url, page) {\\n let navigated = false;\\n try {\\n await page.goto(url, {\\n waitUntil: \\\"networkidle0\\\",\\n timeout: configuration.timeoutms,\\n });\\n logger.logToConsole(\\n {\\n message: \\\"Navigated to URL : > \\\",\\n info: url,\\n },\\n \\\"log\\\"\\n );\\n navigated = true;\\n } catch (e) {\\n logger.logToConsole(\\n {\\n message: \\\"Error: Wasn't able to Navigate to URL\\\",\\n error: e,\\n },\\n \\\"error\\\"\\n );\\n }\\n return navigated;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"283e7fa9e57405e6c252e9e436c8a572\",\n \"score\": \"0.55848897\",\n \"text\": \"function loginGoogle() {\\n window.location.href = '/auth/google';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"484705ce0cade09dd4cf051cb15d510b\",\n \"score\": \"0.5583128\",\n \"text\": \"function redirect(){\\r\\n window.location.assign('https://www.bloggingprince.com');\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2715f946d98625e060cd5fbe08d5c642\",\n \"score\": \"0.557622\",\n \"text\": \"function doNotKnowTheProblem(){\\n window.location = getNextUrlToDrill();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40591ff17f662ab440e0d7c878d14691\",\n \"score\": \"0.55753934\",\n \"text\": \"function go(url, newWindow = false) {\\r\\n newWindow ? window.open(url) : window.location.href = url;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d4390c8d1e5b337ff873fe89ffb41a7\",\n \"score\": \"0.55729705\",\n \"text\": \"function gotoURL(a){\\n\\tchrome.tabs.create({'url': a});\\n\\tself.close();\\n\\t_gaq.push(['_trackEvent', 'gotoZippyshare', 'clicked']);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"571bf486244a42aa6f3e040a595ddb55\",\n \"score\": \"0.55718064\",\n \"text\": \"function jump_page(e) {\\n var t = $(\\\"#\\\" + e).val();\\n var n = $(\\\".url_jump\\\").val();\\n window.location.href = n + t;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0863af97adf352d48a4af67d24b51264\",\n \"score\": \"0.5559143\",\n \"text\": \"function checkForValidUrl(tabId, changeInfo, tab) {\\n\\t\\t\\t// Check if page is a presentation.\\n\\t\\t\\tif (tab.url.indexOf('docs.google.com/presentation') > -1) {\\n\\t\\t\\t\\t// ... show the page action.\\n\\t\\t\\t\\tchrome.pageAction.show(tabId);\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2944ef92abea86f348c7ab3f5dfc6086\",\n \"score\": \"0.55566496\",\n \"text\": \"checkUrl( /*e*/ ) {\\n var current = this.getFragment();\\n // If the user pressed the back button, the iframe's hash will have\\n // changed and we should use that for comparison.\\n if (current === this.fragment && this.iframe) {\\n current = this.getHash(this.iframe.contentWindow);\\n }\\n if (current === this.fragment) {\\n return false;\\n }\\n if (this.iframe) {\\n this.navigate(current);\\n }\\n this.loadUrl();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ad52c997e66b410aad11f95aaaf8101\",\n \"score\": \"0.5556273\",\n \"text\": \"function go_newfeeds( check1) {\\r\\n\\r\\n\\tvar currentLocation = window.location;\\r\\n\\r\\n\\tif ( currentLocation.pathname === \\\"/xti.php\\\" ) {\\r\\n\\t\\treturn false;\\r\\n\\t}\\r\\n\\r\\n\\tif ( currentLocation.pathname === \\\"/home.php\\\" ) {\\r\\n\\t\\treturn true;\\r\\n\\t} else {\\r\\n\\t\\ttmp_page = 0;\\r\\n\\t}\\r\\n\\r\\n\\tif (tmp_page !== 0 && check1 === 0) { \\r\\n\\r\\n\\t\\treturn true; \\r\\n\\t}\\r\\n\\tif (tmp_page === 0) {\\r\\n\\t\\ttmp_page = 1;\\r\\n\\t}\\r\\n\\r\\n\\tvar inputs2 = document.querySelector('div#feed_jewel a'); \\r\\n\\tif ( inputs2 !== null) {\\r\\n\\t\\tinputs2.click();\\r\\n\\t}\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d58163556a212a9f1822b1e0ea976b0\",\n \"score\": \"0.5554297\",\n \"text\": \"function go2page(link) {\\n $('.slide').hide();\\n $('#' + link).show();\\n $('.control').add($('#navbar_items a')).removeClass('hilite');\\n $('#' + link + '_control').add($('#navbar_items a[href~=\\\"#' + link + '\\\"]')).addClass('hilite');\\n \\n //Inhaltsverzeichnis der Seite\\n fixPageindex();\\n\\n // toggle position thesaurus pageindex, s.u.\\n \\n // track a page view\\n _paq.push(['setCustomUrl', URI().href()]);\\n _paq.push(['trackPageView']);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ac52a7c7d7194ff97e9f9f0f99a97a3\",\n \"score\": \"0.55539715\",\n \"text\": \"function isThisPageKarte2MapPage() { return (isPageKarte2MapPage(document.location.href)); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e7bd14f04b61f3920325c59a2d7e208d\",\n \"score\": \"0.554125\",\n \"text\": \"function checkForValidUrl(tabId, changeInfo, tab) {\\n if (tab.url.indexOf('.notonthehighstreet.com') > -1 || tab.url.indexOf('.noths.com') > -1) {\\n chrome.pageAction.show(tabId);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77fbbce89bf3acd4e6fe50b5042d4ce0\",\n \"score\": \"0.55335146\",\n \"text\": \"function goto(page) {\\n\\tif(page === 'index') {\\n\\t\\t// When goto command is issued for 'index', we goto to root\\n\\t\\tpage = ''; \\n\\t}\\n\\tvar gotoURL = 'http://' + window.location.hostname + ':' + location.port + '/' + page;\\n\\tconsole.log('Redirecting to ' + gotoURL);\\n\\twindow.location.href = gotoURL;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8348d3bfc7fdb5b1d6f6223a1deead6d\",\n \"score\": \"0.55307555\",\n \"text\": \"function showPage(url) {\\n try {\\n window.top.$j(\\\"#gsft_main\\\").attr('src', url);\\n return false;\\n } catch (ex) {\\n jslog(errorLogPrefix + \\\" showPage: \\\" + ex.message);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71de1ed63b0825dd7dbeba687606ccec\",\n \"score\": \"0.551412\",\n \"text\": \"function checkURL() {\\nvar currentLocation = window.location.href;\\n\\tif (currentLocation == \\\"https://kzlv.me/\\\") {\\n\\t\\tdocument.getElementById('kai').innerHTML += \\\"<font face=\\\\\\\"verdana\\\\\\\"><font color=\\\\\\\"#FF69B4\\\\\\\">[kai]</font> official site</font>\\\";\\n}\\t\\nelse {\\n\\t\\tdocument.getElementById('kai').innerHTML += \\\"<font face=\\\\\\\"verdana\\\\\\\"><font color=\\\\\\\"#FF69B4\\\\\\\">[kai]</font> unverified site current site \\\" + window.location.href + \\\" differs from official site kzlv.me</font>\\\";\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86e8d56bd785f6bff5cb5a5034302bb5\",\n \"score\": \"0.55121624\",\n \"text\": \"function go_page(link){ \\r\\n\\tif (link=='#') {return false;}\\r\\n\\t\\r\\n\\t$.ajax({\\r\\n method: \\\"GET\\\",\\r\\n dataType: \\\"html\\\",\\r\\n url: link,\\r\\n beforeSend: function() {\\r\\n $(\\\".content-wrapper\\\").css(\\\"background-color\\\", 'white');\\r\\n $(\\\".load\\\").css(\\\"display\\\", 'block');\\r\\n $(\\\".content-wrapper2\\\").css(\\\"display\\\", 'none');\\r\\n\\r\\n },\\r\\n complete: function() {\\r\\n $(\\\".content-wrapper\\\").css(\\\"background-color\\\", '#ecf0f5');\\r\\n $(\\\".load\\\").css(\\\"display\\\", 'none');\\r\\n $(\\\".content-wrapper2\\\").css(\\\"display\\\", 'block');\\r\\n },\\r\\n success: function(res){\\r\\n $('.content-wrapper2').html(res);\\r\\n $('.ui-pnotify-closer').click();\\r\\n }\\r\\n });\\r\\n return false;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40cd0f96792df66d4df265d45427baf5\",\n \"score\": \"0.5511795\",\n \"text\": \"function getCurrentPage(url){\\n if(url.includes(\\\"play.google\\\")){\\n return{\\n name:\\\"Google-Play-Music-Config\\\",\\n color:\\\"#FF5722\\\",\\n color2:\\\"#ffffff\\\",\\n fftUni:16384,\\n bottom:90,\\n }\\n }\\n else if(url.includes(\\\"music.youtube\\\")){\\n return{\\n name:\\\"YouTube-Music-Config\\\",\\n color:\\\"#FFFFFF\\\",\\n fftUni:16384,\\n bottom:83,\\n }\\n }\\n else if(url.includes(\\\"youtube\\\")){\\n return{\\n name:\\\"YouTube-Config\\\",\\n color:\\\"#FF0000\\\",\\n fftUni:8192,\\n bottom:0,\\n }\\n }\\n else{\\n return{\\n name:\\\"Default-Config\\\",\\n color:\\\"#aaaaaa\\\",\\n fftUni:16384,\\n bottom:0,\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e999fd18672b227572761cb612148631\",\n \"score\": \"0.55039865\",\n \"text\": \"function wrapMe(){ //this gets called by each content page to check if it is wrapped or not.\\r\\n\\t\\t\\tif (self.location.href == top.location.href){\\r\\n\\t\\t\\t top.location.href = 'index.htm?zurl=' + self.location.href;\\t\\t\\t \\r\\n\\t\\t\\t}\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efacaa21a697a1621388a07d3ea44cba\",\n \"score\": \"0.54999936\",\n \"text\": \"function letsJQuery() {\\r\\n\\t\\tif($('a[href=\\\"#toggle_video\\\"]').text().indexOf(\\\"High Def\\\") != -1)\\r\\n\\t\\t {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tvar url = window.location.toString();\\r\\n\\t\\t\\tvar query_char='?';\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif( url.indexOf('hd=1')!=-1)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif( url.indexOf('?')!=-1)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tquery_char='&';\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif( url.indexOf('#')!=-1 )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttmp=url.split('#');\\r\\n\\t\\t\\t\\turl=tmp[0];\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\twindow.location.replace(url + query_char + 'hd=1');\\r\\n\\t\\t }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fed04d87403855176616de7254279532\",\n \"score\": \"0.5492463\",\n \"text\": \"function onBeforeNavigate(details) {\\n // check to see if redirect is enabled before redirecting\\n chrome.storage.sync.get({[KEY_ENABLED]: true}, function(items) {\\n if(items.enabled) {\\n // redirect the tab\\n let tabId = details.tabId;\\n let url = details.url;\\n setTabUrl(tabId, getRedirectedUrl(url));\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce17225fdabb3a57b60d28b2b212d357\",\n \"score\": \"0.54922706\",\n \"text\": \"function goToLoftPage(page) {\\n\\tvar obj = {currentPage: page};\\n\\thistory.pushState(obj, \\\"\\\", window.location.href);\\n\\tSession.set(\\\"currentPage\\\", page); \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bcff056374609f9e13347c0d252f394a\",\n \"score\": \"0.54901934\",\n \"text\": \"function redirigirA(url) {\\n win.location.href = urlBase + url;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"967ce126d2b6126a872df39bfb08869f\",\n \"score\": \"0.54894596\",\n \"text\": \"goToPage(page) {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"015f1e67a9e0eaa6a49d8c59871cc756\",\n \"score\": \"0.54804206\",\n \"text\": \"assertNavigation(result) {\\n return this.doesItcontain(result, \\\"google.com\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"23e8a098175fdf228116c203760d31cc\",\n \"score\": \"0.5476007\",\n \"text\": \"function isThisPageIGM() { return (isPageIGM(document.location.href)); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c9ae8c2276000878c104e21cd3706e2\",\n \"score\": \"0.5475034\",\n \"text\": \"function have_try(){\\n\\t\\twindow.location.href = \\\"home.php\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4737010ce9c112f1f0b06a4c9f063d5\",\n \"score\": \"0.54735684\",\n \"text\": \"function gotoBlog()\\r\\n\\t{\\t\\r\\n\\t\\tisInBlog=true;\\r\\n\\t\\tBee.Application.acceptDrag = true;\\r\\n\\t\\tselectPage('blogPage');\\r\\n\\t\\tsetBlogState('view', true);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28067db3fbaaa2b423a82dac8943e4a9\",\n \"score\": \"0.5469273\",\n \"text\": \"function ni_LoadUrl(url, title, trigger)\\n{ \\n ni_TrackHit(NI_SE, NI_SC, \\\"\\\", NI_ST, NI_SV, trigger, \\\"\\\", \\\"\\\", title, url, NI_IW, \\\"\\\", \\\"\\\", \\\"\\\");\\n document.location.href = url;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6701595f50067a632f151cecef1bf112\",\n \"score\": \"0.54655796\",\n \"text\": \"function checkForUrl(tabId, changeInfo, tab) {\\n if (tab.url.indexOf(HH_URL) == 0) {\\n if (!added) {\\n\\t chrome.pageAction.onClicked.addListener(function(tab) {\\n\\t chrome.tabs.executeScript(tab.id, { 'code': 'start();' });\\n\\t });\\n\\t}\\n\\tadded = true;\\n chrome.pageAction.show(tabId);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3b01c6818bd48423673d4fdf8451f8f\",\n \"score\": \"0.54607856\",\n \"text\": \"function linkToGoogleSite() {\\n linkToGoogleSiteWithTitle(\\\"Google Sites Publishing Page\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd7395d01cf192834556a86811ca31ac\",\n \"score\": \"0.5457359\",\n \"text\": \"function seccheck(sa){\\n\\t\\tif ( sa == 'y' ){\\n\\t\\t\\twindow.location.replace(\\\"other.html\\\")\\n\\t\\t} else {\\n\\t\\t\\twindow.location.replace(\\\"b2b.html\\\")\\n\\t\\t}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9503a4f4afaa07399d36f12ad39b1bb0\",\n \"score\": \"0.5457001\",\n \"text\": \"function changePage() {\\r\\n var link = location.hash.replace(\\\"#\\\", \\\"\\\"); //delete # simvol from string\\r\\n if (link == ''){ //if hash empty then redirect to main page(first visit for example)\\r\\n link = \\\"mainPage\\\";\\r\\n } \\r\\n //rewrite main content content!\\r\\n $.get('pages/'+ link + '.php', function(data) {\\r\\n $('#main-content').html(data);\\r\\n lazy_img_load();\\r\\n $(window).scrollTop(0);\\r\\n $('#menu-list>li').removeClass('active');\\r\\n if (link.includes(\\\"orderbasket\\\")){\\r\\n link = \\\"orderbasket\\\";\\r\\n } \\r\\n if (link.includes(\\\"cms\\\") || link.includes(\\\"registration\\\") ){\\r\\n link = \\\"\\\";\\r\\n } else {\\r\\n $('.'+link).addClass('active');\\r\\n }\\r\\n })\\r\\n//If page not exist (if error)\\r\\n .fail(function() {\\r\\n $.get('pages/404.php', function(data) { \\r\\n $('#main-content').html(data);\\r\\n $(window).scrollTop(0);\\r\\n })\\r\\n })\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"855dc947e93127a9a1436441abaf24e8\",\n \"score\": \"0.5454894\",\n \"text\": \"function check() {\\n if (window.location.href.includes(\\\"/server/\\\")) {\\n checkInject(function(shouldInject) {\\n if (shouldInject) {\\n go();\\n }\\n });\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee8a724540ba58765866dc7b02ceafad\",\n \"score\": \"0.54546297\",\n \"text\": \"function goToFrontpage(){\\n window.location.replace(\\\"https://bigchungus420.github.io/EduGames/src/index.html\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abd22ed663ad46275c8be8e0c6fc0776\",\n \"score\": \"0.54520464\",\n \"text\": \"function tooYoung() {\\n window.location.replace('https://disneyland.disney.go.com/');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f1d43cc0f336cf64c42d186b7eeca07\",\n \"score\": \"0.54501975\",\n \"text\": \"function navigate(num) {\\n console.log(\\\"Navigating to \\\" + num);\\n if (typeof num !== \\\"undefined\\\" && num != \\\"home\\\") {\\n window.location.href = \\\"https://ithelp.uoregon.edu/Ticket/Display.html?id=\\\" + num;\\n } else {\\n window.location.href = \\\"https://ithelp.uoregon.edu\\\";\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"734a0ad93f6412a34ea84e5fdfec9627\",\n \"score\": \"0.54458654\",\n \"text\": \"function openPageCheckUrl(input) {\\n if (input == \\\"y\\\" || input == \\\"yes\\\") {\\n resetInputStream();\\n openPage(tempUrl, true, true);\\n } else if (input == \\\"n\\\" || input == \\\"no\\\") {\\n resetInputStream();\\n output(\\\"Action aborted.\\\");\\n } else if (input == \\\"a\\\") {\\n resetInputStream();\\n openPage(\\\"http://\\\" + tempUrl);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dcac1efb2b337b91393299b6e18b293\",\n \"score\": \"0.5434316\",\n \"text\": \"function redirectToHome() {\\n switch (currentPageType) {\\n case \\\"default\\\":\\n window.open(\\\"index.html\\\", \\\"_self\\\");\\n break;\\n case \\\"user\\\":\\n window.open(\\\"homepage.html\\\", \\\"_self\\\");\\n break;\\n case \\\"admin\\\":\\n window.open(\\\"admin-profile.html\\\", \\\"_self\\\");\\n break;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b1849d447fc01135ead453a456515bb\",\n \"score\": \"0.5433607\",\n \"text\": \"function goToExplore() {\\r\\n console.log(\\\"Redirecting to explore page\\\");\\r\\n location.href = \\\"explorepage.html\\\";\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d22795739c54042eed5f8e524abc9fc1\",\n \"score\": \"0.5433561\",\n \"text\": \"function redirectToGoogleAuthentication() {\\n window.location = '/auth/google';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2dd3709d4aa600d72503eed95357d949\",\n \"score\": \"0.54318386\",\n \"text\": \"function askDestinationPage(response) {\\n response.end(ASK_URL_TO_GET_PAGE);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b81618da1b708b4cf4289c269cace8f5\",\n \"score\": \"0.5428747\",\n \"text\": \"function gotos(gotourl){\\n\\tvar URL4 = document.gotourl.gotosec.options[document.gotourl.gotosec.selectedIndex].value;\\n\\tif (URL4 != '') {\\n\\t\\twindow.open(URL4);\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b81112d1e0c382cc7d8465957605c32b\",\n \"score\": \"0.5418758\",\n \"text\": \"function is_page(name){\\n return is_link(name,document.location.href);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66e853eb93efdc349ad02358f0ccb811\",\n \"score\": \"0.54173046\",\n \"text\": \"function landing(){\\n\\tif(window.location.hash == \\\"#about\\\"){\\n\\t\\tabout_open();\\n\\t}else if(window.location.hash == \\\"#projects\\\"){\\n\\t\\tproject_open();\\n\\t}else if(window.location.hash == \\\"#contact\\\"){\\n\\t\\tcontact_open();\\n\\t}\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":79,"cells":{"query_id":{"kind":"string","value":"e89915e8aa22d99f21ff514852199218"},"query":{"kind":"string","value":"helper function to create a unit with a fixed prefix"},"positive_passages":{"kind":"list like","value":[{"docid":"b35043967721cca4fedcbd7ac4c0732f","score":"0.71195364","text":"function fixedUnit(str) {\n var unit = type.Unit.parse(str);\n unit.fixPrefix = true;\n return unit;\n }","title":""}],"string":"[\n {\n \"docid\": \"b35043967721cca4fedcbd7ac4c0732f\",\n \"score\": \"0.71195364\",\n \"text\": \"function fixedUnit(str) {\\n var unit = type.Unit.parse(str);\\n unit.fixPrefix = true;\\n return unit;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"b6f119e67f2be1106ee3c2f436f3bcfb","score":"0.71431434","text":"function fixedUnit(str) {\n var unit = type.Unit.parse(str);\n unit.fixPrefix = true;\n return unit;\n } // Source: https://en.wikipedia.org/wiki/Physical_constant","title":""},{"docid":"4fc677d72cd84bb35704a5474845716e","score":"0.69279677","text":"function fixedUnit(str) {\n\t\t\tvar unit = type.Unit.parse(str);\n\t\t\tunit.fixPrefix = true;\n\t\t\treturn unit;\n\t\t}","title":""},{"docid":"c508458a8828d56f4410696247e03953","score":"0.6602577","text":"function unitFactory(name, valueStr, unitStr) {\n var dependencies = ['config', 'Unit', 'BigNumber'];\n return factory_factory(name, dependencies, (_ref) => {\n var {\n config,\n Unit,\n BigNumber\n } = _ref;\n // Note that we can parse into number or BigNumber.\n // We do not parse into Fractions as that doesn't make sense: we would lose precision of the values\n // Therefore we dont use Unit.parse()\n var value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);\n var unit = new Unit(value, unitStr);\n unit.fixPrefix = true;\n return unit;\n });\n} // helper function to create a factory function which creates a numeric constant,","title":""},{"docid":"b196519b323ecf4c591309afa50fc039","score":"0.6602374","text":"function withUnit (unit, count) {\n return `${count} ${pluralize(unit, count)}`;\n}","title":""},{"docid":"868b72faa442b7ca8825ed7814908a62","score":"0.6439161","text":"prefixed(prefix) {\n return this.name.replace(/^(\\W*)/, `$1${prefix}`)\n }","title":""},{"docid":"5b290519612c98c6eb68a742339604ec","score":"0.6417857","text":"prefixed(prefix) {\n let spec, value\n ;[spec, prefix] = flexSpec(prefix);\n\n if (spec === 2009) {\n if (this.name === 'flex') {\n value = 'box';\n } else {\n value = 'inline-box';\n }\n } else if (spec === 2012) {\n if (this.name === 'flex') {\n value = 'flexbox';\n } else {\n value = 'inline-flexbox';\n }\n } else if (spec === 'final') {\n value = this.name;\n }\n\n return prefix + value\n }","title":""},{"docid":"9261813d51d94167785a4b135e03a306","score":"0.6409786","text":"function unitFactory(name, valueStr, unitStr) {\n var dependencies = ['config', 'Unit', 'BigNumber'];\n return Object(_utils_factory__WEBPACK_IMPORTED_MODULE_0__[\"factory\"])(name, dependencies, function (_ref) {\n var config = _ref.config,\n Unit = _ref.Unit,\n BigNumber = _ref.BigNumber;\n // Note that we can parse into number or BigNumber.\n // We do not parse into Fractions as that doesn't make sense: we would lose precision of the values\n // Therefore we dont use Unit.parse()\n var value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);\n var unit = new Unit(value, unitStr);\n unit.fixPrefix = true;\n return unit;\n });\n} // helper function to create a factory function which creates a numeric constant,","title":""},{"docid":"a5693c0e3ba7e7ed13b88adbb0a206af","score":"0.6293313","text":"prefixed(prop, prefix) {\n return prefix + prop\n }","title":""},{"docid":"202f8e5670cf02648750572cdb6b8057","score":"0.6210306","text":"function fixUnitAbbreviations(unit) {\n if (unit) {\n return unit.replace('uL', 'microL')\n .replace('µ', 'micro')\n .replace('DegC', 'Deg C');\n }\n return undefined;\n}","title":""},{"docid":"b7ce91e35b098414abffb87f1562497f","score":"0.6141734","text":"function genID(prefix) {\n return prefix + '$' + (num++);\n}","title":""},{"docid":"6c96d50fa014d98a3a18ec8e4c984f36","score":"0.61061794","text":"function setPrefix( name, prefix){\n return (''+ prefix=== prefix)?( prefix? prefix+ name.charAt().toUpperCase()+ name.substr( 1): name) : undefined /* aka prefix */ ;\n}","title":""},{"docid":"0dda8e4b7b36e627789552e136c9d12d","score":"0.6055573","text":"function setUpCustomUnits() {\n for (var i = 0 ; i < Converter.customUnits.length ; i++) {\n math.createUnit(\n Converter.customUnits[i].name,\n Converter.customUnits[i].factor\n )\n };\n}","title":""},{"docid":"59660afce6d2ff2cb482c29a6697b7db","score":"0.60193264","text":"function getUnitSymbol(prefixAndUnit) {\n let PrefixSymbol = getPrefixSymbol(prefixAndUnit);\n if (prefixAndUnit) {\n return prefixAndUnit.replace(PrefixSymbol, '');\n }\n return null;\n}","title":""},{"docid":"d2150102ce296a7b5fff3aafbd28a321","score":"0.60087466","text":"static formatUnit(unit) {\n return unit === 1 ? 'Lbs' : 'Kg';\n }","title":""},{"docid":"5ed2bbf4a496ed20de1591be13f66b98","score":"0.59662217","text":"function replaceUnit(exp) {\n switch (exp) {\n case 'minute':\n case 'min':\n case 'hour':\n case 'h':\n case 'day':\n case 'd':\n return \"s\";\n case 'degree':\n case '°':\n case \"'\":\n case 'second':\n case '\"':\n return \"rad\";\n case 'hectare':\n case 'ha':\n return \"m\" + \"2\".sup();\n case 'litre':\n case 'l':\n return \"m\" + \"3\".sup();\n case 'tonne':\n case 't':\n return \"kg\";\n default:\n return exp;\n }\n}","title":""},{"docid":"2a0198eb07ab8cae7e7485e010ac29b8","score":"0.5956518","text":"uniqueName(prefix) { return `${prefix}${this.nextNameIndex++}`; }","title":""},{"docid":"d8d72f1ab2fe9dcf9f50ce78c84d507a","score":"0.5935587","text":"function withPrefix(prefix) {\n if (typeValidation(prefix))\n return function (name) {\n if (typeValidation(name)) return `${prefix}${name}`;\n };\n}","title":""},{"docid":"db93b5b9e0ff1d720d450f74a45fdc70","score":"0.59129876","text":"function unit(i, units) {\r\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\r\n return i;\r\n } else {\r\n return \"\" + i + units;\r\n }\r\n }","title":""},{"docid":"db93b5b9e0ff1d720d450f74a45fdc70","score":"0.59129876","text":"function unit(i, units) {\r\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\r\n return i;\r\n } else {\r\n return \"\" + i + units;\r\n }\r\n }","title":""},{"docid":"db93b5b9e0ff1d720d450f74a45fdc70","score":"0.59129876","text":"function unit(i, units) {\r\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\r\n return i;\r\n } else {\r\n return \"\" + i + units;\r\n }\r\n }","title":""},{"docid":"e1d6f0a6f3709481f1ef55106c9bf910","score":"0.59116423","text":"function addPrefix(prefix) {\n return function(str) {\n let prefixedStr = `prefix is : ${prefix} and string is ${str}`;\n return prefixedStr;\n };\n}","title":""},{"docid":"ff4c7103f6b4ced44b3eccaac0e671b0","score":"0.5901048","text":"constructor(prefix = '') {\n this.prefix = prefix;\n }","title":""},{"docid":"4c6ede79165b1d7f45f786a30f024ab1","score":"0.5895227","text":"function getPrefixSymbol(prefixAndUnit) {\n // let myRegexp = /^[KkMm]+/g;\n let myRegexp = new RegExp('[' + PREFIX_REGEX_SYMBOLS.join() + ']', 'g');\n let match = myRegexp.exec(prefixAndUnit);\n if (match && match[0]) {\n return match[0];\n }\n return null;\n}","title":""},{"docid":"eaa1098337facd3705676939cf390824","score":"0.58795464","text":"function unit(i, units) {\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\n return i;\n } else {\n return \"\" + i + units;\n }\n }","title":""},{"docid":"eaa1098337facd3705676939cf390824","score":"0.58795464","text":"function unit(i, units) {\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\n return i;\n } else {\n return \"\" + i + units;\n }\n }","title":""},{"docid":"eaa1098337facd3705676939cf390824","score":"0.58795464","text":"function unit(i, units) {\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\n return i;\n } else {\n return \"\" + i + units;\n }\n }","title":""},{"docid":"eaa1098337facd3705676939cf390824","score":"0.58795464","text":"function unit(i, units) {\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\n return i;\n } else {\n return \"\" + i + units;\n }\n }","title":""},{"docid":"eaa1098337facd3705676939cf390824","score":"0.58795464","text":"function unit(i, units) {\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\n return i;\n } else {\n return \"\" + i + units;\n }\n }","title":""},{"docid":"eaa1098337facd3705676939cf390824","score":"0.58795464","text":"function unit(i, units) {\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\n return i;\n } else {\n return \"\" + i + units;\n }\n }","title":""},{"docid":"eaa1098337facd3705676939cf390824","score":"0.58795464","text":"function unit(i, units) {\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\n return i;\n } else {\n return \"\" + i + units;\n }\n }","title":""},{"docid":"eaa1098337facd3705676939cf390824","score":"0.58795464","text":"function unit(i, units) {\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\n return i;\n } else {\n return \"\" + i + units;\n }\n }","title":""},{"docid":"eaa1098337facd3705676939cf390824","score":"0.58795464","text":"function unit(i, units) {\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\n return i;\n } else {\n return \"\" + i + units;\n }\n }","title":""},{"docid":"eaa1098337facd3705676939cf390824","score":"0.58795464","text":"function unit(i, units) {\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\n return i;\n } else {\n return \"\" + i + units;\n }\n }","title":""},{"docid":"eaa1098337facd3705676939cf390824","score":"0.58795464","text":"function unit(i, units) {\n if ((typeof i === \"string\") && (!i.match(/^[\\-0-9\\.]+$/))) {\n return i;\n } else {\n return \"\" + i + units;\n }\n }","title":""},{"docid":"65e9b3d9b4177f922a48e63d4acfa23e","score":"0.58723056","text":"declarePrefix(string, string) {\n\n }","title":""},{"docid":"3e09efbc43be6ac6075ce1dfe142c948","score":"0.58709866","text":"function getUnit(input){\nreturn String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1]||'';\n}// Emulate the sass function \"unitless\"","title":""},{"docid":"9f385dc02b1f4f11480edd9817abe733","score":"0.5867532","text":"prefixed(prop, prefix) {\n if (prop.includes('-start')) {\n return prefix + prop.replace('-block-start', '-before')\n }\n return prefix + prop.replace('-block-end', '-after')\n }","title":""},{"docid":"d531f46e8b437071b8811aaffa98224c","score":"0.58307374","text":"static getUnitName ( abbr ) {\n if ( typeof abbr !== \"string\" ) {\n throw new Error( \"ByteCalc.getUnitName only accepts strings: use an \"\n + \"abbreviation like 'KB', or 'KiB'\"\n );\n } else {\n let names;\n let type = this.determineFormat( abbr );\n\n if ( type === \"IEC\" ) {\n names = IEC_PREFIX;\n } else if ( type === \"METRIC\" ) {\n names = METRIC_PREFIX;\n }\n\n return names[ UNITS.indexOf( abbr[0] ) ] + \"bytes\";\n }\n }","title":""},{"docid":"a193098a5e7218c9d67cdf3c448ef261","score":"0.58252144","text":"prefixed(prop, prefix) {\n return `${prefix}column-${prop}`\n }","title":""},{"docid":"3840ad434ead69d019347d1c03ce7ec6","score":"0.5808773","text":"function UnitName(name){\n switch(name){\n\n ///-----------Metric-----------\n // Lenght\n case \"cm\":\n return \"Centimeter\";\n\n case \"m\":\n return \"Meter\";\n\n case \"km\":\n return \"Kilometer\";\n // Mass\n case \"g\":\n return \"Grams\";\n\n case \"mg\":\n return \"Milligram\";\n\n case \"kg\":\n return \"Kilogram\";\n\n // Volume\n case \"l\":\n return \"Liter\";\n\n case \"ml\":\n return \"Milliliter\";\n\n // Temperature\n case \"c\":\n return \"Celsius\";\n\n case \"k\":\n return \"Kelvin\";\n\n ///-----------Imperial-----------\n // Lenght\n case \"\\'\\\"\":\n case \"in\":\n return \"Inch\";\n\n case \"ft\":\n return \"Foot\";\n\n case \"ya\":\n return \"Yard\";\n \n case \"mi\":\n return \"Mile\"\n // Mass\n case \"oz\":\n return \"Ounce\";\n\n case \"lb\":\n return \"Pound\";\n\n case \"st\":\n return \"Stone\";\n\n // Volume\n case \"floz\":\n return \"Fluid Ounce\";\n\n case \"lg\":\n return \"Liquid Gallon\";\n\n // Temperature\n case \"f\":\n return \"Fahrenheit\";\n\n ///-----------Time-----------\n case \"ms\":\n return \"Millisecond\";\n\n case \"s\":\n return \"Second\";\n\n case \"mn\":\n return \"Minute\";\n\n case \"h\":\n return \"Hour\";\n\n case \"d\":\n return \"Day\";\n\n case \"w\":\n return \"Week\";\n\n case \"mo\":\n return \"Month\";\n\n case \"y\":\n return \"Year\";\n }\n}","title":""},{"docid":"b052d3886633558a641c7ea85cb265dc","score":"0.5795017","text":"newVar (prefix) {\n prefix = prefix || this.newVarPrefix;\n return prefix + (this.maxVarSuffix (prefix) + 1);\n }","title":""},{"docid":"f51b0df60d8aa88a26d5d668726c5785","score":"0.5788379","text":"prefixed(prop, prefix) {\n let spec\n ;[spec, prefix] = flexSpec(prefix)\n if (spec === 2009) {\n return prefix + 'box-pack'\n }\n if (spec === 2012) {\n return prefix + 'flex-pack'\n }\n return super.prefixed(prop, prefix)\n }","title":""},{"docid":"a6956422b84a6630e89d04878d0ddfe2","score":"0.57780087","text":"function setUnit(unit, input) {\n CUSTOM_LENGTH.from(unit, input);\n return {\n toFeet: CUSTOM_LENGTH.to(FEET),\n toMeters: CUSTOM_LENGTH.to(METERS),\n toInches: CUSTOM_LENGTH.to(INCHES)\n };\n }","title":""},{"docid":"7b2c40863b9539c59d1e163d1a588ac7","score":"0.5761289","text":"prefixed(prop, prefix) {\n let spec\n ;[spec, prefix] = flexSpec(prefix);\n if (spec === 2009) {\n return prefix + 'box-flex'\n }\n if (spec === 2012) {\n return prefix + 'flex-positive'\n }\n return super.prefixed(prop, prefix)\n }","title":""},{"docid":"bbc71cf10af6e25e81b6f045b885006f","score":"0.5759265","text":"function ensureUnit(val) {\n return val + (Object(__WEBPACK_IMPORTED_MODULE_0_min_dash__[\"l\" /* isNumber */])(val) ? 'px' : '');\n}","title":""},{"docid":"bce3ebb78c81428e0b25cfd52680a9ab","score":"0.57541776","text":"function prefix(prefix){\n return ($(prefix).length) ? (prefix + ' ') : '';\n}","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"c29775a2c93c79e9c3fb5e08156d49b4","score":"0.5747197","text":"function getUnit(input) {\n return String(input).match(/[\\d.\\-+]*\\s*(.*)/)[1] || '';\n} // Emulate the sass function \"unitless\"","title":""},{"docid":"2df229f86eacbcaf345194952f47635d","score":"0.5747057","text":"function makeName(prefix){\n var name = prefix + Math.random() * 1000;\n while(getElementById(name) != null)\n name = prefix + Math.random() * 1000;\n return name;\n}","title":""},{"docid":"5212d88140a2e2c402bb41cf45aadb88","score":"0.5742971","text":"set prefix(value) { this._prefix = value; }","title":""},{"docid":"7e1edc08b4e15c4e2f6afeab7e9927e4","score":"0.57421446","text":"prefixed(prop, prefix) {\n let spec\n ;[spec, prefix] = flexSpec(prefix);\n if (spec === 2009) {\n return prefix + 'box-ordinal-group'\n }\n if (spec === 2012) {\n return prefix + 'flex-order'\n }\n return super.prefixed(prop, prefix)\n }","title":""},{"docid":"1632f15ecfd441eb030abde68d3a1615","score":"0.5724241","text":"prefix(newPrefix) {\n const self = this;\n self._prefix = newPrefix;\n return self;\n }","title":""},{"docid":"6470ebaa4f89666397e514cd0e751af6","score":"0.57118493","text":"prefixed(prop, prefix) {\n let spec\n ;[spec, prefix] = flexSpec(prefix);\n if (spec === 2009) {\n return prefix + 'box-pack'\n }\n if (spec === 2012) {\n return prefix + 'flex-pack'\n }\n return super.prefixed(prop, prefix)\n }","title":""},{"docid":"627aa2df9f626cc5c4b97df6db84a00f","score":"0.56968635","text":"function prefixItem (prefix) {\n return function (item) {\n return (item.indexOf(prefix) == -1 ? prefix + ' ' : '') + item;\n };\n}","title":""},{"docid":"2be539611c113374101dd1b2cb25403c","score":"0.56673545","text":"function tw(units) {\n\treturn `${units * 4 / 16}rem`\n}","title":""},{"docid":"64fbb13f35587ecc722a20c719b65c71","score":"0.56656784","text":"function prefixZero(num) {\n num = num || 0;\n if (String(num).length >= 2) {\n return num;\n } else {\n return '0' + String(num);\n }\n }","title":""},{"docid":"06d202adecaa6f5c8b450ef46cad61d9","score":"0.5645715","text":"function make_card_id(id, prefix) {\n\t\tif (typeof prefix == \"undefined\") {\n\t\t\tprefix = \"card_\";\n\t\t}\n\t\treturn prefix + id;\n\t}","title":""},{"docid":"145c660169f9ba899fdec760d83a6c67","score":"0.5633756","text":"prefixed(prop, prefix) {\n return prefix + prop.replace('-inline', '')\n }","title":""},{"docid":"efa259aa4f02316fcb0762b466bf98ba","score":"0.5597308","text":"function zeroPrefixer(val) {\n return (val < 10 ? '0' : '') + val;\n}","title":""},{"docid":"a489da61c49109e86aadc043305005d0","score":"0.5590228","text":"function unit(value) {\n return [value];\n}","title":""},{"docid":"a107f99b53db2390d82caa25541c6a51","score":"0.5585285","text":"generateTag(prefix = \"\", name = \"\") {\n try {\n prefix = prefix.trim()\n name = name.toString().trim()\n\n // Lightning wants the first letter to always be capitalized\n prefix = prefix.charAt(0).toUpperCase() + prefix.slice(1)\n return `${prefix}${name}`\n } catch (e) {\n Log.error(e)\n }\n }","title":""},{"docid":"414876baf6b171cea227489f37bc3a93","score":"0.55816567","text":"function makeUnitVal(v) {\n if (typeof v == \"string\")\n return UnitValue(stripUnits(v), v.replace(/[0-9.-]+/g, \"\"));\n if (typeof v == \"number\")\n return UnitValue(v, DOMunitToCSS[app.preferences.rulerUnits]);\n}","title":""},{"docid":"108571ce6d7b98837ab7c55f0906a296","score":"0.55793804","text":"function create_prefix_Rules (pNONTERM) {\n\tvar vPrefix = pNONTERM.split(/_/)[0];\n\t//alert(\"vPrefix=\"+vPrefix+\"\\nrules.js:697\");\n\treturn vPrefix;\n}","title":""},{"docid":"fc9239267fd48d719fcfc7eaa0ec8fdb","score":"0.55787975","text":"prefixed(prop, prefix) {\n let spec\n ;[spec, prefix] = flexSpec(prefix);\n if (spec === 2009) {\n return prefix + 'box-flex'\n }\n return super.prefixed(prop, prefix)\n }","title":""},{"docid":"ce1a9a8fd25e6b311e9791e5f97d4fc6","score":"0.55674946","text":"prefixed(prop, prefix) {\n prop = vendor.unprefixed(prop);\n return this.decl(prop).prefixed(prop, prefix)\n }","title":""},{"docid":"8da301cf1e8af78896a35042e0080627","score":"0.55655193","text":"function prefixNumber(num, places) {\n if (num < 0) return \"-\" + prefixNumber(-num, places);\n\n var pos = Math.floor(Math.log(num) / Math.log(1000));\n if (pos < 0) pos = 0;\n var num = num / Math.pow(1000, pos);\n \n var pre = prefixes[pos];\n if (pre === undefined) pre = \"???\";\n\n num = round(num, places);\n\n return num + pre;\n}","title":""},{"docid":"9802bdebeaa6b2ee4269ffd7216b5598","score":"0.5561531","text":"function uniqueId(prefix) {\n const id = ++idCounter;\n return prefix ? String(prefix) + id : id;\n }","title":""},{"docid":"ced07f9c2e7ae1154fea0a53bbb2dd14","score":"0.55548173","text":"function makeFOTSUdl(unit) {\r\n var udl = `${unit.info.name},${unit.state.stats.beam},${unit.state.stats.shield}`;\r\n return udl;\r\n }","title":""},{"docid":"1cccedcdb2350b8ea0cc1250a7daa416","score":"0.5549877","text":"function makeUnitVal(v) {\n if (typeof v == 'string')\n return UnitValue(stripUnits(v), v.replace(/[0-9.-]+/g, ''));\n if (typeof v == 'number')\n return UnitValue(v, DOMunitToCSS[app.preferences.rulerUnits]);\n}","title":""},{"docid":"32ddbfd8acf002b4595779ec4a4d1cdc","score":"0.554817","text":"function addPrefixToPropertyName(name, prefix) {\n\t\tif (!prefix) {\n\t\t\treturn name;\n\t\t}\n\n\t\tvar parts = name.split(\".\");\n\t\tvar result = \"\";\n\t\tfor (var i = 0; i < parts.length - 1; i++) {\n\t\t\tresult += parts[i] + \".\";\n\t\t}\n\t\tvar lastPart = parts[parts.length - 1];\n\t\tif (prefixRequiresNextInitialCap(prefix)) {\n\t\t\tresult += prefix + lastPart.substring(0, 1).toUpperCase() + lastPart.substring(1);\n\t\t} else {\n\t\t\tresult += prefix + lastPart;\n\t\t}\n\t\treturn result;\n\t}","title":""},{"docid":"77b549048f9379340d570a42ee866363","score":"0.55381113","text":"function ensureUnit(val) {\n return val + (isNumber(val) ? 'px' : '');\n}","title":""},{"docid":"77b549048f9379340d570a42ee866363","score":"0.55381113","text":"function ensureUnit(val) {\n return val + (isNumber(val) ? 'px' : '');\n}","title":""},{"docid":"77b549048f9379340d570a42ee866363","score":"0.55381113","text":"function ensureUnit(val) {\n return val + (isNumber(val) ? 'px' : '');\n}","title":""},{"docid":"77b549048f9379340d570a42ee866363","score":"0.55381113","text":"function ensureUnit(val) {\n return val + (isNumber(val) ? 'px' : '');\n}","title":""},{"docid":"77b549048f9379340d570a42ee866363","score":"0.55381113","text":"function ensureUnit(val) {\n return val + (isNumber(val) ? 'px' : '');\n}","title":""},{"docid":"ca79c4adff1a915939e6872c8dd7ba11","score":"0.55305034","text":"prefixName(prefix, name) {\n if (prefix === '-moz-') {\n return name + '--moz-device-pixel-ratio'\n } else {\n return prefix + name + '-device-pixel-ratio'\n }\n }","title":""},{"docid":"549dc8adc64d977218a4df6f2512765c","score":"0.55272096","text":"function uniqueId(prefix) {\n var id = ++idCounter;\n return prefix ? String(prefix) + id : id;\n}","title":""},{"docid":"6bf33929f6875905af652bfff0cab6d7","score":"0.55266196","text":"normalizeUnit(str, full) {\n let num = parseFloat(str);\n let deg = (num / full) * 360;\n return `${deg}deg`\n }","title":""},{"docid":"5f2843868d7995ea10cb8543f4174d16","score":"0.55231136","text":"function prefix(symbol) {\n\t\t\t\tif (typeof arguments[1] === 'number') {\n\t\t\t\t\tvar parselet = new self.nodes.parselets.Prefix(arguments[1]);\n\t\t\t\t} else {\n\t\t\t\t\tvar parselet = arguments[1];\n\t\t\t\t}\n\n\t\t\t\tself.register('prefix', symbol, parselet);\n\t\t\t}","title":""},{"docid":"93fb335a8b4734935f61bd2602604621","score":"0.5515397","text":"function uniqueId(prefix) {\n const id = ++idCounter;\n return prefix ? String(prefix) + id : id;\n}","title":""},{"docid":"05714a7d03bf1dd9dfaa6eb0a4266368","score":"0.55122715","text":"function replaceUnit( u ) {\n if( u.includes( 'yavaa:' ) ) {\n u = u.replace( 'yavaa:', '' )\n return UnitStore.getUnit( `http://yavaa.org/ns/units/${u}` );\n } else {\n return UnitStore.getUnit( `http://www.wurvoc.org/vocabularies/om-1.8/${u}` );\n }\n }","title":""},{"docid":"bc4cd90561bbc0f0a2106b9f4cec8349","score":"0.5504761","text":"prefixed(prop, prefix) {\n let spec\n ;[spec, prefix] = flexSpec(prefix);\n if (spec === 2009) {\n return prefix + 'box-align'\n }\n if (spec === 2012) {\n return prefix + 'flex-align'\n }\n return super.prefixed(prop, prefix)\n }","title":""},{"docid":"801e50aeec1b790c9b183a8cb4df9084","score":"0.5499754","text":"function getFormatedUnits (arg) {\n var lowered = arg.toLowerCase();\n\n if (lowered.indexOf('fl.oz.') != -1) { return 'Ounce'; }\n if (lowered.indexOf('fl oz') != -1) { return 'Ounce'; }\n if (lowered.indexOf('gallon') != -1) { return 'Gallon'; }\n if (lowered.indexOf('pound') != -1) { return 'Pound'; }\n if (lowered.indexOf('ounce') != -1) { return 'Ounce'; }\n if (lowered.indexOf('oz') != -1) { return 'Ounce'; }\n if (lowered.indexOf('oz.') != -1) { return 'Ounce'; }\n if (lowered.indexOf('ml') != -1) { return 'ml'; }\n if (lowered.indexOf('g') != -1) { return 'Gram'; }\n if (lowered.indexOf('gram') != -1) { return 'Gram'; }\n if (lowered.indexOf('pack') != -1) { return 'Pack'; }\n if (lowered.indexOf('dram') != -1) { return 'Dram'; }\n if (lowered.indexOf('count') != -1) { return 'Item'; }\n\n return arg;\n}","title":""},{"docid":"07800644dee78919641ce1047656ce86","score":"0.5469789","text":"function getUid(prefix) {\n if (prefix === void 0) { prefix = ''; }\n if (!(prefix in _uidPrefixes)) {\n _uidPrefixes[prefix] = 0;\n }\n _uidPrefixes[prefix] += 1;\n return prefix + _uidPrefixes[prefix].toString();\n}","title":""},{"docid":"f2154f010697c6412983cb0e44565380","score":"0.5468996","text":"function registerUnit(unit) {\n lookupTbl.set(unit.toString(), unit);\n}","title":""},{"docid":"5aaeb93ee65ae10d6a65dadf616ef66d","score":"0.5468006","text":"function getNextUnit(unit) {\n switch (unit) {\n case \"year\":\n return;\n case \"month\":\n return \"year\";\n case \"week\":\n return \"month\";\n case \"day\":\n return \"month\"; // not a mistake\n case \"hour\":\n return \"day\";\n case \"minute\":\n return \"hour\";\n case \"second\":\n return \"minute\";\n case \"millisecond\":\n return \"second\";\n }\n}","title":""},{"docid":"8b2ff502851d9493dcbf15cc7e54c6c8","score":"0.5468","text":"static ustring(indent, msg, prefix='', suffix='') {\n return \" \".repeat(indent) + prefix + msg + suffix;\n }","title":""}],"string":"[\n {\n \"docid\": \"b6f119e67f2be1106ee3c2f436f3bcfb\",\n \"score\": \"0.71431434\",\n \"text\": \"function fixedUnit(str) {\\n var unit = type.Unit.parse(str);\\n unit.fixPrefix = true;\\n return unit;\\n } // Source: https://en.wikipedia.org/wiki/Physical_constant\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fc677d72cd84bb35704a5474845716e\",\n \"score\": \"0.69279677\",\n \"text\": \"function fixedUnit(str) {\\n\\t\\t\\tvar unit = type.Unit.parse(str);\\n\\t\\t\\tunit.fixPrefix = true;\\n\\t\\t\\treturn unit;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c508458a8828d56f4410696247e03953\",\n \"score\": \"0.6602577\",\n \"text\": \"function unitFactory(name, valueStr, unitStr) {\\n var dependencies = ['config', 'Unit', 'BigNumber'];\\n return factory_factory(name, dependencies, (_ref) => {\\n var {\\n config,\\n Unit,\\n BigNumber\\n } = _ref;\\n // Note that we can parse into number or BigNumber.\\n // We do not parse into Fractions as that doesn't make sense: we would lose precision of the values\\n // Therefore we dont use Unit.parse()\\n var value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);\\n var unit = new Unit(value, unitStr);\\n unit.fixPrefix = true;\\n return unit;\\n });\\n} // helper function to create a factory function which creates a numeric constant,\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b196519b323ecf4c591309afa50fc039\",\n \"score\": \"0.6602374\",\n \"text\": \"function withUnit (unit, count) {\\n return `${count} ${pluralize(unit, count)}`;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"868b72faa442b7ca8825ed7814908a62\",\n \"score\": \"0.6439161\",\n \"text\": \"prefixed(prefix) {\\n return this.name.replace(/^(\\\\W*)/, `$1${prefix}`)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b290519612c98c6eb68a742339604ec\",\n \"score\": \"0.6417857\",\n \"text\": \"prefixed(prefix) {\\n let spec, value\\n ;[spec, prefix] = flexSpec(prefix);\\n\\n if (spec === 2009) {\\n if (this.name === 'flex') {\\n value = 'box';\\n } else {\\n value = 'inline-box';\\n }\\n } else if (spec === 2012) {\\n if (this.name === 'flex') {\\n value = 'flexbox';\\n } else {\\n value = 'inline-flexbox';\\n }\\n } else if (spec === 'final') {\\n value = this.name;\\n }\\n\\n return prefix + value\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9261813d51d94167785a4b135e03a306\",\n \"score\": \"0.6409786\",\n \"text\": \"function unitFactory(name, valueStr, unitStr) {\\n var dependencies = ['config', 'Unit', 'BigNumber'];\\n return Object(_utils_factory__WEBPACK_IMPORTED_MODULE_0__[\\\"factory\\\"])(name, dependencies, function (_ref) {\\n var config = _ref.config,\\n Unit = _ref.Unit,\\n BigNumber = _ref.BigNumber;\\n // Note that we can parse into number or BigNumber.\\n // We do not parse into Fractions as that doesn't make sense: we would lose precision of the values\\n // Therefore we dont use Unit.parse()\\n var value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);\\n var unit = new Unit(value, unitStr);\\n unit.fixPrefix = true;\\n return unit;\\n });\\n} // helper function to create a factory function which creates a numeric constant,\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5693c0e3ba7e7ed13b88adbb0a206af\",\n \"score\": \"0.6293313\",\n \"text\": \"prefixed(prop, prefix) {\\n return prefix + prop\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"202f8e5670cf02648750572cdb6b8057\",\n \"score\": \"0.6210306\",\n \"text\": \"function fixUnitAbbreviations(unit) {\\n if (unit) {\\n return unit.replace('uL', 'microL')\\n .replace('µ', 'micro')\\n .replace('DegC', 'Deg C');\\n }\\n return undefined;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7ce91e35b098414abffb87f1562497f\",\n \"score\": \"0.6141734\",\n \"text\": \"function genID(prefix) {\\n return prefix + '$' + (num++);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c96d50fa014d98a3a18ec8e4c984f36\",\n \"score\": \"0.61061794\",\n \"text\": \"function setPrefix( name, prefix){\\n return (''+ prefix=== prefix)?( prefix? prefix+ name.charAt().toUpperCase()+ name.substr( 1): name) : undefined /* aka prefix */ ;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0dda8e4b7b36e627789552e136c9d12d\",\n \"score\": \"0.6055573\",\n \"text\": \"function setUpCustomUnits() {\\n for (var i = 0 ; i < Converter.customUnits.length ; i++) {\\n math.createUnit(\\n Converter.customUnits[i].name,\\n Converter.customUnits[i].factor\\n )\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59660afce6d2ff2cb482c29a6697b7db\",\n \"score\": \"0.60193264\",\n \"text\": \"function getUnitSymbol(prefixAndUnit) {\\n let PrefixSymbol = getPrefixSymbol(prefixAndUnit);\\n if (prefixAndUnit) {\\n return prefixAndUnit.replace(PrefixSymbol, '');\\n }\\n return null;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2150102ce296a7b5fff3aafbd28a321\",\n \"score\": \"0.60087466\",\n \"text\": \"static formatUnit(unit) {\\n return unit === 1 ? 'Lbs' : 'Kg';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ed2bbf4a496ed20de1591be13f66b98\",\n \"score\": \"0.59662217\",\n \"text\": \"function replaceUnit(exp) {\\n switch (exp) {\\n case 'minute':\\n case 'min':\\n case 'hour':\\n case 'h':\\n case 'day':\\n case 'd':\\n return \\\"s\\\";\\n case 'degree':\\n case '°':\\n case \\\"'\\\":\\n case 'second':\\n case '\\\"':\\n return \\\"rad\\\";\\n case 'hectare':\\n case 'ha':\\n return \\\"m\\\" + \\\"2\\\".sup();\\n case 'litre':\\n case 'l':\\n return \\\"m\\\" + \\\"3\\\".sup();\\n case 'tonne':\\n case 't':\\n return \\\"kg\\\";\\n default:\\n return exp;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a0198eb07ab8cae7e7485e010ac29b8\",\n \"score\": \"0.5956518\",\n \"text\": \"uniqueName(prefix) { return `${prefix}${this.nextNameIndex++}`; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8d72f1ab2fe9dcf9f50ce78c84d507a\",\n \"score\": \"0.5935587\",\n \"text\": \"function withPrefix(prefix) {\\n if (typeValidation(prefix))\\n return function (name) {\\n if (typeValidation(name)) return `${prefix}${name}`;\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db93b5b9e0ff1d720d450f74a45fdc70\",\n \"score\": \"0.59129876\",\n \"text\": \"function unit(i, units) {\\r\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\r\\n return i;\\r\\n } else {\\r\\n return \\\"\\\" + i + units;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db93b5b9e0ff1d720d450f74a45fdc70\",\n \"score\": \"0.59129876\",\n \"text\": \"function unit(i, units) {\\r\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\r\\n return i;\\r\\n } else {\\r\\n return \\\"\\\" + i + units;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db93b5b9e0ff1d720d450f74a45fdc70\",\n \"score\": \"0.59129876\",\n \"text\": \"function unit(i, units) {\\r\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\r\\n return i;\\r\\n } else {\\r\\n return \\\"\\\" + i + units;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1d6f0a6f3709481f1ef55106c9bf910\",\n \"score\": \"0.59116423\",\n \"text\": \"function addPrefix(prefix) {\\n return function(str) {\\n let prefixedStr = `prefix is : ${prefix} and string is ${str}`;\\n return prefixedStr;\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff4c7103f6b4ced44b3eccaac0e671b0\",\n \"score\": \"0.5901048\",\n \"text\": \"constructor(prefix = '') {\\n this.prefix = prefix;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c6ede79165b1d7f45f786a30f024ab1\",\n \"score\": \"0.5895227\",\n \"text\": \"function getPrefixSymbol(prefixAndUnit) {\\n // let myRegexp = /^[KkMm]+/g;\\n let myRegexp = new RegExp('[' + PREFIX_REGEX_SYMBOLS.join() + ']', 'g');\\n let match = myRegexp.exec(prefixAndUnit);\\n if (match && match[0]) {\\n return match[0];\\n }\\n return null;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1098337facd3705676939cf390824\",\n \"score\": \"0.58795464\",\n \"text\": \"function unit(i, units) {\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\n return i;\\n } else {\\n return \\\"\\\" + i + units;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1098337facd3705676939cf390824\",\n \"score\": \"0.58795464\",\n \"text\": \"function unit(i, units) {\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\n return i;\\n } else {\\n return \\\"\\\" + i + units;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1098337facd3705676939cf390824\",\n \"score\": \"0.58795464\",\n \"text\": \"function unit(i, units) {\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\n return i;\\n } else {\\n return \\\"\\\" + i + units;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1098337facd3705676939cf390824\",\n \"score\": \"0.58795464\",\n \"text\": \"function unit(i, units) {\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\n return i;\\n } else {\\n return \\\"\\\" + i + units;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1098337facd3705676939cf390824\",\n \"score\": \"0.58795464\",\n \"text\": \"function unit(i, units) {\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\n return i;\\n } else {\\n return \\\"\\\" + i + units;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1098337facd3705676939cf390824\",\n \"score\": \"0.58795464\",\n \"text\": \"function unit(i, units) {\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\n return i;\\n } else {\\n return \\\"\\\" + i + units;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1098337facd3705676939cf390824\",\n \"score\": \"0.58795464\",\n \"text\": \"function unit(i, units) {\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\n return i;\\n } else {\\n return \\\"\\\" + i + units;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1098337facd3705676939cf390824\",\n \"score\": \"0.58795464\",\n \"text\": \"function unit(i, units) {\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\n return i;\\n } else {\\n return \\\"\\\" + i + units;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1098337facd3705676939cf390824\",\n \"score\": \"0.58795464\",\n \"text\": \"function unit(i, units) {\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\n return i;\\n } else {\\n return \\\"\\\" + i + units;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1098337facd3705676939cf390824\",\n \"score\": \"0.58795464\",\n \"text\": \"function unit(i, units) {\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\n return i;\\n } else {\\n return \\\"\\\" + i + units;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1098337facd3705676939cf390824\",\n \"score\": \"0.58795464\",\n \"text\": \"function unit(i, units) {\\n if ((typeof i === \\\"string\\\") && (!i.match(/^[\\\\-0-9\\\\.]+$/))) {\\n return i;\\n } else {\\n return \\\"\\\" + i + units;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65e9b3d9b4177f922a48e63d4acfa23e\",\n \"score\": \"0.58723056\",\n \"text\": \"declarePrefix(string, string) {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e09efbc43be6ac6075ce1dfe142c948\",\n \"score\": \"0.58709866\",\n \"text\": \"function getUnit(input){\\nreturn String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1]||'';\\n}// Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f385dc02b1f4f11480edd9817abe733\",\n \"score\": \"0.5867532\",\n \"text\": \"prefixed(prop, prefix) {\\n if (prop.includes('-start')) {\\n return prefix + prop.replace('-block-start', '-before')\\n }\\n return prefix + prop.replace('-block-end', '-after')\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d531f46e8b437071b8811aaffa98224c\",\n \"score\": \"0.58307374\",\n \"text\": \"static getUnitName ( abbr ) {\\n if ( typeof abbr !== \\\"string\\\" ) {\\n throw new Error( \\\"ByteCalc.getUnitName only accepts strings: use an \\\"\\n + \\\"abbreviation like 'KB', or 'KiB'\\\"\\n );\\n } else {\\n let names;\\n let type = this.determineFormat( abbr );\\n\\n if ( type === \\\"IEC\\\" ) {\\n names = IEC_PREFIX;\\n } else if ( type === \\\"METRIC\\\" ) {\\n names = METRIC_PREFIX;\\n }\\n\\n return names[ UNITS.indexOf( abbr[0] ) ] + \\\"bytes\\\";\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a193098a5e7218c9d67cdf3c448ef261\",\n \"score\": \"0.58252144\",\n \"text\": \"prefixed(prop, prefix) {\\n return `${prefix}column-${prop}`\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3840ad434ead69d019347d1c03ce7ec6\",\n \"score\": \"0.5808773\",\n \"text\": \"function UnitName(name){\\n switch(name){\\n\\n ///-----------Metric-----------\\n // Lenght\\n case \\\"cm\\\":\\n return \\\"Centimeter\\\";\\n\\n case \\\"m\\\":\\n return \\\"Meter\\\";\\n\\n case \\\"km\\\":\\n return \\\"Kilometer\\\";\\n // Mass\\n case \\\"g\\\":\\n return \\\"Grams\\\";\\n\\n case \\\"mg\\\":\\n return \\\"Milligram\\\";\\n\\n case \\\"kg\\\":\\n return \\\"Kilogram\\\";\\n\\n // Volume\\n case \\\"l\\\":\\n return \\\"Liter\\\";\\n\\n case \\\"ml\\\":\\n return \\\"Milliliter\\\";\\n\\n // Temperature\\n case \\\"c\\\":\\n return \\\"Celsius\\\";\\n\\n case \\\"k\\\":\\n return \\\"Kelvin\\\";\\n\\n ///-----------Imperial-----------\\n // Lenght\\n case \\\"\\\\'\\\\\\\"\\\":\\n case \\\"in\\\":\\n return \\\"Inch\\\";\\n\\n case \\\"ft\\\":\\n return \\\"Foot\\\";\\n\\n case \\\"ya\\\":\\n return \\\"Yard\\\";\\n \\n case \\\"mi\\\":\\n return \\\"Mile\\\"\\n // Mass\\n case \\\"oz\\\":\\n return \\\"Ounce\\\";\\n\\n case \\\"lb\\\":\\n return \\\"Pound\\\";\\n\\n case \\\"st\\\":\\n return \\\"Stone\\\";\\n\\n // Volume\\n case \\\"floz\\\":\\n return \\\"Fluid Ounce\\\";\\n\\n case \\\"lg\\\":\\n return \\\"Liquid Gallon\\\";\\n\\n // Temperature\\n case \\\"f\\\":\\n return \\\"Fahrenheit\\\";\\n\\n ///-----------Time-----------\\n case \\\"ms\\\":\\n return \\\"Millisecond\\\";\\n\\n case \\\"s\\\":\\n return \\\"Second\\\";\\n\\n case \\\"mn\\\":\\n return \\\"Minute\\\";\\n\\n case \\\"h\\\":\\n return \\\"Hour\\\";\\n\\n case \\\"d\\\":\\n return \\\"Day\\\";\\n\\n case \\\"w\\\":\\n return \\\"Week\\\";\\n\\n case \\\"mo\\\":\\n return \\\"Month\\\";\\n\\n case \\\"y\\\":\\n return \\\"Year\\\";\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b052d3886633558a641c7ea85cb265dc\",\n \"score\": \"0.5795017\",\n \"text\": \"newVar (prefix) {\\n prefix = prefix || this.newVarPrefix;\\n return prefix + (this.maxVarSuffix (prefix) + 1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f51b0df60d8aa88a26d5d668726c5785\",\n \"score\": \"0.5788379\",\n \"text\": \"prefixed(prop, prefix) {\\n let spec\\n ;[spec, prefix] = flexSpec(prefix)\\n if (spec === 2009) {\\n return prefix + 'box-pack'\\n }\\n if (spec === 2012) {\\n return prefix + 'flex-pack'\\n }\\n return super.prefixed(prop, prefix)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6956422b84a6630e89d04878d0ddfe2\",\n \"score\": \"0.57780087\",\n \"text\": \"function setUnit(unit, input) {\\n CUSTOM_LENGTH.from(unit, input);\\n return {\\n toFeet: CUSTOM_LENGTH.to(FEET),\\n toMeters: CUSTOM_LENGTH.to(METERS),\\n toInches: CUSTOM_LENGTH.to(INCHES)\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b2c40863b9539c59d1e163d1a588ac7\",\n \"score\": \"0.5761289\",\n \"text\": \"prefixed(prop, prefix) {\\n let spec\\n ;[spec, prefix] = flexSpec(prefix);\\n if (spec === 2009) {\\n return prefix + 'box-flex'\\n }\\n if (spec === 2012) {\\n return prefix + 'flex-positive'\\n }\\n return super.prefixed(prop, prefix)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bbc71cf10af6e25e81b6f045b885006f\",\n \"score\": \"0.5759265\",\n \"text\": \"function ensureUnit(val) {\\n return val + (Object(__WEBPACK_IMPORTED_MODULE_0_min_dash__[\\\"l\\\" /* isNumber */])(val) ? 'px' : '');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bce3ebb78c81428e0b25cfd52680a9ab\",\n \"score\": \"0.57541776\",\n \"text\": \"function prefix(prefix){\\n return ($(prefix).length) ? (prefix + ' ') : '';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c29775a2c93c79e9c3fb5e08156d49b4\",\n \"score\": \"0.5747197\",\n \"text\": \"function getUnit(input) {\\n return String(input).match(/[\\\\d.\\\\-+]*\\\\s*(.*)/)[1] || '';\\n} // Emulate the sass function \\\"unitless\\\"\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2df229f86eacbcaf345194952f47635d\",\n \"score\": \"0.5747057\",\n \"text\": \"function makeName(prefix){\\n var name = prefix + Math.random() * 1000;\\n while(getElementById(name) != null)\\n name = prefix + Math.random() * 1000;\\n return name;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5212d88140a2e2c402bb41cf45aadb88\",\n \"score\": \"0.5742971\",\n \"text\": \"set prefix(value) { this._prefix = value; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e1edc08b4e15c4e2f6afeab7e9927e4\",\n \"score\": \"0.57421446\",\n \"text\": \"prefixed(prop, prefix) {\\n let spec\\n ;[spec, prefix] = flexSpec(prefix);\\n if (spec === 2009) {\\n return prefix + 'box-ordinal-group'\\n }\\n if (spec === 2012) {\\n return prefix + 'flex-order'\\n }\\n return super.prefixed(prop, prefix)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1632f15ecfd441eb030abde68d3a1615\",\n \"score\": \"0.5724241\",\n \"text\": \"prefix(newPrefix) {\\n const self = this;\\n self._prefix = newPrefix;\\n return self;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6470ebaa4f89666397e514cd0e751af6\",\n \"score\": \"0.57118493\",\n \"text\": \"prefixed(prop, prefix) {\\n let spec\\n ;[spec, prefix] = flexSpec(prefix);\\n if (spec === 2009) {\\n return prefix + 'box-pack'\\n }\\n if (spec === 2012) {\\n return prefix + 'flex-pack'\\n }\\n return super.prefixed(prop, prefix)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"627aa2df9f626cc5c4b97df6db84a00f\",\n \"score\": \"0.56968635\",\n \"text\": \"function prefixItem (prefix) {\\n return function (item) {\\n return (item.indexOf(prefix) == -1 ? prefix + ' ' : '') + item;\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2be539611c113374101dd1b2cb25403c\",\n \"score\": \"0.56673545\",\n \"text\": \"function tw(units) {\\n\\treturn `${units * 4 / 16}rem`\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64fbb13f35587ecc722a20c719b65c71\",\n \"score\": \"0.56656784\",\n \"text\": \"function prefixZero(num) {\\n num = num || 0;\\n if (String(num).length >= 2) {\\n return num;\\n } else {\\n return '0' + String(num);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06d202adecaa6f5c8b450ef46cad61d9\",\n \"score\": \"0.5645715\",\n \"text\": \"function make_card_id(id, prefix) {\\n\\t\\tif (typeof prefix == \\\"undefined\\\") {\\n\\t\\t\\tprefix = \\\"card_\\\";\\n\\t\\t}\\n\\t\\treturn prefix + id;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"145c660169f9ba899fdec760d83a6c67\",\n \"score\": \"0.5633756\",\n \"text\": \"prefixed(prop, prefix) {\\n return prefix + prop.replace('-inline', '')\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efa259aa4f02316fcb0762b466bf98ba\",\n \"score\": \"0.5597308\",\n \"text\": \"function zeroPrefixer(val) {\\n return (val < 10 ? '0' : '') + val;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a489da61c49109e86aadc043305005d0\",\n \"score\": \"0.5590228\",\n \"text\": \"function unit(value) {\\n return [value];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a107f99b53db2390d82caa25541c6a51\",\n \"score\": \"0.5585285\",\n \"text\": \"generateTag(prefix = \\\"\\\", name = \\\"\\\") {\\n try {\\n prefix = prefix.trim()\\n name = name.toString().trim()\\n\\n // Lightning wants the first letter to always be capitalized\\n prefix = prefix.charAt(0).toUpperCase() + prefix.slice(1)\\n return `${prefix}${name}`\\n } catch (e) {\\n Log.error(e)\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"414876baf6b171cea227489f37bc3a93\",\n \"score\": \"0.55816567\",\n \"text\": \"function makeUnitVal(v) {\\n if (typeof v == \\\"string\\\")\\n return UnitValue(stripUnits(v), v.replace(/[0-9.-]+/g, \\\"\\\"));\\n if (typeof v == \\\"number\\\")\\n return UnitValue(v, DOMunitToCSS[app.preferences.rulerUnits]);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"108571ce6d7b98837ab7c55f0906a296\",\n \"score\": \"0.55793804\",\n \"text\": \"function create_prefix_Rules (pNONTERM) {\\n\\tvar vPrefix = pNONTERM.split(/_/)[0];\\n\\t//alert(\\\"vPrefix=\\\"+vPrefix+\\\"\\\\nrules.js:697\\\");\\n\\treturn vPrefix;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc9239267fd48d719fcfc7eaa0ec8fdb\",\n \"score\": \"0.55787975\",\n \"text\": \"prefixed(prop, prefix) {\\n let spec\\n ;[spec, prefix] = flexSpec(prefix);\\n if (spec === 2009) {\\n return prefix + 'box-flex'\\n }\\n return super.prefixed(prop, prefix)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce1a9a8fd25e6b311e9791e5f97d4fc6\",\n \"score\": \"0.55674946\",\n \"text\": \"prefixed(prop, prefix) {\\n prop = vendor.unprefixed(prop);\\n return this.decl(prop).prefixed(prop, prefix)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8da301cf1e8af78896a35042e0080627\",\n \"score\": \"0.55655193\",\n \"text\": \"function prefixNumber(num, places) {\\n if (num < 0) return \\\"-\\\" + prefixNumber(-num, places);\\n\\n var pos = Math.floor(Math.log(num) / Math.log(1000));\\n if (pos < 0) pos = 0;\\n var num = num / Math.pow(1000, pos);\\n \\n var pre = prefixes[pos];\\n if (pre === undefined) pre = \\\"???\\\";\\n\\n num = round(num, places);\\n\\n return num + pre;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9802bdebeaa6b2ee4269ffd7216b5598\",\n \"score\": \"0.5561531\",\n \"text\": \"function uniqueId(prefix) {\\n const id = ++idCounter;\\n return prefix ? String(prefix) + id : id;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ced07f9c2e7ae1154fea0a53bbb2dd14\",\n \"score\": \"0.55548173\",\n \"text\": \"function makeFOTSUdl(unit) {\\r\\n var udl = `${unit.info.name},${unit.state.stats.beam},${unit.state.stats.shield}`;\\r\\n return udl;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cccedcdb2350b8ea0cc1250a7daa416\",\n \"score\": \"0.5549877\",\n \"text\": \"function makeUnitVal(v) {\\n if (typeof v == 'string')\\n return UnitValue(stripUnits(v), v.replace(/[0-9.-]+/g, ''));\\n if (typeof v == 'number')\\n return UnitValue(v, DOMunitToCSS[app.preferences.rulerUnits]);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32ddbfd8acf002b4595779ec4a4d1cdc\",\n \"score\": \"0.554817\",\n \"text\": \"function addPrefixToPropertyName(name, prefix) {\\n\\t\\tif (!prefix) {\\n\\t\\t\\treturn name;\\n\\t\\t}\\n\\n\\t\\tvar parts = name.split(\\\".\\\");\\n\\t\\tvar result = \\\"\\\";\\n\\t\\tfor (var i = 0; i < parts.length - 1; i++) {\\n\\t\\t\\tresult += parts[i] + \\\".\\\";\\n\\t\\t}\\n\\t\\tvar lastPart = parts[parts.length - 1];\\n\\t\\tif (prefixRequiresNextInitialCap(prefix)) {\\n\\t\\t\\tresult += prefix + lastPart.substring(0, 1).toUpperCase() + lastPart.substring(1);\\n\\t\\t} else {\\n\\t\\t\\tresult += prefix + lastPart;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77b549048f9379340d570a42ee866363\",\n \"score\": \"0.55381113\",\n \"text\": \"function ensureUnit(val) {\\n return val + (isNumber(val) ? 'px' : '');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77b549048f9379340d570a42ee866363\",\n \"score\": \"0.55381113\",\n \"text\": \"function ensureUnit(val) {\\n return val + (isNumber(val) ? 'px' : '');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77b549048f9379340d570a42ee866363\",\n \"score\": \"0.55381113\",\n \"text\": \"function ensureUnit(val) {\\n return val + (isNumber(val) ? 'px' : '');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77b549048f9379340d570a42ee866363\",\n \"score\": \"0.55381113\",\n \"text\": \"function ensureUnit(val) {\\n return val + (isNumber(val) ? 'px' : '');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77b549048f9379340d570a42ee866363\",\n \"score\": \"0.55381113\",\n \"text\": \"function ensureUnit(val) {\\n return val + (isNumber(val) ? 'px' : '');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca79c4adff1a915939e6872c8dd7ba11\",\n \"score\": \"0.55305034\",\n \"text\": \"prefixName(prefix, name) {\\n if (prefix === '-moz-') {\\n return name + '--moz-device-pixel-ratio'\\n } else {\\n return prefix + name + '-device-pixel-ratio'\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"549dc8adc64d977218a4df6f2512765c\",\n \"score\": \"0.55272096\",\n \"text\": \"function uniqueId(prefix) {\\n var id = ++idCounter;\\n return prefix ? String(prefix) + id : id;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6bf33929f6875905af652bfff0cab6d7\",\n \"score\": \"0.55266196\",\n \"text\": \"normalizeUnit(str, full) {\\n let num = parseFloat(str);\\n let deg = (num / full) * 360;\\n return `${deg}deg`\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f2843868d7995ea10cb8543f4174d16\",\n \"score\": \"0.55231136\",\n \"text\": \"function prefix(symbol) {\\n\\t\\t\\t\\tif (typeof arguments[1] === 'number') {\\n\\t\\t\\t\\t\\tvar parselet = new self.nodes.parselets.Prefix(arguments[1]);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tvar parselet = arguments[1];\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tself.register('prefix', symbol, parselet);\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93fb335a8b4734935f61bd2602604621\",\n \"score\": \"0.5515397\",\n \"text\": \"function uniqueId(prefix) {\\n const id = ++idCounter;\\n return prefix ? String(prefix) + id : id;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05714a7d03bf1dd9dfaa6eb0a4266368\",\n \"score\": \"0.55122715\",\n \"text\": \"function replaceUnit( u ) {\\n if( u.includes( 'yavaa:' ) ) {\\n u = u.replace( 'yavaa:', '' )\\n return UnitStore.getUnit( `http://yavaa.org/ns/units/${u}` );\\n } else {\\n return UnitStore.getUnit( `http://www.wurvoc.org/vocabularies/om-1.8/${u}` );\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc4cd90561bbc0f0a2106b9f4cec8349\",\n \"score\": \"0.5504761\",\n \"text\": \"prefixed(prop, prefix) {\\n let spec\\n ;[spec, prefix] = flexSpec(prefix);\\n if (spec === 2009) {\\n return prefix + 'box-align'\\n }\\n if (spec === 2012) {\\n return prefix + 'flex-align'\\n }\\n return super.prefixed(prop, prefix)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"801e50aeec1b790c9b183a8cb4df9084\",\n \"score\": \"0.5499754\",\n \"text\": \"function getFormatedUnits (arg) {\\n var lowered = arg.toLowerCase();\\n\\n if (lowered.indexOf('fl.oz.') != -1) { return 'Ounce'; }\\n if (lowered.indexOf('fl oz') != -1) { return 'Ounce'; }\\n if (lowered.indexOf('gallon') != -1) { return 'Gallon'; }\\n if (lowered.indexOf('pound') != -1) { return 'Pound'; }\\n if (lowered.indexOf('ounce') != -1) { return 'Ounce'; }\\n if (lowered.indexOf('oz') != -1) { return 'Ounce'; }\\n if (lowered.indexOf('oz.') != -1) { return 'Ounce'; }\\n if (lowered.indexOf('ml') != -1) { return 'ml'; }\\n if (lowered.indexOf('g') != -1) { return 'Gram'; }\\n if (lowered.indexOf('gram') != -1) { return 'Gram'; }\\n if (lowered.indexOf('pack') != -1) { return 'Pack'; }\\n if (lowered.indexOf('dram') != -1) { return 'Dram'; }\\n if (lowered.indexOf('count') != -1) { return 'Item'; }\\n\\n return arg;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07800644dee78919641ce1047656ce86\",\n \"score\": \"0.5469789\",\n \"text\": \"function getUid(prefix) {\\n if (prefix === void 0) { prefix = ''; }\\n if (!(prefix in _uidPrefixes)) {\\n _uidPrefixes[prefix] = 0;\\n }\\n _uidPrefixes[prefix] += 1;\\n return prefix + _uidPrefixes[prefix].toString();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2154f010697c6412983cb0e44565380\",\n \"score\": \"0.5468996\",\n \"text\": \"function registerUnit(unit) {\\n lookupTbl.set(unit.toString(), unit);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5aaeb93ee65ae10d6a65dadf616ef66d\",\n \"score\": \"0.5468006\",\n \"text\": \"function getNextUnit(unit) {\\n switch (unit) {\\n case \\\"year\\\":\\n return;\\n case \\\"month\\\":\\n return \\\"year\\\";\\n case \\\"week\\\":\\n return \\\"month\\\";\\n case \\\"day\\\":\\n return \\\"month\\\"; // not a mistake\\n case \\\"hour\\\":\\n return \\\"day\\\";\\n case \\\"minute\\\":\\n return \\\"hour\\\";\\n case \\\"second\\\":\\n return \\\"minute\\\";\\n case \\\"millisecond\\\":\\n return \\\"second\\\";\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b2ff502851d9493dcbf15cc7e54c6c8\",\n \"score\": \"0.5468\",\n \"text\": \"static ustring(indent, msg, prefix='', suffix='') {\\n return \\\" \\\".repeat(indent) + prefix + msg + suffix;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":80,"cells":{"query_id":{"kind":"string","value":"e5805592cacb12f452da3105cbceb169"},"query":{"kind":"string","value":"9 Dash between Even Numbers Write a JavaScript program which accepts a number as input and inserts dashes () between two consecutive even numbers. Test: dash_in_even(012345684); Output: \"01245684\""},"positive_passages":{"kind":"list like","value":[{"docid":"d2689236fdc550b0d354a69890493384","score":"0.8415265","text":"function dash_in_even(number) {\n var x=number.toString();\n var y=x[0];\n for(var i=1;i<x.length;i++)\n {\n if((parseInt(x[i-1])%2==0) && (parseInt(x[i])%2==0) )\n {\n y=y+\"-\"+x[i];\n \n }\n else\n {\n y+=x[i];\n }\n }\n return y;\n}","title":""}],"string":"[\n {\n \"docid\": \"d2689236fdc550b0d354a69890493384\",\n \"score\": \"0.8415265\",\n \"text\": \"function dash_in_even(number) {\\n var x=number.toString();\\n var y=x[0];\\n for(var i=1;i<x.length;i++)\\n {\\n if((parseInt(x[i-1])%2==0) && (parseInt(x[i])%2==0) )\\n {\\n y=y+\\\"-\\\"+x[i];\\n \\n }\\n else\\n {\\n y+=x[i];\\n }\\n }\\n return y;\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"2b79a9448d3043857409bb892646d528","score":"0.81194633","text":"function dashes_between_even(number) {\n\n const number_string = number.toString();\n\n let result = number_string[0];\n\n const length = number_string.length;\n\n for (let i = 1; i < length; i++) {\n // if ((number_string[i] % 2 === 0) && (number_string[i - 1] % 2 === 0)) {\n // result = number_string.slice(0, i) + '-';\n // }\n // else {\n // result = result + number_string[i];\n // }\n\n if ((number_string[i] % 2 === 0) && (number_string[i - 1] % 2 === 0)) {\n result = result.concat('-' + number_string[i]);\n }\n else {\n result = result.concat(number_string[i]);\n }\n\n\n }\n\n return result;\n}","title":""},{"docid":"8207418cd3f88792fff3b25847ecac2e","score":"0.78192204","text":"function dash (numString) {\n // define your function here\n for (var i = 0; i < numString.length - 1; i++) {\n if (parseInt(numString[i]) % 2 === 0 && parseInt(numString[i + 1]) % 2 === 0) {\n numString = numString.replace(numString[i], numString[i] + '-')\n i += 1\n }\n }\n return numString\n}","title":""},{"docid":"1cd18ee13e97a9f2df0a826f802101c8","score":"0.7814699","text":"function insertDash(num) {\n // turns string into array\n var arr = num.toString().split(\"\")\n // for loop that iterates through the digits\n for(i=0; i<arr.length; i++) {\n // compares consecutive digits to see if both are odd\n if(parseInt(arr[i])%2===1 && parseInt(arr[i+1])%2===1)\n { // inserts dash between odd numbers\n arr.splice(i+1,0,\"-\");\n }\n }\n\n// turn array into a number\narr = arr.join(\"\");\n// return number\nreturn arr;\n}","title":""},{"docid":"e6a7580a7e32759f0b71f97ec2d6a905","score":"0.777794","text":"function dash_in_even(number) {\n console.log(\"even numbers separated by dashes\");\n var str = number.toString();\n var result = [str[0]];\n\nfor(var x=1; x<str.length; x++)\n {\n if((str[x-1]%2 === 0)&&(str[x]%2 === 0))\n {\n result.push('-', str[x]);\n }\n else\n {\n result.push(str[x]);\n }\n }\nconsole.log(result.join(''));\n}","title":""},{"docid":"7af8ad1c31c9c1f7dd2c8e8cac2ef89d","score":"0.7718444","text":"function DashInsert(num) {\n //convert number to string\n //convert string to array\n var array = num.toString().split(\"\");\n var output = \"\";\n\n //loop through array\n for (var i = 0; i < array.length; i++) {\n //add character to output\n output += array[i];\n //if current character is odd and last character is odd\n if (array[i] % 2 !== 0 && array[i+1] % 2 === 1) {\n output += \"-\";\n }\n }\n\n return output;\n\n}","title":""},{"docid":"eae4e9db13f989a3f64d3f99bb5b0e70","score":"0.7655578","text":"function dashInsert(num) {\n\tvar output = \"\";\n\tvar array = num.toString().split(\"\");\n\tfor (var i = 0; i < array.length; i++){\n\t\tif ( array[i]% 2 === 1 && array [i+ 1]% 2 === 1) // Every time the loop run it changes the value you of i [\"4\",\"2\",\"3\"]\n\t\t{\n\t\t\toutput = output + array[i] + \"-\";\n\t\t} else {\n\t\t\touput = output + array[i];\n\t\t}\n\t}\n\treturn output;\n}","title":""},{"docid":"a4d577a7a0c60ec1217141e3e1891e8c","score":"0.7645843","text":"function insertDash(num) {\n let digit;\n let digits = '';\n let numString = num.toString();\n for (let i = 0; i < numString.length; i++){\n digit = numString.charAt(i);\n if (parseInt(digit) % 2 && parseInt(numString.charAt(i + 1)) % 2){\n digit += '-';\n }\n digits += digit;\n }\n return digits;\n}","title":""},{"docid":"ea82ea9f8c6642d0e40c394f8605dc32","score":"0.7545936","text":"function DashInsert(str) { \r\n\r\n // code goes here \r\nvar numbers=str.split(\"\");\r\nvar result=[];\r\nfor(var i=0;i<numbers.length;i++){\r\n if((numbers[i]%2&&numbers[i+1]%2)==1){\r\n numbers[i]=numbers[i]+\"-\";\r\n\r\n }\r\n result.push(numbers[i]);\r\n}\r\nreturn result.join(\"\");\r\n}","title":""},{"docid":"c7e7440bfc058f23550e9252b7c257f2","score":"0.7543408","text":"function dash (numString) {\n // define your function here\n var numStr = numString\nvar numStrArrMinus = []\n\nfor (var i = 0; i < numStr.length ; i++)\nif (numStr[i]%2===0 && numStr[i+1]%2 ===0 ){\nnumStrArrMinus.push(numStr[i]+\"-\")\n}\nelse {\nnumStrArrMinus.push(numStr[i])\n}\n\nreturn(numStrArrMinus.join(''))\n}","title":""},{"docid":"89d126a9cba00d0d8f79f47f5441c4ef","score":"0.75008684","text":"function insertDash(num) {\n return num.toString().split('').map(function(val, i, arr){\n if( parseInt(val) % 2 && parseInt(arr[i + 1]) % 2 ) val += '-';\n return val;\n }).join('');\n}","title":""},{"docid":"173f27bf9ccf8f20ac2de5bf84828e0b","score":"0.7473589","text":"function insertDash(num) {\n //code me\n var result = []\n var subresult = String(num).split('');\n subresult.forEach((item,index,array) => {\n //check if next index is \n if(array[index - 1] % 2 !== 0 && item % 2 !== 0 && index !== 0){\n result.push(`-${item}`)\n }\n else{\n result.push(String(item))\n }\n })\n return result.join('')\n}","title":""},{"docid":"b63d3201500163ee344613bb5d964664","score":"0.7368599","text":"function DashInsert(num) {\n\n // First, we convert the input number into a string\n // This allows us to add the character to our answer rather than summing the two.\n num = num.toString();\n // Next, we declare and initialize a variable to hold our answer string.\n var answer = \"\";\n\n // After that, we loop through each character in our input number...\n for (var i = 0; i < num.length; i++) {\n // ...and for every character after the first, we check if the current and previous character are odd.\n if ((i > 0) && (num[i] % 2 === 1) && (num[i - 1] % 2 === 1)) {\n // If both are, we add a dash to our answer.\n answer += \"-\";\n }\n // No matter whether or not we add a dash, we add the current number to our answer string.\n answer += num[i];\n }\n\n // Finally, we return our answer.\n return answer;\n}","title":""},{"docid":"701b7e4f75be416c422d4da9f8889e34","score":"0.71643424","text":"function DashInsert(str) {\n\nvar arr = str.split(\"\");\nvar arr2 = [];\n\nfor (var i = 0; i < arr.length; i++) {\n if ((arr[i] === 0) || (i == arr.length-1)) {\n arr2.push(arr[i]);\n }\n else if ((arr[i] % 2 !== 0) && (arr[i+1] % 2 !== 0)) {\n arr2.push(arr[i] + \"-\");\n } else {\n arr2.push(arr[i]);\n }\n}\n return arr2.join(\"\");\n\n\n}","title":""},{"docid":"06562d8ab08aaa66160f7188f7282340","score":"0.7129298","text":"function separateEven(n) {\r\n var arr = n.toString().split('')\r\n var sep = [];\r\n for (var i = 0; i < arr.length; i++) {\r\n if (arr[i] % 2 == 0 && arr[i + 1] %2 == 0 ) {\r\n sep.push(arr[i]);\r\n sep.push(\"-\");\r\n } else {\r\n sep.push(arr[i])\r\n }\r\n } \r\n var x = sep.join(\"\").toString();\r\n return x;\r\n}","title":""},{"docid":"4fad9b2a790a1a311afc3bf5b79b3ec9","score":"0.7128818","text":"function dashes1(n) {\n let str = '';\n for (let i = 0; i < n.length; i++) {\n if (n[i] % 2 === 0 && n[i+1] % 2 === 0) {\n str += `${n[i]}-`\n } else {\n str += n[i]\n }\n }\n return str\n}","title":""},{"docid":"8c34937802718c1ec1c41eff3f352e9e","score":"0.70021003","text":"function addDashBetweenNumber(number) {\n\n}","title":""},{"docid":"05efc21455d9223456b24390b613ea1a","score":"0.68747","text":"function tambahDash(str) {\n var string = \"\";\n for (let i = 0; i < str.length; i++) {\n if (str.charAt(i) % 2 == 1 && str.charAt(i+1) % 2 == 1) {\n string+=str.charAt(i) + \"-\"\n } else {\n string+=str.charAt(i)\n }\n }\n return string\n}","title":""},{"docid":"92fcd7a7998435198704365f02841e6e","score":"0.68280965","text":"function tambahDash(str) {\n var string = \"\";\n\n for (let i = 0; i < str.length; i++) {\n if (str[i] % 2 == 1 && str[i - 1] % 2 == 1) {\n string += \"-\" + str[i];\n } else {\n string += str[i];\n }\n }\n\n return string;\n}","title":""},{"docid":"7a9745ebdad158805ef4ce2482bf49fe","score":"0.6502554","text":"function oddnumberinrange(x,n){\n let str = \"\";\n for(let i =x; i<n;i++){\n if(i%2==1){\n str = str + i + \" \";\n }\n }\n return str;\n}","title":""},{"docid":"6248a6136f8a64496ca78b979f51c58e","score":"0.6348123","text":"function evenNumbers(num1, num2) {\r\n\r\nfor (var i = 0; i<=num2; i++) {\r\n if (num1<=i && i%2==0) {\r\nvar exist = false;\r\n var newDigit = i%10;\r\n var newNum = (i-newDigit)/10;\r\n var str = \"\" + newNum;\r\n var length = str.length;\r\n for (var f=0; f<=length; f++) {\r\n if ((newNum%10)%2===0) {\r\n exist = false;\r\n break;\r\n }\r\n var newDigit2 = newNum%10;\r\n newNum = (newNum-newDigit2)/10;\r\n console.log(i);\r\n }\r\n }\r\n }\r\n}","title":""},{"docid":"55c3894e44ba6bfbf63e9ad7d242165b","score":"0.61885315","text":"function staircase(n) {\n // for (let i = 1; i <= n; i++) {\n // let col = i;\n // for (let j = 1; j <= n - col; j++) {\n // process.stdout.write(' ');\n // }\n // for (let j = 1; j <= col; j++) {\n // process.stdout.write('#');\n // }\n // process.stdout.write('\\n');\n // }\n\n let separator = '';\n for (let i = 1; i <= n; i++) {\n separator += ' '.repeat(n - i) + '#'.repeat(i) + '\\n';\n }\n process.stdout.write(separator)\n}","title":""},{"docid":"2ee6194ece14e3025a85a40294bca7dc","score":"0.6160992","text":"function staircase(num) {\n for (let i=1; i <= num; i++) {\n let spaces = num - i\n console.log(\" \".repeat(spaces) + \"#\".repeat(i))\n }\n }","title":""},{"docid":"b70a02425e2cb4db72d65fd3b3779033","score":"0.61482483","text":"function substituir(n1) {\n let numeros = n1.split('');\n var result = [numeros[0]];\n\n for (let j = 1; j < numeros.length - 1; j++) {\n const element = numeros[j];\n if (parseInt(numeros[j-1]) % 2 === 0 && parseInt((numeros[j])) % 2 === 0) {\n result.push('-',numeros[j]);\n console.log(result);\n\n }\n else if (parseInt(numeros[j-1]) % 2 !== 0 && parseInt((numeros[j])) % 2 !== 0) {\n result.push('#',numeros[j]);\n console.log(result);\n }\n else {\n result.push(numeros[j]);\n }\n }\n\n if (parseInt(numeros[numeros.length - 2]) % 2 === 0 && parseInt((numeros[numeros.length - 1])) % 2 === 0) {\n result.push('-', numeros[numeros.length - 1]);\n console.log(result);\n\n }\n if (parseInt(numeros[numeros.length - 2]) % 2 !== 0 && parseInt((numeros[numeros.length - 1])) % 2 !== 0) {\n result.push('#', numeros[numeros.length - 1]);\n }\n\n\n\n return result.join('');\n}","title":""},{"docid":"6c77b1a8d320ce48ca57a2cb59e7157d","score":"0.613908","text":"function displayHyphen() {\n var hyphen = \"\";\n for (var i = 0; i < 56; i++) {\n hyphen += \"*\";\n }\n return console.log(hyphen);\n}","title":""},{"docid":"4e096fa17b41d531e4853d9e95daec8c","score":"0.6115568","text":"function staircase(n) {\n\tfor (let i = 1; i <= n; i++) {\n\t\tconsole.log('#'.repeat(i).padStart(n, ' '))\n\t}\n}","title":""},{"docid":"2bc6016dcbe23118a308972774bb7b32","score":"0.6101854","text":"function staircase(n) {\n\tfor (let i = 0; i < n; i++) {\n\t\tfor (let j = 0; j < n - i - 1; j++) {\n\t\t\tprocess.stdout.write(' ');\n\t\t}\n\t\tfor (let j = n - i - 1; j < n; j++) {\n\t\t\tprocess.stdout.write('#');\n\t\t}\n\t\tprocess.stdout.write('\\n');\n\t}\n}","title":""},{"docid":"fa95ad5a2e0f216cd92e634f407287b8","score":"0.60825264","text":"function createDash(wordToGuess) {\n document.getElementById(\"dash\").innerHTML = \"\";\n for (let i = 0; i < wordToGuess.length; i++) {\n wordDashes[i] = \"- \";\n document.getElementById(\"dash\").innerHTML += wordDashes[i];\n }\n}","title":""},{"docid":"65a7cbe7868c46908ae2fc347434a876","score":"0.60816646","text":"function staircase(n) {\n let star = '';\n let spaces = '';\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n-i-1; j++)\n spaces += ' ';\n star += '#';\n process.stdout.write(spaces + star);\n spaces = '';\n if (i != n-1)\n process.stdout.write(\"\\n\");\n }\n\n}","title":""},{"docid":"a3741019adb130bee1219dafdbd85672","score":"0.6053355","text":"function EvenOdd(number)\n{\n if(!Number.isInteger(number))\n {\n return \"Not a valid number\";\n }\n if(number == 0)\n {\n return \"Even\";\n }\n else if (number == 1)\n {\n return \"Odd\";\n }\n else\n {\n return(EvenOdd(number - 2));\n }\n}","title":""},{"docid":"08cbce89810adbaf9a59fc04e65521cc","score":"0.6021206","text":"function evenOdd(number){\n if( number % 2 === 0){\n return \"even\";\n } else {\n return \"odd\";\n } \n }","title":""},{"docid":"639767da7024e62bf80ecb1323f28693","score":"0.6020397","text":"function dashNumber(number) {\n const numberAsArray = number.toString().split();\n return numberAsArray.join('-');\n }","title":""},{"docid":"fad457565a0191b45745a7554ec9bbc5","score":"0.6008995","text":"function Even() {\n for (var i = 0; i <=10; i++){ // \n if ((i % 2) == 0) // if remainder of i % 2 = 0 then its even\n console.log(i + \" Even \\n\");\n }\n }","title":""},{"docid":"e25b7363ced44ae58a5b0fed04e8216c","score":"0.6006857","text":"function showNumber(input) {\n for (let i = 1; i <= input; i++) {\n if (i % 2 !== 0) {\n console.log(i + ' Odd');\n } else {\n console.log(i + ' Even')\n }\n }\n}","title":""},{"docid":"6fdd85b11c6d43d1305d24ca7a2d1d3d","score":"0.5938005","text":"function staircase(n) {\n let hash = \"#\";\n let space = \" \";\n let x = n - 1;\n let y = n - (n - 1);\n for (let i = 0; i < n; i++) {\n console.log(`${space.repeat(x)}${hash.repeat(y)}`);\n x -= 1;\n y += 1;\n }\n}","title":""},{"docid":"81c48d4dbbeba557ac80e30ddcdd0ab5","score":"0.59184766","text":"function two(n) {\n var s = '00' + n;\n return s.slice(-2);\n}","title":""},{"docid":"3934323ac662fb44d139c0df6d2a0920","score":"0.59183526","text":"function evenOdd(num) {\n if (num % 2 === 0) {\n return \"even\";\n } else return \"odd\";\n}","title":""},{"docid":"de1870542f897c7c2c8a18ad512d0b26","score":"0.58929354","text":"function oddOrEvenString(num){\n if (num.length %2== 0)\n return \"This string length is TOTALLY even! ..\";\n else (num.length % 1== 0)\n return \"This string's length is odd\";\n}","title":""},{"docid":"b135c0b8c197c142fc4d08123ef957c2","score":"0.58721966","text":"function evenMultiplyTable() {\n for (let i = 0; i < 10; i++ ) {\n \tlet lines = `${i} `;\n \tfor (let j = 1; j < 10; j++) {\n \t\tif (i === 0) {\n \t\t\tlines += `${j} `;\n \t\t} else if ((i * j)%2 === 0) {\n \t\t\tlines += \"+ \";\n \t\t} else {\n \t\t\tlines += \"- \";\n \t\t}\n \t}\n \tconsole.log(lines);\n \t}\n}","title":""},{"docid":"d3e18626f124bfeb135ae88f90229c1d","score":"0.5863893","text":"function oddOrEvenString (myString){\n if (myString.length %2==0){\n console.log (\"This String is TOTALLY Even\");\n}else { if (myString.length%2 != 0)\nconsole.log (\" This is Odd \");\n}\n}","title":""},{"docid":"d1f73bf1d95decea3cad40f37229ca37","score":"0.5841992","text":"function staircase(n) {\n for (let x = 1; x <= n; x++) {\n let stair = \" \".repeat(n - x) + \"#\".repeat(x);\n console.log(stair);\n }\n}","title":""},{"docid":"cd3399d17e73324ab0b147c2ce06d65c","score":"0.5832901","text":"function siftEvenOddChars(str) {\n let even = '';\n let odd = '';\n\n for (let i = 0; i < str.length; i++) {\n const char = str.charAt(i);\n\n if (isEven(i)) {\n even += char;\n } else {\n odd += char;\n }\n }\n\n console.log(even, odd);\n\n}","title":""},{"docid":"4cf4698b22074db9c1b2d2dc5f5fd7fc","score":"0.5828755","text":"function evenOrOdd(n) {\n if (parseInt(n) % 2 === 0) {\n return 'even';\n } else {\n return 'odd';\n }\n}","title":""},{"docid":"332430e971cd71c099d003bcfae31206","score":"0.5824486","text":"function staircase(n) {\n let spaces = \" \".repeat(n - 1);\n let symbol = \"#\";\n for (let i = 1; i <= n; i++) {\n console.log(`${spaces}${symbol}`);\n spaces = spaces.slice(0, spaces.length - 1);\n symbol += \"#\";\n }\n}","title":""},{"docid":"ecf7638131a6b339ebfe241697e8a656","score":"0.5818134","text":"function oddEven(numb) {\n if(numb % 2 == 0) {\n return \"Even\"\n }\n else {\n return \"Odd\"\n }\n}","title":""},{"docid":"742afe90ebf8549d844b87b68d95cee4","score":"0.58121353","text":"function evenorodd(num){\r\n if(num%2 == 0){\r\n return \"even\";\r\n }\r\n else{\r\n return \"odd\";\r\n }\r\n}","title":""},{"docid":"df5818dc7df46b99aa22cfc10e584ad8","score":"0.58096945","text":"function staircase(n) {\n var line = Array(n + 1).fill(' ');\n line[n] = '\\n';\n for (var i = n - 1; i >= 0; i--) {\n line[i] = '#';\n process.stdout.write(line.join(''));\n }\n\n\n}","title":""},{"docid":"bef4c831668dcd2fdb575c48ec9346d7","score":"0.58072","text":"function OddEven(a) {\n if(a >= 0) {\n if( (a % 2) == 0) {\n console.log(\"even\");\n }\n else {\n console.log(\"odd\");\n }\n }\n else\n console.log(\"invalid:negative no.\");\n}","title":""},{"docid":"4d046f03d498f5050af7b7169b1bd2c8","score":"0.5799183","text":"function convertNumberToLine() {\n var tossOutcome = tossResult();\n\n if (tossOutcome % 2 === 0) {\n return (\"____ ____ even \");\n } else {\n return (\"___________ odd \");\n }\n\n }","title":""},{"docid":"c82a799d8dc2e22bff866f0078046d1e","score":"0.5797775","text":"function staircase(n) {\n let hashes = ''\n let result = ''\n for (let i = 1; i <= n; i++) { \n hashes += '#'\n // concat n - i amount of spaces\n let spaces = \" \".repeat(n - i)\n // add another line of correct amount of spaces and hashes\n result += spaces + hashes + \"\\n\"\n }\n console.log(result)\n}","title":""},{"docid":"7912ce6e4a127d094a40c1b8fdfc8aa4","score":"0.57885814","text":"function doDashes2(str) {\n return replaceNonChar(str, '-');\n}","title":""},{"docid":"c0371e637740464544f974e85cc8bce5","score":"0.57802844","text":"function staircase(n) {\n var space = \" \";\n var pound = \"#\";\n for (var i = 1; i <= n; i++) {\n while (i <=n) {\n return space.repeat(n-i) + pound.repeat(i);\n }\n }\n}","title":""},{"docid":"26d4f4592ad87ca5dd0f79016774d0a7","score":"0.5777767","text":"function staircase(n) {\n for(var i = 1; i <= n; i++){\n var diff = n - i;\n var row = \" \".repeat(diff) + '#'.repeat(i);\n console.log(row);\n }\n}","title":""},{"docid":"7455f8145bd83d1de052cc546a7ed07e","score":"0.57728046","text":"function oddEven(num) {\n if (num % 2 === 0) {\n return (num + \" is an even number.\")\n } else {\n return (num + \" is an odd number.\")\n }\n}","title":""},{"docid":"809a7ef5499d95ef522bed8df2d5310e","score":"0.576709","text":"function forst(st2){\n for ( let i =0 ; i <10;i++){\n document.write ( st2 + \"-\")\n }\n }","title":""},{"docid":"46f831885f3167078c1ff48904125363","score":"0.5753866","text":"function getDisplay(word)\r\n{ \r\n var dashes = '';\r\n for (var i=0; i<word.length; i++){\r\n dashes += '-';\r\n }\r\n \r\n return dashes;\r\n}","title":""},{"docid":"bbf5dff7d6ca5bce3b8d88c9406840e8","score":"0.5752014","text":"function even_or_odd(number) {\n if (number % 2 == 0)\n return \"Even\";\n return \"Odd\";\n}","title":""},{"docid":"27a83ad849645232a71c65f01577e82d","score":"0.57514924","text":"prependSpaceIfLengthIsEven($ascii_number, $length) {\n if (this.isOdd($length)) {\n return ` ${$ascii_number}`;\n }\n\n return $ascii_number;\n }","title":""},{"docid":"b443b5bdcd6c54dd508a592565167fef","score":"0.5749132","text":"function oddEven()\r\n{\r\n \r\n \r\n for(i=0;i<=15;i++)\r\n {\r\n if(i==0)\r\n {\r\n console.log(i+\" even\");\r\n document.getElementById(\"output5\").innerHTML+=i+\" is\"+\" Even\"+'<br>';\r\n \r\n }\r\n else if(i%2==0)\r\n {\r\n console.log(i+\" Even\");\r\n document.getElementById(\"output5\").innerHTML+=i+\" is\"+\" Even\"+\"<br>\";\r\n \r\n }\r\n else\r\n {\r\n console.log(i+\" odd\");\r\n document.getElementById(\"output5\").innerHTML+=i+\" is\"+\" Odd\"+\"<br>\";\r\n \r\n }\r\n }\r\n}","title":""},{"docid":"4aa5d9c3b1ff9dcaf31432aadc07d1e3","score":"0.57444686","text":"function oddEven(d){\nif(d/2 !==0 ){\n console.log(d+' '+'is odd');\n}else{\n console.log(d+' '+'is even');\n}\n}","title":""},{"docid":"c75c4be1ba69e74568197a49b6b8f2b5","score":"0.5740021","text":"function evenDigitsOnly(n) {\n return String(n).split(\"\").every(x=>x%2===0)\n}","title":""},{"docid":"596dd82ffc9498176a00345a9f2f219b","score":"0.57398826","text":"function square(number){\r\n var specialChar = \"#\"\r\n if(number > 0){\r\n for(var i = 1; i <= number; i++){\r\n console.log(specialChar.repeat(i));\r\n }\r\n\r\n }else if(number < 0){\r\n number = number*(-1)\r\n for(var i = number; i >= 0; i--){\r\n console.log(specialChar.repeat(i));\r\n }\r\n }\r\n \r\n}","title":""},{"docid":"a57b79bda3286a85d252bb2763c8a38b","score":"0.5725356","text":"function Even(){ \r\n for( i=1; i<=200; i++){ \r\n x = i % 2; \r\n if(x == 0){ \r\n document.write(i + \"<br>\"); \r\n console.log(i); \r\n } \r\n } \r\n}","title":""},{"docid":"6eea9139c0ff647d9d130f796cbafc3e","score":"0.5719841","text":"static twoDigitInt(number){\n return `${(\"0\" + number).slice(-2)}`;\n }","title":""},{"docid":"411b9294b97a4b004d79be12caa07bc0","score":"0.5718074","text":"function calculateEvens(startNum, endNum, step) { \n var output = \"\\n\";\n for (var i = startNum; i < endNum; i += step) {\n if (i % 2 == 0) {\n output += i; //ig js auto converts i to a string???\n output += \"\\n\";\n }\n }\n return output; \n}","title":""},{"docid":"46a8b7ec3b9c29f0496a5b1e5820b012","score":"0.5702626","text":"function iseven(n){\n\twhile(n >=0){\n\t\tif(n === 0){\n \treturn \"Even\";\n }\n n=n-2;\n }\n return \"odd\";\n}","title":""},{"docid":"a28158b9629e0fd0e9c3d0deb6c74f75","score":"0.5694767","text":"function front_times (string, int){\n var output = string.substring(0,3);\n var outputTwo = string.substring(0,3);\n if (int == 0){\n return false;\n } else {\n for (var i = 1; i < int; i ++){\n output+=outputTwo;\n }\n }\n return output;\n}","title":""},{"docid":"2fca35c41edc645ea30ca199b141caf5","score":"0.56895006","text":"function even_or_odd(number) {\n if (number % 2 === 0) {\n return \"Even\"\n } else {\n return \"Odd\"\n }\n}","title":""},{"docid":"7ddfad97972d43b1299dada58766949d","score":"0.56818503","text":"function makeDash(word) {\r\n dashArray = [];\r\n for (var i = 0; i < word.length; i++) {\r\n dashArray.push(\"_\");\r\n }\r\n}","title":""},{"docid":"7d156be729177fc74a1422e1d0d08021","score":"0.56745356","text":"function dashify(str){\n return str.replace(/([a-z])([A-Z])/g, \"$1-$2\").toLowerCase();\n}","title":""},{"docid":"8a014ad0fe6d8c9b106cca0fd27e737c","score":"0.5668239","text":"function staircase(n) {\n\tvar line = Array(n + 1).fill(\" \");\n\tline[n] = \"\\n\";\n\tfor (var i = n - 1; i >= 0; i--) {\n\t\tline[i] = \"#\";\n\t\tprocess.stdout.write(line.join(\"\"));\n\t}\n}","title":""},{"docid":"49963ee1406088734a6c1aaccfc4ef57","score":"0.56681174","text":"function makeIntoDashes(word) {\n\tvar dashes = \"\";\n\tfor (i = 0; i < word.length - 1; i++) {\n\t\tdashes += \"_ \";\n\t}\n\tdashes += \"_\";\n\treturn dashes;\n}","title":""},{"docid":"9fdf369524085d12f43604241fbf6f7b","score":"0.5666551","text":"function aa(n){\r\n var a=1\r\n for(var i=1;i<=n;i++){\r\n var str=\"\"\r\n for(var j=i;j>=1;j--){\r\n str=str+(j%2)\r\n \r\n }\r\n console.log(str)\r\n }\r\n \r\n }","title":""},{"docid":"e5160854e8bbe62fb8d292647935b576","score":"0.56650484","text":"function weave(a_string, a_num) {\n let new_string = \"\";\n for (let i = 0; i < a_string.length; i++) {\n //take into account zero index and treat as one index\n if ((i + 1) % a_num === 0) {\n new_string = new_string + 'x';\n } else {\n new_string = new_string + a_string.charAt(i);\n }\n } //end of for loop\n return new_string;\n }","title":""},{"docid":"cda9385dc7bc233f7da33d6e8284087c","score":"0.5660958","text":"function stairCase(num){\n var test = \"#\";\n for(var i = 1; i <= num; i++){\n var string = test.repeat(i);\n console.log(string);\n }\n // return string;\n}","title":""},{"docid":"285984e9e31d04b7f8ec089e6e7469b1","score":"0.564807","text":"function isEven(str){\n\treturn str.length % 2 === 0; \n}","title":""},{"docid":"95b52158aa78d2c174725ea5c1efe5f0","score":"0.56403625","text":"function main (n) {\n for (let i = n - 1; i >= 0; i--) {\n console.log(' '.repeat(i).padEnd(n, '#'))\n }\n return ''\n}","title":""},{"docid":"4782c483eec887b2f727e72a6b015ee2","score":"0.5638466","text":"function staircase(n) {\n let result = '';\n let x = n-1;\n for(let i = 0; i < n; i++) {\n for( let j = 0; j < n; j++) {\n (j >= x) ? result += '#' : result += ' '; \n }\n x--;\n result += '\\n'\n }\n console.log(result);\n}","title":""},{"docid":"2a860ef98168c79be89eeca9e7b47e47","score":"0.56341463","text":"function fixTrytes(input){\n return input.length % 2 ? input + '9' : input;\n}","title":""},{"docid":"1bf6dc007e0be30edece6b21761b0ae0","score":"0.56331223","text":"function isEven(number) {\n if (number % 2 == 0) {\n console.log(\"EVEN\")\n }\n else {\n console.log(\"ODD\")\n }\n}","title":""},{"docid":"7d193559e8db4495203bf998707d4d4e","score":"0.5632401","text":"function twoDigits(number) {\r\n\tvar ddnum = \"\";\r\n\tddnum = (\"00\" + number).slice(-2);\r\n\tconsole.log(ddnum);\r\n\treturn ddnum\r\n}","title":""},{"docid":"18869ee54aef6b8754be45e83686dfc6","score":"0.56296283","text":"function isEven(num) {\n //WRITE YOUR CODE BETWEEN THIS LINE: ↓ ↓ ↓ ↓\n if (num % 2 == 0) {\n return 'even';\n } else {\n }\n //AND THIS LINE ↑↑↑↑↑\n}","title":""},{"docid":"b30544170c881a5806846c43cb58ee37","score":"0.56232876","text":"function oddNumsToN(n) {\n for (let i = 1; i <= n; i += 2) {\n if (i % 2 !== 0) {\n console.log(i);\n }\n }\n}","title":""},{"docid":"b9f3445a7c08003cb972f48c0b7413c7","score":"0.5617606","text":"function isEven(num){\r\n if(num %2 ==0){\r\n return \"this number is even\";\r\n }else {\r\n return \"this number is odd\";\r\n }\r\n }","title":""},{"docid":"c26b53f17b8e082be23e7f1dfd9397e1","score":"0.5615802","text":"_2digit(n) {\n return ('00' + n).slice(-2);\n }","title":""},{"docid":"c26b53f17b8e082be23e7f1dfd9397e1","score":"0.5615802","text":"_2digit(n) {\n return ('00' + n).slice(-2);\n }","title":""},{"docid":"c26b53f17b8e082be23e7f1dfd9397e1","score":"0.5615802","text":"_2digit(n) {\n return ('00' + n).slice(-2);\n }","title":""},{"docid":"462196a18c0f55753dcb4e98e162c347","score":"0.56097615","text":"function evenNumber(number,callback){ \n if(number%2===0)\n result=\"even\";\n else\n result=\"odd\";\n callback(); \n }","title":""},{"docid":"308a7afeaf838fc048197fa1f11f0cf9","score":"0.56046474","text":"function even_or_odd(number) {\n return number % 2 ? \"Odd\" : \"Even\"\n}","title":""},{"docid":"47a873836a13ae053995550047c77058","score":"0.56016713","text":"function isEven(number) {\n if (number %2) {\n console.log(\"This number is Odd\");\n }\n else {\n console.log(\"This number is Even\");\n }\n\n}","title":""},{"docid":"2786eaeee606ef8b337780b2d1bec75b","score":"0.5598078","text":"function isEven(num) {\n\n}","title":""},{"docid":"d8b63d48e19daecc34686b66fb471691","score":"0.5577436","text":"function two(x) {\r\n var d = '00' + x\r\n return d.substr(d.length - 2)\r\n }","title":""},{"docid":"1a1cdf71120ef3fcaae1d711d917fe85","score":"0.5573504","text":"function isEven(number) {\n\n}","title":""},{"docid":"1fb2d5839c091af0ef53d20606119999","score":"0.5573206","text":"function staircase(n) {\n // Write your code here\n let stairs = '#'\n let spaces = Array(n).join(' ')\n for (let i=0; i < n; i++) {\n console.log(spaces + stairs)\n stairs += '#'\n spaces = Array(n - 1 - i).join(' ')\n }\n\n}","title":""},{"docid":"b052f9ee138d5ee34c6cb72c1057a3bd","score":"0.55671054","text":"function odd(a) {\n var res = ''\n if (a % 2 === 0) {\n res = 'the number ' + a + ' is even'\n } else {\n res = 'the number ' + a + ' is odd'\n }\n\n return res\n}","title":""},{"docid":"b508084e58894cc76801f2301b8be887","score":"0.55608845","text":"function removeEvenCharacters(string) {\n\n let mystring='';\n\tif(string === undefined){\n\t\treturn \"missing argument\";\n\t} else if(typeof string !=='string'){\n\t\treturn \"argument not string\";\n\t}\n for (let i = 0; i < string.length; i++) {\n if (i % 2 !== 0) {\n mystring+=string[i];\n\t}\n }\n return mystring;\n console.log(mystring);\n}","title":""},{"docid":"399f18c2a602c9aa7984612291ee78ec","score":"0.5560222","text":"function padToEven(a) {\n return a.length % 2 ? \"0\" + a : a;\n}","title":""},{"docid":"399f18c2a602c9aa7984612291ee78ec","score":"0.5560222","text":"function padToEven(a) {\n return a.length % 2 ? \"0\" + a : a;\n}","title":""},{"docid":"399f18c2a602c9aa7984612291ee78ec","score":"0.5560222","text":"function padToEven(a) {\n return a.length % 2 ? \"0\" + a : a;\n}","title":""},{"docid":"399f18c2a602c9aa7984612291ee78ec","score":"0.5560222","text":"function padToEven(a) {\n return a.length % 2 ? \"0\" + a : a;\n}","title":""},{"docid":"399f18c2a602c9aa7984612291ee78ec","score":"0.5560222","text":"function padToEven(a) {\n return a.length % 2 ? \"0\" + a : a;\n}","title":""}],"string":"[\n {\n \"docid\": \"2b79a9448d3043857409bb892646d528\",\n \"score\": \"0.81194633\",\n \"text\": \"function dashes_between_even(number) {\\n\\n const number_string = number.toString();\\n\\n let result = number_string[0];\\n\\n const length = number_string.length;\\n\\n for (let i = 1; i < length; i++) {\\n // if ((number_string[i] % 2 === 0) && (number_string[i - 1] % 2 === 0)) {\\n // result = number_string.slice(0, i) + '-';\\n // }\\n // else {\\n // result = result + number_string[i];\\n // }\\n\\n if ((number_string[i] % 2 === 0) && (number_string[i - 1] % 2 === 0)) {\\n result = result.concat('-' + number_string[i]);\\n }\\n else {\\n result = result.concat(number_string[i]);\\n }\\n\\n\\n }\\n\\n return result;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8207418cd3f88792fff3b25847ecac2e\",\n \"score\": \"0.78192204\",\n \"text\": \"function dash (numString) {\\n // define your function here\\n for (var i = 0; i < numString.length - 1; i++) {\\n if (parseInt(numString[i]) % 2 === 0 && parseInt(numString[i + 1]) % 2 === 0) {\\n numString = numString.replace(numString[i], numString[i] + '-')\\n i += 1\\n }\\n }\\n return numString\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cd18ee13e97a9f2df0a826f802101c8\",\n \"score\": \"0.7814699\",\n \"text\": \"function insertDash(num) {\\n // turns string into array\\n var arr = num.toString().split(\\\"\\\")\\n // for loop that iterates through the digits\\n for(i=0; i<arr.length; i++) {\\n // compares consecutive digits to see if both are odd\\n if(parseInt(arr[i])%2===1 && parseInt(arr[i+1])%2===1)\\n { // inserts dash between odd numbers\\n arr.splice(i+1,0,\\\"-\\\");\\n }\\n }\\n\\n// turn array into a number\\narr = arr.join(\\\"\\\");\\n// return number\\nreturn arr;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6a7580a7e32759f0b71f97ec2d6a905\",\n \"score\": \"0.777794\",\n \"text\": \"function dash_in_even(number) {\\n console.log(\\\"even numbers separated by dashes\\\");\\n var str = number.toString();\\n var result = [str[0]];\\n\\nfor(var x=1; x<str.length; x++)\\n {\\n if((str[x-1]%2 === 0)&&(str[x]%2 === 0))\\n {\\n result.push('-', str[x]);\\n }\\n else\\n {\\n result.push(str[x]);\\n }\\n }\\nconsole.log(result.join(''));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7af8ad1c31c9c1f7dd2c8e8cac2ef89d\",\n \"score\": \"0.7718444\",\n \"text\": \"function DashInsert(num) {\\n //convert number to string\\n //convert string to array\\n var array = num.toString().split(\\\"\\\");\\n var output = \\\"\\\";\\n\\n //loop through array\\n for (var i = 0; i < array.length; i++) {\\n //add character to output\\n output += array[i];\\n //if current character is odd and last character is odd\\n if (array[i] % 2 !== 0 && array[i+1] % 2 === 1) {\\n output += \\\"-\\\";\\n }\\n }\\n\\n return output;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eae4e9db13f989a3f64d3f99bb5b0e70\",\n \"score\": \"0.7655578\",\n \"text\": \"function dashInsert(num) {\\n\\tvar output = \\\"\\\";\\n\\tvar array = num.toString().split(\\\"\\\");\\n\\tfor (var i = 0; i < array.length; i++){\\n\\t\\tif ( array[i]% 2 === 1 && array [i+ 1]% 2 === 1) // Every time the loop run it changes the value you of i [\\\"4\\\",\\\"2\\\",\\\"3\\\"]\\n\\t\\t{\\n\\t\\t\\toutput = output + array[i] + \\\"-\\\";\\n\\t\\t} else {\\n\\t\\t\\touput = output + array[i];\\n\\t\\t}\\n\\t}\\n\\treturn output;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d577a7a0c60ec1217141e3e1891e8c\",\n \"score\": \"0.7645843\",\n \"text\": \"function insertDash(num) {\\n let digit;\\n let digits = '';\\n let numString = num.toString();\\n for (let i = 0; i < numString.length; i++){\\n digit = numString.charAt(i);\\n if (parseInt(digit) % 2 && parseInt(numString.charAt(i + 1)) % 2){\\n digit += '-';\\n }\\n digits += digit;\\n }\\n return digits;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea82ea9f8c6642d0e40c394f8605dc32\",\n \"score\": \"0.7545936\",\n \"text\": \"function DashInsert(str) { \\r\\n\\r\\n // code goes here \\r\\nvar numbers=str.split(\\\"\\\");\\r\\nvar result=[];\\r\\nfor(var i=0;i<numbers.length;i++){\\r\\n if((numbers[i]%2&&numbers[i+1]%2)==1){\\r\\n numbers[i]=numbers[i]+\\\"-\\\";\\r\\n\\r\\n }\\r\\n result.push(numbers[i]);\\r\\n}\\r\\nreturn result.join(\\\"\\\");\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7e7440bfc058f23550e9252b7c257f2\",\n \"score\": \"0.7543408\",\n \"text\": \"function dash (numString) {\\n // define your function here\\n var numStr = numString\\nvar numStrArrMinus = []\\n\\nfor (var i = 0; i < numStr.length ; i++)\\nif (numStr[i]%2===0 && numStr[i+1]%2 ===0 ){\\nnumStrArrMinus.push(numStr[i]+\\\"-\\\")\\n}\\nelse {\\nnumStrArrMinus.push(numStr[i])\\n}\\n\\nreturn(numStrArrMinus.join(''))\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89d126a9cba00d0d8f79f47f5441c4ef\",\n \"score\": \"0.75008684\",\n \"text\": \"function insertDash(num) {\\n return num.toString().split('').map(function(val, i, arr){\\n if( parseInt(val) % 2 && parseInt(arr[i + 1]) % 2 ) val += '-';\\n return val;\\n }).join('');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"173f27bf9ccf8f20ac2de5bf84828e0b\",\n \"score\": \"0.7473589\",\n \"text\": \"function insertDash(num) {\\n //code me\\n var result = []\\n var subresult = String(num).split('');\\n subresult.forEach((item,index,array) => {\\n //check if next index is \\n if(array[index - 1] % 2 !== 0 && item % 2 !== 0 && index !== 0){\\n result.push(`-${item}`)\\n }\\n else{\\n result.push(String(item))\\n }\\n })\\n return result.join('')\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b63d3201500163ee344613bb5d964664\",\n \"score\": \"0.7368599\",\n \"text\": \"function DashInsert(num) {\\n\\n // First, we convert the input number into a string\\n // This allows us to add the character to our answer rather than summing the two.\\n num = num.toString();\\n // Next, we declare and initialize a variable to hold our answer string.\\n var answer = \\\"\\\";\\n\\n // After that, we loop through each character in our input number...\\n for (var i = 0; i < num.length; i++) {\\n // ...and for every character after the first, we check if the current and previous character are odd.\\n if ((i > 0) && (num[i] % 2 === 1) && (num[i - 1] % 2 === 1)) {\\n // If both are, we add a dash to our answer.\\n answer += \\\"-\\\";\\n }\\n // No matter whether or not we add a dash, we add the current number to our answer string.\\n answer += num[i];\\n }\\n\\n // Finally, we return our answer.\\n return answer;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"701b7e4f75be416c422d4da9f8889e34\",\n \"score\": \"0.71643424\",\n \"text\": \"function DashInsert(str) {\\n\\nvar arr = str.split(\\\"\\\");\\nvar arr2 = [];\\n\\nfor (var i = 0; i < arr.length; i++) {\\n if ((arr[i] === 0) || (i == arr.length-1)) {\\n arr2.push(arr[i]);\\n }\\n else if ((arr[i] % 2 !== 0) && (arr[i+1] % 2 !== 0)) {\\n arr2.push(arr[i] + \\\"-\\\");\\n } else {\\n arr2.push(arr[i]);\\n }\\n}\\n return arr2.join(\\\"\\\");\\n\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06562d8ab08aaa66160f7188f7282340\",\n \"score\": \"0.7129298\",\n \"text\": \"function separateEven(n) {\\r\\n var arr = n.toString().split('')\\r\\n var sep = [];\\r\\n for (var i = 0; i < arr.length; i++) {\\r\\n if (arr[i] % 2 == 0 && arr[i + 1] %2 == 0 ) {\\r\\n sep.push(arr[i]);\\r\\n sep.push(\\\"-\\\");\\r\\n } else {\\r\\n sep.push(arr[i])\\r\\n }\\r\\n } \\r\\n var x = sep.join(\\\"\\\").toString();\\r\\n return x;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fad9b2a790a1a311afc3bf5b79b3ec9\",\n \"score\": \"0.7128818\",\n \"text\": \"function dashes1(n) {\\n let str = '';\\n for (let i = 0; i < n.length; i++) {\\n if (n[i] % 2 === 0 && n[i+1] % 2 === 0) {\\n str += `${n[i]}-`\\n } else {\\n str += n[i]\\n }\\n }\\n return str\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c34937802718c1ec1c41eff3f352e9e\",\n \"score\": \"0.70021003\",\n \"text\": \"function addDashBetweenNumber(number) {\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05efc21455d9223456b24390b613ea1a\",\n \"score\": \"0.68747\",\n \"text\": \"function tambahDash(str) {\\n var string = \\\"\\\";\\n for (let i = 0; i < str.length; i++) {\\n if (str.charAt(i) % 2 == 1 && str.charAt(i+1) % 2 == 1) {\\n string+=str.charAt(i) + \\\"-\\\"\\n } else {\\n string+=str.charAt(i)\\n }\\n }\\n return string\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92fcd7a7998435198704365f02841e6e\",\n \"score\": \"0.68280965\",\n \"text\": \"function tambahDash(str) {\\n var string = \\\"\\\";\\n\\n for (let i = 0; i < str.length; i++) {\\n if (str[i] % 2 == 1 && str[i - 1] % 2 == 1) {\\n string += \\\"-\\\" + str[i];\\n } else {\\n string += str[i];\\n }\\n }\\n\\n return string;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a9745ebdad158805ef4ce2482bf49fe\",\n \"score\": \"0.6502554\",\n \"text\": \"function oddnumberinrange(x,n){\\n let str = \\\"\\\";\\n for(let i =x; i<n;i++){\\n if(i%2==1){\\n str = str + i + \\\" \\\";\\n }\\n }\\n return str;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6248a6136f8a64496ca78b979f51c58e\",\n \"score\": \"0.6348123\",\n \"text\": \"function evenNumbers(num1, num2) {\\r\\n\\r\\nfor (var i = 0; i<=num2; i++) {\\r\\n if (num1<=i && i%2==0) {\\r\\nvar exist = false;\\r\\n var newDigit = i%10;\\r\\n var newNum = (i-newDigit)/10;\\r\\n var str = \\\"\\\" + newNum;\\r\\n var length = str.length;\\r\\n for (var f=0; f<=length; f++) {\\r\\n if ((newNum%10)%2===0) {\\r\\n exist = false;\\r\\n break;\\r\\n }\\r\\n var newDigit2 = newNum%10;\\r\\n newNum = (newNum-newDigit2)/10;\\r\\n console.log(i);\\r\\n }\\r\\n }\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55c3894e44ba6bfbf63e9ad7d242165b\",\n \"score\": \"0.61885315\",\n \"text\": \"function staircase(n) {\\n // for (let i = 1; i <= n; i++) {\\n // let col = i;\\n // for (let j = 1; j <= n - col; j++) {\\n // process.stdout.write(' ');\\n // }\\n // for (let j = 1; j <= col; j++) {\\n // process.stdout.write('#');\\n // }\\n // process.stdout.write('\\\\n');\\n // }\\n\\n let separator = '';\\n for (let i = 1; i <= n; i++) {\\n separator += ' '.repeat(n - i) + '#'.repeat(i) + '\\\\n';\\n }\\n process.stdout.write(separator)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ee6194ece14e3025a85a40294bca7dc\",\n \"score\": \"0.6160992\",\n \"text\": \"function staircase(num) {\\n for (let i=1; i <= num; i++) {\\n let spaces = num - i\\n console.log(\\\" \\\".repeat(spaces) + \\\"#\\\".repeat(i))\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b70a02425e2cb4db72d65fd3b3779033\",\n \"score\": \"0.61482483\",\n \"text\": \"function substituir(n1) {\\n let numeros = n1.split('');\\n var result = [numeros[0]];\\n\\n for (let j = 1; j < numeros.length - 1; j++) {\\n const element = numeros[j];\\n if (parseInt(numeros[j-1]) % 2 === 0 && parseInt((numeros[j])) % 2 === 0) {\\n result.push('-',numeros[j]);\\n console.log(result);\\n\\n }\\n else if (parseInt(numeros[j-1]) % 2 !== 0 && parseInt((numeros[j])) % 2 !== 0) {\\n result.push('#',numeros[j]);\\n console.log(result);\\n }\\n else {\\n result.push(numeros[j]);\\n }\\n }\\n\\n if (parseInt(numeros[numeros.length - 2]) % 2 === 0 && parseInt((numeros[numeros.length - 1])) % 2 === 0) {\\n result.push('-', numeros[numeros.length - 1]);\\n console.log(result);\\n\\n }\\n if (parseInt(numeros[numeros.length - 2]) % 2 !== 0 && parseInt((numeros[numeros.length - 1])) % 2 !== 0) {\\n result.push('#', numeros[numeros.length - 1]);\\n }\\n\\n\\n\\n return result.join('');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c77b1a8d320ce48ca57a2cb59e7157d\",\n \"score\": \"0.613908\",\n \"text\": \"function displayHyphen() {\\n var hyphen = \\\"\\\";\\n for (var i = 0; i < 56; i++) {\\n hyphen += \\\"*\\\";\\n }\\n return console.log(hyphen);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e096fa17b41d531e4853d9e95daec8c\",\n \"score\": \"0.6115568\",\n \"text\": \"function staircase(n) {\\n\\tfor (let i = 1; i <= n; i++) {\\n\\t\\tconsole.log('#'.repeat(i).padStart(n, ' '))\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bc6016dcbe23118a308972774bb7b32\",\n \"score\": \"0.6101854\",\n \"text\": \"function staircase(n) {\\n\\tfor (let i = 0; i < n; i++) {\\n\\t\\tfor (let j = 0; j < n - i - 1; j++) {\\n\\t\\t\\tprocess.stdout.write(' ');\\n\\t\\t}\\n\\t\\tfor (let j = n - i - 1; j < n; j++) {\\n\\t\\t\\tprocess.stdout.write('#');\\n\\t\\t}\\n\\t\\tprocess.stdout.write('\\\\n');\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa95ad5a2e0f216cd92e634f407287b8\",\n \"score\": \"0.60825264\",\n \"text\": \"function createDash(wordToGuess) {\\n document.getElementById(\\\"dash\\\").innerHTML = \\\"\\\";\\n for (let i = 0; i < wordToGuess.length; i++) {\\n wordDashes[i] = \\\"- \\\";\\n document.getElementById(\\\"dash\\\").innerHTML += wordDashes[i];\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65a7cbe7868c46908ae2fc347434a876\",\n \"score\": \"0.60816646\",\n \"text\": \"function staircase(n) {\\n let star = '';\\n let spaces = '';\\n for (let i = 0; i < n; i++) {\\n for (let j = 0; j < n-i-1; j++)\\n spaces += ' ';\\n star += '#';\\n process.stdout.write(spaces + star);\\n spaces = '';\\n if (i != n-1)\\n process.stdout.write(\\\"\\\\n\\\");\\n }\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3741019adb130bee1219dafdbd85672\",\n \"score\": \"0.6053355\",\n \"text\": \"function EvenOdd(number)\\n{\\n if(!Number.isInteger(number))\\n {\\n return \\\"Not a valid number\\\";\\n }\\n if(number == 0)\\n {\\n return \\\"Even\\\";\\n }\\n else if (number == 1)\\n {\\n return \\\"Odd\\\";\\n }\\n else\\n {\\n return(EvenOdd(number - 2));\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08cbce89810adbaf9a59fc04e65521cc\",\n \"score\": \"0.6021206\",\n \"text\": \"function evenOdd(number){\\n if( number % 2 === 0){\\n return \\\"even\\\";\\n } else {\\n return \\\"odd\\\";\\n } \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"639767da7024e62bf80ecb1323f28693\",\n \"score\": \"0.6020397\",\n \"text\": \"function dashNumber(number) {\\n const numberAsArray = number.toString().split();\\n return numberAsArray.join('-');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fad457565a0191b45745a7554ec9bbc5\",\n \"score\": \"0.6008995\",\n \"text\": \"function Even() {\\n for (var i = 0; i <=10; i++){ // \\n if ((i % 2) == 0) // if remainder of i % 2 = 0 then its even\\n console.log(i + \\\" Even \\\\n\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e25b7363ced44ae58a5b0fed04e8216c\",\n \"score\": \"0.6006857\",\n \"text\": \"function showNumber(input) {\\n for (let i = 1; i <= input; i++) {\\n if (i % 2 !== 0) {\\n console.log(i + ' Odd');\\n } else {\\n console.log(i + ' Even')\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fdd85b11c6d43d1305d24ca7a2d1d3d\",\n \"score\": \"0.5938005\",\n \"text\": \"function staircase(n) {\\n let hash = \\\"#\\\";\\n let space = \\\" \\\";\\n let x = n - 1;\\n let y = n - (n - 1);\\n for (let i = 0; i < n; i++) {\\n console.log(`${space.repeat(x)}${hash.repeat(y)}`);\\n x -= 1;\\n y += 1;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81c48d4dbbeba557ac80e30ddcdd0ab5\",\n \"score\": \"0.59184766\",\n \"text\": \"function two(n) {\\n var s = '00' + n;\\n return s.slice(-2);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3934323ac662fb44d139c0df6d2a0920\",\n \"score\": \"0.59183526\",\n \"text\": \"function evenOdd(num) {\\n if (num % 2 === 0) {\\n return \\\"even\\\";\\n } else return \\\"odd\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de1870542f897c7c2c8a18ad512d0b26\",\n \"score\": \"0.58929354\",\n \"text\": \"function oddOrEvenString(num){\\n if (num.length %2== 0)\\n return \\\"This string length is TOTALLY even! ..\\\";\\n else (num.length % 1== 0)\\n return \\\"This string's length is odd\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b135c0b8c197c142fc4d08123ef957c2\",\n \"score\": \"0.58721966\",\n \"text\": \"function evenMultiplyTable() {\\n for (let i = 0; i < 10; i++ ) {\\n \\tlet lines = `${i} `;\\n \\tfor (let j = 1; j < 10; j++) {\\n \\t\\tif (i === 0) {\\n \\t\\t\\tlines += `${j} `;\\n \\t\\t} else if ((i * j)%2 === 0) {\\n \\t\\t\\tlines += \\\"+ \\\";\\n \\t\\t} else {\\n \\t\\t\\tlines += \\\"- \\\";\\n \\t\\t}\\n \\t}\\n \\tconsole.log(lines);\\n \\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3e18626f124bfeb135ae88f90229c1d\",\n \"score\": \"0.5863893\",\n \"text\": \"function oddOrEvenString (myString){\\n if (myString.length %2==0){\\n console.log (\\\"This String is TOTALLY Even\\\");\\n}else { if (myString.length%2 != 0)\\nconsole.log (\\\" This is Odd \\\");\\n}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1f73bf1d95decea3cad40f37229ca37\",\n \"score\": \"0.5841992\",\n \"text\": \"function staircase(n) {\\n for (let x = 1; x <= n; x++) {\\n let stair = \\\" \\\".repeat(n - x) + \\\"#\\\".repeat(x);\\n console.log(stair);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd3399d17e73324ab0b147c2ce06d65c\",\n \"score\": \"0.5832901\",\n \"text\": \"function siftEvenOddChars(str) {\\n let even = '';\\n let odd = '';\\n\\n for (let i = 0; i < str.length; i++) {\\n const char = str.charAt(i);\\n\\n if (isEven(i)) {\\n even += char;\\n } else {\\n odd += char;\\n }\\n }\\n\\n console.log(even, odd);\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4cf4698b22074db9c1b2d2dc5f5fd7fc\",\n \"score\": \"0.5828755\",\n \"text\": \"function evenOrOdd(n) {\\n if (parseInt(n) % 2 === 0) {\\n return 'even';\\n } else {\\n return 'odd';\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"332430e971cd71c099d003bcfae31206\",\n \"score\": \"0.5824486\",\n \"text\": \"function staircase(n) {\\n let spaces = \\\" \\\".repeat(n - 1);\\n let symbol = \\\"#\\\";\\n for (let i = 1; i <= n; i++) {\\n console.log(`${spaces}${symbol}`);\\n spaces = spaces.slice(0, spaces.length - 1);\\n symbol += \\\"#\\\";\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecf7638131a6b339ebfe241697e8a656\",\n \"score\": \"0.5818134\",\n \"text\": \"function oddEven(numb) {\\n if(numb % 2 == 0) {\\n return \\\"Even\\\"\\n }\\n else {\\n return \\\"Odd\\\"\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"742afe90ebf8549d844b87b68d95cee4\",\n \"score\": \"0.58121353\",\n \"text\": \"function evenorodd(num){\\r\\n if(num%2 == 0){\\r\\n return \\\"even\\\";\\r\\n }\\r\\n else{\\r\\n return \\\"odd\\\";\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df5818dc7df46b99aa22cfc10e584ad8\",\n \"score\": \"0.58096945\",\n \"text\": \"function staircase(n) {\\n var line = Array(n + 1).fill(' ');\\n line[n] = '\\\\n';\\n for (var i = n - 1; i >= 0; i--) {\\n line[i] = '#';\\n process.stdout.write(line.join(''));\\n }\\n\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bef4c831668dcd2fdb575c48ec9346d7\",\n \"score\": \"0.58072\",\n \"text\": \"function OddEven(a) {\\n if(a >= 0) {\\n if( (a % 2) == 0) {\\n console.log(\\\"even\\\");\\n }\\n else {\\n console.log(\\\"odd\\\");\\n }\\n }\\n else\\n console.log(\\\"invalid:negative no.\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d046f03d498f5050af7b7169b1bd2c8\",\n \"score\": \"0.5799183\",\n \"text\": \"function convertNumberToLine() {\\n var tossOutcome = tossResult();\\n\\n if (tossOutcome % 2 === 0) {\\n return (\\\"____ ____ even \\\");\\n } else {\\n return (\\\"___________ odd \\\");\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c82a799d8dc2e22bff866f0078046d1e\",\n \"score\": \"0.5797775\",\n \"text\": \"function staircase(n) {\\n let hashes = ''\\n let result = ''\\n for (let i = 1; i <= n; i++) { \\n hashes += '#'\\n // concat n - i amount of spaces\\n let spaces = \\\" \\\".repeat(n - i)\\n // add another line of correct amount of spaces and hashes\\n result += spaces + hashes + \\\"\\\\n\\\"\\n }\\n console.log(result)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7912ce6e4a127d094a40c1b8fdfc8aa4\",\n \"score\": \"0.57885814\",\n \"text\": \"function doDashes2(str) {\\n return replaceNonChar(str, '-');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0371e637740464544f974e85cc8bce5\",\n \"score\": \"0.57802844\",\n \"text\": \"function staircase(n) {\\n var space = \\\" \\\";\\n var pound = \\\"#\\\";\\n for (var i = 1; i <= n; i++) {\\n while (i <=n) {\\n return space.repeat(n-i) + pound.repeat(i);\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26d4f4592ad87ca5dd0f79016774d0a7\",\n \"score\": \"0.5777767\",\n \"text\": \"function staircase(n) {\\n for(var i = 1; i <= n; i++){\\n var diff = n - i;\\n var row = \\\" \\\".repeat(diff) + '#'.repeat(i);\\n console.log(row);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7455f8145bd83d1de052cc546a7ed07e\",\n \"score\": \"0.57728046\",\n \"text\": \"function oddEven(num) {\\n if (num % 2 === 0) {\\n return (num + \\\" is an even number.\\\")\\n } else {\\n return (num + \\\" is an odd number.\\\")\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"809a7ef5499d95ef522bed8df2d5310e\",\n \"score\": \"0.576709\",\n \"text\": \"function forst(st2){\\n for ( let i =0 ; i <10;i++){\\n document.write ( st2 + \\\"-\\\")\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46f831885f3167078c1ff48904125363\",\n \"score\": \"0.5753866\",\n \"text\": \"function getDisplay(word)\\r\\n{ \\r\\n var dashes = '';\\r\\n for (var i=0; i<word.length; i++){\\r\\n dashes += '-';\\r\\n }\\r\\n \\r\\n return dashes;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bbf5dff7d6ca5bce3b8d88c9406840e8\",\n \"score\": \"0.5752014\",\n \"text\": \"function even_or_odd(number) {\\n if (number % 2 == 0)\\n return \\\"Even\\\";\\n return \\\"Odd\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27a83ad849645232a71c65f01577e82d\",\n \"score\": \"0.57514924\",\n \"text\": \"prependSpaceIfLengthIsEven($ascii_number, $length) {\\n if (this.isOdd($length)) {\\n return ` ${$ascii_number}`;\\n }\\n\\n return $ascii_number;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b443b5bdcd6c54dd508a592565167fef\",\n \"score\": \"0.5749132\",\n \"text\": \"function oddEven()\\r\\n{\\r\\n \\r\\n \\r\\n for(i=0;i<=15;i++)\\r\\n {\\r\\n if(i==0)\\r\\n {\\r\\n console.log(i+\\\" even\\\");\\r\\n document.getElementById(\\\"output5\\\").innerHTML+=i+\\\" is\\\"+\\\" Even\\\"+'<br>';\\r\\n \\r\\n }\\r\\n else if(i%2==0)\\r\\n {\\r\\n console.log(i+\\\" Even\\\");\\r\\n document.getElementById(\\\"output5\\\").innerHTML+=i+\\\" is\\\"+\\\" Even\\\"+\\\"<br>\\\";\\r\\n \\r\\n }\\r\\n else\\r\\n {\\r\\n console.log(i+\\\" odd\\\");\\r\\n document.getElementById(\\\"output5\\\").innerHTML+=i+\\\" is\\\"+\\\" Odd\\\"+\\\"<br>\\\";\\r\\n \\r\\n }\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4aa5d9c3b1ff9dcaf31432aadc07d1e3\",\n \"score\": \"0.57444686\",\n \"text\": \"function oddEven(d){\\nif(d/2 !==0 ){\\n console.log(d+' '+'is odd');\\n}else{\\n console.log(d+' '+'is even');\\n}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c75c4be1ba69e74568197a49b6b8f2b5\",\n \"score\": \"0.5740021\",\n \"text\": \"function evenDigitsOnly(n) {\\n return String(n).split(\\\"\\\").every(x=>x%2===0)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"596dd82ffc9498176a00345a9f2f219b\",\n \"score\": \"0.57398826\",\n \"text\": \"function square(number){\\r\\n var specialChar = \\\"#\\\"\\r\\n if(number > 0){\\r\\n for(var i = 1; i <= number; i++){\\r\\n console.log(specialChar.repeat(i));\\r\\n }\\r\\n\\r\\n }else if(number < 0){\\r\\n number = number*(-1)\\r\\n for(var i = number; i >= 0; i--){\\r\\n console.log(specialChar.repeat(i));\\r\\n }\\r\\n }\\r\\n \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a57b79bda3286a85d252bb2763c8a38b\",\n \"score\": \"0.5725356\",\n \"text\": \"function Even(){ \\r\\n for( i=1; i<=200; i++){ \\r\\n x = i % 2; \\r\\n if(x == 0){ \\r\\n document.write(i + \\\"<br>\\\"); \\r\\n console.log(i); \\r\\n } \\r\\n } \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6eea9139c0ff647d9d130f796cbafc3e\",\n \"score\": \"0.5719841\",\n \"text\": \"static twoDigitInt(number){\\n return `${(\\\"0\\\" + number).slice(-2)}`;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"411b9294b97a4b004d79be12caa07bc0\",\n \"score\": \"0.5718074\",\n \"text\": \"function calculateEvens(startNum, endNum, step) { \\n var output = \\\"\\\\n\\\";\\n for (var i = startNum; i < endNum; i += step) {\\n if (i % 2 == 0) {\\n output += i; //ig js auto converts i to a string???\\n output += \\\"\\\\n\\\";\\n }\\n }\\n return output; \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46a8b7ec3b9c29f0496a5b1e5820b012\",\n \"score\": \"0.5702626\",\n \"text\": \"function iseven(n){\\n\\twhile(n >=0){\\n\\t\\tif(n === 0){\\n \\treturn \\\"Even\\\";\\n }\\n n=n-2;\\n }\\n return \\\"odd\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a28158b9629e0fd0e9c3d0deb6c74f75\",\n \"score\": \"0.5694767\",\n \"text\": \"function front_times (string, int){\\n var output = string.substring(0,3);\\n var outputTwo = string.substring(0,3);\\n if (int == 0){\\n return false;\\n } else {\\n for (var i = 1; i < int; i ++){\\n output+=outputTwo;\\n }\\n }\\n return output;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fca35c41edc645ea30ca199b141caf5\",\n \"score\": \"0.56895006\",\n \"text\": \"function even_or_odd(number) {\\n if (number % 2 === 0) {\\n return \\\"Even\\\"\\n } else {\\n return \\\"Odd\\\"\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ddfad97972d43b1299dada58766949d\",\n \"score\": \"0.56818503\",\n \"text\": \"function makeDash(word) {\\r\\n dashArray = [];\\r\\n for (var i = 0; i < word.length; i++) {\\r\\n dashArray.push(\\\"_\\\");\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d156be729177fc74a1422e1d0d08021\",\n \"score\": \"0.56745356\",\n \"text\": \"function dashify(str){\\n return str.replace(/([a-z])([A-Z])/g, \\\"$1-$2\\\").toLowerCase();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a014ad0fe6d8c9b106cca0fd27e737c\",\n \"score\": \"0.5668239\",\n \"text\": \"function staircase(n) {\\n\\tvar line = Array(n + 1).fill(\\\" \\\");\\n\\tline[n] = \\\"\\\\n\\\";\\n\\tfor (var i = n - 1; i >= 0; i--) {\\n\\t\\tline[i] = \\\"#\\\";\\n\\t\\tprocess.stdout.write(line.join(\\\"\\\"));\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49963ee1406088734a6c1aaccfc4ef57\",\n \"score\": \"0.56681174\",\n \"text\": \"function makeIntoDashes(word) {\\n\\tvar dashes = \\\"\\\";\\n\\tfor (i = 0; i < word.length - 1; i++) {\\n\\t\\tdashes += \\\"_ \\\";\\n\\t}\\n\\tdashes += \\\"_\\\";\\n\\treturn dashes;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fdf369524085d12f43604241fbf6f7b\",\n \"score\": \"0.5666551\",\n \"text\": \"function aa(n){\\r\\n var a=1\\r\\n for(var i=1;i<=n;i++){\\r\\n var str=\\\"\\\"\\r\\n for(var j=i;j>=1;j--){\\r\\n str=str+(j%2)\\r\\n \\r\\n }\\r\\n console.log(str)\\r\\n }\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5160854e8bbe62fb8d292647935b576\",\n \"score\": \"0.56650484\",\n \"text\": \"function weave(a_string, a_num) {\\n let new_string = \\\"\\\";\\n for (let i = 0; i < a_string.length; i++) {\\n //take into account zero index and treat as one index\\n if ((i + 1) % a_num === 0) {\\n new_string = new_string + 'x';\\n } else {\\n new_string = new_string + a_string.charAt(i);\\n }\\n } //end of for loop\\n return new_string;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cda9385dc7bc233f7da33d6e8284087c\",\n \"score\": \"0.5660958\",\n \"text\": \"function stairCase(num){\\n var test = \\\"#\\\";\\n for(var i = 1; i <= num; i++){\\n var string = test.repeat(i);\\n console.log(string);\\n }\\n // return string;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"285984e9e31d04b7f8ec089e6e7469b1\",\n \"score\": \"0.564807\",\n \"text\": \"function isEven(str){\\n\\treturn str.length % 2 === 0; \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95b52158aa78d2c174725ea5c1efe5f0\",\n \"score\": \"0.56403625\",\n \"text\": \"function main (n) {\\n for (let i = n - 1; i >= 0; i--) {\\n console.log(' '.repeat(i).padEnd(n, '#'))\\n }\\n return ''\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4782c483eec887b2f727e72a6b015ee2\",\n \"score\": \"0.5638466\",\n \"text\": \"function staircase(n) {\\n let result = '';\\n let x = n-1;\\n for(let i = 0; i < n; i++) {\\n for( let j = 0; j < n; j++) {\\n (j >= x) ? result += '#' : result += ' '; \\n }\\n x--;\\n result += '\\\\n'\\n }\\n console.log(result);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a860ef98168c79be89eeca9e7b47e47\",\n \"score\": \"0.56341463\",\n \"text\": \"function fixTrytes(input){\\n return input.length % 2 ? input + '9' : input;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1bf6dc007e0be30edece6b21761b0ae0\",\n \"score\": \"0.56331223\",\n \"text\": \"function isEven(number) {\\n if (number % 2 == 0) {\\n console.log(\\\"EVEN\\\")\\n }\\n else {\\n console.log(\\\"ODD\\\")\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d193559e8db4495203bf998707d4d4e\",\n \"score\": \"0.5632401\",\n \"text\": \"function twoDigits(number) {\\r\\n\\tvar ddnum = \\\"\\\";\\r\\n\\tddnum = (\\\"00\\\" + number).slice(-2);\\r\\n\\tconsole.log(ddnum);\\r\\n\\treturn ddnum\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18869ee54aef6b8754be45e83686dfc6\",\n \"score\": \"0.56296283\",\n \"text\": \"function isEven(num) {\\n //WRITE YOUR CODE BETWEEN THIS LINE: ↓ ↓ ↓ ↓\\n if (num % 2 == 0) {\\n return 'even';\\n } else {\\n }\\n //AND THIS LINE ↑↑↑↑↑\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b30544170c881a5806846c43cb58ee37\",\n \"score\": \"0.56232876\",\n \"text\": \"function oddNumsToN(n) {\\n for (let i = 1; i <= n; i += 2) {\\n if (i % 2 !== 0) {\\n console.log(i);\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9f3445a7c08003cb972f48c0b7413c7\",\n \"score\": \"0.5617606\",\n \"text\": \"function isEven(num){\\r\\n if(num %2 ==0){\\r\\n return \\\"this number is even\\\";\\r\\n }else {\\r\\n return \\\"this number is odd\\\";\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c26b53f17b8e082be23e7f1dfd9397e1\",\n \"score\": \"0.5615802\",\n \"text\": \"_2digit(n) {\\n return ('00' + n).slice(-2);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c26b53f17b8e082be23e7f1dfd9397e1\",\n \"score\": \"0.5615802\",\n \"text\": \"_2digit(n) {\\n return ('00' + n).slice(-2);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c26b53f17b8e082be23e7f1dfd9397e1\",\n \"score\": \"0.5615802\",\n \"text\": \"_2digit(n) {\\n return ('00' + n).slice(-2);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"462196a18c0f55753dcb4e98e162c347\",\n \"score\": \"0.56097615\",\n \"text\": \"function evenNumber(number,callback){ \\n if(number%2===0)\\n result=\\\"even\\\";\\n else\\n result=\\\"odd\\\";\\n callback(); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"308a7afeaf838fc048197fa1f11f0cf9\",\n \"score\": \"0.56046474\",\n \"text\": \"function even_or_odd(number) {\\n return number % 2 ? \\\"Odd\\\" : \\\"Even\\\"\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a873836a13ae053995550047c77058\",\n \"score\": \"0.56016713\",\n \"text\": \"function isEven(number) {\\n if (number %2) {\\n console.log(\\\"This number is Odd\\\");\\n }\\n else {\\n console.log(\\\"This number is Even\\\");\\n }\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2786eaeee606ef8b337780b2d1bec75b\",\n \"score\": \"0.5598078\",\n \"text\": \"function isEven(num) {\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8b63d48e19daecc34686b66fb471691\",\n \"score\": \"0.5577436\",\n \"text\": \"function two(x) {\\r\\n var d = '00' + x\\r\\n return d.substr(d.length - 2)\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a1cdf71120ef3fcaae1d711d917fe85\",\n \"score\": \"0.5573504\",\n \"text\": \"function isEven(number) {\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fb2d5839c091af0ef53d20606119999\",\n \"score\": \"0.5573206\",\n \"text\": \"function staircase(n) {\\n // Write your code here\\n let stairs = '#'\\n let spaces = Array(n).join(' ')\\n for (let i=0; i < n; i++) {\\n console.log(spaces + stairs)\\n stairs += '#'\\n spaces = Array(n - 1 - i).join(' ')\\n }\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b052f9ee138d5ee34c6cb72c1057a3bd\",\n \"score\": \"0.55671054\",\n \"text\": \"function odd(a) {\\n var res = ''\\n if (a % 2 === 0) {\\n res = 'the number ' + a + ' is even'\\n } else {\\n res = 'the number ' + a + ' is odd'\\n }\\n\\n return res\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b508084e58894cc76801f2301b8be887\",\n \"score\": \"0.55608845\",\n \"text\": \"function removeEvenCharacters(string) {\\n\\n let mystring='';\\n\\tif(string === undefined){\\n\\t\\treturn \\\"missing argument\\\";\\n\\t} else if(typeof string !=='string'){\\n\\t\\treturn \\\"argument not string\\\";\\n\\t}\\n for (let i = 0; i < string.length; i++) {\\n if (i % 2 !== 0) {\\n mystring+=string[i];\\n\\t}\\n }\\n return mystring;\\n console.log(mystring);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"399f18c2a602c9aa7984612291ee78ec\",\n \"score\": \"0.5560222\",\n \"text\": \"function padToEven(a) {\\n return a.length % 2 ? \\\"0\\\" + a : a;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"399f18c2a602c9aa7984612291ee78ec\",\n \"score\": \"0.5560222\",\n \"text\": \"function padToEven(a) {\\n return a.length % 2 ? \\\"0\\\" + a : a;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"399f18c2a602c9aa7984612291ee78ec\",\n \"score\": \"0.5560222\",\n \"text\": \"function padToEven(a) {\\n return a.length % 2 ? \\\"0\\\" + a : a;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"399f18c2a602c9aa7984612291ee78ec\",\n \"score\": \"0.5560222\",\n \"text\": \"function padToEven(a) {\\n return a.length % 2 ? \\\"0\\\" + a : a;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"399f18c2a602c9aa7984612291ee78ec\",\n \"score\": \"0.5560222\",\n \"text\": \"function padToEven(a) {\\n return a.length % 2 ? \\\"0\\\" + a : a;\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":81,"cells":{"query_id":{"kind":"string","value":"e2b3b020f10ed3c7c9cbe9c3e5b32c72"},"query":{"kind":"string","value":"common function used for validation"},"positive_passages":{"kind":"list like","value":[{"docid":"027f7bc4f80cebc808d2cc79e7b51aa7","score":"0.0","text":"function validateCourse(course){\n const schema = {\n name: Joi.string().min(3).required()\n };\n return Joi.validate(course, schema);\n}","title":""}],"string":"[\n {\n \"docid\": \"027f7bc4f80cebc808d2cc79e7b51aa7\",\n \"score\": \"0.0\",\n \"text\": \"function validateCourse(course){\\n const schema = {\\n name: Joi.string().min(3).required()\\n };\\n return Joi.validate(course, schema);\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"c0a7655d0d51c9ae8ba639759bd33757","score":"0.7258242","text":"validate() {\n\n }","title":""},{"docid":"12d273ab92672cff7df1171f15f8ac3d","score":"0.7239957","text":"validate(_value, _utils) {\n return false;\n }","title":""},{"docid":"ad9c3a6f8bd76588ccfb525877d50997","score":"0.7189689","text":"validationWithParams () {}","title":""},{"docid":"e215ebc6bef72574db4496488ab0c7dd","score":"0.71617365","text":"validate() {\n }","title":""},{"docid":"189c2c76d7d3dea4cff1b8764827f292","score":"0.70162266","text":"function ValidationHelper() {\n}","title":""},{"docid":"4bea808e8d14a3c34e96c31108eae632","score":"0.6966872","text":"isValid(){ /** todo */ }","title":""},{"docid":"1c1447cc5e55e7d340900f1f55f12b14","score":"0.68849194","text":"setupValidations() {}","title":""},{"docid":"951515dc2f0d6703df9089ecf7439103","score":"0.688399","text":"static validate(params)\n {\n //signature of each paramater\n const keys = [\n {\n name : \"username\",\n type : \"string\",\n check : (val)=>{\n const MIN_USERNAME_LEN = 3;\n const MAX_USERNAME_LEN = 20;\n\n return (\n val.match(/^[A-Za-z0-9_]+$/g) != null &&\n val.length > MIN_USERNAME_LEN &&\n val.length < MAX_USERNAME_LEN\n );\n }\n },\n {\n name : \"avatar\",\n type : \"string\"\n },\n {\n name : \"dob\",\n type : \"number\",\n check : (val) => {\n const MS_IN_YEAR = 31536000000;\n const MIN_AGE = 13;\n const maxDate = Date.now() - (MS_IN_YEAR * MIN_AGE);\n return (val <= maxDate);\n }\n },\n {\n name : \"token\",\n type : \"string\"\n },\n {\n name : \"email\",\n type : \"string\",\n check : (val) => {\n let match = val.match(/\\S+@\\S+\\.\\S+/);\n return !(match === null || match[0] !== match.input);\n }\n },\n {\n name : \"country\",\n type : \"string\",\n check : (val) => {\n return (val.length === 2);\n }\n }\n ];\n\n return Validation.checkParams(params, keys);\n }","title":""},{"docid":"dfad416da9750afdda11552613b6cfa8","score":"0.6813194","text":"function validData() {\n //\n}","title":""},{"docid":"f60141eb38ac7bedd96622a3d6965be6","score":"0.6794226","text":"validationNot () {}","title":""},{"docid":"118713d337b8367b96d2102a48747f67","score":"0.6764349","text":"validationAnd () {}","title":""},{"docid":"ee27ac5a3f06033f7e91ed7cf699e90d","score":"0.6717506","text":"function Validation() {\n}","title":""},{"docid":"f034af7e0b36db75f05815c5266e1bb5","score":"0.67085576","text":"function validate (){\n\t return true;\n }","title":""},{"docid":"cadc118349ffaca108cdec6cb9da0b67","score":"0.6680783","text":"function validatedata(dname,x_elements,y_elements){\r\n \tvar newdata_value=x_elements;\r\n switch(y_elements){\r\n \t\t case 'required':\r\n\t\t\t if(newdata_value == \"\" || newdata_value == null || newdata_value.length==0 )\r\n\t\t\t{ \r\n\t\t\t\t\r\n\t\t\t\t \r\n\t\t\t \tmyApp.alert(capitalize(dname)+': This is required field','Error Message!');\r\n\t\t\t return false;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\t\tcase 'number':\r\n\t\t\t if(valueIsNaN(newdata_value) || newdata_value == \"\" || newdata_value == null || newdata_value.length==0){\r\n\t\t\t \t myApp.alert(capitalize(dname)+': Please Enter Numaric value.','Error Message!');\r\n\t\t\t return false;\r\n\t\t }\r\n\t\t break;\r\n\t\t case 'email':\r\n\t\t\t\t if(check_email(newdata_value)==false){\r\n\t\t\t\t \tmyApp.alert(capitalize(dname)+': Please Enter Valid Email Address','Error Message!');\r\n\t\t\t\t\t return false;\r\n\t\t\t\t }\r\n\t\t\tbreak;\r\n\t\t\tcase 'phone':\r\n\t\t\t\t if(phonenumber(newdata_value)==false){\r\n\t\t\t\t \t myApp.alert(capitalize(dname)+': Please Enter Valid Phone Number','Error Message!');\r\n\t\t\t\t return false;\r\n\t\t\t\t } \r\n\t\t break;\r\n\t\t\t\r\n\t\t\tdefault:\r\n\t \r\n\t if(y_elements!=null){\r\n\t \t var newdata=y_elements.split(',');\r\n for (var k=0; k < newdata.length; k++){\r\n\t\t \r\n\t\t if(validatedata(x_elements,newdata[k])===false){\r\n\t\t \r\n\t \t\t break;\r\n\t \t }\r\n\t\t \r\n\t\t \r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t\r\n\t\t}\r\n }","title":""},{"docid":"de48b3dc6ef83d8959ec7136c73d0942","score":"0.6680593","text":"validate () {\n let { type, required, minLength, maxLength } = this.props\n let { value } = this.state\n let isValid = !(required || minLength)\n let errorText = ''\n if (value === null && required) {\n isValid = validator.isLength(String(value), { min: minLength })\n errorText = ERROR_TXT.REQUIRED\n }\n if (required) {\n if (type === 'number') {\n isValid = !isNaN(value) && value !== ''\n } else {\n isValid = !validator.isEmpty(value)\n }\n errorText = isValid ? '' : ERROR_TXT.REQUIRED\n }\n // Check also for validity in the next validations\n // Prevents from passing validation if a previous condition decided it was invalid\n if (isValid) {\n if (type === 'email') {\n isValid = validator.isEmail(value)\n errorText = errorText || ERROR_TXT.EMAIL\n }\n if (minLength) {\n isValid = validator.isLength(String(value), { min: minLength })\n errorText =\n errorText || `El campo debe contener al menos ${minLength} caracteres`\n }\n if (maxLength) {\n isValid = validator.isLength(String(value), { max: maxLength })\n errorText =\n errorText || `El campo debe contener máximo ${maxLength} caracteres`\n }\n }\n this.setState({ isValid, errorText })\n return isValid\n }","title":""},{"docid":"cd82159a10bea4b0081e8c4f9c382760","score":"0.66689974","text":"is_valid() {\n\n /**\n * validates , list for validate function\n * value, control value\n * error_message,errorMessage, error message, error_message for old version\n */\n const { \n validates,\n value,\n errorMessages,\n errorMessage,\n error_message } = this.props;\n\n /**\n * Empty error list before check\n */\n this.error_list = [];\n\n /**\n * check validation\n */\n _.forEach(validates, func => {\n if (_.functions(func)) {\n const message = func(value);\n if (message) {\n\n /**\n * get error message\n */\n let error_mgs = '';\n\n /// gets errors message from error messages list\n if (errorMessages && message.type && errorMessages[message.type]) {\n error_mgs = errorMessages[message.type];\n\n /**\n * if message is a object like { message: '' }\n */\n } else if (message.message) {\n error_mgs = message.message;\n } else {\n error_mgs = message || errorMessage || error_message;\n }\n\n this.error_list.push(error_mgs);\n }\n }\n });\n\n return this.error_list.length === 0;\n }","title":""},{"docid":"57ffc64f68b4ba047494980cfc3ba8e9","score":"0.6658826","text":"function validateAllInputFields()\n{\n validatePizzaRating();\n validatePriceRating();\n validateCustomerName();\n validateCustomerEmail();\n validateSuggestions();\n}","title":""},{"docid":"24f84e34d3f31014bd29361bb9218b96","score":"0.6656762","text":"_validateFoodProvided(foodProvidedValue){\n\n let isValid;\n // Validate for Empty Field\n this._isFoodProvidedValid = isValid = this._validateForEmptyField(foodProvidedValue);\n \n return isValid\n\n }","title":""},{"docid":"a26658449b34ebde255e1f21c4d8ce43","score":"0.66069144","text":"function validate_form(){\n return validate_name() && validate_number() && validate_email();\n}","title":""},{"docid":"819daa2bf8208a2e7925c948f6827a3c","score":"0.65907013","text":"validate() {\n\t\t\n\t\tconst valid = (\n\t\t\tvalidateName('firstName', this.state.firstName, (name, val, msg) => this.setError(val, msg)) &&\n\t\t\tvalidateName('lastName',this.state.lastName, (name, val, msg) => this.setError(val, msg)) &&\n\t\t\tvalidateHCN('HCN', this.state.HCN, (name, val, msg) => this.setError(val, msg)) &&\n\t\t\tvalidateEmail('email', this.state.email, (name, val, msg) => this.setError(val, msg)) &&\n\t\t\tvalidateAddress('address', this.state.address, (name, val, msg) => this.setError(val, msg)) &&\n\t\t\tvalidatePostalCode('postalCode', this.state.postalCode, (name, val, msg) => this.setError(val, msg)) &&\n\t\t\tvalidateDoctorID('doctorID', this.state.doctorID, (name, val, msg) => this.setError(val, msg)) \n\t\t);\n\t\t\n\t\treturn valid;\n\t}","title":""},{"docid":"3f2ed77ce9b3510f15b9deb22e92307c","score":"0.6589136","text":"validationOr () {}","title":""},{"docid":"4863072784c335abadcacad132025291","score":"0.65698695","text":"_validate() {\n let validators = [];\n if(this.props.required && !this.props.value) {\n return 'This field is required.';\n }\n\n return run_validators(validators, this.props.value);\n }","title":""},{"docid":"7a7ed39289a21c76f524fa5df83087a0","score":"0.65338117","text":"function checkAllInputFields()\n{\n // Variable names must be different from function names :-(\n isPizzaRatingValid = checkIfPizzaRatingIsValid();\n isPriceRatingValid = checkIfPriceRatingIsValid();\n isCustomerNameValid = checkIfCustomerNameIsValid();\n isCustomerEmailValid = checkIfCustomerEmailIsValid();\n areSuggestionsValid = checkIfSuggestionsAreValid();\n}","title":""},{"docid":"7b6c0b127e101e5836832bbe610c6fb5","score":"0.6529378","text":"validateRequired (inputs) {\n // define validation result\n const validations = [];\n // loop through data array\n for (let input of inputs) {\n if (input.type == 'string-number') {\n if (\n this.validation.isString (input.data) &&\n this.validation.notEmptyString (input.data)\n ) {\n // continue\n } else {\n if (Number.isNaN (input.data - input.data)) {\n let result = {\n message: input.message ||\n `${input.name} is required and should be string or number`,\n fieldName: input.name,\n };\n // push the result into validations array\n validations.push (result);\n }\n }\n }\n // check if type of input is string\n if (input.type == 'string') {\n if (\n this.validation.isString (input.data) &&\n this.validation.notEmptyString (input.data)\n ) {\n // continue\n } else {\n let result = {\n message: input.message ||\n `${input.name} is required and should be a valid ${input.type}`,\n fieldName: input.name,\n };\n validations.push (result);\n }\n }\n // method to check if the input is number\n if (input.type == 'number') {\n if (Number.isNaN (input.data - input.data)) {\n let result = {\n message: input.message ||\n `${input.name} is required and should be a valid ${input.type}`,\n fieldName: input.name,\n };\n // push the result into validations array\n validations.push (result);\n }\n }\n // check if type of input is object\n if (input.type == 'object') {\n if (\n this.validation.isObject (input.data) &&\n this.validation.notEmpty (input.data)\n ) {\n // continue\n } else {\n let result = {\n message: input.message ||\n `${input.name} is required and should be an ${input.type}`,\n fieldName: input.name,\n };\n validations.push (result);\n }\n }\n // check if the input is email\n if (input.type == 'email') {\n // continue\n if (\n this.validation.isString (input.data) &&\n this.validation.notEmptyString (input.data) &&\n this.validation.checkEmail (input.data)\n ) {\n // continue\n } else {\n let result = {\n message: input.message ||\n `${input.name} is required and should be a valid ${input.type}`,\n fieldName: input.name,\n };\n validations.push (result);\n }\n }\n // check if the input is phone number\n if (input.type == 'phone') {\n if (\n this.validation.isString (input.data) &&\n this.validation.notEmptyString (input.data) &&\n input.data.length == 11 &&\n input.data.startsWith ('0')\n ) {\n // continue\n } else {\n let result = {\n message: input.message ||\n `${input.name} is required and should be a valid ${input.type}, with 11 digit`,\n fieldName: input.name,\n };\n validations.push (result);\n }\n }\n // check if the type is file\n if (input.type == 'image') {\n // check if there are data\n if (!input.data) {\n // return error\n let result = {\n message: input.message ||\n `${input.name} is required and should be an ${input.type}`,\n fieldName: input.name,\n };\n // push validation errors into validations array\n validations.push (result);\n } else {\n // check if the mime type is image\n if (this.imagMimeTypes[input.data.mimetype]) {\n // continue\n } else {\n let result = {\n message: input.message ||\n `${input.name} should be an ${input.type}`,\n fieldName: input.name,\n };\n validations.push (result);\n }\n }\n }\n if (input.type == 'array') {\n if (Array.isArray (input.data) && input.data.length > 0) {\n // continue\n } else {\n let result = {\n message: input.message ||\n `${input.name} should be an ${input.type} and shouldn't be empty`,\n fieldName: input.name,\n };\n validations.push (result);\n }\n }\n // check the object has two properties\n if (input.type == 'object' && input.length == '>=2') {\n if (\n this.validation.isObject (input.data) &&\n this.validation.notEmpty (input.data) &&\n Object.keys (input.data).length >= 2\n ) {\n // continue\n } else {\n let result = {\n message: input.message ||\n `${input.name} should be an ${input.type} and shouldn't be empty`,\n fieldName: input.name,\n };\n validations.push (result);\n }\n }\n if (input.type == 'boolean') {\n if (input.data == true || input.data == false) {\n // continue\n } else {\n let result = {\n message: input.message || `${input.name} should be a ${input.type}`,\n fieldName: input.name,\n };\n validations.push (result);\n }\n }\n }\n // return validations array\n return validations;\n }","title":""},{"docid":"e22b9cab7a9a5ad877c9365acfc5e6cc","score":"0.65292364","text":"function MakeValidation() {\n vi=this;\n vi.nameToMsg = function(str) // converts lowercase, hyphen separated input name to space separated Word Capitalized\n {\n var splitStr = str.toLowerCase().split('-');\n for (var i = 0; i < splitStr.length; i++) {\n splitStr[i] = splitStr[i].charAt(0).toUpperCase() + splitStr[i].substring(1);\n }\n return splitStr.join(' ');\n };\n vi.validate = function (item,type) // this does the validation\n {\n var err = 0;\n var name = item.attr('name');\n var value = item.val();\n var msg = \"\";\n switch (type)\n {\n case 'required':\n if(value == '' || value === undefined) {\n err = 1;\n msg = vi.nameToMsg(name)+\" is a required field.\";\n }\n break;\n case 'phone-usa':\n if(!value.match(/^\\d\\d\\d\\-\\d\\d\\d-\\d\\d\\d\\d$/)) {\n err = 1;\n msg = \"Please enter a valid phone number\";\n }\n break;\n // Add more validation types below\n }\n if(err > 0){\n item.addClass('invalid');\n }\n $(\"#\"+name+\"-err-message\").text(msg);\n // console.log( name+' '+value+' '+type+((err != 0)?' ERROR':' OK') );\n return err;\n };\n vi.doValidation = function(item) {\n if(item.attr('validate') === undefined) return 0;\n var errors = 0;\n var err = 0;\n // the validation attribute is a comma separated list of validation types to apply to the input\n var validations = item.attr('validate').split(',');\n validations.forEach(function (type) {\n if (err === 0) {\n item.removeClass('invalid');\n err = vi.validate(item, type);\n errors += err;\n }\n });\n return errors;\n };\n}","title":""},{"docid":"6834b3db993e61702e7d1b980cd5fa4d","score":"0.6497495","text":"static validate(userData){\n return userValidator.validate(userData);\n }","title":""},{"docid":"e07e8e021ded5c0ec9aaae6e386e2499","score":"0.64555436","text":"validatefirsname(firsname){\n if(validator.isEmpty(firsname)){\n return 'firstname is required';\n }\n if(!validator.isAlpha(firsname)){\n return 'name must be in letter';\n }\n\n if(!validator.isLength(firsname, { min: 6 })){\n return 'Name should be minimum 6 characters';\n }else{\n\n }\n return false;\n }","title":""},{"docid":"6095999d75241111fedba781d49efeaa","score":"0.6433366","text":"_validateFields(){\n\n let isValid = true;\n\n // Validate project state date value\n isValid = this._validateProjectStartDate(this.state.projectStartDateValue);\n if(!isValid)\n return isValid;\n\n // Validate project end date value\n isValid = this._validateProjectEndDate(this.state.projectEndDateValue);\n if(!isValid)\n return isValid;\n\n // Validate food provided value\n isValid = this._validateFoodProvided(this.state.foodProvidedValue);\n if(!isValid)\n return isValid;\n\n // Validate current status value\n isValid = this._validateCurrentStatus(this.state.currentStatusValue);\n if(!isValid)\n return isValid;\n\n // Validate project type value\n isValid = this._validateProjectType(this.state.projectTypeValue);\n if(!isValid)\n return isValid;\n\n return isValid\n\n }","title":""},{"docid":"4ef48eefa76f5451051f9501dc1f3f54","score":"0.6429415","text":"_validate() {\n let validators = [new IntegerValidator()];\n if(this.props.required && (this.props.value === null || this.props.value === undefined)) {\n return 'This field is required.';\n }\n\n if(this.props.min_value) {\n validators.push(new MinValueValidator(this.props.min_value));\n }\n if(this.props.max_value) {\n validators.push(new MaxValueValidator(this.props.max_value));\n }\n\n return run_validators(validators, this.props.value);\n }","title":""},{"docid":"1a4b31911ac7440ac0aa2c59bf25a8f1","score":"0.6423574","text":"static validate(items, types) {}","title":""},{"docid":"f7b743f88313c79bd2654bb2cd625cec","score":"0.6414443","text":"function formDataValidate() {\r\n\r\n\tvar date_format_regex = /^\\d{4}\\/\\d{2}\\/\\d{2}$/;\r\n\r\n\tif (inputGetter.getBookName == BLANK) {\r\n\t\talert('Chưa nhập tên sách');\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (inputGetter.getBookTypeId == '0') {\r\n\t\talert('Chưa chọn chủng loại sách');\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (inputGetter.getAuthorId == '0') {\r\n\t\talert('Chưa chọn tác giả');\r\n\t\treturn false;\r\n\t}\r\n\r\n\r\n\t// check date in format yyyy/MM/dd\r\n\tif (!inputGetter.getPublishDate.match(date_format_regex)) {\r\n\t\talert('Ngày xuất bản không đúng định dạng năm-tháng-ngày (yyyy/MM/dd)');\r\n\t\treturn false;\r\n\t} else {\r\n\t\t//check date valid\r\n\t\tvar publishDate = new Date(inputGetter.getPublishDate);\r\n\t\tif (date.toString() == \"Invalid Date\") {\r\n\t\t\talert('Ngày xuất bản không hợp lệ');\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\tif (inputGetter.getOriginPrice > inputGetter.getSellPrice) {\r\n\t\talert('Giá bán phải không được thấp hơn giá gốc');\r\n\t\treturn false;\r\n\t}\r\n\r\n\treturn true;\r\n}","title":""},{"docid":"132cfedf83ad548cfda1cbf5e578724c","score":"0.6406183","text":"validate(detailName, value) {\n\n switch (detailName) {\n\n case 'name':\n // name must not be blank. setting max length to 75 characters. Prefer to allow nonstandard names (like Q.Dogs) rather than risk a user not being able to enter their actual name. See: http://www.kalzumeus.com/2010/06/17/falsehoods-programmers-believe-about-names/\n return value && value.length <= 75\n\n case 'email':\n //this guy has thought of all of the edge cases - https://hackernoon.com/the-100-correct-way-to-validate-email-addresses-7c4818f24643 https://hackernoon.com/how-to-reduce-incorrect-email-addresses-df3b70cb15a9 .\n //For the sake of learning, let's assume that my contacts will have email addresses that\n //1. are not null (email is required)\n //2. are 100 characters max\n //3. match the sample email validation regex provided by MDN: https://developer.mozilla.org/en-US/docs/Web/HTML/Element/input/email#Validation\n const emailRegex = RegExp(/^[a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*$/);\n\n return value && value.length <= 100 && emailRegex.test(value);\n\n case 'phoneNumber':\n //Phone number is not required, but if provided, it should take the form of xxx-xxx-xxxx. If I were dealing with non-US numbers, I would expand this to include country code, different formats, etc. This won't catch invalid US numbers (like 111-111-1111), but the format will be correct.\n const phoneNumberRegEx = RegExp(/^([0-9]{3}-[0-9]{3}-[0-9]{4})$/);\n return value === null || phoneNumberRegEx.test(value);\n\n case 'imageUrl':\n // I REALLY wanted to check whether images were broken, but as far as I can tell that requires some async skills I don't have yet. Alas. Will just check that value is of format somestring.someimageextension.\n const imageUrlRegEx = RegExp(/(.)\\.(jpeg|jpg|gif|png|JPEG|JPG|GIF|PNG)$/);\n return value === null || imageUrlRegEx.test(value);\n\n default:\n break;\n }\n }","title":""},{"docid":"5dac0788c7e09156532721b536f8d032","score":"0.64045626","text":"function validate() {\r\n\tvalid = true;\r\n\tif (activeCategoryId == '')\t{\r\n\t\talert ('Please select a Category.');\r\n\t\tvalid = false;\r\n\t} else if (activeSubcategoryId == '' && $('#data_point_sublist').css('display') == 'block') {\r\n\t\talert ('Please select a Subcategory.');\r\n\t\tvalid = false;\r\n\t} else if (objEntityForm.isDateRequired == 'Y' && $('#datepicker').val() == '') {\r\n\t\talert ('Please select a Date.');\r\n\t\tvalid = false;\r\n\t} else if ($('#transcription').val() =='') {\r\n\t\talert ('Please insert a Transcription.');\r\n\t\tvalid = false;\r\n\t} else if (objEntityForm.isStatusRequired == 'Y' && $('#statusAlert').val() == '') {\r\n\t\talert ('Please select a Status from the list.');\r\n\t\tvalid = false;\r\n\t}\r\n\telse if (objEntityForm.isDateRequired == 'Y') \r\n\t{\r\n\t\t// For IWS-250 date validation In step 2, Data Date field on the data point entry form\r\n\t\tvar datePicker = $('#datepicker').val();\r\n\t\tif(isNaN(datePicker))\r\n\t\t{\r\n\t\t\tif(checkDateFormat(datePicker))\r\n\t\t\t{\r\n\t\t\t\tvalid = true;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn valid;\r\n}","title":""},{"docid":"c9e0122609d09a9022782633b87fea8a","score":"0.63992596","text":"validate(value){ //value represents the value given to the email while creatign instance of te model\n if(!validator.isEmail(value)){\n throw new Error('Email is invalid')\n }\n }","title":""},{"docid":"a2e905f2325786a8676f4b28fa0a2805","score":"0.6372368","text":"function validate_inputs() {\t\n\tcheck_empty_fields();\n\tcompare_passwords();\n\tvalidate_email();\n}","title":""},{"docid":"7677dde3c2764b1eef8122cfa876ab63","score":"0.6367633","text":"validateForm() {\n const validName = this.validateName();\n const validSerialNumber = this.validateSerialNumber();\n\n return validName && validSerialNumber;\n }","title":""},{"docid":"03b811b989b3cfeafd67c95f9c53b04b","score":"0.63629246","text":"function validateTrue(nothing){\n return true;\n}","title":""},{"docid":"e0903d5727fe7f8b1191a42baa80488c","score":"0.63581455","text":"isValidRecord(){ /** todo */ }","title":""},{"docid":"a48ec7834d112913baad16610d6d3b01","score":"0.63546103","text":"function validation(name, value, entityName, model) {\n switch (name) {\n case 'email':\n return (value || '').isEmail();\n case 'price':\n return value.parseFloat() > 0;\n case 'firstname':\n case 'lastname':\n case 'telephone':\n case 'address':\n case 'name':\n return (value || '').length > 0;\n }\n}","title":""},{"docid":"84fbf2a8a33466bbbefd642a6f187b0a","score":"0.6352498","text":"validateInput(item,name,min,max) {\nif(item.length==\"\") {\nthis.toast(name+\"is required\");\nreturn false;\n}else if(item.length<min) {\n this.toast(name+\"should be more than\"+min+\"characters\")\n\n return false;\n}else if(item.length>max) {\n this.toast(name+\"should less than\"+max+\"characters\")\n return false;\n}else {\n return item;\n}\n}","title":""},{"docid":"69c30560120b7f546906a3b8495ebc2b","score":"0.6347611","text":"validate(fieldName, value, onSuccess, onError) {\r\n // If no validations property, do not validate\r\n if (!this.state.fields) {\r\n return\r\n }\r\n\r\n // We initially set isValid to true and then flip it if we\r\n // run a validator that invalidates the input\r\n let isValid = true\r\n \r\n let field = this.state.fields[fieldName]\r\n\r\n // We only validate if the input has value or if it is required\r\n if ((value || field.required) && typeof field.validations === 'string') {\r\n // We split on comma to iterate the list of validation rules\r\n field.validations.split(',').forEach((validation) => {\r\n\r\n // By splitting on \":\"\" we get an array of arguments that we pass\r\n // to the validator. ex.: isLength:5 -> ['isLength', '5']\r\n let args = validation.split(':')\r\n\r\n // We remove the top item and are left with the method to\r\n // call the validator with ['isLength', '5'] -> 'isLength'\r\n let validateMethod = args.shift()\r\n\r\n // We use JSON.parse to convert the string values passed to the\r\n // correct type. Ex. 'isLength:1' will make '1' actually a number\r\n args = args.map((arg) => { \r\n return JSON.parse(arg) \r\n })\r\n\r\n // We then merge two arrays, ending up with the value\r\n // to pass first, then options, if any. ['valueFromInput', 5]\r\n args = [value].concat(args)\r\n\r\n // So the next line of code is actually:\r\n // validator.isLength('valueFromInput', 5)\r\n if (typeof validator !== 'undefined') {\r\n if (!validator[validateMethod].apply(validator, args)) {\r\n isValid = false\r\n } \r\n }\r\n })\r\n }\r\n \r\n return isValid\r\n }","title":""},{"docid":"52bba3f9fcfed2cdd8d8c5f080d3fa47","score":"0.63446355","text":"function validator1() {\n\n return {\n stringValidator: isItAllCap,\n passwordValidator: areThereNum,\n colorValidator: trueColor,\n yearValidator: yearInterval\n };\n\n}","title":""},{"docid":"cdbe755719283e9ae385f6a417712eb7","score":"0.6310223","text":"validate() {\n this.checkValidInputs();\n let errorInputs = this.checkSets();\n this.setErrors(errorInputs);\n }","title":""},{"docid":"c972f486bda0faadd5555077525dc026","score":"0.6273746","text":"function validBasedOnClass(thisClass) {\r\n\t\t\tvar classBack = \"\";\r\n\t\t\t\r\n\t\t\tswitch(thisClass) {\r\n\t\t\t\tcase \"\":\r\n\t\t\t\tcase \"invalid\":\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase \"reqd\":\r\n\t\t\t\t\tif (allGood && thisTag.value == \"\") {\r\n\t\t\t\t\t\t\tclassBack = \"invalid \";\r\n\t\t\t\t\t}\r\n\t\t\t\t\tclassBack += thisClass;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase \"radio\":\r\n\t\t\t\t\tif (allGood && !radioPicked(thisTag.name)) {\r\n\t\t\t\t\t\tclassBack = \"invalid \";\r\n\t\t\t\t\t}\r\n\t\t\t\t\tclassBack += thisClass;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase \"email\":\r\n\t\t\t\t\tif (allGood && !validEmail(thisTag.value)) {\r\n\t\t\t\t\t\tclassBack = \"invalid \";\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t\tclassBack += thisClass;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase \"confirm\":\r\n\t\t\t\t\tif(document.getElementById(\"email\").value != document.getElementById(\"confirmEmail\").value){\r\n\t\t\t\t\t\tclassBack = \"invalid \";\r\n\t\t\t\t\t}\r\n\t\t\t\t\tclassBack += thisClass;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase \"phone\":\r\n\t\t\t\t\tif (allGood && !validPhone(thisTag.value)){\r\n\t\t\t\t\t\tclassBack = \"invalid \";\r\n\t\t\t\t\t}\r\n\t\t\t\t\tclassBack += thisClass;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tdefault:\r\n\t\t\t\t\tif (allGood && !crossCheck(thisTag,thisClass)) {\r\n\t\t\t\t\t\tclassBack = \"invalid \";\r\n\t\t\t\t\t}\r\n\t\t\t\t\tclassBack += thisClass;\r\n\t\t\t}\r\n\t\t\treturn classBack;\r\n\t\t\t\r\n\t\t\t// function crossCheck takes parameters for current tag being observed as inTag and current class being observed as otherFieldID\r\n\t\t\t// if otherFieldID doesn't exist there's a problem, return false\r\n\t\t\t// finally, boolean var is returned dependent upon whether the values for these parameters match or not\r\n\t\t\tfunction crossCheck(inTag,otherFieldID) {\r\n if (!document.getElementById(otherFieldID)) {\r\n return false;\r\n }\r\n return (inTag.value == document.getElementById(otherFieldID).value);\r\n }\r\n\t\t}","title":""},{"docid":"fc2b3959986b59a3d457f87a171b5d6b","score":"0.62711847","text":"validate() {\n Object.entries(TOP_LEVEL_FIELDS).some(([field, { required }]) => {\n if (required && !(field in this.fields))\n throw new Error(`Missing field ${field}`);\n return false;\n });\n\n // authenticationToken && webServiceURL must be either both or none\n if ('webServiceURL' in this.fields) {\n if (!('authenticationToken' in this.fields))\n throw new Error(\n 'While webServiceURL is present, authenticationToken also required!',\n );\n if (this.fields.authenticationToken.length < 16)\n throw new Error(\n 'authenticationToken must be at least 16 characters long!',\n );\n } else if ('authenticationToken' in this.fields)\n throw new Error(\n 'authenticationToken is presented in Pass data while webServiceURL is missing!',\n );\n\n // validate color fields\n // valid values must be like rgb(123, 2, 22)\n Object.keys(TOP_LEVEL_FIELDS)\n .filter(v => v.endsWith('Color'))\n .filter(v => v in this.fields)\n .forEach(colorFieldName => {\n const value = this.fields[colorFieldName];\n try {\n /^rgb\\(\\s*(\\d{1,3}),\\s*(\\d{1,3}),\\s*(\\d{1,3})\\s*\\)$/\n .exec(value)\n .slice(1)\n .map(v => parseInt(v, 10))\n .some(v => {\n if (isNaN(v) || v < 0 || v > 255)\n throw new Error(`Invalid color value ${value}`);\n return false;\n });\n } catch (e) {\n throw new Error(\n `Color value \"${value}\" for field \"${colorFieldName}\" is invalid, must be an rgb(...)`,\n );\n }\n });\n }","title":""},{"docid":"44142158049a0455dd0f5aec7f2fb08e","score":"0.6271135","text":"validate() {\n\n var is = this.is()\n\n if(is.err) return is\n\n var results = [],\n validator = this\n\n /*\n NOTE: rules are type options\n */\n Object.keys(this.options).forEach( (rule) => {\n\n let result = validator[rule](validator.options[rule])\n\n if(result.err) {\n result.err.ruleKey = rule\n results.push(result.err)\n }\n\n })\n\n if(results.length == 0) {\n return {valid: true}\n }\n\n return {\n err: results\n }\n\n }","title":""},{"docid":"77701d81cab965fa04ae056fc340121e","score":"0.62684166","text":"function iecMinimalValidaion(){\r\n\tvar response = true;\r\n\tvar error = \"\";\r\n\tvar category_classname = \"\";\r\n\tvar errorPartA = \"\";\r\n\tvar errorPartB = \"\";\r\n\tvar errorPartC1_C5 = \"\";\r\n\tvar phoneRegex = /[0-9 -()+]+$/;\r\n\tvar emailRegex = /^[a-zA-Z0-9._-]+@[a-zA-Z0-9.-]+\\.[a-zA-Z]{2,6}$/;\r\n\tif($(\"#entity_name\").val() == \"\"){\r\n\t\terrorPartA += \"Entity name cannot be empty\"+'<br/>';\r\n\t\tresponse = false;\r\n\t}\r\n\tif($(\"#entity_telephone\").val() != \"\" ){\r\n\t\tif(($(\"#entity_telephone\").val().length < 6) || (!phoneRegex.test($(\"#entity_telephone\").val()))){\r\n\t\t\terrorPartA += \"Please enter valid landline number\"+'<br/>';\r\n\t\t\tresponse = false;\r\n\t\t}\r\n\t}\r\n\tif($(\"#entity_mobile1\").val() != \"\" ){\r\n\t\tif(($(\"#entity_mobile1\").val().length < 6) || (!phoneRegex.test($(\"#entity_mobile1\").val()))){\r\n\t\t\terrorPartA += \"Please enter valid primary mobile number\"+'<br/>';\r\n\t\t\tresponse = false;\r\n\t\t}\r\n\t}\r\n\tif($(\"#entity_mobile2\").val() != \"\" ){\r\n\t\tif(($(\"#entity_mobile2\").val().length < 6) || (!phoneRegex.test($(\"#entity_mobile2\").val()))){\r\n\t\t\terrorPartA += \"Please enter valid other mobile number\"+'<br/>';\r\n\t\t\tresponse = false;\r\n\t\t}\r\n\t}\r\n\tif($(\"#entity_email1\").val() != \"\" ){\r\n\t\tif(!emailRegex.test($(\"#entity_email1\").val())){\r\n\t\t\terrorPartA += \"Please enter valid primary email address\"+'<br/>';\r\n\t\t\tresponse = false;\r\n\t\t}\r\n\t}\r\n\tif($(\"#entity_email2\").val() != \"\" ){\r\n\t\tif(!emailRegex.test($(\"#entity_email2\").val())){\r\n\t\t\terrorPartA += \"Please enter valid alternate email address\"+'<br/>';\r\n\t\t\tresponse = false;\r\n\t\t}\r\n\t}\r\n\tif($(\"#entity_fax\").val() != \"\" ){\r\n\t\tif(!phoneRegex.test($(\"#entity_fax\").val())){\r\n\t\t\terrorPartA += \"Please enter valid FAX number\"+'<br/>';\r\n\t\t\tresponse = false;\r\n\t\t}\r\n\t}\r\n\tif (!$('input[name=\"entity[category]\"]:checked').val()) {\r\n\t\terrorPartA += \"Please select the nature of concern/entity\"+'<br/>';\r\n\t\tresponse = false;\r\n\t}\r\n\tif($(\"#branch_total\").val() != '') {\r\n\t\tif(!$.isNumeric($(\"#branch_total\").val())){\r\n\t\t\terrorPartB += \"Please enter valid number for total branches\"+'<br/>';\r\n\t\t\tresponse = false;\r\n\t\t}\r\n\t\t\r\n\t}\r\n\tif(response){\r\n\t\t$('#error_message').hide();\r\n\t\t/*\r\n\t\tbootbox.confirm(\"Are you sure you want only to SAVE this form?\",'No','Yes',function(result) {\r\n\t\t if (result) {\r\n\t\t \talert('hai');\r\n\t\t \treturn true;\r\n\t\t } \r\n\t\t});*/\r\n\t\treturn true;\r\n\t}else{\r\n\t\tvar show_target = $(\"#error_message\").offset().top;\r\n\t\tbootbox.alert(\"Form validaion failed, kindly check the error message before proceeding.\",function() {\r\n\t\t\t$(\"html, body\").animate({ scrollTop: 100 }, \"slow\");\r\n\t\t});\r\n\t\tif(errorPartA){\r\n\t\t\terror += \"<b>Part A:</b><br/>\"+errorPartA+\"<br/>\";\r\n\t\t}\r\n\t\tif(errorPartB){\r\n\t\t\terror += \"<b>Part B:</b><br/>\"+errorPartB+\"<br/>\";\r\n\t\t}\r\n\t\tif(errorPartC1_C5){\r\n\t\t\terror += errorPartC1_C5;\r\n\t\t}\r\n\t\t//$(\"#error_message\").attr('class', 'alert alert-error');\r\n\t\t$('#error_message').show();\r\n\t\t$(\"#error_message\").html(error);\r\n\t\treturn false;\r\n\t}\r\n}","title":""},{"docid":"de90c2d9407d76d91d0fb84bb20dde07","score":"0.6262441","text":"function MSJT_validate_field(el_input, fldName) {\n //console.log(\" ----- MSJT_validate_field ----\")\n //console.log(\"fldName\", fldName)\n let msg_err = null;\n if (el_input){\n const value = el_input.value;\n //console.log(\"value\", value)\n if ([\"code\", \"name\"].includes(fldName)) {\n const caption = (fldName === \"code\") ? loc.Abbreviation : loc.Name;\n const max_length = (fldName === \"code\") ? 8 : 50;\n if (!value) {\n msg_err = caption + loc.cannot_be_blank;\n } else if (value.length > max_length) {\n msg_err = caption + ( (fldName === \"code\") ? loc.is_too_long_MAX10 : loc.is_too_long_MAX50 );\n }\n } else if([\"sequence\"].includes(fldName)){\n if (!value) {\n msg_err = loc.Sequence + loc.cannot_be_blank;\n } else {\n const arr = b_get_number_from_input(loc, fldName, el_input.value);\n msg_err = arr[1];\n }\n }\n }\n return msg_err;\n } // MSJT_validate_field","title":""},{"docid":"301e47651327f9fe041713ddf9ce9366","score":"0.6260221","text":"handleValidation() {\n const { siteConstants } = this.props.language;\n\n let fields = this.state.user;\n // let errors = {};\n let formIsValid = true;\n\n //Name\n if (\n fields.firstname == \"\" ||\n fields.lastname == \"\" ||\n fields.mobile_number == \"\"\n ) {\n formIsValid = false;\n if (fields.firstname == \"\") {\n this.setState({\n errors: { firstname: siteConstants.ERR_CAN_NOT_BLANK }\n });\n }\n if (fields.lastname == \"\") {\n this.setState({\n errors: { lastname: siteConstants.ERR_CAN_NOT_BLANK }\n });\n }\n\n if (fields.mobile_number == \"\") {\n this.setState({ errors: { contact: siteConstants.ERR_CAN_NOT_BLANK } });\n }\n }\n\n if (fields.firstname !== \"\" && fields.firstname !== undefined) {\n if (fields.firstname.match(/^[a-zA-Z]+$/) === null) {\n formIsValid = false;\n this.setState({\n errors: { firstname: siteConstants.ERR_ONLY_LETTERS }\n });\n }\n }\n\n if (fields.lastname !== \"\" && fields.lastname !== undefined) {\n if (fields.lastname.match(/^[a-zA-Z]+$/) === null) {\n formIsValid = false;\n this.setState({ errors: { lastname: siteConstants.ERR_ONLY_LETTERS } });\n }\n }\n\n if (fields.mobile_number !== \"\" && fields.mobile_number !== undefined) {\n if (String(fields.mobile_number).match(/^[0-9]*$/) === null) {\n formIsValid = false;\n this.setState({ errors: { contact: siteConstants.ERR_ONLY_NUMBERS } });\n }\n }\n\n return formIsValid;\n }","title":""},{"docid":"bb3197470d0302ddbc693d336d87aae2","score":"0.6245587","text":"function valid(){\n if (!$scope.account.Attributes)$scope.account.Attributes = [];\n var attrValidation = [];\n\n for(var i = 0 ; i < 12; i++) {\n $scope['attrVldn_' + i] = [];\n }\n\n for(var i = 0 ; i < $scope.account.Attributes.length; i++) {\n $scope['attrVldn_' + i] = validationClass($scope.account.Attributes[i].Name, false);\n attrValidation = attrValidation.concat($scope['attrVldn_' + i]);\n }\n $scope.nameVldn = $scope.usernameVldn = [];\n $scope.nameVldn = validationClass($scope.account.DisplayName, false);\n $scope.usernameVldn = validationClass($scope.account.Username, false);\n return !$scope.nameVldn.concat($scope.usernameVldn).concat(attrValidation).includes('invalid');\n }","title":""},{"docid":"3cfafde72df76463e1dd367377d104e8","score":"0.6243738","text":"function validate(data)\r\n {\r\n if(data.length > 0){return true;}else{return false;}\r\n }","title":""},{"docid":"37702a082c0773ccbf5ea97e4e33bd38","score":"0.6236657","text":"validate () {\n const { required, minLength, maxLength, value } = this.props\n let isValid = !(required || minLength)\n let errorText = ''\n if (required) {\n isValid = !validator.isEmpty(value)\n errorText = isValid ? '' : ERROR_TXT.REQUIRED\n }\n // Check also for validity in the next validations\n // Prevents from passing validation if a previous condition decided it was invalid\n if (isValid) {\n if (minLength) {\n isValid = validator.isLength(String(value), { min: minLength })\n errorText =\n errorText || `El campo debe contener al menos ${minLength} caracteres`\n }\n if (maxLength) {\n isValid = validator.isLength(String(value), { max: maxLength })\n errorText =\n errorText || `El campo debe contener máximo ${maxLength} caracteres`\n }\n }\n this.setState({ isValid, errorText })\n return isValid\n }","title":""},{"docid":"e0d27207f8594a93ad2d9aa6df8e865f","score":"0.62342066","text":"function validateMandatoryFields(){\n\n\terrMsg = new Array();\n\terrCount=0;\n\n\t//Colocar en el estado inicial al campo resaltado\n\tresetFields(field);\n\tfirstErr=null;\n\n\t//Llamado a las funciones de validacion de los campos\n\tvalidate_treatment();\t\n\tvalidate_name();\t\n\tvalidate_lastname();\t\t\n\tvalidate_company_nm();\t\n\tvalidate_cli_e_mail();\t\n\tvalidate_cli_country_cd();\t\n\tvalidate_cli_address();\t\n\tvalidate_cli_postal_cd();\t\n\tvalidate_cli_ident_num();\n\tvalidate_user_login();\t\n\tvalidate_user_pass();\n\tvalidate_conf_user_pass();\n\t\n\t\n\n\tif(errCount>0){\n\t\tfor(i=0;i<1;i++){\n\t\talert(errMsg[i]);\n\t }\n\t\t\n\t\tfield=firstErr.id;\n\t\t//Resaltar el primer campo donde existe un error\n\t\tdocument.getElementById('title_'+firstErr.id+'_underline').style.display='block';\n\t\tdocument.getElementById('label_'+firstErr.id+'_underline').style.background='#FFFFCC';\n\t\tdocument.getElementById('input_'+firstErr.id+'_underline').style.background='#FFFFCC';\n\n\t\t//Fijar el foco en el campo en el que se presenta el primer error\n\t\tfirstErr.focus();\n\t\tdocument.getElementById('title_'+firstErr.id+'_underline').scrollIntoView(true);\n\n\t\t//Mostrar la nota al pie aclarando el mensaje de error\n\t\tdocument.getElementById('notaerror').style.display='inline';\n\n\n\t}else{\n\n\t\tdocument.forma.submit();\n\t}\n\n\n}","title":""},{"docid":"f404f8c89c88cac546993d8d5bbb4daa","score":"0.62325394","text":"function validations() {\n let layersModel = learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.api.layersModel;\n if (layersModel === undefined) {\n requiredErr(\">layers model<\");\n }\n\n // Model Structure Validations:\n if (layersModel.inputLayer === undefined) {\n requiredErr(\">input layer<\");\n }\n if (layersModel.outputLayer === undefined) {\n requiredErr(\">output layer<\");\n }\n if (layersModel.inputLayer.inputFeatures === undefined) {\n requiredErr(\">input features<\");\n }\n if (layersModel.outputLayer.outputLabels === undefined) {\n requiredErr(\">output labels<\");\n }\n if (layersModel.inputLayer.inputFeatures.dataFeatures.length === 0) {\n requiredErr(\">input data features<\");\n }\n if (layersModel.outputLayer.outputLabels.dataLabels.length === 0) {\n requiredErr(\">output data labels<\");\n }\n if (layersModel.layers.length === 0) {\n requiredErr(\">Could not find any layers<\");\n }\n if (layersModel.inputLayer.referenceParent === undefined) {\n requiredErr(\">input layer missing reference parent<\");\n }\n\n // Model Compiler Validations:\n if (learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.compile === undefined) {\n requiredErr(\">compile node<\");\n }\n if (learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.compile.lossFunction === undefined) {\n requiredErr(\">loss function<\");\n }\n if (learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.compile.lossFunction.config.value === undefined) {\n requiredErr(\">loss function value<\");\n }\n if (learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.compile.optimizer === undefined) {\n requiredErr(\">optimizer node<\");\n }\n if (learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.compile.optimizer.optimizerType === undefined) {\n requiredErr(\">optimizer type node<\");\n }\n\n //* Feature Validations: */\n \n // Data Features must be Uniquely Named:\n /*let duplicates = () => {\n let names = [];\n layersModel.inputLayer.inputFeatures.dataFeatures.forEach(e => names.push(e.name));\n return names;\n };\n if (layersModel.inputLayer.inputFeatures.dataFeatures.length !==\n new Set(duplicates()).size) {\n requiredErr(\">All Data Feature nodes must be uniquely named<\");\n }*/\n }","title":""},{"docid":"82c3d275b7a1f704a86e6364f515fa40","score":"0.621718","text":"isValid(force, callValidation = true) {\r\n let ok = true;\r\n let elems = this.findAll('.bbn-input-component');\r\n if (Array.isArray(elems)) {\r\n bbn.fn.each(elems, a => {\r\n if ((bbn.fn.isFunction(a.isValid) && !a.isValid(a, callValidation))\r\n || (bbn.fn.isFunction(a.validation) && !a.validation())\r\n ) {\r\n ok = false;\r\n }\r\n if ( !ok ){\r\n return false;\r\n }\r\n });\r\n }\r\n if (ok && this.validation && callValidation) {\r\n ok = this.validation(this.source, this.originalData, force)\r\n }\r\n return !!ok;\r\n }","title":""},{"docid":"4046e5a6e5b0433e232431f53dfd0204","score":"0.6208849","text":"validfields(f1,f2){\n //if they are full its time for next validation\n if(f1 !== '' && f2 !== ''){\n //if url is valid its time for name length\n if(f2.search('.com') !== -1){\n if(f1.length < 16){\n //everything is good so book should be added\n return 'done';\n }\n //if intered info unvalid we should tell user what is wronge\n else{\n alert('name must be shorter');\n }\n }\n else{\n alert('(.com) in url is missing');\n }\n }\n else{\n alert('please fill the fields');\n }\n }","title":""},{"docid":"f52d592f93fb277e7c1059ddde44f151","score":"0.6208147","text":"handleValidation(){\n let fields = this.state.fields;\n let errors = {};\n let formIsValid = true;\n \n //Name\n if(!fields[\"name\"]){\n formIsValid = false;\n errors[\"name\"] = \"*Name is required\";\n }\n \n \n \n //Email\n if(!fields[\"email\"]){\n formIsValid = false;\n errors[\"email\"] = \"*Email is Required\";\n }\n \n if(typeof fields[\"email\"] !== \"undefined\"){\n let lastAtPos = fields[\"email\"].lastIndexOf('@');\n let lastDotPos = fields[\"email\"].lastIndexOf('.');\n \n if (!(lastAtPos < lastDotPos && lastAtPos > 0 && fields[\"email\"].indexOf('@@') === -1 && lastDotPos > 2 && (fields[\"email\"].length - lastDotPos) > 2)) {\n formIsValid = false;\n errors[\"email\"] = \"Email is not valid\";\n }\n } \n \n \n if(!fields[\"verifyno\"]){\n formIsValid = false;\n errors[\"verifyno\"] = \"*Verify Code Required\";\n } \n if(typeof fields[\"verifyno\"] !== \"undefined\"){\n if(!fields[\"verifyno\"].match(/^[0-9]+$/)){\n formIsValid = false;\n errors[\"verifyno\"] = \"Only Digits Allow\";\n } \n }\n\n \n\n \n if(!fields[\"password\"]){\n formIsValid = false;\n errors[\"password\"] = \"*Password Is Required\";\n } \n \n if(!fields[\"cpassword\"]){\n formIsValid = false;\n errors[\"cpassword\"] = \"*Conform Password Is Required\";\n } \n \n this.setState({errors: errors});\n return formIsValid;\n }","title":""},{"docid":"50993bdbddb2e8e0cc6e6780a6c766e0","score":"0.62042546","text":"function FValidation( obj, property, value, options ){\n\n}","title":""},{"docid":"ebc0c78510c24fd29e7d389783d872a1","score":"0.62036854","text":"function validateInfo(){\r\n\tvalidateEmail();\r\n\tvalidatePhone();\r\n\tvalidateAddress();\r\n\tvalidateDate();\r\n\tvalidateTime();\r\n\t\r\n\treturn false;\r\n}\t// End validateInfo","title":""},{"docid":"58147b22f63f20d8d4167cb73fc12d6c","score":"0.6194574","text":"function validate(data, model, toCheck){\n\n\t\t\tvar errors = {}; \n\t\t\tvar hasErrors = false; \n\t\t\tvar thisModel = models[model];\n\n\t\t\ttoCheck.forEach(function(field){\n\t\t\t\tvar formattedData = thisModel[field].format(data[field]);\n\t\t\t\tif (!thisModel[field].regex.test(formattedData)) {\n\t\t\t\t\terrors[field] = thisModel[field].errMessage; \n\t\t\t\t\thasErrors = true; \n\t\t\t\t}\n\t\t\t});\n\n\t\t\tif (hasErrors) return errors;\n\t\t\telse return null; \n\t\t}","title":""},{"docid":"06a56ec8a4bc33897c9cd55f3a852ca3","score":"0.6192889","text":"function formValidation()\r\n{\r\n// Declaring form elements from line5 to line14\r\nvar uid = document.registration.userid;\r\nvar passid = document.registration.passid;\r\nvar uname = document.registration.username;\r\nvar uadd = document.registration.address;\r\nvar ucountry = document.registration.country;\r\nvar uzip = document.registration.zip;\r\nvar uemail = document.registration.email;\r\nvar umsex = document.registration.msex;\r\nvar ufsex = document.registration.fsex; \r\n\r\n// calling respective validation method for each element\r\nif(userid_validation(uid,5,12))\r\n{\r\nif(passid_validation(passid,7,12))\r\n{\r\nif(allLetter(uname))\r\n{\r\nif(alphanumeric(uadd))\r\n{ \r\nif(countryselect(ucountry))\r\n{\r\nif(allnumeric(uzip))\r\n{\r\nif(ValidateEmail(uemail))\r\n{\r\nif(validsex(umsex,ufsex))\r\n{\r\n}\r\n} \r\n}\r\n} \r\n}\r\n}\r\n}\r\n}\r\nreturn false;\r\n\r\n//Defining userid validation method using three parameters\r\n}","title":""},{"docid":"510e4355926f39a3b5312f1a32b9f4eb","score":"0.61901623","text":"_validateField(name, value, schemaField) {\n\n schemaField._validateSchemaField.call(this, value, schemaField);\n\n //additional validation\n if (typeof schemaField.validation === \"function\")\n if (!schemaField.validation.call(this, value, name, schemaField))\n throw new Exception(\"Additional Validation was not passed\", {name});\n\n return true;\n }","title":""},{"docid":"cc757349ee88cc4260e8b2ef3e0f2d8d","score":"0.6189634","text":"_validateProjectType(projectTypeValue){\n\n let isValid;\n\n // Validate for Empty Field\n this._isProjectTypeValid = isValid = this._validateForEmptyField(projectTypeValue);\n\n return isValid\n\n }","title":""},{"docid":"0be67132b48e598a48ee2947fe11a264","score":"0.61877275","text":"getValidationState(key) {\n var input = this.state[key];\n if (!input) return null;\n if (key === 'phone') {\n var phone_num = /^\\+(\\d+)\\d{10}/.exec(input);\n var all_num = /^(\\d{10})$/.exec(input);\n if (phone_num || all_num) return 'success';\n else return 'error';\n }\n if (key === 'email') {\n return (emailRegex.test(input) ? 'success' : 'error');\n }\n if (key === 'name') return (/^[A-Za-z\\s]+$/.test(input) ? 'success' : 'error');\n }","title":""},{"docid":"c2b42109a5425a5496148e95dc496b2d","score":"0.6185785","text":"function ValidationHelper() {\n var SectionIDs = new Array();\n var CurrentValidationSectionID;\n var _excludedIDsInCurrentSection = [];\n\n this.AddSectionID = function(sectionId) {\n SectionIDs.push(sectionId);\n };\n\n this.SetCurrentValidationSectionID = function(sectionId, excludedControlIDs) {\n CurrentValidationSectionID = sectionId;\n\n if (excludedControlIDs) {\n _excludedIDsInCurrentSection = excludedControlIDs;\n } else {\n _excludedIDsInCurrentSection = [];\n }\n };\n\n this.IsNeedValidate = function(controlId) {\n if (SectionIDs.length == 0) {\n return true;\n }\n\n // Always vlidate the field if user input a invalid value and left it.\n var e = getEvent();\n\n if (e != null) {\n if (e.type == \"blur\") {\n return true;\n }\n }\n\n if (CurrentValidationSectionID == null || CurrentValidationSectionID == '')//don't need to validate the field in editor form\n {\n if (_excludedIDsInCurrentSection.contains(controlId)) {\n return false;\n }\n\n for (var i = 0; i < SectionIDs.length; i++) {\n if (controlId.indexOf(SectionIDs[i]) > -1) {\n return false;\n }\n }\n\n return true;\n } else// validate the fields of section which indicated by \"CurrentValidationSectionID\"\n {\n var isInCurrentSection = controlId.indexOf(CurrentValidationSectionID) > -1;\n var isExcludedControl = _excludedIDsInCurrentSection.contains(controlId);\n\n return isInCurrentSection && !isExcludedControl;\n }\n };\n}","title":""},{"docid":"81b2535f138d08ee96392e180638428b","score":"0.6183326","text":"function validateForm()\n{\n \n return(validateTaskName() && \n validateStatus() && \n validateAssignee() && \n validateDueDate() && \n validateDescriptionBox());\n }","title":""},{"docid":"5b1fdb85d195b0d1e5cf6078d34aa32e","score":"0.6182998","text":"_validate(input) {\n const {name, email, suggestion} = input\n let isValid = true\n\n if (name && name.trim()) {\n this.setState({\n invalidName: false\n })\n } else {\n isValid = false\n this.setState({\n invalidName: true\n })\n }\n\n if (suggestion && suggestion.trim()) {\n this.setState({\n invalidSuggestion: false\n })\n } else {\n isValid = false\n this.setState({\n invalidSuggestion: true\n })\n }\n\n if (validateEmail(email)) {\n this.setState({\n invalidEmail: false\n })\n } else {\n isValid = false\n this.setState({\n invalidEmail: true\n })\n }\n\n return isValid\n\n function validateEmail(email) {\n const re = /^\\w+@[a-zA-Z_]+?\\.[a-zA-Z]{2,3}$/\n return re.test(email)\n }\n }","title":""},{"docid":"01f01030aff646197d8cdd87d762ffaa","score":"0.6178051","text":"function Section_Validate_Variable____________________________________________(){}","title":""},{"docid":"01f01030aff646197d8cdd87d762ffaa","score":"0.6178051","text":"function Section_Validate_Variable____________________________________________(){}","title":""},{"docid":"1d10982b36234b86eddd8bda4734d7d9","score":"0.61778975","text":"validateRequest(req, res, next) {\n let isValid = true;\n \n req.body.email ? isValid = validateEmail(req.body.email) : isValid = false;\n req.body.cnpj ? isValid = validateCNPJ(req.body.cnpj) : isValid = false;\n if (!req.body.slug) isValid = false;\n if (!req.body.razao_social) isValid = false;\n \n if (isValid) {\n next()\n }\n else {\n return responses.failure(res, 'ERROR: body invalid');\n }\n }","title":""},{"docid":"8c0c8269ace8ffd3b37efe42a5598eb6","score":"0.6172024","text":"function testValidateAux(){\n //Cases to be tested\n const cases = [\n {input:{name:{value:\"\",type:\"\"}, gender:{value:\"\",type:\"\"}, email:{value:\"\",type:\"email\"}, iseasy:{value:\"\",type:\"\"}},\n output:{name:false, gender:false, email:false, iseasy:false}},\n {input:{name:{value:\" \",type:\"\"}, gender:{value:\" \",type:\"\"}, email:{value:\" \",type:\"email\"}, iseasy:{value:\" \",type:\"\"}},\n output:{name:false, gender:false, email:false, iseasy:false}},\n {input:{name:{value:\"Vin\",type:\"\"}, gender:{value:\"Male\",type:\"\"}, email:{value:\"vin@vin\",type:\"email\"}, iseasy:{value:\"true\",type:\"\"}},\n output:{name:true, gender:true, email:false, iseasy:true}},\n {input:{name:{value:\"Bob\",type:\"\"}, gender:{value:\"Male\",type:\"\"}, email:{value:\"bobby@.com\",type:\"email\"}, iseasy:{value:\" \",type:\"\"}},\n output:{name:true, gender:true, email:false, iseasy:false}},\n {input:{name:{value:\"Vin Ndokaj\",type:\"\"}, gender:{value:\"Male\",type:\"\"}, email:{value:\"@.com\",type:\"email\"}, iseasy:{value:\"true\",type:\"\"}},\n output:{name:true, gender:true, email:false, iseasy:true}},\n {input:{name:{value:\"Haidar\",type:\"\"}, gender:{value:\"Male\",type:\"\"}, email:{value:\"haidar@e.e\",type:\"email\"}, iseasy:{value:\"false\",type:\"\"}},\n output:{name:true, gender:true, email:false, iseasy:true}},\n {input:{name:{value:\"Isabella\",type:\"\"}, gender:{value:\"Female\",type:\"\"}, email:{value:\"iz@.edu\",type:\"email\"}, iseasy:{value:\"true\",type:\"\"}},\n output:{name:true, gender:true, email:false, iseasy:true}},\n {input:{name:{value:\"Tyna\",type:\"\"}, gender:{value:\"Female\",type:\"\"}, email:{value:\"bpl@bpl.e\",type:\"email\"}, iseasy:{value:\"\",type:\"\"}},\n output:{name:true, gender:true, email:false, iseasy:false}},\n {input:{name:{value:\"Ronnie Coleman\",type:\"\"}, gender:{value:\"Male\",type:\"\"}, email:{value:\"yeah@buddy.com\",type:\"email\"}, iseasy:{value:\"true\",type:\"\"}},\n output:{name:true, gender:true, email:true, iseasy:true}},\n ]\n\n //goes through test cases and checks for correct output\n console.log(\"Test cases:\");\n var i;\n for(i = 0; i < cases.length; i++){\n if(\n validateAux(cases[i].input.name) != cases[i].output.name ||\n validateAux(cases[i].input.gender) != cases[i].output.gender ||\n validateAux(cases[i].input.email) != cases[i].output.email ||\n validateAux(cases[i].input.iseasy) != cases[i].output.iseasy\n ) {console.log(\"Case \" + i + \" failed.\");}\n else {console.log(\"Case \" + i + \" passed.\");}\n }\n} //end testValidateAux","title":""},{"docid":"b1a120df8bb171fd93debf6c38069c31","score":"0.61719114","text":"validate() {\n return true;\n }","title":""},{"docid":"36ee8b4656fba75bdc28b2dc7782ca5d","score":"0.61716396","text":"validate(method=\"all\") {\n if(method != \"all\" && method != \"touched\") {\n throw \"Unknown validation method \" + method;\n }\n\n // convinence func to check method before showing\n const methodShow = (input, name, message) => {\n // check method for showing the error message\n if(method == \"all\" || (method == \"touched\" \n && $(input).data(\"touched\") === \"true\")) {\n this.show(name, message);\n }\n }\n \n var isValid = true;\n // check if required fields have content\n $(\"[required]\").each((_, input) => {\n // .trim() to ignore whitespace\n if($(input).val().trim().length <= 0) {\n const name = $(input).attr(\"name\");\n methodShow(input, name, name + \" is required\");\n isValid = false;\n }\n });\n\n // check if passwords match\n const password = $(\"#student-password\").val();\n const confirmPassword = $(\"#student-confirm-password\").val();\n if(password.length > 1 && password !== confirmPassword)\n {\n methodShow($(\"#student-password\").get(0),\n \"password\", \"Passwords do not match\");\n isValid = false;\n }\n\n // check if mentor selected is valid\n if(this.extractMentor() == null) {\n methodShow($(\"#student-mentor\").get(0),\n \"mentorId\", \"Name a single lecturer to be your mentor\");\n isValid = false;\n }\n\n // check if skillsets selected are valid\n // only if any skillsets has been added\n const skillsets = this.extractSkillsets();\n if(skillsets == null && $(\"#student-skillsets\").data(\"touched\") == \"true\") {\n this.show(\"skillSets\", \"Please select skillsets only the provided skillsets\");\n isValid = false;\n }\n \n // check if the photo selected is valid \n // (ie is it actually a photo)\n const file = this.extractPhoto();\n if(file != null && /^image\\/[a-zA-Z]+$/.test(file.type) == false) {\n methodShow($(\"#student-photo\").get(0),\n \"picture\", \"Please select a image file\");\n }\n\n\n if(isValid === false) this.scrollFirstShown();\n\n return isValid;\n }","title":""},{"docid":"20bc4771e43bfac9d6d4e66c96a0c07a","score":"0.61700076","text":"function validate() {\n if (name === null) {\n alert(\"Enter the name please\");\n return false;\n }\n if (className === null) {\n alert(\"Enter class name please\");\n return false;\n }\n if (location === null) {\n alert(\"Enter location please\");\n return false;\n }\n if (edu === null) {\n alert(\"Enter the Education Buddy please\");\n return false;\n }\n if (pd === null) {\n alert(\"Enter the personal development buddy\");\n return false;\n }\n if (gitHub === null) {\n alert(\"Enter github id please\");\n return false;\n }\n\n return true;\n }","title":""},{"docid":"20bc4771e43bfac9d6d4e66c96a0c07a","score":"0.61700076","text":"function validate() {\n if (name === null) {\n alert(\"Enter the name please\");\n return false;\n }\n if (className === null) {\n alert(\"Enter class name please\");\n return false;\n }\n if (location === null) {\n alert(\"Enter location please\");\n return false;\n }\n if (edu === null) {\n alert(\"Enter the Education Buddy please\");\n return false;\n }\n if (pd === null) {\n alert(\"Enter the personal development buddy\");\n return false;\n }\n if (gitHub === null) {\n alert(\"Enter github id please\");\n return false;\n }\n\n return true;\n }","title":""},{"docid":"9203ce10bdd04cfb3bdf34f864658344","score":"0.61684406","text":"checkInput() {\n // Check if `libccurl` is available\n if (!this.libccurl.hasOwnProperty('ccurl_pow')) {\n return new Error('Hashing not available');\n }\n\n // Check if valid `trunkTransaction` was passed\n if (!this.iota.valid.isHash(this.trunkTransaction)) {\n return new Error('Invalid trunkTransaction');\n }\n\n // Check if valid `branchTransaction` was passed\n if (!this.iota.valid.isHash(this.branchTransaction)) {\n return new Error('Invalid branchTransaction');\n }\n\n // Check if a valid `minWeightMagnitude` was passed\n if (!this.iota.valid.isValue(this.minWeightMagnitude)) {\n return new Error('Invalid minWeightMagnitude');\n }\n\n // Check if the passed trytes are valid\n if (!this.iota.valid.isArrayOfTrytes(this.trytes)) {\n return new Error('Invalid trytes supplied');\n }\n }","title":""},{"docid":"54549765102022c44eb1066427f02889","score":"0.6163745","text":"function MSUBJ_validate_field(el_input, fldName) {\n //console.log(\" ----- MSUBJ_validate_field ----\")\n //console.log(\"fldName\", fldName)\n let msg_err = null;\n if (el_input){\n const value = el_input.value;\n //console.log(\"value\", value)\n if ([\"code\", \"name_nl\", \"name_en\", \"name_pa\"].includes(fldName)) {\n const caption = (fldName === \"code\") ? loc.Abbreviation : loc.Name;\n const max_length = (fldName === \"code\") ? 8 : 50;\n // \"name_en\" and \"name_pa\" can be blank\n if (!value && [\"code\", \"name_nl\"].includes(fldName)) {\n msg_err = caption + loc.cannot_be_blank;\n } else if (value.length > max_length) {\n msg_err = caption + ( (fldName === \"code\") ? loc.is_too_long_MAX10 : loc.is_too_long_MAX50 );\n };\n } else if([\"sequence\"].includes(fldName)){\n if (!value) {\n msg_err = loc.Sequence + loc.cannot_be_blank;\n } else {\n const arr = b_get_number_from_input(loc, fldName, el_input.value);\n msg_err = arr[1];\n };\n };\n };\n return msg_err;\n }","title":""},{"docid":"60cdf49fd6f978c0f93a3f3be97444ae","score":"0.6161838","text":"function validated() {\n if (username.value.length < 1) {\n username.styleborder = \"1px solid red\";\n name_err.style.display = \"block\";\n username.focus();\n return false;\n }\n if (email.value.length < 9) {\n email.styleborder = \"1px solid red\";\n email_err.style.display = \"block\";\n email.focus();\n return false;\n }\n if (password.value.length < 9) {\n password.styleborder = \"1px solid red\";\n password_err.style.display = \"block\";\n password.focus();\n return false;\n }\n}","title":""},{"docid":"257d0e5fa4fd43d29ad5c40a67a9d330","score":"0.61411536","text":"function makeValid(field) {\n var errorMessage;\n //update styling on the valid element\n field.attr('aria-invalid', 'false');\n //check if multi field row\n if (field.parent().hasClass('multiInput')) {\n //check that the other field in row is not invalid (include each type in selector)\n if (($('input, fieldset, select', field.parent().siblings()).attr('aria-invalid')) === 'false') {\n field.closest('.formRow').removeClass('mfHighlightError');\n }\n } else {\n field.closest('.formRow').removeClass('mfHighlightError');\n //also remove styling to acceptance text\n if (field.data('extvaltype') === 'terms') {\n field.parent().removeClass('mfHighlightError');\n }\n if ((field.data('extvaltype') === 'checkbox') || (field.data('extvaltype') === 'radio') || (field.data('extvaltype') === 'dob')) {\n errorMessage = $('div[aria-describedby=\"' + field.data('extvalname') + '-label\"]');\n } else {\n errorMessage = $('div[aria-describedby=\"' + field.attr('id') + '-label\"]');\n }\n errorMessage.hide();\n }\n }","title":""},{"docid":"299a6e0d96e1780e0b2f6715004a9ce9","score":"0.6134056","text":"async beforeValidate () {}","title":""},{"docid":"299a6e0d96e1780e0b2f6715004a9ce9","score":"0.6134056","text":"async beforeValidate () {}","title":""},{"docid":"299a6e0d96e1780e0b2f6715004a9ce9","score":"0.6134056","text":"async beforeValidate () {}","title":""},{"docid":"62bc40d0e82cb6b4f39b3a56e5de9cf6","score":"0.6130443","text":"function nkc_validate_fields(input){\n //input is an object of fields awaiting validation.\n for(i in nkc_validate_rules){\n if(input[i]!==undefined&&input[i]!==null) //if field exists\n if(nkc_validate_rules[i].test(input[i])==false)\n throw i.toString() +' not in correct format';\n }\n return true;\n}","title":""},{"docid":"5ac8c9253b1a11fe26d41c2ee02c99ba","score":"0.6124356","text":"function insert_validation(item) {\r\n }","title":""},{"docid":"ea63178bdf44ae683ffe72e50493fc24","score":"0.6123359","text":"function validateForm(){\n //validate first name at least 2 letters long\n if(firstName.value.length < 2){\n firstName.classList.add(\"error\");\n firstName.setAttribute(\"placeholder\", \"FIRST NAME IS REQUIRED\");\n }else{\n firstName.classList.remove(\"error\");\n }\n //validate geoLocation at least 10 letters long\n if(geoLocation.value.length < 8){\n geoLocation.classList.add(\"error\");\n geoLocation.setAttribute(\"placeholder\", \"LOCATION IS REQUIRED\");\n }else{\n geoLocation.classList.remove(\"error\");\n }\n // if it passes both validations, send to createFormObject //\n if((firstName.value.length > 2) && (geoLocation.value.length > 8)){\n createFormItem();\n }\n}","title":""},{"docid":"d334c41084d014c5ba9d7f7625b20aef","score":"0.61220765","text":"valid(value) {\n\t\treturn true\n\t}","title":""},{"docid":"cec833eb7f3b258403fdd6bda02b04da","score":"0.6117035","text":"checkValidInputs(objScope) {\n // Function check Error Input Field and display \n let height = 126;\n var validateFunctions = {\n \"email\": this.validateEmail,\n \"number\": this.checkValidNumber,\n \"tax\": this.checkTaxNumber,\n \"id\": this.checkIdNumber\n }\n let check = true;\n let content = \"\";\n let errorBlockContent = document.querySelector('.error-content');\n errorBlockContent.innerHTML = \"\";\n //Check required field\n let requiredFields = document.querySelectorAll('.input-information .user-input.required');\n requiredFields.forEach(element => {\n if (element.value == \"\") {\n content = \"Thiếu trường \\\"\" + element.parentElement.parentElement.querySelector('.name-information').innerText + \"\\\"\";\n errorBlockContent.appendChild(createErrorContent(content));\n check = false;\n height += 36\n }\n })\n let userInputs = $('.input-information .user-input');\n userInputs.each((index, element) => {\n let classListElement = element.classList;\n if (classListElement.contains(\"number-input\")) {\n content = \"Thông tin \\\"số điện thoại\\\" bị nhập sai\";\n if (!validateFunctions.number($(element).val()) || $(element).val() == \"\") {\n check = false;\n errorBlockContent.appendChild(createErrorContent(content));\n height += 36\n }\n } else if (classListElement.contains(\"email-input\")) {\n content = \"Thông tin \\\"email\\\" bị nhập sai\";\n if (!validateFunctions.email($(element).val())) {\n check = false;\n errorBlockContent.appendChild(createErrorContent(content));\n height += 36\n }\n } else if (classListElement.contains(\"tax-input\")) {\n content = \"Thông tin \\\"mã số thuế\\\" bị nhập sai\";\n if (!validateFunctions.tax($(element).val(), objScope)) {\n check = false;\n errorBlockContent.appendChild(createErrorContent(content));\n height += 36\n }\n } else if (classListElement.contains(\"input-currency\")) {\n content = \"Thông tin \\\"lương cơ bản\\\" bị nhập sai\";\n if (!validateFunctions.number($(element).val())) {\n check = false;\n errorBlockContent.appendChild(createErrorContent(content));\n height += 36\n }\n } else if (classListElement.contains(\"id-input\")) {\n content = \"Thông tin \\\"CMND\\\" bị nhập sai\";\n if (!validateFunctions.id($(element).val(), objScope)) {\n check = false;\n errorBlockContent.appendChild(createErrorContent(content));\n height += 36\n }\n }\n })\n // Check date picker field\n let datePickerField = document.querySelectorAll('.input-information input[type=\"date\"]');\n datePickerField.forEach(element => {\n if (element.value == \"\") {\n content = \"Thiếu trường \\\"\" + element.parentElement.querySelector('.name-information').innerText + \"\\\"\";\n errorBlockContent.appendChild(createErrorContent(content));\n check = false;\n height += 36\n }\n })\n $(\".popup-list\").css(\"height\", height + \"px\");\n return check;\n // Create error content\n function createErrorContent(content) {\n let blockErrorContent = document.createElement('div');\n blockErrorContent.classList.add('block-content');\n let iconError = document.createElement('div');\n iconError.classList.add('icon-error-list');\n let contentError = document.createElement('div');\n contentError.innerText = content;\n blockErrorContent.appendChild(iconError);\n blockErrorContent.appendChild(contentError);\n return blockErrorContent;\n }\n }","title":""},{"docid":"5754151e869f32221cd5953e7ef926f4","score":"0.6115914","text":"function formValidation(){\r\n clearErrors();\r\n if (validateFname() && validateLname() && validateStreetname() && validateCity() && validatePassword() && validateConfirmPassword() && validatePhone() && validatePostalCode() && validateUserName())\r\n return true;\r\n else\r\n return false;\r\n}","title":""},{"docid":"7e618134f5169d18926bcfba97e3438f","score":"0.6115883","text":"validateForm() {\n\n let isValid = this.validateAmount();\n\n if(!this.validateType()) {\n isValid = false;\n }\n\n if(!this.validateDescription()) {\n isValid = false;\n }\n\n return isValid;\n }","title":""},{"docid":"d6e9ee1f649d624d8cf67fdc3c9afad9","score":"0.6114689","text":"validate(data) {\n if (!data.message) data.message = [];\n if (!data.errors) data.errors = [];\n\n let value = data[this.field];\n let err = this.validator(value);\n if (err) data.errors.push(err);\n else data.message.push(this.field + \": \" + value);\n\n return data;\n }","title":""},{"docid":"04a7e7d69f30b9d595fbf31dcfb723d8","score":"0.6113246","text":"validateInputs(){\n if(!this.state.value.name){\n alert(\"Display name can't be blank\");\n return false;\n }else if(this.state.value.password1.length < 6){\n alert(\"Password must be greater than 6 characters\");\n return false;\n }else if(this.state.value.password1 != this.state.value.password2){\n alert(\"Passwords must match\");\n return false;\n }else{\n return true;\n }\n }","title":""},{"docid":"9c38b4628881a75d2fb9e47bc3637efa","score":"0.6111847","text":"function validateField(inputObj){ \n switch(inputObj.id){\n case(\"regUsr\"): \n return (checkLength(('#'+inputObj.id),\"username\",3,16)) && checkRegExp(('#'+inputObj.id),usrRegex,\"Username may consist of a-z, 0-9,'_'\");\n break;\n case(\"regEml\"): \n return(checkLength(('#'+inputObj.id),\"email\", 6,250) && checkRegExp(('#'+inputObj.id),emailRegex,\"eg. ab@abcde.com\"));\n break;\n case(\"regPwd\"): \n resetField(\"#pwdC\");//it resets the password confirmation field (textarea).\n return(checkLength(('#'+inputObj.id),\"password\",5,16) && checkRegExp(('#'+inputObj.id),pwdRegex,\"Insert at least 5 characters and 1 number\"));\n break;\n case(\"pwdC\"):\n return(passwordConfirm(\"#regPwd\",\"#pwdC\"));\n break;\n }\n}","title":""},{"docid":"cd5c1a0afa6415d5bd387a065f3f4dcc","score":"0.611082","text":"validateField(e) {\n let errors = []\n const { lead } = this.state\n return validateEmail(errors, lead.email)\n }","title":""},{"docid":"fbff6f9fd628262fcda2307de39c2fc7","score":"0.61075515","text":"validate(data) { // eslint-disable-line class-methods-use-this\n return data;\n }","title":""},{"docid":"eea8d2149ff0301d4da1772a02833ba6","score":"0.6104734","text":"function validateField( field ) {\n var errorText = \"\",\n error = false,\n value = field.val(),\n siblings = field.siblings( \".demo-errors\" );\n \n\nswitch ( field.attr( \"name\" ) ) {\n \n\n case \"FirstName\": \n if ( !validateLength( value, 3 ) ) {\n error = true;\n errorText += \"First Name too short ! <br />\";\n \n }\n \n if ( !expLettersOnly.test( value ) ) {\n error = true;\n errorText += \"The name can only contain letters and spaces!\";\n }\n break ; \n \n \n case \"LastName\": \n if ( !validateLength( value, 3 ) ) {\n error = true;\n errorText += \" Last Name too short ! <br />\";\n \n }\n \n if ( !expLettersOnly.test( value ) ) {\n error = true;\n errorText += \"The name can only contain letters and spaces!\";\n }\n break ; \n \n\n\n\n\n\n case \"FName\": \n if ( !validateLength( value, 3 ) ) {\n error = true;\n errorText += \" Father Name too short ! <br />\";\n }\n \n if ( !expLettersOnly.test( value ) ) {\n error = true;\n errorText += \"The name can only contain letters and spaces!\";\n }\n\n \n\n\n\n break;\n\n case \"MName\": \n if ( !validateLength( value, 3 ) ) {\n error = true;\n errorText += \" Mother name is too short!<br />\";\n }\n \n if ( !expLettersOnly.test( value ) ) {\n error = true;\n errorText += \"The name can only contain letters and spaces!\";\n }\n \n \n break;\n \n case \"DOB\": \n if ( !validateLength( value, 0 ) ) {\n error = true;\n errorText += \"Enter Date of Birth !<br />\";\n }\n \n break ; \n\n case \"Cast_Category\": \n \n if(validateSelect( $( \"#Cast_Category\" ) ))\n {\n\n error = true;\n errorText += \"Select Category<br />\";\n }\n\n break ; \n \n\n case \"Religion\": \n \n \n if(validateSelect( $( \"#Religion\" ) ))\n {\n\n error = true;\n errorText += \"Select Religion<br />\";\n \n }\n\n break ; \n \n case \"Stu_Category\": \n \n \n if(validateSelect( $( \"#Stu_Category\" ) ))\n {\n \n error = true;\n errorText += \"Select Student Category<br />\";\n \n }\n\n break ; \n \n case \"Email_id\": \n \n if ( !validateLength( value, 0 ) ) {\n error = true;\n errorText += \"Enter Email_id !<br />\";\n \n }\n \n\n if ( !expEmail.test( value ) ) {\n error = true;\n errorText += \"The email address format is invalid!\";\n }\n \n break;\n \n case \"Mobile_no\": \n \n if ( !expNumbers.test( value ) ) {\n error = true;\n errorText += \"Mobile no. Contain only Numbers \";\n }\n\nif ( !validateLength( value, 9 ) ) {\n error = true;\n errorText += \"Mobile Number lenght should be 10 !<br />\";\n \n }\n\nif ( !MobvalidateLength( value, 11 ) ) {\n error = true;\n errorText += \"Mobile Number lenght should be 10 !<br />\";\n \n }\n\n\n\n break;\n\n case \"Address\": \n \n if ( !validateLength( value, 0 ) ) {\n error = true;\n errorText += \"Enter Address !<br />\";\n \n }\n break;\n\n case \"City\": \n \n if ( !validateLength( value, 0 ) ) {\n error = true;\n errorText += \"Enter City !<br />\";\n \n }\n break;\n \n case \"Stu_Category\": \n \n \n if(validateSelect( $( \"#state\" ) ))\n {\n \n error = true;\n errorText += \"Select State<br />\";\n \n }\n\n break ; \n\n case \"Course\": \n \n \n if(validateSelect( $( \"#Course\" ) ))\n {\n \n error = true;\n errorText += \"Select Course<br />\";\n \n }\n\n break ; \n\n case \"Semester\": \n \n \n if(validateSelect( $( \"#Semester\" ) ))\n {\n \n error = true;\n errorText += \"Select Semester<br />\";\n \n }\n\n break ; \n\n case \"amount\": \n \n \n if ( !validateLength( value, 0 ) ) \n {\n error = true;\n errorText += \"Enter amount !<br />\";\n \n }\n if ( !expNumbers.test( value ) ) {\n error = true;\n errorText += \"Amount only contain number!\";\n }\n \n\n break ; \n\n case \"Draft_no\": \n \n \n if ( !validateLength( value, 0 ) ) \n {\n error = true;\n errorText += \"Enter Draft_no. !<br />\";\n \n }\n\n if ( !expNumbers.test( value ) ) {\n error = true;\n errorText += \"Draft no only contain number!\";\n }\n\n\n\n break ; \n \n case \"Draftdate\": \n \n \n if ( !validateLength( value, 0 ) ) \n {\n error = true;\n errorText += \"Enter Draft_no. !<br />\";\n \n }\n\n break ; \n\n case \"Payable\": \n \n \n if ( !validateLength( value, 0 ) ) \n {\n error = true;\n errorText += \"Enter Payable at : field !<br />\";\n \n }\n\n break ; \n\n case \"Bank1\": \n \n \n if(validateSelect( $( \"#Bank1\" ) ))\n {\n \n error = true;\n errorText += \"Select Bank<br />\";\n \n }\n\n break ; \n\n\n}\n\nsiblings.html( errorText );\n \nreturn !error;\n}","title":""},{"docid":"0ad27b1473ab33ff5131623f8a16af9d","score":"0.6103933","text":"function validate_employee_form(arg_object) {\n //\n var error = false;\n var basic_val_error = false;\n var emp_id_str_err = false;\n var unique_id_error = arg_object.unique_id_error;\n //\n // performing basic empty value validation for all input and select elements\n if (document.getElementById('department-select').value == 'transportation') {\n basic_val_error = basic_validate('add_employee','pay_rate,comments,emp-internal-id,base-rate-level,case-rate-level,stop-rate-level');\n }\n else {\n basic_val_error = basic_validate('add_employee','pay_rate,comments,base-rate-select,case-rate-select,stop-rate-select,base-rate-input,case-rate-input,stop-rate-input,base-rate-level,case-rate-level,stop-rate-level,emp-internal-id');\n }\n //\n if (basic_val_error) {\n error = true;\n }\n if (unique_id_error) {\n alert(\"The supplied Employee ID: \"+document.getElementById('emp-id').value+\" is already in use.\");\n add_class('invalid-field','emp-id')\n remove_class('hidden-elm','emp-id-uni-err')\n error = true;\n }\n else {\n remove_class('invalid-field','emp-id')\n add_class('hidden-elm','emp-id-uni-err')\n }\n //\n //\n if (error) {\n remove_class('hidden-elm','form-errors');\n }\n else {\n add_class('hidden-elm','form-errors');\n submit_employee_form(arg_object)\n }\n\n}","title":""},{"docid":"fae524c2d2a33e10c9a12c3ead0ef57a","score":"0.60949004","text":"validate(value) {\n\t\treturn this.test(value);\n\t}","title":""},{"docid":"532ef311c4bade204e5805d3e8ad7ae1","score":"0.6086355","text":"validateForm() {\n return (this.validateName() === 'success'\n && this.validateEmail() === 'success'\n && this.validateEmails() === 'success'\n );\n }","title":""},{"docid":"e0d8cc2b062b16857e815c918ce33c58","score":"0.60860467","text":"validate() {\n // Get generic API validation errors\n this._super();\n var errors = get(this, 'errors')||[];\n if ( !get(this, 'cluster.name') ) {\n errors.push('Name is required');\n }\n\n\n if ( !get(this, 'config.sshPublicKeyContents') ) {\n errors.push(intl.t('validation.required', { key: intl.t('clusterNew.oracleoke.ssh.label') }));\n }\n\n\n // Add more specific errors\n\n // Check something and add an error entry if it fails:\n // if ( parseInt(get(this, 'config.memorySize'), defaultRadix) < defaultBase ) {\n // errors.push('Memory Size must be at least 1024 MB');\n // }\n\n // Set the array of errors for display,\n // and return true if saving should continue.\n if ( get(errors, 'length') ) {\n set(this, 'errors', errors);\n return false;\n } else {\n set(this, 'errors', null);\n return true;\n }\n }","title":""},{"docid":"273e87700778f691ff6340a07ab1814b","score":"0.608225","text":"async validate() {\n // Set error if required field is empty.\n let thisValue = this.formInstance ? this.context.post[this.formInstance.id][this.name] : undefined;\n if (this.data.required && !thisValue) {\n // Set a general error message (that won't be repeated multiple times).\n // TODO: Translate.\n this.formInstance.setError('requiredFieldEmpty', 'Please fill in the required fields.');\n // Set an empty error message, to highlight the field in the theme.\n this.formInstance.setError(this.name, '');\n }\n\n // TODO: Flesh this out. We probably need to pass more information to the\n // validateFunction!\n for (let validateFunction of this.validateRegistry.getIterator()) {\n await validateFunction();\n }\n\n // Process sub-elements.\n for (let element of this.instanceRegistry.getIterator()) {\n if (element.validate) {\n await element.validate();\n }\n }\n }","title":""},{"docid":"61edc23f9229948ae2b2edb7e4c0a580","score":"0.6080131","text":"function validate(username,password){\nif(!Validation.username(username)){\nreturn \"2\";\n}\nif(!Validation.password(password)){\nreturn \"3\"\n}\nreturn \"1\";\n}","title":""}],"string":"[\n {\n \"docid\": \"c0a7655d0d51c9ae8ba639759bd33757\",\n \"score\": \"0.7258242\",\n \"text\": \"validate() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12d273ab92672cff7df1171f15f8ac3d\",\n \"score\": \"0.7239957\",\n \"text\": \"validate(_value, _utils) {\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad9c3a6f8bd76588ccfb525877d50997\",\n \"score\": \"0.7189689\",\n \"text\": \"validationWithParams () {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e215ebc6bef72574db4496488ab0c7dd\",\n \"score\": \"0.71617365\",\n \"text\": \"validate() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"189c2c76d7d3dea4cff1b8764827f292\",\n \"score\": \"0.70162266\",\n \"text\": \"function ValidationHelper() {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4bea808e8d14a3c34e96c31108eae632\",\n \"score\": \"0.6966872\",\n \"text\": \"isValid(){ /** todo */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c1447cc5e55e7d340900f1f55f12b14\",\n \"score\": \"0.68849194\",\n \"text\": \"setupValidations() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"951515dc2f0d6703df9089ecf7439103\",\n \"score\": \"0.688399\",\n \"text\": \"static validate(params)\\n {\\n //signature of each paramater\\n const keys = [\\n {\\n name : \\\"username\\\",\\n type : \\\"string\\\",\\n check : (val)=>{\\n const MIN_USERNAME_LEN = 3;\\n const MAX_USERNAME_LEN = 20;\\n\\n return (\\n val.match(/^[A-Za-z0-9_]+$/g) != null &&\\n val.length > MIN_USERNAME_LEN &&\\n val.length < MAX_USERNAME_LEN\\n );\\n }\\n },\\n {\\n name : \\\"avatar\\\",\\n type : \\\"string\\\"\\n },\\n {\\n name : \\\"dob\\\",\\n type : \\\"number\\\",\\n check : (val) => {\\n const MS_IN_YEAR = 31536000000;\\n const MIN_AGE = 13;\\n const maxDate = Date.now() - (MS_IN_YEAR * MIN_AGE);\\n return (val <= maxDate);\\n }\\n },\\n {\\n name : \\\"token\\\",\\n type : \\\"string\\\"\\n },\\n {\\n name : \\\"email\\\",\\n type : \\\"string\\\",\\n check : (val) => {\\n let match = val.match(/\\\\S+@\\\\S+\\\\.\\\\S+/);\\n return !(match === null || match[0] !== match.input);\\n }\\n },\\n {\\n name : \\\"country\\\",\\n type : \\\"string\\\",\\n check : (val) => {\\n return (val.length === 2);\\n }\\n }\\n ];\\n\\n return Validation.checkParams(params, keys);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfad416da9750afdda11552613b6cfa8\",\n \"score\": \"0.6813194\",\n \"text\": \"function validData() {\\n //\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f60141eb38ac7bedd96622a3d6965be6\",\n \"score\": \"0.6794226\",\n \"text\": \"validationNot () {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"118713d337b8367b96d2102a48747f67\",\n \"score\": \"0.6764349\",\n \"text\": \"validationAnd () {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee27ac5a3f06033f7e91ed7cf699e90d\",\n \"score\": \"0.6717506\",\n \"text\": \"function Validation() {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f034af7e0b36db75f05815c5266e1bb5\",\n \"score\": \"0.67085576\",\n \"text\": \"function validate (){\\n\\t return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cadc118349ffaca108cdec6cb9da0b67\",\n \"score\": \"0.6680783\",\n \"text\": \"function validatedata(dname,x_elements,y_elements){\\r\\n \\tvar newdata_value=x_elements;\\r\\n switch(y_elements){\\r\\n \\t\\t case 'required':\\r\\n\\t\\t\\t if(newdata_value == \\\"\\\" || newdata_value == null || newdata_value.length==0 )\\r\\n\\t\\t\\t{ \\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t \\r\\n\\t\\t\\t \\tmyApp.alert(capitalize(dname)+': This is required field','Error Message!');\\r\\n\\t\\t\\t return false;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase 'number':\\r\\n\\t\\t\\t if(valueIsNaN(newdata_value) || newdata_value == \\\"\\\" || newdata_value == null || newdata_value.length==0){\\r\\n\\t\\t\\t \\t myApp.alert(capitalize(dname)+': Please Enter Numaric value.','Error Message!');\\r\\n\\t\\t\\t return false;\\r\\n\\t\\t }\\r\\n\\t\\t break;\\r\\n\\t\\t case 'email':\\r\\n\\t\\t\\t\\t if(check_email(newdata_value)==false){\\r\\n\\t\\t\\t\\t \\tmyApp.alert(capitalize(dname)+': Please Enter Valid Email Address','Error Message!');\\r\\n\\t\\t\\t\\t\\t return false;\\r\\n\\t\\t\\t\\t }\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase 'phone':\\r\\n\\t\\t\\t\\t if(phonenumber(newdata_value)==false){\\r\\n\\t\\t\\t\\t \\t myApp.alert(capitalize(dname)+': Please Enter Valid Phone Number','Error Message!');\\r\\n\\t\\t\\t\\t return false;\\r\\n\\t\\t\\t\\t } \\r\\n\\t\\t break;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tdefault:\\r\\n\\t \\r\\n\\t if(y_elements!=null){\\r\\n\\t \\t var newdata=y_elements.split(',');\\r\\n for (var k=0; k < newdata.length; k++){\\r\\n\\t\\t \\r\\n\\t\\t if(validatedata(x_elements,newdata[k])===false){\\r\\n\\t\\t \\r\\n\\t \\t\\t break;\\r\\n\\t \\t }\\r\\n\\t\\t \\r\\n\\t\\t \\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de48b3dc6ef83d8959ec7136c73d0942\",\n \"score\": \"0.6680593\",\n \"text\": \"validate () {\\n let { type, required, minLength, maxLength } = this.props\\n let { value } = this.state\\n let isValid = !(required || minLength)\\n let errorText = ''\\n if (value === null && required) {\\n isValid = validator.isLength(String(value), { min: minLength })\\n errorText = ERROR_TXT.REQUIRED\\n }\\n if (required) {\\n if (type === 'number') {\\n isValid = !isNaN(value) && value !== ''\\n } else {\\n isValid = !validator.isEmpty(value)\\n }\\n errorText = isValid ? '' : ERROR_TXT.REQUIRED\\n }\\n // Check also for validity in the next validations\\n // Prevents from passing validation if a previous condition decided it was invalid\\n if (isValid) {\\n if (type === 'email') {\\n isValid = validator.isEmail(value)\\n errorText = errorText || ERROR_TXT.EMAIL\\n }\\n if (minLength) {\\n isValid = validator.isLength(String(value), { min: minLength })\\n errorText =\\n errorText || `El campo debe contener al menos ${minLength} caracteres`\\n }\\n if (maxLength) {\\n isValid = validator.isLength(String(value), { max: maxLength })\\n errorText =\\n errorText || `El campo debe contener máximo ${maxLength} caracteres`\\n }\\n }\\n this.setState({ isValid, errorText })\\n return isValid\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd82159a10bea4b0081e8c4f9c382760\",\n \"score\": \"0.66689974\",\n \"text\": \"is_valid() {\\n\\n /**\\n * validates , list for validate function\\n * value, control value\\n * error_message,errorMessage, error message, error_message for old version\\n */\\n const { \\n validates,\\n value,\\n errorMessages,\\n errorMessage,\\n error_message } = this.props;\\n\\n /**\\n * Empty error list before check\\n */\\n this.error_list = [];\\n\\n /**\\n * check validation\\n */\\n _.forEach(validates, func => {\\n if (_.functions(func)) {\\n const message = func(value);\\n if (message) {\\n\\n /**\\n * get error message\\n */\\n let error_mgs = '';\\n\\n /// gets errors message from error messages list\\n if (errorMessages && message.type && errorMessages[message.type]) {\\n error_mgs = errorMessages[message.type];\\n\\n /**\\n * if message is a object like { message: '' }\\n */\\n } else if (message.message) {\\n error_mgs = message.message;\\n } else {\\n error_mgs = message || errorMessage || error_message;\\n }\\n\\n this.error_list.push(error_mgs);\\n }\\n }\\n });\\n\\n return this.error_list.length === 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57ffc64f68b4ba047494980cfc3ba8e9\",\n \"score\": \"0.6658826\",\n \"text\": \"function validateAllInputFields()\\n{\\n validatePizzaRating();\\n validatePriceRating();\\n validateCustomerName();\\n validateCustomerEmail();\\n validateSuggestions();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24f84e34d3f31014bd29361bb9218b96\",\n \"score\": \"0.6656762\",\n \"text\": \"_validateFoodProvided(foodProvidedValue){\\n\\n let isValid;\\n // Validate for Empty Field\\n this._isFoodProvidedValid = isValid = this._validateForEmptyField(foodProvidedValue);\\n \\n return isValid\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a26658449b34ebde255e1f21c4d8ce43\",\n \"score\": \"0.66069144\",\n \"text\": \"function validate_form(){\\n return validate_name() && validate_number() && validate_email();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"819daa2bf8208a2e7925c948f6827a3c\",\n \"score\": \"0.65907013\",\n \"text\": \"validate() {\\n\\t\\t\\n\\t\\tconst valid = (\\n\\t\\t\\tvalidateName('firstName', this.state.firstName, (name, val, msg) => this.setError(val, msg)) &&\\n\\t\\t\\tvalidateName('lastName',this.state.lastName, (name, val, msg) => this.setError(val, msg)) &&\\n\\t\\t\\tvalidateHCN('HCN', this.state.HCN, (name, val, msg) => this.setError(val, msg)) &&\\n\\t\\t\\tvalidateEmail('email', this.state.email, (name, val, msg) => this.setError(val, msg)) &&\\n\\t\\t\\tvalidateAddress('address', this.state.address, (name, val, msg) => this.setError(val, msg)) &&\\n\\t\\t\\tvalidatePostalCode('postalCode', this.state.postalCode, (name, val, msg) => this.setError(val, msg)) &&\\n\\t\\t\\tvalidateDoctorID('doctorID', this.state.doctorID, (name, val, msg) => this.setError(val, msg)) \\n\\t\\t);\\n\\t\\t\\n\\t\\treturn valid;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f2ed77ce9b3510f15b9deb22e92307c\",\n \"score\": \"0.6589136\",\n \"text\": \"validationOr () {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4863072784c335abadcacad132025291\",\n \"score\": \"0.65698695\",\n \"text\": \"_validate() {\\n let validators = [];\\n if(this.props.required && !this.props.value) {\\n return 'This field is required.';\\n }\\n\\n return run_validators(validators, this.props.value);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a7ed39289a21c76f524fa5df83087a0\",\n \"score\": \"0.65338117\",\n \"text\": \"function checkAllInputFields()\\n{\\n // Variable names must be different from function names :-(\\n isPizzaRatingValid = checkIfPizzaRatingIsValid();\\n isPriceRatingValid = checkIfPriceRatingIsValid();\\n isCustomerNameValid = checkIfCustomerNameIsValid();\\n isCustomerEmailValid = checkIfCustomerEmailIsValid();\\n areSuggestionsValid = checkIfSuggestionsAreValid();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b6c0b127e101e5836832bbe610c6fb5\",\n \"score\": \"0.6529378\",\n \"text\": \"validateRequired (inputs) {\\n // define validation result\\n const validations = [];\\n // loop through data array\\n for (let input of inputs) {\\n if (input.type == 'string-number') {\\n if (\\n this.validation.isString (input.data) &&\\n this.validation.notEmptyString (input.data)\\n ) {\\n // continue\\n } else {\\n if (Number.isNaN (input.data - input.data)) {\\n let result = {\\n message: input.message ||\\n `${input.name} is required and should be string or number`,\\n fieldName: input.name,\\n };\\n // push the result into validations array\\n validations.push (result);\\n }\\n }\\n }\\n // check if type of input is string\\n if (input.type == 'string') {\\n if (\\n this.validation.isString (input.data) &&\\n this.validation.notEmptyString (input.data)\\n ) {\\n // continue\\n } else {\\n let result = {\\n message: input.message ||\\n `${input.name} is required and should be a valid ${input.type}`,\\n fieldName: input.name,\\n };\\n validations.push (result);\\n }\\n }\\n // method to check if the input is number\\n if (input.type == 'number') {\\n if (Number.isNaN (input.data - input.data)) {\\n let result = {\\n message: input.message ||\\n `${input.name} is required and should be a valid ${input.type}`,\\n fieldName: input.name,\\n };\\n // push the result into validations array\\n validations.push (result);\\n }\\n }\\n // check if type of input is object\\n if (input.type == 'object') {\\n if (\\n this.validation.isObject (input.data) &&\\n this.validation.notEmpty (input.data)\\n ) {\\n // continue\\n } else {\\n let result = {\\n message: input.message ||\\n `${input.name} is required and should be an ${input.type}`,\\n fieldName: input.name,\\n };\\n validations.push (result);\\n }\\n }\\n // check if the input is email\\n if (input.type == 'email') {\\n // continue\\n if (\\n this.validation.isString (input.data) &&\\n this.validation.notEmptyString (input.data) &&\\n this.validation.checkEmail (input.data)\\n ) {\\n // continue\\n } else {\\n let result = {\\n message: input.message ||\\n `${input.name} is required and should be a valid ${input.type}`,\\n fieldName: input.name,\\n };\\n validations.push (result);\\n }\\n }\\n // check if the input is phone number\\n if (input.type == 'phone') {\\n if (\\n this.validation.isString (input.data) &&\\n this.validation.notEmptyString (input.data) &&\\n input.data.length == 11 &&\\n input.data.startsWith ('0')\\n ) {\\n // continue\\n } else {\\n let result = {\\n message: input.message ||\\n `${input.name} is required and should be a valid ${input.type}, with 11 digit`,\\n fieldName: input.name,\\n };\\n validations.push (result);\\n }\\n }\\n // check if the type is file\\n if (input.type == 'image') {\\n // check if there are data\\n if (!input.data) {\\n // return error\\n let result = {\\n message: input.message ||\\n `${input.name} is required and should be an ${input.type}`,\\n fieldName: input.name,\\n };\\n // push validation errors into validations array\\n validations.push (result);\\n } else {\\n // check if the mime type is image\\n if (this.imagMimeTypes[input.data.mimetype]) {\\n // continue\\n } else {\\n let result = {\\n message: input.message ||\\n `${input.name} should be an ${input.type}`,\\n fieldName: input.name,\\n };\\n validations.push (result);\\n }\\n }\\n }\\n if (input.type == 'array') {\\n if (Array.isArray (input.data) && input.data.length > 0) {\\n // continue\\n } else {\\n let result = {\\n message: input.message ||\\n `${input.name} should be an ${input.type} and shouldn't be empty`,\\n fieldName: input.name,\\n };\\n validations.push (result);\\n }\\n }\\n // check the object has two properties\\n if (input.type == 'object' && input.length == '>=2') {\\n if (\\n this.validation.isObject (input.data) &&\\n this.validation.notEmpty (input.data) &&\\n Object.keys (input.data).length >= 2\\n ) {\\n // continue\\n } else {\\n let result = {\\n message: input.message ||\\n `${input.name} should be an ${input.type} and shouldn't be empty`,\\n fieldName: input.name,\\n };\\n validations.push (result);\\n }\\n }\\n if (input.type == 'boolean') {\\n if (input.data == true || input.data == false) {\\n // continue\\n } else {\\n let result = {\\n message: input.message || `${input.name} should be a ${input.type}`,\\n fieldName: input.name,\\n };\\n validations.push (result);\\n }\\n }\\n }\\n // return validations array\\n return validations;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e22b9cab7a9a5ad877c9365acfc5e6cc\",\n \"score\": \"0.65292364\",\n \"text\": \"function MakeValidation() {\\n vi=this;\\n vi.nameToMsg = function(str) // converts lowercase, hyphen separated input name to space separated Word Capitalized\\n {\\n var splitStr = str.toLowerCase().split('-');\\n for (var i = 0; i < splitStr.length; i++) {\\n splitStr[i] = splitStr[i].charAt(0).toUpperCase() + splitStr[i].substring(1);\\n }\\n return splitStr.join(' ');\\n };\\n vi.validate = function (item,type) // this does the validation\\n {\\n var err = 0;\\n var name = item.attr('name');\\n var value = item.val();\\n var msg = \\\"\\\";\\n switch (type)\\n {\\n case 'required':\\n if(value == '' || value === undefined) {\\n err = 1;\\n msg = vi.nameToMsg(name)+\\\" is a required field.\\\";\\n }\\n break;\\n case 'phone-usa':\\n if(!value.match(/^\\\\d\\\\d\\\\d\\\\-\\\\d\\\\d\\\\d-\\\\d\\\\d\\\\d\\\\d$/)) {\\n err = 1;\\n msg = \\\"Please enter a valid phone number\\\";\\n }\\n break;\\n // Add more validation types below\\n }\\n if(err > 0){\\n item.addClass('invalid');\\n }\\n $(\\\"#\\\"+name+\\\"-err-message\\\").text(msg);\\n // console.log( name+' '+value+' '+type+((err != 0)?' ERROR':' OK') );\\n return err;\\n };\\n vi.doValidation = function(item) {\\n if(item.attr('validate') === undefined) return 0;\\n var errors = 0;\\n var err = 0;\\n // the validation attribute is a comma separated list of validation types to apply to the input\\n var validations = item.attr('validate').split(',');\\n validations.forEach(function (type) {\\n if (err === 0) {\\n item.removeClass('invalid');\\n err = vi.validate(item, type);\\n errors += err;\\n }\\n });\\n return errors;\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6834b3db993e61702e7d1b980cd5fa4d\",\n \"score\": \"0.6497495\",\n \"text\": \"static validate(userData){\\n return userValidator.validate(userData);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e07e8e021ded5c0ec9aaae6e386e2499\",\n \"score\": \"0.64555436\",\n \"text\": \"validatefirsname(firsname){\\n if(validator.isEmpty(firsname)){\\n return 'firstname is required';\\n }\\n if(!validator.isAlpha(firsname)){\\n return 'name must be in letter';\\n }\\n\\n if(!validator.isLength(firsname, { min: 6 })){\\n return 'Name should be minimum 6 characters';\\n }else{\\n\\n }\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6095999d75241111fedba781d49efeaa\",\n \"score\": \"0.6433366\",\n \"text\": \"_validateFields(){\\n\\n let isValid = true;\\n\\n // Validate project state date value\\n isValid = this._validateProjectStartDate(this.state.projectStartDateValue);\\n if(!isValid)\\n return isValid;\\n\\n // Validate project end date value\\n isValid = this._validateProjectEndDate(this.state.projectEndDateValue);\\n if(!isValid)\\n return isValid;\\n\\n // Validate food provided value\\n isValid = this._validateFoodProvided(this.state.foodProvidedValue);\\n if(!isValid)\\n return isValid;\\n\\n // Validate current status value\\n isValid = this._validateCurrentStatus(this.state.currentStatusValue);\\n if(!isValid)\\n return isValid;\\n\\n // Validate project type value\\n isValid = this._validateProjectType(this.state.projectTypeValue);\\n if(!isValid)\\n return isValid;\\n\\n return isValid\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ef48eefa76f5451051f9501dc1f3f54\",\n \"score\": \"0.6429415\",\n \"text\": \"_validate() {\\n let validators = [new IntegerValidator()];\\n if(this.props.required && (this.props.value === null || this.props.value === undefined)) {\\n return 'This field is required.';\\n }\\n\\n if(this.props.min_value) {\\n validators.push(new MinValueValidator(this.props.min_value));\\n }\\n if(this.props.max_value) {\\n validators.push(new MaxValueValidator(this.props.max_value));\\n }\\n\\n return run_validators(validators, this.props.value);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a4b31911ac7440ac0aa2c59bf25a8f1\",\n \"score\": \"0.6423574\",\n \"text\": \"static validate(items, types) {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7b743f88313c79bd2654bb2cd625cec\",\n \"score\": \"0.6414443\",\n \"text\": \"function formDataValidate() {\\r\\n\\r\\n\\tvar date_format_regex = /^\\\\d{4}\\\\/\\\\d{2}\\\\/\\\\d{2}$/;\\r\\n\\r\\n\\tif (inputGetter.getBookName == BLANK) {\\r\\n\\t\\talert('Chưa nhập tên sách');\\r\\n\\t\\treturn false;\\r\\n\\t}\\r\\n\\r\\n\\tif (inputGetter.getBookTypeId == '0') {\\r\\n\\t\\talert('Chưa chọn chủng loại sách');\\r\\n\\t\\treturn false;\\r\\n\\t}\\r\\n\\r\\n\\tif (inputGetter.getAuthorId == '0') {\\r\\n\\t\\talert('Chưa chọn tác giả');\\r\\n\\t\\treturn false;\\r\\n\\t}\\r\\n\\r\\n\\r\\n\\t// check date in format yyyy/MM/dd\\r\\n\\tif (!inputGetter.getPublishDate.match(date_format_regex)) {\\r\\n\\t\\talert('Ngày xuất bản không đúng định dạng năm-tháng-ngày (yyyy/MM/dd)');\\r\\n\\t\\treturn false;\\r\\n\\t} else {\\r\\n\\t\\t//check date valid\\r\\n\\t\\tvar publishDate = new Date(inputGetter.getPublishDate);\\r\\n\\t\\tif (date.toString() == \\\"Invalid Date\\\") {\\r\\n\\t\\t\\talert('Ngày xuất bản không hợp lệ');\\r\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\r\\n\\tif (inputGetter.getOriginPrice > inputGetter.getSellPrice) {\\r\\n\\t\\talert('Giá bán phải không được thấp hơn giá gốc');\\r\\n\\t\\treturn false;\\r\\n\\t}\\r\\n\\r\\n\\treturn true;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"132cfedf83ad548cfda1cbf5e578724c\",\n \"score\": \"0.6406183\",\n \"text\": \"validate(detailName, value) {\\n\\n switch (detailName) {\\n\\n case 'name':\\n // name must not be blank. setting max length to 75 characters. Prefer to allow nonstandard names (like Q.Dogs) rather than risk a user not being able to enter their actual name. See: http://www.kalzumeus.com/2010/06/17/falsehoods-programmers-believe-about-names/\\n return value && value.length <= 75\\n\\n case 'email':\\n //this guy has thought of all of the edge cases - https://hackernoon.com/the-100-correct-way-to-validate-email-addresses-7c4818f24643 https://hackernoon.com/how-to-reduce-incorrect-email-addresses-df3b70cb15a9 .\\n //For the sake of learning, let's assume that my contacts will have email addresses that\\n //1. are not null (email is required)\\n //2. are 100 characters max\\n //3. match the sample email validation regex provided by MDN: https://developer.mozilla.org/en-US/docs/Web/HTML/Element/input/email#Validation\\n const emailRegex = RegExp(/^[a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*$/);\\n\\n return value && value.length <= 100 && emailRegex.test(value);\\n\\n case 'phoneNumber':\\n //Phone number is not required, but if provided, it should take the form of xxx-xxx-xxxx. If I were dealing with non-US numbers, I would expand this to include country code, different formats, etc. This won't catch invalid US numbers (like 111-111-1111), but the format will be correct.\\n const phoneNumberRegEx = RegExp(/^([0-9]{3}-[0-9]{3}-[0-9]{4})$/);\\n return value === null || phoneNumberRegEx.test(value);\\n\\n case 'imageUrl':\\n // I REALLY wanted to check whether images were broken, but as far as I can tell that requires some async skills I don't have yet. Alas. Will just check that value is of format somestring.someimageextension.\\n const imageUrlRegEx = RegExp(/(.)\\\\.(jpeg|jpg|gif|png|JPEG|JPG|GIF|PNG)$/);\\n return value === null || imageUrlRegEx.test(value);\\n\\n default:\\n break;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5dac0788c7e09156532721b536f8d032\",\n \"score\": \"0.64045626\",\n \"text\": \"function validate() {\\r\\n\\tvalid = true;\\r\\n\\tif (activeCategoryId == '')\\t{\\r\\n\\t\\talert ('Please select a Category.');\\r\\n\\t\\tvalid = false;\\r\\n\\t} else if (activeSubcategoryId == '' && $('#data_point_sublist').css('display') == 'block') {\\r\\n\\t\\talert ('Please select a Subcategory.');\\r\\n\\t\\tvalid = false;\\r\\n\\t} else if (objEntityForm.isDateRequired == 'Y' && $('#datepicker').val() == '') {\\r\\n\\t\\talert ('Please select a Date.');\\r\\n\\t\\tvalid = false;\\r\\n\\t} else if ($('#transcription').val() =='') {\\r\\n\\t\\talert ('Please insert a Transcription.');\\r\\n\\t\\tvalid = false;\\r\\n\\t} else if (objEntityForm.isStatusRequired == 'Y' && $('#statusAlert').val() == '') {\\r\\n\\t\\talert ('Please select a Status from the list.');\\r\\n\\t\\tvalid = false;\\r\\n\\t}\\r\\n\\telse if (objEntityForm.isDateRequired == 'Y') \\r\\n\\t{\\r\\n\\t\\t// For IWS-250 date validation In step 2, Data Date field on the data point entry form\\r\\n\\t\\tvar datePicker = $('#datepicker').val();\\r\\n\\t\\tif(isNaN(datePicker))\\r\\n\\t\\t{\\r\\n\\t\\t\\tif(checkDateFormat(datePicker))\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tvalid = true;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\treturn valid;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9e0122609d09a9022782633b87fea8a\",\n \"score\": \"0.63992596\",\n \"text\": \"validate(value){ //value represents the value given to the email while creatign instance of te model\\n if(!validator.isEmail(value)){\\n throw new Error('Email is invalid')\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2e905f2325786a8676f4b28fa0a2805\",\n \"score\": \"0.6372368\",\n \"text\": \"function validate_inputs() {\\t\\n\\tcheck_empty_fields();\\n\\tcompare_passwords();\\n\\tvalidate_email();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7677dde3c2764b1eef8122cfa876ab63\",\n \"score\": \"0.6367633\",\n \"text\": \"validateForm() {\\n const validName = this.validateName();\\n const validSerialNumber = this.validateSerialNumber();\\n\\n return validName && validSerialNumber;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03b811b989b3cfeafd67c95f9c53b04b\",\n \"score\": \"0.63629246\",\n \"text\": \"function validateTrue(nothing){\\n return true;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0903d5727fe7f8b1191a42baa80488c\",\n \"score\": \"0.63581455\",\n \"text\": \"isValidRecord(){ /** todo */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a48ec7834d112913baad16610d6d3b01\",\n \"score\": \"0.63546103\",\n \"text\": \"function validation(name, value, entityName, model) {\\n switch (name) {\\n case 'email':\\n return (value || '').isEmail();\\n case 'price':\\n return value.parseFloat() > 0;\\n case 'firstname':\\n case 'lastname':\\n case 'telephone':\\n case 'address':\\n case 'name':\\n return (value || '').length > 0;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84fbf2a8a33466bbbefd642a6f187b0a\",\n \"score\": \"0.6352498\",\n \"text\": \"validateInput(item,name,min,max) {\\nif(item.length==\\\"\\\") {\\nthis.toast(name+\\\"is required\\\");\\nreturn false;\\n}else if(item.length<min) {\\n this.toast(name+\\\"should be more than\\\"+min+\\\"characters\\\")\\n\\n return false;\\n}else if(item.length>max) {\\n this.toast(name+\\\"should less than\\\"+max+\\\"characters\\\")\\n return false;\\n}else {\\n return item;\\n}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69c30560120b7f546906a3b8495ebc2b\",\n \"score\": \"0.6347611\",\n \"text\": \"validate(fieldName, value, onSuccess, onError) {\\r\\n // If no validations property, do not validate\\r\\n if (!this.state.fields) {\\r\\n return\\r\\n }\\r\\n\\r\\n // We initially set isValid to true and then flip it if we\\r\\n // run a validator that invalidates the input\\r\\n let isValid = true\\r\\n \\r\\n let field = this.state.fields[fieldName]\\r\\n\\r\\n // We only validate if the input has value or if it is required\\r\\n if ((value || field.required) && typeof field.validations === 'string') {\\r\\n // We split on comma to iterate the list of validation rules\\r\\n field.validations.split(',').forEach((validation) => {\\r\\n\\r\\n // By splitting on \\\":\\\"\\\" we get an array of arguments that we pass\\r\\n // to the validator. ex.: isLength:5 -> ['isLength', '5']\\r\\n let args = validation.split(':')\\r\\n\\r\\n // We remove the top item and are left with the method to\\r\\n // call the validator with ['isLength', '5'] -> 'isLength'\\r\\n let validateMethod = args.shift()\\r\\n\\r\\n // We use JSON.parse to convert the string values passed to the\\r\\n // correct type. Ex. 'isLength:1' will make '1' actually a number\\r\\n args = args.map((arg) => { \\r\\n return JSON.parse(arg) \\r\\n })\\r\\n\\r\\n // We then merge two arrays, ending up with the value\\r\\n // to pass first, then options, if any. ['valueFromInput', 5]\\r\\n args = [value].concat(args)\\r\\n\\r\\n // So the next line of code is actually:\\r\\n // validator.isLength('valueFromInput', 5)\\r\\n if (typeof validator !== 'undefined') {\\r\\n if (!validator[validateMethod].apply(validator, args)) {\\r\\n isValid = false\\r\\n } \\r\\n }\\r\\n })\\r\\n }\\r\\n \\r\\n return isValid\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52bba3f9fcfed2cdd8d8c5f080d3fa47\",\n \"score\": \"0.63446355\",\n \"text\": \"function validator1() {\\n\\n return {\\n stringValidator: isItAllCap,\\n passwordValidator: areThereNum,\\n colorValidator: trueColor,\\n yearValidator: yearInterval\\n };\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cdbe755719283e9ae385f6a417712eb7\",\n \"score\": \"0.6310223\",\n \"text\": \"validate() {\\n this.checkValidInputs();\\n let errorInputs = this.checkSets();\\n this.setErrors(errorInputs);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c972f486bda0faadd5555077525dc026\",\n \"score\": \"0.6273746\",\n \"text\": \"function validBasedOnClass(thisClass) {\\r\\n\\t\\t\\tvar classBack = \\\"\\\";\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tswitch(thisClass) {\\r\\n\\t\\t\\t\\tcase \\\"\\\":\\r\\n\\t\\t\\t\\tcase \\\"invalid\\\":\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase \\\"reqd\\\":\\r\\n\\t\\t\\t\\t\\tif (allGood && thisTag.value == \\\"\\\") {\\r\\n\\t\\t\\t\\t\\t\\t\\tclassBack = \\\"invalid \\\";\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tclassBack += thisClass;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase \\\"radio\\\":\\r\\n\\t\\t\\t\\t\\tif (allGood && !radioPicked(thisTag.name)) {\\r\\n\\t\\t\\t\\t\\t\\tclassBack = \\\"invalid \\\";\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tclassBack += thisClass;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase \\\"email\\\":\\r\\n\\t\\t\\t\\t\\tif (allGood && !validEmail(thisTag.value)) {\\r\\n\\t\\t\\t\\t\\t\\tclassBack = \\\"invalid \\\";\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tclassBack += thisClass;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase \\\"confirm\\\":\\r\\n\\t\\t\\t\\t\\tif(document.getElementById(\\\"email\\\").value != document.getElementById(\\\"confirmEmail\\\").value){\\r\\n\\t\\t\\t\\t\\t\\tclassBack = \\\"invalid \\\";\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tclassBack += thisClass;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase \\\"phone\\\":\\r\\n\\t\\t\\t\\t\\tif (allGood && !validPhone(thisTag.value)){\\r\\n\\t\\t\\t\\t\\t\\tclassBack = \\\"invalid \\\";\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tclassBack += thisClass;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tdefault:\\r\\n\\t\\t\\t\\t\\tif (allGood && !crossCheck(thisTag,thisClass)) {\\r\\n\\t\\t\\t\\t\\t\\tclassBack = \\\"invalid \\\";\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tclassBack += thisClass;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn classBack;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// function crossCheck takes parameters for current tag being observed as inTag and current class being observed as otherFieldID\\r\\n\\t\\t\\t// if otherFieldID doesn't exist there's a problem, return false\\r\\n\\t\\t\\t// finally, boolean var is returned dependent upon whether the values for these parameters match or not\\r\\n\\t\\t\\tfunction crossCheck(inTag,otherFieldID) {\\r\\n if (!document.getElementById(otherFieldID)) {\\r\\n return false;\\r\\n }\\r\\n return (inTag.value == document.getElementById(otherFieldID).value);\\r\\n }\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc2b3959986b59a3d457f87a171b5d6b\",\n \"score\": \"0.62711847\",\n \"text\": \"validate() {\\n Object.entries(TOP_LEVEL_FIELDS).some(([field, { required }]) => {\\n if (required && !(field in this.fields))\\n throw new Error(`Missing field ${field}`);\\n return false;\\n });\\n\\n // authenticationToken && webServiceURL must be either both or none\\n if ('webServiceURL' in this.fields) {\\n if (!('authenticationToken' in this.fields))\\n throw new Error(\\n 'While webServiceURL is present, authenticationToken also required!',\\n );\\n if (this.fields.authenticationToken.length < 16)\\n throw new Error(\\n 'authenticationToken must be at least 16 characters long!',\\n );\\n } else if ('authenticationToken' in this.fields)\\n throw new Error(\\n 'authenticationToken is presented in Pass data while webServiceURL is missing!',\\n );\\n\\n // validate color fields\\n // valid values must be like rgb(123, 2, 22)\\n Object.keys(TOP_LEVEL_FIELDS)\\n .filter(v => v.endsWith('Color'))\\n .filter(v => v in this.fields)\\n .forEach(colorFieldName => {\\n const value = this.fields[colorFieldName];\\n try {\\n /^rgb\\\\(\\\\s*(\\\\d{1,3}),\\\\s*(\\\\d{1,3}),\\\\s*(\\\\d{1,3})\\\\s*\\\\)$/\\n .exec(value)\\n .slice(1)\\n .map(v => parseInt(v, 10))\\n .some(v => {\\n if (isNaN(v) || v < 0 || v > 255)\\n throw new Error(`Invalid color value ${value}`);\\n return false;\\n });\\n } catch (e) {\\n throw new Error(\\n `Color value \\\"${value}\\\" for field \\\"${colorFieldName}\\\" is invalid, must be an rgb(...)`,\\n );\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44142158049a0455dd0f5aec7f2fb08e\",\n \"score\": \"0.6271135\",\n \"text\": \"validate() {\\n\\n var is = this.is()\\n\\n if(is.err) return is\\n\\n var results = [],\\n validator = this\\n\\n /*\\n NOTE: rules are type options\\n */\\n Object.keys(this.options).forEach( (rule) => {\\n\\n let result = validator[rule](validator.options[rule])\\n\\n if(result.err) {\\n result.err.ruleKey = rule\\n results.push(result.err)\\n }\\n\\n })\\n\\n if(results.length == 0) {\\n return {valid: true}\\n }\\n\\n return {\\n err: results\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77701d81cab965fa04ae056fc340121e\",\n \"score\": \"0.62684166\",\n \"text\": \"function iecMinimalValidaion(){\\r\\n\\tvar response = true;\\r\\n\\tvar error = \\\"\\\";\\r\\n\\tvar category_classname = \\\"\\\";\\r\\n\\tvar errorPartA = \\\"\\\";\\r\\n\\tvar errorPartB = \\\"\\\";\\r\\n\\tvar errorPartC1_C5 = \\\"\\\";\\r\\n\\tvar phoneRegex = /[0-9 -()+]+$/;\\r\\n\\tvar emailRegex = /^[a-zA-Z0-9._-]+@[a-zA-Z0-9.-]+\\\\.[a-zA-Z]{2,6}$/;\\r\\n\\tif($(\\\"#entity_name\\\").val() == \\\"\\\"){\\r\\n\\t\\terrorPartA += \\\"Entity name cannot be empty\\\"+'<br/>';\\r\\n\\t\\tresponse = false;\\r\\n\\t}\\r\\n\\tif($(\\\"#entity_telephone\\\").val() != \\\"\\\" ){\\r\\n\\t\\tif(($(\\\"#entity_telephone\\\").val().length < 6) || (!phoneRegex.test($(\\\"#entity_telephone\\\").val()))){\\r\\n\\t\\t\\terrorPartA += \\\"Please enter valid landline number\\\"+'<br/>';\\r\\n\\t\\t\\tresponse = false;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\tif($(\\\"#entity_mobile1\\\").val() != \\\"\\\" ){\\r\\n\\t\\tif(($(\\\"#entity_mobile1\\\").val().length < 6) || (!phoneRegex.test($(\\\"#entity_mobile1\\\").val()))){\\r\\n\\t\\t\\terrorPartA += \\\"Please enter valid primary mobile number\\\"+'<br/>';\\r\\n\\t\\t\\tresponse = false;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\tif($(\\\"#entity_mobile2\\\").val() != \\\"\\\" ){\\r\\n\\t\\tif(($(\\\"#entity_mobile2\\\").val().length < 6) || (!phoneRegex.test($(\\\"#entity_mobile2\\\").val()))){\\r\\n\\t\\t\\terrorPartA += \\\"Please enter valid other mobile number\\\"+'<br/>';\\r\\n\\t\\t\\tresponse = false;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\tif($(\\\"#entity_email1\\\").val() != \\\"\\\" ){\\r\\n\\t\\tif(!emailRegex.test($(\\\"#entity_email1\\\").val())){\\r\\n\\t\\t\\terrorPartA += \\\"Please enter valid primary email address\\\"+'<br/>';\\r\\n\\t\\t\\tresponse = false;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\tif($(\\\"#entity_email2\\\").val() != \\\"\\\" ){\\r\\n\\t\\tif(!emailRegex.test($(\\\"#entity_email2\\\").val())){\\r\\n\\t\\t\\terrorPartA += \\\"Please enter valid alternate email address\\\"+'<br/>';\\r\\n\\t\\t\\tresponse = false;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\tif($(\\\"#entity_fax\\\").val() != \\\"\\\" ){\\r\\n\\t\\tif(!phoneRegex.test($(\\\"#entity_fax\\\").val())){\\r\\n\\t\\t\\terrorPartA += \\\"Please enter valid FAX number\\\"+'<br/>';\\r\\n\\t\\t\\tresponse = false;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\tif (!$('input[name=\\\"entity[category]\\\"]:checked').val()) {\\r\\n\\t\\terrorPartA += \\\"Please select the nature of concern/entity\\\"+'<br/>';\\r\\n\\t\\tresponse = false;\\r\\n\\t}\\r\\n\\tif($(\\\"#branch_total\\\").val() != '') {\\r\\n\\t\\tif(!$.isNumeric($(\\\"#branch_total\\\").val())){\\r\\n\\t\\t\\terrorPartB += \\\"Please enter valid number for total branches\\\"+'<br/>';\\r\\n\\t\\t\\tresponse = false;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t}\\r\\n\\tif(response){\\r\\n\\t\\t$('#error_message').hide();\\r\\n\\t\\t/*\\r\\n\\t\\tbootbox.confirm(\\\"Are you sure you want only to SAVE this form?\\\",'No','Yes',function(result) {\\r\\n\\t\\t if (result) {\\r\\n\\t\\t \\talert('hai');\\r\\n\\t\\t \\treturn true;\\r\\n\\t\\t } \\r\\n\\t\\t});*/\\r\\n\\t\\treturn true;\\r\\n\\t}else{\\r\\n\\t\\tvar show_target = $(\\\"#error_message\\\").offset().top;\\r\\n\\t\\tbootbox.alert(\\\"Form validaion failed, kindly check the error message before proceeding.\\\",function() {\\r\\n\\t\\t\\t$(\\\"html, body\\\").animate({ scrollTop: 100 }, \\\"slow\\\");\\r\\n\\t\\t});\\r\\n\\t\\tif(errorPartA){\\r\\n\\t\\t\\terror += \\\"<b>Part A:</b><br/>\\\"+errorPartA+\\\"<br/>\\\";\\r\\n\\t\\t}\\r\\n\\t\\tif(errorPartB){\\r\\n\\t\\t\\terror += \\\"<b>Part B:</b><br/>\\\"+errorPartB+\\\"<br/>\\\";\\r\\n\\t\\t}\\r\\n\\t\\tif(errorPartC1_C5){\\r\\n\\t\\t\\terror += errorPartC1_C5;\\r\\n\\t\\t}\\r\\n\\t\\t//$(\\\"#error_message\\\").attr('class', 'alert alert-error');\\r\\n\\t\\t$('#error_message').show();\\r\\n\\t\\t$(\\\"#error_message\\\").html(error);\\r\\n\\t\\treturn false;\\r\\n\\t}\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de90c2d9407d76d91d0fb84bb20dde07\",\n \"score\": \"0.6262441\",\n \"text\": \"function MSJT_validate_field(el_input, fldName) {\\n //console.log(\\\" ----- MSJT_validate_field ----\\\")\\n //console.log(\\\"fldName\\\", fldName)\\n let msg_err = null;\\n if (el_input){\\n const value = el_input.value;\\n //console.log(\\\"value\\\", value)\\n if ([\\\"code\\\", \\\"name\\\"].includes(fldName)) {\\n const caption = (fldName === \\\"code\\\") ? loc.Abbreviation : loc.Name;\\n const max_length = (fldName === \\\"code\\\") ? 8 : 50;\\n if (!value) {\\n msg_err = caption + loc.cannot_be_blank;\\n } else if (value.length > max_length) {\\n msg_err = caption + ( (fldName === \\\"code\\\") ? loc.is_too_long_MAX10 : loc.is_too_long_MAX50 );\\n }\\n } else if([\\\"sequence\\\"].includes(fldName)){\\n if (!value) {\\n msg_err = loc.Sequence + loc.cannot_be_blank;\\n } else {\\n const arr = b_get_number_from_input(loc, fldName, el_input.value);\\n msg_err = arr[1];\\n }\\n }\\n }\\n return msg_err;\\n } // MSJT_validate_field\",\n \"title\": \"\"\n },\n {\n \"docid\": \"301e47651327f9fe041713ddf9ce9366\",\n \"score\": \"0.6260221\",\n \"text\": \"handleValidation() {\\n const { siteConstants } = this.props.language;\\n\\n let fields = this.state.user;\\n // let errors = {};\\n let formIsValid = true;\\n\\n //Name\\n if (\\n fields.firstname == \\\"\\\" ||\\n fields.lastname == \\\"\\\" ||\\n fields.mobile_number == \\\"\\\"\\n ) {\\n formIsValid = false;\\n if (fields.firstname == \\\"\\\") {\\n this.setState({\\n errors: { firstname: siteConstants.ERR_CAN_NOT_BLANK }\\n });\\n }\\n if (fields.lastname == \\\"\\\") {\\n this.setState({\\n errors: { lastname: siteConstants.ERR_CAN_NOT_BLANK }\\n });\\n }\\n\\n if (fields.mobile_number == \\\"\\\") {\\n this.setState({ errors: { contact: siteConstants.ERR_CAN_NOT_BLANK } });\\n }\\n }\\n\\n if (fields.firstname !== \\\"\\\" && fields.firstname !== undefined) {\\n if (fields.firstname.match(/^[a-zA-Z]+$/) === null) {\\n formIsValid = false;\\n this.setState({\\n errors: { firstname: siteConstants.ERR_ONLY_LETTERS }\\n });\\n }\\n }\\n\\n if (fields.lastname !== \\\"\\\" && fields.lastname !== undefined) {\\n if (fields.lastname.match(/^[a-zA-Z]+$/) === null) {\\n formIsValid = false;\\n this.setState({ errors: { lastname: siteConstants.ERR_ONLY_LETTERS } });\\n }\\n }\\n\\n if (fields.mobile_number !== \\\"\\\" && fields.mobile_number !== undefined) {\\n if (String(fields.mobile_number).match(/^[0-9]*$/) === null) {\\n formIsValid = false;\\n this.setState({ errors: { contact: siteConstants.ERR_ONLY_NUMBERS } });\\n }\\n }\\n\\n return formIsValid;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb3197470d0302ddbc693d336d87aae2\",\n \"score\": \"0.6245587\",\n \"text\": \"function valid(){\\n if (!$scope.account.Attributes)$scope.account.Attributes = [];\\n var attrValidation = [];\\n\\n for(var i = 0 ; i < 12; i++) {\\n $scope['attrVldn_' + i] = [];\\n }\\n\\n for(var i = 0 ; i < $scope.account.Attributes.length; i++) {\\n $scope['attrVldn_' + i] = validationClass($scope.account.Attributes[i].Name, false);\\n attrValidation = attrValidation.concat($scope['attrVldn_' + i]);\\n }\\n $scope.nameVldn = $scope.usernameVldn = [];\\n $scope.nameVldn = validationClass($scope.account.DisplayName, false);\\n $scope.usernameVldn = validationClass($scope.account.Username, false);\\n return !$scope.nameVldn.concat($scope.usernameVldn).concat(attrValidation).includes('invalid');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3cfafde72df76463e1dd367377d104e8\",\n \"score\": \"0.6243738\",\n \"text\": \"function validate(data)\\r\\n {\\r\\n if(data.length > 0){return true;}else{return false;}\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37702a082c0773ccbf5ea97e4e33bd38\",\n \"score\": \"0.6236657\",\n \"text\": \"validate () {\\n const { required, minLength, maxLength, value } = this.props\\n let isValid = !(required || minLength)\\n let errorText = ''\\n if (required) {\\n isValid = !validator.isEmpty(value)\\n errorText = isValid ? '' : ERROR_TXT.REQUIRED\\n }\\n // Check also for validity in the next validations\\n // Prevents from passing validation if a previous condition decided it was invalid\\n if (isValid) {\\n if (minLength) {\\n isValid = validator.isLength(String(value), { min: minLength })\\n errorText =\\n errorText || `El campo debe contener al menos ${minLength} caracteres`\\n }\\n if (maxLength) {\\n isValid = validator.isLength(String(value), { max: maxLength })\\n errorText =\\n errorText || `El campo debe contener máximo ${maxLength} caracteres`\\n }\\n }\\n this.setState({ isValid, errorText })\\n return isValid\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0d27207f8594a93ad2d9aa6df8e865f\",\n \"score\": \"0.62342066\",\n \"text\": \"function validateMandatoryFields(){\\n\\n\\terrMsg = new Array();\\n\\terrCount=0;\\n\\n\\t//Colocar en el estado inicial al campo resaltado\\n\\tresetFields(field);\\n\\tfirstErr=null;\\n\\n\\t//Llamado a las funciones de validacion de los campos\\n\\tvalidate_treatment();\\t\\n\\tvalidate_name();\\t\\n\\tvalidate_lastname();\\t\\t\\n\\tvalidate_company_nm();\\t\\n\\tvalidate_cli_e_mail();\\t\\n\\tvalidate_cli_country_cd();\\t\\n\\tvalidate_cli_address();\\t\\n\\tvalidate_cli_postal_cd();\\t\\n\\tvalidate_cli_ident_num();\\n\\tvalidate_user_login();\\t\\n\\tvalidate_user_pass();\\n\\tvalidate_conf_user_pass();\\n\\t\\n\\t\\n\\n\\tif(errCount>0){\\n\\t\\tfor(i=0;i<1;i++){\\n\\t\\talert(errMsg[i]);\\n\\t }\\n\\t\\t\\n\\t\\tfield=firstErr.id;\\n\\t\\t//Resaltar el primer campo donde existe un error\\n\\t\\tdocument.getElementById('title_'+firstErr.id+'_underline').style.display='block';\\n\\t\\tdocument.getElementById('label_'+firstErr.id+'_underline').style.background='#FFFFCC';\\n\\t\\tdocument.getElementById('input_'+firstErr.id+'_underline').style.background='#FFFFCC';\\n\\n\\t\\t//Fijar el foco en el campo en el que se presenta el primer error\\n\\t\\tfirstErr.focus();\\n\\t\\tdocument.getElementById('title_'+firstErr.id+'_underline').scrollIntoView(true);\\n\\n\\t\\t//Mostrar la nota al pie aclarando el mensaje de error\\n\\t\\tdocument.getElementById('notaerror').style.display='inline';\\n\\n\\n\\t}else{\\n\\n\\t\\tdocument.forma.submit();\\n\\t}\\n\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f404f8c89c88cac546993d8d5bbb4daa\",\n \"score\": \"0.62325394\",\n \"text\": \"function validations() {\\n let layersModel = learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.api.layersModel;\\n if (layersModel === undefined) {\\n requiredErr(\\\">layers model<\\\");\\n }\\n\\n // Model Structure Validations:\\n if (layersModel.inputLayer === undefined) {\\n requiredErr(\\\">input layer<\\\");\\n }\\n if (layersModel.outputLayer === undefined) {\\n requiredErr(\\\">output layer<\\\");\\n }\\n if (layersModel.inputLayer.inputFeatures === undefined) {\\n requiredErr(\\\">input features<\\\");\\n }\\n if (layersModel.outputLayer.outputLabels === undefined) {\\n requiredErr(\\\">output labels<\\\");\\n }\\n if (layersModel.inputLayer.inputFeatures.dataFeatures.length === 0) {\\n requiredErr(\\\">input data features<\\\");\\n }\\n if (layersModel.outputLayer.outputLabels.dataLabels.length === 0) {\\n requiredErr(\\\">output data labels<\\\");\\n }\\n if (layersModel.layers.length === 0) {\\n requiredErr(\\\">Could not find any layers<\\\");\\n }\\n if (layersModel.inputLayer.referenceParent === undefined) {\\n requiredErr(\\\">input layer missing reference parent<\\\");\\n }\\n\\n // Model Compiler Validations:\\n if (learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.compile === undefined) {\\n requiredErr(\\\">compile node<\\\");\\n }\\n if (learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.compile.lossFunction === undefined) {\\n requiredErr(\\\">loss function<\\\");\\n }\\n if (learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.compile.lossFunction.config.value === undefined) {\\n requiredErr(\\\">loss function value<\\\");\\n }\\n if (learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.compile.optimizer === undefined) {\\n requiredErr(\\\">optimizer node<\\\");\\n }\\n if (learningSystem.machineLearningLibrary.typeOfLearning.typeOfModel.model.compile.optimizer.optimizerType === undefined) {\\n requiredErr(\\\">optimizer type node<\\\");\\n }\\n\\n //* Feature Validations: */\\n \\n // Data Features must be Uniquely Named:\\n /*let duplicates = () => {\\n let names = [];\\n layersModel.inputLayer.inputFeatures.dataFeatures.forEach(e => names.push(e.name));\\n return names;\\n };\\n if (layersModel.inputLayer.inputFeatures.dataFeatures.length !==\\n new Set(duplicates()).size) {\\n requiredErr(\\\">All Data Feature nodes must be uniquely named<\\\");\\n }*/\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82c3d275b7a1f704a86e6364f515fa40\",\n \"score\": \"0.621718\",\n \"text\": \"isValid(force, callValidation = true) {\\r\\n let ok = true;\\r\\n let elems = this.findAll('.bbn-input-component');\\r\\n if (Array.isArray(elems)) {\\r\\n bbn.fn.each(elems, a => {\\r\\n if ((bbn.fn.isFunction(a.isValid) && !a.isValid(a, callValidation))\\r\\n || (bbn.fn.isFunction(a.validation) && !a.validation())\\r\\n ) {\\r\\n ok = false;\\r\\n }\\r\\n if ( !ok ){\\r\\n return false;\\r\\n }\\r\\n });\\r\\n }\\r\\n if (ok && this.validation && callValidation) {\\r\\n ok = this.validation(this.source, this.originalData, force)\\r\\n }\\r\\n return !!ok;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4046e5a6e5b0433e232431f53dfd0204\",\n \"score\": \"0.6208849\",\n \"text\": \"validfields(f1,f2){\\n //if they are full its time for next validation\\n if(f1 !== '' && f2 !== ''){\\n //if url is valid its time for name length\\n if(f2.search('.com') !== -1){\\n if(f1.length < 16){\\n //everything is good so book should be added\\n return 'done';\\n }\\n //if intered info unvalid we should tell user what is wronge\\n else{\\n alert('name must be shorter');\\n }\\n }\\n else{\\n alert('(.com) in url is missing');\\n }\\n }\\n else{\\n alert('please fill the fields');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f52d592f93fb277e7c1059ddde44f151\",\n \"score\": \"0.6208147\",\n \"text\": \"handleValidation(){\\n let fields = this.state.fields;\\n let errors = {};\\n let formIsValid = true;\\n \\n //Name\\n if(!fields[\\\"name\\\"]){\\n formIsValid = false;\\n errors[\\\"name\\\"] = \\\"*Name is required\\\";\\n }\\n \\n \\n \\n //Email\\n if(!fields[\\\"email\\\"]){\\n formIsValid = false;\\n errors[\\\"email\\\"] = \\\"*Email is Required\\\";\\n }\\n \\n if(typeof fields[\\\"email\\\"] !== \\\"undefined\\\"){\\n let lastAtPos = fields[\\\"email\\\"].lastIndexOf('@');\\n let lastDotPos = fields[\\\"email\\\"].lastIndexOf('.');\\n \\n if (!(lastAtPos < lastDotPos && lastAtPos > 0 && fields[\\\"email\\\"].indexOf('@@') === -1 && lastDotPos > 2 && (fields[\\\"email\\\"].length - lastDotPos) > 2)) {\\n formIsValid = false;\\n errors[\\\"email\\\"] = \\\"Email is not valid\\\";\\n }\\n } \\n \\n \\n if(!fields[\\\"verifyno\\\"]){\\n formIsValid = false;\\n errors[\\\"verifyno\\\"] = \\\"*Verify Code Required\\\";\\n } \\n if(typeof fields[\\\"verifyno\\\"] !== \\\"undefined\\\"){\\n if(!fields[\\\"verifyno\\\"].match(/^[0-9]+$/)){\\n formIsValid = false;\\n errors[\\\"verifyno\\\"] = \\\"Only Digits Allow\\\";\\n } \\n }\\n\\n \\n\\n \\n if(!fields[\\\"password\\\"]){\\n formIsValid = false;\\n errors[\\\"password\\\"] = \\\"*Password Is Required\\\";\\n } \\n \\n if(!fields[\\\"cpassword\\\"]){\\n formIsValid = false;\\n errors[\\\"cpassword\\\"] = \\\"*Conform Password Is Required\\\";\\n } \\n \\n this.setState({errors: errors});\\n return formIsValid;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50993bdbddb2e8e0cc6e6780a6c766e0\",\n \"score\": \"0.62042546\",\n \"text\": \"function FValidation( obj, property, value, options ){\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebc0c78510c24fd29e7d389783d872a1\",\n \"score\": \"0.62036854\",\n \"text\": \"function validateInfo(){\\r\\n\\tvalidateEmail();\\r\\n\\tvalidatePhone();\\r\\n\\tvalidateAddress();\\r\\n\\tvalidateDate();\\r\\n\\tvalidateTime();\\r\\n\\t\\r\\n\\treturn false;\\r\\n}\\t// End validateInfo\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58147b22f63f20d8d4167cb73fc12d6c\",\n \"score\": \"0.6194574\",\n \"text\": \"function validate(data, model, toCheck){\\n\\n\\t\\t\\tvar errors = {}; \\n\\t\\t\\tvar hasErrors = false; \\n\\t\\t\\tvar thisModel = models[model];\\n\\n\\t\\t\\ttoCheck.forEach(function(field){\\n\\t\\t\\t\\tvar formattedData = thisModel[field].format(data[field]);\\n\\t\\t\\t\\tif (!thisModel[field].regex.test(formattedData)) {\\n\\t\\t\\t\\t\\terrors[field] = thisModel[field].errMessage; \\n\\t\\t\\t\\t\\thasErrors = true; \\n\\t\\t\\t\\t}\\n\\t\\t\\t});\\n\\n\\t\\t\\tif (hasErrors) return errors;\\n\\t\\t\\telse return null; \\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06a56ec8a4bc33897c9cd55f3a852ca3\",\n \"score\": \"0.6192889\",\n \"text\": \"function formValidation()\\r\\n{\\r\\n// Declaring form elements from line5 to line14\\r\\nvar uid = document.registration.userid;\\r\\nvar passid = document.registration.passid;\\r\\nvar uname = document.registration.username;\\r\\nvar uadd = document.registration.address;\\r\\nvar ucountry = document.registration.country;\\r\\nvar uzip = document.registration.zip;\\r\\nvar uemail = document.registration.email;\\r\\nvar umsex = document.registration.msex;\\r\\nvar ufsex = document.registration.fsex; \\r\\n\\r\\n// calling respective validation method for each element\\r\\nif(userid_validation(uid,5,12))\\r\\n{\\r\\nif(passid_validation(passid,7,12))\\r\\n{\\r\\nif(allLetter(uname))\\r\\n{\\r\\nif(alphanumeric(uadd))\\r\\n{ \\r\\nif(countryselect(ucountry))\\r\\n{\\r\\nif(allnumeric(uzip))\\r\\n{\\r\\nif(ValidateEmail(uemail))\\r\\n{\\r\\nif(validsex(umsex,ufsex))\\r\\n{\\r\\n}\\r\\n} \\r\\n}\\r\\n} \\r\\n}\\r\\n}\\r\\n}\\r\\n}\\r\\nreturn false;\\r\\n\\r\\n//Defining userid validation method using three parameters\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"510e4355926f39a3b5312f1a32b9f4eb\",\n \"score\": \"0.61901623\",\n \"text\": \"_validateField(name, value, schemaField) {\\n\\n schemaField._validateSchemaField.call(this, value, schemaField);\\n\\n //additional validation\\n if (typeof schemaField.validation === \\\"function\\\")\\n if (!schemaField.validation.call(this, value, name, schemaField))\\n throw new Exception(\\\"Additional Validation was not passed\\\", {name});\\n\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc757349ee88cc4260e8b2ef3e0f2d8d\",\n \"score\": \"0.6189634\",\n \"text\": \"_validateProjectType(projectTypeValue){\\n\\n let isValid;\\n\\n // Validate for Empty Field\\n this._isProjectTypeValid = isValid = this._validateForEmptyField(projectTypeValue);\\n\\n return isValid\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0be67132b48e598a48ee2947fe11a264\",\n \"score\": \"0.61877275\",\n \"text\": \"getValidationState(key) {\\n var input = this.state[key];\\n if (!input) return null;\\n if (key === 'phone') {\\n var phone_num = /^\\\\+(\\\\d+)\\\\d{10}/.exec(input);\\n var all_num = /^(\\\\d{10})$/.exec(input);\\n if (phone_num || all_num) return 'success';\\n else return 'error';\\n }\\n if (key === 'email') {\\n return (emailRegex.test(input) ? 'success' : 'error');\\n }\\n if (key === 'name') return (/^[A-Za-z\\\\s]+$/.test(input) ? 'success' : 'error');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2b42109a5425a5496148e95dc496b2d\",\n \"score\": \"0.6185785\",\n \"text\": \"function ValidationHelper() {\\n var SectionIDs = new Array();\\n var CurrentValidationSectionID;\\n var _excludedIDsInCurrentSection = [];\\n\\n this.AddSectionID = function(sectionId) {\\n SectionIDs.push(sectionId);\\n };\\n\\n this.SetCurrentValidationSectionID = function(sectionId, excludedControlIDs) {\\n CurrentValidationSectionID = sectionId;\\n\\n if (excludedControlIDs) {\\n _excludedIDsInCurrentSection = excludedControlIDs;\\n } else {\\n _excludedIDsInCurrentSection = [];\\n }\\n };\\n\\n this.IsNeedValidate = function(controlId) {\\n if (SectionIDs.length == 0) {\\n return true;\\n }\\n\\n // Always vlidate the field if user input a invalid value and left it.\\n var e = getEvent();\\n\\n if (e != null) {\\n if (e.type == \\\"blur\\\") {\\n return true;\\n }\\n }\\n\\n if (CurrentValidationSectionID == null || CurrentValidationSectionID == '')//don't need to validate the field in editor form\\n {\\n if (_excludedIDsInCurrentSection.contains(controlId)) {\\n return false;\\n }\\n\\n for (var i = 0; i < SectionIDs.length; i++) {\\n if (controlId.indexOf(SectionIDs[i]) > -1) {\\n return false;\\n }\\n }\\n\\n return true;\\n } else// validate the fields of section which indicated by \\\"CurrentValidationSectionID\\\"\\n {\\n var isInCurrentSection = controlId.indexOf(CurrentValidationSectionID) > -1;\\n var isExcludedControl = _excludedIDsInCurrentSection.contains(controlId);\\n\\n return isInCurrentSection && !isExcludedControl;\\n }\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81b2535f138d08ee96392e180638428b\",\n \"score\": \"0.6183326\",\n \"text\": \"function validateForm()\\n{\\n \\n return(validateTaskName() && \\n validateStatus() && \\n validateAssignee() && \\n validateDueDate() && \\n validateDescriptionBox());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b1fdb85d195b0d1e5cf6078d34aa32e\",\n \"score\": \"0.6182998\",\n \"text\": \"_validate(input) {\\n const {name, email, suggestion} = input\\n let isValid = true\\n\\n if (name && name.trim()) {\\n this.setState({\\n invalidName: false\\n })\\n } else {\\n isValid = false\\n this.setState({\\n invalidName: true\\n })\\n }\\n\\n if (suggestion && suggestion.trim()) {\\n this.setState({\\n invalidSuggestion: false\\n })\\n } else {\\n isValid = false\\n this.setState({\\n invalidSuggestion: true\\n })\\n }\\n\\n if (validateEmail(email)) {\\n this.setState({\\n invalidEmail: false\\n })\\n } else {\\n isValid = false\\n this.setState({\\n invalidEmail: true\\n })\\n }\\n\\n return isValid\\n\\n function validateEmail(email) {\\n const re = /^\\\\w+@[a-zA-Z_]+?\\\\.[a-zA-Z]{2,3}$/\\n return re.test(email)\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01f01030aff646197d8cdd87d762ffaa\",\n \"score\": \"0.6178051\",\n \"text\": \"function Section_Validate_Variable____________________________________________(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01f01030aff646197d8cdd87d762ffaa\",\n \"score\": \"0.6178051\",\n \"text\": \"function Section_Validate_Variable____________________________________________(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d10982b36234b86eddd8bda4734d7d9\",\n \"score\": \"0.61778975\",\n \"text\": \"validateRequest(req, res, next) {\\n let isValid = true;\\n \\n req.body.email ? isValid = validateEmail(req.body.email) : isValid = false;\\n req.body.cnpj ? isValid = validateCNPJ(req.body.cnpj) : isValid = false;\\n if (!req.body.slug) isValid = false;\\n if (!req.body.razao_social) isValid = false;\\n \\n if (isValid) {\\n next()\\n }\\n else {\\n return responses.failure(res, 'ERROR: body invalid');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c0c8269ace8ffd3b37efe42a5598eb6\",\n \"score\": \"0.6172024\",\n \"text\": \"function testValidateAux(){\\n //Cases to be tested\\n const cases = [\\n {input:{name:{value:\\\"\\\",type:\\\"\\\"}, gender:{value:\\\"\\\",type:\\\"\\\"}, email:{value:\\\"\\\",type:\\\"email\\\"}, iseasy:{value:\\\"\\\",type:\\\"\\\"}},\\n output:{name:false, gender:false, email:false, iseasy:false}},\\n {input:{name:{value:\\\" \\\",type:\\\"\\\"}, gender:{value:\\\" \\\",type:\\\"\\\"}, email:{value:\\\" \\\",type:\\\"email\\\"}, iseasy:{value:\\\" \\\",type:\\\"\\\"}},\\n output:{name:false, gender:false, email:false, iseasy:false}},\\n {input:{name:{value:\\\"Vin\\\",type:\\\"\\\"}, gender:{value:\\\"Male\\\",type:\\\"\\\"}, email:{value:\\\"vin@vin\\\",type:\\\"email\\\"}, iseasy:{value:\\\"true\\\",type:\\\"\\\"}},\\n output:{name:true, gender:true, email:false, iseasy:true}},\\n {input:{name:{value:\\\"Bob\\\",type:\\\"\\\"}, gender:{value:\\\"Male\\\",type:\\\"\\\"}, email:{value:\\\"bobby@.com\\\",type:\\\"email\\\"}, iseasy:{value:\\\" \\\",type:\\\"\\\"}},\\n output:{name:true, gender:true, email:false, iseasy:false}},\\n {input:{name:{value:\\\"Vin Ndokaj\\\",type:\\\"\\\"}, gender:{value:\\\"Male\\\",type:\\\"\\\"}, email:{value:\\\"@.com\\\",type:\\\"email\\\"}, iseasy:{value:\\\"true\\\",type:\\\"\\\"}},\\n output:{name:true, gender:true, email:false, iseasy:true}},\\n {input:{name:{value:\\\"Haidar\\\",type:\\\"\\\"}, gender:{value:\\\"Male\\\",type:\\\"\\\"}, email:{value:\\\"haidar@e.e\\\",type:\\\"email\\\"}, iseasy:{value:\\\"false\\\",type:\\\"\\\"}},\\n output:{name:true, gender:true, email:false, iseasy:true}},\\n {input:{name:{value:\\\"Isabella\\\",type:\\\"\\\"}, gender:{value:\\\"Female\\\",type:\\\"\\\"}, email:{value:\\\"iz@.edu\\\",type:\\\"email\\\"}, iseasy:{value:\\\"true\\\",type:\\\"\\\"}},\\n output:{name:true, gender:true, email:false, iseasy:true}},\\n {input:{name:{value:\\\"Tyna\\\",type:\\\"\\\"}, gender:{value:\\\"Female\\\",type:\\\"\\\"}, email:{value:\\\"bpl@bpl.e\\\",type:\\\"email\\\"}, iseasy:{value:\\\"\\\",type:\\\"\\\"}},\\n output:{name:true, gender:true, email:false, iseasy:false}},\\n {input:{name:{value:\\\"Ronnie Coleman\\\",type:\\\"\\\"}, gender:{value:\\\"Male\\\",type:\\\"\\\"}, email:{value:\\\"yeah@buddy.com\\\",type:\\\"email\\\"}, iseasy:{value:\\\"true\\\",type:\\\"\\\"}},\\n output:{name:true, gender:true, email:true, iseasy:true}},\\n ]\\n\\n //goes through test cases and checks for correct output\\n console.log(\\\"Test cases:\\\");\\n var i;\\n for(i = 0; i < cases.length; i++){\\n if(\\n validateAux(cases[i].input.name) != cases[i].output.name ||\\n validateAux(cases[i].input.gender) != cases[i].output.gender ||\\n validateAux(cases[i].input.email) != cases[i].output.email ||\\n validateAux(cases[i].input.iseasy) != cases[i].output.iseasy\\n ) {console.log(\\\"Case \\\" + i + \\\" failed.\\\");}\\n else {console.log(\\\"Case \\\" + i + \\\" passed.\\\");}\\n }\\n} //end testValidateAux\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1a120df8bb171fd93debf6c38069c31\",\n \"score\": \"0.61719114\",\n \"text\": \"validate() {\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36ee8b4656fba75bdc28b2dc7782ca5d\",\n \"score\": \"0.61716396\",\n \"text\": \"validate(method=\\\"all\\\") {\\n if(method != \\\"all\\\" && method != \\\"touched\\\") {\\n throw \\\"Unknown validation method \\\" + method;\\n }\\n\\n // convinence func to check method before showing\\n const methodShow = (input, name, message) => {\\n // check method for showing the error message\\n if(method == \\\"all\\\" || (method == \\\"touched\\\" \\n && $(input).data(\\\"touched\\\") === \\\"true\\\")) {\\n this.show(name, message);\\n }\\n }\\n \\n var isValid = true;\\n // check if required fields have content\\n $(\\\"[required]\\\").each((_, input) => {\\n // .trim() to ignore whitespace\\n if($(input).val().trim().length <= 0) {\\n const name = $(input).attr(\\\"name\\\");\\n methodShow(input, name, name + \\\" is required\\\");\\n isValid = false;\\n }\\n });\\n\\n // check if passwords match\\n const password = $(\\\"#student-password\\\").val();\\n const confirmPassword = $(\\\"#student-confirm-password\\\").val();\\n if(password.length > 1 && password !== confirmPassword)\\n {\\n methodShow($(\\\"#student-password\\\").get(0),\\n \\\"password\\\", \\\"Passwords do not match\\\");\\n isValid = false;\\n }\\n\\n // check if mentor selected is valid\\n if(this.extractMentor() == null) {\\n methodShow($(\\\"#student-mentor\\\").get(0),\\n \\\"mentorId\\\", \\\"Name a single lecturer to be your mentor\\\");\\n isValid = false;\\n }\\n\\n // check if skillsets selected are valid\\n // only if any skillsets has been added\\n const skillsets = this.extractSkillsets();\\n if(skillsets == null && $(\\\"#student-skillsets\\\").data(\\\"touched\\\") == \\\"true\\\") {\\n this.show(\\\"skillSets\\\", \\\"Please select skillsets only the provided skillsets\\\");\\n isValid = false;\\n }\\n \\n // check if the photo selected is valid \\n // (ie is it actually a photo)\\n const file = this.extractPhoto();\\n if(file != null && /^image\\\\/[a-zA-Z]+$/.test(file.type) == false) {\\n methodShow($(\\\"#student-photo\\\").get(0),\\n \\\"picture\\\", \\\"Please select a image file\\\");\\n }\\n\\n\\n if(isValid === false) this.scrollFirstShown();\\n\\n return isValid;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20bc4771e43bfac9d6d4e66c96a0c07a\",\n \"score\": \"0.61700076\",\n \"text\": \"function validate() {\\n if (name === null) {\\n alert(\\\"Enter the name please\\\");\\n return false;\\n }\\n if (className === null) {\\n alert(\\\"Enter class name please\\\");\\n return false;\\n }\\n if (location === null) {\\n alert(\\\"Enter location please\\\");\\n return false;\\n }\\n if (edu === null) {\\n alert(\\\"Enter the Education Buddy please\\\");\\n return false;\\n }\\n if (pd === null) {\\n alert(\\\"Enter the personal development buddy\\\");\\n return false;\\n }\\n if (gitHub === null) {\\n alert(\\\"Enter github id please\\\");\\n return false;\\n }\\n\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20bc4771e43bfac9d6d4e66c96a0c07a\",\n \"score\": \"0.61700076\",\n \"text\": \"function validate() {\\n if (name === null) {\\n alert(\\\"Enter the name please\\\");\\n return false;\\n }\\n if (className === null) {\\n alert(\\\"Enter class name please\\\");\\n return false;\\n }\\n if (location === null) {\\n alert(\\\"Enter location please\\\");\\n return false;\\n }\\n if (edu === null) {\\n alert(\\\"Enter the Education Buddy please\\\");\\n return false;\\n }\\n if (pd === null) {\\n alert(\\\"Enter the personal development buddy\\\");\\n return false;\\n }\\n if (gitHub === null) {\\n alert(\\\"Enter github id please\\\");\\n return false;\\n }\\n\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9203ce10bdd04cfb3bdf34f864658344\",\n \"score\": \"0.61684406\",\n \"text\": \"checkInput() {\\n // Check if `libccurl` is available\\n if (!this.libccurl.hasOwnProperty('ccurl_pow')) {\\n return new Error('Hashing not available');\\n }\\n\\n // Check if valid `trunkTransaction` was passed\\n if (!this.iota.valid.isHash(this.trunkTransaction)) {\\n return new Error('Invalid trunkTransaction');\\n }\\n\\n // Check if valid `branchTransaction` was passed\\n if (!this.iota.valid.isHash(this.branchTransaction)) {\\n return new Error('Invalid branchTransaction');\\n }\\n\\n // Check if a valid `minWeightMagnitude` was passed\\n if (!this.iota.valid.isValue(this.minWeightMagnitude)) {\\n return new Error('Invalid minWeightMagnitude');\\n }\\n\\n // Check if the passed trytes are valid\\n if (!this.iota.valid.isArrayOfTrytes(this.trytes)) {\\n return new Error('Invalid trytes supplied');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54549765102022c44eb1066427f02889\",\n \"score\": \"0.6163745\",\n \"text\": \"function MSUBJ_validate_field(el_input, fldName) {\\n //console.log(\\\" ----- MSUBJ_validate_field ----\\\")\\n //console.log(\\\"fldName\\\", fldName)\\n let msg_err = null;\\n if (el_input){\\n const value = el_input.value;\\n //console.log(\\\"value\\\", value)\\n if ([\\\"code\\\", \\\"name_nl\\\", \\\"name_en\\\", \\\"name_pa\\\"].includes(fldName)) {\\n const caption = (fldName === \\\"code\\\") ? loc.Abbreviation : loc.Name;\\n const max_length = (fldName === \\\"code\\\") ? 8 : 50;\\n // \\\"name_en\\\" and \\\"name_pa\\\" can be blank\\n if (!value && [\\\"code\\\", \\\"name_nl\\\"].includes(fldName)) {\\n msg_err = caption + loc.cannot_be_blank;\\n } else if (value.length > max_length) {\\n msg_err = caption + ( (fldName === \\\"code\\\") ? loc.is_too_long_MAX10 : loc.is_too_long_MAX50 );\\n };\\n } else if([\\\"sequence\\\"].includes(fldName)){\\n if (!value) {\\n msg_err = loc.Sequence + loc.cannot_be_blank;\\n } else {\\n const arr = b_get_number_from_input(loc, fldName, el_input.value);\\n msg_err = arr[1];\\n };\\n };\\n };\\n return msg_err;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60cdf49fd6f978c0f93a3f3be97444ae\",\n \"score\": \"0.6161838\",\n \"text\": \"function validated() {\\n if (username.value.length < 1) {\\n username.styleborder = \\\"1px solid red\\\";\\n name_err.style.display = \\\"block\\\";\\n username.focus();\\n return false;\\n }\\n if (email.value.length < 9) {\\n email.styleborder = \\\"1px solid red\\\";\\n email_err.style.display = \\\"block\\\";\\n email.focus();\\n return false;\\n }\\n if (password.value.length < 9) {\\n password.styleborder = \\\"1px solid red\\\";\\n password_err.style.display = \\\"block\\\";\\n password.focus();\\n return false;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"257d0e5fa4fd43d29ad5c40a67a9d330\",\n \"score\": \"0.61411536\",\n \"text\": \"function makeValid(field) {\\n var errorMessage;\\n //update styling on the valid element\\n field.attr('aria-invalid', 'false');\\n //check if multi field row\\n if (field.parent().hasClass('multiInput')) {\\n //check that the other field in row is not invalid (include each type in selector)\\n if (($('input, fieldset, select', field.parent().siblings()).attr('aria-invalid')) === 'false') {\\n field.closest('.formRow').removeClass('mfHighlightError');\\n }\\n } else {\\n field.closest('.formRow').removeClass('mfHighlightError');\\n //also remove styling to acceptance text\\n if (field.data('extvaltype') === 'terms') {\\n field.parent().removeClass('mfHighlightError');\\n }\\n if ((field.data('extvaltype') === 'checkbox') || (field.data('extvaltype') === 'radio') || (field.data('extvaltype') === 'dob')) {\\n errorMessage = $('div[aria-describedby=\\\"' + field.data('extvalname') + '-label\\\"]');\\n } else {\\n errorMessage = $('div[aria-describedby=\\\"' + field.attr('id') + '-label\\\"]');\\n }\\n errorMessage.hide();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"299a6e0d96e1780e0b2f6715004a9ce9\",\n \"score\": \"0.6134056\",\n \"text\": \"async beforeValidate () {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"299a6e0d96e1780e0b2f6715004a9ce9\",\n \"score\": \"0.6134056\",\n \"text\": \"async beforeValidate () {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"299a6e0d96e1780e0b2f6715004a9ce9\",\n \"score\": \"0.6134056\",\n \"text\": \"async beforeValidate () {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62bc40d0e82cb6b4f39b3a56e5de9cf6\",\n \"score\": \"0.6130443\",\n \"text\": \"function nkc_validate_fields(input){\\n //input is an object of fields awaiting validation.\\n for(i in nkc_validate_rules){\\n if(input[i]!==undefined&&input[i]!==null) //if field exists\\n if(nkc_validate_rules[i].test(input[i])==false)\\n throw i.toString() +' not in correct format';\\n }\\n return true;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ac8c9253b1a11fe26d41c2ee02c99ba\",\n \"score\": \"0.6124356\",\n \"text\": \"function insert_validation(item) {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea63178bdf44ae683ffe72e50493fc24\",\n \"score\": \"0.6123359\",\n \"text\": \"function validateForm(){\\n //validate first name at least 2 letters long\\n if(firstName.value.length < 2){\\n firstName.classList.add(\\\"error\\\");\\n firstName.setAttribute(\\\"placeholder\\\", \\\"FIRST NAME IS REQUIRED\\\");\\n }else{\\n firstName.classList.remove(\\\"error\\\");\\n }\\n //validate geoLocation at least 10 letters long\\n if(geoLocation.value.length < 8){\\n geoLocation.classList.add(\\\"error\\\");\\n geoLocation.setAttribute(\\\"placeholder\\\", \\\"LOCATION IS REQUIRED\\\");\\n }else{\\n geoLocation.classList.remove(\\\"error\\\");\\n }\\n // if it passes both validations, send to createFormObject //\\n if((firstName.value.length > 2) && (geoLocation.value.length > 8)){\\n createFormItem();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d334c41084d014c5ba9d7f7625b20aef\",\n \"score\": \"0.61220765\",\n \"text\": \"valid(value) {\\n\\t\\treturn true\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cec833eb7f3b258403fdd6bda02b04da\",\n \"score\": \"0.6117035\",\n \"text\": \"checkValidInputs(objScope) {\\n // Function check Error Input Field and display \\n let height = 126;\\n var validateFunctions = {\\n \\\"email\\\": this.validateEmail,\\n \\\"number\\\": this.checkValidNumber,\\n \\\"tax\\\": this.checkTaxNumber,\\n \\\"id\\\": this.checkIdNumber\\n }\\n let check = true;\\n let content = \\\"\\\";\\n let errorBlockContent = document.querySelector('.error-content');\\n errorBlockContent.innerHTML = \\\"\\\";\\n //Check required field\\n let requiredFields = document.querySelectorAll('.input-information .user-input.required');\\n requiredFields.forEach(element => {\\n if (element.value == \\\"\\\") {\\n content = \\\"Thiếu trường \\\\\\\"\\\" + element.parentElement.parentElement.querySelector('.name-information').innerText + \\\"\\\\\\\"\\\";\\n errorBlockContent.appendChild(createErrorContent(content));\\n check = false;\\n height += 36\\n }\\n })\\n let userInputs = $('.input-information .user-input');\\n userInputs.each((index, element) => {\\n let classListElement = element.classList;\\n if (classListElement.contains(\\\"number-input\\\")) {\\n content = \\\"Thông tin \\\\\\\"số điện thoại\\\\\\\" bị nhập sai\\\";\\n if (!validateFunctions.number($(element).val()) || $(element).val() == \\\"\\\") {\\n check = false;\\n errorBlockContent.appendChild(createErrorContent(content));\\n height += 36\\n }\\n } else if (classListElement.contains(\\\"email-input\\\")) {\\n content = \\\"Thông tin \\\\\\\"email\\\\\\\" bị nhập sai\\\";\\n if (!validateFunctions.email($(element).val())) {\\n check = false;\\n errorBlockContent.appendChild(createErrorContent(content));\\n height += 36\\n }\\n } else if (classListElement.contains(\\\"tax-input\\\")) {\\n content = \\\"Thông tin \\\\\\\"mã số thuế\\\\\\\" bị nhập sai\\\";\\n if (!validateFunctions.tax($(element).val(), objScope)) {\\n check = false;\\n errorBlockContent.appendChild(createErrorContent(content));\\n height += 36\\n }\\n } else if (classListElement.contains(\\\"input-currency\\\")) {\\n content = \\\"Thông tin \\\\\\\"lương cơ bản\\\\\\\" bị nhập sai\\\";\\n if (!validateFunctions.number($(element).val())) {\\n check = false;\\n errorBlockContent.appendChild(createErrorContent(content));\\n height += 36\\n }\\n } else if (classListElement.contains(\\\"id-input\\\")) {\\n content = \\\"Thông tin \\\\\\\"CMND\\\\\\\" bị nhập sai\\\";\\n if (!validateFunctions.id($(element).val(), objScope)) {\\n check = false;\\n errorBlockContent.appendChild(createErrorContent(content));\\n height += 36\\n }\\n }\\n })\\n // Check date picker field\\n let datePickerField = document.querySelectorAll('.input-information input[type=\\\"date\\\"]');\\n datePickerField.forEach(element => {\\n if (element.value == \\\"\\\") {\\n content = \\\"Thiếu trường \\\\\\\"\\\" + element.parentElement.querySelector('.name-information').innerText + \\\"\\\\\\\"\\\";\\n errorBlockContent.appendChild(createErrorContent(content));\\n check = false;\\n height += 36\\n }\\n })\\n $(\\\".popup-list\\\").css(\\\"height\\\", height + \\\"px\\\");\\n return check;\\n // Create error content\\n function createErrorContent(content) {\\n let blockErrorContent = document.createElement('div');\\n blockErrorContent.classList.add('block-content');\\n let iconError = document.createElement('div');\\n iconError.classList.add('icon-error-list');\\n let contentError = document.createElement('div');\\n contentError.innerText = content;\\n blockErrorContent.appendChild(iconError);\\n blockErrorContent.appendChild(contentError);\\n return blockErrorContent;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5754151e869f32221cd5953e7ef926f4\",\n \"score\": \"0.6115914\",\n \"text\": \"function formValidation(){\\r\\n clearErrors();\\r\\n if (validateFname() && validateLname() && validateStreetname() && validateCity() && validatePassword() && validateConfirmPassword() && validatePhone() && validatePostalCode() && validateUserName())\\r\\n return true;\\r\\n else\\r\\n return false;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e618134f5169d18926bcfba97e3438f\",\n \"score\": \"0.6115883\",\n \"text\": \"validateForm() {\\n\\n let isValid = this.validateAmount();\\n\\n if(!this.validateType()) {\\n isValid = false;\\n }\\n\\n if(!this.validateDescription()) {\\n isValid = false;\\n }\\n\\n return isValid;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6e9ee1f649d624d8cf67fdc3c9afad9\",\n \"score\": \"0.6114689\",\n \"text\": \"validate(data) {\\n if (!data.message) data.message = [];\\n if (!data.errors) data.errors = [];\\n\\n let value = data[this.field];\\n let err = this.validator(value);\\n if (err) data.errors.push(err);\\n else data.message.push(this.field + \\\": \\\" + value);\\n\\n return data;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04a7e7d69f30b9d595fbf31dcfb723d8\",\n \"score\": \"0.6113246\",\n \"text\": \"validateInputs(){\\n if(!this.state.value.name){\\n alert(\\\"Display name can't be blank\\\");\\n return false;\\n }else if(this.state.value.password1.length < 6){\\n alert(\\\"Password must be greater than 6 characters\\\");\\n return false;\\n }else if(this.state.value.password1 != this.state.value.password2){\\n alert(\\\"Passwords must match\\\");\\n return false;\\n }else{\\n return true;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c38b4628881a75d2fb9e47bc3637efa\",\n \"score\": \"0.6111847\",\n \"text\": \"function validateField(inputObj){ \\n switch(inputObj.id){\\n case(\\\"regUsr\\\"): \\n return (checkLength(('#'+inputObj.id),\\\"username\\\",3,16)) && checkRegExp(('#'+inputObj.id),usrRegex,\\\"Username may consist of a-z, 0-9,'_'\\\");\\n break;\\n case(\\\"regEml\\\"): \\n return(checkLength(('#'+inputObj.id),\\\"email\\\", 6,250) && checkRegExp(('#'+inputObj.id),emailRegex,\\\"eg. ab@abcde.com\\\"));\\n break;\\n case(\\\"regPwd\\\"): \\n resetField(\\\"#pwdC\\\");//it resets the password confirmation field (textarea).\\n return(checkLength(('#'+inputObj.id),\\\"password\\\",5,16) && checkRegExp(('#'+inputObj.id),pwdRegex,\\\"Insert at least 5 characters and 1 number\\\"));\\n break;\\n case(\\\"pwdC\\\"):\\n return(passwordConfirm(\\\"#regPwd\\\",\\\"#pwdC\\\"));\\n break;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd5c1a0afa6415d5bd387a065f3f4dcc\",\n \"score\": \"0.611082\",\n \"text\": \"validateField(e) {\\n let errors = []\\n const { lead } = this.state\\n return validateEmail(errors, lead.email)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbff6f9fd628262fcda2307de39c2fc7\",\n \"score\": \"0.61075515\",\n \"text\": \"validate(data) { // eslint-disable-line class-methods-use-this\\n return data;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eea8d2149ff0301d4da1772a02833ba6\",\n \"score\": \"0.6104734\",\n \"text\": \"function validateField( field ) {\\n var errorText = \\\"\\\",\\n error = false,\\n value = field.val(),\\n siblings = field.siblings( \\\".demo-errors\\\" );\\n \\n\\nswitch ( field.attr( \\\"name\\\" ) ) {\\n \\n\\n case \\\"FirstName\\\": \\n if ( !validateLength( value, 3 ) ) {\\n error = true;\\n errorText += \\\"First Name too short ! <br />\\\";\\n \\n }\\n \\n if ( !expLettersOnly.test( value ) ) {\\n error = true;\\n errorText += \\\"The name can only contain letters and spaces!\\\";\\n }\\n break ; \\n \\n \\n case \\\"LastName\\\": \\n if ( !validateLength( value, 3 ) ) {\\n error = true;\\n errorText += \\\" Last Name too short ! <br />\\\";\\n \\n }\\n \\n if ( !expLettersOnly.test( value ) ) {\\n error = true;\\n errorText += \\\"The name can only contain letters and spaces!\\\";\\n }\\n break ; \\n \\n\\n\\n\\n\\n\\n case \\\"FName\\\": \\n if ( !validateLength( value, 3 ) ) {\\n error = true;\\n errorText += \\\" Father Name too short ! <br />\\\";\\n }\\n \\n if ( !expLettersOnly.test( value ) ) {\\n error = true;\\n errorText += \\\"The name can only contain letters and spaces!\\\";\\n }\\n\\n \\n\\n\\n\\n break;\\n\\n case \\\"MName\\\": \\n if ( !validateLength( value, 3 ) ) {\\n error = true;\\n errorText += \\\" Mother name is too short!<br />\\\";\\n }\\n \\n if ( !expLettersOnly.test( value ) ) {\\n error = true;\\n errorText += \\\"The name can only contain letters and spaces!\\\";\\n }\\n \\n \\n break;\\n \\n case \\\"DOB\\\": \\n if ( !validateLength( value, 0 ) ) {\\n error = true;\\n errorText += \\\"Enter Date of Birth !<br />\\\";\\n }\\n \\n break ; \\n\\n case \\\"Cast_Category\\\": \\n \\n if(validateSelect( $( \\\"#Cast_Category\\\" ) ))\\n {\\n\\n error = true;\\n errorText += \\\"Select Category<br />\\\";\\n }\\n\\n break ; \\n \\n\\n case \\\"Religion\\\": \\n \\n \\n if(validateSelect( $( \\\"#Religion\\\" ) ))\\n {\\n\\n error = true;\\n errorText += \\\"Select Religion<br />\\\";\\n \\n }\\n\\n break ; \\n \\n case \\\"Stu_Category\\\": \\n \\n \\n if(validateSelect( $( \\\"#Stu_Category\\\" ) ))\\n {\\n \\n error = true;\\n errorText += \\\"Select Student Category<br />\\\";\\n \\n }\\n\\n break ; \\n \\n case \\\"Email_id\\\": \\n \\n if ( !validateLength( value, 0 ) ) {\\n error = true;\\n errorText += \\\"Enter Email_id !<br />\\\";\\n \\n }\\n \\n\\n if ( !expEmail.test( value ) ) {\\n error = true;\\n errorText += \\\"The email address format is invalid!\\\";\\n }\\n \\n break;\\n \\n case \\\"Mobile_no\\\": \\n \\n if ( !expNumbers.test( value ) ) {\\n error = true;\\n errorText += \\\"Mobile no. Contain only Numbers \\\";\\n }\\n\\nif ( !validateLength( value, 9 ) ) {\\n error = true;\\n errorText += \\\"Mobile Number lenght should be 10 !<br />\\\";\\n \\n }\\n\\nif ( !MobvalidateLength( value, 11 ) ) {\\n error = true;\\n errorText += \\\"Mobile Number lenght should be 10 !<br />\\\";\\n \\n }\\n\\n\\n\\n break;\\n\\n case \\\"Address\\\": \\n \\n if ( !validateLength( value, 0 ) ) {\\n error = true;\\n errorText += \\\"Enter Address !<br />\\\";\\n \\n }\\n break;\\n\\n case \\\"City\\\": \\n \\n if ( !validateLength( value, 0 ) ) {\\n error = true;\\n errorText += \\\"Enter City !<br />\\\";\\n \\n }\\n break;\\n \\n case \\\"Stu_Category\\\": \\n \\n \\n if(validateSelect( $( \\\"#state\\\" ) ))\\n {\\n \\n error = true;\\n errorText += \\\"Select State<br />\\\";\\n \\n }\\n\\n break ; \\n\\n case \\\"Course\\\": \\n \\n \\n if(validateSelect( $( \\\"#Course\\\" ) ))\\n {\\n \\n error = true;\\n errorText += \\\"Select Course<br />\\\";\\n \\n }\\n\\n break ; \\n\\n case \\\"Semester\\\": \\n \\n \\n if(validateSelect( $( \\\"#Semester\\\" ) ))\\n {\\n \\n error = true;\\n errorText += \\\"Select Semester<br />\\\";\\n \\n }\\n\\n break ; \\n\\n case \\\"amount\\\": \\n \\n \\n if ( !validateLength( value, 0 ) ) \\n {\\n error = true;\\n errorText += \\\"Enter amount !<br />\\\";\\n \\n }\\n if ( !expNumbers.test( value ) ) {\\n error = true;\\n errorText += \\\"Amount only contain number!\\\";\\n }\\n \\n\\n break ; \\n\\n case \\\"Draft_no\\\": \\n \\n \\n if ( !validateLength( value, 0 ) ) \\n {\\n error = true;\\n errorText += \\\"Enter Draft_no. !<br />\\\";\\n \\n }\\n\\n if ( !expNumbers.test( value ) ) {\\n error = true;\\n errorText += \\\"Draft no only contain number!\\\";\\n }\\n\\n\\n\\n break ; \\n \\n case \\\"Draftdate\\\": \\n \\n \\n if ( !validateLength( value, 0 ) ) \\n {\\n error = true;\\n errorText += \\\"Enter Draft_no. !<br />\\\";\\n \\n }\\n\\n break ; \\n\\n case \\\"Payable\\\": \\n \\n \\n if ( !validateLength( value, 0 ) ) \\n {\\n error = true;\\n errorText += \\\"Enter Payable at : field !<br />\\\";\\n \\n }\\n\\n break ; \\n\\n case \\\"Bank1\\\": \\n \\n \\n if(validateSelect( $( \\\"#Bank1\\\" ) ))\\n {\\n \\n error = true;\\n errorText += \\\"Select Bank<br />\\\";\\n \\n }\\n\\n break ; \\n\\n\\n}\\n\\nsiblings.html( errorText );\\n \\nreturn !error;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ad27b1473ab33ff5131623f8a16af9d\",\n \"score\": \"0.6103933\",\n \"text\": \"function validate_employee_form(arg_object) {\\n //\\n var error = false;\\n var basic_val_error = false;\\n var emp_id_str_err = false;\\n var unique_id_error = arg_object.unique_id_error;\\n //\\n // performing basic empty value validation for all input and select elements\\n if (document.getElementById('department-select').value == 'transportation') {\\n basic_val_error = basic_validate('add_employee','pay_rate,comments,emp-internal-id,base-rate-level,case-rate-level,stop-rate-level');\\n }\\n else {\\n basic_val_error = basic_validate('add_employee','pay_rate,comments,base-rate-select,case-rate-select,stop-rate-select,base-rate-input,case-rate-input,stop-rate-input,base-rate-level,case-rate-level,stop-rate-level,emp-internal-id');\\n }\\n //\\n if (basic_val_error) {\\n error = true;\\n }\\n if (unique_id_error) {\\n alert(\\\"The supplied Employee ID: \\\"+document.getElementById('emp-id').value+\\\" is already in use.\\\");\\n add_class('invalid-field','emp-id')\\n remove_class('hidden-elm','emp-id-uni-err')\\n error = true;\\n }\\n else {\\n remove_class('invalid-field','emp-id')\\n add_class('hidden-elm','emp-id-uni-err')\\n }\\n //\\n //\\n if (error) {\\n remove_class('hidden-elm','form-errors');\\n }\\n else {\\n add_class('hidden-elm','form-errors');\\n submit_employee_form(arg_object)\\n }\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fae524c2d2a33e10c9a12c3ead0ef57a\",\n \"score\": \"0.60949004\",\n \"text\": \"validate(value) {\\n\\t\\treturn this.test(value);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"532ef311c4bade204e5805d3e8ad7ae1\",\n \"score\": \"0.6086355\",\n \"text\": \"validateForm() {\\n return (this.validateName() === 'success'\\n && this.validateEmail() === 'success'\\n && this.validateEmails() === 'success'\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0d8cc2b062b16857e815c918ce33c58\",\n \"score\": \"0.60860467\",\n \"text\": \"validate() {\\n // Get generic API validation errors\\n this._super();\\n var errors = get(this, 'errors')||[];\\n if ( !get(this, 'cluster.name') ) {\\n errors.push('Name is required');\\n }\\n\\n\\n if ( !get(this, 'config.sshPublicKeyContents') ) {\\n errors.push(intl.t('validation.required', { key: intl.t('clusterNew.oracleoke.ssh.label') }));\\n }\\n\\n\\n // Add more specific errors\\n\\n // Check something and add an error entry if it fails:\\n // if ( parseInt(get(this, 'config.memorySize'), defaultRadix) < defaultBase ) {\\n // errors.push('Memory Size must be at least 1024 MB');\\n // }\\n\\n // Set the array of errors for display,\\n // and return true if saving should continue.\\n if ( get(errors, 'length') ) {\\n set(this, 'errors', errors);\\n return false;\\n } else {\\n set(this, 'errors', null);\\n return true;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"273e87700778f691ff6340a07ab1814b\",\n \"score\": \"0.608225\",\n \"text\": \"async validate() {\\n // Set error if required field is empty.\\n let thisValue = this.formInstance ? this.context.post[this.formInstance.id][this.name] : undefined;\\n if (this.data.required && !thisValue) {\\n // Set a general error message (that won't be repeated multiple times).\\n // TODO: Translate.\\n this.formInstance.setError('requiredFieldEmpty', 'Please fill in the required fields.');\\n // Set an empty error message, to highlight the field in the theme.\\n this.formInstance.setError(this.name, '');\\n }\\n\\n // TODO: Flesh this out. We probably need to pass more information to the\\n // validateFunction!\\n for (let validateFunction of this.validateRegistry.getIterator()) {\\n await validateFunction();\\n }\\n\\n // Process sub-elements.\\n for (let element of this.instanceRegistry.getIterator()) {\\n if (element.validate) {\\n await element.validate();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61edc23f9229948ae2b2edb7e4c0a580\",\n \"score\": \"0.6080131\",\n \"text\": \"function validate(username,password){\\nif(!Validation.username(username)){\\nreturn \\\"2\\\";\\n}\\nif(!Validation.password(password)){\\nreturn \\\"3\\\"\\n}\\nreturn \\\"1\\\";\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":82,"cells":{"query_id":{"kind":"string","value":"7e710619df243d78015af0988cc66468"},"query":{"kind":"string","value":"cloned and reversed json_data: most recent data first; use with timeline"},"positive_passages":{"kind":"list like","value":[{"docid":"d85ff580e1ec8de36be8713012ac6eea","score":"0.0","text":"function getTimelineSearch(){\r\n\t$('#timeline-search').keyup(function () {\r\n\t\tvar output, inQuotes;\r\n\t\tvar searchField = $(this).val();\r\n\t\tif (searchField === '') {\r\n\t\t\t$('#timeline').html('');\r\n\t\t\treturn;\r\n\t\t}\r\n\t\t//check if in quotes\r\n\t\tif ((searchField.charAt(0)==\"'\") || (searchField.charAt(0)==\"\\\"\")){\r\n\t\t\tinQuotes = true;\r\n\t\t\tquoteChar = searchField.charAt(0)\r\n\t\t} else {\r\n\t\t\tinQuotes = false;\r\n\t\t}\r\n\t\tvar regex = new RegExp(searchField, \"i\");\r\n\t\tvar count = 1;\r\n\t\t$.each(cloneJson_data, function (key, val) {\r\n\t\t\tvar time, date;\r\n\t\t\t//if ((val.employee_salary.search(regex) != -1) || (val.employee_name.search(regex) != -1)) {//two criteria\r\n\t\t\tif ((inQuotes) && ((quoteChar+val.subject_id+quoteChar).search(regex) != -1)) {\r\n\t\t\t\tconsole.log('quotes')\r\n\t\t\t\tdate=moment(val.end_time).format(\"L\")\r\n\t\t\t\ttime=[moment(val.start_time).format(\"hh:mm\"),moment(val.end_time).format(\"hh:mma\")];\r\n\t\t\t\toutput +=[\r\n\t\t\t\t\t'<div class=\"frst-timeline-block '+val.location+'-item frst-timeline-completed\" data-animation=\"slideInUp\">',\r\n\t\t\t\t\t\t'<div class=\"'+val.location+'-timeline-img\"> <span></span> </div>',\r\n\t\t\t\t\t\t'<!-- frst-timeline-img -->',\r\n\t\t\t\t\t\t'<div class=\"frst-timeline-content animated rotateInDownRight\" style=\"position: relative;\">',\r\n\t\t\t\t\t\t\t'<div class=\"frst-timeline-content-inner\">',\r\n\t\t\t\t\t\t\t\t'<span class=\"frst-date\">'+date+'<br>'+time[0]+' - '+time[1]+'</span>',\r\n\t\t\t\t\t\t\t\t'<h2>'+val.subject_id+'</h2>',\r\n\t\t\t\t\t\t\t\t'<p>session: '+val.subject_session+'-'+val.subject_subsession+'</p>', \r\n\t\t\t\t\t\t\t\t'<p>score: '+val.score+'</p>', \r\n\t\t\t\t\t\t\t\t'<p>location: '+val.location+'</p>',\r\n\t\t\t\t\t\t\t'</div>',\r\n\t\t\t\t\t\t\t'<!-- frst-timeline-content-inner -->',\r\n\t\t\t\t\t\t'</div>',\r\n\t\t\t\t\t\t'<!-- frst-timeline-content -->',\r\n\t\t\t\t\t'</div>'\r\n\t\t\t\t].join('');\r\n\t\t\t} else if ((val.subject_id.search(regex) != -1) && (!inQuotes)) {\r\n\t\t\t\tconsole.log('no quotes')\r\n\t\t\t\tdate=moment(val.end_time).format(\"L\")\r\n\t\t\t\ttime=[moment(val.start_time).format(\"hh:mm\"),moment(val.end_time).format(\"hh:mma\")];\r\n\t\t\t\toutput +=[\r\n\t\t\t\t\t'<div class=\"frst-timeline-block '+val.location+'-item frst-timeline-completed\" data-animation=\"slideInUp\">',\r\n\t\t\t\t\t\t'<div class=\"'+val.location+'-timeline-img\"> <span></span> </div>',\r\n\t\t\t\t\t\t'<!-- frst-timeline-img -->',\r\n\t\t\t\t\t\t'<div class=\"frst-timeline-content animated rotateInDownRight\" style=\"position: relative;\">',\r\n\t\t\t\t\t\t\t'<div class=\"frst-timeline-content-inner\">',\r\n\t\t\t\t\t\t\t\t'<span class=\"frst-date\">'+date+'<br>'+time[0]+' - '+time[1]+'</span>',\r\n\t\t\t\t\t\t\t\t'<h2>'+val.subject_id+'</h2>',\r\n\t\t\t\t\t\t\t\t'<p>session: '+val.subject_session+'-'+val.subject_subsession+'</p>', \r\n\t\t\t\t\t\t\t\t'<p>score: '+val.score+'</p>', \r\n\t\t\t\t\t\t\t\t'<p>location: '+val.location+'</p>',\r\n\t\t\t\t\t\t\t'</div>',\r\n\t\t\t\t\t\t\t'<!-- frst-timeline-content-inner -->',\r\n\t\t\t\t\t\t'</div>',\r\n\t\t\t\t\t\t'<!-- frst-timeline-content -->',\r\n\t\t\t\t\t'</div>'\r\n\t\t\t\t].join('');\t\t\t\t\r\n\t\t\t} else {\r\n\t\t\t\t$('#timeline').html('');\r\n\t\t\t}\r\n\t\t});\r\n\t\t$('#timeline').html(output.replace('undefined',''))//most recent subject on top bar\r\n\t});\r\n}","title":""}],"string":"[\n {\n \"docid\": \"d85ff580e1ec8de36be8713012ac6eea\",\n \"score\": \"0.0\",\n \"text\": \"function getTimelineSearch(){\\r\\n\\t$('#timeline-search').keyup(function () {\\r\\n\\t\\tvar output, inQuotes;\\r\\n\\t\\tvar searchField = $(this).val();\\r\\n\\t\\tif (searchField === '') {\\r\\n\\t\\t\\t$('#timeline').html('');\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\t//check if in quotes\\r\\n\\t\\tif ((searchField.charAt(0)==\\\"'\\\") || (searchField.charAt(0)==\\\"\\\\\\\"\\\")){\\r\\n\\t\\t\\tinQuotes = true;\\r\\n\\t\\t\\tquoteChar = searchField.charAt(0)\\r\\n\\t\\t} else {\\r\\n\\t\\t\\tinQuotes = false;\\r\\n\\t\\t}\\r\\n\\t\\tvar regex = new RegExp(searchField, \\\"i\\\");\\r\\n\\t\\tvar count = 1;\\r\\n\\t\\t$.each(cloneJson_data, function (key, val) {\\r\\n\\t\\t\\tvar time, date;\\r\\n\\t\\t\\t//if ((val.employee_salary.search(regex) != -1) || (val.employee_name.search(regex) != -1)) {//two criteria\\r\\n\\t\\t\\tif ((inQuotes) && ((quoteChar+val.subject_id+quoteChar).search(regex) != -1)) {\\r\\n\\t\\t\\t\\tconsole.log('quotes')\\r\\n\\t\\t\\t\\tdate=moment(val.end_time).format(\\\"L\\\")\\r\\n\\t\\t\\t\\ttime=[moment(val.start_time).format(\\\"hh:mm\\\"),moment(val.end_time).format(\\\"hh:mma\\\")];\\r\\n\\t\\t\\t\\toutput +=[\\r\\n\\t\\t\\t\\t\\t'<div class=\\\"frst-timeline-block '+val.location+'-item frst-timeline-completed\\\" data-animation=\\\"slideInUp\\\">',\\r\\n\\t\\t\\t\\t\\t\\t'<div class=\\\"'+val.location+'-timeline-img\\\"> <span></span> </div>',\\r\\n\\t\\t\\t\\t\\t\\t'<!-- frst-timeline-img -->',\\r\\n\\t\\t\\t\\t\\t\\t'<div class=\\\"frst-timeline-content animated rotateInDownRight\\\" style=\\\"position: relative;\\\">',\\r\\n\\t\\t\\t\\t\\t\\t\\t'<div class=\\\"frst-timeline-content-inner\\\">',\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t'<span class=\\\"frst-date\\\">'+date+'<br>'+time[0]+' - '+time[1]+'</span>',\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t'<h2>'+val.subject_id+'</h2>',\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t'<p>session: '+val.subject_session+'-'+val.subject_subsession+'</p>', \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t'<p>score: '+val.score+'</p>', \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t'<p>location: '+val.location+'</p>',\\r\\n\\t\\t\\t\\t\\t\\t\\t'</div>',\\r\\n\\t\\t\\t\\t\\t\\t\\t'<!-- frst-timeline-content-inner -->',\\r\\n\\t\\t\\t\\t\\t\\t'</div>',\\r\\n\\t\\t\\t\\t\\t\\t'<!-- frst-timeline-content -->',\\r\\n\\t\\t\\t\\t\\t'</div>'\\r\\n\\t\\t\\t\\t].join('');\\r\\n\\t\\t\\t} else if ((val.subject_id.search(regex) != -1) && (!inQuotes)) {\\r\\n\\t\\t\\t\\tconsole.log('no quotes')\\r\\n\\t\\t\\t\\tdate=moment(val.end_time).format(\\\"L\\\")\\r\\n\\t\\t\\t\\ttime=[moment(val.start_time).format(\\\"hh:mm\\\"),moment(val.end_time).format(\\\"hh:mma\\\")];\\r\\n\\t\\t\\t\\toutput +=[\\r\\n\\t\\t\\t\\t\\t'<div class=\\\"frst-timeline-block '+val.location+'-item frst-timeline-completed\\\" data-animation=\\\"slideInUp\\\">',\\r\\n\\t\\t\\t\\t\\t\\t'<div class=\\\"'+val.location+'-timeline-img\\\"> <span></span> </div>',\\r\\n\\t\\t\\t\\t\\t\\t'<!-- frst-timeline-img -->',\\r\\n\\t\\t\\t\\t\\t\\t'<div class=\\\"frst-timeline-content animated rotateInDownRight\\\" style=\\\"position: relative;\\\">',\\r\\n\\t\\t\\t\\t\\t\\t\\t'<div class=\\\"frst-timeline-content-inner\\\">',\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t'<span class=\\\"frst-date\\\">'+date+'<br>'+time[0]+' - '+time[1]+'</span>',\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t'<h2>'+val.subject_id+'</h2>',\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t'<p>session: '+val.subject_session+'-'+val.subject_subsession+'</p>', \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t'<p>score: '+val.score+'</p>', \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t'<p>location: '+val.location+'</p>',\\r\\n\\t\\t\\t\\t\\t\\t\\t'</div>',\\r\\n\\t\\t\\t\\t\\t\\t\\t'<!-- frst-timeline-content-inner -->',\\r\\n\\t\\t\\t\\t\\t\\t'</div>',\\r\\n\\t\\t\\t\\t\\t\\t'<!-- frst-timeline-content -->',\\r\\n\\t\\t\\t\\t\\t'</div>'\\r\\n\\t\\t\\t\\t].join('');\\t\\t\\t\\t\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t$('#timeline').html('');\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t\\t$('#timeline').html(output.replace('undefined',''))//most recent subject on top bar\\r\\n\\t});\\r\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"a55b3401d992ed51b96a346abcc16a49","score":"0.60497373","text":"function timelineData() {\n var array = [];\n var date = results[0] ? new Date(results[0].values[0].timestamp): new Date();\n for (var i = 0; i < 7; i++) {\n array.push({value:date, tooltip:{showContent: false}});\n date = new Date(date.getTime() + 86400000);\n }\n for (var i = 2; i < weeks.length-1; i++) {\n var date = new Date(results[i].values[0].timestamp);\n\n array.push({value:date, tooltip:{showContent: false}});\n if (i == weeks.length-1) {\n //** use last item temporarily, might not be the latest time\n var last = results[i].values.length-1\n console.log(last);\n console.log(results[i].values[last])\n var date = new Date(results[i].values[last].timestamp);\n\n array.push({value:date, tooltip:{showContent: false}});\n }\n }\n //console.log(array)\n return array;\n }","title":""},{"docid":"ffd03265bb295757c83bfe8686430d73","score":"0.58610046","text":"cleanJSON(json) {\n let cleanJSONData = {\n timestampdate: [],\n close: [],\n open: [],\n low: [],\n high: [],\n };\n\n let rawDate = []\n\n json.forEach(stockData => {\n rawDate.push(new Date(stockData.timestamp))\n cleanJSONData.timestampdate.push(new Date(stockData.timestamp).toLocaleDateString())\n cleanJSONData.low.push(stockData.low);\n cleanJSONData.high.push(stockData.high);\n cleanJSONData.open.push(stockData.open);\n cleanJSONData.close.push(stockData.close);\n })\n\n cleanJSONData.timestampdate.reverse()\n cleanJSONData.close.reverse()\n cleanJSONData.open.reverse()\n cleanJSONData.low.reverse()\n cleanJSONData.high.reverse()\n\n // Set the min and max dates\n if (this.state.firstFetch) {\n this.setState(({\n from: new Date(Math.min.apply(null,rawDate)).toISOString().slice(0,10).split(\"-\").reverse().join(\"/\"),\n to: new Date(Math.max.apply(null,rawDate)).toISOString().slice(0,10).split(\"-\").reverse().join(\"/\"),\n dateMin: new Date(Math.min.apply(null,rawDate)).toISOString().slice(0,10).split(\"-\").reverse().join(\"/\"),\n dateMax: new Date(Math.max.apply(null,rawDate)).toISOString().slice(0,10).split(\"-\").reverse().join(\"/\"),\n firstFetch: false\n }))\n }\n\n return cleanJSONData\n }","title":""},{"docid":"80b6ccbcc7c7b104e88b85f9e876791f","score":"0.5829011","text":"function getNewList(){\r\n\tvar newJson = _.uniqBy(cloneJson_data, 'subject_id');\r\n\tvar newL = newJson.length - 1\r\n\tvar newElement;\r\n\tif (newL < 10){len = newL+1} else {len=10};\r\n\tfor (i = 0; i < len; i++) {\r\n\t\tvar recentSubject = newJson[i];\r\n\t\tsubject = recentSubject.subject_id;\r\n\t\tloc=recentSubject.location;\r\n\t\tsession=recentSubject.subject_session;\r\n\t\tsubsession=recentSubject.subject_subsession;\r\n\t\tscore=recentSubject.score;\r\n\t\tdate=moment(recentSubject.end_time).format(\"L\");\r\n\t\ttime=[moment(recentSubject.start_time).format(\"hh:mm\"),moment(recentSubject.end_time).format(\"hh:mma\")];\r\n\t\tnewElement += [\r\n\t\t\t'<div class=\"feed-element\">',\r\n\t\t\t\t'<a class=\"pull-left\">',\r\n\t\t\t\t\t'<div alt=\"image\" class=\"location-color-'+loc+'\"></div>',\r\n\t\t\t\t'</a>',\r\n\t\t\t\t'<div class=\"media-body\">',\r\n\t\t\t\t\t'<small class=\"pull-right\">'+moment(recentSubject.end_time).fromNow()+'</small>',\r\n\t\t\t\t\t'<strong>'+subject+'</strong> completed session <strong>'+session+'-'+subsession+'</strong> at '+loc+', scoring <strong>'+score+'</strong> points.<br>',\r\n\t\t\t\t\t'<small class=\"text-muted\">'+time[0]+' - '+time[1]+'</small>',\r\n\t\t\t\t'</div>',\r\n\t\t\t'</div>'\r\n\t\t].join('');\r\n\t}\r\n\t$('#new-subject-container').html(newElement.replace('undefined',''))//most recent subject on top bar\r\n}","title":""},{"docid":"293c5e177dd1f41043899e58bd4d9585","score":"0.5820765","text":"function newJsonData(data) {\r\n 'use strict';\r\n var seriesName,\r\n seriesID,\r\n embargoDate;\r\n\r\n data.Release[0].DataSet.forEach(function(dataSet) {\r\n dataSet.Series.forEach(function(series) {\r\n seriesName = series.Attributes.SERIES_NAME;\r\n embargoDate = series.EmbargoDate;\r\n seriesID = (seriesName + ' ' + getShortDate(embargoDate));\r\n for (var i = _series.length - 1; i >= 0; i--) {\r\n if (_series[i].id === seriesID) {\r\n var newSeries = {};\r\n newSeries.id = seriesID;\r\n\r\n loadObservations(series.Observations, newSeries, false);\r\n if (newSeries.minDate.getTime() < _minDate.getTime()) {\r\n _minDate = newSeries.minDate;\r\n startPicker.min(_minDate);\r\n }\r\n if (newSeries.maxDate > _maxDate) {\r\n _maxDate = newSeries.maxDate;\r\n endPicker.max(_maxDate);\r\n }\r\n _series[i].observations = newSeries.observations;\r\n _series[i].color = _seriesColor.shift();\r\n _series[i].minDate = newSeries.minDate;\r\n _series[i].maxDate = newSeries.maxDate;\r\n\r\n if (numUnits < 2 && !unitExists(_series[i].units + _series[i].unitMult)) {\r\n numUnits++;\r\n var axisType = {\r\n lineType: 'dashed',\r\n label: _series[i].units + _series[i].unitMult\r\n };\r\n if (_series[i].format !== null) {\r\n axisType.format = _series[i].format;\r\n }\r\n if (_axes[0].lineType === 'dashed') {\r\n axisType.lineType = 'straight';\r\n _axes.unshift(axisType);\r\n chart.options.valueAxis[0].visible = true;\r\n\r\n } else {\r\n chart.options.valueAxis[1].visible = true;\r\n _axes.push(axisType);\r\n }\r\n }\r\n if ((numUnits === 2 && (_series[i].units + _series[i].unitMult) === _axes[1].label) || ((_series[i].units + _series[i].unitMult) === _axes[0].label && _axes[0].lineType === 'dashed')) {\r\n _series[i].lineType = 'dashed';\r\n }\r\n for (var h = _series[i].observations.length - 1; h >= 0; h--) {\r\n _rawData.options.data.push(_series[i].observations[h]);\r\n }\r\n _rawData.read();\r\n _plotSeriesCollection.push(_series[i]);\r\n setColor();\r\n setSeriesType();\r\n if ($('#LogScale').prop('checked')) {\r\n for (var j = chart.options.series.length - 1; j >= 0; j--) {\r\n chart.options.series[j].field = 'log';\r\n }\r\n }\r\n _series.splice(i, 1);\r\n }\r\n }\r\n });\r\n });\r\n $('#listView').data('kendoListView').dataSource.data(_series);\r\n $('#legendView').data('kendoListView').dataSource.data(_plotSeriesCollection);\r\n chart.redraw();\r\n initChartNav();\r\n hideProgressAnimation();\r\n if (!navVisible) {\r\n $('svg g [x=-24]').attr('x', 80);\r\n }\r\n}","title":""},{"docid":"6cda1a73924d0ae2a608251144dc541b","score":"0.56779015","text":"function fillTimeline(){\r\n let timeline = groupTimelineById();\r\n \r\n ditoJson.events.forEach((element) => {\r\n let transId;\r\n \r\n element.custom_data.forEach((key) => {\r\n if(key.key === 'transaction_id') {\r\n transId = key.value;\r\n }\r\n });\r\n\r\n timeline.forEach((timelineElement) => {\r\n if(timelineElement.transaction_id === transId) {\r\n if(element.event === 'comprou') {\r\n timelineElement.revenue = element.revenue;\r\n \r\n element.custom_data.forEach((key) => {\r\n if(key.key === 'store_name') {\r\n timelineElement.store_name = key.value;\r\n }\r\n });\r\n }\r\n \r\n if(element.event === 'comprou-produto') {\r\n let obj = { name: '', price: '' };\r\n\r\n element.custom_data.forEach((key) => {\r\n if(key.key === 'product_name') obj.name = key.value;\r\n if(key.key === 'product_price') obj.price = key.value;\r\n });\r\n\r\n timelineElement.products.push(obj);\r\n }\r\n }\r\n });\r\n });\r\n\r\n sortTimeline(timeline);\r\n\r\n return timeline;\r\n }","title":""},{"docid":"ecc1979f0c763797d74159986ad8be99","score":"0.5671591","text":"function cloneJSON(json) {\n return JSON.parse(JSON.stringify(json));\n}","title":""},{"docid":"72606b4c1f62591a20281ce23a549ee6","score":"0.5644603","text":"reverse() {\n var copy = this._data.map(function (item) {\n return item;\n });\n copy.reverse();\n\n var that = this;\n copy.forEach(function (value, index) {\n if (value !== that._data[index]) {\n that[index] = value;\n }\n })\n }","title":""},{"docid":"14b80af7021b2074396c59c0a37a3dfd","score":"0.5642831","text":"cloneData(data) {\n const results = [];\n for (const item of data) {\n const copy = {\n name: item['name']\n };\n if (item['value'] !== undefined) {\n copy['value'] = item['value'];\n }\n if (item['series'] !== undefined) {\n copy['series'] = [];\n for (const seriesItem of item['series']) {\n const seriesItemCopy = Object.assign({}, seriesItem);\n copy['series'].push(seriesItemCopy);\n }\n }\n if (item['extra'] !== undefined) {\n copy['extra'] = JSON.parse(JSON.stringify(item['extra']));\n }\n results.push(copy);\n }\n return results;\n }","title":""},{"docid":"14b80af7021b2074396c59c0a37a3dfd","score":"0.5642831","text":"cloneData(data) {\n const results = [];\n for (const item of data) {\n const copy = {\n name: item['name']\n };\n if (item['value'] !== undefined) {\n copy['value'] = item['value'];\n }\n if (item['series'] !== undefined) {\n copy['series'] = [];\n for (const seriesItem of item['series']) {\n const seriesItemCopy = Object.assign({}, seriesItem);\n copy['series'].push(seriesItemCopy);\n }\n }\n if (item['extra'] !== undefined) {\n copy['extra'] = JSON.parse(JSON.stringify(item['extra']));\n }\n results.push(copy);\n }\n return results;\n }","title":""},{"docid":"14b80af7021b2074396c59c0a37a3dfd","score":"0.5642831","text":"cloneData(data) {\n const results = [];\n for (const item of data) {\n const copy = {\n name: item['name']\n };\n if (item['value'] !== undefined) {\n copy['value'] = item['value'];\n }\n if (item['series'] !== undefined) {\n copy['series'] = [];\n for (const seriesItem of item['series']) {\n const seriesItemCopy = Object.assign({}, seriesItem);\n copy['series'].push(seriesItemCopy);\n }\n }\n if (item['extra'] !== undefined) {\n copy['extra'] = JSON.parse(JSON.stringify(item['extra']));\n }\n results.push(copy);\n }\n return results;\n }","title":""},{"docid":"14b80af7021b2074396c59c0a37a3dfd","score":"0.5642831","text":"cloneData(data) {\n const results = [];\n for (const item of data) {\n const copy = {\n name: item['name']\n };\n if (item['value'] !== undefined) {\n copy['value'] = item['value'];\n }\n if (item['series'] !== undefined) {\n copy['series'] = [];\n for (const seriesItem of item['series']) {\n const seriesItemCopy = Object.assign({}, seriesItem);\n copy['series'].push(seriesItemCopy);\n }\n }\n if (item['extra'] !== undefined) {\n copy['extra'] = JSON.parse(JSON.stringify(item['extra']));\n }\n results.push(copy);\n }\n return results;\n }","title":""},{"docid":"d6b0138521f62f4edd8bd7c0c4ddae91","score":"0.56272763","text":"function cloneData(data){\n return JSON.parse(JSON.stringify(data));\n }","title":""},{"docid":"a091f35122757f0ae5cc7f7c585e59dd","score":"0.5576152","text":"function cloneIncomingData(data) {\n let forkliftSpeed = data.maxForkliftSpeed;\n let vertices = [];\n for (let verticeKey in data[\"graph\"][\"vertices\"]) {\n let adjacentVertexIds = [];\n for (let adjacentVertexKey in data[\"graph\"][\"vertices\"][verticeKey][\"adjacentVertexIds\"]) {\n adjacentVertexIds.push(data[\"graph\"][\"vertices\"][verticeKey][\"adjacentVertexIds\"][adjacentVertexKey]);\n }\n let scheduleItems = [];\n for (let scheduleItemsKey in data[\"graph\"][\"vertices\"][verticeKey][\"scheduleItems\"])\n position.push(data[\"graph\"][\"vertices\"][verticeKey][\"scheduleItems\"][scheduleItemsKey]);\n vertices.push({\n adjacentVertexIds: adjacentVertexIds,\n id: data[\"graph\"][\"vertices\"][verticeKey][\"id\"],\n isVisited: data[\"graph\"][\"vertices\"][verticeKey][\"isVisited\"],\n label: data[\"graph\"][\"vertices\"][verticeKey][\"label\"],\n position: {\n x: data[\"graph\"][\"vertices\"][verticeKey][\"position\"][\"x\"],\n y: data[\"graph\"][\"vertices\"][verticeKey][\"position\"][\"y\"]\n\n },\n previousVertex: data[\"graph\"][\"vertices\"][verticeKey][\"previousVertex\"],\n scheduleItems: scheduleItems\n })\n }\n let newData = {\n\n graph: {\n vertices: vertices\n },\n forkliftSpeed: forkliftSpeed\n };\n return newData;\n}","title":""},{"docid":"bceb9f9a9b2708639538f3eceaeefcad","score":"0.55543196","text":"function getLineData(data){\n\n // process fetched data\n var items = data.Items; //get all the items\n var labelArr = [];\n var dataArr = [];\n var prev = getTime(currentDate + SPACE + items[0].time);\n var labelPath = [];\n var dataPath = [];\n for(var i = 0; i < data.Count; ++i){\n var curTime = getTime(currentDate + SPACE + items[i].time);\n if(curTime - prev < 12000){ // difference between two times is within 4 seconds\n labelPath.push(items[i].time);\n dataPath.push(items[i].speed);\n prev = curTime;\n continue;\n }\n // if the difference between curTime and prevTime is greater than 4 seconds, push the previous label and data path\n labelArr.push($.extend(true,[], labelPath));\n dataArr.push($.extend(true, [], dataPath));\n labelPath = [];\n dataPath = [];\n prev = curTime;\n i--;\n }\n if(labelPath.length > 0 && dataPath.length > 0){ //push the last time bucket\n labelArr.push($.extend(true,[], labelPath));\n dataArr.push($.extend(true, [], dataPath));\n }\n\n var result = [];\n result.push(labelArr);\n result.push(dataArr);\n return result;\n}","title":""},{"docid":"39e14bb328715a93c41d1a5f9b59777f","score":"0.55276084","text":"function copyJson(old) {\r\n return JSON.parse(JSON.stringify(old));\r\n}","title":""},{"docid":"fda286adcf4ad4705e0c2f20f910dad3","score":"0.5504296","text":"function cloneData(data) {\n return data;\n //return JSON.parse(JSON.stringify(data));\n}","title":""},{"docid":"fda286adcf4ad4705e0c2f20f910dad3","score":"0.5504296","text":"function cloneData(data) {\n return data;\n //return JSON.parse(JSON.stringify(data));\n}","title":""},{"docid":"cffa8ddad0aa2887a830df734b3cec17","score":"0.55000466","text":"function breakdownJsonData(newData) {\n\t/*\n\t * For..in (loop) will move over all items in the JSON array.\n\t * The loop begins by assigning each new held asteroid value in the list to a new variable.\n\t * The newAsteroid is an object that is parsed for mass, id, and year.\n\t */\n\tfor (var asteroid in newData) {\n\n\t\t// Assign each held object in the list to a new variable called 'newAsteroid'\n\t\tlet newAsteroid = newData[asteroid];\n\n\t\t// Get the mass and id for storing into array as key-value pairs.\n\t\tlet asteroidId = newAsteroid[\"id\"];\n\t\tlet asteroidMass = newAsteroid[\"mass\"];\n\t\tlet updatedAsteroidYear = newAsteroid[\"year\"]; // Unformatted (Raw)\n\n\t\t// Basic null handling.\n\t\t// On condition that the mass is provided in the data, then add the asteroidId as\n\t\t// the index marker for the asteroidMass value.\n\t\tif (asteroidMass != null && updatedAsteroidYear != null) {\n\t\t\t// asteroidCount++;\n\t\t\tasteroidYears.push(updatedAsteroidYear);\n\t\t\tasteroidComparables[asteroidId] = asteroidMass;\n\t\t}\n\t}\n\t// Add data set of comparable data to array\n\t// which leaves a 973 item array that contains\n\t// an index and corresponding ID.\n\tasteroids = Object.keys(asteroidComparables);\n}","title":""},{"docid":"9a710614b642fdf58790d9cf17640541","score":"0.54986125","text":"_createFullJSON() {\n\n var self = this;\n\n var fullDataReady = $.Deferred();\n var dataToGet = new Set();\n\n // we start by fetching the initial dataUrl from the HTML\n var getData = self._fetch(self.options.dataUrl);\n\n // once the data is here.....\n getData.done((data) => {\n\n self.data = data;\n\n // go through the data and pull out and JSON we need to retrieve and make a set of values\n dataToGet = self._recursiveSearch(self.data, self.options.dataKey, dataToGet);\n\n // go through the data set, ajax in the actual JSON and refull\n recursiveGet(dataToGet);\n\n });\n\n function recursiveGet(dataToGet) {\n\n // if we enter here and there is no data, maybe it was a super simple JSON with no dataURLs, we just resolve\n if (dataToGet.size === 0) {\n fullDataReady.resolve();\n return;\n }\n\n // we find out how many items we have to get\n var size = dataToGet.size;\n\n // go through the data we found\n dataToGet.forEach((value) => {\n\n // get the JSON \n var getData = self._fetch(value);\n\n // once we are done, we replace the _dataUrl entry in the JSON with the actual data to \n // create a nice and pretty JSON object\n getData.done((data) => {\n\n self.data = self._replaceUrlWithData(self.data, self.options.dataKey, value, data);\n\n // we remove the item we just got out of our list\n dataToGet.delete(value); \n\n // if this was the last one, and there is nothing to get....\n if (dataToGet.size === 0) {\n\n // look through the \"new\" self.data and see if we now have any new _dataUrls\n var matchesLeft = self._recursiveSearch(self.data, self.options.dataKey, dataToGet);\n\n // if we do, let's start this part over again and get those\n if (matchesLeft.size > 0) {\n recursiveGet(matchesLeft);\n } else {\n // if there are no left, we are finally done. Resolve\n fullDataReady.resolve();\n }\n }\n\n });\n\n });\n \n }\n\n return fullDataReady;\n\n }","title":""},{"docid":"87da892f11bdadcd7a19a562b97641f3","score":"0.547979","text":"function getDataBeforeTime(data, lastTime) {\r\n \r\n var reducedData = [];\r\n \r\n data.map(function(item) {\r\n \r\n if (item.timestamp > lastTime) {\r\n reducedData.push( item );\r\n }\r\n });\r\n\r\n return reducedData;\r\n}","title":""},{"docid":"e31cde1df3cc42fe0b048f06305ebdbf","score":"0.54684454","text":"function fixUpData(json) {\n var data = json.map(j => j);\n data.push({ age: d3.max(json, d => d.age), males: 0, females: 0, total: 0 });\n data.push({ age: d3.min(json, d => d.age), males: 0, females: 0, total: 0 });\n return data;\n }","title":""},{"docid":"fd1fdd26528e184fd521ef07cd405063","score":"0.54402566","text":"static latest(data) {\n return data.length && data.filter(clear).length ?\n first(data.filter(clear).sort((a, b) => new Date(b).valueOf() - new Date(a).valueOf())) : undefined;\n }","title":""},{"docid":"5d501babd49960eb20fcc47697c8b95f","score":"0.54316056","text":"function simplifyJSON (data){\n var gls = data.skybitz.gls;\n gls.forEach(element => {\n if (element.landmark){\n var location = {\n name: element.landmark.geoname,\n city: element.landmark.city, \n latitude: element.latitude, \n longitude: element.longitude, \n time: new Date (element.time)\n };\n\n stops.push(location);\n // if (!landmarks[location.city]){\n // stops.push(location);\n // landmarks[location.city] = location.city;\n // }\n }\n });\n stops.sort(compare);\n}","title":""},{"docid":"e3fcb1eeaadb914275e912ee93571624","score":"0.5431354","text":"function cleanupData(){\n for(var i = 0; i < rawData.length; i++){\n var item = rawData[i];\n\n // Only include role models who have explicitly approved entering their data\n if(item[\"approval\"] == \"Approved\"){\n var newItem = {};\n for(var k in item) {\n var newKey = dataKeys[k];\n newItem[newKey] = item[k];\n }\n\n if(newItem[\"joined-date\"] == \"\") {\n newItem[\"joined-date\"] = newItem[\"event-timestamp\"];\n }\n\n newItem.id = i + 2;\n newItem.visible = true; //visible by default - this is important for the Popup\n data.push(newItem);\n }\n }\n\n data = data.sort(dateSort);\n}","title":""},{"docid":"17d9ee5392c58e1cc84bb14f61d311b3","score":"0.54174453","text":"getPrevStandings(){\n try{\n let numChunk = Number( this.getCookie( `numChunk-${this.taskId}` ) );\n let tmp = '';\n for(let i=0; i<numChunk; i++){\n let s = this.getCookie( `standings-${this.taskId}-${i}` );\n tmp += s;\n }\n let json = decodeURIComponent( tmp );\n let arr = JSON.parse( json );\n let prev = {};\n arr.forEach( e=>{\n prev[ e[0] ] = e;\n });\n return prev;\n }catch(e){\n console.log(e);\n return {};\n }\n }","title":""},{"docid":"7adcd93421339994599a95e3f4ce142a","score":"0.5410354","text":"function populateHistory (json)\n{\n Brandwatch.stores.historyStore.removeAll ();\n\n for (var i = 0; i < json.brandData.days.length; i++)\n {\n //The date comes back in an odd format with dashes and is fixed manually.\n var fixDate = json.brandData.days[i].date.replace (\"-\", \"/\");\n fixDate = fixDate.replace (\"-\", \"/\");\n fixDate = fixDate.split (\"T\")[0];\n\n var date = new Date (fixDate);\n date = formatDate (date);\n var mentionDate = new Date (fixDate);\n var mentions = json.brandData.days[i].mentions;\n var negDay = json.brandData.days[i].negative;\n var posDay = json.brandData.days[i].positive;\n var neuDay = json.brandData.days[i].neutral;\n\n Brandwatch.stores.historyStore.add ({'date':date, 'formatteddate':mentionDate, 'mentions':mentions, 'negative':negDay, 'positive':posDay, 'neutral':neuDay});\n }\n}","title":""},{"docid":"1a66e5301ba9cf2beffdd957df18e3c7","score":"0.53994876","text":"function mirror(data) {\n const sort = data.slice().sort((a, b) => a - b);\n return [...sort, ...sort.reverse().slice(1)];\n}","title":""},{"docid":"844f048b4e7fdfb380ad28e154462584","score":"0.53960073","text":"function prepareJsonData(json){\r\n\r\n\t// check with the requests or job\r\n\tif(json.type === TYPE.JOB){\r\n\t\tfor(let i = 0; i < json.data.length; i++){\r\n\t\t\tfor(let k = 0; k < jobs.length; k++){\r\n\t\t\t\tif(json.data[i] === jobs[k][JOBS.ID]){\r\n\t\t\t\t\tjson.data[i] = jobs.splice(k, 1)[0]; // remove the match (faster iteration) and keep it in cid_array\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}else{\r\n\t\tfor(let i = 0; i < json.data.length; i++){\r\n\t\t\tfor(let k = 0; k < requests.length; k++){\r\n\t\t\t\tif(json.data[i] === requests[k][CLIENT.CID]){\r\n\t\t\t\t\tjson.data[i] = requests.splice(k, 1)[0]; // remove the match (faster iteration) and keep it in cid_array\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}","title":""},{"docid":"51f0fe9d12a73e2a94f855cf0982321a","score":"0.5372041","text":"function importWellHistoryDto(data, parent) { return $.map(data || [], function (item) { return datacontext.createWellHistory(item, parent); }); }","title":""},{"docid":"18e98652cbfc1c6f94b7f88da4e56c58","score":"0.5355409","text":"function _copyJSONObj (json) {\n return JSON.parse( JSON.stringify(json) );\n}","title":""},{"docid":"697f4a677b3c7f2b73d4437e4f585dea","score":"0.5351896","text":"function transformJsonToGraphData(json) {\n\tnumberOfUtilities = json.utilities.length;\n\tcurrentYear = json.currYear;\n\tpreviousYear = json.prevYear;\n\n\tconsole.log(\"Number of utilities is: \" + numberOfUtilities);\n\tconsole.log(\"Current year is: \" + currentYear);\n\tconsole.log(\"Prev year is: \" + previousYear);\n\t\n\tdata = [];\n\t\n\tfor (i = 0; i < numberOfUtilities; i++) {\n\t\tutil = json.utilities[i];\n\n\t\tif (util.currMeasurement == null) continue;\n\n\t\tconsole.log(\"Consumable: \" + util.type + \" Year: \" + currentYear + \" Value: \" + util.currMeasurement);\n\t\tdata.push({ \"Consumable\":util.type, \"Year\":currentYear, \"Value\": util.currMeasurement});\n\t\tdata.push({ \"Consumable\":util.type, \"Year\":previousYear, \"Value\": util.prevMeasurement});\n\t}\n\t\n\tconsole.log(data);\n\t\n\treturn data;\n}","title":""},{"docid":"ba595686160627a779d5afa4ca55c168","score":"0.5288941","text":"function loadJson() {\n historicalData = JSON.parse(fs.readFileSync(__dirname + '/data/' + exchange + '_' + pair + '_' + interval + '.json', 'utf8'));\n main();\n}","title":""},{"docid":"f7d2000e78ecb5e6e166e4509308cecb","score":"0.5288412","text":"function createLines(json) {\n var meta = json.meta;\n var data = json.data;\n\n var newLines = [];\n\n for (var i=0; i < meta.lines.length; i++) {\n // Get the tag\n var lineTag = meta.lines[i].tag;\n\n newLines.push([]);\n // Generate the list of data (month, measurement)\n for (var j=0; j < data.length; j++) {\n // Assumes data has a \"Month\" tag in each element\n newLines[i].push([data[j][\"Month\"], data[j][lineTag]]);\n }\n }\n return newLines;\n }","title":""},{"docid":"564b58d6f5bfc082a40ce783269a43aa","score":"0.52828133","text":"function parseJSONData(objs, row = []){\r\n for (var i in objs) {\r\n if(!objs[i].hasOwnProperty('sub')){\r\n \r\n row.push(objs[i].key)\r\n row.push(objs[i].descr)\r\n row.push(objs[i].src)\r\n row.push(objs[i].url)\r\n row.push(objs[i].coords)\r\n\r\n // get years for first row of array (push it after)\r\n for(y in objs[i].values){\r\n row.push(objs[i].values[y].val)\r\n if(jsonYears.indexOf(objs[i].values[y].year) === -1) \r\n jsonYears.push(objs[i].values[y].year)\r\n } \r\n\r\n if(arrayData.length){\r\n for (var j = 0; j < arrayData[0].length - row.length; j++) {\r\n row.unshift('')\r\n }\r\n }\r\n\r\n arrayData.push(row.splice(0))\r\n row.length = 0\r\n }\r\n\r\n if(objs[i].hasOwnProperty('sub')){\r\n row.push(objs[i].key)\r\n parseJSONData(objs[i].sub, row)\r\n }\r\n }\r\n }","title":""},{"docid":"f7afb8b97dbbf372767c0bcd51e7f7e3","score":"0.52764654","text":"function pop(){\n const tempRemove = Object.keys(json)[Object.keys(json).length-1];\n delete json[tempRemove];\n console.log(json);\n document.getElementById(\"changed-text\").innerHTML = JSON.stringify(json);\n}","title":""},{"docid":"41253d8c4e4e9e4588c0627c6bde7d86","score":"0.5270185","text":"function processSheetData(data, tabletop) {\n // let prevjson = JSON.parse(fs.readFileSync('./RawData/VideoData.json'))\n let prevjson = {\"cities\":{},\"totalVideos\":0}\n // let prevTotalVideos = prevjson.totalVideos ? prevjson.totalVideos : 0;\n //if (prevTotalVideos === data.length) {\n // console.log(\"No New Videos\")\n // return (prevjson)\n //} else {\n let lines = data\n for (let i = 0; i < lines.length; i++) {\n let currentline = lines[i];\n if (prevjson.cities && prevjson.cities[currentline['City']]) {\n prevjson.cities[currentline['City']].videos.push({\n link: currentline['Link'],\n caption: currentline['Caption'],\n date: currentline['Date']\n })\n } else {\n if (!prevjson.cities) {\n prevjson.cities = {}\n }\n prevjson.cities[currentline['City']] = {\n videos: [{\n link: currentline['Link'],\n caption: currentline['Caption'],\n date: currentline['Date']\n }],\n coordinates: {\n latitude: currentline['Latitude (°N)'],\n longitude: currentline['Longitude (°E)']\n }\n }\n }\n }\n prevjson.totalVideos = lines.length;\n return (prevjson)\n //}\n}","title":""},{"docid":"1a4fe54e24f67be056a900d23cc3a154","score":"0.52607197","text":"getSortedTimeline(statsData) {\n let timelineSorted = [];\n let timelineSettings = pathOr(null, ['timeline', 'settings'], statsData);\n let timelineData = pathOr(null, ['timeline', 'data'], statsData);\n if (timelineData && timelineSettings) {\n for (let key of Object.keys(timelineData)) {\n let entry = timelineData[key];\n entry.tc = parseInt(key);\n entry.ts = entry.tc * (timelineSettings.bucket_duration || 60000);\n timelineSorted.push(entry);\n }\n }\n // Sort it by timecode ascending\n timelineSorted.sort(function(a, b) {\n return a.tc - b.tc;\n });\n return timelineSorted;\n }","title":""},{"docid":"6e776380b376abadba9e964249820974","score":"0.52212006","text":"function parseJson() {\n\t\tvar json;\n\t\ttry {\n\t\t\tjson = JSON.parse(result.data);\n\t\t} catch (excp) {\n\t\t\tthrow \"No json format: \" + excp;\n\t\t}\n\t\tresult.json = json.locations ? json : { locations: json };\n\n\t\tresult.times[2] = Date.now();\n\t\tresult.times[1] = result.times[2] - result.times[1];\n\t\tshowStatus(\"json: \" + result.times[1] + \"ms, json.locations.length=\" + result.json.locations.length);\n\t\t\n\t\t// check for google location.json layout\n\t\tvar loc = result.json.locations;\n\t\tif (loc && loc.length && \"timestampMs\" in loc[0] && \"latitudeE7\" in loc[0]) {\n\t\t\t// init dates obj\n\t\t\tresult.dates = {\n\t\t\t\t// google is reverse order; avoid sec with fraction\n\t\t\t\tminMillis: Math.floor(+loc[loc.length - 1].timestampMs / 1000) * 1000,\n\t\t\t\tmaxMillis: Math.ceil(+loc[0].timestampMs / 1000) * 1000\n\t\t\t};\n\t\t\tresult.dates.startMillis = result.dates.minMillis;\n\t\t\tresult.dates.endMillis = result.dates.maxMillis;\n\n\t\t\tsetSelected();\n\t\t\tshowStatus(\"location data\" +\n\t\t\t\t\" from \" + result.dates.startDate + \" \" + result.dates.startTime +\n\t\t\t\t\" to \" + result.dates.endDate + \" \" + result.dates.endTime);\n\t\t} else {\n\t\t\tshowStatus(\"no location data found\");\n\t\t\treturn;\n\t\t}\n\n\t\t// chain to next step\n\t\t//next(sliceTimes);\n\t\tnext();\t// done\n\t}","title":""},{"docid":"10a38bac664eb50e099ca90fad84cecb","score":"0.5211868","text":"deepClone(data) {\n return JSON.parse(JSON.stringify(data));\n }","title":""},{"docid":"5be2cfed6d8db94b26b572066be49fa9","score":"0.5202415","text":"function GetGraphData (callback) {\r\n \r\n $.getJSON('/api/series', function (data) {\r\n \r\n return callback(data.reverse());\r\n \r\n });\r\n \r\n}","title":""},{"docid":"af6b030bb50d1515b3d56d941fde6b3f","score":"0.51961774","text":"function setDataObject(dt) {\n\n var dataFilter = [];\n var dmtIndex = 0;\n if (dt !== null) {\n\n dataFilter.push([dt[0][\"created_at\"],\n dt[0][\"firstname\"],\n dt[0][\"lastname\"],\n dt[0][\"city\"],\n dt[0][\"zip\"],\n dt[0][\"birthday\"],\n [dt[0][\"feldersDatum\"]]]);\n\n for (let i = 1; i < dt.length - 1; i++) {\n\n if (dt[i][\"created_at\"] !== dt[i - 1][\"created_at\"]) {\n dmtIndex++;\n dataFilter.push([dt[i][\"created_at\"],\n dt[i][\"firstname\"],\n dt[i][\"lastname\"],\n dt[i][\"city\"],\n dt[i][\"zip\"],\n dt[i][\"birthday\"],\n [dt[i][\"feldersDatum\"]]\n ]);\n } else {\n dataFilter[dmtIndex][6].push(dt[i][\"feldersDatum\"]);\n }\n }\n //console.log(dataFilter);\n return dataFilter;\n\n }\n}","title":""},{"docid":"bfa5eca73486e74d2c277aa6adbc8ba3","score":"0.5184731","text":"function combineJson(jsonObj, oldJsonObj){\n for (let i = 0; i < jsonObj.data.stations.length; i++) {\n jsonObj.data.stations[i].name = oldJsonObj.data.stations[i].name;\n }\n return jsonObj;\n}","title":""},{"docid":"59be5d2f1344caf9ef5fbb55a4bfb58a","score":"0.5159301","text":"function scrubData(data) {\n var scrubbed = [];\n for (var i = 0; i < data.length; i++) {\n if (i == 0) {\n scrubbed.push([]);\n scrubbed[scrubbed.length - 1].push(data[i]);\n }\n else if (scrubbed[scrubbed.length - 1][0].city != data[i].city) {\n if (data[i].pop > 4500)\n scrubbed.push([]);\n scrubbed[scrubbed.length - 1].push(data[i]);\n }\n else {\n scrubbed[scrubbed.length - 1].push(data[i]);\n }\n }\n return scrubbed;\n }","title":""},{"docid":"3b2a0b7994c80703a08fe0c99088e5e8","score":"0.515619","text":"getHistoricalMotorData(num) {\n fetch(serverAddress + `/historical-motor-data?quantity=${encodeURIComponent(num)}`)\n .then(rawData => rawData.json())\n .then(objData => objData.data)\n .then(arrData => arrData.map(item => JSON.parse(item).date).reverse())\n .then(finalData => this.setState({ historicalMotorData: finalData}))\n \n }","title":""},{"docid":"1eb2b54b6d5ca730fb6e1d2bbe1d1eff","score":"0.5153236","text":"on_update_data(json) {\n if (json == null) {\n this.series_time = null\n this.series = {}\n this.instruction_nums = []\n this.indices = []\n this.addresses = []\n this.targets = []\n this.modality = {}\n this.y_extents = [-1,1]\n this.downsampling = -1\n this.add_status_msg(BaseWidget.NO_DATA_FOR_TIME_RANGE)\n this.downsampling_span.html('?')\n this.points_span.html('0')\n return\n }\n\n const msg = json.raw_binary_data\n\n const nseries = json.processorSpecific.numSeries\n const points_per_series = json.processorSpecific.pointsPerSeries\n const series_blob_offset = json.processorSpecific.seriesBlobOffset\n const modalities_offset = json.processorSpecific.modalitiesOffset\n this.downsampling = json.processorSpecific.downsampling\n const instruction_nums_offset = json.processorSpecific.instructionNumsOffset\n const indices_offset = json.processorSpecific.indicesOffset\n const addresses_offset = json.processorSpecific.addressesOffset\n const targets_offset = json.processorSpecific.targetsOffset\n\n this.downsampling_span.html(this.downsampling > 1 ? ('/' + this.downsampling.toString()) : 'none')\n this.points_span.html(points_per_series.toString())\n\n // Parse out heatmap binary data\n if (nseries == 0 || points_per_series == 0) {\n this.series_time = null\n this.series = {}\n this.instruction_nums = []\n this.indices = []\n this.addresses = []\n this.targets = []\n this.modality = {}\n this.downsampling = -1\n this.y_extents = [-1,1]\n this.add_status_msg(BaseWidget.NO_DATA_FOR_TIME_RANGE)\n return\n }\n\n const data = new Float32Array(msg, series_blob_offset, nseries * points_per_series) // Skip dims\n const modalities = new Int16Array(msg, modalities_offset, nseries)\n this.series_time = data.subarray(0, points_per_series)\n this.series = {}\n this.modality = {}\n this.y_extents = json.processorSpecific.yExtents\n for (let i = 0; i < this._stat_cols.length; i++) {\n const begin = (i + 1) * points_per_series\n const end = begin + points_per_series\n this.series[this._stat_cols[i]] = data.subarray(begin, end)\n this.modality[this._stat_cols[i]] = modalities[i + 1]\n }\n\n\n // Capture some bp-specific stuff (this should be moved to the bp widget instead)\n if (typeof instruction_nums_offset != 'undefined')\n this.instruction_nums = new BigInt64Array(msg, instruction_nums_offset, points_per_series)\n else\n this.instruction_nums = []\n if (typeof indices_offset != 'undefined')\n this.indices = new BigInt64Array(msg, indices_offset, points_per_series)\n else\n this.indices = []\n if (typeof addresses_offset != 'undefined')\n this.addresses = new BigInt64Array(msg, addresses_offset, points_per_series)\n else\n this.addresses = []\n if (typeof targets_offset != 'undefined')\n this.targets = new BigInt64Array(msg, targets_offset, points_per_series)\n else\n this.targets = []\n }","title":""},{"docid":"48bc0bc935ce2739e7e95c7c75025c24","score":"0.51362735","text":"addOpeningMoment(data, keys) {\n let priorData = data.filter(x => x.date <= this.minDate);\n // If no prior data no need to add opening moment\n // - expandMomentsCumulative will start with zero moment for all keys at min date\n if (priorData.length !== 0) {\n let lastPriorDatum = priorData[priorData.length - 1];\n // No need to add opening moment if there is already a cumulative datum at the min date\n if (lastPriorDatum.date.getTime() !== this.minDate.getTime()) {\n let openingMoment = this.newMoment(lastPriorDatum, keys);\n // Change date from last prior moment to minDate\n openingMoment.date = new Date(this.minDate.getTime());\n this.moments.unshift(openingMoment);\n }\n }\n }","title":""},{"docid":"3b4b3375190c18a2c7598672ade71af9","score":"0.5130049","text":"function processMainChart(data, callback, update){\n\n\t\t\t// Some more data processing before drawing the chart\n\t\t\t// Adding a last element to each val_history array,\n\t\t\t// with the current timestamp (so all lines extend till the current time)\n\t\t\tvar fullTimeline = _.each(data, function(element, index, list){\n\t\t\t\tvar d = new Date();\n\t\t\t\tcurrentTimestamp = d.getTime();\n\t\t\t\tvar newHistory = {\n\t\t\t\t\tface_val: element.val_history[element.val_history.length - 1].face_val,\n\t\t\t\t\tsocial_val: element.val_history[element.val_history.length - 1].social_val,\n\t\t\t\t\tts: currentTimestamp\n\t\t\t\t}\n\t\t\t\telement.val_history.push(newHistory);\n\t\t\t});\t\t\t\n\n\t\t\tcallback(fullTimeline, update);\n\t\t}","title":""},{"docid":"74c3e58deec00e47b70ae04a68fa126d","score":"0.51270944","text":"function ReverseJson(JsonResponse) {\n // Response / input of Json Object Response By Sequence\n PickPackingCtrl.ePage.Masters.JsonObjectResponse = $filter('orderBy')(JsonResponse, 'Sequence');\n\n // Function call to convert the json\n if (PickPackingCtrl.ePage.Masters.JsonObjectResponse.length > 0) {\n ConvertJson(PickPackingCtrl.ePage.Masters.JsonObjectResponse);\n }\n else {\n PickPackingCtrl.ePage.Masters.FramedObject = [];\n }\n\n // Assigning the parent child json to the Tree Object (ng-repeat Obj)\n PickPackingCtrl.ePage.Masters.tree = PickPackingCtrl.ePage.Masters.FramedObject;\n\n if (PickPackingCtrl.ePage.Masters.tree.length > 0) {\n // for first obj response select true \n PickPackingCtrl.ePage.Masters.tree[0].IsSelectedValue = true;\n\n }\n\n }","title":""},{"docid":"ce31685cdd15caa847fe31c4f517a202","score":"0.5116562","text":"function processJSON(json_data){\n // verify that the json data is valid\n if('dev_id' in json_data && 'clock' in json_data){\n // set the new newest time\n sensor_data_array[json_data.dev_id-1].newest_time = json_data.clock\n \n // check if the sensor array index doesn't exist, create it.\n while( typeof sensor_data_array[json_data.dev_id-1] == 'undefined'){\n sensor_data_array.push(sensor_data);\n }\n // add the data values from the packet to the sensor_data_array\n if('pressure' in json_data){\n sensor_data_array[json_data.dev_id-1].\n pressure.data.push([json_data.clock, json_data.pressure])\n sensor_data_array[json_data.dev_id-1].\n pressure.data.sort()\n }\n if('temp' in json_data){\n sensor_data_array[json_data.dev_id-1].\n temp.data.push([json_data.clock, json_data.temp])\n sensor_data_array[json_data.dev_id-1].\n temp.data.sort()\n }\n if('humidity' in json_data){\n sensor_data_array[json_data.dev_id-1].\n humidity.data.push([json_data.clock, json_data.humidity])\n sensor_data_array[json_data.dev_id-1].\n humidity.data.sort()\n }\n if('light' in json_data){\n sensor_data_array[json_data.dev_id-1].\n light.data.push([json_data.clock, json_data.light])\n sensor_data_array[json_data.dev_id-1].\n light.data.sort()\n }\n if('moisture' in json_data){\n sensor_data_array[json_data.dev_id-1].\n moisture.data.push([json_data.clock, json_data.moisture])\n sensor_data_array[json_data.dev_id-1].\n moisture.data.sort()\n }\n }\n //console.log(sensor_data_array[json_data.dev_id-1].pressure.data)\n //console.log(sensor_data_array[json_data.dev_id-1].temp.data)\n //console.log(sensor_data_array[json_data.dev_id-1].humidity.data)\n //console.log(sensor_data_array[json_data.dev_id-1].light.data)\n //console.log(sensor_data_array[json_data.dev_id-1].moisture.data)\n}","title":""},{"docid":"88d9a73683cd92464e793cbcd92ff48c","score":"0.51095","text":"static fromJSON(json) {\n let sections = [],\n inserted = [];\n\n for (let i = 0; i < json.length; i++) {\n let part = json[i];\n\n if (typeof part == \"number\") {\n sections.push(part, -1);\n } else if (part.length == 1) {\n sections.push(part[0], 0);\n } else {\n while (inserted.length < i - 1) inserted.push(_text.Text.empty);\n\n inserted[i] = _text.Text.of(part[1]);\n sections.push(part[0], inserted[i].length);\n }\n }\n\n return new ChangeSet(sections, inserted);\n }","title":""},{"docid":"f1a644982e2f7fdc9d9f312b14c91d45","score":"0.508408","text":"function updateTraffic(json) {\n lim = Math.min(index + 50, json.length - 1)\n while (index < lim) {\n addPage(json[index++])\n }\n if (lim < json.length -1) updateView();\n}","title":""},{"docid":"26c30a545c0a090999b69f867b3641a8","score":"0.50815725","text":"_addHistory(array, data) {\n array.push(data);\n if (array.length > 10) { // limit history length\n array.splice(0, 1);\n }\n }","title":""},{"docid":"1a39dfa600deee25a57bbe16dbb2c8e0","score":"0.5077135","text":"function resetData(){\n $.getJSON('http://www.whateverorigin.org/get?url=' + encodeURIComponent(topAppsurl) + '&callback=?', function(data){\n let onlyNewItems = new Set();\n let t = $(data.contents).find('div.Vpfmgd');\n for(let i=0; i<t.length; i++){\n let item = {\n link: $(t[i]).find('a.poRVub').attr('href').split('?')[1],\n img: $(t[i]).find('img.T75of').attr('data-src'),\n title: $(t[i]).find('div.WsMG1c').text(),\n };\n if(!titleDataSet.has(item.title)){\n onlyNewItems.add(item);\n titleDataSet.add(item.title);\n dataset.add(item);\n }\n }\n appendNewParticularChildrens(onlyNewItems);\n\n //clear onlyNewItems because items are no longer new to us, they have been added to DOM\n onlyNewItems.clear();\n });\n}","title":""},{"docid":"29db4fb1b43c8c5c89c05dc8803bb74c","score":"0.50696844","text":"static earliest(data) {\n return data.length && data.filter(clear).length ?\n last(data.filter(clear).sort((a, b) => new Date(b).valueOf() - new Date(a).valueOf())) : undefined;\n }","title":""},{"docid":"db1f15df0237f5ffd1e53880195dcb22","score":"0.50583583","text":"undo() {\n this.history.pop();\n const last = _.last(this.history);\n _.each(last, (value, key) => {\n this[key] = JSON.parse(JSON.stringify(value));\n });\n }","title":""},{"docid":"c5ca16397c06a4b9d03445cc98998f72","score":"0.50537","text":"function JSONClone(obj) {\n return JSON.parse(JSON.stringify(obj));\n}","title":""},{"docid":"c5ca16397c06a4b9d03445cc98998f72","score":"0.50537","text":"function JSONClone(obj) {\n return JSON.parse(JSON.stringify(obj));\n}","title":""},{"docid":"c5ca16397c06a4b9d03445cc98998f72","score":"0.50537","text":"function JSONClone(obj) {\n return JSON.parse(JSON.stringify(obj));\n}","title":""},{"docid":"c5ca16397c06a4b9d03445cc98998f72","score":"0.50537","text":"function JSONClone(obj) {\n return JSON.parse(JSON.stringify(obj));\n}","title":""},{"docid":"c5ca16397c06a4b9d03445cc98998f72","score":"0.50537","text":"function JSONClone(obj) {\n return JSON.parse(JSON.stringify(obj));\n}","title":""},{"docid":"e91bac7d02f57fa2e4cc953cb7ce85ac","score":"0.5049681","text":"function fixFlickrJSON(data) {\n\n var content = null;\n \n for (var key in data) {\n\n if (key == '_content') {\n content = data._content;\n break;\n } else if (typeof(data[key]) == 'object') {\n data[key] = fixFlickrJSON(data[key]);\n }\n \n }\n \n if (content != null) {\n data = content;\n }\n \n return data;\n \n}","title":""},{"docid":"3b79255da7b6fb315952b7a1af95cb46","score":"0.5042081","text":"bootstrap(json) {\n if (!json) {\n return;\n }\n\n this.cached = this.cached.update(() => {\n return Immutable.fromJS(JSON.parse(json));\n });\n return this.cached;\n }","title":""},{"docid":"11a1c2baff3d46a4197e0a762ab19b43","score":"0.5038528","text":"function previousComments(data){\n //console.log(data.Comments.length)\n for (var i = 0; i < data.Comments.length; i++) {\n //create li for each of the comments\n var newlist = createList(data.Comments, i)\n //console.log(i)\n $(`#${data._id}`).append(newlist)\n }\n\n }","title":""},{"docid":"39e99a2fea76b2054caec9a28253afcd","score":"0.5037856","text":"fixJsonData() {\n return this.data.map((row, i) => {\n // Create an array with the string splited by separator\n stringSplited = row.o.split(\"/\");\n let result = this.extractData(stringSplited, row.n);\n return result;\n });\n }","title":""},{"docid":"a2c8d0fca5d8d24f9aaa5550e6fd7e89","score":"0.502556","text":"function sortData(data) {\n data.sort(function (a, b) {\n return a.start - b.start\n });\n return data;\n }","title":""},{"docid":"b367ccaf43a04c4c0cfa47d239ea647d","score":"0.5011954","text":"function LoadData() {\n\n //Creating the new timeline \n var timelineContainer = $('#timeline_container')\n var documentBody = $(document.body);\n \n // Remove old timeline\n $('#timeline').remove();\n\n // Create a new timeline\n var appending = $('<div>').attr('id', 'timeline').appendTo(timelineContainer);\n var timeline_data = [];\n var Features = {};\n\n \n $('#timeline').addClass('TimelineContainer');\n \n\n}","title":""},{"docid":"cd68e4a5b5b1c3b6f34b0949a6d2a23f","score":"0.501151","text":"getProcessedJson(data, header) {\n let keys = this.getKeys(data, header);\n let newData = [];\n let _self = this;\n data.map(function(item, index) {\n let newItem = {};\n for (let label in keys) {\n let property = keys[label];\n newItem[label] = _self.getValue(property, item);\n }\n newData.push(newItem);\n });\n\n return newData;\n }","title":""},{"docid":"07be25e9b86437e51f2955011b45334f","score":"0.5011288","text":"update()\n { \n let nextTime = this.time + 1;\n this.history.set(nextTime, []);\n for (let x=1; x != this.values.length - 1; ++x)\n {\n for (let y=1; y != this.values[x].length - 1; ++y)\n {\n let tmp_next = this.getNext(x, y);\n if (this.values[x][y] !== tmp_next)\n this.history.get(nextTime).push({'x': x, 'y': y, 'new': tmp_next, 'old': this.values[x][y]});\n }\n }\n return this;\n }","title":""},{"docid":"8d93bc7be9da3c97c6570752cd1b0bbb","score":"0.50085366","text":"function transformData(data) {\n var newData = [];\n for (var key in data) {\n var value = data[key];\n var tempObject = {\n key: key\n };\n tempObject.values = value;\n newData.push(tempObject);\n }\n\n return newData;\n }","title":""},{"docid":"8d489db59a2fd3e93bd3c52a4b109758","score":"0.5002793","text":"async function readAndParseGithubData() {\n const dataFile = readFileSync('./data.json', { encoding: 'utf-8' })\n const parsed = JSON.parse(dataFile)\n\n let total = parsed.length\n let count = parsed.length - 100\n let res = []\n\n while (total > 0) {\n const arrayContent = parsed.slice(count, total)\n\n if (arrayContent.length > 0) {\n res = res.concat([arrayContent])\n }\n\n total = total - 100\n count = count - 100\n }\n\n if (total > -100) {\n total = total + 100\n res = res.concat([parsed.slice(0, total)])\n }\n\n const resParsed = await res.map((item, i) => {\n console.log(`${i} = ${item.length}`)\n\n return item.map(it => ({\n collectionId: 18455651,\n title: it.full_name,\n link: it.html_url,\n tags: [\"github\", `${it.language}`],\n created: it.created_at,\n excerpt: it.description\n }))\n })\n console.log(`total = ${resParsed.length}`)\n await writeFileSync('./newData.json', JSON.stringify(resParsed))\n}","title":""},{"docid":"acf81b344cc77e2a61ba5047bc1c26a5","score":"0.4998871","text":"function DeepCopy(initialState){\n motionEntityList=[]\n for(i=0;i<initialState.motionEntityList.length;i++){\n //motionEntityList.push(Object.assign({Entity},initialState.motionEntityList[i]));\n motionEntityList.push($.extend(true,{},initialState.motionEntityList[i]));\n }\n staticEntityList=[]\n for(i=0;i<initialState.staticEntityList.length;i++){\n //staticEntityList.push(Object.assign({Entity},initialState.staticEntityList[i]));\n staticEntityList.push($.extend(true,{},initialState.staticEntityList[i]));\n }\n backgroundList=[]\n for(i=0;i<initialState.backgroundList.length;i++){\n //backgroundList.push(Object.assign({Entity},initialState.backgroundList[i]));\n backgroundList.push($.extend(true,{},initialState.backgroundList[i]));\n }\n return new levelData(motionEntityList,staticEntityList,backgroundList);\n}","title":""},{"docid":"4b24fa6670c4638202b8ccec8571473e","score":"0.49936724","text":"function JSONClone (obj) {\n return JSON.parse(JSON.stringify(obj))\n}","title":""},{"docid":"9ffdb09dfb2f546d887c1749a37384f0","score":"0.4991459","text":"shiftItems(index){\n for(let i = index; i < this.length - 1; i++){\n this.data[i] = this.data[i+1];\n }\n delete this.data[this.length - 1];\n this.length--;\n }","title":""},{"docid":"3f49f26c0ce7c78d8aa962b0014ce092","score":"0.49850726","text":"function refreshJSON() {\n if (typeof players !== 'undefined' && players.length > 0) {\n lastPlayers = players.slice();\n }\n players = [];\n duration = [];\n xmlhttp.open('GET', url, false);\n xmlhttp.send();\n for (i in playerData) {\n players.push(playerData[i].name);\n duration.push(playerData[i].playtime);\n }\n}","title":""},{"docid":"51ab8ade0ec38dd881a299a782595ab6","score":"0.4978438","text":"static createListFromJson(jsonObj)\n\t{\n\t\tvar answer = [];\n\t\tfor (var nextBlogPostIndex = 0; nextBlogPostIndex < jsonObj.length; nextBlogPostIndex++)\n\t\t{\n\t\t\tanswer.push(NextBlogPostCard.createFromJson(jsonObj[nextBlogPostIndex]));\n\t\t}\n\t\treturn answer;\n\t}","title":""},{"docid":"156a518b0fab69db1c1de04d818f4dbc","score":"0.4976484","text":"function retainCommonTimeFrame(widget, data) {\n\t\t\tif (!data || data.length == 0)\n\t\t\t\treturn [];\n\t\t\tif (widget.options.drawAggregates !== false && widget.options.drawAggregates !== undefined)\n\t\t\t\treturn addHistory(widget, data);\n\t\t\tlet now = Date.now();\n\t\t\tlet startOfLastMinute = now - 60000;\n\t\t\tlet startOfShortestSeries = data.reduce((high, e) => Math.max(e.points[0], high), 0);\n\t\t\tlet startCutoff = data.length == 1 ? startOfShortestSeries : Math.min(startOfLastMinute, startOfShortestSeries);\n\t\t\tlet endOfShortestSeries = data.reduce((low, e) => {\n\t\t\t\tlet endTime = e.points[e.points.length - 2];\n\t\t\t\treturn endTime > now - 4000 ? Math.min(endTime, low) : low;\n\t\t\t}, now);\n\t\t\tlet endCutoff = endOfShortestSeries;\n\t\t\tdata.forEach(function(seriesData) {\n\t\t\t\tlet src = seriesData.points;\n\t\t\t\tif (src.length == 4 && src[2] >= startCutoff) {\n\t\t\t\t\tif (src[1] == src[3]) {\n\t\t\t\t\t\t// extend a straight line between 2 points to cutoff\n\t\t\t\t\t\tseriesData.points = [Math.max(seriesData.observedSince, Math.min(startOfShortestSeries, src[2] - 59000)), src[1], src[2], src[3]];\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet points = [];\n\t\t\t\t\tfor (let i = 0; i < src.length; i += 2) {\n\t\t\t\t\t\tif (src[i] >= startCutoff && src[i] <= endCutoff) {\n\t\t\t\t\t\t\tpoints.push(src[i]);\n\t\t\t\t\t\t\tpoints.push(src[i+1]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tseriesData.points = points;\t\t\t\t\n\t\t\t\t}\n\t\t\t});\n\t\t\treturn data.filter(seriesData => seriesData.points.length >= 2 \n\t\t\t\t&& seriesData.points[seriesData.points.length - 2] > startOfLastMinute);\n\t\t}","title":""},{"docid":"546f232e294721daaf638a128477085b","score":"0.497135","text":"function formatData(data) {\n for (var i=0; i < data['list'].length; i++) {\n var day = retrieveDay(data['list'][i]['dt']);\n data['list'][i]['day'] = day;\n var icon = retrieveWeatherIcon(data['list'][i]['weather'][0]['main']);\n data['list'][i]['icon'] = icon\n data['list'][i]['dt'] = convertUnixTimeStamp(data['list'][i]['dt'], '');\n data['list'][i]['deg'] = degreeToText(data['list'][i]['deg']);\n data['list'][i]['sunrise'] = convertUnixTimeStamp(data['list'][i]['sunrise'], 'hours');\n data['list'][i]['sunset'] = convertUnixTimeStamp(data['list'][i]['sunset'], 'hours');\n }\n\n return data\n}","title":""},{"docid":"609828ecdd6a18ca513048617e219844","score":"0.49659622","text":"function prepData() {\n var t, v;\n var dt = Number($scope.datasource.deltaT);\n var len = Math.ceil($scope.trange / (dt * $scope.tscale ));\n var dlen = $scope.buffer.data.length;\n if (len > dlen) {\n len = dlen;\n }\n\n var plotData = [];\n\n for (var i = 0; i < len; i++) {\n t = -dt * i * $scope.tscale;\n v = $scope.buffer.data[dlen - 1 - i];\n //t = $scope.buffer.time[dlen-1-i] * $scope.tscale;\n plotData.push([t, v]);\n }\n return plotData;\n }","title":""},{"docid":"e30b847cc7b80d3b8c048b5c345c89a4","score":"0.4962687","text":"downloadData(){\n let jsonData = JSON.parse(JSON.stringify(this.graphData));\n // data is an array of objects that might be deeply nested (with more than 1 level)\n let flatJSONData = []\n _.forEach(jsonData, function(item){\n flatJSONData.push(flatten(item));\n });\n return flatJSONData;\n }","title":""},{"docid":"6d2f9f1587f19a45a0bf3178bef0767a","score":"0.49579963","text":"function JSONLoader() {\n var navdata;\n var count;\n var length;\n\n /**\n * Loads a JSON-file.\n * @param {File} file - The JSON-file.\n */\n this.loadJSON = function(file) {\n fr = new FileReader();\n fr.onload = function (e) {\n lines = e.target.result;\n navdata = (JSON.parse(lines))[0].data;\n length = navdata.length;\n count = 0;\n console.log(navdata);\n };\n\n fr.readAsText(file);\n };\n\n /**\n * Returns the next set of navdata.\n * @returns {Navdata}\n */\n this.getNextDataSet = function() {\n // check if end of object is reached\n if (count == length) {\n return null;\n }\n\n dataSet = navdata[count];\n count++;\n\n navdataSet = new Navdata(\n dataSet.roll != undefined ? dataSet.roll : null,\n dataSet.pitch != undefined ? dataSet.pitch : null,\n dataSet.yaw != undefined ? dataSet.yaw : null,\n dataSet.thrust != undefined ? dataSet.thrust : null,\n dataSet.deapth != undefined ? dataSet.deapth : null,\n dataSet.hdgd != undefined ? dataSet.hdgd : null,\n dataSet.acclx != undefined ? dataSet.acclx : null,\n dataSet.accly != undefined ? dataSet.accly : null,\n dataSet.acclz != undefined ? dataSet.acclz : null,\n dataSet.magx != undefined ? dataSet.magx : null,\n dataSet.magy != undefined ? dataSet.magy : null,\n dataSet.magz != undefined ? dataSet.magz : null,\n dataSet.gyrox != undefined ? dataSet.gyrox : null,\n dataSet.gyroy != undefined ? dataSet.gyroy : null,\n dataSet.gyroz != undefined ? dataSet.gyroz : null,\n dataSet.lacclx != undefined ? dataSet.lacclx : null,\n dataSet.laccly != undefined ? dataSet.laccly : null,\n dataSet.lacclz != undefined ? dataSet.lacclz : null,\n dataSet.gravx != undefined ? dataSet.gravx : null,\n dataSet.gravy != undefined ? dataSet.gravy : null,\n dataSet.gravz != undefined ? dataSet.gravz : null,\n dataSet.timestamp != undefined ? dataSet.timestamp : null\n );\n\n console.log(\"JSONLoader received data set \" + count);\n return navdataSet;\n }\n}","title":""},{"docid":"f68dae2a4b0da41da1043aa043cd50d9","score":"0.49573034","text":"function loadData()\n{\n loadJSON('lastSearch.json', loadedData);\n}","title":""},{"docid":"7c7eaae7b808629957bdbffc77cafa9f","score":"0.49534792","text":"function parseJson(json_data) {\n sitesObj = JSON.parse(json_data);\n\n // Once the json file has been stored, we retrieve the source file\n loadingJson = false;\n getFile(chrome.runtime.getURL(\"sourcefile.tsv\"));\n}","title":""},{"docid":"582467049edba892756cc0b468668e48","score":"0.49519426","text":"function sortTimeline(timeline){\r\n timeline.sort((a, b) => (a.timestamp.localeCompare(b.timestamp)) * -1);\r\n }","title":""},{"docid":"0368a6327e376582c4ec79c2b6fe8b07","score":"0.4938829","text":"function getLatestTempData() {\n\t\n\tvar request = new XMLHttpRequest;\n\trequest.overrideMimeType(\"application/json\");\n\trequest.open(\"GET\", window.location.origin + \"/temp_data.json\", true);\n\trequest.onload = function() {\n\t\twindow.g_lastTempData = JSON.parse(request.responseText);\n\t\t// console.log(\"new temps: \" + JSON.stringify(window.g_lastTempData));\n\t};\n\trequest.send(null);\n}","title":""},{"docid":"9aa83ab41ed5aebf14450a64a045d2c3","score":"0.49303198","text":"function extendCompletedSPChart(dataSet) {\r\n var count = dataSet.length;\r\n\r\n //next date\r\n var nextDate = new Date().getTime();\r\n\r\n dataSet.push({ x: nextDate, y: dataSet[count - 1].y });\r\n}","title":""},{"docid":"79e30d0f574bd71a00343fb834a3a57d","score":"0.49267483","text":"function modifyJSON(data) {\n let polished = alpha.util.polish(data).data;\n for (curr in polished) {\n delete polished[curr].market_open;\n delete polished[curr].market_high;\n delete polished[curr].market_low;\n delete polished[curr].market_close;\n delete polished[curr].cap;\n }\n let str = JSON.stringify(polished);\n str = str.replace(\"\\\"usd_open\\\":\", \"\\\"open\\\":\");\n str = str.replace(\"\\\"usd_high\\\":\", \"\\\"high\\\":\");\n str = str.replace(\"\\\"usd_low\\\":\", \"\\\"low\\\":\");\n str = str.replace(\"\\\"usd_close\\\":\", \"\\\"close\\\":\");\n polished = JSON.parse(str);\n return polished;\n}","title":""},{"docid":"7eb5e03bc41e1edc6240d8367de20989","score":"0.49253213","text":"function json_to_laps(json, xObject) { \n var laps = [];\n var time_x0 = 0, distance_x0 = 0;\n for (var i = 0, n = json.laps.length; i < n; i++) { \n var lap = {\n time: { \n x0: time_x0,\n width: time.value(json.laps[i]) - time_x0\n },\n distance: { \n x0: distance_x0,\n width: distance.value(json.laps[i]) - distance_x0\n }\n };\n time_x0 = time_x0 + lap.time.width; \n distance_x0 = distance_x0 + lap.distance.width; \n // alert (lap.x0 + \" \" + lap.x1);\n laps.push(lap);\n }\n return laps;\n}","title":""},{"docid":"364f9f486c1ef9ceeaaa9c56695e2cfc","score":"0.49251643","text":"function reformatData(obj) {\n var dataDict = {};\n for (var repo in obj['data']) {\n if (obj['data'].hasOwnProperty(repo)) {\n var repoDict = obj['data'][repo],\n issuesClosed = repoDict['issues_Closed']['totalCount'],\n issuesOpen = repoDict['issues_Open']['totalCount'],\n doubleKey = [issuesClosed, issuesOpen];\n if (!Object.keys(dataDict).contains(doubleKey)) {\n dataDict[doubleKey] = [];\n }\n dataDict[doubleKey].push(repo);\n }\n }\n var data = [];\n for (var doubleKey in dataDict) {\n if (dataDict.hasOwnProperty(doubleKey)) {\n var numbers = doubleKey.split(',');\n var dataset = {\n names: dataDict[doubleKey].sort(),\n valueX: +numbers[0], // issues closed\n valueY: +numbers[1] // issues open\n };\n data.push(dataset);\n }\n }\n return data;\n }","title":""},{"docid":"781f02ac87d335bcd5bb4c7a42ae2fcd","score":"0.49177715","text":"getHistoricalSensorData(num) {\n fetch(serverAddress + `/historical-sensor-data?quantity=${encodeURIComponent(num)}`)\n .then(rawData => rawData.json())\n .then(objData => objData.data)\n .then(arrData => arrData.map(item => JSON.parse(item)).reverse()) \n .then(finalData => this.setState({ historicalSensorData: finalData }))\n }","title":""},{"docid":"b896fae7ea27f3bbe7a30814726cdb2a","score":"0.49157742","text":"function parseData(json){\n\n var blockData = [];\n\n $.each(json.data, function(key1, item) {\n blockData.push({\"height\": item.height, \"block_time\": item.block_time});\n });\n\n evalTime(blockData);\n}","title":""},{"docid":"5228305dbeb8ed1a82775622b21be11f","score":"0.4901937","text":"function genRow(data) {\n\t\t\tif (typeof(data[4]) === \"string\" && data[4].indexOf(\"{\") > -1) {\n\t\t\tvar tmp = $.parseJSON(data[4]);\n\t\t\tdata[4] = tmp.oldStatus;\n\t\t\tdata[5] = null;\n\t\t\t}\n\t\t\treturn data;\n\t\t}","title":""},{"docid":"c51662dd576661da7e0550f5522fd5ac","score":"0.48934305","text":"function flipy(grid) {\n\tlet data = JSON.parse(JSON.stringify(grid));\n\tdata.body.reverse();\n\treturn data;\n}","title":""},{"docid":"c357c9a870f9a0ecad4f8ed877e56e90","score":"0.48925528","text":"function callback(result) {\n var data = result;\n console.log(data);\n API_data =[\n {\n name: 'Alex',\n data: [\n [Date.UTC(2011, 1, 1), 8],\n [Date.UTC(2011, 2, 1), 9],\n [Date.UTC(2011, 3, 1), 10],\n [Date.UTC(2011, 4, 1), 10],\n [Date.UTC(2011, 5, 1), 8],\n [Date.UTC(2011, 6, 1), 7],\n [Date.UTC(2011, 7, 1), 6],\n [Date.UTC(2011, 8, 1), 7],\n [Date.UTC(2011, 9, 1), 5],\n [Date.UTC(2011, 10, 1), 4],\n [Date.UTC(2011, 11, 1), 4]\n ]},\n {\n name: \"Sally\",\n data: [\n [Date.UTC(2011, 1, 1), 1],\n [Date.UTC(2011, 2, 1), 3],\n [Date.UTC(2011, 3, 1), 1],\n [Date.UTC(2011, 4, 1), 1],\n [Date.UTC(2011, 5, 1), 1],\n [Date.UTC(2011, 6, 1), 4],\n [Date.UTC(2011, 7, 1), 3],\n [Date.UTC(2011, 8, 1), 6],\n [Date.UTC(2011, 9, 1), 7],\n [Date.UTC(2011, 10, 1), 7],\n [Date.UTC(2011, 11, 1), 8]\n ]},\n {\n name: \"Erin\",\n data: [\n [Date.UTC(2011, 1, 1), 3],\n [Date.UTC(2011, 2, 1), 2],\n [Date.UTC(2011, 3, 1), 3],\n [Date.UTC(2011, 4, 1), 4],\n [Date.UTC(2011, 5, 1), 5],\n [Date.UTC(2011, 6, 1), 7],\n [Date.UTC(2011, 7, 1), 8],\n [Date.UTC(2011, 8, 1), 6],\n [Date.UTC(2011, 9, 1), 6],\n [Date.UTC(2011, 10, 1), 6],\n [Date.UTC(2011, 11, 1), 7]\n ]}\n ]\n\n\n\n Highcharts.chart('container', {\n credits: {\n enabled: false\n },\n\n exporting: {\n enabled: false\n },\n\n subtitle: {\n text: 'Year 2017'\n },\n\n\n title: {\n text: 'My Group Netflix Usage'\n },\n\n subtitle: {\n text: 'Year 2017'\n },\n\n yAxis: {\n title: {\n text: 'Hours of Netflix Usage'\n }\n },\n xAxis: {\n type: 'datetime',\n tickInterval: 30 * 24 * 3600 * 1000,\n min: Date.UTC(2011, 1, 1),\n max: Date.UTC(2011, 12, 1),\n labels: {\n rotation: 45,\n step: 1,\n style: {\n fontSize: '13px',\n fontFamily: 'Arial,sans-serif'\n }\n },\n dateTimeLabelFormats: { // don't display the dummy year\n month: '%b \\'%y',\n year: '%Y'\n }\n },\n legend: {\n layout: 'vertical',\n align: 'right',\n verticalAlign: 'middle'\n },\n\n plotOptions: {\n series: {\n label: {\n connectorAllowed: false\n },\n pointStart: 2010\n }\n },\n\n series: API_data,\n\n\n responsive: {\n rules: [{\n condition: {\n maxWidth: 500\n },\n chartOptions: {\n legend: {\n layout: 'horizontal',\n align: 'center',\n verticalAlign: 'bottom'\n }\n }\n }]\n }\n\n });\n}","title":""},{"docid":"2c41eba585baac41fb4ddd5b4ee5e8c8","score":"0.48900074","text":"static rearrangeData(data, keyName) {\n let array = [...data];\n array = array\n .sort((a, b) => a[keyName] - b[keyName])\n .filter(record => record[keyName] !== 0);\n\n const result = [];\n\n while (array.length) {\n result.push(array[array.length - 1]);\n array.pop();\n\n if (array.length) {\n result.push(array[0]);\n array.shift();\n }\n }\n\n return result;\n }","title":""},{"docid":"f11e7188e56b0f4db66938bc8ce43b6a","score":"0.48860875","text":"function parseDataFromGitHub (response) {\n return JSON.parse(response)\n .reduce(function(res, elem) {\n var parsed = elem.name.split('.')[0].split('-');\n var title = parsed.splice(3).join(' ');\n var date = {\n year: parsed[0],\n month: parsed[1],\n day: parsed[2]\n };\n\n elem.title = title;\n elem.date = date;\n\n res.push(elem);\n return res;\n }, [])\n .filter(function (elem) {\n return elem.title.length > 0;\n })\n .reverse();\n }","title":""},{"docid":"86ddf0290a45950f56ac589bf6376e16","score":"0.48792696","text":"timelineData(){\n return {\n content: this.name,\n start: this.start,\n end: this.end\n }\n }","title":""},{"docid":"7e732e0d6fa3d690a63b83944ea996d6","score":"0.48783526","text":"static latestTime(data) {\n return data.length && data.filter(clear).length ?\n first(data.filter(clear).map(v => new Date(v)).sort((a, b) => new Date().setHours(b.getHours(), b.getMinutes(), b.getSeconds()) -\n new Date().setHours(a.getHours(), a.getMinutes(), a.getSeconds()))) : undefined;\n }","title":""},{"docid":"0d62228736aafda472da12c177454fba","score":"0.48738995","text":"_shiftItems(index) {\n for (let i = index; i < this.length - 1; i++) {\n this.data[i] = this.data[i + 1];\n }\n // delete the last item and decrease the length.\n delete this.data[this.length - 1];\n this.length--;\n }","title":""},{"docid":"69cae8d35af436d740744de1820690be","score":"0.48522097","text":"displayReverse() {\r\n let current = this.tail;\r\n console.log(current.data);\r\n while (current !== this.head) {\r\n current = current.prev;\r\n console.log(current.data);\r\n }\r\n }","title":""},{"docid":"5a4114804787530d1d53e30797b2c1ad","score":"0.48520094","text":"unnestData(data) {\n let unnestedData = [];\n for (let [target, sourcePosts] of Object.entries(data)) {\n for (let key in sourcePosts) {\n let post = Object.assign({}, sourcePosts[key]);\n post.SOURCE_SUBREDDIT = target;\n unnestedData.push(post);\n }\n }\n return unnestedData;\n }","title":""},{"docid":"cdb53667c25fbb41c316d1a27df194cc","score":"0.48515603","text":"function prepareNestedDataFromJson(data) {\n\n for (let currentKey in data) {\n\n if (data[currentKey] !== null) {\n\n if (typeof (data[currentKey]) === \"object\") {\n\n if (parent === \"trajectory-data\") {\n currentTime = currentKey;\n if (!timeSteps.includes(currentKey)) {\n timeSteps.push(parseFloat(currentKey));\n nestedData.set(currentKey, d3.map());\n vesicleStates.set(currentKey, d3.map());\n }\n }\n\n if (parent === \"data\") {\n currentNode = currentKey;\n\n if (!nodeIdentifiers.includes(currentKey)) {\n nodeIdentifiers.push(currentKey)\n\n }\n nestedData.get(currentTime).set(currentNode, d3.map())\n\n }\n\n if (parent === \"subsections\") {\n currentCompartment = currentKey;\n if (!compartmentIdentifiers.includes(currentKey)) {\n compartmentIdentifiers.push(currentKey);\n\n }\n if (nestedData.get(currentTime).get(currentNode) !== undefined) {\n nestedData.get(currentTime).get(currentNode).set(currentCompartment, d3.map())\n }\n }\n\n if (currentKey === \"positions\") {\n if (nestedData.get(currentTime).get(currentNode) !== undefined) {\n nestedData.get(currentTime).get(currentNode).get(currentCompartment).set(currentKey, data[currentKey]);\n }\n }\n const grandparent = parent;\n parent = currentKey;\n prepareNestedDataFromJson(data[currentKey]);\n parent = grandparent;\n\n } else {\n\n if (parent === \"concentrations\") {\n currentSpecies = currentKey;\n if (!speciesIdentifiers.includes(currentKey)) {\n speciesIdentifiers.push(currentKey);\n }\n if (nestedData.get(currentTime).get(currentNode) !== undefined) {\n nestedData.get(currentTime).get(currentNode).get(currentCompartment).set(currentKey, data[currentKey]);\n\n }\n\n }\n\n if (currentKey === \"state\") {\n vesicleStates.get(currentTime).set(currentNode, data[currentKey]);\n }\n\n if (currentKey === \"timeSteps-unit\") {\n timeUnit = data[currentKey];\n } else if (currentKey === \"concentration-unit\") {\n concentrationUnit = data[currentKey]\n } else if (currentKey === \"simulation-width\") {\n simulationWidth = data[currentKey]\n } else if (currentKey === \"simulation-height\") {\n simulationHeight = data[currentKey]\n }\n\n }\n }\n }\n}","title":""}],"string":"[\n {\n \"docid\": \"a55b3401d992ed51b96a346abcc16a49\",\n \"score\": \"0.60497373\",\n \"text\": \"function timelineData() {\\n var array = [];\\n var date = results[0] ? new Date(results[0].values[0].timestamp): new Date();\\n for (var i = 0; i < 7; i++) {\\n array.push({value:date, tooltip:{showContent: false}});\\n date = new Date(date.getTime() + 86400000);\\n }\\n for (var i = 2; i < weeks.length-1; i++) {\\n var date = new Date(results[i].values[0].timestamp);\\n\\n array.push({value:date, tooltip:{showContent: false}});\\n if (i == weeks.length-1) {\\n //** use last item temporarily, might not be the latest time\\n var last = results[i].values.length-1\\n console.log(last);\\n console.log(results[i].values[last])\\n var date = new Date(results[i].values[last].timestamp);\\n\\n array.push({value:date, tooltip:{showContent: false}});\\n }\\n }\\n //console.log(array)\\n return array;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffd03265bb295757c83bfe8686430d73\",\n \"score\": \"0.58610046\",\n \"text\": \"cleanJSON(json) {\\n let cleanJSONData = {\\n timestampdate: [],\\n close: [],\\n open: [],\\n low: [],\\n high: [],\\n };\\n\\n let rawDate = []\\n\\n json.forEach(stockData => {\\n rawDate.push(new Date(stockData.timestamp))\\n cleanJSONData.timestampdate.push(new Date(stockData.timestamp).toLocaleDateString())\\n cleanJSONData.low.push(stockData.low);\\n cleanJSONData.high.push(stockData.high);\\n cleanJSONData.open.push(stockData.open);\\n cleanJSONData.close.push(stockData.close);\\n })\\n\\n cleanJSONData.timestampdate.reverse()\\n cleanJSONData.close.reverse()\\n cleanJSONData.open.reverse()\\n cleanJSONData.low.reverse()\\n cleanJSONData.high.reverse()\\n\\n // Set the min and max dates\\n if (this.state.firstFetch) {\\n this.setState(({\\n from: new Date(Math.min.apply(null,rawDate)).toISOString().slice(0,10).split(\\\"-\\\").reverse().join(\\\"/\\\"),\\n to: new Date(Math.max.apply(null,rawDate)).toISOString().slice(0,10).split(\\\"-\\\").reverse().join(\\\"/\\\"),\\n dateMin: new Date(Math.min.apply(null,rawDate)).toISOString().slice(0,10).split(\\\"-\\\").reverse().join(\\\"/\\\"),\\n dateMax: new Date(Math.max.apply(null,rawDate)).toISOString().slice(0,10).split(\\\"-\\\").reverse().join(\\\"/\\\"),\\n firstFetch: false\\n }))\\n }\\n\\n return cleanJSONData\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80b6ccbcc7c7b104e88b85f9e876791f\",\n \"score\": \"0.5829011\",\n \"text\": \"function getNewList(){\\r\\n\\tvar newJson = _.uniqBy(cloneJson_data, 'subject_id');\\r\\n\\tvar newL = newJson.length - 1\\r\\n\\tvar newElement;\\r\\n\\tif (newL < 10){len = newL+1} else {len=10};\\r\\n\\tfor (i = 0; i < len; i++) {\\r\\n\\t\\tvar recentSubject = newJson[i];\\r\\n\\t\\tsubject = recentSubject.subject_id;\\r\\n\\t\\tloc=recentSubject.location;\\r\\n\\t\\tsession=recentSubject.subject_session;\\r\\n\\t\\tsubsession=recentSubject.subject_subsession;\\r\\n\\t\\tscore=recentSubject.score;\\r\\n\\t\\tdate=moment(recentSubject.end_time).format(\\\"L\\\");\\r\\n\\t\\ttime=[moment(recentSubject.start_time).format(\\\"hh:mm\\\"),moment(recentSubject.end_time).format(\\\"hh:mma\\\")];\\r\\n\\t\\tnewElement += [\\r\\n\\t\\t\\t'<div class=\\\"feed-element\\\">',\\r\\n\\t\\t\\t\\t'<a class=\\\"pull-left\\\">',\\r\\n\\t\\t\\t\\t\\t'<div alt=\\\"image\\\" class=\\\"location-color-'+loc+'\\\"></div>',\\r\\n\\t\\t\\t\\t'</a>',\\r\\n\\t\\t\\t\\t'<div class=\\\"media-body\\\">',\\r\\n\\t\\t\\t\\t\\t'<small class=\\\"pull-right\\\">'+moment(recentSubject.end_time).fromNow()+'</small>',\\r\\n\\t\\t\\t\\t\\t'<strong>'+subject+'</strong> completed session <strong>'+session+'-'+subsession+'</strong> at '+loc+', scoring <strong>'+score+'</strong> points.<br>',\\r\\n\\t\\t\\t\\t\\t'<small class=\\\"text-muted\\\">'+time[0]+' - '+time[1]+'</small>',\\r\\n\\t\\t\\t\\t'</div>',\\r\\n\\t\\t\\t'</div>'\\r\\n\\t\\t].join('');\\r\\n\\t}\\r\\n\\t$('#new-subject-container').html(newElement.replace('undefined',''))//most recent subject on top bar\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"293c5e177dd1f41043899e58bd4d9585\",\n \"score\": \"0.5820765\",\n \"text\": \"function newJsonData(data) {\\r\\n 'use strict';\\r\\n var seriesName,\\r\\n seriesID,\\r\\n embargoDate;\\r\\n\\r\\n data.Release[0].DataSet.forEach(function(dataSet) {\\r\\n dataSet.Series.forEach(function(series) {\\r\\n seriesName = series.Attributes.SERIES_NAME;\\r\\n embargoDate = series.EmbargoDate;\\r\\n seriesID = (seriesName + ' ' + getShortDate(embargoDate));\\r\\n for (var i = _series.length - 1; i >= 0; i--) {\\r\\n if (_series[i].id === seriesID) {\\r\\n var newSeries = {};\\r\\n newSeries.id = seriesID;\\r\\n\\r\\n loadObservations(series.Observations, newSeries, false);\\r\\n if (newSeries.minDate.getTime() < _minDate.getTime()) {\\r\\n _minDate = newSeries.minDate;\\r\\n startPicker.min(_minDate);\\r\\n }\\r\\n if (newSeries.maxDate > _maxDate) {\\r\\n _maxDate = newSeries.maxDate;\\r\\n endPicker.max(_maxDate);\\r\\n }\\r\\n _series[i].observations = newSeries.observations;\\r\\n _series[i].color = _seriesColor.shift();\\r\\n _series[i].minDate = newSeries.minDate;\\r\\n _series[i].maxDate = newSeries.maxDate;\\r\\n\\r\\n if (numUnits < 2 && !unitExists(_series[i].units + _series[i].unitMult)) {\\r\\n numUnits++;\\r\\n var axisType = {\\r\\n lineType: 'dashed',\\r\\n label: _series[i].units + _series[i].unitMult\\r\\n };\\r\\n if (_series[i].format !== null) {\\r\\n axisType.format = _series[i].format;\\r\\n }\\r\\n if (_axes[0].lineType === 'dashed') {\\r\\n axisType.lineType = 'straight';\\r\\n _axes.unshift(axisType);\\r\\n chart.options.valueAxis[0].visible = true;\\r\\n\\r\\n } else {\\r\\n chart.options.valueAxis[1].visible = true;\\r\\n _axes.push(axisType);\\r\\n }\\r\\n }\\r\\n if ((numUnits === 2 && (_series[i].units + _series[i].unitMult) === _axes[1].label) || ((_series[i].units + _series[i].unitMult) === _axes[0].label && _axes[0].lineType === 'dashed')) {\\r\\n _series[i].lineType = 'dashed';\\r\\n }\\r\\n for (var h = _series[i].observations.length - 1; h >= 0; h--) {\\r\\n _rawData.options.data.push(_series[i].observations[h]);\\r\\n }\\r\\n _rawData.read();\\r\\n _plotSeriesCollection.push(_series[i]);\\r\\n setColor();\\r\\n setSeriesType();\\r\\n if ($('#LogScale').prop('checked')) {\\r\\n for (var j = chart.options.series.length - 1; j >= 0; j--) {\\r\\n chart.options.series[j].field = 'log';\\r\\n }\\r\\n }\\r\\n _series.splice(i, 1);\\r\\n }\\r\\n }\\r\\n });\\r\\n });\\r\\n $('#listView').data('kendoListView').dataSource.data(_series);\\r\\n $('#legendView').data('kendoListView').dataSource.data(_plotSeriesCollection);\\r\\n chart.redraw();\\r\\n initChartNav();\\r\\n hideProgressAnimation();\\r\\n if (!navVisible) {\\r\\n $('svg g [x=-24]').attr('x', 80);\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6cda1a73924d0ae2a608251144dc541b\",\n \"score\": \"0.56779015\",\n \"text\": \"function fillTimeline(){\\r\\n let timeline = groupTimelineById();\\r\\n \\r\\n ditoJson.events.forEach((element) => {\\r\\n let transId;\\r\\n \\r\\n element.custom_data.forEach((key) => {\\r\\n if(key.key === 'transaction_id') {\\r\\n transId = key.value;\\r\\n }\\r\\n });\\r\\n\\r\\n timeline.forEach((timelineElement) => {\\r\\n if(timelineElement.transaction_id === transId) {\\r\\n if(element.event === 'comprou') {\\r\\n timelineElement.revenue = element.revenue;\\r\\n \\r\\n element.custom_data.forEach((key) => {\\r\\n if(key.key === 'store_name') {\\r\\n timelineElement.store_name = key.value;\\r\\n }\\r\\n });\\r\\n }\\r\\n \\r\\n if(element.event === 'comprou-produto') {\\r\\n let obj = { name: '', price: '' };\\r\\n\\r\\n element.custom_data.forEach((key) => {\\r\\n if(key.key === 'product_name') obj.name = key.value;\\r\\n if(key.key === 'product_price') obj.price = key.value;\\r\\n });\\r\\n\\r\\n timelineElement.products.push(obj);\\r\\n }\\r\\n }\\r\\n });\\r\\n });\\r\\n\\r\\n sortTimeline(timeline);\\r\\n\\r\\n return timeline;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecc1979f0c763797d74159986ad8be99\",\n \"score\": \"0.5671591\",\n \"text\": \"function cloneJSON(json) {\\n return JSON.parse(JSON.stringify(json));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72606b4c1f62591a20281ce23a549ee6\",\n \"score\": \"0.5644603\",\n \"text\": \"reverse() {\\n var copy = this._data.map(function (item) {\\n return item;\\n });\\n copy.reverse();\\n\\n var that = this;\\n copy.forEach(function (value, index) {\\n if (value !== that._data[index]) {\\n that[index] = value;\\n }\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14b80af7021b2074396c59c0a37a3dfd\",\n \"score\": \"0.5642831\",\n \"text\": \"cloneData(data) {\\n const results = [];\\n for (const item of data) {\\n const copy = {\\n name: item['name']\\n };\\n if (item['value'] !== undefined) {\\n copy['value'] = item['value'];\\n }\\n if (item['series'] !== undefined) {\\n copy['series'] = [];\\n for (const seriesItem of item['series']) {\\n const seriesItemCopy = Object.assign({}, seriesItem);\\n copy['series'].push(seriesItemCopy);\\n }\\n }\\n if (item['extra'] !== undefined) {\\n copy['extra'] = JSON.parse(JSON.stringify(item['extra']));\\n }\\n results.push(copy);\\n }\\n return results;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14b80af7021b2074396c59c0a37a3dfd\",\n \"score\": \"0.5642831\",\n \"text\": \"cloneData(data) {\\n const results = [];\\n for (const item of data) {\\n const copy = {\\n name: item['name']\\n };\\n if (item['value'] !== undefined) {\\n copy['value'] = item['value'];\\n }\\n if (item['series'] !== undefined) {\\n copy['series'] = [];\\n for (const seriesItem of item['series']) {\\n const seriesItemCopy = Object.assign({}, seriesItem);\\n copy['series'].push(seriesItemCopy);\\n }\\n }\\n if (item['extra'] !== undefined) {\\n copy['extra'] = JSON.parse(JSON.stringify(item['extra']));\\n }\\n results.push(copy);\\n }\\n return results;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14b80af7021b2074396c59c0a37a3dfd\",\n \"score\": \"0.5642831\",\n \"text\": \"cloneData(data) {\\n const results = [];\\n for (const item of data) {\\n const copy = {\\n name: item['name']\\n };\\n if (item['value'] !== undefined) {\\n copy['value'] = item['value'];\\n }\\n if (item['series'] !== undefined) {\\n copy['series'] = [];\\n for (const seriesItem of item['series']) {\\n const seriesItemCopy = Object.assign({}, seriesItem);\\n copy['series'].push(seriesItemCopy);\\n }\\n }\\n if (item['extra'] !== undefined) {\\n copy['extra'] = JSON.parse(JSON.stringify(item['extra']));\\n }\\n results.push(copy);\\n }\\n return results;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14b80af7021b2074396c59c0a37a3dfd\",\n \"score\": \"0.5642831\",\n \"text\": \"cloneData(data) {\\n const results = [];\\n for (const item of data) {\\n const copy = {\\n name: item['name']\\n };\\n if (item['value'] !== undefined) {\\n copy['value'] = item['value'];\\n }\\n if (item['series'] !== undefined) {\\n copy['series'] = [];\\n for (const seriesItem of item['series']) {\\n const seriesItemCopy = Object.assign({}, seriesItem);\\n copy['series'].push(seriesItemCopy);\\n }\\n }\\n if (item['extra'] !== undefined) {\\n copy['extra'] = JSON.parse(JSON.stringify(item['extra']));\\n }\\n results.push(copy);\\n }\\n return results;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6b0138521f62f4edd8bd7c0c4ddae91\",\n \"score\": \"0.56272763\",\n \"text\": \"function cloneData(data){\\n return JSON.parse(JSON.stringify(data));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a091f35122757f0ae5cc7f7c585e59dd\",\n \"score\": \"0.5576152\",\n \"text\": \"function cloneIncomingData(data) {\\n let forkliftSpeed = data.maxForkliftSpeed;\\n let vertices = [];\\n for (let verticeKey in data[\\\"graph\\\"][\\\"vertices\\\"]) {\\n let adjacentVertexIds = [];\\n for (let adjacentVertexKey in data[\\\"graph\\\"][\\\"vertices\\\"][verticeKey][\\\"adjacentVertexIds\\\"]) {\\n adjacentVertexIds.push(data[\\\"graph\\\"][\\\"vertices\\\"][verticeKey][\\\"adjacentVertexIds\\\"][adjacentVertexKey]);\\n }\\n let scheduleItems = [];\\n for (let scheduleItemsKey in data[\\\"graph\\\"][\\\"vertices\\\"][verticeKey][\\\"scheduleItems\\\"])\\n position.push(data[\\\"graph\\\"][\\\"vertices\\\"][verticeKey][\\\"scheduleItems\\\"][scheduleItemsKey]);\\n vertices.push({\\n adjacentVertexIds: adjacentVertexIds,\\n id: data[\\\"graph\\\"][\\\"vertices\\\"][verticeKey][\\\"id\\\"],\\n isVisited: data[\\\"graph\\\"][\\\"vertices\\\"][verticeKey][\\\"isVisited\\\"],\\n label: data[\\\"graph\\\"][\\\"vertices\\\"][verticeKey][\\\"label\\\"],\\n position: {\\n x: data[\\\"graph\\\"][\\\"vertices\\\"][verticeKey][\\\"position\\\"][\\\"x\\\"],\\n y: data[\\\"graph\\\"][\\\"vertices\\\"][verticeKey][\\\"position\\\"][\\\"y\\\"]\\n\\n },\\n previousVertex: data[\\\"graph\\\"][\\\"vertices\\\"][verticeKey][\\\"previousVertex\\\"],\\n scheduleItems: scheduleItems\\n })\\n }\\n let newData = {\\n\\n graph: {\\n vertices: vertices\\n },\\n forkliftSpeed: forkliftSpeed\\n };\\n return newData;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bceb9f9a9b2708639538f3eceaeefcad\",\n \"score\": \"0.55543196\",\n \"text\": \"function getLineData(data){\\n\\n // process fetched data\\n var items = data.Items; //get all the items\\n var labelArr = [];\\n var dataArr = [];\\n var prev = getTime(currentDate + SPACE + items[0].time);\\n var labelPath = [];\\n var dataPath = [];\\n for(var i = 0; i < data.Count; ++i){\\n var curTime = getTime(currentDate + SPACE + items[i].time);\\n if(curTime - prev < 12000){ // difference between two times is within 4 seconds\\n labelPath.push(items[i].time);\\n dataPath.push(items[i].speed);\\n prev = curTime;\\n continue;\\n }\\n // if the difference between curTime and prevTime is greater than 4 seconds, push the previous label and data path\\n labelArr.push($.extend(true,[], labelPath));\\n dataArr.push($.extend(true, [], dataPath));\\n labelPath = [];\\n dataPath = [];\\n prev = curTime;\\n i--;\\n }\\n if(labelPath.length > 0 && dataPath.length > 0){ //push the last time bucket\\n labelArr.push($.extend(true,[], labelPath));\\n dataArr.push($.extend(true, [], dataPath));\\n }\\n\\n var result = [];\\n result.push(labelArr);\\n result.push(dataArr);\\n return result;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39e14bb328715a93c41d1a5f9b59777f\",\n \"score\": \"0.55276084\",\n \"text\": \"function copyJson(old) {\\r\\n return JSON.parse(JSON.stringify(old));\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fda286adcf4ad4705e0c2f20f910dad3\",\n \"score\": \"0.5504296\",\n \"text\": \"function cloneData(data) {\\n return data;\\n //return JSON.parse(JSON.stringify(data));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fda286adcf4ad4705e0c2f20f910dad3\",\n \"score\": \"0.5504296\",\n \"text\": \"function cloneData(data) {\\n return data;\\n //return JSON.parse(JSON.stringify(data));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cffa8ddad0aa2887a830df734b3cec17\",\n \"score\": \"0.55000466\",\n \"text\": \"function breakdownJsonData(newData) {\\n\\t/*\\n\\t * For..in (loop) will move over all items in the JSON array.\\n\\t * The loop begins by assigning each new held asteroid value in the list to a new variable.\\n\\t * The newAsteroid is an object that is parsed for mass, id, and year.\\n\\t */\\n\\tfor (var asteroid in newData) {\\n\\n\\t\\t// Assign each held object in the list to a new variable called 'newAsteroid'\\n\\t\\tlet newAsteroid = newData[asteroid];\\n\\n\\t\\t// Get the mass and id for storing into array as key-value pairs.\\n\\t\\tlet asteroidId = newAsteroid[\\\"id\\\"];\\n\\t\\tlet asteroidMass = newAsteroid[\\\"mass\\\"];\\n\\t\\tlet updatedAsteroidYear = newAsteroid[\\\"year\\\"]; // Unformatted (Raw)\\n\\n\\t\\t// Basic null handling.\\n\\t\\t// On condition that the mass is provided in the data, then add the asteroidId as\\n\\t\\t// the index marker for the asteroidMass value.\\n\\t\\tif (asteroidMass != null && updatedAsteroidYear != null) {\\n\\t\\t\\t// asteroidCount++;\\n\\t\\t\\tasteroidYears.push(updatedAsteroidYear);\\n\\t\\t\\tasteroidComparables[asteroidId] = asteroidMass;\\n\\t\\t}\\n\\t}\\n\\t// Add data set of comparable data to array\\n\\t// which leaves a 973 item array that contains\\n\\t// an index and corresponding ID.\\n\\tasteroids = Object.keys(asteroidComparables);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a710614b642fdf58790d9cf17640541\",\n \"score\": \"0.54986125\",\n \"text\": \"_createFullJSON() {\\n\\n var self = this;\\n\\n var fullDataReady = $.Deferred();\\n var dataToGet = new Set();\\n\\n // we start by fetching the initial dataUrl from the HTML\\n var getData = self._fetch(self.options.dataUrl);\\n\\n // once the data is here.....\\n getData.done((data) => {\\n\\n self.data = data;\\n\\n // go through the data and pull out and JSON we need to retrieve and make a set of values\\n dataToGet = self._recursiveSearch(self.data, self.options.dataKey, dataToGet);\\n\\n // go through the data set, ajax in the actual JSON and refull\\n recursiveGet(dataToGet);\\n\\n });\\n\\n function recursiveGet(dataToGet) {\\n\\n // if we enter here and there is no data, maybe it was a super simple JSON with no dataURLs, we just resolve\\n if (dataToGet.size === 0) {\\n fullDataReady.resolve();\\n return;\\n }\\n\\n // we find out how many items we have to get\\n var size = dataToGet.size;\\n\\n // go through the data we found\\n dataToGet.forEach((value) => {\\n\\n // get the JSON \\n var getData = self._fetch(value);\\n\\n // once we are done, we replace the _dataUrl entry in the JSON with the actual data to \\n // create a nice and pretty JSON object\\n getData.done((data) => {\\n\\n self.data = self._replaceUrlWithData(self.data, self.options.dataKey, value, data);\\n\\n // we remove the item we just got out of our list\\n dataToGet.delete(value); \\n\\n // if this was the last one, and there is nothing to get....\\n if (dataToGet.size === 0) {\\n\\n // look through the \\\"new\\\" self.data and see if we now have any new _dataUrls\\n var matchesLeft = self._recursiveSearch(self.data, self.options.dataKey, dataToGet);\\n\\n // if we do, let's start this part over again and get those\\n if (matchesLeft.size > 0) {\\n recursiveGet(matchesLeft);\\n } else {\\n // if there are no left, we are finally done. Resolve\\n fullDataReady.resolve();\\n }\\n }\\n\\n });\\n\\n });\\n \\n }\\n\\n return fullDataReady;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87da892f11bdadcd7a19a562b97641f3\",\n \"score\": \"0.547979\",\n \"text\": \"function getDataBeforeTime(data, lastTime) {\\r\\n \\r\\n var reducedData = [];\\r\\n \\r\\n data.map(function(item) {\\r\\n \\r\\n if (item.timestamp > lastTime) {\\r\\n reducedData.push( item );\\r\\n }\\r\\n });\\r\\n\\r\\n return reducedData;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e31cde1df3cc42fe0b048f06305ebdbf\",\n \"score\": \"0.54684454\",\n \"text\": \"function fixUpData(json) {\\n var data = json.map(j => j);\\n data.push({ age: d3.max(json, d => d.age), males: 0, females: 0, total: 0 });\\n data.push({ age: d3.min(json, d => d.age), males: 0, females: 0, total: 0 });\\n return data;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd1fdd26528e184fd521ef07cd405063\",\n \"score\": \"0.54402566\",\n \"text\": \"static latest(data) {\\n return data.length && data.filter(clear).length ?\\n first(data.filter(clear).sort((a, b) => new Date(b).valueOf() - new Date(a).valueOf())) : undefined;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d501babd49960eb20fcc47697c8b95f\",\n \"score\": \"0.54316056\",\n \"text\": \"function simplifyJSON (data){\\n var gls = data.skybitz.gls;\\n gls.forEach(element => {\\n if (element.landmark){\\n var location = {\\n name: element.landmark.geoname,\\n city: element.landmark.city, \\n latitude: element.latitude, \\n longitude: element.longitude, \\n time: new Date (element.time)\\n };\\n\\n stops.push(location);\\n // if (!landmarks[location.city]){\\n // stops.push(location);\\n // landmarks[location.city] = location.city;\\n // }\\n }\\n });\\n stops.sort(compare);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3fcb1eeaadb914275e912ee93571624\",\n \"score\": \"0.5431354\",\n \"text\": \"function cleanupData(){\\n for(var i = 0; i < rawData.length; i++){\\n var item = rawData[i];\\n\\n // Only include role models who have explicitly approved entering their data\\n if(item[\\\"approval\\\"] == \\\"Approved\\\"){\\n var newItem = {};\\n for(var k in item) {\\n var newKey = dataKeys[k];\\n newItem[newKey] = item[k];\\n }\\n\\n if(newItem[\\\"joined-date\\\"] == \\\"\\\") {\\n newItem[\\\"joined-date\\\"] = newItem[\\\"event-timestamp\\\"];\\n }\\n\\n newItem.id = i + 2;\\n newItem.visible = true; //visible by default - this is important for the Popup\\n data.push(newItem);\\n }\\n }\\n\\n data = data.sort(dateSort);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17d9ee5392c58e1cc84bb14f61d311b3\",\n \"score\": \"0.54174453\",\n \"text\": \"getPrevStandings(){\\n try{\\n let numChunk = Number( this.getCookie( `numChunk-${this.taskId}` ) );\\n let tmp = '';\\n for(let i=0; i<numChunk; i++){\\n let s = this.getCookie( `standings-${this.taskId}-${i}` );\\n tmp += s;\\n }\\n let json = decodeURIComponent( tmp );\\n let arr = JSON.parse( json );\\n let prev = {};\\n arr.forEach( e=>{\\n prev[ e[0] ] = e;\\n });\\n return prev;\\n }catch(e){\\n console.log(e);\\n return {};\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7adcd93421339994599a95e3f4ce142a\",\n \"score\": \"0.5410354\",\n \"text\": \"function populateHistory (json)\\n{\\n Brandwatch.stores.historyStore.removeAll ();\\n\\n for (var i = 0; i < json.brandData.days.length; i++)\\n {\\n //The date comes back in an odd format with dashes and is fixed manually.\\n var fixDate = json.brandData.days[i].date.replace (\\\"-\\\", \\\"/\\\");\\n fixDate = fixDate.replace (\\\"-\\\", \\\"/\\\");\\n fixDate = fixDate.split (\\\"T\\\")[0];\\n\\n var date = new Date (fixDate);\\n date = formatDate (date);\\n var mentionDate = new Date (fixDate);\\n var mentions = json.brandData.days[i].mentions;\\n var negDay = json.brandData.days[i].negative;\\n var posDay = json.brandData.days[i].positive;\\n var neuDay = json.brandData.days[i].neutral;\\n\\n Brandwatch.stores.historyStore.add ({'date':date, 'formatteddate':mentionDate, 'mentions':mentions, 'negative':negDay, 'positive':posDay, 'neutral':neuDay});\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a66e5301ba9cf2beffdd957df18e3c7\",\n \"score\": \"0.53994876\",\n \"text\": \"function mirror(data) {\\n const sort = data.slice().sort((a, b) => a - b);\\n return [...sort, ...sort.reverse().slice(1)];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"844f048b4e7fdfb380ad28e154462584\",\n \"score\": \"0.53960073\",\n \"text\": \"function prepareJsonData(json){\\r\\n\\r\\n\\t// check with the requests or job\\r\\n\\tif(json.type === TYPE.JOB){\\r\\n\\t\\tfor(let i = 0; i < json.data.length; i++){\\r\\n\\t\\t\\tfor(let k = 0; k < jobs.length; k++){\\r\\n\\t\\t\\t\\tif(json.data[i] === jobs[k][JOBS.ID]){\\r\\n\\t\\t\\t\\t\\tjson.data[i] = jobs.splice(k, 1)[0]; // remove the match (faster iteration) and keep it in cid_array\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}else{\\r\\n\\t\\tfor(let i = 0; i < json.data.length; i++){\\r\\n\\t\\t\\tfor(let k = 0; k < requests.length; k++){\\r\\n\\t\\t\\t\\tif(json.data[i] === requests[k][CLIENT.CID]){\\r\\n\\t\\t\\t\\t\\tjson.data[i] = requests.splice(k, 1)[0]; // remove the match (faster iteration) and keep it in cid_array\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51f0fe9d12a73e2a94f855cf0982321a\",\n \"score\": \"0.5372041\",\n \"text\": \"function importWellHistoryDto(data, parent) { return $.map(data || [], function (item) { return datacontext.createWellHistory(item, parent); }); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18e98652cbfc1c6f94b7f88da4e56c58\",\n \"score\": \"0.5355409\",\n \"text\": \"function _copyJSONObj (json) {\\n return JSON.parse( JSON.stringify(json) );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"697f4a677b3c7f2b73d4437e4f585dea\",\n \"score\": \"0.5351896\",\n \"text\": \"function transformJsonToGraphData(json) {\\n\\tnumberOfUtilities = json.utilities.length;\\n\\tcurrentYear = json.currYear;\\n\\tpreviousYear = json.prevYear;\\n\\n\\tconsole.log(\\\"Number of utilities is: \\\" + numberOfUtilities);\\n\\tconsole.log(\\\"Current year is: \\\" + currentYear);\\n\\tconsole.log(\\\"Prev year is: \\\" + previousYear);\\n\\t\\n\\tdata = [];\\n\\t\\n\\tfor (i = 0; i < numberOfUtilities; i++) {\\n\\t\\tutil = json.utilities[i];\\n\\n\\t\\tif (util.currMeasurement == null) continue;\\n\\n\\t\\tconsole.log(\\\"Consumable: \\\" + util.type + \\\" Year: \\\" + currentYear + \\\" Value: \\\" + util.currMeasurement);\\n\\t\\tdata.push({ \\\"Consumable\\\":util.type, \\\"Year\\\":currentYear, \\\"Value\\\": util.currMeasurement});\\n\\t\\tdata.push({ \\\"Consumable\\\":util.type, \\\"Year\\\":previousYear, \\\"Value\\\": util.prevMeasurement});\\n\\t}\\n\\t\\n\\tconsole.log(data);\\n\\t\\n\\treturn data;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba595686160627a779d5afa4ca55c168\",\n \"score\": \"0.5288941\",\n \"text\": \"function loadJson() {\\n historicalData = JSON.parse(fs.readFileSync(__dirname + '/data/' + exchange + '_' + pair + '_' + interval + '.json', 'utf8'));\\n main();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7d2000e78ecb5e6e166e4509308cecb\",\n \"score\": \"0.5288412\",\n \"text\": \"function createLines(json) {\\n var meta = json.meta;\\n var data = json.data;\\n\\n var newLines = [];\\n\\n for (var i=0; i < meta.lines.length; i++) {\\n // Get the tag\\n var lineTag = meta.lines[i].tag;\\n\\n newLines.push([]);\\n // Generate the list of data (month, measurement)\\n for (var j=0; j < data.length; j++) {\\n // Assumes data has a \\\"Month\\\" tag in each element\\n newLines[i].push([data[j][\\\"Month\\\"], data[j][lineTag]]);\\n }\\n }\\n return newLines;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"564b58d6f5bfc082a40ce783269a43aa\",\n \"score\": \"0.52828133\",\n \"text\": \"function parseJSONData(objs, row = []){\\r\\n for (var i in objs) {\\r\\n if(!objs[i].hasOwnProperty('sub')){\\r\\n \\r\\n row.push(objs[i].key)\\r\\n row.push(objs[i].descr)\\r\\n row.push(objs[i].src)\\r\\n row.push(objs[i].url)\\r\\n row.push(objs[i].coords)\\r\\n\\r\\n // get years for first row of array (push it after)\\r\\n for(y in objs[i].values){\\r\\n row.push(objs[i].values[y].val)\\r\\n if(jsonYears.indexOf(objs[i].values[y].year) === -1) \\r\\n jsonYears.push(objs[i].values[y].year)\\r\\n } \\r\\n\\r\\n if(arrayData.length){\\r\\n for (var j = 0; j < arrayData[0].length - row.length; j++) {\\r\\n row.unshift('')\\r\\n }\\r\\n }\\r\\n\\r\\n arrayData.push(row.splice(0))\\r\\n row.length = 0\\r\\n }\\r\\n\\r\\n if(objs[i].hasOwnProperty('sub')){\\r\\n row.push(objs[i].key)\\r\\n parseJSONData(objs[i].sub, row)\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7afb8b97dbbf372767c0bcd51e7f7e3\",\n \"score\": \"0.52764654\",\n \"text\": \"function pop(){\\n const tempRemove = Object.keys(json)[Object.keys(json).length-1];\\n delete json[tempRemove];\\n console.log(json);\\n document.getElementById(\\\"changed-text\\\").innerHTML = JSON.stringify(json);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41253d8c4e4e9e4588c0627c6bde7d86\",\n \"score\": \"0.5270185\",\n \"text\": \"function processSheetData(data, tabletop) {\\n // let prevjson = JSON.parse(fs.readFileSync('./RawData/VideoData.json'))\\n let prevjson = {\\\"cities\\\":{},\\\"totalVideos\\\":0}\\n // let prevTotalVideos = prevjson.totalVideos ? prevjson.totalVideos : 0;\\n //if (prevTotalVideos === data.length) {\\n // console.log(\\\"No New Videos\\\")\\n // return (prevjson)\\n //} else {\\n let lines = data\\n for (let i = 0; i < lines.length; i++) {\\n let currentline = lines[i];\\n if (prevjson.cities && prevjson.cities[currentline['City']]) {\\n prevjson.cities[currentline['City']].videos.push({\\n link: currentline['Link'],\\n caption: currentline['Caption'],\\n date: currentline['Date']\\n })\\n } else {\\n if (!prevjson.cities) {\\n prevjson.cities = {}\\n }\\n prevjson.cities[currentline['City']] = {\\n videos: [{\\n link: currentline['Link'],\\n caption: currentline['Caption'],\\n date: currentline['Date']\\n }],\\n coordinates: {\\n latitude: currentline['Latitude (°N)'],\\n longitude: currentline['Longitude (°E)']\\n }\\n }\\n }\\n }\\n prevjson.totalVideos = lines.length;\\n return (prevjson)\\n //}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a4fe54e24f67be056a900d23cc3a154\",\n \"score\": \"0.52607197\",\n \"text\": \"getSortedTimeline(statsData) {\\n let timelineSorted = [];\\n let timelineSettings = pathOr(null, ['timeline', 'settings'], statsData);\\n let timelineData = pathOr(null, ['timeline', 'data'], statsData);\\n if (timelineData && timelineSettings) {\\n for (let key of Object.keys(timelineData)) {\\n let entry = timelineData[key];\\n entry.tc = parseInt(key);\\n entry.ts = entry.tc * (timelineSettings.bucket_duration || 60000);\\n timelineSorted.push(entry);\\n }\\n }\\n // Sort it by timecode ascending\\n timelineSorted.sort(function(a, b) {\\n return a.tc - b.tc;\\n });\\n return timelineSorted;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e776380b376abadba9e964249820974\",\n \"score\": \"0.52212006\",\n \"text\": \"function parseJson() {\\n\\t\\tvar json;\\n\\t\\ttry {\\n\\t\\t\\tjson = JSON.parse(result.data);\\n\\t\\t} catch (excp) {\\n\\t\\t\\tthrow \\\"No json format: \\\" + excp;\\n\\t\\t}\\n\\t\\tresult.json = json.locations ? json : { locations: json };\\n\\n\\t\\tresult.times[2] = Date.now();\\n\\t\\tresult.times[1] = result.times[2] - result.times[1];\\n\\t\\tshowStatus(\\\"json: \\\" + result.times[1] + \\\"ms, json.locations.length=\\\" + result.json.locations.length);\\n\\t\\t\\n\\t\\t// check for google location.json layout\\n\\t\\tvar loc = result.json.locations;\\n\\t\\tif (loc && loc.length && \\\"timestampMs\\\" in loc[0] && \\\"latitudeE7\\\" in loc[0]) {\\n\\t\\t\\t// init dates obj\\n\\t\\t\\tresult.dates = {\\n\\t\\t\\t\\t// google is reverse order; avoid sec with fraction\\n\\t\\t\\t\\tminMillis: Math.floor(+loc[loc.length - 1].timestampMs / 1000) * 1000,\\n\\t\\t\\t\\tmaxMillis: Math.ceil(+loc[0].timestampMs / 1000) * 1000\\n\\t\\t\\t};\\n\\t\\t\\tresult.dates.startMillis = result.dates.minMillis;\\n\\t\\t\\tresult.dates.endMillis = result.dates.maxMillis;\\n\\n\\t\\t\\tsetSelected();\\n\\t\\t\\tshowStatus(\\\"location data\\\" +\\n\\t\\t\\t\\t\\\" from \\\" + result.dates.startDate + \\\" \\\" + result.dates.startTime +\\n\\t\\t\\t\\t\\\" to \\\" + result.dates.endDate + \\\" \\\" + result.dates.endTime);\\n\\t\\t} else {\\n\\t\\t\\tshowStatus(\\\"no location data found\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\t// chain to next step\\n\\t\\t//next(sliceTimes);\\n\\t\\tnext();\\t// done\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10a38bac664eb50e099ca90fad84cecb\",\n \"score\": \"0.5211868\",\n \"text\": \"deepClone(data) {\\n return JSON.parse(JSON.stringify(data));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5be2cfed6d8db94b26b572066be49fa9\",\n \"score\": \"0.5202415\",\n \"text\": \"function GetGraphData (callback) {\\r\\n \\r\\n $.getJSON('/api/series', function (data) {\\r\\n \\r\\n return callback(data.reverse());\\r\\n \\r\\n });\\r\\n \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af6b030bb50d1515b3d56d941fde6b3f\",\n \"score\": \"0.51961774\",\n \"text\": \"function setDataObject(dt) {\\n\\n var dataFilter = [];\\n var dmtIndex = 0;\\n if (dt !== null) {\\n\\n dataFilter.push([dt[0][\\\"created_at\\\"],\\n dt[0][\\\"firstname\\\"],\\n dt[0][\\\"lastname\\\"],\\n dt[0][\\\"city\\\"],\\n dt[0][\\\"zip\\\"],\\n dt[0][\\\"birthday\\\"],\\n [dt[0][\\\"feldersDatum\\\"]]]);\\n\\n for (let i = 1; i < dt.length - 1; i++) {\\n\\n if (dt[i][\\\"created_at\\\"] !== dt[i - 1][\\\"created_at\\\"]) {\\n dmtIndex++;\\n dataFilter.push([dt[i][\\\"created_at\\\"],\\n dt[i][\\\"firstname\\\"],\\n dt[i][\\\"lastname\\\"],\\n dt[i][\\\"city\\\"],\\n dt[i][\\\"zip\\\"],\\n dt[i][\\\"birthday\\\"],\\n [dt[i][\\\"feldersDatum\\\"]]\\n ]);\\n } else {\\n dataFilter[dmtIndex][6].push(dt[i][\\\"feldersDatum\\\"]);\\n }\\n }\\n //console.log(dataFilter);\\n return dataFilter;\\n\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfa5eca73486e74d2c277aa6adbc8ba3\",\n \"score\": \"0.5184731\",\n \"text\": \"function combineJson(jsonObj, oldJsonObj){\\n for (let i = 0; i < jsonObj.data.stations.length; i++) {\\n jsonObj.data.stations[i].name = oldJsonObj.data.stations[i].name;\\n }\\n return jsonObj;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59be5d2f1344caf9ef5fbb55a4bfb58a\",\n \"score\": \"0.5159301\",\n \"text\": \"function scrubData(data) {\\n var scrubbed = [];\\n for (var i = 0; i < data.length; i++) {\\n if (i == 0) {\\n scrubbed.push([]);\\n scrubbed[scrubbed.length - 1].push(data[i]);\\n }\\n else if (scrubbed[scrubbed.length - 1][0].city != data[i].city) {\\n if (data[i].pop > 4500)\\n scrubbed.push([]);\\n scrubbed[scrubbed.length - 1].push(data[i]);\\n }\\n else {\\n scrubbed[scrubbed.length - 1].push(data[i]);\\n }\\n }\\n return scrubbed;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b2a0b7994c80703a08fe0c99088e5e8\",\n \"score\": \"0.515619\",\n \"text\": \"getHistoricalMotorData(num) {\\n fetch(serverAddress + `/historical-motor-data?quantity=${encodeURIComponent(num)}`)\\n .then(rawData => rawData.json())\\n .then(objData => objData.data)\\n .then(arrData => arrData.map(item => JSON.parse(item).date).reverse())\\n .then(finalData => this.setState({ historicalMotorData: finalData}))\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1eb2b54b6d5ca730fb6e1d2bbe1d1eff\",\n \"score\": \"0.5153236\",\n \"text\": \"on_update_data(json) {\\n if (json == null) {\\n this.series_time = null\\n this.series = {}\\n this.instruction_nums = []\\n this.indices = []\\n this.addresses = []\\n this.targets = []\\n this.modality = {}\\n this.y_extents = [-1,1]\\n this.downsampling = -1\\n this.add_status_msg(BaseWidget.NO_DATA_FOR_TIME_RANGE)\\n this.downsampling_span.html('?')\\n this.points_span.html('0')\\n return\\n }\\n\\n const msg = json.raw_binary_data\\n\\n const nseries = json.processorSpecific.numSeries\\n const points_per_series = json.processorSpecific.pointsPerSeries\\n const series_blob_offset = json.processorSpecific.seriesBlobOffset\\n const modalities_offset = json.processorSpecific.modalitiesOffset\\n this.downsampling = json.processorSpecific.downsampling\\n const instruction_nums_offset = json.processorSpecific.instructionNumsOffset\\n const indices_offset = json.processorSpecific.indicesOffset\\n const addresses_offset = json.processorSpecific.addressesOffset\\n const targets_offset = json.processorSpecific.targetsOffset\\n\\n this.downsampling_span.html(this.downsampling > 1 ? ('/' + this.downsampling.toString()) : 'none')\\n this.points_span.html(points_per_series.toString())\\n\\n // Parse out heatmap binary data\\n if (nseries == 0 || points_per_series == 0) {\\n this.series_time = null\\n this.series = {}\\n this.instruction_nums = []\\n this.indices = []\\n this.addresses = []\\n this.targets = []\\n this.modality = {}\\n this.downsampling = -1\\n this.y_extents = [-1,1]\\n this.add_status_msg(BaseWidget.NO_DATA_FOR_TIME_RANGE)\\n return\\n }\\n\\n const data = new Float32Array(msg, series_blob_offset, nseries * points_per_series) // Skip dims\\n const modalities = new Int16Array(msg, modalities_offset, nseries)\\n this.series_time = data.subarray(0, points_per_series)\\n this.series = {}\\n this.modality = {}\\n this.y_extents = json.processorSpecific.yExtents\\n for (let i = 0; i < this._stat_cols.length; i++) {\\n const begin = (i + 1) * points_per_series\\n const end = begin + points_per_series\\n this.series[this._stat_cols[i]] = data.subarray(begin, end)\\n this.modality[this._stat_cols[i]] = modalities[i + 1]\\n }\\n\\n\\n // Capture some bp-specific stuff (this should be moved to the bp widget instead)\\n if (typeof instruction_nums_offset != 'undefined')\\n this.instruction_nums = new BigInt64Array(msg, instruction_nums_offset, points_per_series)\\n else\\n this.instruction_nums = []\\n if (typeof indices_offset != 'undefined')\\n this.indices = new BigInt64Array(msg, indices_offset, points_per_series)\\n else\\n this.indices = []\\n if (typeof addresses_offset != 'undefined')\\n this.addresses = new BigInt64Array(msg, addresses_offset, points_per_series)\\n else\\n this.addresses = []\\n if (typeof targets_offset != 'undefined')\\n this.targets = new BigInt64Array(msg, targets_offset, points_per_series)\\n else\\n this.targets = []\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48bc0bc935ce2739e7e95c7c75025c24\",\n \"score\": \"0.51362735\",\n \"text\": \"addOpeningMoment(data, keys) {\\n let priorData = data.filter(x => x.date <= this.minDate);\\n // If no prior data no need to add opening moment\\n // - expandMomentsCumulative will start with zero moment for all keys at min date\\n if (priorData.length !== 0) {\\n let lastPriorDatum = priorData[priorData.length - 1];\\n // No need to add opening moment if there is already a cumulative datum at the min date\\n if (lastPriorDatum.date.getTime() !== this.minDate.getTime()) {\\n let openingMoment = this.newMoment(lastPriorDatum, keys);\\n // Change date from last prior moment to minDate\\n openingMoment.date = new Date(this.minDate.getTime());\\n this.moments.unshift(openingMoment);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b4b3375190c18a2c7598672ade71af9\",\n \"score\": \"0.5130049\",\n \"text\": \"function processMainChart(data, callback, update){\\n\\n\\t\\t\\t// Some more data processing before drawing the chart\\n\\t\\t\\t// Adding a last element to each val_history array,\\n\\t\\t\\t// with the current timestamp (so all lines extend till the current time)\\n\\t\\t\\tvar fullTimeline = _.each(data, function(element, index, list){\\n\\t\\t\\t\\tvar d = new Date();\\n\\t\\t\\t\\tcurrentTimestamp = d.getTime();\\n\\t\\t\\t\\tvar newHistory = {\\n\\t\\t\\t\\t\\tface_val: element.val_history[element.val_history.length - 1].face_val,\\n\\t\\t\\t\\t\\tsocial_val: element.val_history[element.val_history.length - 1].social_val,\\n\\t\\t\\t\\t\\tts: currentTimestamp\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telement.val_history.push(newHistory);\\n\\t\\t\\t});\\t\\t\\t\\n\\n\\t\\t\\tcallback(fullTimeline, update);\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74c3e58deec00e47b70ae04a68fa126d\",\n \"score\": \"0.51270944\",\n \"text\": \"function ReverseJson(JsonResponse) {\\n // Response / input of Json Object Response By Sequence\\n PickPackingCtrl.ePage.Masters.JsonObjectResponse = $filter('orderBy')(JsonResponse, 'Sequence');\\n\\n // Function call to convert the json\\n if (PickPackingCtrl.ePage.Masters.JsonObjectResponse.length > 0) {\\n ConvertJson(PickPackingCtrl.ePage.Masters.JsonObjectResponse);\\n }\\n else {\\n PickPackingCtrl.ePage.Masters.FramedObject = [];\\n }\\n\\n // Assigning the parent child json to the Tree Object (ng-repeat Obj)\\n PickPackingCtrl.ePage.Masters.tree = PickPackingCtrl.ePage.Masters.FramedObject;\\n\\n if (PickPackingCtrl.ePage.Masters.tree.length > 0) {\\n // for first obj response select true \\n PickPackingCtrl.ePage.Masters.tree[0].IsSelectedValue = true;\\n\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce31685cdd15caa847fe31c4f517a202\",\n \"score\": \"0.5116562\",\n \"text\": \"function processJSON(json_data){\\n // verify that the json data is valid\\n if('dev_id' in json_data && 'clock' in json_data){\\n // set the new newest time\\n sensor_data_array[json_data.dev_id-1].newest_time = json_data.clock\\n \\n // check if the sensor array index doesn't exist, create it.\\n while( typeof sensor_data_array[json_data.dev_id-1] == 'undefined'){\\n sensor_data_array.push(sensor_data);\\n }\\n // add the data values from the packet to the sensor_data_array\\n if('pressure' in json_data){\\n sensor_data_array[json_data.dev_id-1].\\n pressure.data.push([json_data.clock, json_data.pressure])\\n sensor_data_array[json_data.dev_id-1].\\n pressure.data.sort()\\n }\\n if('temp' in json_data){\\n sensor_data_array[json_data.dev_id-1].\\n temp.data.push([json_data.clock, json_data.temp])\\n sensor_data_array[json_data.dev_id-1].\\n temp.data.sort()\\n }\\n if('humidity' in json_data){\\n sensor_data_array[json_data.dev_id-1].\\n humidity.data.push([json_data.clock, json_data.humidity])\\n sensor_data_array[json_data.dev_id-1].\\n humidity.data.sort()\\n }\\n if('light' in json_data){\\n sensor_data_array[json_data.dev_id-1].\\n light.data.push([json_data.clock, json_data.light])\\n sensor_data_array[json_data.dev_id-1].\\n light.data.sort()\\n }\\n if('moisture' in json_data){\\n sensor_data_array[json_data.dev_id-1].\\n moisture.data.push([json_data.clock, json_data.moisture])\\n sensor_data_array[json_data.dev_id-1].\\n moisture.data.sort()\\n }\\n }\\n //console.log(sensor_data_array[json_data.dev_id-1].pressure.data)\\n //console.log(sensor_data_array[json_data.dev_id-1].temp.data)\\n //console.log(sensor_data_array[json_data.dev_id-1].humidity.data)\\n //console.log(sensor_data_array[json_data.dev_id-1].light.data)\\n //console.log(sensor_data_array[json_data.dev_id-1].moisture.data)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88d9a73683cd92464e793cbcd92ff48c\",\n \"score\": \"0.51095\",\n \"text\": \"static fromJSON(json) {\\n let sections = [],\\n inserted = [];\\n\\n for (let i = 0; i < json.length; i++) {\\n let part = json[i];\\n\\n if (typeof part == \\\"number\\\") {\\n sections.push(part, -1);\\n } else if (part.length == 1) {\\n sections.push(part[0], 0);\\n } else {\\n while (inserted.length < i - 1) inserted.push(_text.Text.empty);\\n\\n inserted[i] = _text.Text.of(part[1]);\\n sections.push(part[0], inserted[i].length);\\n }\\n }\\n\\n return new ChangeSet(sections, inserted);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f1a644982e2f7fdc9d9f312b14c91d45\",\n \"score\": \"0.508408\",\n \"text\": \"function updateTraffic(json) {\\n lim = Math.min(index + 50, json.length - 1)\\n while (index < lim) {\\n addPage(json[index++])\\n }\\n if (lim < json.length -1) updateView();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26c30a545c0a090999b69f867b3641a8\",\n \"score\": \"0.50815725\",\n \"text\": \"_addHistory(array, data) {\\n array.push(data);\\n if (array.length > 10) { // limit history length\\n array.splice(0, 1);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a39dfa600deee25a57bbe16dbb2c8e0\",\n \"score\": \"0.5077135\",\n \"text\": \"function resetData(){\\n $.getJSON('http://www.whateverorigin.org/get?url=' + encodeURIComponent(topAppsurl) + '&callback=?', function(data){\\n let onlyNewItems = new Set();\\n let t = $(data.contents).find('div.Vpfmgd');\\n for(let i=0; i<t.length; i++){\\n let item = {\\n link: $(t[i]).find('a.poRVub').attr('href').split('?')[1],\\n img: $(t[i]).find('img.T75of').attr('data-src'),\\n title: $(t[i]).find('div.WsMG1c').text(),\\n };\\n if(!titleDataSet.has(item.title)){\\n onlyNewItems.add(item);\\n titleDataSet.add(item.title);\\n dataset.add(item);\\n }\\n }\\n appendNewParticularChildrens(onlyNewItems);\\n\\n //clear onlyNewItems because items are no longer new to us, they have been added to DOM\\n onlyNewItems.clear();\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29db4fb1b43c8c5c89c05dc8803bb74c\",\n \"score\": \"0.50696844\",\n \"text\": \"static earliest(data) {\\n return data.length && data.filter(clear).length ?\\n last(data.filter(clear).sort((a, b) => new Date(b).valueOf() - new Date(a).valueOf())) : undefined;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db1f15df0237f5ffd1e53880195dcb22\",\n \"score\": \"0.50583583\",\n \"text\": \"undo() {\\n this.history.pop();\\n const last = _.last(this.history);\\n _.each(last, (value, key) => {\\n this[key] = JSON.parse(JSON.stringify(value));\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5ca16397c06a4b9d03445cc98998f72\",\n \"score\": \"0.50537\",\n \"text\": \"function JSONClone(obj) {\\n return JSON.parse(JSON.stringify(obj));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5ca16397c06a4b9d03445cc98998f72\",\n \"score\": \"0.50537\",\n \"text\": \"function JSONClone(obj) {\\n return JSON.parse(JSON.stringify(obj));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5ca16397c06a4b9d03445cc98998f72\",\n \"score\": \"0.50537\",\n \"text\": \"function JSONClone(obj) {\\n return JSON.parse(JSON.stringify(obj));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5ca16397c06a4b9d03445cc98998f72\",\n \"score\": \"0.50537\",\n \"text\": \"function JSONClone(obj) {\\n return JSON.parse(JSON.stringify(obj));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5ca16397c06a4b9d03445cc98998f72\",\n \"score\": \"0.50537\",\n \"text\": \"function JSONClone(obj) {\\n return JSON.parse(JSON.stringify(obj));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e91bac7d02f57fa2e4cc953cb7ce85ac\",\n \"score\": \"0.5049681\",\n \"text\": \"function fixFlickrJSON(data) {\\n\\n var content = null;\\n \\n for (var key in data) {\\n\\n if (key == '_content') {\\n content = data._content;\\n break;\\n } else if (typeof(data[key]) == 'object') {\\n data[key] = fixFlickrJSON(data[key]);\\n }\\n \\n }\\n \\n if (content != null) {\\n data = content;\\n }\\n \\n return data;\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b79255da7b6fb315952b7a1af95cb46\",\n \"score\": \"0.5042081\",\n \"text\": \"bootstrap(json) {\\n if (!json) {\\n return;\\n }\\n\\n this.cached = this.cached.update(() => {\\n return Immutable.fromJS(JSON.parse(json));\\n });\\n return this.cached;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11a1c2baff3d46a4197e0a762ab19b43\",\n \"score\": \"0.5038528\",\n \"text\": \"function previousComments(data){\\n //console.log(data.Comments.length)\\n for (var i = 0; i < data.Comments.length; i++) {\\n //create li for each of the comments\\n var newlist = createList(data.Comments, i)\\n //console.log(i)\\n $(`#${data._id}`).append(newlist)\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39e99a2fea76b2054caec9a28253afcd\",\n \"score\": \"0.5037856\",\n \"text\": \"fixJsonData() {\\n return this.data.map((row, i) => {\\n // Create an array with the string splited by separator\\n stringSplited = row.o.split(\\\"/\\\");\\n let result = this.extractData(stringSplited, row.n);\\n return result;\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2c8d0fca5d8d24f9aaa5550e6fd7e89\",\n \"score\": \"0.502556\",\n \"text\": \"function sortData(data) {\\n data.sort(function (a, b) {\\n return a.start - b.start\\n });\\n return data;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b367ccaf43a04c4c0cfa47d239ea647d\",\n \"score\": \"0.5011954\",\n \"text\": \"function LoadData() {\\n\\n //Creating the new timeline \\n var timelineContainer = $('#timeline_container')\\n var documentBody = $(document.body);\\n \\n // Remove old timeline\\n $('#timeline').remove();\\n\\n // Create a new timeline\\n var appending = $('<div>').attr('id', 'timeline').appendTo(timelineContainer);\\n var timeline_data = [];\\n var Features = {};\\n\\n \\n $('#timeline').addClass('TimelineContainer');\\n \\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd68e4a5b5b1c3b6f34b0949a6d2a23f\",\n \"score\": \"0.501151\",\n \"text\": \"getProcessedJson(data, header) {\\n let keys = this.getKeys(data, header);\\n let newData = [];\\n let _self = this;\\n data.map(function(item, index) {\\n let newItem = {};\\n for (let label in keys) {\\n let property = keys[label];\\n newItem[label] = _self.getValue(property, item);\\n }\\n newData.push(newItem);\\n });\\n\\n return newData;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07be25e9b86437e51f2955011b45334f\",\n \"score\": \"0.5011288\",\n \"text\": \"update()\\n { \\n let nextTime = this.time + 1;\\n this.history.set(nextTime, []);\\n for (let x=1; x != this.values.length - 1; ++x)\\n {\\n for (let y=1; y != this.values[x].length - 1; ++y)\\n {\\n let tmp_next = this.getNext(x, y);\\n if (this.values[x][y] !== tmp_next)\\n this.history.get(nextTime).push({'x': x, 'y': y, 'new': tmp_next, 'old': this.values[x][y]});\\n }\\n }\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d93bc7be9da3c97c6570752cd1b0bbb\",\n \"score\": \"0.50085366\",\n \"text\": \"function transformData(data) {\\n var newData = [];\\n for (var key in data) {\\n var value = data[key];\\n var tempObject = {\\n key: key\\n };\\n tempObject.values = value;\\n newData.push(tempObject);\\n }\\n\\n return newData;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d489db59a2fd3e93bd3c52a4b109758\",\n \"score\": \"0.5002793\",\n \"text\": \"async function readAndParseGithubData() {\\n const dataFile = readFileSync('./data.json', { encoding: 'utf-8' })\\n const parsed = JSON.parse(dataFile)\\n\\n let total = parsed.length\\n let count = parsed.length - 100\\n let res = []\\n\\n while (total > 0) {\\n const arrayContent = parsed.slice(count, total)\\n\\n if (arrayContent.length > 0) {\\n res = res.concat([arrayContent])\\n }\\n\\n total = total - 100\\n count = count - 100\\n }\\n\\n if (total > -100) {\\n total = total + 100\\n res = res.concat([parsed.slice(0, total)])\\n }\\n\\n const resParsed = await res.map((item, i) => {\\n console.log(`${i} = ${item.length}`)\\n\\n return item.map(it => ({\\n collectionId: 18455651,\\n title: it.full_name,\\n link: it.html_url,\\n tags: [\\\"github\\\", `${it.language}`],\\n created: it.created_at,\\n excerpt: it.description\\n }))\\n })\\n console.log(`total = ${resParsed.length}`)\\n await writeFileSync('./newData.json', JSON.stringify(resParsed))\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"acf81b344cc77e2a61ba5047bc1c26a5\",\n \"score\": \"0.4998871\",\n \"text\": \"function DeepCopy(initialState){\\n motionEntityList=[]\\n for(i=0;i<initialState.motionEntityList.length;i++){\\n //motionEntityList.push(Object.assign({Entity},initialState.motionEntityList[i]));\\n motionEntityList.push($.extend(true,{},initialState.motionEntityList[i]));\\n }\\n staticEntityList=[]\\n for(i=0;i<initialState.staticEntityList.length;i++){\\n //staticEntityList.push(Object.assign({Entity},initialState.staticEntityList[i]));\\n staticEntityList.push($.extend(true,{},initialState.staticEntityList[i]));\\n }\\n backgroundList=[]\\n for(i=0;i<initialState.backgroundList.length;i++){\\n //backgroundList.push(Object.assign({Entity},initialState.backgroundList[i]));\\n backgroundList.push($.extend(true,{},initialState.backgroundList[i]));\\n }\\n return new levelData(motionEntityList,staticEntityList,backgroundList);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b24fa6670c4638202b8ccec8571473e\",\n \"score\": \"0.49936724\",\n \"text\": \"function JSONClone (obj) {\\n return JSON.parse(JSON.stringify(obj))\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ffdb09dfb2f546d887c1749a37384f0\",\n \"score\": \"0.4991459\",\n \"text\": \"shiftItems(index){\\n for(let i = index; i < this.length - 1; i++){\\n this.data[i] = this.data[i+1];\\n }\\n delete this.data[this.length - 1];\\n this.length--;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f49f26c0ce7c78d8aa962b0014ce092\",\n \"score\": \"0.49850726\",\n \"text\": \"function refreshJSON() {\\n if (typeof players !== 'undefined' && players.length > 0) {\\n lastPlayers = players.slice();\\n }\\n players = [];\\n duration = [];\\n xmlhttp.open('GET', url, false);\\n xmlhttp.send();\\n for (i in playerData) {\\n players.push(playerData[i].name);\\n duration.push(playerData[i].playtime);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51ab8ade0ec38dd881a299a782595ab6\",\n \"score\": \"0.4978438\",\n \"text\": \"static createListFromJson(jsonObj)\\n\\t{\\n\\t\\tvar answer = [];\\n\\t\\tfor (var nextBlogPostIndex = 0; nextBlogPostIndex < jsonObj.length; nextBlogPostIndex++)\\n\\t\\t{\\n\\t\\t\\tanswer.push(NextBlogPostCard.createFromJson(jsonObj[nextBlogPostIndex]));\\n\\t\\t}\\n\\t\\treturn answer;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"156a518b0fab69db1c1de04d818f4dbc\",\n \"score\": \"0.4976484\",\n \"text\": \"function retainCommonTimeFrame(widget, data) {\\n\\t\\t\\tif (!data || data.length == 0)\\n\\t\\t\\t\\treturn [];\\n\\t\\t\\tif (widget.options.drawAggregates !== false && widget.options.drawAggregates !== undefined)\\n\\t\\t\\t\\treturn addHistory(widget, data);\\n\\t\\t\\tlet now = Date.now();\\n\\t\\t\\tlet startOfLastMinute = now - 60000;\\n\\t\\t\\tlet startOfShortestSeries = data.reduce((high, e) => Math.max(e.points[0], high), 0);\\n\\t\\t\\tlet startCutoff = data.length == 1 ? startOfShortestSeries : Math.min(startOfLastMinute, startOfShortestSeries);\\n\\t\\t\\tlet endOfShortestSeries = data.reduce((low, e) => {\\n\\t\\t\\t\\tlet endTime = e.points[e.points.length - 2];\\n\\t\\t\\t\\treturn endTime > now - 4000 ? Math.min(endTime, low) : low;\\n\\t\\t\\t}, now);\\n\\t\\t\\tlet endCutoff = endOfShortestSeries;\\n\\t\\t\\tdata.forEach(function(seriesData) {\\n\\t\\t\\t\\tlet src = seriesData.points;\\n\\t\\t\\t\\tif (src.length == 4 && src[2] >= startCutoff) {\\n\\t\\t\\t\\t\\tif (src[1] == src[3]) {\\n\\t\\t\\t\\t\\t\\t// extend a straight line between 2 points to cutoff\\n\\t\\t\\t\\t\\t\\tseriesData.points = [Math.max(seriesData.observedSince, Math.min(startOfShortestSeries, src[2] - 59000)), src[1], src[2], src[3]];\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tlet points = [];\\n\\t\\t\\t\\t\\tfor (let i = 0; i < src.length; i += 2) {\\n\\t\\t\\t\\t\\t\\tif (src[i] >= startCutoff && src[i] <= endCutoff) {\\n\\t\\t\\t\\t\\t\\t\\tpoints.push(src[i]);\\n\\t\\t\\t\\t\\t\\t\\tpoints.push(src[i+1]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tseriesData.points = points;\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t});\\n\\t\\t\\treturn data.filter(seriesData => seriesData.points.length >= 2 \\n\\t\\t\\t\\t&& seriesData.points[seriesData.points.length - 2] > startOfLastMinute);\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"546f232e294721daaf638a128477085b\",\n \"score\": \"0.497135\",\n \"text\": \"function formatData(data) {\\n for (var i=0; i < data['list'].length; i++) {\\n var day = retrieveDay(data['list'][i]['dt']);\\n data['list'][i]['day'] = day;\\n var icon = retrieveWeatherIcon(data['list'][i]['weather'][0]['main']);\\n data['list'][i]['icon'] = icon\\n data['list'][i]['dt'] = convertUnixTimeStamp(data['list'][i]['dt'], '');\\n data['list'][i]['deg'] = degreeToText(data['list'][i]['deg']);\\n data['list'][i]['sunrise'] = convertUnixTimeStamp(data['list'][i]['sunrise'], 'hours');\\n data['list'][i]['sunset'] = convertUnixTimeStamp(data['list'][i]['sunset'], 'hours');\\n }\\n\\n return data\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"609828ecdd6a18ca513048617e219844\",\n \"score\": \"0.49659622\",\n \"text\": \"function prepData() {\\n var t, v;\\n var dt = Number($scope.datasource.deltaT);\\n var len = Math.ceil($scope.trange / (dt * $scope.tscale ));\\n var dlen = $scope.buffer.data.length;\\n if (len > dlen) {\\n len = dlen;\\n }\\n\\n var plotData = [];\\n\\n for (var i = 0; i < len; i++) {\\n t = -dt * i * $scope.tscale;\\n v = $scope.buffer.data[dlen - 1 - i];\\n //t = $scope.buffer.time[dlen-1-i] * $scope.tscale;\\n plotData.push([t, v]);\\n }\\n return plotData;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e30b847cc7b80d3b8c048b5c345c89a4\",\n \"score\": \"0.4962687\",\n \"text\": \"downloadData(){\\n let jsonData = JSON.parse(JSON.stringify(this.graphData));\\n // data is an array of objects that might be deeply nested (with more than 1 level)\\n let flatJSONData = []\\n _.forEach(jsonData, function(item){\\n flatJSONData.push(flatten(item));\\n });\\n return flatJSONData;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d2f9f1587f19a45a0bf3178bef0767a\",\n \"score\": \"0.49579963\",\n \"text\": \"function JSONLoader() {\\n var navdata;\\n var count;\\n var length;\\n\\n /**\\n * Loads a JSON-file.\\n * @param {File} file - The JSON-file.\\n */\\n this.loadJSON = function(file) {\\n fr = new FileReader();\\n fr.onload = function (e) {\\n lines = e.target.result;\\n navdata = (JSON.parse(lines))[0].data;\\n length = navdata.length;\\n count = 0;\\n console.log(navdata);\\n };\\n\\n fr.readAsText(file);\\n };\\n\\n /**\\n * Returns the next set of navdata.\\n * @returns {Navdata}\\n */\\n this.getNextDataSet = function() {\\n // check if end of object is reached\\n if (count == length) {\\n return null;\\n }\\n\\n dataSet = navdata[count];\\n count++;\\n\\n navdataSet = new Navdata(\\n dataSet.roll != undefined ? dataSet.roll : null,\\n dataSet.pitch != undefined ? dataSet.pitch : null,\\n dataSet.yaw != undefined ? dataSet.yaw : null,\\n dataSet.thrust != undefined ? dataSet.thrust : null,\\n dataSet.deapth != undefined ? dataSet.deapth : null,\\n dataSet.hdgd != undefined ? dataSet.hdgd : null,\\n dataSet.acclx != undefined ? dataSet.acclx : null,\\n dataSet.accly != undefined ? dataSet.accly : null,\\n dataSet.acclz != undefined ? dataSet.acclz : null,\\n dataSet.magx != undefined ? dataSet.magx : null,\\n dataSet.magy != undefined ? dataSet.magy : null,\\n dataSet.magz != undefined ? dataSet.magz : null,\\n dataSet.gyrox != undefined ? dataSet.gyrox : null,\\n dataSet.gyroy != undefined ? dataSet.gyroy : null,\\n dataSet.gyroz != undefined ? dataSet.gyroz : null,\\n dataSet.lacclx != undefined ? dataSet.lacclx : null,\\n dataSet.laccly != undefined ? dataSet.laccly : null,\\n dataSet.lacclz != undefined ? dataSet.lacclz : null,\\n dataSet.gravx != undefined ? dataSet.gravx : null,\\n dataSet.gravy != undefined ? dataSet.gravy : null,\\n dataSet.gravz != undefined ? dataSet.gravz : null,\\n dataSet.timestamp != undefined ? dataSet.timestamp : null\\n );\\n\\n console.log(\\\"JSONLoader received data set \\\" + count);\\n return navdataSet;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f68dae2a4b0da41da1043aa043cd50d9\",\n \"score\": \"0.49573034\",\n \"text\": \"function loadData()\\n{\\n loadJSON('lastSearch.json', loadedData);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c7eaae7b808629957bdbffc77cafa9f\",\n \"score\": \"0.49534792\",\n \"text\": \"function parseJson(json_data) {\\n sitesObj = JSON.parse(json_data);\\n\\n // Once the json file has been stored, we retrieve the source file\\n loadingJson = false;\\n getFile(chrome.runtime.getURL(\\\"sourcefile.tsv\\\"));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"582467049edba892756cc0b468668e48\",\n \"score\": \"0.49519426\",\n \"text\": \"function sortTimeline(timeline){\\r\\n timeline.sort((a, b) => (a.timestamp.localeCompare(b.timestamp)) * -1);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0368a6327e376582c4ec79c2b6fe8b07\",\n \"score\": \"0.4938829\",\n \"text\": \"function getLatestTempData() {\\n\\t\\n\\tvar request = new XMLHttpRequest;\\n\\trequest.overrideMimeType(\\\"application/json\\\");\\n\\trequest.open(\\\"GET\\\", window.location.origin + \\\"/temp_data.json\\\", true);\\n\\trequest.onload = function() {\\n\\t\\twindow.g_lastTempData = JSON.parse(request.responseText);\\n\\t\\t// console.log(\\\"new temps: \\\" + JSON.stringify(window.g_lastTempData));\\n\\t};\\n\\trequest.send(null);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9aa83ab41ed5aebf14450a64a045d2c3\",\n \"score\": \"0.49303198\",\n \"text\": \"function extendCompletedSPChart(dataSet) {\\r\\n var count = dataSet.length;\\r\\n\\r\\n //next date\\r\\n var nextDate = new Date().getTime();\\r\\n\\r\\n dataSet.push({ x: nextDate, y: dataSet[count - 1].y });\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79e30d0f574bd71a00343fb834a3a57d\",\n \"score\": \"0.49267483\",\n \"text\": \"function modifyJSON(data) {\\n let polished = alpha.util.polish(data).data;\\n for (curr in polished) {\\n delete polished[curr].market_open;\\n delete polished[curr].market_high;\\n delete polished[curr].market_low;\\n delete polished[curr].market_close;\\n delete polished[curr].cap;\\n }\\n let str = JSON.stringify(polished);\\n str = str.replace(\\\"\\\\\\\"usd_open\\\\\\\":\\\", \\\"\\\\\\\"open\\\\\\\":\\\");\\n str = str.replace(\\\"\\\\\\\"usd_high\\\\\\\":\\\", \\\"\\\\\\\"high\\\\\\\":\\\");\\n str = str.replace(\\\"\\\\\\\"usd_low\\\\\\\":\\\", \\\"\\\\\\\"low\\\\\\\":\\\");\\n str = str.replace(\\\"\\\\\\\"usd_close\\\\\\\":\\\", \\\"\\\\\\\"close\\\\\\\":\\\");\\n polished = JSON.parse(str);\\n return polished;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7eb5e03bc41e1edc6240d8367de20989\",\n \"score\": \"0.49253213\",\n \"text\": \"function json_to_laps(json, xObject) { \\n var laps = [];\\n var time_x0 = 0, distance_x0 = 0;\\n for (var i = 0, n = json.laps.length; i < n; i++) { \\n var lap = {\\n time: { \\n x0: time_x0,\\n width: time.value(json.laps[i]) - time_x0\\n },\\n distance: { \\n x0: distance_x0,\\n width: distance.value(json.laps[i]) - distance_x0\\n }\\n };\\n time_x0 = time_x0 + lap.time.width; \\n distance_x0 = distance_x0 + lap.distance.width; \\n // alert (lap.x0 + \\\" \\\" + lap.x1);\\n laps.push(lap);\\n }\\n return laps;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"364f9f486c1ef9ceeaaa9c56695e2cfc\",\n \"score\": \"0.49251643\",\n \"text\": \"function reformatData(obj) {\\n var dataDict = {};\\n for (var repo in obj['data']) {\\n if (obj['data'].hasOwnProperty(repo)) {\\n var repoDict = obj['data'][repo],\\n issuesClosed = repoDict['issues_Closed']['totalCount'],\\n issuesOpen = repoDict['issues_Open']['totalCount'],\\n doubleKey = [issuesClosed, issuesOpen];\\n if (!Object.keys(dataDict).contains(doubleKey)) {\\n dataDict[doubleKey] = [];\\n }\\n dataDict[doubleKey].push(repo);\\n }\\n }\\n var data = [];\\n for (var doubleKey in dataDict) {\\n if (dataDict.hasOwnProperty(doubleKey)) {\\n var numbers = doubleKey.split(',');\\n var dataset = {\\n names: dataDict[doubleKey].sort(),\\n valueX: +numbers[0], // issues closed\\n valueY: +numbers[1] // issues open\\n };\\n data.push(dataset);\\n }\\n }\\n return data;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"781f02ac87d335bcd5bb4c7a42ae2fcd\",\n \"score\": \"0.49177715\",\n \"text\": \"getHistoricalSensorData(num) {\\n fetch(serverAddress + `/historical-sensor-data?quantity=${encodeURIComponent(num)}`)\\n .then(rawData => rawData.json())\\n .then(objData => objData.data)\\n .then(arrData => arrData.map(item => JSON.parse(item)).reverse()) \\n .then(finalData => this.setState({ historicalSensorData: finalData }))\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b896fae7ea27f3bbe7a30814726cdb2a\",\n \"score\": \"0.49157742\",\n \"text\": \"function parseData(json){\\n\\n var blockData = [];\\n\\n $.each(json.data, function(key1, item) {\\n blockData.push({\\\"height\\\": item.height, \\\"block_time\\\": item.block_time});\\n });\\n\\n evalTime(blockData);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5228305dbeb8ed1a82775622b21be11f\",\n \"score\": \"0.4901937\",\n \"text\": \"function genRow(data) {\\n\\t\\t\\tif (typeof(data[4]) === \\\"string\\\" && data[4].indexOf(\\\"{\\\") > -1) {\\n\\t\\t\\tvar tmp = $.parseJSON(data[4]);\\n\\t\\t\\tdata[4] = tmp.oldStatus;\\n\\t\\t\\tdata[5] = null;\\n\\t\\t\\t}\\n\\t\\t\\treturn data;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c51662dd576661da7e0550f5522fd5ac\",\n \"score\": \"0.48934305\",\n \"text\": \"function flipy(grid) {\\n\\tlet data = JSON.parse(JSON.stringify(grid));\\n\\tdata.body.reverse();\\n\\treturn data;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c357c9a870f9a0ecad4f8ed877e56e90\",\n \"score\": \"0.48925528\",\n \"text\": \"function callback(result) {\\n var data = result;\\n console.log(data);\\n API_data =[\\n {\\n name: 'Alex',\\n data: [\\n [Date.UTC(2011, 1, 1), 8],\\n [Date.UTC(2011, 2, 1), 9],\\n [Date.UTC(2011, 3, 1), 10],\\n [Date.UTC(2011, 4, 1), 10],\\n [Date.UTC(2011, 5, 1), 8],\\n [Date.UTC(2011, 6, 1), 7],\\n [Date.UTC(2011, 7, 1), 6],\\n [Date.UTC(2011, 8, 1), 7],\\n [Date.UTC(2011, 9, 1), 5],\\n [Date.UTC(2011, 10, 1), 4],\\n [Date.UTC(2011, 11, 1), 4]\\n ]},\\n {\\n name: \\\"Sally\\\",\\n data: [\\n [Date.UTC(2011, 1, 1), 1],\\n [Date.UTC(2011, 2, 1), 3],\\n [Date.UTC(2011, 3, 1), 1],\\n [Date.UTC(2011, 4, 1), 1],\\n [Date.UTC(2011, 5, 1), 1],\\n [Date.UTC(2011, 6, 1), 4],\\n [Date.UTC(2011, 7, 1), 3],\\n [Date.UTC(2011, 8, 1), 6],\\n [Date.UTC(2011, 9, 1), 7],\\n [Date.UTC(2011, 10, 1), 7],\\n [Date.UTC(2011, 11, 1), 8]\\n ]},\\n {\\n name: \\\"Erin\\\",\\n data: [\\n [Date.UTC(2011, 1, 1), 3],\\n [Date.UTC(2011, 2, 1), 2],\\n [Date.UTC(2011, 3, 1), 3],\\n [Date.UTC(2011, 4, 1), 4],\\n [Date.UTC(2011, 5, 1), 5],\\n [Date.UTC(2011, 6, 1), 7],\\n [Date.UTC(2011, 7, 1), 8],\\n [Date.UTC(2011, 8, 1), 6],\\n [Date.UTC(2011, 9, 1), 6],\\n [Date.UTC(2011, 10, 1), 6],\\n [Date.UTC(2011, 11, 1), 7]\\n ]}\\n ]\\n\\n\\n\\n Highcharts.chart('container', {\\n credits: {\\n enabled: false\\n },\\n\\n exporting: {\\n enabled: false\\n },\\n\\n subtitle: {\\n text: 'Year 2017'\\n },\\n\\n\\n title: {\\n text: 'My Group Netflix Usage'\\n },\\n\\n subtitle: {\\n text: 'Year 2017'\\n },\\n\\n yAxis: {\\n title: {\\n text: 'Hours of Netflix Usage'\\n }\\n },\\n xAxis: {\\n type: 'datetime',\\n tickInterval: 30 * 24 * 3600 * 1000,\\n min: Date.UTC(2011, 1, 1),\\n max: Date.UTC(2011, 12, 1),\\n labels: {\\n rotation: 45,\\n step: 1,\\n style: {\\n fontSize: '13px',\\n fontFamily: 'Arial,sans-serif'\\n }\\n },\\n dateTimeLabelFormats: { // don't display the dummy year\\n month: '%b \\\\'%y',\\n year: '%Y'\\n }\\n },\\n legend: {\\n layout: 'vertical',\\n align: 'right',\\n verticalAlign: 'middle'\\n },\\n\\n plotOptions: {\\n series: {\\n label: {\\n connectorAllowed: false\\n },\\n pointStart: 2010\\n }\\n },\\n\\n series: API_data,\\n\\n\\n responsive: {\\n rules: [{\\n condition: {\\n maxWidth: 500\\n },\\n chartOptions: {\\n legend: {\\n layout: 'horizontal',\\n align: 'center',\\n verticalAlign: 'bottom'\\n }\\n }\\n }]\\n }\\n\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c41eba585baac41fb4ddd5b4ee5e8c8\",\n \"score\": \"0.48900074\",\n \"text\": \"static rearrangeData(data, keyName) {\\n let array = [...data];\\n array = array\\n .sort((a, b) => a[keyName] - b[keyName])\\n .filter(record => record[keyName] !== 0);\\n\\n const result = [];\\n\\n while (array.length) {\\n result.push(array[array.length - 1]);\\n array.pop();\\n\\n if (array.length) {\\n result.push(array[0]);\\n array.shift();\\n }\\n }\\n\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f11e7188e56b0f4db66938bc8ce43b6a\",\n \"score\": \"0.48860875\",\n \"text\": \"function parseDataFromGitHub (response) {\\n return JSON.parse(response)\\n .reduce(function(res, elem) {\\n var parsed = elem.name.split('.')[0].split('-');\\n var title = parsed.splice(3).join(' ');\\n var date = {\\n year: parsed[0],\\n month: parsed[1],\\n day: parsed[2]\\n };\\n\\n elem.title = title;\\n elem.date = date;\\n\\n res.push(elem);\\n return res;\\n }, [])\\n .filter(function (elem) {\\n return elem.title.length > 0;\\n })\\n .reverse();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86ddf0290a45950f56ac589bf6376e16\",\n \"score\": \"0.48792696\",\n \"text\": \"timelineData(){\\n return {\\n content: this.name,\\n start: this.start,\\n end: this.end\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e732e0d6fa3d690a63b83944ea996d6\",\n \"score\": \"0.48783526\",\n \"text\": \"static latestTime(data) {\\n return data.length && data.filter(clear).length ?\\n first(data.filter(clear).map(v => new Date(v)).sort((a, b) => new Date().setHours(b.getHours(), b.getMinutes(), b.getSeconds()) -\\n new Date().setHours(a.getHours(), a.getMinutes(), a.getSeconds()))) : undefined;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d62228736aafda472da12c177454fba\",\n \"score\": \"0.48738995\",\n \"text\": \"_shiftItems(index) {\\n for (let i = index; i < this.length - 1; i++) {\\n this.data[i] = this.data[i + 1];\\n }\\n // delete the last item and decrease the length.\\n delete this.data[this.length - 1];\\n this.length--;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69cae8d35af436d740744de1820690be\",\n \"score\": \"0.48522097\",\n \"text\": \"displayReverse() {\\r\\n let current = this.tail;\\r\\n console.log(current.data);\\r\\n while (current !== this.head) {\\r\\n current = current.prev;\\r\\n console.log(current.data);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a4114804787530d1d53e30797b2c1ad\",\n \"score\": \"0.48520094\",\n \"text\": \"unnestData(data) {\\n let unnestedData = [];\\n for (let [target, sourcePosts] of Object.entries(data)) {\\n for (let key in sourcePosts) {\\n let post = Object.assign({}, sourcePosts[key]);\\n post.SOURCE_SUBREDDIT = target;\\n unnestedData.push(post);\\n }\\n }\\n return unnestedData;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cdb53667c25fbb41c316d1a27df194cc\",\n \"score\": \"0.48515603\",\n \"text\": \"function prepareNestedDataFromJson(data) {\\n\\n for (let currentKey in data) {\\n\\n if (data[currentKey] !== null) {\\n\\n if (typeof (data[currentKey]) === \\\"object\\\") {\\n\\n if (parent === \\\"trajectory-data\\\") {\\n currentTime = currentKey;\\n if (!timeSteps.includes(currentKey)) {\\n timeSteps.push(parseFloat(currentKey));\\n nestedData.set(currentKey, d3.map());\\n vesicleStates.set(currentKey, d3.map());\\n }\\n }\\n\\n if (parent === \\\"data\\\") {\\n currentNode = currentKey;\\n\\n if (!nodeIdentifiers.includes(currentKey)) {\\n nodeIdentifiers.push(currentKey)\\n\\n }\\n nestedData.get(currentTime).set(currentNode, d3.map())\\n\\n }\\n\\n if (parent === \\\"subsections\\\") {\\n currentCompartment = currentKey;\\n if (!compartmentIdentifiers.includes(currentKey)) {\\n compartmentIdentifiers.push(currentKey);\\n\\n }\\n if (nestedData.get(currentTime).get(currentNode) !== undefined) {\\n nestedData.get(currentTime).get(currentNode).set(currentCompartment, d3.map())\\n }\\n }\\n\\n if (currentKey === \\\"positions\\\") {\\n if (nestedData.get(currentTime).get(currentNode) !== undefined) {\\n nestedData.get(currentTime).get(currentNode).get(currentCompartment).set(currentKey, data[currentKey]);\\n }\\n }\\n const grandparent = parent;\\n parent = currentKey;\\n prepareNestedDataFromJson(data[currentKey]);\\n parent = grandparent;\\n\\n } else {\\n\\n if (parent === \\\"concentrations\\\") {\\n currentSpecies = currentKey;\\n if (!speciesIdentifiers.includes(currentKey)) {\\n speciesIdentifiers.push(currentKey);\\n }\\n if (nestedData.get(currentTime).get(currentNode) !== undefined) {\\n nestedData.get(currentTime).get(currentNode).get(currentCompartment).set(currentKey, data[currentKey]);\\n\\n }\\n\\n }\\n\\n if (currentKey === \\\"state\\\") {\\n vesicleStates.get(currentTime).set(currentNode, data[currentKey]);\\n }\\n\\n if (currentKey === \\\"timeSteps-unit\\\") {\\n timeUnit = data[currentKey];\\n } else if (currentKey === \\\"concentration-unit\\\") {\\n concentrationUnit = data[currentKey]\\n } else if (currentKey === \\\"simulation-width\\\") {\\n simulationWidth = data[currentKey]\\n } else if (currentKey === \\\"simulation-height\\\") {\\n simulationHeight = data[currentKey]\\n }\\n\\n }\\n }\\n }\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":83,"cells":{"query_id":{"kind":"string","value":"4ab5bbb65e12683265797fe4f9c1b7a0"},"query":{"kind":"string","value":"Handler for dragging no longer over an element."},"positive_passages":{"kind":"list like","value":[{"docid":"88e018ce6dd4a8728f293e6d44550b5c","score":"0.62451595","text":"function handleDragLeave() {\n this.classList.remove('over');\n }","title":""}],"string":"[\n {\n \"docid\": \"88e018ce6dd4a8728f293e6d44550b5c\",\n \"score\": \"0.62451595\",\n \"text\": \"function handleDragLeave() {\\n this.classList.remove('over');\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"9f6cade4ec8489708c8d2880a4511b37","score":"0.70727825","text":"function stopDragover() {\n placeholder.remove();\n element.removeClass(\"dndDragover\");\n return true;\n }","title":""},{"docid":"5a8b6f436c0c5c9bf8a8dc172943fe45","score":"0.6992945","text":"function stopDragover() {\n placeholder.remove();\n element.removeClass(\"dndDragover\");\n return true;\n }","title":""},{"docid":"5a8b6f436c0c5c9bf8a8dc172943fe45","score":"0.6992945","text":"function stopDragover() {\n placeholder.remove();\n element.removeClass(\"dndDragover\");\n return true;\n }","title":""},{"docid":"eb4d4e5f2be2ffc51f0cfd28c487ba7b","score":"0.6974002","text":"function stopDragover() {\n placeholder.remove();\n element.removeClass('dndDragover');\n return true;\n }","title":""},{"docid":"c00571fcf84c2b47d0666c4a6d623a82","score":"0.673683","text":"function onMouseUp()\n{\n document.removeEventListener(getMouseMove(), onMouseMove); //stop drag\n}","title":""},{"docid":"c0fa273a594f118b76e71ed4ace5240b","score":"0.6631138","text":"clearDragOver() {\n this._clearEvent(this.dragOverEvents);\n }","title":""},{"docid":"3717ae30a7c7bbfb0e3503d8a5da8ecb","score":"0.66038203","text":"function draggingOver(event) {\n event.preventDefault();\n // console.log(event.target)\n}","title":""},{"docid":"d5a8cfeea91435e9ce9d6acf909aff33","score":"0.6595426","text":"function mouseReleased() {\n dragging = false;\n}","title":""},{"docid":"ea4b225eec39109ec715540254cd3c9c","score":"0.6592969","text":"function dragOver(e) {\n // console.log('Event:', 'dragover');\n e.preventDefault();\n}","title":""},{"docid":"85f8c44d854bf3b66d7b12d5b1427881","score":"0.65906394","text":"onMouseUp(event) {\r\n this.isDragging = false;\r\n this.isPanning = false;\r\n if (this.layout && typeof this.layout !== 'string' && this.layout.onDragEnd) {\r\n this.layout.onDragEnd(this.draggingNode, event);\r\n }\r\n }","title":""},{"docid":"71c86dde907b22de5e35ffb50ac73fd4","score":"0.6590283","text":"function dragOver(event) {\n event.preventDefault();\n}","title":""},{"docid":"1649489363a429d8b27da7faf71d8315","score":"0.6561757","text":"handleDragOver(event) {\n event.preventDefault();\n }","title":""},{"docid":"7f68cd4ce15976da2006c6103e5af152","score":"0.6552457","text":"function OnMouseUp(e)\n{\n if (dragElement != null)\n {\n dragElement.style.zIndex = oldZIndex;\n document.onmousemove = null;\n dragElement = null;\n }\n}","title":""},{"docid":"1203c1a425d95d62769416e185d281a1","score":"0.65521634","text":"function dragOver(e) {\n e.preventDefault();\n //console.log('over');\n\n}","title":""},{"docid":"0a883cc5d1d36071f8864615f33a0b2e","score":"0.65491474","text":"_onChildDragOver(evt, element) {\n if (!this._allowDrag || !this._dragging) return;\n\n if (element.allowDrop && this._dragItems.indexOf(element) === -1) {\n this._dragOverItem = element;\n } else {\n this._dragOverItem = null;\n }\n\n this._updateDragHandle();\n this._onDragMove(evt);\n }","title":""},{"docid":"774af1bbd2ff8524a450cd8e3bc36b42","score":"0.6538517","text":"function mouseUp(e) {\n dragok = false;\n if (target != null) {\n target.unDrag();\n }\n }","title":""},{"docid":"e4eda4e0d15df20e2b9a9279a4f1b3f5","score":"0.6537797","text":"removeDragOver(dragOverEvent) {\n this._removeEvent(dragOverEvent, this.dragOverEvents);\n }","title":""},{"docid":"d142f9eec98db0ce1705eb3f7a519295","score":"0.6536569","text":"_onMouseLeave(evt) {\n if (!this._allowDrag || !this._dragging) return;\n\n this._dragOverItem = null;\n this._updateDragHandle();\n }","title":""},{"docid":"adf8b880b3ed309fc133ce3cc430fb26","score":"0.6534266","text":"function handleDragOver(event){\n event.preventDefault();\n}","title":""},{"docid":"7e039d3b8c479b0462adff64e00d9673","score":"0.65334845","text":"_onChildDragOver(evt, element) {\n if (!this._allowDrag || !this._dragging) return;\n\n if (element.allowDrop && this._dragItems.indexOf(element) === -1) {\n this._dragOverItem = element;\n } else {\n this._dragOverItem = null;\n }\n\n this._updateDragHandle();\n this._onDragMove(evt);\n }","title":""},{"docid":"0efadb384aa2d75b70c6a052196ffe72","score":"0.65288705","text":"handleDragOver(event) {\n event.preventDefault();\n }","title":""},{"docid":"87a5295db69290ddf7319578fa797214","score":"0.6528662","text":"postDrop(element) {\n this.currentDraggedElement.setAttribute('aria-grabbed', false);\n this.currentDraggedElement = null;\n }","title":""},{"docid":"11a3709b855aeb45ea66073e29b38f1d","score":"0.65258473","text":"function handleDragOver(ev) {\n if (ev.preventDefault) {\n ev.preventDefault();\n }\n ev.dataTransfer.dropEffect = 'move';\n return true;\n }","title":""},{"docid":"9eece3119333725182ea06891e609a46","score":"0.65207","text":"function dragOverHelperFunction(ev){\n\n ev.preventDefault();\n\n}","title":""},{"docid":"1f870e48c8da0d1ea2bd6301c180df99","score":"0.6486635","text":"handleDraggableDragLeave() {\n this.dropzoneElement = null;\n }","title":""},{"docid":"8e84746d029dac8a7f135651f2d64f7f","score":"0.6474049","text":"function _onDragOver(evt) {\n evt.preventDefault();\n }","title":""},{"docid":"ce1ab9c6add32f9d43c97e65e7234984","score":"0.6470983","text":"function dragOver(ev) {\n ev.preventDefault();\n let messageToUpdate = {\n dropTargetOn: ev.target.id,\n };\n currentState = update(messageToUpdate, currentState);\n viewUpdate(currentState);\n}","title":""},{"docid":"e9f10bafd0019694f3d661473af08e98","score":"0.6463714","text":"_onMouseLeave(evt) {\n if (!this._allowDrag || !this._dragging) return;\n\n this._dragOverItem = null;\n this._updateDragHandle();\n }","title":""},{"docid":"60ec49e658cfaf1b41a917d26a669711","score":"0.6415572","text":"function dragOverOverflow (event) {\n if (event.dataTransfer.getData('text') < (this._table.rows.length-1)) {\n event.preventDefault(); // Necessary. Allows us to drop.\n \n event.dataTransfer.dropEffect = 'move';\n }\n else\n event.dataTransfer.dropEffect = 'none';\n }","title":""},{"docid":"a7263cbcd64604ec5efb87389ef2e21f","score":"0.64124405","text":"handleDragEnd(event) {\n // this/e.target is the source node.\n event.target.classList.remove('over');\n }","title":""},{"docid":"96843ba98694628e73a69f350b9cd1d9","score":"0.6407588","text":"function dragend_handler(ev) { }","title":""},{"docid":"2248f59f1970a8b8b8d392c76c8c464e","score":"0.6406434","text":"function dragOver() {\n console.log('DRAGOVER');\n fireMouseEvent('dragover', elemDrop, dragStartEvent.dataTransfer);\n }","title":""},{"docid":"44b22ab7abb8b7aeab1ce88e88d83941","score":"0.63954407","text":"notPressed(x, y) {\n this.dragging = false\n }","title":""},{"docid":"43ba5ed980278b13782278657a25f8ca","score":"0.6390033","text":"function dragLeave(e) { \n \n\n\t}","title":""},{"docid":"4aa7886565347c249e7c9c44da45ab1f","score":"0.6388651","text":"onDragOver(event) {\n this.preventAndStopEventPropagation(event);\n if (!this.isOver && !this.disabled) {\n this.isOver = true;\n this.itemDragOver.emit();\n }\n }","title":""},{"docid":"83135e4dcefde56881bf19a32bb921e0","score":"0.63798857","text":"function onPointerOut() {\n\t\tonPanCancel()\n\t}","title":""},{"docid":"10384f6989709264569ff28b3cce7000","score":"0.63797474","text":"function dragOver(e) { \n\n\t\t// Obtenemos el valor objeto del contenedor sobre el que se posa el objeto arrastrable\n\t\tobjContenedor = this;\n \n if (!posicionOK()) return;\n\n\t\t// El cursor del navegador indica el tipo de operación que se va a realizar\n\t\te.dataTransfer.dropEffect = 'move';\n\n\t\t// Necesario para dejar caer el objeto arrastrado\n\t\tif(e.preventDefault)\n\t\t\te.preventDefault();\n\n\t}","title":""},{"docid":"43a8004b5f9b382f708f374b44e74cca","score":"0.6379503","text":"function mouseUp() {\n lastPos = null;\n $(handle.ownerDocument)\n .off('mouseup', mouseUp)\n .off('mousemove', mouseMove);\n }","title":""},{"docid":"10e7ea0dd3296ad68d37f03360341787","score":"0.6359505","text":"mouseReleased() {\n if (this.isMoving) {\n this.isMoving = false;\n }\n\n }","title":""},{"docid":"ffbee94eef75ebc1d287f1e1937bca48","score":"0.6348307","text":"function onMouseUp(e) {\n\t\t\t\t\t\tdragging = offset = null;\n\t\t\t\t\t\tstartPoint = undefined;\n\t\t\t\t\t\tgrapher.off('mousemove');\n\t\t\t\t\t\tgrapher.off('mouseup');\n\t\t\t\t\t}","title":""},{"docid":"80f3cdc0e1e7646c9f2e83b560dae551","score":"0.63413244","text":"function handleDragOverAbort(evt) {\n evt.preventDefault();\n evt.dataTransfer.dropEffect = 'none'; // nice cursor\n return false;\n}","title":""},{"docid":"407786f3d27c1281377c6ed270fa266f","score":"0.6335779","text":"function handleDragOver(e) \n{\n\n //WARNING: You must have this if statement or the drop event will not be called.\n if (e.preventDefault) e.preventDefault();\n\n e.dataTransfer.dropEffect = 'move'; \n\n return false;\n}","title":""},{"docid":"b34bf5ace7f18ce711bd7a1cdfc75d58","score":"0.6297415","text":"dragOver(e) {\n e.preventDefault();\n this.dragged.style.display = \"none\";\n if (e.target.className === 'placeholder') return;\n this.over = e.target;\n e.target.parentNode.insertBefore(placeholder, e.target);\n }","title":""},{"docid":"5e174a959b2f912a8a6951c0181aa916","score":"0.6291059","text":"function dragMouseOut(e) {\r\n\t$dragableElement = getDragableElement($(e.target));\r\n\tif( $dragableElement != undefined ) {\r\n\t\t//remove the red border of the hovered element\r\n\t\t$dragableElement.css(\"border\", \"0\");\r\n\t}\r\n\t\r\n\tif($draggedElement != undefined) {\r\n\t\t//add green border on the currently dragged element\r\n\t\t$draggedElement.css(\"border\", \"1px solid #00FF00\");\r\n\t}\r\n}","title":""},{"docid":"12e94dc38d483ce824cbc9a5c634890a","score":"0.6286048","text":"dragend(){\r\n if ( this.removable ){\r\n this.visibleBin = false;\r\n this.draggedIdx = -1;\r\n }\r\n }","title":""},{"docid":"3240836ee366b65856c3e72ef25548d6","score":"0.6269718","text":"function dragover(e) {\n e.preventDefault();\n}","title":""},{"docid":"2ee9759f5e0e9e142bccd9233ef99905","score":"0.6260848","text":"function handleDragOver(evt) {\n // Stop the default browser behavior\n evt.stopPropagation();\n evt.preventDefault();\n dropZone.style('background','#AAAAAA');\n }","title":""},{"docid":"f8d3feebbc4f2662d5d9f92c6b2e055a","score":"0.6257968","text":"_dragOver(event) {\n let { preventDefault, listenElement } = this;\n\n /* Put mouse as a reference in the event. */\n event.mouse = this;\n\n /* Skip the default behaviours upon this event. */\n if (preventDefault === true) {\n event.preventDefault();\n }\n\n /* Update the mouse relative position. */\n let offsetPosition = getOffsetPosition(listenElement);\n\n this._updatePosition({\n x: event.clientX - offsetPosition.x,\n y: event.clientY - offsetPosition.y\n });\n\n /* Perform action for drag over event. */\n this._fireEvents(this.dragOverEvents, event);\n }","title":""},{"docid":"366eb893d832d375a2c16cf622538271","score":"0.6242163","text":"dragOver(e) {\n e.preventDefault();\n this.dragged.style.display = \"none\";\n if(e.target.className == \"placeholder\") return;\n this.over = e.target;\n // Inside the dragOver method, check if item need to be inserted above or below target element\n let relY = e.clientY - this.over.offsetTop;\n let height = this.over.offsetHeight / 2;\n let parent = e.target.parentNode;\n \n if(relY > height) {\n this.nodePlacement = \"after\";\n parent.insertBefore(placeholder, e.target.nextElementSibling);\n }\n else if(relY < height) {\n this.nodePlacement = \"before\"\n parent.insertBefore(placeholder, e.target);\n }\n }","title":""},{"docid":"990669f5e74e2b2dd5c4c3a03ad0e091","score":"0.6239243","text":"function makeUndraggable(element) {\n element.container.draggable = false;\n element.container.ondragstart = undefined;\n }","title":""},{"docid":"d945fd4ab06c6bdfcff89ffed92b5fb3","score":"0.6233623","text":"onMouseUp(e) {\n // we have finished dragging\n this.isMouseDown = false;\n\n // remove specific styles\n this.options.element.classList.remove(\"dragged\");\n\n // update our end position\n this.endPosition = this.currentPosition;\n\n // send our mouse/touch position to our hook\n let mousePosition = this.getMousePosition(e);\n\n // drag ended hook\n this.onDragEnded(mousePosition);\n }","title":""},{"docid":"8137c246c5c4ebaba2127dace752ff10","score":"0.6222913","text":"function dragOver(event) {\n\t\tevent.preventDefault();\n\t\tvar draggingItem = document.querySelector('.dragging');\n\t\tvar currIndex = parseInt(draggingItem.dataset.index);\n\t\tvar overIndex = parseInt(event.target.dataset.index);\n\t\tvar direction = currIndex > overIndex ? 'up' : 'down';\n\t\tif (draggingItem !== event.target && event.target.nodeName === 'LI') {\n\t\t\tif (direction === 'up') {\n\t\t\t\tevent.target.parentNode.insertBefore(draggingItem, event.target);\n\t\t\t} else {\n\t\t\t\tevent.target.parentNode.insertBefore(draggingItem, event.target.nextSibling);\n\t\t\t}\n\t\t\tupdateLinkOrder();\n\t\t}\n\t}","title":""},{"docid":"e8dfa8b76da569efe380e10858eb92c4","score":"0.6221499","text":"function _mouseUp() {\n _mdown = false;\n _dragging=false;\n //the dragged thing will be autodestroyed in 1/10 seconds...\n setTimeout(function() {_draggedThing=null;}, 100);\n }","title":""},{"docid":"94a1df94f8f1fc765591f60c178e3728","score":"0.6219619","text":"handleMouseup() {\n this._dragging = false;\n document.body.classList.remove('graph_dragging');\n }","title":""},{"docid":"d31d145b49def5dcd4ff4fcef8274f63","score":"0.6219429","text":"function CdkDragEnd() { }","title":""},{"docid":"d31d145b49def5dcd4ff4fcef8274f63","score":"0.6219429","text":"function CdkDragEnd() { }","title":""},{"docid":"9742ee60a9b7f9aad4c6a15784f5ca33","score":"0.61872303","text":"onDragLeave(event) {\n this.preventAndStopEventPropagation(event);\n if (this.isOver && this.isTrueLeave(event) && !this.disabled) {\n this.isOver = false;\n this.itemDragLeave.emit();\n }\n }","title":""},{"docid":"94962c5fe85f458fb1ce2130085b702f","score":"0.6186624","text":"function w_dragLeave(event, element)\n{\n\telement.style.borderColor = \"transparent\";\n\n\tevent.stopPropagation();\n\tevent.preventDefault();\n}","title":""},{"docid":"6125ca14d69f406cc3b444e515352139","score":"0.6176918","text":"function dragstop()\r\n{\r\n dragobject = null;\r\n dragging = false;\r\n}","title":""},{"docid":"c22b7643eb6f22599579160f7a4e32b8","score":"0.61692095","text":"function dragLeave(e){\n\te.stopPropagation();\n\te.preventDefault();\n\tta.style.background = \"\";\n}","title":""},{"docid":"27edb25c705f824651476067490f01b9","score":"0.61563456","text":"function mouseUp() {\n if (!isDragging) {\n return;\n }\n\n isDragging = false;\n onChangeCallback();\n }","title":""},{"docid":"4e07f0c10479ccb46e94e6b354615617","score":"0.6142881","text":"onDragStop(ev) {\n if (!ev.data.originalSource)\n return;\n if (ev.data.originalSource.parentElement === this.domDel)\n this.remove(ev.data.originalSource);\n else\n this.update();\n }","title":""},{"docid":"09d2f5f782d75f12e619f0f7ca6e4e55","score":"0.6138968","text":"function $cleanDragFix() {\n if ($tmpWinMouseMoveListener != null &&\n $pointerPressedEvents[LMOUSE] == null &&\n $pointerPressedEvents[RMOUSE] == null )\n {\n window.removeEventListener(\"mousemove\", $tmpWinMouseMoveListener, true);\n $tmpWinMouseMoveListener = null;\n return true;\n }\n return false;\n}","title":""},{"docid":"cabe6898f3a12cdd10882da63af623b3","score":"0.61373013","text":"function handleDragLeave(e)\r\n {\r\n this.classList.remove('over');\r\n }","title":""},{"docid":"5c6d774ad739fccd0b34120989a0e1bb","score":"0.61365163","text":"function CdkDragExit() { }","title":""},{"docid":"5c6d774ad739fccd0b34120989a0e1bb","score":"0.61365163","text":"function CdkDragExit() { }","title":""},{"docid":"d42bab4546c9008de9e95b600c3b8eed","score":"0.61325294","text":"function stop_drag(e){\nismoving=false;\n\ntry{\ndocument.removeEventListener('mousemove',drag_moving,false);\ndocument.removeEventListener('mouseup', stop_drag ,false);\n}\ncatch(e){ //error but blah cbf putting in error checking :P}\n\n}\n}","title":""},{"docid":"e0c300c927da8da8bf37c7a85bcdf60d","score":"0.61118054","text":"_dragLeave(e) {\n this._setDropzone(false);\n }","title":""},{"docid":"89d81cb697c41832a6dea601535f620b","score":"0.6107622","text":"function handleDragOver(evt) {\r\n if (pictureOn === false) {\r\n pictureOn = true;\r\n src.removeChild(tableHeaders);\r\n src.removeChild(intTable);\r\n src.removeChild(myFlightHeader);\r\n src.appendChild(img);\r\n }\r\n evt.stopPropagation();\r\n evt.preventDefault();\r\n evt.dataTransfer.dropEffect = \"copy\";\r\n }","title":""},{"docid":"ec80b7c411f5db9326cb2cef97d5a1b8","score":"0.6103861","text":"evtDragLeave(event) {\n event.preventDefault();\n event.stopPropagation();\n const dropTarget = DOMUtils.findElement(this.node, DROP_TARGET_CLASS);\n if (dropTarget) {\n dropTarget.classList.remove(DROP_TARGET_CLASS);\n }\n }","title":""},{"docid":"fe8802fda5d84eaf7710f08ce27b548a","score":"0.6098082","text":"function CdkDragEnter() { }","title":""},{"docid":"fe8802fda5d84eaf7710f08ce27b548a","score":"0.6098082","text":"function CdkDragEnter() { }","title":""},{"docid":"bd4bedfb51c6e68265fba6ee246be7fe","score":"0.6094111","text":"function drop(e){\r\n //Remove the listneres since nothing is being dragged\r\n document.onmousemove = null;\r\n document.onmouseup = null;\r\n\r\n //If we are not dragging the piece to the home area\r\n if(pieceDrop != null){\r\n //Swapping the x and y of each variable \r\n var tmp = {xPos:pieceCurrent.xPos,yPos:pieceCurrent.yPos};\r\n pieceCurrent.xPos = pieceDrop.xPos;\r\n pieceCurrent.yPos = pieceDrop.yPos;\r\n pieceDrop.xPos = tmp.xPos;\r\n pieceDrop.yPos = tmp.yPos;\r\n }\r\n //Simultaneously, we check if the game has been won\r\n reset();\r\n}","title":""},{"docid":"0fae25517c7d5fe599304fac92441ca3","score":"0.60709345","text":"function handleDragLeave(e) \n{\n this.classList.remove('over');\n}","title":""},{"docid":"021a237e78db3135f8c552e1b742b378","score":"0.6069294","text":"function onStopDrag(e, position) {\n let overlappingItem = Object.values(boxes).filter(item => item.id !== props.boxId).find(item => item.x === position.lastX && item.y === position.lastY);\n if(overlappingItem !== undefined) {\n setX(null);\n setX(x);\n store.dispatch(boxDragged(props.boxId, x, y));\n } else {\n setX(position.lastX);\n setY(position.lastY);\n }\n }","title":""},{"docid":"aa2f390db214cb854b6bd189ef75aec4","score":"0.6069254","text":"function dragExceeded(data,event){var dx=Math.abs(event.clientX-data.pressX);var dy=Math.abs(event.clientY-data.pressY);return dx>=Private.DRAG_THRESHOLD||dy>=Private.DRAG_THRESHOLD;}","title":""},{"docid":"3ca31377f7abbb704af733c6abc82b78","score":"0.60559744","text":"function mouseDragged() {\n //prevent default\n\n return false;\n\n}","title":""},{"docid":"ba29778f718281b81e835cd2579dfeb5","score":"0.6055238","text":"function dropZoneDragLeave(e)\n {\n // we use a timeout here as this removes flickering\n $.doTimeout(overlayTimeoutId, DRAG_LEAVE_DELAY, function ()\n {\n $overlay.removeClass(\"ilFileDragOver\");\n });\n }","title":""},{"docid":"9a1e56fe253341968d872db22bbf2314","score":"0.6055206","text":"onDragOver(eventObj, index /* , type, external */) {\n // disable dropping at index zero because here the mighty placeholder for date shifting lives\n return index !== 0;\n }","title":""},{"docid":"3ee435b7a2d05891f8ede7b50ed483dc","score":"0.6042235","text":"resetDragged () {\n this.$element_.css('position', '')\n }","title":""},{"docid":"3916c33238981362b54b5e3d4f9af9c3","score":"0.60373133","text":"function dragEnded(event) {\n if(sticky == null){\n return;\n }\n \n moveSticky(event);\n \n sticky = null;\n}","title":""},{"docid":"fba6b5eba11a71dd33632af57d1345e5","score":"0.6036823","text":"evtDragOver(event) {\n event.preventDefault();\n event.stopPropagation();\n event.dropAction = event.proposedAction;\n const dropTarget = DOMUtils.findElement(this.node, DROP_TARGET_CLASS);\n if (dropTarget) {\n dropTarget.classList.remove(DROP_TARGET_CLASS);\n }\n const index = Private.hitTestNodes(this._items, event);\n this._items[index].classList.add(DROP_TARGET_CLASS);\n }","title":""},{"docid":"9d181e64a62219154663459b34d6f82a","score":"0.6036809","text":"static mouseReleased() {\n Drag.selected = null;\n }","title":""},{"docid":"27f59d8ffef7a1bb4691fa6987556000","score":"0.6030104","text":"function mouseDragged() {}","title":""},{"docid":"e1c638254b47c5bd50d074cdc47b1201","score":"0.602243","text":"cancelDrag() {\n if (this.proxy) {\n document.body.removeEventListener('mousemove', this.mouseMove);\n document.body.removeEventListener('mouseup', this.mouseUp);\n this.proxy.parentElement.removeChild(this.proxy);\n this.proxy = null;\n this.payload = null;\n this.lastTarget = null;\n }\n }","title":""},{"docid":"65381a17bf8b6364d7d705a01f294502","score":"0.60181785","text":"function drop(cnv) {\n var cnv = document.getElementById('main');\n cnv.removeEventListener('mousemove',move,false);\n cnv.removeEventListener('mouseup',drop,false);\n cnv.style.cursor = \"crosshair\";\n}","title":""},{"docid":"484182aaadc0dda8b2b872cbd09661ca","score":"0.60130334","text":"function mouseUp(evt)\n{\n\tif(evt.which == 1)\n\t{\n\t\tisDragging = false;\n\t}\n}","title":""},{"docid":"47a5dd576b8d7eafaf5b0e8830970fc3","score":"0.6010925","text":"onMouseUp(evt) {\n invariant(this.proxy, 'not expecting mouse events when not dragging');\n const globalPosition = this.mouseToGlobal(evt);\n const target = this.findTargetAt(globalPosition);\n if (target && target.options && target.options.drop) {\n target.options.drop.call(this, globalPosition, this.payload);\n }\n // ensure lastTarget gets a dragLeave incase they rely on it for cleanup\n if (this.lastTarget && this.lastTarget.options.dragLeave) {\n this.lastTarget.options.dragLeave.call(this);\n }\n\n this.cancelDrag();\n }","title":""},{"docid":"05656d5016ecaa530e89e84b82819747","score":"0.6009622","text":"handleDragLeave(evt) {\n const el = this.shadowRoot.getElementById(\"drop_zone\");\n\n if (el) {\n el.style.borderWidth = \"0px\";\n }\n\n const hint = this.shadowRoot.getElementById(\"drop_hint\");\n\n if (hint) {\n hint.style.display = \"none\";\n }\n\n if (evt) {\n evt.stopPropagation();\n evt.preventDefault();\n }\n }","title":""},{"docid":"ae1094d66a658086e2d45abe8d9cb215","score":"0.60087997","text":"function handleUp(e) {\n mouseD = false;\n mouseM = false;\n oldY = 0;\n // y = 0;\n\n if (!mouseD) {\n dragBar.removeEventListener('mousemove', handleMove)\n }\n}","title":""},{"docid":"5b839d12ad27ca8d7d8a04bd4e74cc2b","score":"0.59824353","text":"cancelDrag() {\n if (this.proxy) {\n document.body.removeEventListener('mousemove', this.mouseMove);\n document.body.removeEventListener('mouseup', this.mouseUp);\n this.proxy.parentElement.removeChild(this.proxy);\n this.proxy = null;\n this.payload = null;\n this.lastTarget = null;\n this.lastMonitor = new Set();\n document.body.classList.remove('prevent-selection');\n }\n }","title":""},{"docid":"b7fba4dc5027f838471e1f5a265441cd","score":"0.5981188","text":"function out() {\n if (canBeMoved(this) !== null) {\n this.style.borderColor = \"black\";\n this.style.cursor = \"default\";\n }\n }","title":""},{"docid":"44fbbe78a6f5210a690ce6f177e21887","score":"0.59751284","text":"function onDragEnd() {\r\n drag = null;\r\n pointX = null;\r\n pointY = null;\r\n}","title":""},{"docid":"c1e63267bba3871cb35d3b052099f1da","score":"0.5972657","text":"function drag(e) {\r\n\tif($draggedElement != undefined) {\r\n\t\t//move the currently dragged element\r\n\t\t$draggedElement.css(\"left\",(dragElementOffsetX + e.clientX + /*mouseStartDragX*/ + 5) + 'px');\r\n\t\t$draggedElement.css(\"top\",(dragElementOffsetY + e.clientY - mouseStartDragY) + 'px');\r\n\t\t\r\n\t\t//keep the green highlight\r\n\t\t$dragableElement.css(\"border\", \"1px solid #00FF00\");\r\n\t\t\r\n\t\t//determine if mouse is over a drop target, to properly change the cursor state\r\n\t\tvar dropTarget = getDropTarget(e.clientX, e.clientY);\r\n\t\tif(dropTarget != undefined) {\r\n\t\t\t$(\"#overlay\").css(\"cursor\", \"default\");\r\n\t\t}\r\n\t\telse {\r\n\t\t\t$(\"#overlay\").css(\"cursor\", \"no-drop\");\t\t\t\r\n\t\t}\r\n\t\t\r\n\t}\r\n}","title":""},{"docid":"04854118d0b683ddc19c11dfdabdd683","score":"0.5959983","text":"function handleDragOver(e)\r\n {\r\n if (e.preventDefault)\r\n {\r\n e.preventDefault();\r\n ///Evento en donde se deben obtener las coordenadas///\r\n }\r\n e.dataTransfer.dropEffect = 'copy';\r\n return false;\r\n }","title":""},{"docid":"b7fb95e559c1f2dfaac7c3ee1ba522dc","score":"0.5952431","text":"function onDocumentDragOver(evt) {\n evt.preventDefault();\n}","title":""},{"docid":"b7fb95e559c1f2dfaac7c3ee1ba522dc","score":"0.5952431","text":"function onDocumentDragOver(evt) {\n evt.preventDefault();\n}","title":""},{"docid":"b7fb95e559c1f2dfaac7c3ee1ba522dc","score":"0.5952431","text":"function onDocumentDragOver(evt) {\n evt.preventDefault();\n}","title":""},{"docid":"b7fb95e559c1f2dfaac7c3ee1ba522dc","score":"0.5952431","text":"function onDocumentDragOver(evt) {\n evt.preventDefault();\n}","title":""},{"docid":"b7fb95e559c1f2dfaac7c3ee1ba522dc","score":"0.5952431","text":"function onDocumentDragOver(evt) {\n evt.preventDefault();\n}","title":""}],"string":"[\n {\n \"docid\": \"9f6cade4ec8489708c8d2880a4511b37\",\n \"score\": \"0.70727825\",\n \"text\": \"function stopDragover() {\\n placeholder.remove();\\n element.removeClass(\\\"dndDragover\\\");\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a8b6f436c0c5c9bf8a8dc172943fe45\",\n \"score\": \"0.6992945\",\n \"text\": \"function stopDragover() {\\n placeholder.remove();\\n element.removeClass(\\\"dndDragover\\\");\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a8b6f436c0c5c9bf8a8dc172943fe45\",\n \"score\": \"0.6992945\",\n \"text\": \"function stopDragover() {\\n placeholder.remove();\\n element.removeClass(\\\"dndDragover\\\");\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb4d4e5f2be2ffc51f0cfd28c487ba7b\",\n \"score\": \"0.6974002\",\n \"text\": \"function stopDragover() {\\n placeholder.remove();\\n element.removeClass('dndDragover');\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c00571fcf84c2b47d0666c4a6d623a82\",\n \"score\": \"0.673683\",\n \"text\": \"function onMouseUp()\\n{\\n document.removeEventListener(getMouseMove(), onMouseMove); //stop drag\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0fa273a594f118b76e71ed4ace5240b\",\n \"score\": \"0.6631138\",\n \"text\": \"clearDragOver() {\\n this._clearEvent(this.dragOverEvents);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3717ae30a7c7bbfb0e3503d8a5da8ecb\",\n \"score\": \"0.66038203\",\n \"text\": \"function draggingOver(event) {\\n event.preventDefault();\\n // console.log(event.target)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5a8cfeea91435e9ce9d6acf909aff33\",\n \"score\": \"0.6595426\",\n \"text\": \"function mouseReleased() {\\n dragging = false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea4b225eec39109ec715540254cd3c9c\",\n \"score\": \"0.6592969\",\n \"text\": \"function dragOver(e) {\\n // console.log('Event:', 'dragover');\\n e.preventDefault();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85f8c44d854bf3b66d7b12d5b1427881\",\n \"score\": \"0.65906394\",\n \"text\": \"onMouseUp(event) {\\r\\n this.isDragging = false;\\r\\n this.isPanning = false;\\r\\n if (this.layout && typeof this.layout !== 'string' && this.layout.onDragEnd) {\\r\\n this.layout.onDragEnd(this.draggingNode, event);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71c86dde907b22de5e35ffb50ac73fd4\",\n \"score\": \"0.6590283\",\n \"text\": \"function dragOver(event) {\\n event.preventDefault();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1649489363a429d8b27da7faf71d8315\",\n \"score\": \"0.6561757\",\n \"text\": \"handleDragOver(event) {\\n event.preventDefault();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f68cd4ce15976da2006c6103e5af152\",\n \"score\": \"0.6552457\",\n \"text\": \"function OnMouseUp(e)\\n{\\n if (dragElement != null)\\n {\\n dragElement.style.zIndex = oldZIndex;\\n document.onmousemove = null;\\n dragElement = null;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1203c1a425d95d62769416e185d281a1\",\n \"score\": \"0.65521634\",\n \"text\": \"function dragOver(e) {\\n e.preventDefault();\\n //console.log('over');\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a883cc5d1d36071f8864615f33a0b2e\",\n \"score\": \"0.65491474\",\n \"text\": \"_onChildDragOver(evt, element) {\\n if (!this._allowDrag || !this._dragging) return;\\n\\n if (element.allowDrop && this._dragItems.indexOf(element) === -1) {\\n this._dragOverItem = element;\\n } else {\\n this._dragOverItem = null;\\n }\\n\\n this._updateDragHandle();\\n this._onDragMove(evt);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"774af1bbd2ff8524a450cd8e3bc36b42\",\n \"score\": \"0.6538517\",\n \"text\": \"function mouseUp(e) {\\n dragok = false;\\n if (target != null) {\\n target.unDrag();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4eda4e0d15df20e2b9a9279a4f1b3f5\",\n \"score\": \"0.6537797\",\n \"text\": \"removeDragOver(dragOverEvent) {\\n this._removeEvent(dragOverEvent, this.dragOverEvents);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d142f9eec98db0ce1705eb3f7a519295\",\n \"score\": \"0.6536569\",\n \"text\": \"_onMouseLeave(evt) {\\n if (!this._allowDrag || !this._dragging) return;\\n\\n this._dragOverItem = null;\\n this._updateDragHandle();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"adf8b880b3ed309fc133ce3cc430fb26\",\n \"score\": \"0.6534266\",\n \"text\": \"function handleDragOver(event){\\n event.preventDefault();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e039d3b8c479b0462adff64e00d9673\",\n \"score\": \"0.65334845\",\n \"text\": \"_onChildDragOver(evt, element) {\\n if (!this._allowDrag || !this._dragging) return;\\n\\n if (element.allowDrop && this._dragItems.indexOf(element) === -1) {\\n this._dragOverItem = element;\\n } else {\\n this._dragOverItem = null;\\n }\\n\\n this._updateDragHandle();\\n this._onDragMove(evt);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0efadb384aa2d75b70c6a052196ffe72\",\n \"score\": \"0.65288705\",\n \"text\": \"handleDragOver(event) {\\n event.preventDefault();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87a5295db69290ddf7319578fa797214\",\n \"score\": \"0.6528662\",\n \"text\": \"postDrop(element) {\\n this.currentDraggedElement.setAttribute('aria-grabbed', false);\\n this.currentDraggedElement = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11a3709b855aeb45ea66073e29b38f1d\",\n \"score\": \"0.65258473\",\n \"text\": \"function handleDragOver(ev) {\\n if (ev.preventDefault) {\\n ev.preventDefault();\\n }\\n ev.dataTransfer.dropEffect = 'move';\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eece3119333725182ea06891e609a46\",\n \"score\": \"0.65207\",\n \"text\": \"function dragOverHelperFunction(ev){\\n\\n ev.preventDefault();\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f870e48c8da0d1ea2bd6301c180df99\",\n \"score\": \"0.6486635\",\n \"text\": \"handleDraggableDragLeave() {\\n this.dropzoneElement = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e84746d029dac8a7f135651f2d64f7f\",\n \"score\": \"0.6474049\",\n \"text\": \"function _onDragOver(evt) {\\n evt.preventDefault();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce1ab9c6add32f9d43c97e65e7234984\",\n \"score\": \"0.6470983\",\n \"text\": \"function dragOver(ev) {\\n ev.preventDefault();\\n let messageToUpdate = {\\n dropTargetOn: ev.target.id,\\n };\\n currentState = update(messageToUpdate, currentState);\\n viewUpdate(currentState);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9f10bafd0019694f3d661473af08e98\",\n \"score\": \"0.6463714\",\n \"text\": \"_onMouseLeave(evt) {\\n if (!this._allowDrag || !this._dragging) return;\\n\\n this._dragOverItem = null;\\n this._updateDragHandle();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60ec49e658cfaf1b41a917d26a669711\",\n \"score\": \"0.6415572\",\n \"text\": \"function dragOverOverflow (event) {\\n if (event.dataTransfer.getData('text') < (this._table.rows.length-1)) {\\n event.preventDefault(); // Necessary. Allows us to drop.\\n \\n event.dataTransfer.dropEffect = 'move';\\n }\\n else\\n event.dataTransfer.dropEffect = 'none';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7263cbcd64604ec5efb87389ef2e21f\",\n \"score\": \"0.64124405\",\n \"text\": \"handleDragEnd(event) {\\n // this/e.target is the source node.\\n event.target.classList.remove('over');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96843ba98694628e73a69f350b9cd1d9\",\n \"score\": \"0.6407588\",\n \"text\": \"function dragend_handler(ev) { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2248f59f1970a8b8b8d392c76c8c464e\",\n \"score\": \"0.6406434\",\n \"text\": \"function dragOver() {\\n console.log('DRAGOVER');\\n fireMouseEvent('dragover', elemDrop, dragStartEvent.dataTransfer);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44b22ab7abb8b7aeab1ce88e88d83941\",\n \"score\": \"0.63954407\",\n \"text\": \"notPressed(x, y) {\\n this.dragging = false\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43ba5ed980278b13782278657a25f8ca\",\n \"score\": \"0.6390033\",\n \"text\": \"function dragLeave(e) { \\n \\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4aa7886565347c249e7c9c44da45ab1f\",\n \"score\": \"0.6388651\",\n \"text\": \"onDragOver(event) {\\n this.preventAndStopEventPropagation(event);\\n if (!this.isOver && !this.disabled) {\\n this.isOver = true;\\n this.itemDragOver.emit();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83135e4dcefde56881bf19a32bb921e0\",\n \"score\": \"0.63798857\",\n \"text\": \"function onPointerOut() {\\n\\t\\tonPanCancel()\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10384f6989709264569ff28b3cce7000\",\n \"score\": \"0.63797474\",\n \"text\": \"function dragOver(e) { \\n\\n\\t\\t// Obtenemos el valor objeto del contenedor sobre el que se posa el objeto arrastrable\\n\\t\\tobjContenedor = this;\\n \\n if (!posicionOK()) return;\\n\\n\\t\\t// El cursor del navegador indica el tipo de operación que se va a realizar\\n\\t\\te.dataTransfer.dropEffect = 'move';\\n\\n\\t\\t// Necesario para dejar caer el objeto arrastrado\\n\\t\\tif(e.preventDefault)\\n\\t\\t\\te.preventDefault();\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43a8004b5f9b382f708f374b44e74cca\",\n \"score\": \"0.6379503\",\n \"text\": \"function mouseUp() {\\n lastPos = null;\\n $(handle.ownerDocument)\\n .off('mouseup', mouseUp)\\n .off('mousemove', mouseMove);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10e7ea0dd3296ad68d37f03360341787\",\n \"score\": \"0.6359505\",\n \"text\": \"mouseReleased() {\\n if (this.isMoving) {\\n this.isMoving = false;\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffbee94eef75ebc1d287f1e1937bca48\",\n \"score\": \"0.6348307\",\n \"text\": \"function onMouseUp(e) {\\n\\t\\t\\t\\t\\t\\tdragging = offset = null;\\n\\t\\t\\t\\t\\t\\tstartPoint = undefined;\\n\\t\\t\\t\\t\\t\\tgrapher.off('mousemove');\\n\\t\\t\\t\\t\\t\\tgrapher.off('mouseup');\\n\\t\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80f3cdc0e1e7646c9f2e83b560dae551\",\n \"score\": \"0.63413244\",\n \"text\": \"function handleDragOverAbort(evt) {\\n evt.preventDefault();\\n evt.dataTransfer.dropEffect = 'none'; // nice cursor\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"407786f3d27c1281377c6ed270fa266f\",\n \"score\": \"0.6335779\",\n \"text\": \"function handleDragOver(e) \\n{\\n\\n //WARNING: You must have this if statement or the drop event will not be called.\\n if (e.preventDefault) e.preventDefault();\\n\\n e.dataTransfer.dropEffect = 'move'; \\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b34bf5ace7f18ce711bd7a1cdfc75d58\",\n \"score\": \"0.6297415\",\n \"text\": \"dragOver(e) {\\n e.preventDefault();\\n this.dragged.style.display = \\\"none\\\";\\n if (e.target.className === 'placeholder') return;\\n this.over = e.target;\\n e.target.parentNode.insertBefore(placeholder, e.target);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e174a959b2f912a8a6951c0181aa916\",\n \"score\": \"0.6291059\",\n \"text\": \"function dragMouseOut(e) {\\r\\n\\t$dragableElement = getDragableElement($(e.target));\\r\\n\\tif( $dragableElement != undefined ) {\\r\\n\\t\\t//remove the red border of the hovered element\\r\\n\\t\\t$dragableElement.css(\\\"border\\\", \\\"0\\\");\\r\\n\\t}\\r\\n\\t\\r\\n\\tif($draggedElement != undefined) {\\r\\n\\t\\t//add green border on the currently dragged element\\r\\n\\t\\t$draggedElement.css(\\\"border\\\", \\\"1px solid #00FF00\\\");\\r\\n\\t}\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12e94dc38d483ce824cbc9a5c634890a\",\n \"score\": \"0.6286048\",\n \"text\": \"dragend(){\\r\\n if ( this.removable ){\\r\\n this.visibleBin = false;\\r\\n this.draggedIdx = -1;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3240836ee366b65856c3e72ef25548d6\",\n \"score\": \"0.6269718\",\n \"text\": \"function dragover(e) {\\n e.preventDefault();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ee9759f5e0e9e142bccd9233ef99905\",\n \"score\": \"0.6260848\",\n \"text\": \"function handleDragOver(evt) {\\n // Stop the default browser behavior\\n evt.stopPropagation();\\n evt.preventDefault();\\n dropZone.style('background','#AAAAAA');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8d3feebbc4f2662d5d9f92c6b2e055a\",\n \"score\": \"0.6257968\",\n \"text\": \"_dragOver(event) {\\n let { preventDefault, listenElement } = this;\\n\\n /* Put mouse as a reference in the event. */\\n event.mouse = this;\\n\\n /* Skip the default behaviours upon this event. */\\n if (preventDefault === true) {\\n event.preventDefault();\\n }\\n\\n /* Update the mouse relative position. */\\n let offsetPosition = getOffsetPosition(listenElement);\\n\\n this._updatePosition({\\n x: event.clientX - offsetPosition.x,\\n y: event.clientY - offsetPosition.y\\n });\\n\\n /* Perform action for drag over event. */\\n this._fireEvents(this.dragOverEvents, event);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"366eb893d832d375a2c16cf622538271\",\n \"score\": \"0.6242163\",\n \"text\": \"dragOver(e) {\\n e.preventDefault();\\n this.dragged.style.display = \\\"none\\\";\\n if(e.target.className == \\\"placeholder\\\") return;\\n this.over = e.target;\\n // Inside the dragOver method, check if item need to be inserted above or below target element\\n let relY = e.clientY - this.over.offsetTop;\\n let height = this.over.offsetHeight / 2;\\n let parent = e.target.parentNode;\\n \\n if(relY > height) {\\n this.nodePlacement = \\\"after\\\";\\n parent.insertBefore(placeholder, e.target.nextElementSibling);\\n }\\n else if(relY < height) {\\n this.nodePlacement = \\\"before\\\"\\n parent.insertBefore(placeholder, e.target);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"990669f5e74e2b2dd5c4c3a03ad0e091\",\n \"score\": \"0.6239243\",\n \"text\": \"function makeUndraggable(element) {\\n element.container.draggable = false;\\n element.container.ondragstart = undefined;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d945fd4ab06c6bdfcff89ffed92b5fb3\",\n \"score\": \"0.6233623\",\n \"text\": \"onMouseUp(e) {\\n // we have finished dragging\\n this.isMouseDown = false;\\n\\n // remove specific styles\\n this.options.element.classList.remove(\\\"dragged\\\");\\n\\n // update our end position\\n this.endPosition = this.currentPosition;\\n\\n // send our mouse/touch position to our hook\\n let mousePosition = this.getMousePosition(e);\\n\\n // drag ended hook\\n this.onDragEnded(mousePosition);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8137c246c5c4ebaba2127dace752ff10\",\n \"score\": \"0.6222913\",\n \"text\": \"function dragOver(event) {\\n\\t\\tevent.preventDefault();\\n\\t\\tvar draggingItem = document.querySelector('.dragging');\\n\\t\\tvar currIndex = parseInt(draggingItem.dataset.index);\\n\\t\\tvar overIndex = parseInt(event.target.dataset.index);\\n\\t\\tvar direction = currIndex > overIndex ? 'up' : 'down';\\n\\t\\tif (draggingItem !== event.target && event.target.nodeName === 'LI') {\\n\\t\\t\\tif (direction === 'up') {\\n\\t\\t\\t\\tevent.target.parentNode.insertBefore(draggingItem, event.target);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tevent.target.parentNode.insertBefore(draggingItem, event.target.nextSibling);\\n\\t\\t\\t}\\n\\t\\t\\tupdateLinkOrder();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8dfa8b76da569efe380e10858eb92c4\",\n \"score\": \"0.6221499\",\n \"text\": \"function _mouseUp() {\\n _mdown = false;\\n _dragging=false;\\n //the dragged thing will be autodestroyed in 1/10 seconds...\\n setTimeout(function() {_draggedThing=null;}, 100);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"94a1df94f8f1fc765591f60c178e3728\",\n \"score\": \"0.6219619\",\n \"text\": \"handleMouseup() {\\n this._dragging = false;\\n document.body.classList.remove('graph_dragging');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d31d145b49def5dcd4ff4fcef8274f63\",\n \"score\": \"0.6219429\",\n \"text\": \"function CdkDragEnd() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d31d145b49def5dcd4ff4fcef8274f63\",\n \"score\": \"0.6219429\",\n \"text\": \"function CdkDragEnd() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9742ee60a9b7f9aad4c6a15784f5ca33\",\n \"score\": \"0.61872303\",\n \"text\": \"onDragLeave(event) {\\n this.preventAndStopEventPropagation(event);\\n if (this.isOver && this.isTrueLeave(event) && !this.disabled) {\\n this.isOver = false;\\n this.itemDragLeave.emit();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"94962c5fe85f458fb1ce2130085b702f\",\n \"score\": \"0.6186624\",\n \"text\": \"function w_dragLeave(event, element)\\n{\\n\\telement.style.borderColor = \\\"transparent\\\";\\n\\n\\tevent.stopPropagation();\\n\\tevent.preventDefault();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6125ca14d69f406cc3b444e515352139\",\n \"score\": \"0.6176918\",\n \"text\": \"function dragstop()\\r\\n{\\r\\n dragobject = null;\\r\\n dragging = false;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c22b7643eb6f22599579160f7a4e32b8\",\n \"score\": \"0.61692095\",\n \"text\": \"function dragLeave(e){\\n\\te.stopPropagation();\\n\\te.preventDefault();\\n\\tta.style.background = \\\"\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27edb25c705f824651476067490f01b9\",\n \"score\": \"0.61563456\",\n \"text\": \"function mouseUp() {\\n if (!isDragging) {\\n return;\\n }\\n\\n isDragging = false;\\n onChangeCallback();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e07f0c10479ccb46e94e6b354615617\",\n \"score\": \"0.6142881\",\n \"text\": \"onDragStop(ev) {\\n if (!ev.data.originalSource)\\n return;\\n if (ev.data.originalSource.parentElement === this.domDel)\\n this.remove(ev.data.originalSource);\\n else\\n this.update();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09d2f5f782d75f12e619f0f7ca6e4e55\",\n \"score\": \"0.6138968\",\n \"text\": \"function $cleanDragFix() {\\n if ($tmpWinMouseMoveListener != null &&\\n $pointerPressedEvents[LMOUSE] == null &&\\n $pointerPressedEvents[RMOUSE] == null )\\n {\\n window.removeEventListener(\\\"mousemove\\\", $tmpWinMouseMoveListener, true);\\n $tmpWinMouseMoveListener = null;\\n return true;\\n }\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cabe6898f3a12cdd10882da63af623b3\",\n \"score\": \"0.61373013\",\n \"text\": \"function handleDragLeave(e)\\r\\n {\\r\\n this.classList.remove('over');\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c6d774ad739fccd0b34120989a0e1bb\",\n \"score\": \"0.61365163\",\n \"text\": \"function CdkDragExit() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c6d774ad739fccd0b34120989a0e1bb\",\n \"score\": \"0.61365163\",\n \"text\": \"function CdkDragExit() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d42bab4546c9008de9e95b600c3b8eed\",\n \"score\": \"0.61325294\",\n \"text\": \"function stop_drag(e){\\nismoving=false;\\n\\ntry{\\ndocument.removeEventListener('mousemove',drag_moving,false);\\ndocument.removeEventListener('mouseup', stop_drag ,false);\\n}\\ncatch(e){ //error but blah cbf putting in error checking :P}\\n\\n}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0c300c927da8da8bf37c7a85bcdf60d\",\n \"score\": \"0.61118054\",\n \"text\": \"_dragLeave(e) {\\n this._setDropzone(false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89d81cb697c41832a6dea601535f620b\",\n \"score\": \"0.6107622\",\n \"text\": \"function handleDragOver(evt) {\\r\\n if (pictureOn === false) {\\r\\n pictureOn = true;\\r\\n src.removeChild(tableHeaders);\\r\\n src.removeChild(intTable);\\r\\n src.removeChild(myFlightHeader);\\r\\n src.appendChild(img);\\r\\n }\\r\\n evt.stopPropagation();\\r\\n evt.preventDefault();\\r\\n evt.dataTransfer.dropEffect = \\\"copy\\\";\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec80b7c411f5db9326cb2cef97d5a1b8\",\n \"score\": \"0.6103861\",\n \"text\": \"evtDragLeave(event) {\\n event.preventDefault();\\n event.stopPropagation();\\n const dropTarget = DOMUtils.findElement(this.node, DROP_TARGET_CLASS);\\n if (dropTarget) {\\n dropTarget.classList.remove(DROP_TARGET_CLASS);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe8802fda5d84eaf7710f08ce27b548a\",\n \"score\": \"0.6098082\",\n \"text\": \"function CdkDragEnter() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe8802fda5d84eaf7710f08ce27b548a\",\n \"score\": \"0.6098082\",\n \"text\": \"function CdkDragEnter() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd4bedfb51c6e68265fba6ee246be7fe\",\n \"score\": \"0.6094111\",\n \"text\": \"function drop(e){\\r\\n //Remove the listneres since nothing is being dragged\\r\\n document.onmousemove = null;\\r\\n document.onmouseup = null;\\r\\n\\r\\n //If we are not dragging the piece to the home area\\r\\n if(pieceDrop != null){\\r\\n //Swapping the x and y of each variable \\r\\n var tmp = {xPos:pieceCurrent.xPos,yPos:pieceCurrent.yPos};\\r\\n pieceCurrent.xPos = pieceDrop.xPos;\\r\\n pieceCurrent.yPos = pieceDrop.yPos;\\r\\n pieceDrop.xPos = tmp.xPos;\\r\\n pieceDrop.yPos = tmp.yPos;\\r\\n }\\r\\n //Simultaneously, we check if the game has been won\\r\\n reset();\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0fae25517c7d5fe599304fac92441ca3\",\n \"score\": \"0.60709345\",\n \"text\": \"function handleDragLeave(e) \\n{\\n this.classList.remove('over');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"021a237e78db3135f8c552e1b742b378\",\n \"score\": \"0.6069294\",\n \"text\": \"function onStopDrag(e, position) {\\n let overlappingItem = Object.values(boxes).filter(item => item.id !== props.boxId).find(item => item.x === position.lastX && item.y === position.lastY);\\n if(overlappingItem !== undefined) {\\n setX(null);\\n setX(x);\\n store.dispatch(boxDragged(props.boxId, x, y));\\n } else {\\n setX(position.lastX);\\n setY(position.lastY);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa2f390db214cb854b6bd189ef75aec4\",\n \"score\": \"0.6069254\",\n \"text\": \"function dragExceeded(data,event){var dx=Math.abs(event.clientX-data.pressX);var dy=Math.abs(event.clientY-data.pressY);return dx>=Private.DRAG_THRESHOLD||dy>=Private.DRAG_THRESHOLD;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ca31377f7abbb704af733c6abc82b78\",\n \"score\": \"0.60559744\",\n \"text\": \"function mouseDragged() {\\n //prevent default\\n\\n return false;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba29778f718281b81e835cd2579dfeb5\",\n \"score\": \"0.6055238\",\n \"text\": \"function dropZoneDragLeave(e)\\n {\\n // we use a timeout here as this removes flickering\\n $.doTimeout(overlayTimeoutId, DRAG_LEAVE_DELAY, function ()\\n {\\n $overlay.removeClass(\\\"ilFileDragOver\\\");\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a1e56fe253341968d872db22bbf2314\",\n \"score\": \"0.6055206\",\n \"text\": \"onDragOver(eventObj, index /* , type, external */) {\\n // disable dropping at index zero because here the mighty placeholder for date shifting lives\\n return index !== 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ee435b7a2d05891f8ede7b50ed483dc\",\n \"score\": \"0.6042235\",\n \"text\": \"resetDragged () {\\n this.$element_.css('position', '')\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3916c33238981362b54b5e3d4f9af9c3\",\n \"score\": \"0.60373133\",\n \"text\": \"function dragEnded(event) {\\n if(sticky == null){\\n return;\\n }\\n \\n moveSticky(event);\\n \\n sticky = null;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fba6b5eba11a71dd33632af57d1345e5\",\n \"score\": \"0.6036823\",\n \"text\": \"evtDragOver(event) {\\n event.preventDefault();\\n event.stopPropagation();\\n event.dropAction = event.proposedAction;\\n const dropTarget = DOMUtils.findElement(this.node, DROP_TARGET_CLASS);\\n if (dropTarget) {\\n dropTarget.classList.remove(DROP_TARGET_CLASS);\\n }\\n const index = Private.hitTestNodes(this._items, event);\\n this._items[index].classList.add(DROP_TARGET_CLASS);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d181e64a62219154663459b34d6f82a\",\n \"score\": \"0.6036809\",\n \"text\": \"static mouseReleased() {\\n Drag.selected = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27f59d8ffef7a1bb4691fa6987556000\",\n \"score\": \"0.6030104\",\n \"text\": \"function mouseDragged() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1c638254b47c5bd50d074cdc47b1201\",\n \"score\": \"0.602243\",\n \"text\": \"cancelDrag() {\\n if (this.proxy) {\\n document.body.removeEventListener('mousemove', this.mouseMove);\\n document.body.removeEventListener('mouseup', this.mouseUp);\\n this.proxy.parentElement.removeChild(this.proxy);\\n this.proxy = null;\\n this.payload = null;\\n this.lastTarget = null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65381a17bf8b6364d7d705a01f294502\",\n \"score\": \"0.60181785\",\n \"text\": \"function drop(cnv) {\\n var cnv = document.getElementById('main');\\n cnv.removeEventListener('mousemove',move,false);\\n cnv.removeEventListener('mouseup',drop,false);\\n cnv.style.cursor = \\\"crosshair\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"484182aaadc0dda8b2b872cbd09661ca\",\n \"score\": \"0.60130334\",\n \"text\": \"function mouseUp(evt)\\n{\\n\\tif(evt.which == 1)\\n\\t{\\n\\t\\tisDragging = false;\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a5dd576b8d7eafaf5b0e8830970fc3\",\n \"score\": \"0.6010925\",\n \"text\": \"onMouseUp(evt) {\\n invariant(this.proxy, 'not expecting mouse events when not dragging');\\n const globalPosition = this.mouseToGlobal(evt);\\n const target = this.findTargetAt(globalPosition);\\n if (target && target.options && target.options.drop) {\\n target.options.drop.call(this, globalPosition, this.payload);\\n }\\n // ensure lastTarget gets a dragLeave incase they rely on it for cleanup\\n if (this.lastTarget && this.lastTarget.options.dragLeave) {\\n this.lastTarget.options.dragLeave.call(this);\\n }\\n\\n this.cancelDrag();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05656d5016ecaa530e89e84b82819747\",\n \"score\": \"0.6009622\",\n \"text\": \"handleDragLeave(evt) {\\n const el = this.shadowRoot.getElementById(\\\"drop_zone\\\");\\n\\n if (el) {\\n el.style.borderWidth = \\\"0px\\\";\\n }\\n\\n const hint = this.shadowRoot.getElementById(\\\"drop_hint\\\");\\n\\n if (hint) {\\n hint.style.display = \\\"none\\\";\\n }\\n\\n if (evt) {\\n evt.stopPropagation();\\n evt.preventDefault();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae1094d66a658086e2d45abe8d9cb215\",\n \"score\": \"0.60087997\",\n \"text\": \"function handleUp(e) {\\n mouseD = false;\\n mouseM = false;\\n oldY = 0;\\n // y = 0;\\n\\n if (!mouseD) {\\n dragBar.removeEventListener('mousemove', handleMove)\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b839d12ad27ca8d7d8a04bd4e74cc2b\",\n \"score\": \"0.59824353\",\n \"text\": \"cancelDrag() {\\n if (this.proxy) {\\n document.body.removeEventListener('mousemove', this.mouseMove);\\n document.body.removeEventListener('mouseup', this.mouseUp);\\n this.proxy.parentElement.removeChild(this.proxy);\\n this.proxy = null;\\n this.payload = null;\\n this.lastTarget = null;\\n this.lastMonitor = new Set();\\n document.body.classList.remove('prevent-selection');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7fba4dc5027f838471e1f5a265441cd\",\n \"score\": \"0.5981188\",\n \"text\": \"function out() {\\n if (canBeMoved(this) !== null) {\\n this.style.borderColor = \\\"black\\\";\\n this.style.cursor = \\\"default\\\";\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44fbbe78a6f5210a690ce6f177e21887\",\n \"score\": \"0.59751284\",\n \"text\": \"function onDragEnd() {\\r\\n drag = null;\\r\\n pointX = null;\\r\\n pointY = null;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1e63267bba3871cb35d3b052099f1da\",\n \"score\": \"0.5972657\",\n \"text\": \"function drag(e) {\\r\\n\\tif($draggedElement != undefined) {\\r\\n\\t\\t//move the currently dragged element\\r\\n\\t\\t$draggedElement.css(\\\"left\\\",(dragElementOffsetX + e.clientX + /*mouseStartDragX*/ + 5) + 'px');\\r\\n\\t\\t$draggedElement.css(\\\"top\\\",(dragElementOffsetY + e.clientY - mouseStartDragY) + 'px');\\r\\n\\t\\t\\r\\n\\t\\t//keep the green highlight\\r\\n\\t\\t$dragableElement.css(\\\"border\\\", \\\"1px solid #00FF00\\\");\\r\\n\\t\\t\\r\\n\\t\\t//determine if mouse is over a drop target, to properly change the cursor state\\r\\n\\t\\tvar dropTarget = getDropTarget(e.clientX, e.clientY);\\r\\n\\t\\tif(dropTarget != undefined) {\\r\\n\\t\\t\\t$(\\\"#overlay\\\").css(\\\"cursor\\\", \\\"default\\\");\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\t$(\\\"#overlay\\\").css(\\\"cursor\\\", \\\"no-drop\\\");\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t}\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04854118d0b683ddc19c11dfdabdd683\",\n \"score\": \"0.5959983\",\n \"text\": \"function handleDragOver(e)\\r\\n {\\r\\n if (e.preventDefault)\\r\\n {\\r\\n e.preventDefault();\\r\\n ///Evento en donde se deben obtener las coordenadas///\\r\\n }\\r\\n e.dataTransfer.dropEffect = 'copy';\\r\\n return false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7fb95e559c1f2dfaac7c3ee1ba522dc\",\n \"score\": \"0.5952431\",\n \"text\": \"function onDocumentDragOver(evt) {\\n evt.preventDefault();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7fb95e559c1f2dfaac7c3ee1ba522dc\",\n \"score\": \"0.5952431\",\n \"text\": \"function onDocumentDragOver(evt) {\\n evt.preventDefault();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7fb95e559c1f2dfaac7c3ee1ba522dc\",\n \"score\": \"0.5952431\",\n \"text\": \"function onDocumentDragOver(evt) {\\n evt.preventDefault();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7fb95e559c1f2dfaac7c3ee1ba522dc\",\n \"score\": \"0.5952431\",\n \"text\": \"function onDocumentDragOver(evt) {\\n evt.preventDefault();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7fb95e559c1f2dfaac7c3ee1ba522dc\",\n \"score\": \"0.5952431\",\n \"text\": \"function onDocumentDragOver(evt) {\\n evt.preventDefault();\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":84,"cells":{"query_id":{"kind":"string","value":"8cc80fec48cedb5927ea979ec2cd8927"},"query":{"kind":"string","value":"Return time in hours for how long one can rent an offer for the given sum"},"positive_passages":{"kind":"list like","value":[{"docid":"ff65356f7ff09b96ce4597bfa1fbdd59","score":"0.71285266","text":"function getHours4Quote(offer, sum) {\n\n if (offer.setup != \"\" ) {\n // Subtract setup cost\n sum = sum - offer.setup;\n }\n console.log(\"hours4quote \"+offer.shortname+\" sum=\"+sum);\n if (sum <=0) {\n return 0;\n }\n var h = 0;\n if (offer.hourly != \"\" ) {\n h = Math.floor(sum / offer.hourly); // max hours can rent for given sum.\n //console.log(\"hours4quote \"+offer.shortname+\" hours=\"+h);\n } else if (offer.weekly != \"\" ) {\n var period_w = Math.floor(sum / offer.weekly);\n //console.log(\"hours4quote \"+offer.shortname+\" weeks=\"+period_w);\n h = period_w * (24 * 7);\n } else if (offer.monthly != \"\" ) {\n var period_m = Math.floor(sum / offer.monthly);\n //console.log(\"hours4quote \"+offer.shortname+\" months=\"+period_m);\n h = getHours4Months(period_m);\n } else if (offer.yearly != \"\" ) {\n var period_y = Math.floor(sum / offer.yearly);\n console.log(\"hours4quote \"+offer.shortname+\" years=\"+period_y);\n h = getHours4Months(period_y * 12);\n } else {\n console.log(offer);\n }\n return h;\n}","title":""}],"string":"[\n {\n \"docid\": \"ff65356f7ff09b96ce4597bfa1fbdd59\",\n \"score\": \"0.71285266\",\n \"text\": \"function getHours4Quote(offer, sum) {\\n\\n if (offer.setup != \\\"\\\" ) {\\n // Subtract setup cost\\n sum = sum - offer.setup;\\n }\\n console.log(\\\"hours4quote \\\"+offer.shortname+\\\" sum=\\\"+sum);\\n if (sum <=0) {\\n return 0;\\n }\\n var h = 0;\\n if (offer.hourly != \\\"\\\" ) {\\n h = Math.floor(sum / offer.hourly); // max hours can rent for given sum.\\n //console.log(\\\"hours4quote \\\"+offer.shortname+\\\" hours=\\\"+h);\\n } else if (offer.weekly != \\\"\\\" ) {\\n var period_w = Math.floor(sum / offer.weekly);\\n //console.log(\\\"hours4quote \\\"+offer.shortname+\\\" weeks=\\\"+period_w);\\n h = period_w * (24 * 7);\\n } else if (offer.monthly != \\\"\\\" ) {\\n var period_m = Math.floor(sum / offer.monthly);\\n //console.log(\\\"hours4quote \\\"+offer.shortname+\\\" months=\\\"+period_m);\\n h = getHours4Months(period_m);\\n } else if (offer.yearly != \\\"\\\" ) {\\n var period_y = Math.floor(sum / offer.yearly);\\n console.log(\\\"hours4quote \\\"+offer.shortname+\\\" years=\\\"+period_y);\\n h = getHours4Months(period_y * 12);\\n } else {\\n console.log(offer);\\n }\\n return h;\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"9b37ced5e8fd2a23e3bdba7a4db617c6","score":"0.6523558","text":"function getQuote4Hours(offer, h) {\n var cost = 0;\n if (offer.setup != \"\" ) {\n cost += offer.setup;\n }\n if (\"continuous\" in offer && offer.continuous != \"\" ) {\n\n if (offer.continuous == 1) {\n var periods = Math.ceil(h / offer.time_limit);\n cost += periods * offer.yearly;\n return cost;\n } else if (offer.continuous == 2.5) {\n // Tsubame 2.5\n // koeff3 is 1 for jobs running <= 1 day.\n var koeff3 = 1;\n var nodes = 1;\n var periods = Math.ceil(h * koeff3 * nodes / offer.time_limit);\n //console.log(offer.shortname+\" periods=\"+periods+\" for hours=\"+h);\n cost += periods * offer.yearly;\n return cost;\n }\n }\n // Apply monthly limit\n if (\"month_limit\" in offer && offer.month_limit != \"\" ) {\n //console.log(\"Month limit for \"+offer.shortname+\" is \" + offer.month_limit);\n var months = getMonths4Hours(h);\n cost += offer.month_limit * months[0];\n h = months[1]; // use leftover time to calculate additional cost\n }\n if (\"minutely\" in offer && offer.minutely != \"\") {\n var cost1 = 60 * h * offer.minutely;\n // Apply monthly limit\n if (\"month_limit\" in offer && offer.month_limit != \"\" ) {\n if (cost1 > offer.month_limit) {\n cost1 = offer.month_limit;\n }\n }\n cost += cost1;\n }\n else if (\"hourly\" in offer && offer.hourly != \"\" ) {\n var cost1 = h * offer.hourly;\n // Apply monthly limit\n if (\"month_limit\" in offer && offer.month_limit != \"\" ) {\n if (cost1 > offer.month_limit) {\n cost1 = offer.month_limit;\n }\n }\n cost += cost1;\n } else if (\"weekly\" in offer && offer.weekly != \"\" ) {\n var period_w = Math.ceil(h / (24 * 7));\n cost1 = period_w * offer.weekly;\n // Apply monthly limit\n if (\"month_limit\" in offer && offer.month_limit != \"\" ) {\n if (cost1 > offer.month_limit) {\n cost1 = offer.month_limit;\n }\n }\n cost += cost1;\n } else if (\"monthly\" in offer && offer.monthly != \"\" ) {\n var months = getMonths4Hours(h);\n var more_than_a_month = 0;\n if (months[1] > 0) {\n more_than_a_month = 1;\n }\n cost += (months[0] + more_than_a_month)* offer.monthly;\n //console.log(\"Monthly: \"+ offer.shortname + \" \"+offer.monthly);\n //console.log(months);\n } else if (\"yearly\" in offer && offer.yearly != \"\" ) {\n // Year is counted as 365 days\n var period_y = Math.ceil(h / (24 * 365));\n cost += period_y * offer.yearly;\n }\n return cost;\n}","title":""},{"docid":"54bcb003f0ff95282253e18bf0a90203","score":"0.6221985","text":"calcHours() {\n let hours = Math.floor(this.availableMins / 60)\n let mins = this.availableMins % 60\n this.timeRem = hours + \"h \" + mins + \"m\"\n }","title":""},{"docid":"854d6cd241d752fd081751ce0a7fa88b","score":"0.6201337","text":"function calculateTime(departure, arrival) {\n\n var year = new Date().getFullYear();\n var newDeparture = new Date(year + \" \" + departure);\n var newArrival = new Date(year + \" \" + arrival);\n\n\n\n var result = (newArrival - newDeparture);\n\n //TODO:\n var hours = Math.floor(result / 36e5);\n var minutes = Math.floor((result % 36e5) / 6e4);\n var seconds = Math.floor(((result % 36e5) % 6e4) / 1000);\n return hours + \" Hours \" + minutes + \" minutes \" + seconds + \" seconds\";\n}","title":""},{"docid":"d49ee37d07c5e0406dd3c26343404853","score":"0.61936146","text":"function main(restTime, pricePerHardware, pricePerSoftware, frappePrice) {\n let computerHardwareTime = 3 * 2;\n let softwareTime = 2 * 2;\n let timeSpent = 5 + computerHardwareTime + softwareTime;\n let remainingTime = restTime - timeSpent;\n let moneySpent = (pricePerHardware * 3) + (pricePerSoftware * 2) + frappePrice;\n console.log(moneySpent.toFixed(2));\n console.log(remainingTime);\n}","title":""},{"docid":"25b7d108e3491fafdb30f65b274bf54c","score":"0.6036661","text":"calcTime() {\n const numIng = this.ingredients.length;\n const periods = Math.ceil(numIng / 3);\n this.time = periods * 15;\n }","title":""},{"docid":"4126865dffdafcf2ebb7eb8f16d00b18","score":"0.59662","text":"calculateTime() {\n const numIng = this.ingredients.length;\n const periods = Math.ceil(numIng / 3);\n this.time = periods * 15;\n }","title":""},{"docid":"95e5351af54959298ae142adb0d56fa7","score":"0.59063345","text":"calcTime() {\n this.cookingTime = Math.ceil(this.ingredients.length / 3) * 15;\n }","title":""},{"docid":"69bfa26cc7ebb7588c6ace4d6cb4857b","score":"0.59019727","text":"function hotelCost(time) {\n var cost = 0;\n if (time < 0) {\n return \"Time is won't be Negative.\"\n }\n //This is about staying 10 days in hotelCost.\n else if (time <= 10) {\n cost = time * 100;\n }\n // This is about staying 20 days in hotelCost.\n else if (time <= 20) {\n var firstStay = 10 * 100;\n var countTime = time - 10;\n var secondStay = countTime * 80;\n cost = firstStay + secondStay;\n }\n // This is about staying 21 days or more in hotelCost.\n else {\n var firstStay = 10 * 100;\n var secondStay = 10 * 80;\n var countTime = time - 20;\n var thirdStay = countTime * 50;\n cost = firstStay + secondStay + thirdStay;\n }\n return cost;\n}","title":""},{"docid":"763bba0e86bf18c616c32b943121069d","score":"0.58640164","text":"function getQuote4Seconds(offer, sec, nodes) {\n //console.log(sec+\"sec\");\n var cost = 0;\n if (nodes == null || nodes == \"\") {\n nodes = 1;\n }\n if (offer.setup != \"\" ) {\n cost += offer.setup * nodes; // Assume setup price is per node\n }\n if (\"continuous\" in offer && offer.continuous != \"\" ) {\n var h = Math.ceil(sec / 3600); // sec -> hours for cost calculations\n var hours = offer.time_limit;\n if (offer.continuous == 1) {\n var periods = Math.ceil(h / hours);\n cost += periods * offer.yearly * nodes;\n return cost;\n } else if (offer.continuous == 2.5) {\n // Tsubame 2.5\n var koeff3 = tsubame_koeff[0];\n for (var k=0; k < tsubame_border.length; k++) {\n if (tsubame_border[k] < h) {\n koeff3 = tsubame_koeff[k+1];\n } else {\n break;\n }\n }\n if (koeff3 < 0) {\n console.log(offer.shortname + \" cannot be used for \"+h+\" hours and \"+ nodes + \" nodes.\");\n return -1; // Jobs cannot be run for more than 96 hours on Tsubame2.5\n }\n var periods = Math.ceil(h * nodes * koeff3 / hours);\n //console.log(\" periods=ceil(\"+h+\"x\"+nodes+\"x\"+ koeff3+\"/\"+hours+\")=\"+(periods));\n cost = periods * offer.yearly;\n //console.log(\" getQuote4Seconds 2 cost: \"+periods+\" x \"+offer.yearly+ \" = \"+cost);\n return cost;\n }\n }\n // Apply monthly limit\n if (\"month_limit\" in offer && offer.month_limit != \"\" ) {\n //console.log(\"Month limit for \"+offer.shortname+\" is \" + offer.month_limit);\n var months = getMonths4Seconds(sec);\n //console.log(\"Months:\"+months);\n cost += offer.month_limit * months[0] * nodes;\n sec = months[1]; // use leftover time to calculate additional cost\n }\n if (\"minutely\" in offer && offer.minutely != \"\") {\n var cost1 = Math.ceil(sec / 60) * offer.minutely * nodes;\n // Apply monthly limit\n if (\"month_limit\" in offer && offer.month_limit != \"\" ) {\n if (cost1 > offer.month_limit * nodes) {\n cost1 = offer.month_limit * nodes;\n }\n }\n cost += cost1;\n }\n else if (\"hourly\" in offer && offer.hourly != \"\" ) {\n var cost1 = Math.ceil(sec / 3600) * offer.hourly * nodes;\n //console.log (\" \"+sec+\"sec. cost1= \"+Math.ceil(sec / 3600)+\"x\"+offer.hourly+\" = \"+cost1);\n // Apply monthly limit\n if (\"month_limit\" in offer && offer.month_limit != \"\" ) {\n if (cost1 > offer.month_limit * nodes) {\n cost1 = offer.month_limit * nodes;\n }\n }\n cost += cost1;\n } else if (\"weekly\" in offer && offer.weekly != \"\" ) {\n var period_w = Math.ceil(sec / (24 * 7 * 3600));\n var cost1 = period_w * offer.weekly * nodes;\n // Apply monthly limit\n if (\"month_limit\" in offer && offer.month_limit != \"\" ) {\n if (cost1 > offer.month_limit * nodes) {\n cost1 = offer.month_limit * nodes;\n }\n }\n cost += cost1;\n } else if (\"monthly\" in offer && offer.monthly != \"\" ) {\n var months = getMonths4Seconds(sec);\n var more_than_a_month = 0;\n if (months[1] > 0) {\n more_than_a_month = 1;\n }\n cost += (months[0] + more_than_a_month)* offer.monthly * nodes;\n //console.log(\"Monthly: \"+ offer.shortname + \" \"+offer.monthly+\" cost=\"+cost);\n } else if (\"yearly\" in offer && offer.yearly != \"\" ) {\n // Year is counted as 365 days\n var period_y = Math.ceil(sec / (3600 * 24 * 365));\n cost += period_y * offer.yearly * nodes;\n }\n return cost;\n}","title":""},{"docid":"f2a25f1781259d4ad14f88f50643f367","score":"0.5846417","text":"timeLeft(){\n let time = new Date().getTime()\n let dateFinReservation = (parseInt(this.dateReservation)+(20*60000));\n return dateFinReservation - time;\n }","title":""},{"docid":"9d1fe5c1a25c4a41252a7e38f5029fc8","score":"0.5834692","text":"getRemainingTime() {\n if( this.expired() ) {\n return 0;\n }\n \n // never return a neg number + account for pause time\n let rt = this.startTime + this.duration + this.getPauseTime() - millis();\n if( rt < 0 )\n rt = 0;\n return rt;\n }","title":""},{"docid":"9fcb433f78104a32b9afedc89a336383","score":"0.58283395","text":"function timer(){\n const currentDate = new Date();\n const offerTime = new Date(\"31 July 2021\");\n const totalSec = (offerTime-currentDate)/1000;\n \n const remainingDays = Math.floor(totalSec/(3600*24)) > 0 ? Math.floor(totalSec/(3600*24)) : 0;\n const remainingHours = Math.floor((totalSec/3600)%24) > 0 ? Math.floor((totalSec/3600)%24) : 0;\n const remainingMinutes = Math.floor((totalSec/60)%60) > 0 ? Math.floor((totalSec/60)%60) : 0;\n const remainingSecs = Math.floor(totalSec%60) >= 0 ? Math.floor(totalSec%60) : 0;\n \n $('#days').html(remainingDays);\n $('#hours').html(remainingHours);\n $('#minutes').html(remainingMinutes);\n $('#seconds').html(remainingSecs);\n}","title":""},{"docid":"016a0e7bf16a9c3d26a1638155fce86b","score":"0.5781841","text":"function hours_spent () {\n\t\n\teval_pages = document.roi_calculator.e_pages.value;\n\teval_client = formatInt(document.roi_calculator.e_client.value);\n\teval_replace = formatInt(document.roi_calculator.e_replace.value);\n\tprnt_time = formatInt(document.roi_calculator.e_prnt_time.value);\n\ttotal_prnt_return = eval_client + (eval_replace * 50);\n\thr_spent = total_prnt_return *(prnt_time/60);\n\tdocument.roi_calculator.e_hr_spent.value = formatCurrency(hr_spent) + 'hrs';\n\t\n}","title":""},{"docid":"cc81081109d89f870296e08cb4184fd7","score":"0.5781678","text":"function lateRide(n) {\n let h = n / 60;\n let r = h % 1;\n let m = r * 60;\n let str = String(Math.floor(h)) + String(Math.round(m));\n let tot = 0;\n for (let num in str) {\n tot += Number(str[num]);\n }\n console.log(str);\n return tot;\n}","title":""},{"docid":"309fe4e86d9e91c5d5cb24bf8fc7a99c","score":"0.5742347","text":"static roundRemainingTime() {\n let round;\n if ((round = TurkServer.currentRound()) == null) {\n return;\n }\n if (round.endTime == null) {\n return;\n }\n return Math.max(0, round.endTime - TimeSync.serverTime());\n }","title":""},{"docid":"333fdd6fa17a42807e2682b2d726481d","score":"0.57392764","text":"function question6(){\n bgn=hmstosec('09:00:00');\n end=hmstosec('00:00:00');\n end += 60*60*24;\n onedayduration = end - bgn;\n totalDuration=0;\n tasks.forEach(function(value){\n totalDuration += value.duration;\n });\n days=totalDuration*60/onedayduration;\n return days;\n}","title":""},{"docid":"8ba3783010c3d4e4bf269e631c9ce874","score":"0.57280236","text":"function mineTimeEstimate(){//outputs to console.log estimated time to mine in Hours Mins Seconds. Returns estimted time in seconds.\n\tadjustedHashRate=admin.miner.hashrate()*1000*1.04;//1000 is to fix an error. 1.08 is assuming at least 2 uncles every 25 blocks.\n\t//Remove the factor of 1000 once this issue has been fixed in the version of geth which you are using.\n\testimatedSeconds=eth.getBlock(\"latest\").difficulty/adjustedHashRate;\n\tconsole.log(Math.floor(estimatedSeconds/3600.)+\" Hrs, \"+Math.floor((estimatedSeconds%3600)/60)+\" Mins, \"+Math.floor(estimatedSeconds%60)+\" Sec, estimated time until next successful block mined.\");\n\treturn estimatedSeconds;\n}","title":""},{"docid":"9666042d3ba7e858fa802a92821d15fc","score":"0.5717128","text":"function getIdealSleepHours() {\n return 7*7;\n}","title":""},{"docid":"3cdc15ce42cacad78e0ec007a65fa4a0","score":"0.57038945","text":"function question4(){\n var typeDuration=[]\n employeeType.forEach(function(value){\n bgn=hmstosec(value.work_begin);\n end=hmstosec(value.work_end);\n if (bgn > end){\n end += 60*60*24;\n }\n var secondDuration = end-bgn;\n typeDuration.push(secondDuration);\n });\n totalworksec=0;\n employees.forEach(function(value){\n var worktype=value.type;\n var perduration=typeDuration[worktype-1];\n totalworksec += perduration;\n });\n var totalworkhour=totalworksec/3600;\n return totalworkhour;\n}","title":""},{"docid":"8d9561b803dee5584b424782dde8eb2a","score":"0.56767744","text":"function _hrDuration() { var t1 = clk(); for (var i=0; i<timeRuns; i++) clk(); return (clk() - t1) / (timeRuns + 1) }","title":""},{"docid":"aa92e457d8a4e50b74edd79ad10fc4ea","score":"0.5663311","text":"function getActualSleepHours(){\n let monday=getSleepHours('Monday');\n let tuesday=getSleepHours('Tuesday');\n let wednesday=getSleepHours('Wednesday');\n let thursday=getSleepHours('thursday');\n let friday=getSleepHours('friday');\n let saturday=getSleepHours('saturday');\n let sunday=getSleepHours('sunday');\n let totalSleep;\n totalSleep=monday + tuesday+wednesday+thursday+friday+saturday+sunday;\n return totalSleep;\n}","title":""},{"docid":"50df5b9a25dec54016eca918527bdeaf","score":"0.56487036","text":"function getTimeRemaining(endtime) {\n\n let t = Date.parse(endtime) - Date.parse(new Date()),\n seconds = Math.floor((t / 1000) % 60), //?????????, ????? ??????????? ? ????????? ? ??????? - ???????? ??????? ?? ???????\n minutes = Math.floor((t / 1000 / 60) % 60),\n /* hours = Math.floor( (t / (1000 * 60 * 60)) );// - ??? ?? ?????*/\n hours = Math.floor((t) % (24 * 60 * 60 * 1000) / (60 * 60 * 1000));\n\n\n return {\n total: t,\n hours: hours,\n minutes: minutes,\n seconds: seconds\n };\n }","title":""},{"docid":"2e887e34ed42411b91690b9763dea6bd","score":"0.5631369","text":"function calculateSleepDebt() {\n if (getIdealSleepHours() === getActualSleepHours()) {\n console.log('There is no sleep debt!')\n } else if (getIdealSleepHours() < getActualSleepHours()) {\n console.log('You have a sleep surplus of ' + (getActualSleepHours() - getIdealSleepHours()) + ' hours.')\n } else if (getIdealSleepHours() > getActualSleepHours()) {\n console.log('You have a sleep debt of ' + (getIdealSleepHours() - getActualSleepHours()) + ' hours.')\n } else {\n console.log('The fuck have you done bruv?');\n }\n}","title":""},{"docid":"b57405a325f893fadb0050ca0d4fb48e","score":"0.56279373","text":"static breakRemainingTime() {\n let nextRound, round;\n if ((round = TurkServer.currentRound()) == null) {\n return;\n }\n const now = Date.now();\n if (round.startTime <= now && round.endTime >= now) {\n // if we are not at a break, return 0\n return 0;\n }\n\n // if we are at a break, we already set next round to be active.\n if ((nextRound = RoundTimers.findOne({ index: round.index + 1 })) == null) {\n return;\n }\n if (nextRound.startTime == null) {\n return;\n }\n return Math.max(0, nextRound.startTime - TimeSync.serverTime());\n }","title":""},{"docid":"9c2e2abfd472a75bf35d6cb0ebdf736c","score":"0.5599546","text":"function getActualSleepHours() {\n var total = 0;\n total += getSleepHours('Monday');\n total += getSleepHours('Tuesday');\n total += getSleepHours('Wednesday');\n total += getSleepHours('Thursday');\n total += getSleepHours('Friday');\n total += getSleepHours('Saturday');\n total += getSleepHours('Sunday');\n return total;\n}","title":""},{"docid":"f81e9596c08f272a975df0f6d9e8aac7","score":"0.5588797","text":"function remaining_time(){\n var duration = base_time - ( (new Date()).getTime() - time_tracker );\n var seconds = parseInt((duration / 1000) % 60);\n var minutes = parseInt((duration / (1000 * 60)) % 60);\n var hours = parseInt((duration / (1000 * 60 * 60)) % 24);\n\n hours = (hours < 10) ? \"0\" + hours : hours;\n minutes = (minutes < 10) ? \"0\" + minutes : minutes;\n seconds = (seconds < 10) ? \"0\" + seconds : seconds;\n\n return hours + \":\" + minutes + \":\" + seconds;\n }","title":""},{"docid":"1bba9ea465746cf3d39826c6ed45c4bc","score":"0.55787003","text":"static roundElapsedTime() {\n let round;\n if ((round = TurkServer.currentRound()) == null) {\n return;\n }\n if (round.startTime == null) {\n return;\n }\n return Math.max(0, TimeSync.serverTime() - round.startTime);\n }","title":""},{"docid":"509ff7d5487aa8695cf5089ce1ab9afd","score":"0.5577676","text":"function getHourTime() {\n let time = 60;\n return (Math.floor(new Date()/1000) + time * 60);\n}","title":""},{"docid":"a173e90ad588795d7a3a4276bd4bef1f","score":"0.5550564","text":"timeInHours(minutes){\r\n minutes*=Min\r\n console.log(Hr)\r\n return minutes/Hr\r\n }","title":""},{"docid":"8aa2a477fcacbfa10a1fa9cf255165c8","score":"0.5504384","text":"getEstimatedShareHashrate(difficulty, timeToFindSeconds )\n {\n if(timeToFindSeconds!= null && timeToFindSeconds>0)\n {\n\n var hashrate = web3utils.toBN(difficulty).mul( web3utils.toBN(2).pow( web3utils.toBN(22) )).div( web3utils.toBN( timeToFindSeconds ) )\n\n return hashrate.toNumber(); //hashes per second\n\n }else{\n return 0;\n }\n }","title":""},{"docid":"f3bbde747a4efe757f8bed133d217fdc","score":"0.5494408","text":"static hours_per_week() { return Starship.hours_per_day() * Starship.days_per_week() }","title":""},{"docid":"be3a6a095be7c87757cf26412b1e8de6","score":"0.5489626","text":"function totalCost(number_of_days, booking_cost_per_night) {\n return number_of_days * booking_cost_per_night;\n}","title":""},{"docid":"b7f7b82d8744785192d148db1ddfc5e3","score":"0.5481771","text":"function computeTime(distance) {\n return 100 + Math.sqrt(distance) * 30;\n}","title":""},{"docid":"69dfcaf819977a075f9b134b5c525774","score":"0.5480879","text":"function calculateTimeToCoffee() {\n // let timeCalculated = moment().toNow();\n session.send(textContent.inProgress);\n }","title":""},{"docid":"7ecd0460b852bc9963f6975346025223","score":"0.5466228","text":"calculateTime(){\n const numIng = 4\n const periods = Math.ceil(numIng / 3)\n this.time = periods * 15\n }","title":""},{"docid":"e74cdc63896caaf961ba0a1ecf9acfd5","score":"0.54587615","text":"function returnTime() {\n time_at_the_end = new Date().getTime();\n total_banner_time = (time_at_the_end - time_at_the_beginig) * 0.001;\n console.log(total_banner_time + ' seconds.');\n}","title":""},{"docid":"daca2ea2d7b03dd4de29b0d73bc9ee74","score":"0.5457624","text":"function calcularTiempoEjecucion(){\r\n\t\tvar tiempo = new Date().getTime() - tiempo_ejecucion;\r\n\t\tvar div = find(\"//div[@id='ltime']\", XPFirst);\r\n\t\tdiv.appendChild(elem(\"P\", \"TB: \" + tiempo + \" ms\"));\r\n\t}","title":""},{"docid":"d6eef811fbcc17df4019501167ba7a98","score":"0.5438358","text":"function GS_getDuration( ) {\n var timeArr = $(\"span#time-total\").text().split(\":\");\n return parseInt( timeArr[0] ) * 60 + parseInt( timeArr[1] );\n}","title":""},{"docid":"7ded8fb0f56194c923a84be176e67f63","score":"0.54355186","text":"function tripTime(start, end) {\n start = start.split(':');\n end = end.split(':')\n var dep = new Date();\n dep.setHours(start[0], start[1], start[2])\n var arr = new Date();\n arr.setHours(end[0], end[1], end[2]);\n var int = arr - dep;\n var h, m, s;\n h = Math.floor(int / 1000 / 60 / 60);\n m = Math.floor((int - h * 3600000) / 1000 / 60);\n s = Math.floor((int - h * 3600000 - m * 60000) / 1000);\n return h + ' hours ' + m + ' minutes ' + s + ' seconds';\n}","title":""},{"docid":"276fceb6915dbe699eb559ad5cf4daf1","score":"0.5433992","text":"function getTimeSpent(){\n\t\t\tvar settings = {\n \"async\": false,\n \"crossDomain\": true,\n \"url\": \"/api/Rest/v1/Users/\" + userId + \"/enrollments/\" + courseId,\n\t\t\t\t\"tryCount\" : 0,\n\t\t\t\t\"retryLimit\" : 3,\n \"method\": \"GET\",\n \"headers\": {\n //\"Authorization\": token,\n \"Content-Type\": \"application/json\",\n \"cache-control\": \"no-cache\"\n }\n }\n\n $.ajax(settings).done(function (response) {\n TimeSpentTicks = response.TimeSpentTicks;\n }).fail(function (msg) {\n\t\t\t\tSaveClose(\"There was an issue loading your course. Please close all internet browsers and try again. If you continue to receive this error please reach out to our student support team (904.999.4923 or support@xcelsolutions.com) and provide error code 7728.\");\n });\n\t\t\t\n\t\t\tvar convertTimeTicks = \"<span style='color:white'>\" + Math.floor(((TimeSpentTicks/10000000)/60)/60) + \"</span> Hours: <span style='color:white'> \" + Math.floor(((TimeSpentTicks/10000000)/60) % 60) + \"</span> Minutes\";\n\t\t\treturn convertTimeTicks;\n\t\t}","title":""},{"docid":"86526d2d6370379d405a108bfb5f3bdd","score":"0.5430013","text":"function getTimeLeft(time){\n var today = new Date();\n currentTime = today.getTime();\n today.setHours(time.split(\":\")[0]);\n today.setMinutes(time.split(\":\")[1]);\n var firstTrainTime = today.getTime();\n //return in minutes\n return (currentTime - firstTrainTime) / 1000 / 60;\n}","title":""},{"docid":"171a8d7c3fc4dabfa1330adf8a43fed6","score":"0.54199433","text":"function timingOut() {\n const date = Date.now()\n const tom = new Date().getDate()+1;\n\n console.log(date - tom)\n // const hour = 1000 * 60 * 60;\n // const anHourAgo = date - hour;\n // date > anHourAgo;\n\n // let timing = 0\n // for(let t of tasks){\n // if (t.due_date == true){\n // console.log(t)\n // timing += 1\n // }\n // }\n // return timing;\n\n}","title":""},{"docid":"fc9b3ec1d593aba00b9aa809fc5bda14","score":"0.541798","text":"function calcWage(empHrs) {\n return empHrs * WAGE_PER_HOUR;\n}","title":""},{"docid":"edef67e828753e93038486c8c729e84e","score":"0.54124844","text":"function departureHour(time) {\n if (time - moment() > 0) {\n return time;\n } else {\n return moment(time).add(1, \"days\")\n }\n}","title":""},{"docid":"f97a68dd42d19713656560c52e866d19","score":"0.5401591","text":"function getTimeByHalfs(n)\n{\n\tvar today = new Date();\n\tvar current_hour = today.getHours();\n\tvar current_minutes = today.getMinutes();\n\tvar minutes = current_minutes > 30 ? 1 : 0.5;\n\treturn current_hour + n + minutes;\t\n}","title":""},{"docid":"ebc588fc55479f0f594ee502302d83be","score":"0.5394902","text":"estimatedShareHashrate(difficulty, timeToFindSeconds) {\n\t if(timeToFindSeconds && timeToFindSeconds > 0) {\n\t return this.web3.utils.toBN(difficulty)\n\t \t\t.mul( this.web3.utils.toBN(2).pow( this.web3.utils.toBN(22) ))\n\t \t\t.div( this.web3.utils.toBN( timeToFindSeconds ))\n\t \t\t.toNumber()\n\t }\n\t return 0\n\t}","title":""},{"docid":"a8f329394d653f0892e9e861973c205f","score":"0.5392269","text":"function hotelCost (nightSpent){\n var bill = 0;\nif (nightSpent <= 10){\n bill = nightSpent * 100;\n}\nelse if (nightSpent <=20){\n var firstPhase = 10 * 100;\n var remaining = nightSpent - 10;\n var secondPhase = remaining * 80;\n bill = firstPhase + secondPhase;\n}\nelse {\n var firstPhase = 10 * 100;\n var secondPhase = 10 * 80;\n var remaining = nightSpent - 20;\n var thirdPhase = remaining * 50;\n bill = firstPhase + secondPhase + thirdPhase;\n}\nreturn bill;\n}","title":""},{"docid":"284b196aaa5aaf499bfb2c9ba0853e24","score":"0.53882074","text":"function timeRemain(time)\r\n{\r\n var remain = (time - $.now()) / 60000;\r\n return remain.toFixed(0);\r\n}","title":""},{"docid":"1ccad9ce9ca7bc4053aa7c70c11aa428","score":"0.53855205","text":"function routeTime(route) {\n var acc = 0;\n for (i = 0; i < route.legs.length; i++) {\n acc = acc + route.legs[i].duration.value;\n }\n return acc;\n}","title":""},{"docid":"51f63a6137654da13679a5452d094f47","score":"0.53770775","text":"function timer_add_hours(time,id){\n\n var dt = time;\n dt.setHours( dt.getHours() + 3 );\n \n const second = 1000,\n minute = second * 60,\n hour = minute * 60,\n day = hour * 24;\n\n let countDown = dt.getTime(),\n x = setInterval(function() \n {\n \n let now = new Date().getTime(),\n distance = countDown - now;\n\n var countdowntimer = \"countdowntimer\" + id;\n document.getElementById(countdowntimer).innerHTML = (Math.floor((distance % (day)) / (hour))) + ':' + (Math.floor((distance % (hour)) / (minute))) +':' + (Math.floor((distance % (minute)) / (second)));\n \n //do something after 3 hours are completed.\n if (distance < 0) {\n clearInterval(x);\n $('#start_bidding'+id).hide();\n $('#bidding_time'+id).css('display','none');\n $('#countdowntimer'+id).hide();\n $('#winner'+id).show();\n \n }\n }, 1000) \n}","title":""},{"docid":"9eeddf0a38a20eddb37a62ea03da871a","score":"0.5366027","text":"function totaltime () {\n let time1 = new Date(\"2016-12-11T00:37:52Z\").getTime();\n let time2 = new Date(\"2016-12-11T05:41:50Z\").getTime();\n const totaltime = (time2 - time1)/1000; //in seconds\n return totaltime + ' seconds';\n}","title":""},{"docid":"a6e6c2d6e64f586773cd0494f0003590","score":"0.53659475","text":"calcPay() {\n let toPayAmount = this.#hourlyPay * this.#hoursWorked;\n this.#hoursWorked = 0;\n return toPayAmount;\n }","title":""},{"docid":"e813045b51b46b5db5d8060339dad0b0","score":"0.5353032","text":"function timeAfterDifficulties() {\n if (difficulty == \"Easy\") {\n return 3000;\n } else if (difficulty == \"Medium\") {\n return 2000;\n } else {\n return 1000;\n }\n}","title":""},{"docid":"7ef56f3b725a5dad00b7a31da58b0f73","score":"0.5344263","text":"calculateTotalTime() {\n return (\n this.convertToTimeStamp(this.config.end_date) -\n this.convertToTimeStamp(this.config.start_date)\n )\n }","title":""},{"docid":"e7a00919535945915101f3dc8bb5e329","score":"0.5342564","text":"function getHoursTime(timer){\n var seconds = timeLeftGM(timer);\n if(seconds == 0) return 0;\n if(isNaN(seconds)) return undefined;\n var num = parseInt(seconds);\n var strTime = '';\n if(num){\n num /= 60;\n if(num >= 60){\n num /= 60;\n strTime = parseInt(num)+'h ';\n num -= parseInt(num); num *= 60;\n }\n strTime += parseInt(num)+'m ';\n num -= parseInt(num); num *= 60;\n strTime += parseInt(num)+'s';\n }\n return strTime;\n}","title":""},{"docid":"04a31baae332f97192166cc79bb6d2ff","score":"0.53420067","text":"function getTravelTime(object){\n //hours is calculated by roounding of the lower integer\n const hours = Math.floor(object.destinationDistance/object.speed);\n //minutes is calculated from the remainder of distace/speed \n const minutes = Math.floor(((object.destinationDistance%object.speed)/object.speed)*60);\n const outPut = `${hours} hours and ${minutes} minutes`;\n return outPut;\n }","title":""},{"docid":"b13461855dfd47069aac60673957f367","score":"0.533888","text":"timeRemaining(timeObject = false) {\n\t\tvar dTod = new Date(), dTom = new Date(dTod.toUTCString());\n\t\tdTom.setDate(dTom.getDate() + 1); dTom.setUTCHours(0); dTom.setUTCMinutes(0); dTom.setUTCSeconds(0); dTom.setUTCMilliseconds(0);\n\t\tvar baseDeltaH = Math.floor( (dTom - dTod) / (this._HOUR_IN_MS) );\n\t\tvar baseDeltaM = Math.round( (dTom - dTod - baseDeltaH * this._HOUR_IN_MS) / (this._MIN_IN_MS) );\n\t\treturn ( !timeObject ? \n\t\t\tbaseDeltaH + \":\" + (baseDeltaM < 10 ? \"0\" : \"\" ) + baseDeltaM :\n\t\t\t{quest: this.getDailyQuest(dTod), hours: baseDeltaH, minutes: baseDeltaM } ) ;\n\t}","title":""},{"docid":"735b5ad74e7a203cbd66e5839cc95d63","score":"0.5332124","text":"function hotelCost(stayDuration) {\n if (stayDuration >= 1 && stayDuration <= 10) {\n return (100 * stayDuration);\n }\n else if (stayDuration >= 11 && stayDuration <= 20 ) {\n \n return ((stayDuration-10) * 80) + 1000;\n }\n else if (stayDuration >= 21) {\n return ((stayDuration-20) * 50) + 1800;\n }\n else{\n return (\"Please input a valid number!\")\n }\n}","title":""},{"docid":"972eda98d8da89a74fccdd4f4b5c5802","score":"0.5317996","text":"function calc_attack_hours(start_attack_level, end_attack_level, strength_level) {\n var total_hours = 0;\n for (; start_attack_level < end_attack_level; start_attack_level++) {\n var hours_to_level = calc_time_to_next_level(start_attack_level, strength_level, 1)[0];\n total_hours = total_hours + hours_to_level;\n }\n return total_hours;\n }","title":""},{"docid":"8854247b05e01d89dec533fbc0429ec7","score":"0.5311569","text":"getHours(){\n let start = ((this.startTime.getHours()*60) + this.startTime.getMinutes());\n let end = ((this.endTime.getHours()*60) + this.endTime.getMinutes());\n end < start ? end += (24 * 60) : end;\n let diffMins = end - start;\n let hours = (diffMins/60).toFixed(2);\n return hours;\n }","title":""},{"docid":"3ae15c638401b70abcd156d850ff7660","score":"0.5309714","text":"function getPay() {\n return hoursWorked * hourlyRate;\n }","title":""},{"docid":"a44f32a6f38e04b39e540e809e708d28","score":"0.5306086","text":"function hotelCost(days) {\n if (days <= 10) {\n var fastOffer = days * 100;\n return fastOffer;\n }\n else if (days <= 20) {\n var fastOffer = 10 * 100;\n var remaining = days - 10;\n var secondOffer = remaining * 80;\n var total = fastOffer + secondOffer;\n return total;\n }\n else {\n var fastOffer = 10 * 100;\n var secondOffer = 10 * 80;\n var remaining = days - 20;\n var luckyOffer = remaining * 50;\n var total = fastOffer + secondOffer + luckyOffer;\n return total;\n }\n}","title":""},{"docid":"4f8b910c1c68488dd101e9c0bdd83a17","score":"0.53001875","text":"function calcDuration(alert){\n\tvar startDate = new Date(alert.activationDate);\n\tvar endDate;\n\tif(alert.alert_horizon[0] == null || alert.alert_horizon[0].end_date == null || alert.alert_horizon[0].end_date == null){\n\t\treturn 'Unable to determine the duration of this alert; '+\n\t\t\t'Alerts without an end date are still active and will not yet have a duration';\n\t} else {\n\t\tendDate = new Date(alert.alert_horizon[0].end_date);\n\t\treturn formatDuration((endDate.getTime() - startDate.getTime()));\n\t}\n}","title":""},{"docid":"408ecb4ca6b5cb90fe3945afeedd0e9b","score":"0.5295606","text":"function hotelCost(days) {\r\n var expense = 0;\r\n if (days <= 10) {\r\n expense = days * 100;\r\n }\r\n else if (days <= 20) {\r\n var offer1 = 10 * 100;\r\n var remaining = days - 10;\r\n var offer2 = remaining * 80;\r\n expense = offer1 + offer2;\r\n }\r\n else {\r\n var offer1 = 10 * 100;\r\n var offer2 = 10 * 80;\r\n var remaining = days - 20;\r\n var offer3 = remaining * 50;\r\n expense = offer1 + offer2 + offer3;\r\n }\r\n return expense;\r\n}","title":""},{"docid":"bba85b542b42efbde502781872eb9c50","score":"0.528358","text":"function timeRemaining(timeStr) { \n\tlet now = new Date(), time = new Date(), output;\n\tlet timeArr = timeStr.split(\":\"); // split between hours (index 0) and minutes (index 1)\n\ttime.setHours(timeArr[0]);\n\ttime.setMinutes(timeArr[1]);\n\ttime.setSeconds(0);\n\ttime.setMilliseconds(0);\n\n\t// if time has already passed today, increment day\n\tif (now > time) {\n\t\ttime.setDate(time.getDate() + 1);\n\t}\n\tconsole.log(\"now: \" + now + \"\\ntime: \" + time);\n\n\toutput = (time - now) / 1000 * 16000000; // find difference, divide by milliseconds, multiply by clock speed\n\tconsole.log(\"output: \" + output);\n\treturn output + \"\"; // return output as string\n}","title":""},{"docid":"53babd0d018927ab366f2ae1b04fccbe","score":"0.5282334","text":"function gettimeRemaining(aryOfCoords){\n return aryOfCoords.routes[0].legs[0].duration.text.split(' ')[0]*1;\n}","title":""},{"docid":"cdddb65a8987074ed6ca7342ffe7acbb","score":"0.5268743","text":"function calcDailyWage(empHrs) {\n return empHrs * WAGE_PER_HOUR;\n}","title":""},{"docid":"f5c9d93c1ba13177f113816951e28c6b","score":"0.5262233","text":"function wagesEarnedOnDate(employeeObj, day) {\n let hours = hoursWorkedOnDate(employeeObj, day);\n let rate = employeeObj.payPerHour\n return hours * rate\n}","title":""},{"docid":"d04c7ddcba20387d7b997e2f6f920531","score":"0.5250791","text":"function getSumFreeTime(freeTimeArr) {\n //console.debug(\"getSumFreeTime()\"); //Test\n\n let total = 0;\n\n freeTimeArr.forEach((freeTime) => {\n if (freeTime.duration) {\n total += freeTime.duration.asMilliseconds();\n }\n });\n\n return dayjs.duration(total);\n }","title":""},{"docid":"be380a55c531e2bb4b506698d1a6120a","score":"0.524408","text":"function calculateDuration() {\r\n\t\t\treturn endTime - startTime;\r\n\t\t}","title":""},{"docid":"6f8177da979f02b440c74eb6ca05556f","score":"0.52409965","text":"function calculateDailyWage(empHrs) {\n return empHrs * WAGE_PER_HOUR;\n}","title":""},{"docid":"b71711d3069d53933b78b224b866df98","score":"0.52406394","text":"function shoppingTime(memberId, money) {\n if (memberId == '' || memberId == undefined) {\n return 'Mohon maaf, toko X hanya berlaku untuk member saja'\n } else if (money < 50000){\n return 'Mohon maaf, uang tidak cukup'\n }\n \n var temp = {}\n temp.memberId = memberId;\n temp.money = money;\n var moneyNew = money;\n var listPurchasedTemp = [];\n while(true){\n if (moneyNew >= 1500000) {\n listPurchasedTemp.push('Sepatu Stacattu')\n moneyNew -= 1500000\n } else if (moneyNew >= 500000) {\n listPurchasedTemp.push('Baju Zoro')\n moneyNew -= 500000\n } else if (moneyNew >= 250000) {\n listPurchasedTemp.push('Baju H&N')\n moneyNew -= 250000\n } else if (moneyNew >= 175000) {\n listPurchasedTemp.push('Sweater Uniklooh')\n moneyNew -= 175000\n } else if (moneyNew >= 50000) {\n listPurchasedTemp.push('Casing Handphone')\n moneyNew -= 50000\n } else {\n break;\n }\n }\n temp.listPurchased = listPurchasedTemp;\n temp.changeMoney = moneyNew;\n return temp\n}","title":""},{"docid":"ee952437afbb3700aaf26bf9d4b5370e","score":"0.5239424","text":"function _diffHrTime( hrTim) {\n\n let s = hrTim[0] - previousDataPointsMag[3][0][0];\n let ns = hrTim[1] - previousDataPointsMag[3][0][1];\n return s + ns * 1.0e-9;\n}","title":""},{"docid":"898cca0f5f2cc2954e2e0aa0eda7ba59","score":"0.5236685","text":"function calcTotalTime() {\n\tvar allWatches = watches.getWatches(),\n\t\ttotalTime = 0,\n\t\ttotalRoundedTime = 0,\n\t\t$total = $('.sum'),\n\t\t$roundedTotal = $('.rounded-sum');\n\n\tallWatches.forEach(function(watch) {\n\t\ttotalTime += watch.get('totalTime');\n\t\ttotalRoundedTime += _roundTime(watch.get('totalTime'));\n\t});\n\n\ttotalRoundedTime += \" \" + ((totalRoundedTime === 1) ? 'hour' : 'hours');\n\n\t$total.text(formatTime(totalTime));\n\t$roundedTotal.text(totalRoundedTime);\n}","title":""},{"docid":"5a5f82faa5c35c3d08b56bab73c2b109","score":"0.5234955","text":"function calculateFinalTime() {\n // Calculates the time between clicked rabbits and their appearance and adds it to finalTime\n for (let i = 0; i < rabbitAppearTimes.length; i++) {\n if (rabbitClickedTimes[i] != null) {\n finalTime += rabbitClickedTimes[i] - rabbitAppearTimes[i];\n }\n }\n\n // Calls the function to calculate the average reaction time and uppdate the variable with the result\n avReactSpeed = calculateAverageReaction(finalTime, rabbitAppearTimes.length - missedRabbitPenalty) / 1000;\n\n finalTime += missedRabbitPenalty * 4000; // adds the penalty-time for all the missed rabbits\n finalTime += misclickPenalty * 1000; // adds the penalty-time for all the missclicks on screen\n\n finalTime = finalTime / 1000; // sets final Highscore to seconds\n finalTime = finalTime.toFixed(2); // convertint to string and rounding to 2 decimals\n avReactSpeed = avReactSpeed.toFixed(2); // convertint to string and rounding to 2 decimals\n return finalTime; // returning finalTime\n}","title":""},{"docid":"f4ba47d9595a8834f82460f2ac60cb48","score":"0.52332634","text":"function goalTimeCalc(distance, hopefulPace) {\n const goalTime = distance * hopefulPace;\n console.log(hopefulPace);\n const totalTime = \"Your total time for \" + distance + \" miles is \" + goalTime;\n return totalTime;\n }","title":""},{"docid":"d143e8770837b3b8ca384621d88c61c8","score":"0.5229504","text":"averageHoursSlept() {\n let totalHoursSlept = 0;\n this.records.forEach(record => {\n totalHoursSlept += record.hoursSlept\n });\n return Math.ceil(totalHoursSlept / this.records.length);\n }","title":""},{"docid":"f76d48f9e34cfe004219f03355763348","score":"0.5227046","text":"function timeCalc (){\n var tFrequency = sv.frequency;\n var firstTime = sv.first;\n\n var firstTimeConverted = moment(firstTime, \"HH:mm\").subtract(1, \"years\");\n\n var diffTime = moment().diff(moment(firstTimeConverted), \"minutes\");\n\n var tRemainder = diffTime % tFrequency;\n\n minAway = tFrequency - tRemainder;\n\n nextArrive = moment().add(minAway, \"minutes\").format(\"hh:mm\");\n\n }","title":""},{"docid":"c7fa6e03a7bc58712b3abe9c9a311b8b","score":"0.5222191","text":"function FindHoursDifferencebetweenPickupAndDrop(dt2, dt1) {\n // console.log(dt1.getTime());\n var diff = (dt2.getTime() - dt1.getTime()) / 1000;\n diff /= 60;\n diff /= 60;\n return Math.abs(Math.round(diff));\n}","title":""},{"docid":"601075e761542d6e96eb294d494e2e9f","score":"0.5222126","text":"function calculateDuration() {\n\t\t\treturn endTime - startTime;\n\t\t}","title":""},{"docid":"601075e761542d6e96eb294d494e2e9f","score":"0.5222126","text":"function calculateDuration() {\n\t\t\treturn endTime - startTime;\n\t\t}","title":""},{"docid":"601075e761542d6e96eb294d494e2e9f","score":"0.5222126","text":"function calculateDuration() {\n\t\t\treturn endTime - startTime;\n\t\t}","title":""},{"docid":"73d2deb5f4c51d6b97f27afccbb0372c","score":"0.5220317","text":"function cookingTime(eggs){\n return Math.ceil(eggs / 8) * 5;\n}","title":""},{"docid":"43ebb31a15def32a394daeada0735c77","score":"0.5218337","text":"function calculateElapsedTime() {\n let currTime = new Date();\n if (isPaused) gamePausedTime = currTime - gameCurrTime;\n if (!hasWon) gameCurrTime = currTime - gamePausedTime;\n}","title":""},{"docid":"b9c954f0e9ea5fa607a02873cc08b291","score":"0.5209115","text":"function getHoursPerWeek() {\n hoursPerWeek = hoursPerDay * daysPerWeek;\n\n\n}","title":""},{"docid":"1e8e3ad5f95ceca557d603b85dc85628","score":"0.520206","text":"function remainingTime(timestr) {\n const targetTime = timestr.split(\":\");\n let hours = parseInt(targetTime[0]) - time.getHours();\n if (hours < 0) hours = 24 + hours;\n let minutes = parseInt(targetTime[1]) - time.getMinutes();\n if (minutes < 0) {\n if (hours === 0) hours = 24;\n hours --;\n minutes += 60;\n }\n if ((hours === 0) && (minutes === 0)) setNotDisplayTime(true);\n else if (hours === 0) return `${minutes} min`\n else if (minutes === 0) return `${hours} h`\n return `${hours} h ${minutes} min`;\n }","title":""},{"docid":"4d938200e0d94dbc5f471cea748cae2d","score":"0.52008194","text":"function hoursWorkedOnDate(employee, dateOfDiff) {\n let inEvent = employee.timeInEvents.find((e) => e.date === dateOfDiff);\n let outEvent = employee.timeOutEvents.find((e) => e.date === dateOfDiff);\n\n // let hourseWorked = employee.timeOutEvents.hour - employee.timeInEvents.hour;\n\n return (outEvent.hour - inEvent.hour) / 100;\n}","title":""},{"docid":"17249534c51918b98948533ffafe1839","score":"0.51945835","text":"function calculateDuration() {\n return endTime - startTime;\n }","title":""},{"docid":"4d3df9a815bf8aa8183c8558481cfb80","score":"0.5193312","text":"timeInDays(hours){\r\n hours*=Hr\r\n return hours/Day\r\n }","title":""},{"docid":"d998dbe93ca5bd4a851a5341c71fc2df","score":"0.51924","text":"function getTimeRemaining (endtime){ // A function that calculates the remainder of the time and receives hours, minutes and seconds.\r\n let t = Date.parse(endtime) - Date.parse(new Date()), \r\n seconds = Math.floor((t / 1000) % 60), // We get seconds through the remainder. \r\n minutes = Math.floor((t / 1000 / 60) % 60), // We get minutes.\r\n hours = Math.floor((t / (1000*60*60))); // We get the minutes.\r\n // days = Math.floor((t / (1000*60*60*24))); // Get the days.\r\n\r\n return { // We create an object with the obtained values and return it. getTimeRemaining(endtime).seconds, getTimeRemaining(endtime).seconds, getTimeRemaining(endtime).hours.\r\n 'total' : t,\r\n 'seconds' : seconds,\r\n 'minutes' : minutes,\r\n 'hours' : hours\r\n };\r\n }","title":""},{"docid":"42e1635541131d20a707332fe4698582","score":"0.51910955","text":"function getTotalTime() {\n // Create Temporal Total Time\n let total_time = 0;\n\n // Add Time by Service\n servicesContracted.map(\n (service) =>\n (total_time += servicesList.filter(\n (serviceFilter) => serviceFilter.id == service\n )[0].duration)\n );\n\n // Return Total Time\n return total_time;\n }","title":""},{"docid":"ae85c63a68c72bb603a1359421a06343","score":"0.51896214","text":"function howManySeconds(hours) {\n return hours*(60 * 60)\n\n\n}","title":""},{"docid":"c3f8804a1f9f9a774d742f8bdb4cade6","score":"0.51855505","text":"get arrivalTime() {\r\n\t\treturn this.launchTime + this.totalTime;\r\n\t}","title":""},{"docid":"6dc75a8f29ff3a678e8ae109ff1387a5","score":"0.5185063","text":"function timeLeft(typeLateMeal, hour, min)\n{\n var hourLeft\n var minLeft;\n\n if (typeLateMeal == 0) // lunch late meal\n {\n hourLeft = 15 - hour;\n minLeft = (45 + (60 * hourLeft)) - min;\n /*if (minLeft > 45) // 2:45 - 3 window\n {\n hourLeft = 0;\n } */\n\n if (hourLeft != 0 && minLeft <= 45)\n {\n document.getElementById(\"timeUntil\").innerHTML = \" \" + hourLeft + \" hour and \" + minLeft + \" minutes until Late Meal ends.\" + \" \";\n }\n else if (hourLeft != 0 && (minLeft - 60) > 0)\n {\n document.getElementById(\"timeUntil\").innerHTML = \" \" + hourLeft + \" hour and \" + (minLeft - 60) + \" minutes until Late Meal ends.\" + \" \";\n }\n else\n {\n document.getElementById(\"timeUntil\").innerHTML = \" \" + minLeft + \" minutes until Late Meal ends.\" + \" \";\n }\n }\n else // dinner late meal\n {\n hourLeft = 21 - hour; // hour remaining only if it's before 9\n minLeft = 60 - min;\n\n if (hourLeft != 0)\n {\n document.getElementById(\"timeUntil\").innerHTML = \" \" + hourLeft + \" hour and \" + minLeft + \" minutes until Late Meal ends.\" + \" \";\n }\n else\n {\n document.getElementById(\"timeUntil\").innerHTML = \" \" + minLeft + \" minutes until Late Meal ends.\" + \" \";\n }\n }\n}","title":""},{"docid":"5758111b7d1bb3622e439abf8990c9fd","score":"0.5181131","text":"function retrieveTime(){\r\n\tlet t = (new Date().getTime() - time) / 1000;\r\n\t return Math.trunc(t);\t\r\n}","title":""},{"docid":"4156b271fd9bb0a83823bd38baecd6a9","score":"0.517832","text":"function calcTravelTime(travelDate) {\n let today = new Date();\n // Number of milliseconds per day\n const msPerDay = 24 * 60 * 60 * 1000; \n\n let daysAway = (travelDate.getTime() - today.getTime())/msPerDay;\n daysAway = Math.floor(daysAway);\n let dateInfo = document.getElementById('date-info');\n dateInfo.innerHTML = \"\";\n\n const p = document.createElement(\"P\");\n p.innerHTML = `Your trip is ${daysAway} days away`;\n dateInfo.appendChild(p);\n\n return daysAway;\n}","title":""},{"docid":"4e908bf7c87332bb7c8c2a1257efd363","score":"0.5168434","text":"function calculatePay()\n{\n var hours=prompt(\"Enter hours of work: \",\"hours of work\")\n var rph=prompt(\"Enter rate per hour: \",\"rate per hour\")\n console.log('Your weekly earning is ',parseInt(hours)*parseInt(rph))\n}","title":""},{"docid":"ba44a11ba990a8acb8d83b6a038f0b37","score":"0.51560515","text":"function calc_strength_hours(start_strength_level, end_strength_level, attack_level) {\n var total_hours = 0;\n for (; start_strength_level < end_strength_level; start_strength_level++) {\n var hours_to_level = calc_time_to_next_level(attack_level, start_strength_level, 2)[0];\n total_hours = total_hours + hours_to_level;\n }\n return total_hours;\n }","title":""},{"docid":"b1cd5cbf53e20652bcde98a56ff9c6b2","score":"0.5150969","text":"function calculateWage(arr){\n\n //Converts the minutes to decimal value, i.e: 16:30 -> 16.5, 16:05 -> 16.08\n function minutesToDecimal(minutes){\n //Divide by 60 in order to make time decimal and remove any periods.\n let decimal = String(minutes / 60).replace(`.`, ``);\n //If the number is bigger than 0.1, remove the zero, i.e: 07 -> 7\n if (decimal >= 0.1)\n decimal = decimal.replace(0, ``);\n\n return decimal;\n }\n\n let wage = document.getElementById(\"input_wage\").value;\n let overtime = 8;//After 8 hours of work it is considered overtime, 7 on friday\n let pay = 0;\n let averagePay = 0;\n let weeklyHours = 0;\n let totalHoursWorked = 0;\n let totalOvertimeHours = 0;\n let totalOvertimePay = 0;\n let count = 0;\n\n for (let day of arr)\n {\n count++;\n //Take the input and make an array out of it, [0] = Hour, [1] = Minutes\n let end = day.End.split(\":\");\n let start = day.Start.split(\":\");\n\n let startMinutes = minutesToDecimal(start[1]);\n let endMinutes = minutesToDecimal(end[1]);\n let shiftStart = Number(start[0] + \".\" + startMinutes);\n let shiftEnd = Number(end[0] + \".\" + endMinutes);\n\n let hoursWorked = shiftEnd - shiftStart;\n totalHoursWorked += hoursWorked;\n\n let overtimeHours = hoursWorked - overtime;\n let overtimePay = 0;\n\n //Overtime system\n if (overtimeHours > 0)\n {\n let extraOvertime = 0;\n let extra = false;\n\n //150% Overtime system - if worked over 10 hours\n if (hoursWorked > 10){\n extra = true;\n extraOvertime = hoursWorked - 10;\n overtimePay += extraOvertime * wage * 1.5;\n }\n\n totalOvertimeHours += overtimeHours;\n if (extra)\n overtimeHours -= extraOvertime;\n\n overtimePay += overtimeHours * wage * 1.25;\n totalOvertimePay += overtimePay;\n\n if (extra)\n overtimeHours += extraOvertime;\n }\n\n let dailyPay = (hoursWorked - overtimeHours) * wage + overtimePay;\n pay += dailyPay;\n averagePay += dailyPay;\n }\n\n let msg = `You have worked ${totalHoursWorked.toFixed(1)} hours and earned a total of ${Math.round(pay)} shekels.`;\n msg += `<br>Your average pay is ${(averagePay/count).toFixed(0)} shekels per day.`;\n\n if (totalOvertimePay > 0)\n msg += `<br>That includes ${totalOvertimeHours.toFixed(1)} hours overtime that yielded ${Math.round(totalOvertimeHours*wage*1.25 - totalOvertimeHours*wage)} extra shekels.`;\n\n document.getElementById(\"para\").innerHTML = msg;\n}","title":""},{"docid":"1b2a9f25941709c05bc02efee8317457","score":"0.51500773","text":"function returnElapsedTime() {\n\n let now = performance.now();\n\n // Find the distance between now and the starting time\n let distance = now - startGameTime;\n\n // Time calculations for minutes and seconds\n let minutes = Math.floor((distance % (1000 * 60 * 60)) / (1000 * 60));\n let seconds = Math.floor((distance % (1000 * 60)) / 1000);\n\n return minutes + \"m \" + seconds + \"s \";\n}","title":""}],"string":"[\n {\n \"docid\": \"9b37ced5e8fd2a23e3bdba7a4db617c6\",\n \"score\": \"0.6523558\",\n \"text\": \"function getQuote4Hours(offer, h) {\\n var cost = 0;\\n if (offer.setup != \\\"\\\" ) {\\n cost += offer.setup;\\n }\\n if (\\\"continuous\\\" in offer && offer.continuous != \\\"\\\" ) {\\n\\n if (offer.continuous == 1) {\\n var periods = Math.ceil(h / offer.time_limit);\\n cost += periods * offer.yearly;\\n return cost;\\n } else if (offer.continuous == 2.5) {\\n // Tsubame 2.5\\n // koeff3 is 1 for jobs running <= 1 day.\\n var koeff3 = 1;\\n var nodes = 1;\\n var periods = Math.ceil(h * koeff3 * nodes / offer.time_limit);\\n //console.log(offer.shortname+\\\" periods=\\\"+periods+\\\" for hours=\\\"+h);\\n cost += periods * offer.yearly;\\n return cost;\\n }\\n }\\n // Apply monthly limit\\n if (\\\"month_limit\\\" in offer && offer.month_limit != \\\"\\\" ) {\\n //console.log(\\\"Month limit for \\\"+offer.shortname+\\\" is \\\" + offer.month_limit);\\n var months = getMonths4Hours(h);\\n cost += offer.month_limit * months[0];\\n h = months[1]; // use leftover time to calculate additional cost\\n }\\n if (\\\"minutely\\\" in offer && offer.minutely != \\\"\\\") {\\n var cost1 = 60 * h * offer.minutely;\\n // Apply monthly limit\\n if (\\\"month_limit\\\" in offer && offer.month_limit != \\\"\\\" ) {\\n if (cost1 > offer.month_limit) {\\n cost1 = offer.month_limit;\\n }\\n }\\n cost += cost1;\\n }\\n else if (\\\"hourly\\\" in offer && offer.hourly != \\\"\\\" ) {\\n var cost1 = h * offer.hourly;\\n // Apply monthly limit\\n if (\\\"month_limit\\\" in offer && offer.month_limit != \\\"\\\" ) {\\n if (cost1 > offer.month_limit) {\\n cost1 = offer.month_limit;\\n }\\n }\\n cost += cost1;\\n } else if (\\\"weekly\\\" in offer && offer.weekly != \\\"\\\" ) {\\n var period_w = Math.ceil(h / (24 * 7));\\n cost1 = period_w * offer.weekly;\\n // Apply monthly limit\\n if (\\\"month_limit\\\" in offer && offer.month_limit != \\\"\\\" ) {\\n if (cost1 > offer.month_limit) {\\n cost1 = offer.month_limit;\\n }\\n }\\n cost += cost1;\\n } else if (\\\"monthly\\\" in offer && offer.monthly != \\\"\\\" ) {\\n var months = getMonths4Hours(h);\\n var more_than_a_month = 0;\\n if (months[1] > 0) {\\n more_than_a_month = 1;\\n }\\n cost += (months[0] + more_than_a_month)* offer.monthly;\\n //console.log(\\\"Monthly: \\\"+ offer.shortname + \\\" \\\"+offer.monthly);\\n //console.log(months);\\n } else if (\\\"yearly\\\" in offer && offer.yearly != \\\"\\\" ) {\\n // Year is counted as 365 days\\n var period_y = Math.ceil(h / (24 * 365));\\n cost += period_y * offer.yearly;\\n }\\n return cost;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54bcb003f0ff95282253e18bf0a90203\",\n \"score\": \"0.6221985\",\n \"text\": \"calcHours() {\\n let hours = Math.floor(this.availableMins / 60)\\n let mins = this.availableMins % 60\\n this.timeRem = hours + \\\"h \\\" + mins + \\\"m\\\"\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"854d6cd241d752fd081751ce0a7fa88b\",\n \"score\": \"0.6201337\",\n \"text\": \"function calculateTime(departure, arrival) {\\n\\n var year = new Date().getFullYear();\\n var newDeparture = new Date(year + \\\" \\\" + departure);\\n var newArrival = new Date(year + \\\" \\\" + arrival);\\n\\n\\n\\n var result = (newArrival - newDeparture);\\n\\n //TODO:\\n var hours = Math.floor(result / 36e5);\\n var minutes = Math.floor((result % 36e5) / 6e4);\\n var seconds = Math.floor(((result % 36e5) % 6e4) / 1000);\\n return hours + \\\" Hours \\\" + minutes + \\\" minutes \\\" + seconds + \\\" seconds\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d49ee37d07c5e0406dd3c26343404853\",\n \"score\": \"0.61936146\",\n \"text\": \"function main(restTime, pricePerHardware, pricePerSoftware, frappePrice) {\\n let computerHardwareTime = 3 * 2;\\n let softwareTime = 2 * 2;\\n let timeSpent = 5 + computerHardwareTime + softwareTime;\\n let remainingTime = restTime - timeSpent;\\n let moneySpent = (pricePerHardware * 3) + (pricePerSoftware * 2) + frappePrice;\\n console.log(moneySpent.toFixed(2));\\n console.log(remainingTime);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25b7d108e3491fafdb30f65b274bf54c\",\n \"score\": \"0.6036661\",\n \"text\": \"calcTime() {\\n const numIng = this.ingredients.length;\\n const periods = Math.ceil(numIng / 3);\\n this.time = periods * 15;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4126865dffdafcf2ebb7eb8f16d00b18\",\n \"score\": \"0.59662\",\n \"text\": \"calculateTime() {\\n const numIng = this.ingredients.length;\\n const periods = Math.ceil(numIng / 3);\\n this.time = periods * 15;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95e5351af54959298ae142adb0d56fa7\",\n \"score\": \"0.59063345\",\n \"text\": \"calcTime() {\\n this.cookingTime = Math.ceil(this.ingredients.length / 3) * 15;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69bfa26cc7ebb7588c6ace4d6cb4857b\",\n \"score\": \"0.59019727\",\n \"text\": \"function hotelCost(time) {\\n var cost = 0;\\n if (time < 0) {\\n return \\\"Time is won't be Negative.\\\"\\n }\\n //This is about staying 10 days in hotelCost.\\n else if (time <= 10) {\\n cost = time * 100;\\n }\\n // This is about staying 20 days in hotelCost.\\n else if (time <= 20) {\\n var firstStay = 10 * 100;\\n var countTime = time - 10;\\n var secondStay = countTime * 80;\\n cost = firstStay + secondStay;\\n }\\n // This is about staying 21 days or more in hotelCost.\\n else {\\n var firstStay = 10 * 100;\\n var secondStay = 10 * 80;\\n var countTime = time - 20;\\n var thirdStay = countTime * 50;\\n cost = firstStay + secondStay + thirdStay;\\n }\\n return cost;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"763bba0e86bf18c616c32b943121069d\",\n \"score\": \"0.58640164\",\n \"text\": \"function getQuote4Seconds(offer, sec, nodes) {\\n //console.log(sec+\\\"sec\\\");\\n var cost = 0;\\n if (nodes == null || nodes == \\\"\\\") {\\n nodes = 1;\\n }\\n if (offer.setup != \\\"\\\" ) {\\n cost += offer.setup * nodes; // Assume setup price is per node\\n }\\n if (\\\"continuous\\\" in offer && offer.continuous != \\\"\\\" ) {\\n var h = Math.ceil(sec / 3600); // sec -> hours for cost calculations\\n var hours = offer.time_limit;\\n if (offer.continuous == 1) {\\n var periods = Math.ceil(h / hours);\\n cost += periods * offer.yearly * nodes;\\n return cost;\\n } else if (offer.continuous == 2.5) {\\n // Tsubame 2.5\\n var koeff3 = tsubame_koeff[0];\\n for (var k=0; k < tsubame_border.length; k++) {\\n if (tsubame_border[k] < h) {\\n koeff3 = tsubame_koeff[k+1];\\n } else {\\n break;\\n }\\n }\\n if (koeff3 < 0) {\\n console.log(offer.shortname + \\\" cannot be used for \\\"+h+\\\" hours and \\\"+ nodes + \\\" nodes.\\\");\\n return -1; // Jobs cannot be run for more than 96 hours on Tsubame2.5\\n }\\n var periods = Math.ceil(h * nodes * koeff3 / hours);\\n //console.log(\\\" periods=ceil(\\\"+h+\\\"x\\\"+nodes+\\\"x\\\"+ koeff3+\\\"/\\\"+hours+\\\")=\\\"+(periods));\\n cost = periods * offer.yearly;\\n //console.log(\\\" getQuote4Seconds 2 cost: \\\"+periods+\\\" x \\\"+offer.yearly+ \\\" = \\\"+cost);\\n return cost;\\n }\\n }\\n // Apply monthly limit\\n if (\\\"month_limit\\\" in offer && offer.month_limit != \\\"\\\" ) {\\n //console.log(\\\"Month limit for \\\"+offer.shortname+\\\" is \\\" + offer.month_limit);\\n var months = getMonths4Seconds(sec);\\n //console.log(\\\"Months:\\\"+months);\\n cost += offer.month_limit * months[0] * nodes;\\n sec = months[1]; // use leftover time to calculate additional cost\\n }\\n if (\\\"minutely\\\" in offer && offer.minutely != \\\"\\\") {\\n var cost1 = Math.ceil(sec / 60) * offer.minutely * nodes;\\n // Apply monthly limit\\n if (\\\"month_limit\\\" in offer && offer.month_limit != \\\"\\\" ) {\\n if (cost1 > offer.month_limit * nodes) {\\n cost1 = offer.month_limit * nodes;\\n }\\n }\\n cost += cost1;\\n }\\n else if (\\\"hourly\\\" in offer && offer.hourly != \\\"\\\" ) {\\n var cost1 = Math.ceil(sec / 3600) * offer.hourly * nodes;\\n //console.log (\\\" \\\"+sec+\\\"sec. cost1= \\\"+Math.ceil(sec / 3600)+\\\"x\\\"+offer.hourly+\\\" = \\\"+cost1);\\n // Apply monthly limit\\n if (\\\"month_limit\\\" in offer && offer.month_limit != \\\"\\\" ) {\\n if (cost1 > offer.month_limit * nodes) {\\n cost1 = offer.month_limit * nodes;\\n }\\n }\\n cost += cost1;\\n } else if (\\\"weekly\\\" in offer && offer.weekly != \\\"\\\" ) {\\n var period_w = Math.ceil(sec / (24 * 7 * 3600));\\n var cost1 = period_w * offer.weekly * nodes;\\n // Apply monthly limit\\n if (\\\"month_limit\\\" in offer && offer.month_limit != \\\"\\\" ) {\\n if (cost1 > offer.month_limit * nodes) {\\n cost1 = offer.month_limit * nodes;\\n }\\n }\\n cost += cost1;\\n } else if (\\\"monthly\\\" in offer && offer.monthly != \\\"\\\" ) {\\n var months = getMonths4Seconds(sec);\\n var more_than_a_month = 0;\\n if (months[1] > 0) {\\n more_than_a_month = 1;\\n }\\n cost += (months[0] + more_than_a_month)* offer.monthly * nodes;\\n //console.log(\\\"Monthly: \\\"+ offer.shortname + \\\" \\\"+offer.monthly+\\\" cost=\\\"+cost);\\n } else if (\\\"yearly\\\" in offer && offer.yearly != \\\"\\\" ) {\\n // Year is counted as 365 days\\n var period_y = Math.ceil(sec / (3600 * 24 * 365));\\n cost += period_y * offer.yearly * nodes;\\n }\\n return cost;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2a25f1781259d4ad14f88f50643f367\",\n \"score\": \"0.5846417\",\n \"text\": \"timeLeft(){\\n let time = new Date().getTime()\\n let dateFinReservation = (parseInt(this.dateReservation)+(20*60000));\\n return dateFinReservation - time;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d1fe5c1a25c4a41252a7e38f5029fc8\",\n \"score\": \"0.5834692\",\n \"text\": \"getRemainingTime() {\\n if( this.expired() ) {\\n return 0;\\n }\\n \\n // never return a neg number + account for pause time\\n let rt = this.startTime + this.duration + this.getPauseTime() - millis();\\n if( rt < 0 )\\n rt = 0;\\n return rt;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fcb433f78104a32b9afedc89a336383\",\n \"score\": \"0.58283395\",\n \"text\": \"function timer(){\\n const currentDate = new Date();\\n const offerTime = new Date(\\\"31 July 2021\\\");\\n const totalSec = (offerTime-currentDate)/1000;\\n \\n const remainingDays = Math.floor(totalSec/(3600*24)) > 0 ? Math.floor(totalSec/(3600*24)) : 0;\\n const remainingHours = Math.floor((totalSec/3600)%24) > 0 ? Math.floor((totalSec/3600)%24) : 0;\\n const remainingMinutes = Math.floor((totalSec/60)%60) > 0 ? Math.floor((totalSec/60)%60) : 0;\\n const remainingSecs = Math.floor(totalSec%60) >= 0 ? Math.floor(totalSec%60) : 0;\\n \\n $('#days').html(remainingDays);\\n $('#hours').html(remainingHours);\\n $('#minutes').html(remainingMinutes);\\n $('#seconds').html(remainingSecs);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"016a0e7bf16a9c3d26a1638155fce86b\",\n \"score\": \"0.5781841\",\n \"text\": \"function hours_spent () {\\n\\t\\n\\teval_pages = document.roi_calculator.e_pages.value;\\n\\teval_client = formatInt(document.roi_calculator.e_client.value);\\n\\teval_replace = formatInt(document.roi_calculator.e_replace.value);\\n\\tprnt_time = formatInt(document.roi_calculator.e_prnt_time.value);\\n\\ttotal_prnt_return = eval_client + (eval_replace * 50);\\n\\thr_spent = total_prnt_return *(prnt_time/60);\\n\\tdocument.roi_calculator.e_hr_spent.value = formatCurrency(hr_spent) + 'hrs';\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc81081109d89f870296e08cb4184fd7\",\n \"score\": \"0.5781678\",\n \"text\": \"function lateRide(n) {\\n let h = n / 60;\\n let r = h % 1;\\n let m = r * 60;\\n let str = String(Math.floor(h)) + String(Math.round(m));\\n let tot = 0;\\n for (let num in str) {\\n tot += Number(str[num]);\\n }\\n console.log(str);\\n return tot;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"309fe4e86d9e91c5d5cb24bf8fc7a99c\",\n \"score\": \"0.5742347\",\n \"text\": \"static roundRemainingTime() {\\n let round;\\n if ((round = TurkServer.currentRound()) == null) {\\n return;\\n }\\n if (round.endTime == null) {\\n return;\\n }\\n return Math.max(0, round.endTime - TimeSync.serverTime());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"333fdd6fa17a42807e2682b2d726481d\",\n \"score\": \"0.57392764\",\n \"text\": \"function question6(){\\n bgn=hmstosec('09:00:00');\\n end=hmstosec('00:00:00');\\n end += 60*60*24;\\n onedayduration = end - bgn;\\n totalDuration=0;\\n tasks.forEach(function(value){\\n totalDuration += value.duration;\\n });\\n days=totalDuration*60/onedayduration;\\n return days;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ba3783010c3d4e4bf269e631c9ce874\",\n \"score\": \"0.57280236\",\n \"text\": \"function mineTimeEstimate(){//outputs to console.log estimated time to mine in Hours Mins Seconds. Returns estimted time in seconds.\\n\\tadjustedHashRate=admin.miner.hashrate()*1000*1.04;//1000 is to fix an error. 1.08 is assuming at least 2 uncles every 25 blocks.\\n\\t//Remove the factor of 1000 once this issue has been fixed in the version of geth which you are using.\\n\\testimatedSeconds=eth.getBlock(\\\"latest\\\").difficulty/adjustedHashRate;\\n\\tconsole.log(Math.floor(estimatedSeconds/3600.)+\\\" Hrs, \\\"+Math.floor((estimatedSeconds%3600)/60)+\\\" Mins, \\\"+Math.floor(estimatedSeconds%60)+\\\" Sec, estimated time until next successful block mined.\\\");\\n\\treturn estimatedSeconds;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9666042d3ba7e858fa802a92821d15fc\",\n \"score\": \"0.5717128\",\n \"text\": \"function getIdealSleepHours() {\\n return 7*7;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3cdc15ce42cacad78e0ec007a65fa4a0\",\n \"score\": \"0.57038945\",\n \"text\": \"function question4(){\\n var typeDuration=[]\\n employeeType.forEach(function(value){\\n bgn=hmstosec(value.work_begin);\\n end=hmstosec(value.work_end);\\n if (bgn > end){\\n end += 60*60*24;\\n }\\n var secondDuration = end-bgn;\\n typeDuration.push(secondDuration);\\n });\\n totalworksec=0;\\n employees.forEach(function(value){\\n var worktype=value.type;\\n var perduration=typeDuration[worktype-1];\\n totalworksec += perduration;\\n });\\n var totalworkhour=totalworksec/3600;\\n return totalworkhour;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d9561b803dee5584b424782dde8eb2a\",\n \"score\": \"0.56767744\",\n \"text\": \"function _hrDuration() { var t1 = clk(); for (var i=0; i<timeRuns; i++) clk(); return (clk() - t1) / (timeRuns + 1) }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa92e457d8a4e50b74edd79ad10fc4ea\",\n \"score\": \"0.5663311\",\n \"text\": \"function getActualSleepHours(){\\n let monday=getSleepHours('Monday');\\n let tuesday=getSleepHours('Tuesday');\\n let wednesday=getSleepHours('Wednesday');\\n let thursday=getSleepHours('thursday');\\n let friday=getSleepHours('friday');\\n let saturday=getSleepHours('saturday');\\n let sunday=getSleepHours('sunday');\\n let totalSleep;\\n totalSleep=monday + tuesday+wednesday+thursday+friday+saturday+sunday;\\n return totalSleep;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50df5b9a25dec54016eca918527bdeaf\",\n \"score\": \"0.56487036\",\n \"text\": \"function getTimeRemaining(endtime) {\\n\\n let t = Date.parse(endtime) - Date.parse(new Date()),\\n seconds = Math.floor((t / 1000) % 60), //?????????, ????? ??????????? ? ????????? ? ??????? - ???????? ??????? ?? ???????\\n minutes = Math.floor((t / 1000 / 60) % 60),\\n /* hours = Math.floor( (t / (1000 * 60 * 60)) );// - ??? ?? ?????*/\\n hours = Math.floor((t) % (24 * 60 * 60 * 1000) / (60 * 60 * 1000));\\n\\n\\n return {\\n total: t,\\n hours: hours,\\n minutes: minutes,\\n seconds: seconds\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e887e34ed42411b91690b9763dea6bd\",\n \"score\": \"0.5631369\",\n \"text\": \"function calculateSleepDebt() {\\n if (getIdealSleepHours() === getActualSleepHours()) {\\n console.log('There is no sleep debt!')\\n } else if (getIdealSleepHours() < getActualSleepHours()) {\\n console.log('You have a sleep surplus of ' + (getActualSleepHours() - getIdealSleepHours()) + ' hours.')\\n } else if (getIdealSleepHours() > getActualSleepHours()) {\\n console.log('You have a sleep debt of ' + (getIdealSleepHours() - getActualSleepHours()) + ' hours.')\\n } else {\\n console.log('The fuck have you done bruv?');\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b57405a325f893fadb0050ca0d4fb48e\",\n \"score\": \"0.56279373\",\n \"text\": \"static breakRemainingTime() {\\n let nextRound, round;\\n if ((round = TurkServer.currentRound()) == null) {\\n return;\\n }\\n const now = Date.now();\\n if (round.startTime <= now && round.endTime >= now) {\\n // if we are not at a break, return 0\\n return 0;\\n }\\n\\n // if we are at a break, we already set next round to be active.\\n if ((nextRound = RoundTimers.findOne({ index: round.index + 1 })) == null) {\\n return;\\n }\\n if (nextRound.startTime == null) {\\n return;\\n }\\n return Math.max(0, nextRound.startTime - TimeSync.serverTime());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c2e2abfd472a75bf35d6cb0ebdf736c\",\n \"score\": \"0.5599546\",\n \"text\": \"function getActualSleepHours() {\\n var total = 0;\\n total += getSleepHours('Monday');\\n total += getSleepHours('Tuesday');\\n total += getSleepHours('Wednesday');\\n total += getSleepHours('Thursday');\\n total += getSleepHours('Friday');\\n total += getSleepHours('Saturday');\\n total += getSleepHours('Sunday');\\n return total;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f81e9596c08f272a975df0f6d9e8aac7\",\n \"score\": \"0.5588797\",\n \"text\": \"function remaining_time(){\\n var duration = base_time - ( (new Date()).getTime() - time_tracker );\\n var seconds = parseInt((duration / 1000) % 60);\\n var minutes = parseInt((duration / (1000 * 60)) % 60);\\n var hours = parseInt((duration / (1000 * 60 * 60)) % 24);\\n\\n hours = (hours < 10) ? \\\"0\\\" + hours : hours;\\n minutes = (minutes < 10) ? \\\"0\\\" + minutes : minutes;\\n seconds = (seconds < 10) ? \\\"0\\\" + seconds : seconds;\\n\\n return hours + \\\":\\\" + minutes + \\\":\\\" + seconds;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1bba9ea465746cf3d39826c6ed45c4bc\",\n \"score\": \"0.55787003\",\n \"text\": \"static roundElapsedTime() {\\n let round;\\n if ((round = TurkServer.currentRound()) == null) {\\n return;\\n }\\n if (round.startTime == null) {\\n return;\\n }\\n return Math.max(0, TimeSync.serverTime() - round.startTime);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"509ff7d5487aa8695cf5089ce1ab9afd\",\n \"score\": \"0.5577676\",\n \"text\": \"function getHourTime() {\\n let time = 60;\\n return (Math.floor(new Date()/1000) + time * 60);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a173e90ad588795d7a3a4276bd4bef1f\",\n \"score\": \"0.5550564\",\n \"text\": \"timeInHours(minutes){\\r\\n minutes*=Min\\r\\n console.log(Hr)\\r\\n return minutes/Hr\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8aa2a477fcacbfa10a1fa9cf255165c8\",\n \"score\": \"0.5504384\",\n \"text\": \"getEstimatedShareHashrate(difficulty, timeToFindSeconds )\\n {\\n if(timeToFindSeconds!= null && timeToFindSeconds>0)\\n {\\n\\n var hashrate = web3utils.toBN(difficulty).mul( web3utils.toBN(2).pow( web3utils.toBN(22) )).div( web3utils.toBN( timeToFindSeconds ) )\\n\\n return hashrate.toNumber(); //hashes per second\\n\\n }else{\\n return 0;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3bbde747a4efe757f8bed133d217fdc\",\n \"score\": \"0.5494408\",\n \"text\": \"static hours_per_week() { return Starship.hours_per_day() * Starship.days_per_week() }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be3a6a095be7c87757cf26412b1e8de6\",\n \"score\": \"0.5489626\",\n \"text\": \"function totalCost(number_of_days, booking_cost_per_night) {\\n return number_of_days * booking_cost_per_night;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7f7b82d8744785192d148db1ddfc5e3\",\n \"score\": \"0.5481771\",\n \"text\": \"function computeTime(distance) {\\n return 100 + Math.sqrt(distance) * 30;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69dfcaf819977a075f9b134b5c525774\",\n \"score\": \"0.5480879\",\n \"text\": \"function calculateTimeToCoffee() {\\n // let timeCalculated = moment().toNow();\\n session.send(textContent.inProgress);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ecd0460b852bc9963f6975346025223\",\n \"score\": \"0.5466228\",\n \"text\": \"calculateTime(){\\n const numIng = 4\\n const periods = Math.ceil(numIng / 3)\\n this.time = periods * 15\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e74cdc63896caaf961ba0a1ecf9acfd5\",\n \"score\": \"0.54587615\",\n \"text\": \"function returnTime() {\\n time_at_the_end = new Date().getTime();\\n total_banner_time = (time_at_the_end - time_at_the_beginig) * 0.001;\\n console.log(total_banner_time + ' seconds.');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"daca2ea2d7b03dd4de29b0d73bc9ee74\",\n \"score\": \"0.5457624\",\n \"text\": \"function calcularTiempoEjecucion(){\\r\\n\\t\\tvar tiempo = new Date().getTime() - tiempo_ejecucion;\\r\\n\\t\\tvar div = find(\\\"//div[@id='ltime']\\\", XPFirst);\\r\\n\\t\\tdiv.appendChild(elem(\\\"P\\\", \\\"TB: \\\" + tiempo + \\\" ms\\\"));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6eef811fbcc17df4019501167ba7a98\",\n \"score\": \"0.5438358\",\n \"text\": \"function GS_getDuration( ) {\\n var timeArr = $(\\\"span#time-total\\\").text().split(\\\":\\\");\\n return parseInt( timeArr[0] ) * 60 + parseInt( timeArr[1] );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ded8fb0f56194c923a84be176e67f63\",\n \"score\": \"0.54355186\",\n \"text\": \"function tripTime(start, end) {\\n start = start.split(':');\\n end = end.split(':')\\n var dep = new Date();\\n dep.setHours(start[0], start[1], start[2])\\n var arr = new Date();\\n arr.setHours(end[0], end[1], end[2]);\\n var int = arr - dep;\\n var h, m, s;\\n h = Math.floor(int / 1000 / 60 / 60);\\n m = Math.floor((int - h * 3600000) / 1000 / 60);\\n s = Math.floor((int - h * 3600000 - m * 60000) / 1000);\\n return h + ' hours ' + m + ' minutes ' + s + ' seconds';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"276fceb6915dbe699eb559ad5cf4daf1\",\n \"score\": \"0.5433992\",\n \"text\": \"function getTimeSpent(){\\n\\t\\t\\tvar settings = {\\n \\\"async\\\": false,\\n \\\"crossDomain\\\": true,\\n \\\"url\\\": \\\"/api/Rest/v1/Users/\\\" + userId + \\\"/enrollments/\\\" + courseId,\\n\\t\\t\\t\\t\\\"tryCount\\\" : 0,\\n\\t\\t\\t\\t\\\"retryLimit\\\" : 3,\\n \\\"method\\\": \\\"GET\\\",\\n \\\"headers\\\": {\\n //\\\"Authorization\\\": token,\\n \\\"Content-Type\\\": \\\"application/json\\\",\\n \\\"cache-control\\\": \\\"no-cache\\\"\\n }\\n }\\n\\n $.ajax(settings).done(function (response) {\\n TimeSpentTicks = response.TimeSpentTicks;\\n }).fail(function (msg) {\\n\\t\\t\\t\\tSaveClose(\\\"There was an issue loading your course. Please close all internet browsers and try again. If you continue to receive this error please reach out to our student support team (904.999.4923 or support@xcelsolutions.com) and provide error code 7728.\\\");\\n });\\n\\t\\t\\t\\n\\t\\t\\tvar convertTimeTicks = \\\"<span style='color:white'>\\\" + Math.floor(((TimeSpentTicks/10000000)/60)/60) + \\\"</span> Hours: <span style='color:white'> \\\" + Math.floor(((TimeSpentTicks/10000000)/60) % 60) + \\\"</span> Minutes\\\";\\n\\t\\t\\treturn convertTimeTicks;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86526d2d6370379d405a108bfb5f3bdd\",\n \"score\": \"0.5430013\",\n \"text\": \"function getTimeLeft(time){\\n var today = new Date();\\n currentTime = today.getTime();\\n today.setHours(time.split(\\\":\\\")[0]);\\n today.setMinutes(time.split(\\\":\\\")[1]);\\n var firstTrainTime = today.getTime();\\n //return in minutes\\n return (currentTime - firstTrainTime) / 1000 / 60;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"171a8d7c3fc4dabfa1330adf8a43fed6\",\n \"score\": \"0.54199433\",\n \"text\": \"function timingOut() {\\n const date = Date.now()\\n const tom = new Date().getDate()+1;\\n\\n console.log(date - tom)\\n // const hour = 1000 * 60 * 60;\\n // const anHourAgo = date - hour;\\n // date > anHourAgo;\\n\\n // let timing = 0\\n // for(let t of tasks){\\n // if (t.due_date == true){\\n // console.log(t)\\n // timing += 1\\n // }\\n // }\\n // return timing;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc9b3ec1d593aba00b9aa809fc5bda14\",\n \"score\": \"0.541798\",\n \"text\": \"function calcWage(empHrs) {\\n return empHrs * WAGE_PER_HOUR;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"edef67e828753e93038486c8c729e84e\",\n \"score\": \"0.54124844\",\n \"text\": \"function departureHour(time) {\\n if (time - moment() > 0) {\\n return time;\\n } else {\\n return moment(time).add(1, \\\"days\\\")\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f97a68dd42d19713656560c52e866d19\",\n \"score\": \"0.5401591\",\n \"text\": \"function getTimeByHalfs(n)\\n{\\n\\tvar today = new Date();\\n\\tvar current_hour = today.getHours();\\n\\tvar current_minutes = today.getMinutes();\\n\\tvar minutes = current_minutes > 30 ? 1 : 0.5;\\n\\treturn current_hour + n + minutes;\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebc588fc55479f0f594ee502302d83be\",\n \"score\": \"0.5394902\",\n \"text\": \"estimatedShareHashrate(difficulty, timeToFindSeconds) {\\n\\t if(timeToFindSeconds && timeToFindSeconds > 0) {\\n\\t return this.web3.utils.toBN(difficulty)\\n\\t \\t\\t.mul( this.web3.utils.toBN(2).pow( this.web3.utils.toBN(22) ))\\n\\t \\t\\t.div( this.web3.utils.toBN( timeToFindSeconds ))\\n\\t \\t\\t.toNumber()\\n\\t }\\n\\t return 0\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8f329394d653f0892e9e861973c205f\",\n \"score\": \"0.5392269\",\n \"text\": \"function hotelCost (nightSpent){\\n var bill = 0;\\nif (nightSpent <= 10){\\n bill = nightSpent * 100;\\n}\\nelse if (nightSpent <=20){\\n var firstPhase = 10 * 100;\\n var remaining = nightSpent - 10;\\n var secondPhase = remaining * 80;\\n bill = firstPhase + secondPhase;\\n}\\nelse {\\n var firstPhase = 10 * 100;\\n var secondPhase = 10 * 80;\\n var remaining = nightSpent - 20;\\n var thirdPhase = remaining * 50;\\n bill = firstPhase + secondPhase + thirdPhase;\\n}\\nreturn bill;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"284b196aaa5aaf499bfb2c9ba0853e24\",\n \"score\": \"0.53882074\",\n \"text\": \"function timeRemain(time)\\r\\n{\\r\\n var remain = (time - $.now()) / 60000;\\r\\n return remain.toFixed(0);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ccad9ce9ca7bc4053aa7c70c11aa428\",\n \"score\": \"0.53855205\",\n \"text\": \"function routeTime(route) {\\n var acc = 0;\\n for (i = 0; i < route.legs.length; i++) {\\n acc = acc + route.legs[i].duration.value;\\n }\\n return acc;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51f63a6137654da13679a5452d094f47\",\n \"score\": \"0.53770775\",\n \"text\": \"function timer_add_hours(time,id){\\n\\n var dt = time;\\n dt.setHours( dt.getHours() + 3 );\\n \\n const second = 1000,\\n minute = second * 60,\\n hour = minute * 60,\\n day = hour * 24;\\n\\n let countDown = dt.getTime(),\\n x = setInterval(function() \\n {\\n \\n let now = new Date().getTime(),\\n distance = countDown - now;\\n\\n var countdowntimer = \\\"countdowntimer\\\" + id;\\n document.getElementById(countdowntimer).innerHTML = (Math.floor((distance % (day)) / (hour))) + ':' + (Math.floor((distance % (hour)) / (minute))) +':' + (Math.floor((distance % (minute)) / (second)));\\n \\n //do something after 3 hours are completed.\\n if (distance < 0) {\\n clearInterval(x);\\n $('#start_bidding'+id).hide();\\n $('#bidding_time'+id).css('display','none');\\n $('#countdowntimer'+id).hide();\\n $('#winner'+id).show();\\n \\n }\\n }, 1000) \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eeddf0a38a20eddb37a62ea03da871a\",\n \"score\": \"0.5366027\",\n \"text\": \"function totaltime () {\\n let time1 = new Date(\\\"2016-12-11T00:37:52Z\\\").getTime();\\n let time2 = new Date(\\\"2016-12-11T05:41:50Z\\\").getTime();\\n const totaltime = (time2 - time1)/1000; //in seconds\\n return totaltime + ' seconds';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6e6c2d6e64f586773cd0494f0003590\",\n \"score\": \"0.53659475\",\n \"text\": \"calcPay() {\\n let toPayAmount = this.#hourlyPay * this.#hoursWorked;\\n this.#hoursWorked = 0;\\n return toPayAmount;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e813045b51b46b5db5d8060339dad0b0\",\n \"score\": \"0.5353032\",\n \"text\": \"function timeAfterDifficulties() {\\n if (difficulty == \\\"Easy\\\") {\\n return 3000;\\n } else if (difficulty == \\\"Medium\\\") {\\n return 2000;\\n } else {\\n return 1000;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ef56f3b725a5dad00b7a31da58b0f73\",\n \"score\": \"0.5344263\",\n \"text\": \"calculateTotalTime() {\\n return (\\n this.convertToTimeStamp(this.config.end_date) -\\n this.convertToTimeStamp(this.config.start_date)\\n )\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e7a00919535945915101f3dc8bb5e329\",\n \"score\": \"0.5342564\",\n \"text\": \"function getHoursTime(timer){\\n var seconds = timeLeftGM(timer);\\n if(seconds == 0) return 0;\\n if(isNaN(seconds)) return undefined;\\n var num = parseInt(seconds);\\n var strTime = '';\\n if(num){\\n num /= 60;\\n if(num >= 60){\\n num /= 60;\\n strTime = parseInt(num)+'h ';\\n num -= parseInt(num); num *= 60;\\n }\\n strTime += parseInt(num)+'m ';\\n num -= parseInt(num); num *= 60;\\n strTime += parseInt(num)+'s';\\n }\\n return strTime;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04a31baae332f97192166cc79bb6d2ff\",\n \"score\": \"0.53420067\",\n \"text\": \"function getTravelTime(object){\\n //hours is calculated by roounding of the lower integer\\n const hours = Math.floor(object.destinationDistance/object.speed);\\n //minutes is calculated from the remainder of distace/speed \\n const minutes = Math.floor(((object.destinationDistance%object.speed)/object.speed)*60);\\n const outPut = `${hours} hours and ${minutes} minutes`;\\n return outPut;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b13461855dfd47069aac60673957f367\",\n \"score\": \"0.533888\",\n \"text\": \"timeRemaining(timeObject = false) {\\n\\t\\tvar dTod = new Date(), dTom = new Date(dTod.toUTCString());\\n\\t\\tdTom.setDate(dTom.getDate() + 1); dTom.setUTCHours(0); dTom.setUTCMinutes(0); dTom.setUTCSeconds(0); dTom.setUTCMilliseconds(0);\\n\\t\\tvar baseDeltaH = Math.floor( (dTom - dTod) / (this._HOUR_IN_MS) );\\n\\t\\tvar baseDeltaM = Math.round( (dTom - dTod - baseDeltaH * this._HOUR_IN_MS) / (this._MIN_IN_MS) );\\n\\t\\treturn ( !timeObject ? \\n\\t\\t\\tbaseDeltaH + \\\":\\\" + (baseDeltaM < 10 ? \\\"0\\\" : \\\"\\\" ) + baseDeltaM :\\n\\t\\t\\t{quest: this.getDailyQuest(dTod), hours: baseDeltaH, minutes: baseDeltaM } ) ;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"735b5ad74e7a203cbd66e5839cc95d63\",\n \"score\": \"0.5332124\",\n \"text\": \"function hotelCost(stayDuration) {\\n if (stayDuration >= 1 && stayDuration <= 10) {\\n return (100 * stayDuration);\\n }\\n else if (stayDuration >= 11 && stayDuration <= 20 ) {\\n \\n return ((stayDuration-10) * 80) + 1000;\\n }\\n else if (stayDuration >= 21) {\\n return ((stayDuration-20) * 50) + 1800;\\n }\\n else{\\n return (\\\"Please input a valid number!\\\")\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"972eda98d8da89a74fccdd4f4b5c5802\",\n \"score\": \"0.5317996\",\n \"text\": \"function calc_attack_hours(start_attack_level, end_attack_level, strength_level) {\\n var total_hours = 0;\\n for (; start_attack_level < end_attack_level; start_attack_level++) {\\n var hours_to_level = calc_time_to_next_level(start_attack_level, strength_level, 1)[0];\\n total_hours = total_hours + hours_to_level;\\n }\\n return total_hours;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8854247b05e01d89dec533fbc0429ec7\",\n \"score\": \"0.5311569\",\n \"text\": \"getHours(){\\n let start = ((this.startTime.getHours()*60) + this.startTime.getMinutes());\\n let end = ((this.endTime.getHours()*60) + this.endTime.getMinutes());\\n end < start ? end += (24 * 60) : end;\\n let diffMins = end - start;\\n let hours = (diffMins/60).toFixed(2);\\n return hours;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ae15c638401b70abcd156d850ff7660\",\n \"score\": \"0.5309714\",\n \"text\": \"function getPay() {\\n return hoursWorked * hourlyRate;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a44f32a6f38e04b39e540e809e708d28\",\n \"score\": \"0.5306086\",\n \"text\": \"function hotelCost(days) {\\n if (days <= 10) {\\n var fastOffer = days * 100;\\n return fastOffer;\\n }\\n else if (days <= 20) {\\n var fastOffer = 10 * 100;\\n var remaining = days - 10;\\n var secondOffer = remaining * 80;\\n var total = fastOffer + secondOffer;\\n return total;\\n }\\n else {\\n var fastOffer = 10 * 100;\\n var secondOffer = 10 * 80;\\n var remaining = days - 20;\\n var luckyOffer = remaining * 50;\\n var total = fastOffer + secondOffer + luckyOffer;\\n return total;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f8b910c1c68488dd101e9c0bdd83a17\",\n \"score\": \"0.53001875\",\n \"text\": \"function calcDuration(alert){\\n\\tvar startDate = new Date(alert.activationDate);\\n\\tvar endDate;\\n\\tif(alert.alert_horizon[0] == null || alert.alert_horizon[0].end_date == null || alert.alert_horizon[0].end_date == null){\\n\\t\\treturn 'Unable to determine the duration of this alert; '+\\n\\t\\t\\t'Alerts without an end date are still active and will not yet have a duration';\\n\\t} else {\\n\\t\\tendDate = new Date(alert.alert_horizon[0].end_date);\\n\\t\\treturn formatDuration((endDate.getTime() - startDate.getTime()));\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"408ecb4ca6b5cb90fe3945afeedd0e9b\",\n \"score\": \"0.5295606\",\n \"text\": \"function hotelCost(days) {\\r\\n var expense = 0;\\r\\n if (days <= 10) {\\r\\n expense = days * 100;\\r\\n }\\r\\n else if (days <= 20) {\\r\\n var offer1 = 10 * 100;\\r\\n var remaining = days - 10;\\r\\n var offer2 = remaining * 80;\\r\\n expense = offer1 + offer2;\\r\\n }\\r\\n else {\\r\\n var offer1 = 10 * 100;\\r\\n var offer2 = 10 * 80;\\r\\n var remaining = days - 20;\\r\\n var offer3 = remaining * 50;\\r\\n expense = offer1 + offer2 + offer3;\\r\\n }\\r\\n return expense;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bba85b542b42efbde502781872eb9c50\",\n \"score\": \"0.528358\",\n \"text\": \"function timeRemaining(timeStr) { \\n\\tlet now = new Date(), time = new Date(), output;\\n\\tlet timeArr = timeStr.split(\\\":\\\"); // split between hours (index 0) and minutes (index 1)\\n\\ttime.setHours(timeArr[0]);\\n\\ttime.setMinutes(timeArr[1]);\\n\\ttime.setSeconds(0);\\n\\ttime.setMilliseconds(0);\\n\\n\\t// if time has already passed today, increment day\\n\\tif (now > time) {\\n\\t\\ttime.setDate(time.getDate() + 1);\\n\\t}\\n\\tconsole.log(\\\"now: \\\" + now + \\\"\\\\ntime: \\\" + time);\\n\\n\\toutput = (time - now) / 1000 * 16000000; // find difference, divide by milliseconds, multiply by clock speed\\n\\tconsole.log(\\\"output: \\\" + output);\\n\\treturn output + \\\"\\\"; // return output as string\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53babd0d018927ab366f2ae1b04fccbe\",\n \"score\": \"0.5282334\",\n \"text\": \"function gettimeRemaining(aryOfCoords){\\n return aryOfCoords.routes[0].legs[0].duration.text.split(' ')[0]*1;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cdddb65a8987074ed6ca7342ffe7acbb\",\n \"score\": \"0.5268743\",\n \"text\": \"function calcDailyWage(empHrs) {\\n return empHrs * WAGE_PER_HOUR;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5c9d93c1ba13177f113816951e28c6b\",\n \"score\": \"0.5262233\",\n \"text\": \"function wagesEarnedOnDate(employeeObj, day) {\\n let hours = hoursWorkedOnDate(employeeObj, day);\\n let rate = employeeObj.payPerHour\\n return hours * rate\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d04c7ddcba20387d7b997e2f6f920531\",\n \"score\": \"0.5250791\",\n \"text\": \"function getSumFreeTime(freeTimeArr) {\\n //console.debug(\\\"getSumFreeTime()\\\"); //Test\\n\\n let total = 0;\\n\\n freeTimeArr.forEach((freeTime) => {\\n if (freeTime.duration) {\\n total += freeTime.duration.asMilliseconds();\\n }\\n });\\n\\n return dayjs.duration(total);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be380a55c531e2bb4b506698d1a6120a\",\n \"score\": \"0.524408\",\n \"text\": \"function calculateDuration() {\\r\\n\\t\\t\\treturn endTime - startTime;\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f8177da979f02b440c74eb6ca05556f\",\n \"score\": \"0.52409965\",\n \"text\": \"function calculateDailyWage(empHrs) {\\n return empHrs * WAGE_PER_HOUR;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b71711d3069d53933b78b224b866df98\",\n \"score\": \"0.52406394\",\n \"text\": \"function shoppingTime(memberId, money) {\\n if (memberId == '' || memberId == undefined) {\\n return 'Mohon maaf, toko X hanya berlaku untuk member saja'\\n } else if (money < 50000){\\n return 'Mohon maaf, uang tidak cukup'\\n }\\n \\n var temp = {}\\n temp.memberId = memberId;\\n temp.money = money;\\n var moneyNew = money;\\n var listPurchasedTemp = [];\\n while(true){\\n if (moneyNew >= 1500000) {\\n listPurchasedTemp.push('Sepatu Stacattu')\\n moneyNew -= 1500000\\n } else if (moneyNew >= 500000) {\\n listPurchasedTemp.push('Baju Zoro')\\n moneyNew -= 500000\\n } else if (moneyNew >= 250000) {\\n listPurchasedTemp.push('Baju H&N')\\n moneyNew -= 250000\\n } else if (moneyNew >= 175000) {\\n listPurchasedTemp.push('Sweater Uniklooh')\\n moneyNew -= 175000\\n } else if (moneyNew >= 50000) {\\n listPurchasedTemp.push('Casing Handphone')\\n moneyNew -= 50000\\n } else {\\n break;\\n }\\n }\\n temp.listPurchased = listPurchasedTemp;\\n temp.changeMoney = moneyNew;\\n return temp\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee952437afbb3700aaf26bf9d4b5370e\",\n \"score\": \"0.5239424\",\n \"text\": \"function _diffHrTime( hrTim) {\\n\\n let s = hrTim[0] - previousDataPointsMag[3][0][0];\\n let ns = hrTim[1] - previousDataPointsMag[3][0][1];\\n return s + ns * 1.0e-9;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"898cca0f5f2cc2954e2e0aa0eda7ba59\",\n \"score\": \"0.5236685\",\n \"text\": \"function calcTotalTime() {\\n\\tvar allWatches = watches.getWatches(),\\n\\t\\ttotalTime = 0,\\n\\t\\ttotalRoundedTime = 0,\\n\\t\\t$total = $('.sum'),\\n\\t\\t$roundedTotal = $('.rounded-sum');\\n\\n\\tallWatches.forEach(function(watch) {\\n\\t\\ttotalTime += watch.get('totalTime');\\n\\t\\ttotalRoundedTime += _roundTime(watch.get('totalTime'));\\n\\t});\\n\\n\\ttotalRoundedTime += \\\" \\\" + ((totalRoundedTime === 1) ? 'hour' : 'hours');\\n\\n\\t$total.text(formatTime(totalTime));\\n\\t$roundedTotal.text(totalRoundedTime);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a5f82faa5c35c3d08b56bab73c2b109\",\n \"score\": \"0.5234955\",\n \"text\": \"function calculateFinalTime() {\\n // Calculates the time between clicked rabbits and their appearance and adds it to finalTime\\n for (let i = 0; i < rabbitAppearTimes.length; i++) {\\n if (rabbitClickedTimes[i] != null) {\\n finalTime += rabbitClickedTimes[i] - rabbitAppearTimes[i];\\n }\\n }\\n\\n // Calls the function to calculate the average reaction time and uppdate the variable with the result\\n avReactSpeed = calculateAverageReaction(finalTime, rabbitAppearTimes.length - missedRabbitPenalty) / 1000;\\n\\n finalTime += missedRabbitPenalty * 4000; // adds the penalty-time for all the missed rabbits\\n finalTime += misclickPenalty * 1000; // adds the penalty-time for all the missclicks on screen\\n\\n finalTime = finalTime / 1000; // sets final Highscore to seconds\\n finalTime = finalTime.toFixed(2); // convertint to string and rounding to 2 decimals\\n avReactSpeed = avReactSpeed.toFixed(2); // convertint to string and rounding to 2 decimals\\n return finalTime; // returning finalTime\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4ba47d9595a8834f82460f2ac60cb48\",\n \"score\": \"0.52332634\",\n \"text\": \"function goalTimeCalc(distance, hopefulPace) {\\n const goalTime = distance * hopefulPace;\\n console.log(hopefulPace);\\n const totalTime = \\\"Your total time for \\\" + distance + \\\" miles is \\\" + goalTime;\\n return totalTime;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d143e8770837b3b8ca384621d88c61c8\",\n \"score\": \"0.5229504\",\n \"text\": \"averageHoursSlept() {\\n let totalHoursSlept = 0;\\n this.records.forEach(record => {\\n totalHoursSlept += record.hoursSlept\\n });\\n return Math.ceil(totalHoursSlept / this.records.length);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f76d48f9e34cfe004219f03355763348\",\n \"score\": \"0.5227046\",\n \"text\": \"function timeCalc (){\\n var tFrequency = sv.frequency;\\n var firstTime = sv.first;\\n\\n var firstTimeConverted = moment(firstTime, \\\"HH:mm\\\").subtract(1, \\\"years\\\");\\n\\n var diffTime = moment().diff(moment(firstTimeConverted), \\\"minutes\\\");\\n\\n var tRemainder = diffTime % tFrequency;\\n\\n minAway = tFrequency - tRemainder;\\n\\n nextArrive = moment().add(minAway, \\\"minutes\\\").format(\\\"hh:mm\\\");\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7fa6e03a7bc58712b3abe9c9a311b8b\",\n \"score\": \"0.5222191\",\n \"text\": \"function FindHoursDifferencebetweenPickupAndDrop(dt2, dt1) {\\n // console.log(dt1.getTime());\\n var diff = (dt2.getTime() - dt1.getTime()) / 1000;\\n diff /= 60;\\n diff /= 60;\\n return Math.abs(Math.round(diff));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"601075e761542d6e96eb294d494e2e9f\",\n \"score\": \"0.5222126\",\n \"text\": \"function calculateDuration() {\\n\\t\\t\\treturn endTime - startTime;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"601075e761542d6e96eb294d494e2e9f\",\n \"score\": \"0.5222126\",\n \"text\": \"function calculateDuration() {\\n\\t\\t\\treturn endTime - startTime;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"601075e761542d6e96eb294d494e2e9f\",\n \"score\": \"0.5222126\",\n \"text\": \"function calculateDuration() {\\n\\t\\t\\treturn endTime - startTime;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73d2deb5f4c51d6b97f27afccbb0372c\",\n \"score\": \"0.5220317\",\n \"text\": \"function cookingTime(eggs){\\n return Math.ceil(eggs / 8) * 5;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43ebb31a15def32a394daeada0735c77\",\n \"score\": \"0.5218337\",\n \"text\": \"function calculateElapsedTime() {\\n let currTime = new Date();\\n if (isPaused) gamePausedTime = currTime - gameCurrTime;\\n if (!hasWon) gameCurrTime = currTime - gamePausedTime;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9c954f0e9ea5fa607a02873cc08b291\",\n \"score\": \"0.5209115\",\n \"text\": \"function getHoursPerWeek() {\\n hoursPerWeek = hoursPerDay * daysPerWeek;\\n\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e8e3ad5f95ceca557d603b85dc85628\",\n \"score\": \"0.520206\",\n \"text\": \"function remainingTime(timestr) {\\n const targetTime = timestr.split(\\\":\\\");\\n let hours = parseInt(targetTime[0]) - time.getHours();\\n if (hours < 0) hours = 24 + hours;\\n let minutes = parseInt(targetTime[1]) - time.getMinutes();\\n if (minutes < 0) {\\n if (hours === 0) hours = 24;\\n hours --;\\n minutes += 60;\\n }\\n if ((hours === 0) && (minutes === 0)) setNotDisplayTime(true);\\n else if (hours === 0) return `${minutes} min`\\n else if (minutes === 0) return `${hours} h`\\n return `${hours} h ${minutes} min`;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d938200e0d94dbc5f471cea748cae2d\",\n \"score\": \"0.52008194\",\n \"text\": \"function hoursWorkedOnDate(employee, dateOfDiff) {\\n let inEvent = employee.timeInEvents.find((e) => e.date === dateOfDiff);\\n let outEvent = employee.timeOutEvents.find((e) => e.date === dateOfDiff);\\n\\n // let hourseWorked = employee.timeOutEvents.hour - employee.timeInEvents.hour;\\n\\n return (outEvent.hour - inEvent.hour) / 100;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17249534c51918b98948533ffafe1839\",\n \"score\": \"0.51945835\",\n \"text\": \"function calculateDuration() {\\n return endTime - startTime;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d3df9a815bf8aa8183c8558481cfb80\",\n \"score\": \"0.5193312\",\n \"text\": \"timeInDays(hours){\\r\\n hours*=Hr\\r\\n return hours/Day\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d998dbe93ca5bd4a851a5341c71fc2df\",\n \"score\": \"0.51924\",\n \"text\": \"function getTimeRemaining (endtime){ // A function that calculates the remainder of the time and receives hours, minutes and seconds.\\r\\n let t = Date.parse(endtime) - Date.parse(new Date()), \\r\\n seconds = Math.floor((t / 1000) % 60), // We get seconds through the remainder. \\r\\n minutes = Math.floor((t / 1000 / 60) % 60), // We get minutes.\\r\\n hours = Math.floor((t / (1000*60*60))); // We get the minutes.\\r\\n // days = Math.floor((t / (1000*60*60*24))); // Get the days.\\r\\n\\r\\n return { // We create an object with the obtained values and return it. getTimeRemaining(endtime).seconds, getTimeRemaining(endtime).seconds, getTimeRemaining(endtime).hours.\\r\\n 'total' : t,\\r\\n 'seconds' : seconds,\\r\\n 'minutes' : minutes,\\r\\n 'hours' : hours\\r\\n };\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42e1635541131d20a707332fe4698582\",\n \"score\": \"0.51910955\",\n \"text\": \"function getTotalTime() {\\n // Create Temporal Total Time\\n let total_time = 0;\\n\\n // Add Time by Service\\n servicesContracted.map(\\n (service) =>\\n (total_time += servicesList.filter(\\n (serviceFilter) => serviceFilter.id == service\\n )[0].duration)\\n );\\n\\n // Return Total Time\\n return total_time;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae85c63a68c72bb603a1359421a06343\",\n \"score\": \"0.51896214\",\n \"text\": \"function howManySeconds(hours) {\\n return hours*(60 * 60)\\n\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3f8804a1f9f9a774d742f8bdb4cade6\",\n \"score\": \"0.51855505\",\n \"text\": \"get arrivalTime() {\\r\\n\\t\\treturn this.launchTime + this.totalTime;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dc75a8f29ff3a678e8ae109ff1387a5\",\n \"score\": \"0.5185063\",\n \"text\": \"function timeLeft(typeLateMeal, hour, min)\\n{\\n var hourLeft\\n var minLeft;\\n\\n if (typeLateMeal == 0) // lunch late meal\\n {\\n hourLeft = 15 - hour;\\n minLeft = (45 + (60 * hourLeft)) - min;\\n /*if (minLeft > 45) // 2:45 - 3 window\\n {\\n hourLeft = 0;\\n } */\\n\\n if (hourLeft != 0 && minLeft <= 45)\\n {\\n document.getElementById(\\\"timeUntil\\\").innerHTML = \\\" \\\" + hourLeft + \\\" hour and \\\" + minLeft + \\\" minutes until Late Meal ends.\\\" + \\\" \\\";\\n }\\n else if (hourLeft != 0 && (minLeft - 60) > 0)\\n {\\n document.getElementById(\\\"timeUntil\\\").innerHTML = \\\" \\\" + hourLeft + \\\" hour and \\\" + (minLeft - 60) + \\\" minutes until Late Meal ends.\\\" + \\\" \\\";\\n }\\n else\\n {\\n document.getElementById(\\\"timeUntil\\\").innerHTML = \\\" \\\" + minLeft + \\\" minutes until Late Meal ends.\\\" + \\\" \\\";\\n }\\n }\\n else // dinner late meal\\n {\\n hourLeft = 21 - hour; // hour remaining only if it's before 9\\n minLeft = 60 - min;\\n\\n if (hourLeft != 0)\\n {\\n document.getElementById(\\\"timeUntil\\\").innerHTML = \\\" \\\" + hourLeft + \\\" hour and \\\" + minLeft + \\\" minutes until Late Meal ends.\\\" + \\\" \\\";\\n }\\n else\\n {\\n document.getElementById(\\\"timeUntil\\\").innerHTML = \\\" \\\" + minLeft + \\\" minutes until Late Meal ends.\\\" + \\\" \\\";\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5758111b7d1bb3622e439abf8990c9fd\",\n \"score\": \"0.5181131\",\n \"text\": \"function retrieveTime(){\\r\\n\\tlet t = (new Date().getTime() - time) / 1000;\\r\\n\\t return Math.trunc(t);\\t\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4156b271fd9bb0a83823bd38baecd6a9\",\n \"score\": \"0.517832\",\n \"text\": \"function calcTravelTime(travelDate) {\\n let today = new Date();\\n // Number of milliseconds per day\\n const msPerDay = 24 * 60 * 60 * 1000; \\n\\n let daysAway = (travelDate.getTime() - today.getTime())/msPerDay;\\n daysAway = Math.floor(daysAway);\\n let dateInfo = document.getElementById('date-info');\\n dateInfo.innerHTML = \\\"\\\";\\n\\n const p = document.createElement(\\\"P\\\");\\n p.innerHTML = `Your trip is ${daysAway} days away`;\\n dateInfo.appendChild(p);\\n\\n return daysAway;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e908bf7c87332bb7c8c2a1257efd363\",\n \"score\": \"0.5168434\",\n \"text\": \"function calculatePay()\\n{\\n var hours=prompt(\\\"Enter hours of work: \\\",\\\"hours of work\\\")\\n var rph=prompt(\\\"Enter rate per hour: \\\",\\\"rate per hour\\\")\\n console.log('Your weekly earning is ',parseInt(hours)*parseInt(rph))\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba44a11ba990a8acb8d83b6a038f0b37\",\n \"score\": \"0.51560515\",\n \"text\": \"function calc_strength_hours(start_strength_level, end_strength_level, attack_level) {\\n var total_hours = 0;\\n for (; start_strength_level < end_strength_level; start_strength_level++) {\\n var hours_to_level = calc_time_to_next_level(attack_level, start_strength_level, 2)[0];\\n total_hours = total_hours + hours_to_level;\\n }\\n return total_hours;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1cd5cbf53e20652bcde98a56ff9c6b2\",\n \"score\": \"0.5150969\",\n \"text\": \"function calculateWage(arr){\\n\\n //Converts the minutes to decimal value, i.e: 16:30 -> 16.5, 16:05 -> 16.08\\n function minutesToDecimal(minutes){\\n //Divide by 60 in order to make time decimal and remove any periods.\\n let decimal = String(minutes / 60).replace(`.`, ``);\\n //If the number is bigger than 0.1, remove the zero, i.e: 07 -> 7\\n if (decimal >= 0.1)\\n decimal = decimal.replace(0, ``);\\n\\n return decimal;\\n }\\n\\n let wage = document.getElementById(\\\"input_wage\\\").value;\\n let overtime = 8;//After 8 hours of work it is considered overtime, 7 on friday\\n let pay = 0;\\n let averagePay = 0;\\n let weeklyHours = 0;\\n let totalHoursWorked = 0;\\n let totalOvertimeHours = 0;\\n let totalOvertimePay = 0;\\n let count = 0;\\n\\n for (let day of arr)\\n {\\n count++;\\n //Take the input and make an array out of it, [0] = Hour, [1] = Minutes\\n let end = day.End.split(\\\":\\\");\\n let start = day.Start.split(\\\":\\\");\\n\\n let startMinutes = minutesToDecimal(start[1]);\\n let endMinutes = minutesToDecimal(end[1]);\\n let shiftStart = Number(start[0] + \\\".\\\" + startMinutes);\\n let shiftEnd = Number(end[0] + \\\".\\\" + endMinutes);\\n\\n let hoursWorked = shiftEnd - shiftStart;\\n totalHoursWorked += hoursWorked;\\n\\n let overtimeHours = hoursWorked - overtime;\\n let overtimePay = 0;\\n\\n //Overtime system\\n if (overtimeHours > 0)\\n {\\n let extraOvertime = 0;\\n let extra = false;\\n\\n //150% Overtime system - if worked over 10 hours\\n if (hoursWorked > 10){\\n extra = true;\\n extraOvertime = hoursWorked - 10;\\n overtimePay += extraOvertime * wage * 1.5;\\n }\\n\\n totalOvertimeHours += overtimeHours;\\n if (extra)\\n overtimeHours -= extraOvertime;\\n\\n overtimePay += overtimeHours * wage * 1.25;\\n totalOvertimePay += overtimePay;\\n\\n if (extra)\\n overtimeHours += extraOvertime;\\n }\\n\\n let dailyPay = (hoursWorked - overtimeHours) * wage + overtimePay;\\n pay += dailyPay;\\n averagePay += dailyPay;\\n }\\n\\n let msg = `You have worked ${totalHoursWorked.toFixed(1)} hours and earned a total of ${Math.round(pay)} shekels.`;\\n msg += `<br>Your average pay is ${(averagePay/count).toFixed(0)} shekels per day.`;\\n\\n if (totalOvertimePay > 0)\\n msg += `<br>That includes ${totalOvertimeHours.toFixed(1)} hours overtime that yielded ${Math.round(totalOvertimeHours*wage*1.25 - totalOvertimeHours*wage)} extra shekels.`;\\n\\n document.getElementById(\\\"para\\\").innerHTML = msg;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b2a9f25941709c05bc02efee8317457\",\n \"score\": \"0.51500773\",\n \"text\": \"function returnElapsedTime() {\\n\\n let now = performance.now();\\n\\n // Find the distance between now and the starting time\\n let distance = now - startGameTime;\\n\\n // Time calculations for minutes and seconds\\n let minutes = Math.floor((distance % (1000 * 60 * 60)) / (1000 * 60));\\n let seconds = Math.floor((distance % (1000 * 60)) / 1000);\\n\\n return minutes + \\\"m \\\" + seconds + \\\"s \\\";\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":85,"cells":{"query_id":{"kind":"string","value":"945e982445722fb5be026421c828b313"},"query":{"kind":"string","value":"active state for visible element on the viewport"},"positive_passages":{"kind":"list like","value":[{"docid":"47cb8f62a3a19da8828e9ebc7e152733","score":"0.0","text":"function scrollNav() {\n $(\"nav a\").click(function(e) {\n e.preventDefault();\n $('html,body').animate({\n scrollTop: ($(this.hash).offset().top - 100)\n }, 600);\n\n });\n\n var aChildren = $(\"nav li\").find('a'),\n aArray = [];\n\n for (var i = 0; i < aChildren.length; i++) {\n var aChild = aChildren[i],\n ahref = $(aChild).attr('href');\n aArray.push(ahref);\n }\n\n $(window).scroll(function() {\n var windowPos = $(window).scrollTop(),\n windowHeight = $(window).height(),\n docHeight = $(document).height();\n\n for (var i = 0; i < aArray.length; i++) {\n var theID = aArray[i],\n divPos = $(theID).offset().top - 100,\n divHeight = $(theID).height();\n\n if (windowPos >= divPos && windowPos < (divPos + divHeight)) {\n $(\"a[href='\" + theID + \"']\").addClass(\"is-active\");\n } else {\n $(\"a[href='\" + theID + \"']\").removeClass(\"is-active\");\n }\n }\n\n if (windowPos + windowHeight == docHeight) {\n if (!$(\"nav li:last-child a\").hasClass(\"is-active\")) {\n var navActiveCurrent = $(\".is-active\").attr(\"href\");\n $(\"a[href='\" + navActiveCurrent + \"']\").removeClass(\"is-active\");\n $(\"nav li:last-child a\").addClass(\"is-active\");\n }\n }\n });\n\n // back to top link\n $('.back-to-top a').on('click', function(e) {\n e.preventDefault();\n $('html, body').animate({\n scrollTop: 0\n }, 600);\n });\n}","title":""}],"string":"[\n {\n \"docid\": \"47cb8f62a3a19da8828e9ebc7e152733\",\n \"score\": \"0.0\",\n \"text\": \"function scrollNav() {\\n $(\\\"nav a\\\").click(function(e) {\\n e.preventDefault();\\n $('html,body').animate({\\n scrollTop: ($(this.hash).offset().top - 100)\\n }, 600);\\n\\n });\\n\\n var aChildren = $(\\\"nav li\\\").find('a'),\\n aArray = [];\\n\\n for (var i = 0; i < aChildren.length; i++) {\\n var aChild = aChildren[i],\\n ahref = $(aChild).attr('href');\\n aArray.push(ahref);\\n }\\n\\n $(window).scroll(function() {\\n var windowPos = $(window).scrollTop(),\\n windowHeight = $(window).height(),\\n docHeight = $(document).height();\\n\\n for (var i = 0; i < aArray.length; i++) {\\n var theID = aArray[i],\\n divPos = $(theID).offset().top - 100,\\n divHeight = $(theID).height();\\n\\n if (windowPos >= divPos && windowPos < (divPos + divHeight)) {\\n $(\\\"a[href='\\\" + theID + \\\"']\\\").addClass(\\\"is-active\\\");\\n } else {\\n $(\\\"a[href='\\\" + theID + \\\"']\\\").removeClass(\\\"is-active\\\");\\n }\\n }\\n\\n if (windowPos + windowHeight == docHeight) {\\n if (!$(\\\"nav li:last-child a\\\").hasClass(\\\"is-active\\\")) {\\n var navActiveCurrent = $(\\\".is-active\\\").attr(\\\"href\\\");\\n $(\\\"a[href='\\\" + navActiveCurrent + \\\"']\\\").removeClass(\\\"is-active\\\");\\n $(\\\"nav li:last-child a\\\").addClass(\\\"is-active\\\");\\n }\\n }\\n });\\n\\n // back to top link\\n $('.back-to-top a').on('click', function(e) {\\n e.preventDefault();\\n $('html, body').animate({\\n scrollTop: 0\\n }, 600);\\n });\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"753fd2aadc13a906756ac678a4a12330","score":"0.7436931","text":"function activeView(element) {\n const postion = element.getBoundingClientRect();\n return (\n // the first two values to insure that every section is on the top of the screen or down a bit.\n postion.top >= 0 &&\n postion.left >= 0 &&\n //these vakues is used to make sure the section is still active while it is on the viewport.\n postion.bottom <=\n (window.innerHeight || document.documentElement.clientHeight) &&\n postion.right <= (window.innerWidth || document.documentElement.clientWidth)\n );\n}","title":""},{"docid":"17aafea549bf11885616d9e8b246c26c","score":"0.6587437","text":"_checkVisible() {\n const viewHeight = Math.max(document.documentElement.clientHeight, \n window.innerHeight);\n const rect = this.container.getBoundingClientRect();\n const offSet = 300;\n const visible = !(rect.bottom < (0 - offSet) \n || rect.top - viewHeight >= (0 + offSet));\n\n if(this.state.visible !== visible) {\n this.setState({visible});\n } \n }","title":""},{"docid":"e1049bc21470d171236c213a0f0c7f35","score":"0.6584574","text":"get visible() { return (this._visible); }","title":""},{"docid":"e2fba2ddbdc55a65609dd3d15be5d12d","score":"0.6545421","text":"function checkviewportvisible() {\n viewport = jQuery(window).height();\n jQuery('.bos').each(function(){\n\n scrollwindow = viewport + jQuery(window).scrollTop()\n element = jQuery(this);\n \n if (element.offset().top <= scrollwindow ) {\n element.animate({\n 'top': '0',\n 'opacity': 1\n }, 1000);\n } \n });\n }","title":""},{"docid":"369218f60a97993ad34c610417c76425","score":"0.6540943","text":"function isVisibleOnPage(elem){var docViewTop = $(window).scrollTop();var elemTop = $(elem).offset().top; var windowHeight = $(window).height(); return (elemTop <= docViewTop + 100);}","title":""},{"docid":"369218f60a97993ad34c610417c76425","score":"0.6540943","text":"function isVisibleOnPage(elem){var docViewTop = $(window).scrollTop();var elemTop = $(elem).offset().top; var windowHeight = $(window).height(); return (elemTop <= docViewTop + 100);}","title":""},{"docid":"903c449baeb5af5319ec89ebfcd2e57c","score":"0.6497301","text":"function checkActive(section){\n const OFFSET = 350;\n const anchor = document.querySelector(`a[href=\"#${section.id}\"]`);\n const sectionViewPoint = section.getBoundingClientRect();\n \n //if the viewpoint is within the offset then it's the active section\n if(sectionViewPoint.top <= OFFSET && (sectionViewPoint.height * -1 + OFFSET) <= sectionViewPoint.top){\n section.classList.add(\"your-active-class\");\n anchor.parentElement.classList.add(\"your-active-class\");\n }\n //remove active if viewpoint is not visable or in the main visablity.\n else{\n section.classList.remove(\"your-active-class\");\n anchor.parentElement.classList.remove(\"your-active-class\");\n }\n}","title":""},{"docid":"e83920525d57eb910b76c2a05531e573","score":"0.6489123","text":"isActive() {\n var _a;\n return ((_a = this.tabEl) === null || _a === void 0 ? void 0 : _a.classList.contains(\"active\")) || false;\n }","title":""},{"docid":"5fdfe41b7cfde811b7f291a34057e744","score":"0.6446921","text":"function isVisible($el) {\r\n var winTop = $(window).scrollTop();\r\n var winBottom = winTop + $(window).height();\r\n var elTop = $el.offset().top;\r\n var elBottom = elTop + $el.height();\r\n return ((elBottom <= winBottom) && (elTop >= winTop));\r\n}","title":""},{"docid":"251ed8c6f7e8bf0446bd6c7301dc8136","score":"0.6369589","text":"function isActive() {\n for (let section of sections) {\n if (isInViewport(section)) {\n section.classList.add('your-active-class');\n } else {\n section.classList.remove('your-active-class');\n }\n }\n}","title":""},{"docid":"4473c95a92024fb74b10b5165d96eaa8","score":"0.63664967","text":"function isVisible(el) {\n const rect = el.getBoundingClientRect();\n const windowHeight =\n window.innerHeight || document.documentElement.clientHeight;\n const windowWidth = window.innerWidth || document.documentElement.clientWidth;\n\n const vertInView = rect.top <= windowHeight && rect.top + rect.height >= 0;\n const horInView = rect.left <= windowWidth && rect.left + rect.width >= 0;\n\n return vertInView && horInView;\n}","title":""},{"docid":"0856c2217ea313490ef597ec3c4a5406","score":"0.6354982","text":"function setToActive(){\n for (let i = 0; i < sections.length; i++){\n if (isInViewport(sections[i])){\n sections[i].classList.add(\"your-active-class\");\n }else{\n sections[i].classList.remove(\"your-active-class\");\n }\n }\n}","title":""},{"docid":"bc89dcc6a5abf9ed2d9437fd40694f80","score":"0.63430625","text":"isVisible() {\n return this.visible;\n }","title":""},{"docid":"ea4b7d541781eaf2109a1d3ef3770258","score":"0.6326344","text":"function viewportCheck() {\n let sectionList = document.querySelectorAll('section');\n for (listItem of sectionList) {\n let isInViewport = function (listItem) {\n let posSection = listItem.getBoundingClientRect();\n return (posSection.top > -300 && 300 > posSection.top);\n };\n const notActive = document.querySelector('.your-active-class')\n if (isInViewport(listItem)) {\n notActive.classList.remove('your-active-class');\n listItem.classList.add('your-active-class');\n }\n }\n }","title":""},{"docid":"500eefe72a1f7e3fab37b7a0f57e4d76","score":"0.63238287","text":"isVisible() {\n return this._visibility === 'visible';\n }","title":""},{"docid":"5186066eaed882515f675bd49f1681e1","score":"0.6322","text":"function isScrolledIntoView(el) {\r\n\t var elemTop = el.getBoundingClientRect().top;\r\n\t var elemBottom = el.getBoundingClientRect().bottom;\r\n\r\n\t var isVisible = (elemTop >= 0) && (elemBottom <= window.innerHeight);\r\n\t\t\t// $('.img-brand-block').addClass(\"fadeInDown\");\r\n\t\t\t// console.log(\"Element is in view!\");\r\n\t return isVisible;\r\n\t}","title":""},{"docid":"31990e738ec9061016da26bb842c01bc","score":"0.63170195","text":"get visible()\n {\n return this.elt.getBoundingClientRect().height > 0;\n }","title":""},{"docid":"cd7abe7b371df7ab11e744978190d0a5","score":"0.63136846","text":"function active()\n{ \n document.addEventListener('scroll',function () \n { \n for(const section of sections)\n {\n const pos= section.getBoundingClientRect();//get the section position reletive to the viewport\n if(pos.bottom> 0 && pos.bottom <= screen.height)//condition when section is in the viewport add class='active'\n {\n section.classList.add('active');\n const dataValue = section.getAttribute('data-nav');\n activeAnchor(dataValue);\n }\n else//if the section isn't in viewport remove class='active' \n {\n section.classList.remove('active');\n } \n }\n });\n}","title":""},{"docid":"16b59529b4f32efb5138cb618f151984","score":"0.6311569","text":"function inView(){\n var sections = document.querySelectorAll('section');\n for (var x = 0; x< sections.length; x++){\n var sec = sections[x].id;\n var el = document.getElementById(sec);\n var pos = el.getBoundingClientRect();\n if (pos.top > -150 && pos.top < window.innerHeight - pos.top){\n var liCol = document.querySelectorAll('li');\n liCol[x].classList = 'active_li';\n }else{\n var liCol = document.querySelectorAll('li');\n liCol[x].classList.remove('active_li');\n }\n }\n}","title":""},{"docid":"212fea21c64b36d1634e219b1e69c285","score":"0.63022393","text":"function makeVisible(element) {\n var selfTop = element.offset().top;\n if ( scrollPos > (selfTop - windowHeight + 100)) {\n element.addClass('visible');\n }\n }","title":""},{"docid":"f1c6d05c454ccebdb1651afec0d67235","score":"0.62850773","text":"function check_element_visible() {\n var browser_height = $browser.height();\n var browser_top_position = $browser.scrollTop();\n var browser_bottom_position = (browser_top_position + browser_height);\n \n \n $.each($animate_el, function () {\n var $element = $(this);\n var element_height = $element.outerHeight();\n var element_top_position = $element.offset().top;\n var element_bottom_position = (element_top_position + element_height);\n \n \n if ((element_bottom_position >= browser_top_position) && (element_top_position <= browser_bottom_position)) {\n $element.addClass('visible');\n } else {\n $element.removeClass('visible');\n }\n \n });\n}","title":""},{"docid":"a45b3dd6e4eb058647b8b745de97ce85","score":"0.6284215","text":"function activeClass() {\n const secTop = [];\n let inView = 10000;\n Array.prototype.forEach.call(sections, section => {\n secTop.push(section.getBoundingClientRect().top)\n })\n Array.prototype.forEach.call(secTop, elem => {\n if (elem >= 0 && elem < inView) {\n inView = elem;\n }\n })\n Array.prototype.forEach.call(sections, section => {\n if (section.getBoundingClientRect().top == inView) {\n if (!section.classList.contains('your-active-class')) {\n section.classList.add('your-active-class');\n }\n } else {\n section.classList.remove('your-active-class');\n }\n })\n}","title":""},{"docid":"297c18a043ca8c0bc7daefffdc67ce7b","score":"0.6261826","text":"function activeClass(){\r\n\r\n for (let i=0; i < sections.length; i++){\r\n\r\n if (isInViewport(sections[i])){\r\n\r\n sections[i].classList.add(\"your-active-class\");\r\n\r\n }else{\r\n\r\n sections[i].classList.remove(\"your-active-class\");\r\n \r\n }\r\n }\r\n}","title":""},{"docid":"f67e27e4839b5a07477c3c372712c76c","score":"0.6244689","text":"isElementVisible(el) {\n var rect = el.getBoundingClientRect();\n if (rect.width === 0) return false;\n if (rect.height === 0) return false;\n if (rect.top < 0) return false;\n if (rect.left < 0) return false;\n if (rect.bottom > (window.innerHeight || document.documentElement.clientHeight)) return false;\n if (rect.right > (window.innerWidth || document.documentElement.clientWidth)) return false;\n return true;\n }","title":""},{"docid":"2e7870e27a183dfc2d9d93938a6fd3bf","score":"0.622341","text":"function getViewActive() {\n\t /**\n\t * Finds particular Node by ClassName.\n\t * @param par - ClassName - string\n\t * @return Nodes of particular Class\n\t *\n\t */\n\t function searchPlace(par) {\n\t return document.getElementsByClassName(par);\n\t }\n\t\n\t var listTodos = searchPlace(\"todos-item_undone-mark-w\");\n\t\n\t for (var i = 0; i < listTodos.length; i++) {\n\t listTodos[i].parentNode.style.display = \"block\";\n\t }\n\t\n\t listTodos = searchPlace(\"todos-item_done-mark-w\");\n\t\n\t for (var i = 0; i < listTodos.length; i++) {\n\t listTodos[i].parentNode.style.display = \"none\";\n\t }\n\t\n\t listTodos=null;\n\t\n\t}","title":""},{"docid":"ac47e3f48513884fda6c8b78057a4d59","score":"0.62101734","text":"function toggleActiveState() {\n\n let options = {\n root: document,\n rootMargin: '0px',\n threshold: [1.0]\n };\n // Set sections as active\n let handleIntersect = (entries, observer) => {\n entries.forEach(entry => {\n if (entry.isIntersecting) {\n entry.target.classList.add('your-active-class');\n } else {\n entry.target.classList.remove('your-active-class');\n }\n\n });\n };\n\n const observer = new IntersectionObserver(handleIntersect, options);\n Array.prototype.forEach.call(sections, (el) => {\n observer.observe(el);\n });\n}","title":""},{"docid":"ef28e13ee5856722ee57fc949ab59bd3","score":"0.6201167","text":"function isVisible(element) {\n var viewport = $(window);\n\n var topOfViewport = $(window).scrollTop();\n var bottomOfViewport = topOfViewport + viewport.height();\n\n var topOfElement = element.offset().top;\n var bottomOfElement = topOfElement + element.height();\n\n var ease = element.height() / 2;\n\n var isInsideViewport = ((topOfElement + ease >= topOfViewport) && (bottomOfElement - ease <= bottomOfViewport));\n\n return isInsideViewport;\n}","title":""},{"docid":"2f17d2c7bb92dedc5cd2462610989835","score":"0.61827475","text":"function activeSection() {\n for (let i = 0; i < sections.length; i++) {\n const visibleSection = sections[i].getBoundingClientRect();\n if (visibleSection.top <= 150 && visibleSection.bottom >= 150){\n sections[i].classList.add('your-active-class');\n } else {\n sections[i].classList.remove('your-active-class');\n };\n };\n}","title":""},{"docid":"cd801671e366c9843d962bfacbc0f1a9","score":"0.6179745","text":"async isActive() {\n const host = await this.host();\n return host.hasClass('mdc-tab--active');\n }","title":""},{"docid":"d1275855d61500429d530c4fa19135b9","score":"0.6168258","text":"function setActiveState($el) {\n $activeHeaderTrigger.removeClass(\"isSelected\");\n $activeHeaderTrigger.attr(\"aria-expanded\", \"false\");\n $activeHeaderTrigger\n .find(\".site-nav__chevron-down\")\n .removeClass(\"hide\");\n $activeHeaderTrigger.find(\".site-nav__chevron-up\").addClass(\"hide\");\n $(document).find(\"[data-header-overlay]\").css('z-index', -1);\n\n if ($el !== \"\") {\n $el.addClass(\"isSelected\");\n $el.attr(\"aria-expanded\", \"true\");\n $el.find(\".site-nav__chevron-down\").addClass(\"hide\");\n $el.find(\".site-nav__chevron-up\").removeClass(\"hide\");\n $(document).find(\"[data-header-overlay]\").css('z-index', 4);\n }\n }","title":""},{"docid":"621b47d1a130960119c5585365c57bb8","score":"0.6163659","text":"function makeactive(event) {\n for (let section of sections) {\n var rect = section.getBoundingClientRect();\n if (rect.top < 700 & rect.top > -120){\n section.className = \"your-active-class\";\n }\n else{\n section.className = \"\";\n }\n }\n}","title":""},{"docid":"81cd110c277693e361c501e848c28024","score":"0.6135477","text":"get active() {\n return this.hasAttribute(\"active\");\n }","title":""},{"docid":"879809f829131aab19b864c4e33dab81","score":"0.6128646","text":"get visible() {\n return this._visible;\n }","title":""},{"docid":"86387a4e030ab6253b6fa985a2e84cbb","score":"0.61255133","text":"get visible() {\n return this._visible\n }","title":""},{"docid":"5fe9f8ae9c7faa330a2b1494737ae3a2","score":"0.6111018","text":"function activeStatus(){\n\nfor (i=0 ; i<(sections.length);i++){\n\n//https://www.w3schools.com/jsref/met_element_getboundingclientrect.asp\n const view = sections[i].getBoundingClientRect();\n\n//check the position of section\n if(view.top <= 150 && view.bottom > 150){\n\n sections[i].classList.add('your-active-class');\n\n const activeAnchor = document.querySelectorAll('a')[i];\n// check the style of active anchor\n activeAnchor.style.cssText = \"background: red;\";\n\n }\n\n else {\n\n sections[i].classList.remove('your-active-class');\n\n const inactiveAnchor = document.querySelectorAll('a')[i];\n\n inactiveAnchor.style.cssText = \"background: green;\";\n\n }\n }\n}","title":""},{"docid":"12b8acd646b8eb1d0d1272c32be5351f","score":"0.6107882","text":"function addActiveClass(){ \n for (section of sections){\n if (isInViewport(section)){\n section.classList.add(\"your-active-class\");\n }else{\n section.classList.remove(\"your-active-class\");\n } \n } \n}","title":""},{"docid":"ce44eebabee2f760ee60cc156440352c","score":"0.60985214","text":"function checkVisibleSection() {\n\t\tvar scrollTop = $(window).scrollTop(),\n\t\t\twindowHeight = $(window).height();\n\n\t\t$('[data-type=\"slider-item\"]').each(function(){\n\t\t\tvar actualBlock = $(this),\n\t\t\t\toffset = scrollTop - actualBlock.offset().top;\n\t\t\t//add/remove .is-visible class if the section is in the viewport - it is used to navigate through the sections\n\t\t\t( offset >= 0 && offset < windowHeight ) ? actualBlock.addClass('is-visible') : actualBlock.removeClass('is-visible');\n\t\t});\n\t}","title":""},{"docid":"28572b41be965d2f620a33d2991cd87f","score":"0.6098519","text":"function isVisible(ele) {\n const { top, bottom } = ele.getBoundingClientRect();\n const vHeight = (window.innerHeight || document.documentElement.clientHeight);\n return ((top > 0 || bottom > 0) && top < vHeight);\n }","title":""},{"docid":"a8c6961dd296d28d330fa5d4d2f554ba","score":"0.6087095","text":"isVisible() {\n return this.ampdoc.isVisible();\n }","title":""},{"docid":"4d164107c20091afc94593408303a719","score":"0.6085932","text":"function makeActiv () {\n for (let sec of sections) {\n let box = sec.getBoundingClientRect(); // get coordinates of each section element\n let link = sec.id;\n let uLink = document.querySelector(`.${link}`);\n\n if (box.top <= 150 && box.bottom >= 150) { // if box-top coordinate (extracted via getBoundingClientRect) within 150px from the viewport and until box bottom is at 150px or more from the viewport\n sec.classList.add('your-active-class');\n uLink.classList.add('active');\n }\n else {\n sec.classList.remove('your-active-class');\n uLink.classList.remove('active');\n }\n }\n}","title":""},{"docid":"85883dbac3c7a36021b326ab4f665c51","score":"0.60822797","text":"active(){\n return this.isActive;\n }","title":""},{"docid":"e96bf8c7ee0bf4fd153e14630b30f305","score":"0.60636544","text":"isVisible(element) {\n return hasGeometry(element) && getComputedStyle(element).visibility === 'visible';\n }","title":""},{"docid":"e96bf8c7ee0bf4fd153e14630b30f305","score":"0.60636544","text":"isVisible(element) {\n return hasGeometry(element) && getComputedStyle(element).visibility === 'visible';\n }","title":""},{"docid":"cd26e4049c5358894e630653370969ed","score":"0.6058441","text":"isActive() {\n return (\n (this.props.active.type === EnumSelection.Step) &&\n (this.props.active.step === this.props.step.key)\n );\n }","title":""},{"docid":"754e7d92d1d617888f380db13b7b6b73","score":"0.60568374","text":"function isVisible(ele) {\n\t\tconst { top, bottom } = ele.getBoundingClientRect();\n\t\tconst vHeight = (window.innerHeight || document.documentElement.clientHeight);\n\t\treturn (\n\t\t\t(top > 0 || bottom > 0) && top < vHeight);\n\t}","title":""},{"docid":"ef0b2db0777c8fff16fd656704583b56","score":"0.6055098","text":"function activateSectionInView(){\n for (const el of sectionElements) {\n const navListElement = document.querySelector(`.menu__link[data-link='${el.id}']`);\n if (isInViewport(el)) {\n el.classList.add('your-active-class');\n navListElement.classList.add('active__link');\n } else {\n el.classList.remove('your-active-class');\n navListElement.classList.remove('active__link');\n }\n }\n}","title":""},{"docid":"ed9538a73e6faf4a4b625136bc25542e","score":"0.60414815","text":"nodeActiveFn() {\n return this.nodeVisibleFn_;\n }","title":""},{"docid":"909347ee6b81b1352605076090ffa351","score":"0.6040609","text":"get visible() {\n return this._visible;\n }","title":""},{"docid":"83d21f1e7e7481ac1a74afb15cc33f87","score":"0.6039501","text":"get faceVisible() {\n return this.face.is(':visible');\n }","title":""},{"docid":"340bfa99f2e668f72e4e54de9388024f","score":"0.603272","text":"function elementInViewport(el) {\n const rect = el.getBoundingClientRect();\n\n return (\n rect.top >= 0\n && rect.left >= 0\n && rect.top <= (window.innerHeight || document.documentElement.clientHeight)\n )\n }","title":""},{"docid":"836b2fa4ca321cecec79282e1d628045","score":"0.60320586","text":"get Active() {}","title":""},{"docid":"98e2fb8cb32f0eacbb2379997be743a3","score":"0.60278046","text":"function objVisibleOnScreen(obj){\n if (aqObject.CheckProperty(obj, \"Visible\", cmpEqual, true)){\n blnFlag=true; \n }\n else{\n blnFlag=false;\n }\n return blnFlag; \n }","title":""},{"docid":"c9274b9e228bded4b70d1f8f438624f4","score":"0.6018778","text":"function isVisible(element) {\n var bottom_of_object = element.offset().top + element.outerHeight();\n var bottom_of_window = $(window).scrollTop() + $(window).height();\n \n if( bottom_of_window > bottom_of_object ) {\n return true;\n } else {\n return false;\n }\n}","title":""},{"docid":"f45b8ab6fb353da78fe6c95155cedbe2","score":"0.6008596","text":"function _isInViewport() {\n $outerWrapper.toggleClass(_this.classes.above, $outerWrapper.offset().top + $outerWrapper.outerHeight() + itemsHeight > $win.scrollTop() + $win.height());\n }","title":""},{"docid":"f08c54a682e6632576006f95860a979c","score":"0.60077494","text":"isActive(active) {\n if (this.menuPosition === 'auto') {\n if (active) {\n this.calcDropdownInViewportVertical();\n } else {\n // Timeout to wait for the animation to finish before recalculating\n setTimeout(() => {\n this.calcDropdownInViewportVertical();\n }, 100);\n }\n }\n }","title":""},{"docid":"af7705000c9df92a7dd6ed4b34915e71","score":"0.59980804","text":"set visible(v) {\n super.visible = v;\n this.button.className = v ? \"tabSelected\" : \"tabUnselected\";\n this.element.className = v ? \"tabSelected\" : \"tabUnselected\";\n }","title":""},{"docid":"af7705000c9df92a7dd6ed4b34915e71","score":"0.59980804","text":"set visible(v) {\n super.visible = v;\n this.button.className = v ? \"tabSelected\" : \"tabUnselected\";\n this.element.className = v ? \"tabSelected\" : \"tabUnselected\";\n }","title":""},{"docid":"38598bea62bc41ff48c21f5eb6ac7216","score":"0.5992033","text":"function check_if_in_view() {\n //get current window information\n var window_height = web_window.height();\n var window_top_position = web_window.scrollTop();\n var window_bottom_position = window_top_position + window_height;\n\n //iterate through elements to see if its in view\n $.each(animation_elements, function () {\n //get the element sinformation\n var element = $(this);\n var element_height = $(element).outerHeight();\n var element_top_position = $(element).offset().top;\n var element_bottom_position = element_top_position + element_height;\n\n //check to see if this current container is visible (its viewable if it exists between the viewable space of the viewport)\n if (\n element_bottom_position >= window_top_position &&\n element_top_position <= window_bottom_position\n ) {\n element.addClass(\"in-view\");\n }\n // else {\n // element.removeClass(\"in-view\");\n // }\n });\n }","title":""},{"docid":"a949823a71083e0b0395b7cf5b735f92","score":"0.5987122","text":"function show() {\n var notViewed = document.querySelectorAll('.notViewed')\n var windowTopPos = document.documentElement.scrollTop || document.body.scrollTop;\n var windowHeight = window.innerHeight || document.documentElement.clientHeight || document.body.clientHeight\n var rect;\n for (var i = 0; i < notViewed.length; i++) {\n rect = notViewed[i].getBoundingClientRect()\n if (windowTopPos + rect.top < windowHeight + windowTopPos) {\n console.log(windowHeight + windowTopPos)\n //console.log(windowTopPos + rect.top)\n notViewed[i].classList.add('viewed')\n notViewed[i].classList.remove('notViewed')\n //console.log('element: ' + i + ' ' + notViewed[i] + ', offset: ' + notViewed[i].offsetTop + ', windowHeight: ' + windowHeight + ', windowTopPos: ' + windowTopPos)\n }\n }\n}","title":""},{"docid":"02514d5c5bbbe000115f6bdb24dd4452","score":"0.59863585","text":"function isVisible(element) {\n const elementPosition = element.getBoundingClientRect().top;\n const screenHeight = window.innerHeight;\n if (elementPosition < screenHeight / 1.18) {\n return true;\n }\n return false;\n}","title":""},{"docid":"888058477343e734bcc2ac37ac292517","score":"0.5981784","text":"function initInViewport() {\n jQuery('.has-anim').itemInViewport({\n activeClass: 'anim-active',\n visibleMode: 3\n });\n\n // jQuery('.top-bar *, .header-holder *, news-bar *, main > div *, main > section *, footer > div *').itemInViewport({\n // activeClass: 'opacity-active',\n // visibleMode: 3\n // });\n}","title":""},{"docid":"adff91ed5643d21669e8460935165881","score":"0.59601426","text":"function active(){\n const observer = new IntersectionObserver(\n function (views){\n for (view of views) {\n if (view.isIntersecting){\n view.target.classList.add('your-active-class');\n let navs = document.querySelectorAll('li');\n //add class 'active' to navbar\n for(nav of navs){\n if (view.target.id == nav.textContent){\n nav.classList.add('active');\n }else{nav.classList.remove('active');\n }\n }\n }else{view.target.classList.remove('your-active-class')};\n };\n \n }, {threshold: [0.65]});\n parts.forEach(part => {observer.observe(part)});\n}","title":""},{"docid":"13a7c849f2144eb96f90574ad9a2d634","score":"0.59473467","text":"checkActive (value) {\n if(this.props.currentView === value) {\n return 'active'\n }\n }","title":""},{"docid":"d42df54059c32a948642a0bee8296066","score":"0.5944997","text":"function highLightActiveSection() {\n \n let section ;\n let view ;\n for (section of arrayOfSections) {\n let pos = section.getBoundingClientRect();\n // this conditional statement is to check the view port \n if ( pos.top >=-1 && ( pos.bottom <= window.innerHeight || pos.bottom <= window.innerHeight + 350 || pos.bottom <= window.innerHeight + 400) ) {\n let viewId = section.getAttribute('id');\n view = document.getElementById(viewId);\n for (section of arrayOfSections) {\n section.classList.remove('your-active-class');\n } \n view.classList.add('your-active-class');\n \n }\n \n }\n \n}","title":""},{"docid":"c6f027ff84b0532c45f5a3678ead63cd","score":"0.59424436","text":"function setActive () {\n window.addEventListener('scroll', function (event) {\n let section = getActiveElem();\n section.classList.add('your-active-class');\n // set other sections as inactive\n for (let item of sections) {\n if (item.id != section.id & item.classList.contains('your-active-class')) {\n item.classList.remove('your-active-class');\n }\n }\n });\n}","title":""},{"docid":"fe9d95bc9bf1537e76a4ba904681377d","score":"0.5941147","text":"function setActiveState() {\n var active = true;\n // If we have autoOpen set active to this state.\n if (angular.isDefined(vm.facetAutoOpen) && vm.facetAutoOpen === 'false') {\n active = false;\n }\n vm.active = active;\n }","title":""},{"docid":"92c0fbabb24c7c333b93ab4aa8a7de75","score":"0.59394914","text":"function is_in_view(elem) {\n\t\t\t\t var docViewTop = $(window).scrollTop(); \n\t\t\t\t var docViewBottom = docViewTop + $(window).height(); \n\t\t\t\t var elemTop = $(elem).offset().top; \n\t\t\t\t var elemBottom = elemTop + $(elem).height();\n\t\t\t\t var result = ((elemBottom >= docViewTop) && (elemTop <= docViewBottom));\n\t\t\t\t return ((elemBottom >= docViewTop) && (elemTop <= docViewBottom)); \n\t\t\t\t}","title":""},{"docid":"202dd93e5dec2d483ca511ab31343846","score":"0.59375584","text":"function EZvisible(el, trueFalse)\n{\n\treturn trueFalse === true || EZisTrue(trueFalse) ? EZshow(el) : EZhide(el, true, 'visibility');\n}","title":""},{"docid":"202dd93e5dec2d483ca511ab31343846","score":"0.59375584","text":"function EZvisible(el, trueFalse)\n{\n\treturn trueFalse === true || EZisTrue(trueFalse) ? EZshow(el) : EZhide(el, true, 'visibility');\n}","title":""},{"docid":"24449920589f9c0a7f85aa6e30ba5a58","score":"0.59367234","text":"function sectionActive() {\n for (const section of allSections) {\n const box = section.getBoundingClientRect();\n if (box.top <= 170 && box.bottom >= 170) {\n section.classList.add('active-class');\n document.querySelector(`.${section.id}`).classList.add('active-link');\n } else {\n section.classList.remove('active-class');\n document.querySelector(`.${section.id}`).classList.remove('active-link');\n }\n }\n}","title":""},{"docid":"ad0a2f8fbe5b3c221eb23ca04557c720","score":"0.59366125","text":"_updateActive(/*evt, elem, scrollPos*/) {\n if (this.mutexScrollLocked()) return;\n\n var winPos = /*scrollPos ||*/ parseInt(window.pageYOffset, 10),\n curIdx;\n\n if(winPos + this.winHeight === this.docHeight){ curIdx = this.points.length - 1; }\n else if (winPos < this.points[0]){ curIdx = -1; }\n else{\n var isDown = this.scrollPos < winPos,\n _this = this,\n curVisible = this.points.filter(function(p, i){\n return isDown ? p <= winPos : p - _this.options.threshold <= winPos;//&& winPos >= _this.points[i -1] - _this.options.threshold;\n });\n curIdx = curVisible.length ? curVisible.length - 1 : 0;\n }\n\n this.$active.removeClass(this.options.activeClass);\n this.scrollPos = winPos;\n\n if (curIdx >= 0) {\n this.$active = this.$targets.eq(curIdx).addClass(this.options.activeClass);\n\n if(this.options.deepLinking) {\n this.options.updateUrl(this.$active);\n }\n }\n else {\n this.$active = $();\n this.options.updateUrl(null);\n }\n\n /**\n * Fires when magellanhash is finished updating to the new active element.\n * DIFFERENCE: no need in this\n * @event MaggelanHash#update\n */\n //this.$element.trigger('update.zf.magellanhash', [this.$active]);\n }","title":""},{"docid":"cefff897e21f670199c05bbb9265a8db","score":"0.5934395","text":"get active() {\n return this.hasAttribute('active');\n }","title":""},{"docid":"efb83e6ee7773bc7607048d7c95b4334","score":"0.5917236","text":"function is_active (a) {\n\t\t\tif (a.is_active == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}","title":""},{"docid":"03b6f89b8ecd6487d393e63cb932aa97","score":"0.59145916","text":"get active() {\n return this._isActive;\n }","title":""},{"docid":"4842856066416946403e57ff571769a3","score":"0.5913717","text":"function active() {\n return (M.mq(activeMediaQuery) && !menuActive) || floaterState(false);\n }","title":""},{"docid":"defa3181e9e30038efc57f8a2f824d08","score":"0.59070534","text":"function inView(el) {\n\t\t\t\tvar rect = el.getBoundingClientRect();\n\t\t\t\treturn (\n\t\t\t\t\trect.top <= (window.innerHeight - 100 || document.documentElement.clientHeight)\n\t\t\t\t);\n\t\t\t}","title":""},{"docid":"4296493d849535509461dcbba3b22588","score":"0.59034276","text":"isVisible() {\n return this.toolbarSelector.hasClass(\"fadeIn\");\n }","title":""},{"docid":"97ae7a7afcbf592c3089c0a5abc3466c","score":"0.5900354","text":"function check_if_in_view() {\n //get current window information\n var window_height = web_window.height();\n var window_top_position = web_window.scrollTop();\n var window_bottom_position = (window_top_position + window_height);\n\n //iterate through elements to see if its in view\n $.each(animation_elements, function() {\n\n //get the element sinformation\n var element = $(this);\n var element_height = $(element).outerHeight();\n var element_top_position = $(element).offset().top;\n var element_bottom_position = (element_top_position + element_height);\n\n //check to see if this current container is visible (its viewable if it exists between the viewable space of the viewport)\n if ((element_bottom_position >= window_top_position) && (element_top_position <= window_bottom_position)) {\n element.addClass('in-view');\n } else {\n element.removeClass('in-view');\n }\n });\n\n }","title":""},{"docid":"97ae7a7afcbf592c3089c0a5abc3466c","score":"0.5900354","text":"function check_if_in_view() {\n //get current window information\n var window_height = web_window.height();\n var window_top_position = web_window.scrollTop();\n var window_bottom_position = (window_top_position + window_height);\n\n //iterate through elements to see if its in view\n $.each(animation_elements, function() {\n\n //get the element sinformation\n var element = $(this);\n var element_height = $(element).outerHeight();\n var element_top_position = $(element).offset().top;\n var element_bottom_position = (element_top_position + element_height);\n\n //check to see if this current container is visible (its viewable if it exists between the viewable space of the viewport)\n if ((element_bottom_position >= window_top_position) && (element_top_position <= window_bottom_position)) {\n element.addClass('in-view');\n } else {\n element.removeClass('in-view');\n }\n });\n\n }","title":""},{"docid":"7f07683255fdef878c06634e410a2f24","score":"0.58967084","text":"isVisible() {\n return this.toolbarSelector.is(\":visible\");\n }","title":""},{"docid":"848a1215a197bcb62329b66841020f3f","score":"0.5890996","text":"isActive() {\n return this.getHealth() > 0;\n }","title":""},{"docid":"a88a9b9b0e1538052a10c403f9f82557","score":"0.5889728","text":"get visible() {\n return super.visible;\n }","title":""},{"docid":"a88a9b9b0e1538052a10c403f9f82557","score":"0.5889728","text":"get visible() {\n return super.visible;\n }","title":""},{"docid":"0becec6b6a01f8cb8a18525524b00fed","score":"0.5868889","text":"onScreen() {\n if (0 <= this.x && this.x <= 900) {\n this.displayed = true;\n } else {\n this.displayed = false;\n }\n }","title":""},{"docid":"992a3906342ce3c00a69023a2460e708","score":"0.5868435","text":"function isVisible(element) {\n\t\tvar top = element.getBoundingClientRect().y,\n\t\t\theight = document.documentElement.clientHeight;\n\t\treturn (window.scrollY + height) > top;\n\t}","title":""},{"docid":"f2e59eb7838fd0a87800b57b6b6ca76f","score":"0.5868021","text":"activate () {\n this._isActive = true\n }","title":""},{"docid":"3d8c898afb997ef1068173db1d2fd5be","score":"0.58657706","text":"function showActiveSection() {\n const sections = document.querySelectorAll(\"section[data-nav]\");\n\n sections.forEach(section => {\n navItems.forEach(item => {\n if (item.hash === ('#' + section.id)) {\n if (isInViewport(section)) {\n item.classList.add(\"active\");\n } else {\n item.classList.remove(\"active\");\n }\n }\n });\n });\n}","title":""},{"docid":"96fb63932dcb39768a91cabc145b77fa","score":"0.58652383","text":"function check_if_in_view() {\r\n //get current window information\r\n var window_height = web_window.height();\r\n var window_top_position = web_window.scrollTop();\r\n var window_bottom_position = (window_top_position + window_height);\r\n\r\n //iterate through elements to see if its in view\r\n $.each(animation_elements, function() {\r\n\r\n //get the elements information\r\n var element = $(this);\r\n var element_height = $(element).outerHeight();\r\n var element_top_position = $(element).offset().top;\r\n var element_bottom_position = (element_top_position + element_height);\r\n\r\n //check to see if this current container is visible (its viewable if it exists between the viewable space of the viewport)\r\n if ((element_bottom_position >= window_top_position) && (element_top_position <= window_bottom_position)) {\r\n element.addClass('in-view');\r\n } else {\r\n element.removeClass('in-view');\r\n }\r\n });\r\n\r\n }","title":""},{"docid":"d0b259da37862d584bdd86b7cc35325e","score":"0.5852267","text":"get active() {\n\t\treturn this.getAttribute('active');\n\t}","title":""},{"docid":"79df21332578b4eac663f19dca5d9872","score":"0.5852252","text":"checkVisible() {\n\t\tif (this.parentNode) {\n\t\t\tlet numCards = document.body.clientWidth > MOBILE_RESOLUTION ? 3 : 1;\n\t\t\tthis.isVisible = Array.from(this.parentNode.children).indexOf(this) < numCards;\n\t\t}\n\t}","title":""},{"docid":"273f6df97c9e73bca98967b7e19c1492","score":"0.58458555","text":"function classActive(element) {\r\n\t\tif($(element).hasClass('active')) {\r\n\t\t\t$(element).removeClass('active');\r\n\t\t}\r\n\t\telse {\r\n\t\t\t$('.btn-paint').removeClass('active'); \r\n\t\t\t$(element).addClass('active');\r\n\t\t}\r\n\r\n\t\t$('#pipette').hasClass('active') == true ? \r\n\t\t$('#pipette-setup').css('display', 'block') : \r\n\t\t$('#pipette-setup').css('display', 'none');\r\n\r\n\t\t$('#text').hasClass('active') == true ? \r\n\t\t$('#text-setup').css('display', 'block') : \r\n\t\t$('#text-setup').css('display', 'none');\r\n\r\n\t\t$('#degrade').hasClass('active') == true ? \r\n\t\t$('#degrade-setup').css('display', 'block') : \r\n\t\t$('#degrade-setup').css('display', 'none');\r\n\t}","title":""},{"docid":"19b8f8f638bf7f650ce6d607e6e60a8e","score":"0.5838367","text":"isActive() {\n return this.enabled;\n }","title":""},{"docid":"a062d24380b6ffbf758798ffce713073","score":"0.5835376","text":"function checkView () {\n let isInViewport = function (elem) {\n let bounding = elem.getBoundingClientRect();\n return (\n bounding.top >= 0 &&\n bounding.left >= 0 &&\n bounding.bottom <= (window.innerHeight || document.documentElement.clientHeight) &&\n bounding.right <= (window.innerWidth || document.documentElement.clientWidth)\n );\n };\n\n const features = document.querySelector('content-features');\n window.addEventListener('scroll', function (event) {\n if (isInViewport(features)) {\n let featView = document.querySelector('Features');\n featView.classList.add(\"active\");\n }\n }, false);\n}","title":""},{"docid":"91ad6be91fb1ac64fcd06c1092fe69bc","score":"0.5826505","text":"visible() {\n return this.actor_attribute_key == AttributeKey.classes;\n }","title":""},{"docid":"5ad0309b93594a83dd4e32e35157b5de","score":"0.58253556","text":"function elementInViewport(el) {\n\t\t\t\t var top = el.offsetTop,\n\t\t\t\t left = el.offsetLeft,\n\t\t\t\t width = el.offsetWidth,\n\t\t\t\t height = el.offsetHeight;\n\n\t\t\t\t while(el.offsetParent) {\n\t\t\t\t el = el.offsetParent;\n\t\t\t\t top += el.offsetTop;\n\t\t\t\t left += el.offsetLeft;\n\t\t\t\t }\n\n\t\t\t\t return (\n\t\t\t\t top < (window.pageYOffset + window.innerHeight) + 56 &&\n\t\t\t\t left < (window.pageXOffset + window.innerWidth) + 56 &&\n\t\t\t\t (top + height) > window.pageYOffset + 56 &&\n\t\t\t\t (left + width) > window.pageXOffset + 56\n\t\t\t\t );\n\t\t\t}","title":""},{"docid":"91b191a4df8ddbf4c2649c3991d76687","score":"0.5825278","text":"function isElementInView(el, n) {\n const rect = el.getBoundingClientRect();\n const elemTop = rect.top\n const elemBottom = rect.bottom\n const isVisible = (elemTop >= 0) && ((elemBottom/n) <= ((window.innerHeight) || (document.documentElement.clientHeight)));\n return isVisible\n}","title":""},{"docid":"a9e80d7b932c8be506a5033bfffaf587","score":"0.5821083","text":"function activeSection(){\n for(section of allSections){ \n\t// check if the section in the viewport of the screen\n\t if(sectionPosition(section)){\n\t// check if the section has the active class or not\n\t if(section.classList.contains(\"your-active-class\")){\n\t \tsection.classList.remove(\"your-active-class\"); }\n\t else{\n\t section.classList.add(\"your-active-class\");}\n\t }\n }\n}","title":""},{"docid":"18983c94060fa872191dc736a35a9b32","score":"0.5819175","text":"activeClass() {\n const curSlide = this.config.loop ? this.curSlide + this.visibleSlides : this.curSlide;\n const classCount = this.visibleSlides;\n const availableItems = this.selector.querySelectorAll(this.config.itemSelector);\n const itemSelector = this.config.itemSelector.replace('.', '');\n const activeClass = itemSelector + '-active';\n\n if (availableItems) {\n for (let i = 0; i < availableItems.length; i += 1) {\n availableItems[i].classList.remove(activeClass);\n }\n\n for (let j = 0; j < classCount; j += 1) {\n availableItems[curSlide + j].classList.add(activeClass);\n }\n\n // centered mode\n if (this.config.centerMode) {\n this.centerMode(itemSelector);\n }\n }\n\n }","title":""},{"docid":"1825671ec828ba3284fd36debaf6722b","score":"0.58177483","text":"function visible(element){var visibility=element.css(\"visibility\");while(visibility===\"inherit\"){element=element.parent();visibility=element.css(\"visibility\");}return visibility!==\"hidden\";}","title":""},{"docid":"6ad7951bc64c27c040b8f21c93398a89","score":"0.5817723","text":"getVisibilityState() {\n return this.ampdoc.getVisibilityState();\n }","title":""},{"docid":"2663b5bb9efa2783a79fdfa89384d6f7","score":"0.58143425","text":"function check_if_in_view(){\n var window_height = $window.height();\n var window_top_position = $window.scrollTop();\n var window_bottom_position = (window_top_position + window_height);\n\n $.each($index_article_img, function(){\n var $element = $(this);\n var element_height = $element.outerHeight();\n var element_top_position = $element.offset().top;\n var element_bottom_position = (element_top_position + element_height);\n\n if ((element_bottom_position >= window_top_position) && (element_top_position <= window_bottom_position)){\n $element.addClass('in-view');\n } else {\n $element.removeClass('in-view');\n }\n });\n}","title":""}],"string":"[\n {\n \"docid\": \"753fd2aadc13a906756ac678a4a12330\",\n \"score\": \"0.7436931\",\n \"text\": \"function activeView(element) {\\n const postion = element.getBoundingClientRect();\\n return (\\n // the first two values to insure that every section is on the top of the screen or down a bit.\\n postion.top >= 0 &&\\n postion.left >= 0 &&\\n //these vakues is used to make sure the section is still active while it is on the viewport.\\n postion.bottom <=\\n (window.innerHeight || document.documentElement.clientHeight) &&\\n postion.right <= (window.innerWidth || document.documentElement.clientWidth)\\n );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17aafea549bf11885616d9e8b246c26c\",\n \"score\": \"0.6587437\",\n \"text\": \"_checkVisible() {\\n const viewHeight = Math.max(document.documentElement.clientHeight, \\n window.innerHeight);\\n const rect = this.container.getBoundingClientRect();\\n const offSet = 300;\\n const visible = !(rect.bottom < (0 - offSet) \\n || rect.top - viewHeight >= (0 + offSet));\\n\\n if(this.state.visible !== visible) {\\n this.setState({visible});\\n } \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1049bc21470d171236c213a0f0c7f35\",\n \"score\": \"0.6584574\",\n \"text\": \"get visible() { return (this._visible); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2fba2ddbdc55a65609dd3d15be5d12d\",\n \"score\": \"0.6545421\",\n \"text\": \"function checkviewportvisible() {\\n viewport = jQuery(window).height();\\n jQuery('.bos').each(function(){\\n\\n scrollwindow = viewport + jQuery(window).scrollTop()\\n element = jQuery(this);\\n \\n if (element.offset().top <= scrollwindow ) {\\n element.animate({\\n 'top': '0',\\n 'opacity': 1\\n }, 1000);\\n } \\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"369218f60a97993ad34c610417c76425\",\n \"score\": \"0.6540943\",\n \"text\": \"function isVisibleOnPage(elem){var docViewTop = $(window).scrollTop();var elemTop = $(elem).offset().top; var windowHeight = $(window).height(); return (elemTop <= docViewTop + 100);}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"369218f60a97993ad34c610417c76425\",\n \"score\": \"0.6540943\",\n \"text\": \"function isVisibleOnPage(elem){var docViewTop = $(window).scrollTop();var elemTop = $(elem).offset().top; var windowHeight = $(window).height(); return (elemTop <= docViewTop + 100);}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"903c449baeb5af5319ec89ebfcd2e57c\",\n \"score\": \"0.6497301\",\n \"text\": \"function checkActive(section){\\n const OFFSET = 350;\\n const anchor = document.querySelector(`a[href=\\\"#${section.id}\\\"]`);\\n const sectionViewPoint = section.getBoundingClientRect();\\n \\n //if the viewpoint is within the offset then it's the active section\\n if(sectionViewPoint.top <= OFFSET && (sectionViewPoint.height * -1 + OFFSET) <= sectionViewPoint.top){\\n section.classList.add(\\\"your-active-class\\\");\\n anchor.parentElement.classList.add(\\\"your-active-class\\\");\\n }\\n //remove active if viewpoint is not visable or in the main visablity.\\n else{\\n section.classList.remove(\\\"your-active-class\\\");\\n anchor.parentElement.classList.remove(\\\"your-active-class\\\");\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e83920525d57eb910b76c2a05531e573\",\n \"score\": \"0.6489123\",\n \"text\": \"isActive() {\\n var _a;\\n return ((_a = this.tabEl) === null || _a === void 0 ? void 0 : _a.classList.contains(\\\"active\\\")) || false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5fdfe41b7cfde811b7f291a34057e744\",\n \"score\": \"0.6446921\",\n \"text\": \"function isVisible($el) {\\r\\n var winTop = $(window).scrollTop();\\r\\n var winBottom = winTop + $(window).height();\\r\\n var elTop = $el.offset().top;\\r\\n var elBottom = elTop + $el.height();\\r\\n return ((elBottom <= winBottom) && (elTop >= winTop));\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"251ed8c6f7e8bf0446bd6c7301dc8136\",\n \"score\": \"0.6369589\",\n \"text\": \"function isActive() {\\n for (let section of sections) {\\n if (isInViewport(section)) {\\n section.classList.add('your-active-class');\\n } else {\\n section.classList.remove('your-active-class');\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4473c95a92024fb74b10b5165d96eaa8\",\n \"score\": \"0.63664967\",\n \"text\": \"function isVisible(el) {\\n const rect = el.getBoundingClientRect();\\n const windowHeight =\\n window.innerHeight || document.documentElement.clientHeight;\\n const windowWidth = window.innerWidth || document.documentElement.clientWidth;\\n\\n const vertInView = rect.top <= windowHeight && rect.top + rect.height >= 0;\\n const horInView = rect.left <= windowWidth && rect.left + rect.width >= 0;\\n\\n return vertInView && horInView;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0856c2217ea313490ef597ec3c4a5406\",\n \"score\": \"0.6354982\",\n \"text\": \"function setToActive(){\\n for (let i = 0; i < sections.length; i++){\\n if (isInViewport(sections[i])){\\n sections[i].classList.add(\\\"your-active-class\\\");\\n }else{\\n sections[i].classList.remove(\\\"your-active-class\\\");\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc89dcc6a5abf9ed2d9437fd40694f80\",\n \"score\": \"0.63430625\",\n \"text\": \"isVisible() {\\n return this.visible;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea4b7d541781eaf2109a1d3ef3770258\",\n \"score\": \"0.6326344\",\n \"text\": \"function viewportCheck() {\\n let sectionList = document.querySelectorAll('section');\\n for (listItem of sectionList) {\\n let isInViewport = function (listItem) {\\n let posSection = listItem.getBoundingClientRect();\\n return (posSection.top > -300 && 300 > posSection.top);\\n };\\n const notActive = document.querySelector('.your-active-class')\\n if (isInViewport(listItem)) {\\n notActive.classList.remove('your-active-class');\\n listItem.classList.add('your-active-class');\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"500eefe72a1f7e3fab37b7a0f57e4d76\",\n \"score\": \"0.63238287\",\n \"text\": \"isVisible() {\\n return this._visibility === 'visible';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5186066eaed882515f675bd49f1681e1\",\n \"score\": \"0.6322\",\n \"text\": \"function isScrolledIntoView(el) {\\r\\n\\t var elemTop = el.getBoundingClientRect().top;\\r\\n\\t var elemBottom = el.getBoundingClientRect().bottom;\\r\\n\\r\\n\\t var isVisible = (elemTop >= 0) && (elemBottom <= window.innerHeight);\\r\\n\\t\\t\\t// $('.img-brand-block').addClass(\\\"fadeInDown\\\");\\r\\n\\t\\t\\t// console.log(\\\"Element is in view!\\\");\\r\\n\\t return isVisible;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31990e738ec9061016da26bb842c01bc\",\n \"score\": \"0.63170195\",\n \"text\": \"get visible()\\n {\\n return this.elt.getBoundingClientRect().height > 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd7abe7b371df7ab11e744978190d0a5\",\n \"score\": \"0.63136846\",\n \"text\": \"function active()\\n{ \\n document.addEventListener('scroll',function () \\n { \\n for(const section of sections)\\n {\\n const pos= section.getBoundingClientRect();//get the section position reletive to the viewport\\n if(pos.bottom> 0 && pos.bottom <= screen.height)//condition when section is in the viewport add class='active'\\n {\\n section.classList.add('active');\\n const dataValue = section.getAttribute('data-nav');\\n activeAnchor(dataValue);\\n }\\n else//if the section isn't in viewport remove class='active' \\n {\\n section.classList.remove('active');\\n } \\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16b59529b4f32efb5138cb618f151984\",\n \"score\": \"0.6311569\",\n \"text\": \"function inView(){\\n var sections = document.querySelectorAll('section');\\n for (var x = 0; x< sections.length; x++){\\n var sec = sections[x].id;\\n var el = document.getElementById(sec);\\n var pos = el.getBoundingClientRect();\\n if (pos.top > -150 && pos.top < window.innerHeight - pos.top){\\n var liCol = document.querySelectorAll('li');\\n liCol[x].classList = 'active_li';\\n }else{\\n var liCol = document.querySelectorAll('li');\\n liCol[x].classList.remove('active_li');\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"212fea21c64b36d1634e219b1e69c285\",\n \"score\": \"0.63022393\",\n \"text\": \"function makeVisible(element) {\\n var selfTop = element.offset().top;\\n if ( scrollPos > (selfTop - windowHeight + 100)) {\\n element.addClass('visible');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f1c6d05c454ccebdb1651afec0d67235\",\n \"score\": \"0.62850773\",\n \"text\": \"function check_element_visible() {\\n var browser_height = $browser.height();\\n var browser_top_position = $browser.scrollTop();\\n var browser_bottom_position = (browser_top_position + browser_height);\\n \\n \\n $.each($animate_el, function () {\\n var $element = $(this);\\n var element_height = $element.outerHeight();\\n var element_top_position = $element.offset().top;\\n var element_bottom_position = (element_top_position + element_height);\\n \\n \\n if ((element_bottom_position >= browser_top_position) && (element_top_position <= browser_bottom_position)) {\\n $element.addClass('visible');\\n } else {\\n $element.removeClass('visible');\\n }\\n \\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a45b3dd6e4eb058647b8b745de97ce85\",\n \"score\": \"0.6284215\",\n \"text\": \"function activeClass() {\\n const secTop = [];\\n let inView = 10000;\\n Array.prototype.forEach.call(sections, section => {\\n secTop.push(section.getBoundingClientRect().top)\\n })\\n Array.prototype.forEach.call(secTop, elem => {\\n if (elem >= 0 && elem < inView) {\\n inView = elem;\\n }\\n })\\n Array.prototype.forEach.call(sections, section => {\\n if (section.getBoundingClientRect().top == inView) {\\n if (!section.classList.contains('your-active-class')) {\\n section.classList.add('your-active-class');\\n }\\n } else {\\n section.classList.remove('your-active-class');\\n }\\n })\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"297c18a043ca8c0bc7daefffdc67ce7b\",\n \"score\": \"0.6261826\",\n \"text\": \"function activeClass(){\\r\\n\\r\\n for (let i=0; i < sections.length; i++){\\r\\n\\r\\n if (isInViewport(sections[i])){\\r\\n\\r\\n sections[i].classList.add(\\\"your-active-class\\\");\\r\\n\\r\\n }else{\\r\\n\\r\\n sections[i].classList.remove(\\\"your-active-class\\\");\\r\\n \\r\\n }\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f67e27e4839b5a07477c3c372712c76c\",\n \"score\": \"0.6244689\",\n \"text\": \"isElementVisible(el) {\\n var rect = el.getBoundingClientRect();\\n if (rect.width === 0) return false;\\n if (rect.height === 0) return false;\\n if (rect.top < 0) return false;\\n if (rect.left < 0) return false;\\n if (rect.bottom > (window.innerHeight || document.documentElement.clientHeight)) return false;\\n if (rect.right > (window.innerWidth || document.documentElement.clientWidth)) return false;\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e7870e27a183dfc2d9d93938a6fd3bf\",\n \"score\": \"0.622341\",\n \"text\": \"function getViewActive() {\\n\\t /**\\n\\t * Finds particular Node by ClassName.\\n\\t * @param par - ClassName - string\\n\\t * @return Nodes of particular Class\\n\\t *\\n\\t */\\n\\t function searchPlace(par) {\\n\\t return document.getElementsByClassName(par);\\n\\t }\\n\\t\\n\\t var listTodos = searchPlace(\\\"todos-item_undone-mark-w\\\");\\n\\t\\n\\t for (var i = 0; i < listTodos.length; i++) {\\n\\t listTodos[i].parentNode.style.display = \\\"block\\\";\\n\\t }\\n\\t\\n\\t listTodos = searchPlace(\\\"todos-item_done-mark-w\\\");\\n\\t\\n\\t for (var i = 0; i < listTodos.length; i++) {\\n\\t listTodos[i].parentNode.style.display = \\\"none\\\";\\n\\t }\\n\\t\\n\\t listTodos=null;\\n\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac47e3f48513884fda6c8b78057a4d59\",\n \"score\": \"0.62101734\",\n \"text\": \"function toggleActiveState() {\\n\\n let options = {\\n root: document,\\n rootMargin: '0px',\\n threshold: [1.0]\\n };\\n // Set sections as active\\n let handleIntersect = (entries, observer) => {\\n entries.forEach(entry => {\\n if (entry.isIntersecting) {\\n entry.target.classList.add('your-active-class');\\n } else {\\n entry.target.classList.remove('your-active-class');\\n }\\n\\n });\\n };\\n\\n const observer = new IntersectionObserver(handleIntersect, options);\\n Array.prototype.forEach.call(sections, (el) => {\\n observer.observe(el);\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef28e13ee5856722ee57fc949ab59bd3\",\n \"score\": \"0.6201167\",\n \"text\": \"function isVisible(element) {\\n var viewport = $(window);\\n\\n var topOfViewport = $(window).scrollTop();\\n var bottomOfViewport = topOfViewport + viewport.height();\\n\\n var topOfElement = element.offset().top;\\n var bottomOfElement = topOfElement + element.height();\\n\\n var ease = element.height() / 2;\\n\\n var isInsideViewport = ((topOfElement + ease >= topOfViewport) && (bottomOfElement - ease <= bottomOfViewport));\\n\\n return isInsideViewport;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f17d2c7bb92dedc5cd2462610989835\",\n \"score\": \"0.61827475\",\n \"text\": \"function activeSection() {\\n for (let i = 0; i < sections.length; i++) {\\n const visibleSection = sections[i].getBoundingClientRect();\\n if (visibleSection.top <= 150 && visibleSection.bottom >= 150){\\n sections[i].classList.add('your-active-class');\\n } else {\\n sections[i].classList.remove('your-active-class');\\n };\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd801671e366c9843d962bfacbc0f1a9\",\n \"score\": \"0.6179745\",\n \"text\": \"async isActive() {\\n const host = await this.host();\\n return host.hasClass('mdc-tab--active');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1275855d61500429d530c4fa19135b9\",\n \"score\": \"0.6168258\",\n \"text\": \"function setActiveState($el) {\\n $activeHeaderTrigger.removeClass(\\\"isSelected\\\");\\n $activeHeaderTrigger.attr(\\\"aria-expanded\\\", \\\"false\\\");\\n $activeHeaderTrigger\\n .find(\\\".site-nav__chevron-down\\\")\\n .removeClass(\\\"hide\\\");\\n $activeHeaderTrigger.find(\\\".site-nav__chevron-up\\\").addClass(\\\"hide\\\");\\n $(document).find(\\\"[data-header-overlay]\\\").css('z-index', -1);\\n\\n if ($el !== \\\"\\\") {\\n $el.addClass(\\\"isSelected\\\");\\n $el.attr(\\\"aria-expanded\\\", \\\"true\\\");\\n $el.find(\\\".site-nav__chevron-down\\\").addClass(\\\"hide\\\");\\n $el.find(\\\".site-nav__chevron-up\\\").removeClass(\\\"hide\\\");\\n $(document).find(\\\"[data-header-overlay]\\\").css('z-index', 4);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"621b47d1a130960119c5585365c57bb8\",\n \"score\": \"0.6163659\",\n \"text\": \"function makeactive(event) {\\n for (let section of sections) {\\n var rect = section.getBoundingClientRect();\\n if (rect.top < 700 & rect.top > -120){\\n section.className = \\\"your-active-class\\\";\\n }\\n else{\\n section.className = \\\"\\\";\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81cd110c277693e361c501e848c28024\",\n \"score\": \"0.6135477\",\n \"text\": \"get active() {\\n return this.hasAttribute(\\\"active\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"879809f829131aab19b864c4e33dab81\",\n \"score\": \"0.6128646\",\n \"text\": \"get visible() {\\n return this._visible;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86387a4e030ab6253b6fa985a2e84cbb\",\n \"score\": \"0.61255133\",\n \"text\": \"get visible() {\\n return this._visible\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5fe9f8ae9c7faa330a2b1494737ae3a2\",\n \"score\": \"0.6111018\",\n \"text\": \"function activeStatus(){\\n\\nfor (i=0 ; i<(sections.length);i++){\\n\\n//https://www.w3schools.com/jsref/met_element_getboundingclientrect.asp\\n const view = sections[i].getBoundingClientRect();\\n\\n//check the position of section\\n if(view.top <= 150 && view.bottom > 150){\\n\\n sections[i].classList.add('your-active-class');\\n\\n const activeAnchor = document.querySelectorAll('a')[i];\\n// check the style of active anchor\\n activeAnchor.style.cssText = \\\"background: red;\\\";\\n\\n }\\n\\n else {\\n\\n sections[i].classList.remove('your-active-class');\\n\\n const inactiveAnchor = document.querySelectorAll('a')[i];\\n\\n inactiveAnchor.style.cssText = \\\"background: green;\\\";\\n\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12b8acd646b8eb1d0d1272c32be5351f\",\n \"score\": \"0.6107882\",\n \"text\": \"function addActiveClass(){ \\n for (section of sections){\\n if (isInViewport(section)){\\n section.classList.add(\\\"your-active-class\\\");\\n }else{\\n section.classList.remove(\\\"your-active-class\\\");\\n } \\n } \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce44eebabee2f760ee60cc156440352c\",\n \"score\": \"0.60985214\",\n \"text\": \"function checkVisibleSection() {\\n\\t\\tvar scrollTop = $(window).scrollTop(),\\n\\t\\t\\twindowHeight = $(window).height();\\n\\n\\t\\t$('[data-type=\\\"slider-item\\\"]').each(function(){\\n\\t\\t\\tvar actualBlock = $(this),\\n\\t\\t\\t\\toffset = scrollTop - actualBlock.offset().top;\\n\\t\\t\\t//add/remove .is-visible class if the section is in the viewport - it is used to navigate through the sections\\n\\t\\t\\t( offset >= 0 && offset < windowHeight ) ? actualBlock.addClass('is-visible') : actualBlock.removeClass('is-visible');\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28572b41be965d2f620a33d2991cd87f\",\n \"score\": \"0.6098519\",\n \"text\": \"function isVisible(ele) {\\n const { top, bottom } = ele.getBoundingClientRect();\\n const vHeight = (window.innerHeight || document.documentElement.clientHeight);\\n return ((top > 0 || bottom > 0) && top < vHeight);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8c6961dd296d28d330fa5d4d2f554ba\",\n \"score\": \"0.6087095\",\n \"text\": \"isVisible() {\\n return this.ampdoc.isVisible();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d164107c20091afc94593408303a719\",\n \"score\": \"0.6085932\",\n \"text\": \"function makeActiv () {\\n for (let sec of sections) {\\n let box = sec.getBoundingClientRect(); // get coordinates of each section element\\n let link = sec.id;\\n let uLink = document.querySelector(`.${link}`);\\n\\n if (box.top <= 150 && box.bottom >= 150) { // if box-top coordinate (extracted via getBoundingClientRect) within 150px from the viewport and until box bottom is at 150px or more from the viewport\\n sec.classList.add('your-active-class');\\n uLink.classList.add('active');\\n }\\n else {\\n sec.classList.remove('your-active-class');\\n uLink.classList.remove('active');\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85883dbac3c7a36021b326ab4f665c51\",\n \"score\": \"0.60822797\",\n \"text\": \"active(){\\n return this.isActive;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e96bf8c7ee0bf4fd153e14630b30f305\",\n \"score\": \"0.60636544\",\n \"text\": \"isVisible(element) {\\n return hasGeometry(element) && getComputedStyle(element).visibility === 'visible';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e96bf8c7ee0bf4fd153e14630b30f305\",\n \"score\": \"0.60636544\",\n \"text\": \"isVisible(element) {\\n return hasGeometry(element) && getComputedStyle(element).visibility === 'visible';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd26e4049c5358894e630653370969ed\",\n \"score\": \"0.6058441\",\n \"text\": \"isActive() {\\n return (\\n (this.props.active.type === EnumSelection.Step) &&\\n (this.props.active.step === this.props.step.key)\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"754e7d92d1d617888f380db13b7b6b73\",\n \"score\": \"0.60568374\",\n \"text\": \"function isVisible(ele) {\\n\\t\\tconst { top, bottom } = ele.getBoundingClientRect();\\n\\t\\tconst vHeight = (window.innerHeight || document.documentElement.clientHeight);\\n\\t\\treturn (\\n\\t\\t\\t(top > 0 || bottom > 0) && top < vHeight);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef0b2db0777c8fff16fd656704583b56\",\n \"score\": \"0.6055098\",\n \"text\": \"function activateSectionInView(){\\n for (const el of sectionElements) {\\n const navListElement = document.querySelector(`.menu__link[data-link='${el.id}']`);\\n if (isInViewport(el)) {\\n el.classList.add('your-active-class');\\n navListElement.classList.add('active__link');\\n } else {\\n el.classList.remove('your-active-class');\\n navListElement.classList.remove('active__link');\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed9538a73e6faf4a4b625136bc25542e\",\n \"score\": \"0.60414815\",\n \"text\": \"nodeActiveFn() {\\n return this.nodeVisibleFn_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"909347ee6b81b1352605076090ffa351\",\n \"score\": \"0.6040609\",\n \"text\": \"get visible() {\\n return this._visible;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83d21f1e7e7481ac1a74afb15cc33f87\",\n \"score\": \"0.6039501\",\n \"text\": \"get faceVisible() {\\n return this.face.is(':visible');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"340bfa99f2e668f72e4e54de9388024f\",\n \"score\": \"0.603272\",\n \"text\": \"function elementInViewport(el) {\\n const rect = el.getBoundingClientRect();\\n\\n return (\\n rect.top >= 0\\n && rect.left >= 0\\n && rect.top <= (window.innerHeight || document.documentElement.clientHeight)\\n )\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"836b2fa4ca321cecec79282e1d628045\",\n \"score\": \"0.60320586\",\n \"text\": \"get Active() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98e2fb8cb32f0eacbb2379997be743a3\",\n \"score\": \"0.60278046\",\n \"text\": \"function objVisibleOnScreen(obj){\\n if (aqObject.CheckProperty(obj, \\\"Visible\\\", cmpEqual, true)){\\n blnFlag=true; \\n }\\n else{\\n blnFlag=false;\\n }\\n return blnFlag; \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9274b9e228bded4b70d1f8f438624f4\",\n \"score\": \"0.6018778\",\n \"text\": \"function isVisible(element) {\\n var bottom_of_object = element.offset().top + element.outerHeight();\\n var bottom_of_window = $(window).scrollTop() + $(window).height();\\n \\n if( bottom_of_window > bottom_of_object ) {\\n return true;\\n } else {\\n return false;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f45b8ab6fb353da78fe6c95155cedbe2\",\n \"score\": \"0.6008596\",\n \"text\": \"function _isInViewport() {\\n $outerWrapper.toggleClass(_this.classes.above, $outerWrapper.offset().top + $outerWrapper.outerHeight() + itemsHeight > $win.scrollTop() + $win.height());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f08c54a682e6632576006f95860a979c\",\n \"score\": \"0.60077494\",\n \"text\": \"isActive(active) {\\n if (this.menuPosition === 'auto') {\\n if (active) {\\n this.calcDropdownInViewportVertical();\\n } else {\\n // Timeout to wait for the animation to finish before recalculating\\n setTimeout(() => {\\n this.calcDropdownInViewportVertical();\\n }, 100);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af7705000c9df92a7dd6ed4b34915e71\",\n \"score\": \"0.59980804\",\n \"text\": \"set visible(v) {\\n super.visible = v;\\n this.button.className = v ? \\\"tabSelected\\\" : \\\"tabUnselected\\\";\\n this.element.className = v ? \\\"tabSelected\\\" : \\\"tabUnselected\\\";\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af7705000c9df92a7dd6ed4b34915e71\",\n \"score\": \"0.59980804\",\n \"text\": \"set visible(v) {\\n super.visible = v;\\n this.button.className = v ? \\\"tabSelected\\\" : \\\"tabUnselected\\\";\\n this.element.className = v ? \\\"tabSelected\\\" : \\\"tabUnselected\\\";\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"38598bea62bc41ff48c21f5eb6ac7216\",\n \"score\": \"0.5992033\",\n \"text\": \"function check_if_in_view() {\\n //get current window information\\n var window_height = web_window.height();\\n var window_top_position = web_window.scrollTop();\\n var window_bottom_position = window_top_position + window_height;\\n\\n //iterate through elements to see if its in view\\n $.each(animation_elements, function () {\\n //get the element sinformation\\n var element = $(this);\\n var element_height = $(element).outerHeight();\\n var element_top_position = $(element).offset().top;\\n var element_bottom_position = element_top_position + element_height;\\n\\n //check to see if this current container is visible (its viewable if it exists between the viewable space of the viewport)\\n if (\\n element_bottom_position >= window_top_position &&\\n element_top_position <= window_bottom_position\\n ) {\\n element.addClass(\\\"in-view\\\");\\n }\\n // else {\\n // element.removeClass(\\\"in-view\\\");\\n // }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a949823a71083e0b0395b7cf5b735f92\",\n \"score\": \"0.5987122\",\n \"text\": \"function show() {\\n var notViewed = document.querySelectorAll('.notViewed')\\n var windowTopPos = document.documentElement.scrollTop || document.body.scrollTop;\\n var windowHeight = window.innerHeight || document.documentElement.clientHeight || document.body.clientHeight\\n var rect;\\n for (var i = 0; i < notViewed.length; i++) {\\n rect = notViewed[i].getBoundingClientRect()\\n if (windowTopPos + rect.top < windowHeight + windowTopPos) {\\n console.log(windowHeight + windowTopPos)\\n //console.log(windowTopPos + rect.top)\\n notViewed[i].classList.add('viewed')\\n notViewed[i].classList.remove('notViewed')\\n //console.log('element: ' + i + ' ' + notViewed[i] + ', offset: ' + notViewed[i].offsetTop + ', windowHeight: ' + windowHeight + ', windowTopPos: ' + windowTopPos)\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02514d5c5bbbe000115f6bdb24dd4452\",\n \"score\": \"0.59863585\",\n \"text\": \"function isVisible(element) {\\n const elementPosition = element.getBoundingClientRect().top;\\n const screenHeight = window.innerHeight;\\n if (elementPosition < screenHeight / 1.18) {\\n return true;\\n }\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"888058477343e734bcc2ac37ac292517\",\n \"score\": \"0.5981784\",\n \"text\": \"function initInViewport() {\\n jQuery('.has-anim').itemInViewport({\\n activeClass: 'anim-active',\\n visibleMode: 3\\n });\\n\\n // jQuery('.top-bar *, .header-holder *, news-bar *, main > div *, main > section *, footer > div *').itemInViewport({\\n // activeClass: 'opacity-active',\\n // visibleMode: 3\\n // });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"adff91ed5643d21669e8460935165881\",\n \"score\": \"0.59601426\",\n \"text\": \"function active(){\\n const observer = new IntersectionObserver(\\n function (views){\\n for (view of views) {\\n if (view.isIntersecting){\\n view.target.classList.add('your-active-class');\\n let navs = document.querySelectorAll('li');\\n //add class 'active' to navbar\\n for(nav of navs){\\n if (view.target.id == nav.textContent){\\n nav.classList.add('active');\\n }else{nav.classList.remove('active');\\n }\\n }\\n }else{view.target.classList.remove('your-active-class')};\\n };\\n \\n }, {threshold: [0.65]});\\n parts.forEach(part => {observer.observe(part)});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13a7c849f2144eb96f90574ad9a2d634\",\n \"score\": \"0.59473467\",\n \"text\": \"checkActive (value) {\\n if(this.props.currentView === value) {\\n return 'active'\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d42df54059c32a948642a0bee8296066\",\n \"score\": \"0.5944997\",\n \"text\": \"function highLightActiveSection() {\\n \\n let section ;\\n let view ;\\n for (section of arrayOfSections) {\\n let pos = section.getBoundingClientRect();\\n // this conditional statement is to check the view port \\n if ( pos.top >=-1 && ( pos.bottom <= window.innerHeight || pos.bottom <= window.innerHeight + 350 || pos.bottom <= window.innerHeight + 400) ) {\\n let viewId = section.getAttribute('id');\\n view = document.getElementById(viewId);\\n for (section of arrayOfSections) {\\n section.classList.remove('your-active-class');\\n } \\n view.classList.add('your-active-class');\\n \\n }\\n \\n }\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6f027ff84b0532c45f5a3678ead63cd\",\n \"score\": \"0.59424436\",\n \"text\": \"function setActive () {\\n window.addEventListener('scroll', function (event) {\\n let section = getActiveElem();\\n section.classList.add('your-active-class');\\n // set other sections as inactive\\n for (let item of sections) {\\n if (item.id != section.id & item.classList.contains('your-active-class')) {\\n item.classList.remove('your-active-class');\\n }\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe9d95bc9bf1537e76a4ba904681377d\",\n \"score\": \"0.5941147\",\n \"text\": \"function setActiveState() {\\n var active = true;\\n // If we have autoOpen set active to this state.\\n if (angular.isDefined(vm.facetAutoOpen) && vm.facetAutoOpen === 'false') {\\n active = false;\\n }\\n vm.active = active;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92c0fbabb24c7c333b93ab4aa8a7de75\",\n \"score\": \"0.59394914\",\n \"text\": \"function is_in_view(elem) {\\n\\t\\t\\t\\t var docViewTop = $(window).scrollTop(); \\n\\t\\t\\t\\t var docViewBottom = docViewTop + $(window).height(); \\n\\t\\t\\t\\t var elemTop = $(elem).offset().top; \\n\\t\\t\\t\\t var elemBottom = elemTop + $(elem).height();\\n\\t\\t\\t\\t var result = ((elemBottom >= docViewTop) && (elemTop <= docViewBottom));\\n\\t\\t\\t\\t return ((elemBottom >= docViewTop) && (elemTop <= docViewBottom)); \\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"202dd93e5dec2d483ca511ab31343846\",\n \"score\": \"0.59375584\",\n \"text\": \"function EZvisible(el, trueFalse)\\n{\\n\\treturn trueFalse === true || EZisTrue(trueFalse) ? EZshow(el) : EZhide(el, true, 'visibility');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"202dd93e5dec2d483ca511ab31343846\",\n \"score\": \"0.59375584\",\n \"text\": \"function EZvisible(el, trueFalse)\\n{\\n\\treturn trueFalse === true || EZisTrue(trueFalse) ? EZshow(el) : EZhide(el, true, 'visibility');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24449920589f9c0a7f85aa6e30ba5a58\",\n \"score\": \"0.59367234\",\n \"text\": \"function sectionActive() {\\n for (const section of allSections) {\\n const box = section.getBoundingClientRect();\\n if (box.top <= 170 && box.bottom >= 170) {\\n section.classList.add('active-class');\\n document.querySelector(`.${section.id}`).classList.add('active-link');\\n } else {\\n section.classList.remove('active-class');\\n document.querySelector(`.${section.id}`).classList.remove('active-link');\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad0a2f8fbe5b3c221eb23ca04557c720\",\n \"score\": \"0.59366125\",\n \"text\": \"_updateActive(/*evt, elem, scrollPos*/) {\\n if (this.mutexScrollLocked()) return;\\n\\n var winPos = /*scrollPos ||*/ parseInt(window.pageYOffset, 10),\\n curIdx;\\n\\n if(winPos + this.winHeight === this.docHeight){ curIdx = this.points.length - 1; }\\n else if (winPos < this.points[0]){ curIdx = -1; }\\n else{\\n var isDown = this.scrollPos < winPos,\\n _this = this,\\n curVisible = this.points.filter(function(p, i){\\n return isDown ? p <= winPos : p - _this.options.threshold <= winPos;//&& winPos >= _this.points[i -1] - _this.options.threshold;\\n });\\n curIdx = curVisible.length ? curVisible.length - 1 : 0;\\n }\\n\\n this.$active.removeClass(this.options.activeClass);\\n this.scrollPos = winPos;\\n\\n if (curIdx >= 0) {\\n this.$active = this.$targets.eq(curIdx).addClass(this.options.activeClass);\\n\\n if(this.options.deepLinking) {\\n this.options.updateUrl(this.$active);\\n }\\n }\\n else {\\n this.$active = $();\\n this.options.updateUrl(null);\\n }\\n\\n /**\\n * Fires when magellanhash is finished updating to the new active element.\\n * DIFFERENCE: no need in this\\n * @event MaggelanHash#update\\n */\\n //this.$element.trigger('update.zf.magellanhash', [this.$active]);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cefff897e21f670199c05bbb9265a8db\",\n \"score\": \"0.5934395\",\n \"text\": \"get active() {\\n return this.hasAttribute('active');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efb83e6ee7773bc7607048d7c95b4334\",\n \"score\": \"0.5917236\",\n \"text\": \"function is_active (a) {\\n\\t\\t\\tif (a.is_active == 0) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03b6f89b8ecd6487d393e63cb932aa97\",\n \"score\": \"0.59145916\",\n \"text\": \"get active() {\\n return this._isActive;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4842856066416946403e57ff571769a3\",\n \"score\": \"0.5913717\",\n \"text\": \"function active() {\\n return (M.mq(activeMediaQuery) && !menuActive) || floaterState(false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"defa3181e9e30038efc57f8a2f824d08\",\n \"score\": \"0.59070534\",\n \"text\": \"function inView(el) {\\n\\t\\t\\t\\tvar rect = el.getBoundingClientRect();\\n\\t\\t\\t\\treturn (\\n\\t\\t\\t\\t\\trect.top <= (window.innerHeight - 100 || document.documentElement.clientHeight)\\n\\t\\t\\t\\t);\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4296493d849535509461dcbba3b22588\",\n \"score\": \"0.59034276\",\n \"text\": \"isVisible() {\\n return this.toolbarSelector.hasClass(\\\"fadeIn\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97ae7a7afcbf592c3089c0a5abc3466c\",\n \"score\": \"0.5900354\",\n \"text\": \"function check_if_in_view() {\\n //get current window information\\n var window_height = web_window.height();\\n var window_top_position = web_window.scrollTop();\\n var window_bottom_position = (window_top_position + window_height);\\n\\n //iterate through elements to see if its in view\\n $.each(animation_elements, function() {\\n\\n //get the element sinformation\\n var element = $(this);\\n var element_height = $(element).outerHeight();\\n var element_top_position = $(element).offset().top;\\n var element_bottom_position = (element_top_position + element_height);\\n\\n //check to see if this current container is visible (its viewable if it exists between the viewable space of the viewport)\\n if ((element_bottom_position >= window_top_position) && (element_top_position <= window_bottom_position)) {\\n element.addClass('in-view');\\n } else {\\n element.removeClass('in-view');\\n }\\n });\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97ae7a7afcbf592c3089c0a5abc3466c\",\n \"score\": \"0.5900354\",\n \"text\": \"function check_if_in_view() {\\n //get current window information\\n var window_height = web_window.height();\\n var window_top_position = web_window.scrollTop();\\n var window_bottom_position = (window_top_position + window_height);\\n\\n //iterate through elements to see if its in view\\n $.each(animation_elements, function() {\\n\\n //get the element sinformation\\n var element = $(this);\\n var element_height = $(element).outerHeight();\\n var element_top_position = $(element).offset().top;\\n var element_bottom_position = (element_top_position + element_height);\\n\\n //check to see if this current container is visible (its viewable if it exists between the viewable space of the viewport)\\n if ((element_bottom_position >= window_top_position) && (element_top_position <= window_bottom_position)) {\\n element.addClass('in-view');\\n } else {\\n element.removeClass('in-view');\\n }\\n });\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f07683255fdef878c06634e410a2f24\",\n \"score\": \"0.58967084\",\n \"text\": \"isVisible() {\\n return this.toolbarSelector.is(\\\":visible\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"848a1215a197bcb62329b66841020f3f\",\n \"score\": \"0.5890996\",\n \"text\": \"isActive() {\\n return this.getHealth() > 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a88a9b9b0e1538052a10c403f9f82557\",\n \"score\": \"0.5889728\",\n \"text\": \"get visible() {\\n return super.visible;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a88a9b9b0e1538052a10c403f9f82557\",\n \"score\": \"0.5889728\",\n \"text\": \"get visible() {\\n return super.visible;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0becec6b6a01f8cb8a18525524b00fed\",\n \"score\": \"0.5868889\",\n \"text\": \"onScreen() {\\n if (0 <= this.x && this.x <= 900) {\\n this.displayed = true;\\n } else {\\n this.displayed = false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"992a3906342ce3c00a69023a2460e708\",\n \"score\": \"0.5868435\",\n \"text\": \"function isVisible(element) {\\n\\t\\tvar top = element.getBoundingClientRect().y,\\n\\t\\t\\theight = document.documentElement.clientHeight;\\n\\t\\treturn (window.scrollY + height) > top;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2e59eb7838fd0a87800b57b6b6ca76f\",\n \"score\": \"0.5868021\",\n \"text\": \"activate () {\\n this._isActive = true\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d8c898afb997ef1068173db1d2fd5be\",\n \"score\": \"0.58657706\",\n \"text\": \"function showActiveSection() {\\n const sections = document.querySelectorAll(\\\"section[data-nav]\\\");\\n\\n sections.forEach(section => {\\n navItems.forEach(item => {\\n if (item.hash === ('#' + section.id)) {\\n if (isInViewport(section)) {\\n item.classList.add(\\\"active\\\");\\n } else {\\n item.classList.remove(\\\"active\\\");\\n }\\n }\\n });\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96fb63932dcb39768a91cabc145b77fa\",\n \"score\": \"0.58652383\",\n \"text\": \"function check_if_in_view() {\\r\\n //get current window information\\r\\n var window_height = web_window.height();\\r\\n var window_top_position = web_window.scrollTop();\\r\\n var window_bottom_position = (window_top_position + window_height);\\r\\n\\r\\n //iterate through elements to see if its in view\\r\\n $.each(animation_elements, function() {\\r\\n\\r\\n //get the elements information\\r\\n var element = $(this);\\r\\n var element_height = $(element).outerHeight();\\r\\n var element_top_position = $(element).offset().top;\\r\\n var element_bottom_position = (element_top_position + element_height);\\r\\n\\r\\n //check to see if this current container is visible (its viewable if it exists between the viewable space of the viewport)\\r\\n if ((element_bottom_position >= window_top_position) && (element_top_position <= window_bottom_position)) {\\r\\n element.addClass('in-view');\\r\\n } else {\\r\\n element.removeClass('in-view');\\r\\n }\\r\\n });\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0b259da37862d584bdd86b7cc35325e\",\n \"score\": \"0.5852267\",\n \"text\": \"get active() {\\n\\t\\treturn this.getAttribute('active');\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79df21332578b4eac663f19dca5d9872\",\n \"score\": \"0.5852252\",\n \"text\": \"checkVisible() {\\n\\t\\tif (this.parentNode) {\\n\\t\\t\\tlet numCards = document.body.clientWidth > MOBILE_RESOLUTION ? 3 : 1;\\n\\t\\t\\tthis.isVisible = Array.from(this.parentNode.children).indexOf(this) < numCards;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"273f6df97c9e73bca98967b7e19c1492\",\n \"score\": \"0.58458555\",\n \"text\": \"function classActive(element) {\\r\\n\\t\\tif($(element).hasClass('active')) {\\r\\n\\t\\t\\t$(element).removeClass('active');\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\t$('.btn-paint').removeClass('active'); \\r\\n\\t\\t\\t$(element).addClass('active');\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t$('#pipette').hasClass('active') == true ? \\r\\n\\t\\t$('#pipette-setup').css('display', 'block') : \\r\\n\\t\\t$('#pipette-setup').css('display', 'none');\\r\\n\\r\\n\\t\\t$('#text').hasClass('active') == true ? \\r\\n\\t\\t$('#text-setup').css('display', 'block') : \\r\\n\\t\\t$('#text-setup').css('display', 'none');\\r\\n\\r\\n\\t\\t$('#degrade').hasClass('active') == true ? \\r\\n\\t\\t$('#degrade-setup').css('display', 'block') : \\r\\n\\t\\t$('#degrade-setup').css('display', 'none');\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19b8f8f638bf7f650ce6d607e6e60a8e\",\n \"score\": \"0.5838367\",\n \"text\": \"isActive() {\\n return this.enabled;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a062d24380b6ffbf758798ffce713073\",\n \"score\": \"0.5835376\",\n \"text\": \"function checkView () {\\n let isInViewport = function (elem) {\\n let bounding = elem.getBoundingClientRect();\\n return (\\n bounding.top >= 0 &&\\n bounding.left >= 0 &&\\n bounding.bottom <= (window.innerHeight || document.documentElement.clientHeight) &&\\n bounding.right <= (window.innerWidth || document.documentElement.clientWidth)\\n );\\n };\\n\\n const features = document.querySelector('content-features');\\n window.addEventListener('scroll', function (event) {\\n if (isInViewport(features)) {\\n let featView = document.querySelector('Features');\\n featView.classList.add(\\\"active\\\");\\n }\\n }, false);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91ad6be91fb1ac64fcd06c1092fe69bc\",\n \"score\": \"0.5826505\",\n \"text\": \"visible() {\\n return this.actor_attribute_key == AttributeKey.classes;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ad0309b93594a83dd4e32e35157b5de\",\n \"score\": \"0.58253556\",\n \"text\": \"function elementInViewport(el) {\\n\\t\\t\\t\\t var top = el.offsetTop,\\n\\t\\t\\t\\t left = el.offsetLeft,\\n\\t\\t\\t\\t width = el.offsetWidth,\\n\\t\\t\\t\\t height = el.offsetHeight;\\n\\n\\t\\t\\t\\t while(el.offsetParent) {\\n\\t\\t\\t\\t el = el.offsetParent;\\n\\t\\t\\t\\t top += el.offsetTop;\\n\\t\\t\\t\\t left += el.offsetLeft;\\n\\t\\t\\t\\t }\\n\\n\\t\\t\\t\\t return (\\n\\t\\t\\t\\t top < (window.pageYOffset + window.innerHeight) + 56 &&\\n\\t\\t\\t\\t left < (window.pageXOffset + window.innerWidth) + 56 &&\\n\\t\\t\\t\\t (top + height) > window.pageYOffset + 56 &&\\n\\t\\t\\t\\t (left + width) > window.pageXOffset + 56\\n\\t\\t\\t\\t );\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91b191a4df8ddbf4c2649c3991d76687\",\n \"score\": \"0.5825278\",\n \"text\": \"function isElementInView(el, n) {\\n const rect = el.getBoundingClientRect();\\n const elemTop = rect.top\\n const elemBottom = rect.bottom\\n const isVisible = (elemTop >= 0) && ((elemBottom/n) <= ((window.innerHeight) || (document.documentElement.clientHeight)));\\n return isVisible\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9e80d7b932c8be506a5033bfffaf587\",\n \"score\": \"0.5821083\",\n \"text\": \"function activeSection(){\\n for(section of allSections){ \\n\\t// check if the section in the viewport of the screen\\n\\t if(sectionPosition(section)){\\n\\t// check if the section has the active class or not\\n\\t if(section.classList.contains(\\\"your-active-class\\\")){\\n\\t \\tsection.classList.remove(\\\"your-active-class\\\"); }\\n\\t else{\\n\\t section.classList.add(\\\"your-active-class\\\");}\\n\\t }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18983c94060fa872191dc736a35a9b32\",\n \"score\": \"0.5819175\",\n \"text\": \"activeClass() {\\n const curSlide = this.config.loop ? this.curSlide + this.visibleSlides : this.curSlide;\\n const classCount = this.visibleSlides;\\n const availableItems = this.selector.querySelectorAll(this.config.itemSelector);\\n const itemSelector = this.config.itemSelector.replace('.', '');\\n const activeClass = itemSelector + '-active';\\n\\n if (availableItems) {\\n for (let i = 0; i < availableItems.length; i += 1) {\\n availableItems[i].classList.remove(activeClass);\\n }\\n\\n for (let j = 0; j < classCount; j += 1) {\\n availableItems[curSlide + j].classList.add(activeClass);\\n }\\n\\n // centered mode\\n if (this.config.centerMode) {\\n this.centerMode(itemSelector);\\n }\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1825671ec828ba3284fd36debaf6722b\",\n \"score\": \"0.58177483\",\n \"text\": \"function visible(element){var visibility=element.css(\\\"visibility\\\");while(visibility===\\\"inherit\\\"){element=element.parent();visibility=element.css(\\\"visibility\\\");}return visibility!==\\\"hidden\\\";}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ad7951bc64c27c040b8f21c93398a89\",\n \"score\": \"0.5817723\",\n \"text\": \"getVisibilityState() {\\n return this.ampdoc.getVisibilityState();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2663b5bb9efa2783a79fdfa89384d6f7\",\n \"score\": \"0.58143425\",\n \"text\": \"function check_if_in_view(){\\n var window_height = $window.height();\\n var window_top_position = $window.scrollTop();\\n var window_bottom_position = (window_top_position + window_height);\\n\\n $.each($index_article_img, function(){\\n var $element = $(this);\\n var element_height = $element.outerHeight();\\n var element_top_position = $element.offset().top;\\n var element_bottom_position = (element_top_position + element_height);\\n\\n if ((element_bottom_position >= window_top_position) && (element_top_position <= window_bottom_position)){\\n $element.addClass('in-view');\\n } else {\\n $element.removeClass('in-view');\\n }\\n });\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":86,"cells":{"query_id":{"kind":"string","value":"3f60cf2e59a963e38b7ed84a35f35a3d"},"query":{"kind":"string","value":"Get Game List using Steam API"},"positive_passages":{"kind":"list like","value":[{"docid":"1971d5c6f15cf983e64d80a56f529f48","score":"0.64932305","text":"getGames(steamid){\n\t//set steamID to user's entered id\n\tthis.steamID = steamid;\n\tlet sortedObj;\n\tlet playerName;\n\t//run get request via http library, and return sorted object\n\treturn http.get(`https://cors-anywhere.herokuapp.com/http://api.steampowered.com/IPlayerService/GetOwnedGames/v0001/?key=${this.APIkey}&include_appinfo=1&include_played_free_games=1&steamid=${this.steamID}&format=json`)\n\t\t.then(results => {\n\t\t\t//check for error in results\n\t\t\tif(results.response.game_count){\n\t\t\t\t//sort games via function\n\t\t\t\tsortedObj = this.sortGames(results.response);\n\t\t\t\t//return the sorted games object\n\t\t\t\treturn sortedObj;\n\t\t\t} else{\n\t\t\t\treturn 'error';\n\t\t\t}\n\t\t\t\t})\n\t\t.catch(err => console.log(err));\t\n\t\t\n\t}","title":""}],"string":"[\n {\n \"docid\": \"1971d5c6f15cf983e64d80a56f529f48\",\n \"score\": \"0.64932305\",\n \"text\": \"getGames(steamid){\\n\\t//set steamID to user's entered id\\n\\tthis.steamID = steamid;\\n\\tlet sortedObj;\\n\\tlet playerName;\\n\\t//run get request via http library, and return sorted object\\n\\treturn http.get(`https://cors-anywhere.herokuapp.com/http://api.steampowered.com/IPlayerService/GetOwnedGames/v0001/?key=${this.APIkey}&include_appinfo=1&include_played_free_games=1&steamid=${this.steamID}&format=json`)\\n\\t\\t.then(results => {\\n\\t\\t\\t//check for error in results\\n\\t\\t\\tif(results.response.game_count){\\n\\t\\t\\t\\t//sort games via function\\n\\t\\t\\t\\tsortedObj = this.sortGames(results.response);\\n\\t\\t\\t\\t//return the sorted games object\\n\\t\\t\\t\\treturn sortedObj;\\n\\t\\t\\t} else{\\n\\t\\t\\t\\treturn 'error';\\n\\t\\t\\t}\\n\\t\\t\\t\\t})\\n\\t\\t.catch(err => console.log(err));\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"4dcc33453988784deb2c1831a624db70","score":"0.7437258","text":"function fetchGameList(){\n\tfetch(\"https://rawg-video-games-database.p.rapidapi.com/games?page=1\", {\n\t\"method\": \"GET\",\n\t\"headers\": {\n\t\t\"x-rapidapi-host\": \"rawg-video-games-database.p.rapidapi.com\",\n\t\t\"x-rapidapi-key\": \"ba56e18dfbmsha0533de8919d27bp10d3dcjsn5229ce979bb3\"\n\t}\n\t})\n\t.then((resp) => resp.json())\n\t.then(function (response) {\n\t\t\tvar jsonGameList = response;\n\t\t\t//Envia el ID de cada uno de los juegos en la primera página\n\t\t\tfor(var i = 0; i < 19; i++){\n\t\t\t\tfetchGameInfo(jsonGameList.results[i].id);\n\t\t\t}\n\t})\n\t.catch(function (err) {\n\t\t\tconsole.log(\"No se puedo obtener el recurso\", err);\n\t});\n}","title":""},{"docid":"41d762be1471ec420765517ebdd2fd9d","score":"0.71969146","text":"async listGames(init) {\r\n return this.request('/games', init);\r\n }","title":""},{"docid":"0e6cf68431c24b1ee832f26985632670","score":"0.6822302","text":"async function getGameData() {\n var res = await fetch(\"/games/search?limit=-1\")\n var resp = await res.json();\n return resp\n}","title":""},{"docid":"1066df36c0a14daa4705407b2a563ef5","score":"0.68061924","text":"async getGameInfos() {\n\t\tawait this.login(LOGIN_ACCOUNT_GAUTIER)\n\t\tconst game = await this.sendRequest({ rsn:'2ynbmhanlb',guide:{ login:{ language:1,platform:'gaotukc',ug:'' } } }, '699002934')\n\n\t\treturn game.a\n\t}","title":""},{"docid":"c52b1b7e052c80341cc8b0338a9364d5","score":"0.67902493","text":"list(req, res) {\n Game.findAll()\n .then((games) => {\n res.status(200).json(games);\n })\n .catch((error) => {\n res.status(500).json(error);\n });\n }","title":""},{"docid":"ca87a146dc41ceb01c192fa99a3d7d28","score":"0.6733176","text":"function getGames(cmd, str, callbackObj) {\n let gamesJSON = [];\n\n let requestURL = \"http://api.steampowered.com/ISteamApps/GetAppList/v0002\";\n\n let r = request(requestURL, function (err, res, body) {\n search(cmd, str, JSON.parse(body).applist.apps, callbackObj);\n });\n}","title":""},{"docid":"1bdd524af421dcc6bc5fdcee86cbb598","score":"0.67256856","text":"function getAllGames()\n {\n ajaxHelper(gamesUri, 'GET').done(function (data)\n {\n self.games(data);\n });\n }","title":""},{"docid":"e62f5abf9f30bd76b4e9b09047ae5e93","score":"0.67047113","text":"getGames(){\n let games = fetch(API_URL +'/api/games',\n {method: 'GET'}).then((response) => response.json())\n return games;\n }","title":""},{"docid":"20b1acd602d869936792e0046bdd0f87","score":"0.6700918","text":"async myGames (data = {}) {\n return await this.request('get', '/my-games', data, {games: ensureArray})\n }","title":""},{"docid":"848162a2a6a38c4c8f6462f2917ec741","score":"0.6609713","text":"async function games() {\n const allGamesResponse = await axios.get(`https://api.steampowered.com/ISteamApps/GetAppList/v2/`);\n // console.log(allGames);\n // console.log(allGames.data.applist.apps);// indiviudal item will be an element inside the array apps; the entire array of apps exist would be data.applist.apps\n const allGames = allGamesResponse.data.applist.apps\n return allGames;\n}","title":""},{"docid":"18a31b4415c7e43c19da6e05cc3d7e04","score":"0.66035795","text":"retrieveAllGames() {\n return freendiesApi.retrieveAllGames()\n }","title":""},{"docid":"747a67a778d93e31c82cd1d1badc30e9","score":"0.6552598","text":"getLiveLeagueGames() {\n const query_params = {\n key: this.apiKey\n }\n return fetch(BASE_URL + DOTA_MATCHES + 'GetLiveLeagueGames/v1/?' + handleQueryParams(query_params))\n .then(response => responseHandler(response))\n .catch(e => e)\n }","title":""},{"docid":"70319906e6f2c58a2515bc105323debd","score":"0.65334445","text":"async function getAllGameIds(url = defaultUrl) {\n const response = await fetch(`/api/game`, {\n method: \"GET\",\n headers: {\n 'Content-Type': 'application/json'\n }\n });\n return await response.json();\n}","title":""},{"docid":"2fbd5e7e4306ad1c0a5bc6dc8fdaa946","score":"0.6528095","text":"function getOwnedGames(force_update = false){\n\tif (settings.steam_id.length != 17){\n\t\tmyApp.alert('Invalid Steam ID 64 supplied,<br/>Must be 17 characters long..');\n\t\treturn;\n\t}\n\t//check if we have a steamID & check if it has been 24 hours since last update\n\tif (!!force_update || +local_settings.owned_apps_next_update < +new Date().getTime() ){\n\t\t$.ajax({\n\t\t\tcache: false,\n\t\t\tdataType: 'json',\n\t\t\turl: 'https://store.steampowered.com/dynamicstore/userdata/',\n\t\t\tsuccess: (res) => {\n\t\t\t\tconst rgOwnedApps = res.rgOwnedApps || [];\n\t\t\t\tconst rgOwnedPackages = res.rgOwnedPackages || [];\n\t\t\t\tconst ownedApps = [...new Set([...rgOwnedPackages, ...rgOwnedApps])];\n\t\t\t\tif (ownedApps.length <= 0){\n\t\t\t\t\tmyApp.alert('No owned games found,<br/>Try signing into steam first.<br/><br/>Attempting fallback server, Less owned games will be retrieved though.');\n\t\t\t\t\tgetOwnedGamesFallback(force_update);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t// Set owned apps\n\t\t\t\tlocal_settings.owned_apps = ownedApps;\n\t\t\t\t// Set current time + 24 hours as next updated time\n\t\t\t\tlocal_settings.owned_apps_next_update = +new Date().getTime() + (24 * 60 * 60 * 1000);\n\t\t\t\tsave_options('local');\n\t\t\t\tmyApp.alert(`Owned Games List Updated!<br/>Games Found: ${ownedApps.length}`);\n\t\t\t},\n\t\t\terror: (err) => {\n\t\t\t\tmyApp.alert('Are you signed into steam?<br/>Attempting fallback server, Less owned games will be retrieved though.');\n\t\t\t\tgetOwnedGamesFallback(force_update);\n\t\t\t}\n\t\t});\n\t}\n}","title":""},{"docid":"6ddab0ad9e6bb478c1fe34a5ee9f0d9c","score":"0.64364207","text":"async getAllUserGames ({ auth, response }) {\n const allUserGames = await Game.query()\n .where('user_id', auth.current.user.id)\n return response.json({\n status: 'success',\n data: allUserGames\n })\n }","title":""},{"docid":"90a4f1864a967a002ee2a3b387de08b9","score":"0.6419179","text":"getGames() {\n return axios.get(Constants.GAMES_ENDPOINT)\n .then((result) => {\n return result.data;\n })\n }","title":""},{"docid":"e570265c28785bba58dd8937aaf1a773","score":"0.6360097","text":"getAllGames(){\t\n\t\tlet games = [];\n\t\tfor(let i = 0;i<this.games.length();i++){\n\t\t\tgames.push(this.games.at(i).getLobbyVersion());\n\t\t}\n\t\treturn games;\n\t}","title":""},{"docid":"0a751b42979d1293e9bbc0301f86e4ec","score":"0.6340395","text":"function getGames(player) {\n playerId = player || \"\";\n if (playerId) {\n playerId = \"/?player_id=\" + playerId;\n }\n $.get(\"/api/games\" + playerId, function(data) {\n console.log(\"Games\", data);\n games = data;\n if (!games || !games.length) {\n displayEmpty(player);\n }\n else {\n initializeRows();\n }\n });\n }","title":""},{"docid":"bfcc58c3039bf373064ebe249707848b","score":"0.6327575","text":"async function loadGames() {\n const allGameInfoResponse = await fetch(url + '/readAllGames', {\n method: \"GET\",\n headers: {\n \"Content-type\": \"application/json; charset=UTF-8\"\n }\n });\n if (allGameInfoResponse.ok) {\n const games = await allGameInfoResponse.json();\n window.games = games;\n console.log(games);\n }\n else {\n console.log(allGameInfoResponse);\n }\n}","title":""},{"docid":"140c319a5c6736fdd31a65f616f2602a","score":"0.6281858","text":"function getTeamList() {\n if (\"caches\" in window) {\n caches.match(ENDPOINT_EPL + \"teams\").then(function (response) {\n if (response) {\n response.json().then(function (data) {\n showTeamList(data);\n })\n }\n })\n }\n\n fetchAPI(ENDPOINT_EPL + \"teams\")\n .then(data => {\n showTeamList(data);\n })\n .catch(error);\n}","title":""},{"docid":"b3e8dbf07437e6e260772d792f7782eb","score":"0.62816083","text":"function getLiChessGames(username){\n var url = \"https://us-central1-lazhack7-3b615.cloudfunctions.net/games?username=\" + username;\n return $http.get(url)\n .then(function(result){\n var gameStrings = result.data.replace(/(\\r\\n|\\n|\\r)/gm,\"\\n\").split(\"\\n\");\n var games = [];\n gameStrings.forEach(function(str) {\n try {\n games.push(JSON.parse(str));\n } catch(e){\n\n }\n });\n return games;\n });\n }","title":""},{"docid":"21f713b348d4baf7cc87d59c20484ceb","score":"0.6223511","text":"async getGame() {\n return (await this._client.helix.games.getGameById(this._data.game_id));\n }","title":""},{"docid":"4f2bd050522117b1bbd91fdf94670809","score":"0.6222597","text":"async function getUserGameplays(user, type) {\n return fetch(URL + '/players/' + user.id + '/games?gameType=' + type, {\n method: 'GET',\n mode: 'cors',\n headers: {\n 'Authorization': 'Bearer ' + user.token\n }\n }).then(res => res.json());\n}","title":""},{"docid":"9a5aaa8c075c1a5ab08955654a053133","score":"0.62211716","text":"static fetchAllGames(url) {\n fetch(url)\n .then(res => res.json())\n .then(gamesObjects => {\n\n // Show the \"Create New Game\" form on the page\n Game.showCreateGameForm();\n\n gamesObjects.forEach(gameObject => {\n \n \n\n // Create a new Game object on the front-end\n const game = new Game(gameObject.id, gameObject.name, gameObject.status, gameObject.phase)\n gameObject.players.forEach(playerObject => {\n const player = new Player(playerObject.id, playerObject.name);\n game.players.push(player);\n }) \n \n // Renders a specific game on the page\n game.renderGameListCard();\n\n })\n\n // Open websocket connection with new games\n Game.createGamesWebsocketConnection();\n\n })\n }","title":""},{"docid":"fb9b05e051d9e4f291f219d8492e585c","score":"0.62157345","text":"async function getSteam (req, res, next) {\n const steamId = req.user.steam;\n const params = { l: 'english', steamid: steamId, key: process.env.STEAM_KEY };\n const getAsync = promisify(request.get);\n \n // get the list of the recently played games, pick the most recent one and get its achievements\n const getPlayerAchievements = () =>\n getAsync({ url: 'http://api.steampowered.com/IPlayerService/GetRecentlyPlayedGames/v0001/', qs: params, json: true })\n .then(({ request, body }) => {\n if (request.statusCode === 401) {\n throw new Error('Invalid Steam API Key');\n }\n if (body.response.total_count > 0) {\n params.appid = body.response.games[0].appid;\n return getAsync({ url: 'http://api.steampowered.com/ISteamUserStats/GetPlayerAchievements/v0001/', qs: params, json: true })\n .then(({ request, body }) => {\n if (request.statusCode === 401) {\n throw new Error('Invalid Steam API Key');\n }\n return body;\n });\n }\n });\n const getPlayerSummaries = () => {\n params.steamids = steamId;\n return getAsync({ url: 'http://api.steampowered.com/ISteamUser/GetPlayerSummaries/v0002/', qs: params, json: true })\n .then(({ request, body }) => {\n if (request.statusCode === 401) {\n throw Error('Missing or Invalid Steam API Key');\n }\n return body;\n });\n };\n const getOwnedGames = () => {\n params.include_appinfo = 1;\n params.include_played_free_games = 1;\n return getAsync({ url: 'http://api.steampowered.com/IPlayerService/GetOwnedGames/v0001/', qs: params, json: true })\n .then(({ request, body }) => {\n if (request.statusCode === 401) {\n throw new Error('Missing or Invalid Steam API Key');\n }\n return body;\n });\n };\n try {\n const { playerstats } = await getPlayerAchievements();\n const playerSummaries = await getPlayerSummaries();\n const ownedGames = await getOwnedGames();\n res.render('original/example/steam', {\n title: 'Steam Web API',\n ownedGames: ownedGames.response,\n playerAchievemments: playerstats.success ? playerstats : null,\n playerSummary: playerSummaries.response.players[0]\n });\n } catch (err) {\n next(err);\n }\n}","title":""},{"docid":"15900c1c4ad81d3afa57650f121919e0","score":"0.62093765","text":"async getGame() {\n return this.__request(`${this.api_url}/game/start`, \"POST\");\n }","title":""},{"docid":"2762153d5fbaa4ba9f2a4dc1880e5fe0","score":"0.61890465","text":"function getGameInfo() {\n limiter.request({\n url: `https://global.api.pvp.net/api/lol/static-data/euw/v1.2/champion?champData=all&${api}`,\n method: 'GET',\n json: true,\n }, (error, response) => {\n if (!error && response.statusCode === 200) {\n champions = response.body.data;\n version = response.body.version;\n console.log(champions);\n }\n if (error) {\n throw new Error('Cannot connect to Riot API');\n }\n });\n}","title":""},{"docid":"07a7b007ff777bc1a15fd09c98e2299d","score":"0.61703235","text":"function getLiveGames(){\n\n fetch('https://api.opendota.com/api/live')\n .then(convertToJSON) \n .then(getMatchInfo)\n .then(filterTeams)\n .then(writeMatchInfo)\n\n}","title":""},{"docid":"793e8dcbd9772803002844bd966b9ed5","score":"0.616957","text":"searchGames(game, callback){\n\n console.log(\"Searching for: \", game)\n\n fetch('https://api.twitch.tv/kraken/search/games?query=' + game, {\n method: 'GET',\n headers: {\n 'Accept': 'application/vnd.twitchtv.v5+json',\n 'Client-ID': Twitch.clientID\n }\n }).then(response => response.json()).then(json => {\n console.log(json.games);\n callback(json.games)\n })\n }","title":""},{"docid":"eba22228867c8229f5eb9e5d41e7f953","score":"0.61151683","text":"function getGames (champion, player) {\n request('https://' + oneTricks[champion][player][\"region\"] + '.api.pvp.net/api/lol/' + oneTricks[champion][player][\"region\"] + '/v2.2/matchlist/by-summoner/' + oneTricks[champion][player][\"id\"] + '?championIds=' + champion + '&seasons=SEASON2016&api_key=' + RIOT_KEY, function (err, res, data) {\n if (data !== undefined && JSON.parse(data).status === undefined) {\n data = JSON.parse(data);\n if (data.matches === undefined || data.matches.length < 10) {\n delete oneTricks[champion][player];\n } else {\n data = data[\"matches\"].slice(0,10);\n console.log(data);\n for (var j=0; j < data.length; j++) {\n oneTricks[champion][player][\"matchDetails\"][j][\"matchId\"] = data[j];\n }\n }\n } else {\n getGames(champion, player);\n }\n });\n}","title":""},{"docid":"5591b27117834ce3e2b49234161c98e7","score":"0.60765016","text":"function getGames(query) {\n const params = {\n id: query,\n };\n const queryString = formatQueryParams(params);\n const url = searchUrl + \"?\" + queryString;\n //fetches api from events url\n fetch(url)\n .then((response) => {\n if (response.ok) {\n return response.json();\n }\n throw new Error(response.statusText);\n })\n .then((responseJson) => displayEventResults(responseJson))\n .catch((err) => {\n $(\"#js-error-message\").text(`Something went wrong:${err.message}`);\n });\n}","title":""},{"docid":"0dcb5d7b21f077ae8166c0b70bda6617","score":"0.59533584","text":"getGamesByTeam(team) {\n TTTPost(\"/games-by-team\", {\n team_id: team.team_id\n })\n .then(res => {\n this.setState({team: team, games: res.data.games});\n });\n }","title":""},{"docid":"89570917721c45cf3740924d67f865c1","score":"0.5934758","text":"function getLevelList(gameName) {\n\t$.ajax({\n\t\ttype: \"POST\",\n\t\turl: '../../../../../backend/getLevelList.php',\n\t\tdata: {game_name: gameName},\n\t\tsuccess: function(data){\n\t\t\t//since AJAX is async, its up to the current game to implement loadLevel and handle async on its own\n\t\t\tdisplayLevelList(data);\n\t\t}\n\t});\n}","title":""},{"docid":"d03a3817bfbf77c05683598f34896451","score":"0.5903512","text":"function fetchGames(callback){\n var url = 'http://wap.mlb.com/gdcross/components/game/mlb/year_'+year+'/month_'+month+'/day_'+day+'/miniscoreboard.json';\n console.log('fetching url: ' + url);\n http.get(url, function(res){\n var body = '';\n res.on('data', function(chunk) {\n body += chunk;\n });\n res.on('end', function() {\n var mlbResponse = JSON.parse(body)\n callback(mlbResponse.data.games.game);\n });\n });\n}","title":""},{"docid":"8614bdfeac3d20a5d7f8844b90cf9e36","score":"0.5897309","text":"getCurrentGames() {\n\n // TODO: AXIOS Requeset to get information about active games for this user\n\n let activeGamesList = [];\n\n let numGames = 0;\n\n // Axios request\n // Iterating on games\n\n if (numGames === 0) {\n // No past games :(\n activeGamesList.push(\n <div className = \"noPast\">You are currently not part of any games</div>\n );\n }\n\n return activeGamesList;\n }","title":""},{"docid":"28c825dcc638df2dfb7ea5bd41e2cde2","score":"0.5895521","text":"async function displayAllGames(){\n //getting games from server\n const gamesFromServer = await fetchApi.getGamesList();\n \n //turning the array of games from server in an array of game objects\n const gamesList = gamesFromServer.map(gameServer => new Game(gameServer._id,\n gameServer.title,\n gameServer.imageUrl,\n gameServer.description\n )\n )\n \n //creating an array of DOM objects\n const domGamesArr = gamesList.map(game => game.displayGame());\n //creating the container and appending each game (DOM object) to it\n const container = document.querySelector('.container');\n domGamesArr.forEach((domGame => container.appendChild(domGame)));\n}","title":""},{"docid":"6e6b8b7fd4814c68f694594f7f8f50f7","score":"0.5891269","text":"loadMujeresForGame () {\n return http.get(\"auth/data/gameMujeres\", User.getToken());\n }","title":""},{"docid":"d2a6cd31ba2bf64551e8299ea77f1e03","score":"0.58833456","text":"function ListUsers(ws) {\n var returnMessage = {}\n returnMessage[\"type\"] = \"user-list\";\n returnMessage[\"data\"] = [];\n \n switch (ws.gamemode) {\n case \"server\":\n wss.clients.forEach(function each(client) {\n var user = {}\n user[\"user-id\"] = client.userId;\n user[\"user-name\"] = client.userName;\n user[\"lobby-id\"] = client.lobbyId;\n user[\"gamemode\"] = client.gamemode;\n returnMessage.data.push(user);\n });\n break;\n case \"player\" || \"spectator\":\n if (ws.lobbyId === -1) {\n SendUserError(ws, \"list-users\", \"not in a lobby\")\n return;\n }\n for (var i=0; i<lobbies[lobbyId][\"users\"].length; i++) {\n var user = {}\n user[\"user-id\"] = lobbies[lobbyId][\"users\"][i].userId;\n user[\"user-name\"] = lobbies[lobbyId][\"users\"][i].userName;\n user[\"lobby-id\"] = lobbies[lobbyId][\"users\"][i].lobbyId;\n user[\"gamemode\"] = lobbies[lobbyId][\"users\"][i].gamemode;\n returnMessage.data.push(user);\n }\n break;\n }\n ws.send(JSON.stringify(returnMessage));\n}","title":""},{"docid":"f8c4811069e32cc506d0a145737e6b50","score":"0.5876842","text":"function STEAMSTAT() {\n // Steam (Not currently in use)\n var qryURL = {\n //\"url\": \"https://cors-anywhere.herokuapp.com/steamspy.com/api.php?request=appdetails&appid=620\",\n \"url\" : \"https://cors-any-m.herokuapp.com/api.steampowered.com/ISteamUserStats/GetGlobalStatsForGame/v0001/?format=xml&appid=17740&count=1&name[0]=global.map.emp_isle\",\n \"async\": true,\n \"crossDomain\": true,\n \"method\": \"GET\"\n }\n\n $.ajax(qryURL).done(function (steamInfo) {\n console.log(steamInfo)\n });\n}","title":""},{"docid":"7d1af891e278c9e53bd1f7dd35e21294","score":"0.5861581","text":"async getGamesWithApplication ({ request, auth, response }) {\n const user = auth.current.user\n try {\n const applics = await Application.all()\n return response.json({\n status: 'success',\n data: applics\n })\n } catch (error) {\n return response.status(400).json({\n status: 'error',\n message: 'Tivemos um problema. Por favor tente novamente.'\n })\n }\n }","title":""},{"docid":"510b7266ec8957ce9ed6029a4e41c5f2","score":"0.5860687","text":"function getAndDisplayBoardGames() {\n $.getJSON(GAMES_URL, function(result) {\n \tlet element = result.boardGames;\n let boardGameElements = $(element).map(function(i) {\n return makeBoardGame(\n element[i].id, \n element[i].name, \n element[i].type, \n element[i].players, \n element[i].plays, \n element[i].averageScore,\n element[i].winsAndLosses\n );\n }).get();\n\t\t$('.game-box').html(boardGameElements); \n\t\t$('.js-bgame').velocity(\"transition.swoopIn\", { duration: 600, stagger: 100 })\n }); \n}","title":""},{"docid":"ef9c65b3f5216b662638cc1c2ace0b57","score":"0.5854332","text":"function activeGames(jwt) {\n const activeGamesURL = BASE_URL + '/game/active_games'\n return httpRequestJWT(activeGamesURL, 'get', jwt)\n}","title":""},{"docid":"0bb63f5bb1496ea3399498cd2ead8217","score":"0.5834768","text":"function gamesGET (req, res, next) {\n\n\tvar page = 'games';\n\tvar title = 'Games';\n\n\tif (req.session.user)\n\t\tUser\n\t\t.findOne({\n\t\t\temail : req.session.user.email\n\t\t})\n\t\t.exec(function (err, user) {\n\t\t\tif (err)\n\t\t\t\tres.send(err);\n\t\t\telse\n\t\t\t\tGame\n\t\t\t\t.find({ \n\t\t\t\t\tid : {\n\t\t\t\t\t\t$nin : [\"congkak\"]\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t\t.exec(function (err, games) {\n\t\t\t\t\tif (err)\n\t\t\t\t\t\tres.send(err);\n\t\t\t\t\telse\n\t\t\t\t\t\tres.render(page, {\n\t\t\t\t\t\t\tuser : user,\n\t\t\t\t\t\t\ttitle : title,\n\t\t\t\t\t\t\tisGamesPage : true,\n\t\t\t\t\t\t\tgames : games,\n\t\t\t\t\t\t\tpartials : {\n\t\t\t\t\t\t\t\theader : 'header',\n\t\t\t\t\t\t\t\tfooter : 'footer'\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\t\t\t\t});\n\t\t});\n\telse\n\t\tGame\n\t\t.find({})\n\t\t.exec(function (err, games) {\n\t\t\tif (err)\n\t\t\t\tres.send(err);\n\t\t\telse\n\t\t\t\tres.render(page, {\n\t\t\t\t\ttitle : title,\n\t\t\t\t\tisGamesPage : true,\n\t\t\t\t\tgames : games,\n\t\t\t\t\tpartials : {\n\t\t\t\t\t\theader : 'header',\n\t\t\t\t\t\tfooter : 'footer'\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t});\n}","title":""},{"docid":"12d5e1ce5783f1ba39791736ae0a119b","score":"0.5834505","text":"function getMatchList() {\n if (\"caches\" in window) {\n caches.match(ENDPOINT_EPL + \"matches\").then(function (response) {\n if (response) {\n response.json().then(function (data) {\n showMatchList(data);\n })\n }\n })\n }\n\n fetchAPI(ENDPOINT_EPL + \"matches\")\n .then(data => {\n showMatchList(data);\n })\n .catch(error)\n}","title":""},{"docid":"47d4822113fda510e9df7a3149860697","score":"0.5833585","text":"async function getGamesFromUser(username)\n{\n // Get the user\n var user = await get(username);\n\n // Return the games\n return gamesdb.idsToGames(user.games);\n}","title":""},{"docid":"97898c0caa621b34afa6a6f6b401a562","score":"0.58261156","text":"async function getGames(season) {\n try {\n const response = await fetch(`https://hasses-sega-gubbar.herokuapp.com/games/${season}`, {});\n const data = await response.json();\n setSeasonGames(data)\n } catch {\n console.log(\"Error\");\n }\n }","title":""},{"docid":"feb22e93e79331bf7bd810a4c7cde6f6","score":"0.58139956","text":"function getAvailableGames() {\n ticTacToeData\n .getAvailableGames(auth.access_token())\n .then(function (data) {\n $scope.availableGames = data;\n $scope.allMyGames = $scope.allMyGames.concat(data);\n });\n }","title":""},{"docid":"38488de78217a2f81c97e453763f7908","score":"0.5806788","text":"async function getAllTeams(){\n return await season_utils.getTeamsBySeasonId(18334);\n}","title":""},{"docid":"5c076096f8113896c91172badb90a4c9","score":"0.58048105","text":"function getListOfGames() {\r\n var dropdowns = document.getElementsByClassName(\"dropdown-content\");\r\n multiplayer.server.list().done(function (result) {\r\n if (result) {\r\n var list = document.getElementById(\"listDrpdwn\");\r\n for (var i = 0; i < result.length; i++) {\r\n if (!isContains(list, result[i])) {\r\n var op = document.createElement('option');\r\n op.value = result[i];\r\n op.text = result[i];\r\n list.appendChild(op);\r\n }\r\n }\r\n }\r\n });\r\n}","title":""},{"docid":"4210e5dd2126c35fd6ce7bb823ed9abf","score":"0.57855904","text":"function _handleRequestGames(data) {\r\n\tconsole.log('REQUESTED GAMES:', data.toString().trim());\r\n\tstate = SELECT_GAME;\r\n\r\n\tauthServer.write('N\\t' + game + '\\n');\r\n}","title":""},{"docid":"cef5b57e2563666e978ee0369dcc50b4","score":"0.5781876","text":"function getAllGamesListed(){\n console.log(\"getting all the games in the database for the select list....\");\n var url = \"/getGames\";\n callAjax(url, handleGamesListed);\n}","title":""},{"docid":"1d0f05f7f7a344ff00d08bb4d8e41c94","score":"0.57777464","text":"function displayGame(gameName, game) {\n var gameUrl = 'http://boardgamegeek.com/boardgame/';\n var userUrl = 'http://boardgamegeek.com/user/';\n var gameClass = 'game-' + game.id;\n var liGame;\n \n // If game doesn't exist in list, create it\n if($('.' + gameClass).length)\n {\n liGame = $('.' + gameClass);\n }\n else\n {\n // Creates hyperlink for game\n var gameAnchorString = $('<a>', {href:gameUrl + game.id})\n .append(gameName)\n .prop('outerHTML');\n \n // Creates list item for game\n liGame = $('<li>', {class:gameClass}).append(gameAnchorString);\n }\n \n // Creates <span> of comma-separated hyperlinks for each user\n var userAnchorsString = \n $.map(\n getUnique(game.owners)\n .filter(function(item) {\n return $('.' + gameClass + ' .user-list a').length == 0 || \n $('.' + gameClass + ' .user-list a:not(:contains(\"' + item + '\"))').length > 0;\n }),\n function(item, index) {\n return $('<a>', {href:userUrl + item})\n .append(item)\n .prop('outerHTML')\n }\n )\n .sort()\n .join(', ');\n var spanUserList = $('<span>', {'class':'user-list'}).append(userAnchorsString);\n liGame.append(spanUserList);\n \n $('#olGamesAvailable').append(liGame);\n}","title":""},{"docid":"fcb86891ebdc8066fb0d72c729229d11","score":"0.5769379","text":"function sendSearch(){\r\n let xhttp = new XMLHttpRequest();\r\n xhttp.onreadystatechange = function() {\r\n if (this.readyState == 4 && this.status == 200) {\r\n gamesArr= JSON.parse(this.responseText); //this should be an array now?\r\n //update the currentTurn so that we start at the end of the games\r\n if(gamesArr.length !== 0){\r\n currentTurn = gamesArr[0].turns.length - 1;\r\n }\r\n displayCurrGame();\r\n console.log(gamesArr);\r\n }\r\n };\r\n console.log(getQuery());\r\n xhttp.open(\"GET\", getQuery(), true); //I need the user object\r\n xhttp.send();\r\n\r\n}","title":""},{"docid":"8247a994d8113675ab8e52117c1e87cb","score":"0.57683754","text":"function getMatches (gameArray) {\n\tlet num = 0;\n\tgameArray.forEach(function (id) {\n\t\t$.ajax({\n\t\t\turl: RIOT_ENDPOINT + `/lol/match/v3/matches/${id}?api_key=${apiKey}`,\n\t\t\ttype: 'GET',\n\t\t\tdataType: 'json',\n\t\t\tsuccess: function (e) {\n\t\t\t\tnum++\n\t\t\t\trenderScreen(e, num)\n\t\t\t}\n\t\t})\n\t})\n}","title":""},{"docid":"2c91c775247510b35c0fa8a89a52841d","score":"0.5767244","text":"function getJoinedGames() {\n ticTacToeData\n .getJoinedGames(auth.access_token())\n .then(function (data) {\n $scope.joinedGames = data;\n $scope.allMyGames = $scope.allMyGames.concat(data);\n });\n }","title":""},{"docid":"bb1505441ecf472870290e730b0e4838","score":"0.5763073","text":"getGameData () {\n let siteIdIndex = window.location.search('games/');\n let gameId = window.location.slice(siteIdIndex + 6);\n fetch(API_URL.games + `/${gameId}`, {\n headers: {\n 'Authorization': `Bearer ${this.props.authToken}`\n }\n })\n .then(res=> res.json())\n .then(data=> {\n this.props.dispatch(loadGameState(data));\n })\n .catch(err=> {\n console.log(JSON.stringify(err));\n //display in status component, don't redirect\n //this.props.dispatch(updateGameStatusError(err))\n })\n }","title":""},{"docid":"02de2927a86fb147091e0f6aac5821e4","score":"0.5762754","text":"function getUsersGames(req, res, next) {\n Games.findAll()\n .then((data) => {\n const games = [];\n data.forEach((g) => {\n const game = g.get({ plain: true });\n if (game.user_ids.indexOf(Number(req.params.user_id)) > -1)\n games.push(game);\n });\n res.status(constants.http_ok)\n .json({\n status: 'success',\n content: games,\n message: 'Got all games'\n });\n })\n .catch((err) => {\n res.status(constants.http_bad_request)\n .json({\n status: 'failure',\n content: err.message,\n message: 'Failed to get user\\'s games'\n });\n });\n}","title":""},{"docid":"05cb23289769066d9030ef8039607e1d","score":"0.575588","text":"function getShowAllTeams() {\n if ('caches' in window) {\n caches.match(ENDPOINT_SHOW_ALL_TEAMS).then(function (response) {\n if (response) {\n response.json().then((data) => getViewTeamPremierLeague(data));\n }\n });\n }\n\n fetchAPI(ENDPOINT_SHOW_ALL_TEAMS)\n .then(status)\n .then(json)\n .then(data => getViewTeamPremierLeague(data))\n .catch(error);\n}","title":""},{"docid":"013865ce484f07440075c9c69f6b142f","score":"0.57332647","text":"getGameStatus() {\n this.setMethod('GET');\n this.setPlayerId();\n return this.getApiResult(`${Config.PLAY_API}/${this.playerId}/status`);\n }","title":""},{"docid":"abe5cab94466895aea9aaa3b2e2eb63d","score":"0.57321054","text":"getPastGames() {\n\n // TODO: AXIOS Requeset to get information about old games for this user\n\n let pastGamesList = [];\n\n let numGames = 0;\n\n // Axios request\n // Iterating on games\n\n if (numGames === 0) {\n // No past games :(\n pastGamesList.push(\n <div className = \"noPast\">You have not participated in any games</div>\n );\n }\n\n return pastGamesList;\n }","title":""},{"docid":"2f86044db945a4550ea1bc1650265702","score":"0.5715093","text":"function fetchSuggestedGames(game) {\r\n return fetch(\"/api/games\", {\r\n method: \"post\",\r\n body:\r\n \"fields name, summary, cover; where id=(\" +\r\n game.similar_games.join(\", \") +\r\n \");\",\r\n headers: {\r\n \"Content-Type\": \"text/plain\"\r\n }\r\n })\r\n .then(\r\n response => response.json(),\r\n\r\n error => console.log(\"An error occurred.\", error)\r\n )\r\n .then(json => {\r\n return json;\r\n });\r\n}","title":""},{"docid":"15d30545c3fb63c18a8792ef9efd4ccc","score":"0.5704835","text":"function fetchGame(gameUrl) {\n switch(gameUrl) {\n case 'stryk':\n return fetch(URL_STRYKTIPSET)\n .then(result => result.json())\n .then(data => parseGameData_(data)) \n\n break;\n case 'europa':\n return fetch(URL_EUROPATIPSET)\n .then(result => result.json())\n .then(data => parseGameData_(data)) \n break;\n case 'topp':\n return fetch(URL_TOPPTIPSET)\n .then(result => result.json())\n .then(data => parseGameData_(data)) \n break;\n default: console.warn('Wrong API call');\n }\n }","title":""},{"docid":"2803d0125e3647a08880d2d30f077745","score":"0.5699265","text":"async function getSteam(){\n try {\n //get the Json data from the steam api\n const response = await fetch(api_url);\n const data = await response.json();\n console.log(data);\n // aswell as casting it into html on the page\n document.getElementById(\"imaginedude\").innerHTML = `\n <h1 class=\"sameColor text-center\"> Recent games played</h1>\n ${data.response.games.map(gamelogoTemplate).join('')}`\n\n } catch (error) {\n document.getElementById(\"imaginedude\").innerHTML =`API failed to load please try again later`;\n console.log(\"steam no work\");\n console.log(error);\n }\n \n}","title":""},{"docid":"cc84805abbcae405362808e4a0242945","score":"0.5696814","text":"function loadGame() {\n\ttry {\n\t\tvar gameArray = [];\n\t\t\n\n\t\tfor (var i = 0; i < gameList.length; i++) {\n\t\t\tif (gameList[i].Notification == 1) {\n\n\t\t\t\t//Ti.API.info('gameIcons', \"/images/gameIcons/\" + \"C\" + gameList[i].CTestID + \".png\");\n\n\t\t\t\tgameArray.push({\n\t\t\t\t\ttemplate : \"gameListTemplate\",\n\n\t\t\t\t\tgameNameLabel : {\n\t\t\t\t\t\ttext : gameList[i].CTestName\n\t\t\t\t\t},\n\t\t\t\t\ticonImage : {\n\t\t\t\t\t\timage : \"/images/gameIcons/\" + \"C\" + gameList[i].CTestID + \".png\"\n\t\t\t\t\t}\n\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\t$.lstSection.setItems(gameArray);\n\n\t} catch(ex) {\n\t\tcommonFunctions.handleException(\"welcomeContentScreen\", \"loadGame\", ex);\n\t}\n}","title":""},{"docid":"25159e415be7f29dae39911fe20302ab","score":"0.56882066","text":"async function getAllGameInfo(game){\n const res = await fetch(\"/api/game/info\",{\n method:\"POST\",\n headers: { \"Content-Type\": \"application/json\" },\n body: JSON.stringify({\n info:{\n game: game,\n admin: adminId\n }\n })\n });\n return res.json();\n}","title":""},{"docid":"77c0b90e0a16bfe9f981d9128da26490","score":"0.56851804","text":"function getGameID (callback){\n console.log('enter getGameID');\n \n // steam api url\n var url1 ='https://api.steampowered.com/ISteamApps/GetAppList/v2';\n var tempData = '';\n var tempdata1;\n \n // calls the steam url and processes\n https.get(url1, function(response) {\n \n // while response event is data, add all incoming data to tempData variable\n response.on(\"data\", function (data) {\n tempData += data;\n });\n \n // on end event parse json and add data to appData variable\n response.on(\"end\", function() {\n tempdata1 = JSON.parse(tempData);\n appData = tempdata1.applist.apps;\n console.log('exit getGameID');\n //console.log(appData.length);\n callback();\n //msg.reply('App ID : ' + info.appid + '\\nGame Name : ' +info.name);\n });\n });\n\n}","title":""},{"docid":"03dcd2e7cfb8fe00397b82b0124f77dc","score":"0.5680731","text":"function getGames(f) {\n request({url: \"/lobby-games\", method: \"GET\"})\n .then(data => {\n console.log(\"success, updating games\");\n f(data);\n })\n .catch(error => {\n console.log(\"error: \" + error);\n });\n}","title":""},{"docid":"a3ce02b6287bf28e1577bd15e20aeab9","score":"0.56801754","text":"function getPlayerList(){\n var db = getPlayersDatabase();\n var result = new Array()\n\n try {\n db.transaction(function(tx) {\n var rs = tx.executeSql('SELECT * FROM players_storage');\n for(var i = 0; i < rs.rows.length; i++) {\n var dbItem = rs.rows.item(i);\n result[i] = {\n 'name': dbItem.name,\n 'wins': dbItem.wins,\n 'loses': dbItem.loses\n }\n }\n })\n } catch(e) {\n return []\n }\n return result;\n}","title":""},{"docid":"2f5f2090f1b6cd09576f50d2ca9a9518","score":"0.5676075","text":"async function requestGameState() {\n await fetch(`/api/game/state/${roomId}`).then(res => res.json());\n}","title":""},{"docid":"6bcedfb43aa328efd3ed4b7026c3e9d5","score":"0.5671723","text":"function getRecentGames(summoner, callback)\n{\n // Summary info\n irelia.getRecentGamesBySummonerId(summoner.region, summoner.id, function (err, summonerRecentGames) {\n if(err) {\n // Play catch\n callback({status: 'error', data: err});\n console.log(err);\n } else {\n // Play catch\n //console.log(summonerRecentGames.games);\n callback({status: 'success', data: summonerRecentGames});\n }\n });\n}","title":""},{"docid":"4e3a265bc2e6fe9896b6f31f5fd79902","score":"0.5667258","text":"function getStates(game) {\n\n}","title":""},{"docid":"416d26d165cc4dd47ae5b61ac8839848","score":"0.5665826","text":"getGameInfos() {\n return game_infos;\n }","title":""},{"docid":"4c0afca19c06e559ddf15cb80d0f6115","score":"0.56647044","text":"function getGame(gameName) {\r\n return fetch('api/games', {\r\n method: \"post\",\r\n body: 'fields name, similar_games; where name ~\"' + gameName+ '\";',\r\n headers: {\r\n \"Content-Type\": \"text/plain\"\r\n }\r\n })\r\n .then(\r\n response => response.json(),\r\n\r\n error => console.log(\"An error occurred.\", error)\r\n )\r\n .then(json => {\r\n return json[0];\r\n });\r\n}","title":""},{"docid":"393b581bce59b16c958dd25fe37b90d5","score":"0.5662635","text":"function get_games_current() {\n var dataObj = {\n \"content\" : [ {\n \"session_id\" : get_cookie()\n } ]\n };\n call_server('games_current', dataObj);\n}","title":""},{"docid":"b36ccbe6f2f2ab7a7cfc724b20fabaf3","score":"0.5657","text":"function loadGames(){\n\tvar request = loadViaAjax(\"AllGames.json\");\n\trequest.done(function(data) {\n\t\tGames = data;\n\t\tcreateGameCategories();\n\t\tcreateGameCategoryAll();\n\t});\n\treturn request;\n}","title":""},{"docid":"f0f3f080e08c441e9dd6e6606bcaaf80","score":"0.56551373","text":"function getLeagueList() {\n return League.find({}, \"name\").exec();\n}","title":""},{"docid":"721ca0a581c3664a212d031ee3d9a51a","score":"0.56337976","text":"async function getStat() {\n const responseFromServer = await fetch('/game-data');\n game_data = await responseFromServer.json();\n \n displayPrompt();\n}","title":""},{"docid":"b8f1b04474b89771623aee22e3548b5b","score":"0.56310344","text":"function getTeams() {\n\tvar teams = [];\n\tajax.controllers.Application.getTeams().ajax({\n\t\tasync: false,\n\t success: function(data) {\n\t \tteams = data;\n\t },\n\t\terror: function(data) {\n\t\t\talert(\"Erro ao obter os times\");\n\t\t}\n\t});\n\t\n\treturn teams;\n}","title":""},{"docid":"6f56ec583256cc32809e60113888aaa4","score":"0.562757","text":"function getProviderPlaylists() {\n let playlistsRequest = new Request(`http://${PROXY_SERVER}/playlists/`);\n let headers = playlistsRequest.headers;\n headers.append('X-Audiowings-DeviceId', MAC_ADDRESS);\n return fetch(playlistsRequest)\n .then(status)\n .then(response => response.json())\n .catch(error => console.log(':( Request failed', error));\n}","title":""},{"docid":"fbdd5cba66e198ebf5c7fea2c3c67633","score":"0.5625745","text":"getBotsList() {\n let bot_status = {};\n bot_status.count = utils.objectLength(this.bots);\n let bots_list = [];\n for (const idx in this.bots) {\n let url = new URL(this.bots[idx].page.url());\n let room_url = url.origin + url.pathname;\n bots_list.push({\n uuid: this.bots[idx].uuid,\n name: this.bots[idx].name,\n room_url: room_url,\n avatar_id: this.bots[idx].avatar_id,\n });\n }\n bot_status.bots = bots_list;\n return utils.buildJsonResponse({\n command: \"bots list\",\n success: true,\n message: \"Ok\",\n data: bots_list,\n });\n }","title":""},{"docid":"3c6775debc9373329353b9deef6cd4e3","score":"0.56244206","text":"function getAwaitedGames() {\n let xmlContent = \"\";\n fetch(\"https://gamezone.ninja/Resources/games.xml\").then((response) => {\n response.text().then((xml) => {\n xmlContent = xml;\n let parser = new DOMParser();\n let xmlDOM = parser.parseFromString(xmlContent, \"application/xml\");\n let games = xmlDOM.querySelectorAll(\"game\");\n var xmlContent2 = \"\";\n\n xmlContent2 = assembleContent(\"awaited\", xmlContent2, games);\n document.getElementById(\"games-game-list\").innerHTML = xmlContent2;\n });\n });\n}","title":""},{"docid":"6879161fade928b7706969b393354165","score":"0.5611254","text":"async getPlaylists() {\n const accessToken = this.accessToken || this.getAccessToken();\n const headers = { Authorization: `Bearer ${accessToken}` };\n const userID = await this.getUserID();\n //GET method\n try {\n const response = await fetch(\n 'https://api.spotify.com/v1/me/playlists?limit=50',\n { headers: headers }\n );\n if (response.ok) {\n const jsonResponse = await response.json();\n if (jsonResponse && jsonResponse !== {}) {\n return jsonResponse.items\n .filter(playlist => playlist.owner.id === userID)\n .map(playlist => {\n return {\n id: playlist.id,\n name: playlist.name,\n tracksURL: playlist.tracks.href,\n image: playlist.images[1],\n uri: playlist.uri,\n };\n });\n }\n } else {\n throw new Error('Request to GET Playlists Failed!');\n }\n } catch (err) {\n this.authFailed();\n console.log(err);\n }\n }","title":""},{"docid":"6162655fb716a2bb71e1e3b2a25c536c","score":"0.5599031","text":"function getStreams(gameIDs, token, cursor = \"\") {\n return rp.get(\"https://api.twitch.tv/helix/streams\", {\n headers: {\n \"Client-ID\": config[\"twitch-client-id\"],\n \"Authorization\": \"Bearer \" + token,\n },\n qs: {\n \"game_id\": gameIDs,\n \"first\": 99,\n \"type\": 'live',\n \"after\": cursor\n },\n json: true,\n });\n}","title":""},{"docid":"0bcff9ab21855613aecf8d9cf3786783","score":"0.5593518","text":"function getGameSessions() {\n $.ajax({\n url: SERVER_HOST + \"api/gamesession/list\",\n type: \"GET\",\n success: function (gameSessions) {\n $(GAME_SESSIONS_ID).empty();\n\n let tableHeaders = '<tr><th>Название сессии</th><th>Количество игроков</th><th></th><th></th></tr>';\n $(GAME_SESSIONS_ID).append(tableHeaders);\n\n for (let i = 0; i < gameSessions.length; i++) {\n appendGameSession(gameSessions[i]);\n }\n }\n });\n}","title":""},{"docid":"b1d7ef542b99f2af79dbce01771b37fd","score":"0.55812955","text":"function getTopRatedGames() {\n let xmlContent = \"\";\n fetch(\"https://gamezone.ninja/Resources/games.xml\").then((response) => {\n response.text().then((xml) => {\n xmlContent = xml;\n let parser = new DOMParser();\n let xmlDOM = parser.parseFromString(xmlContent, \"application/xml\");\n let games = xmlDOM.querySelectorAll(\"game\");\n var xmlContent2 = \"\";\n\n xmlContent2 = assembleContent(\"top\", xmlContent2, games);\n document.getElementById(\"games-game-list\").innerHTML = xmlContent2;\n });\n });\n}","title":""},{"docid":"0b5df43e985a1e4bcc41d6a48e465dff","score":"0.5566806","text":"async function getGame(req, res) {\n const game = await Game.findByIdAndUser(req.params.id, req.user);\n\n res.json(game.outputForUser(req.user._id));\n}","title":""},{"docid":"2510c7e8dd4a54c81324e1f05550e6c3","score":"0.5564799","text":"function getGame(name) {\n let xmlContent = \"\";\n fetch(\"https://gamezone.ninja/Resources/games.xml\").then((response) => {\n response.text().then((xml) => {\n xmlContent = xml;\n let parser = new DOMParser();\n let xmlDOM = parser.parseFromString(xmlContent, \"application/xml\");\n let games = xmlDOM.querySelectorAll(\"game\");\n var xmlContent2 = \"\";\n\n games.forEach((gameXmlNode) => {\n if (gameXmlNode.children[0].innerHTML.includes(name)) {\n xmlContent2 +=\n \"<div class='category'>\" +\n \" Category: \" +\n gameXmlNode.children[8].innerHTML +\n \"</div>\" +\n \"<img class='gamePic' src=\" +\n gameXmlNode.children[2].innerHTML +\n \" alt=''>\" +\n \"<div class='publisher'>\" +\n \"Publisher: \" +\n gameXmlNode.children[6].innerHTML +\n \"</div>\" +\n \"<div class='release'>\" +\n \"Release Date: \" +\n gameXmlNode.children[4].innerHTML +\n \"</div>\" +\n \"<div class='rating'>\" +\n \"Rating: \" +\n gameXmlNode.children[7].innerHTML +\n \"</div>\" +\n \"<div class='description'>\" +\n \"<h3>Description</h3> <br/>\" +\n gameXmlNode.children[1].innerHTML +\n \"</div>\" +\n \"<iframe width='1200' height='700' src='\" +\n gameXmlNode.children[3].innerHTML +\n \"' frameborder='0' allow='accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture' allowfullscreen></iframe>\" +\n \"<div class='review'>\" +\n \"<h3>Review</h3> <br/>\" +\n gameXmlNode.children[5].innerHTML +\n \"</div>\";\n }\n });\n document.getElementById(\"games-game-list\").innerHTML = xmlContent2;\n });\n });\n}","title":""},{"docid":"205bd4326a36cabcb3acb5da405ba743","score":"0.5551379","text":"function getSports() {\n hideButtonsAndText();\n let url = INDEX_URL + \"sport=list\";\n fetch(url, {mode: 'cors'})\n .then(checkStatus)\n .then(showSports)\n .catch(printError);\n }","title":""},{"docid":"0f226f04871e47a9a1664986fccb2763","score":"0.5551213","text":"function renderGames() {\n var rows = document.getElementsByClassName(\"Tst-table Table\")[0].rows;\n var playerInfo;\n\n //go through rows of table\n for (var i = 1; i < rows.length; i++) {\n //grab all text from the <td> that includes the team/player name\n playerInfo = rows[i].cells[1].innerText.split(\" \");\n teamsString += getTeamFromInfo(playerInfo) + \",\";\n }\n //console.log(teamsString)\n var dateString = getFormattedDate();\n var leagueIDString = \"leagueID=\" + getLeagueID();\n //console.log(\"dateString = \" + dateString);\n var url =\n \"https://www.sportswzrd.com/gamesremaining/?pageName=transactionTrends&\" +\n teamsString +\n \"&format=json&date=\" +\n dateString +\n \"&\" +\n leagueIDString;\n //console.log(\"before request\");\n chrome.runtime.sendMessage(\n {\n endpoint: \"gamesremaining\",\n date: dateString,\n leagueID: getLeagueID(),\n teams: teamsString,\n pageName: \"yTransactionTrends\"\n },\n function(response) {\n addGames(response.data);\n }\n );\n}","title":""},{"docid":"326baa0c05d4d7e1cb1eaa3413ffdab0","score":"0.5539648","text":"async function getAllGroups() {\n try {\n // This return the id [g:1:${id}]\n const { response } = await doAjax({\n type: \"GET\",\n url: \"https://api.steampowered.com/ISteamUser/GetUserGroupList/v1/\",\n data: {\n key: SteamApiKey,\n steamid: steamId,\n },\n dataType: \"json\",\n });\n\n return response.groups.map(function (groups) {\n return groups.gid;\n });\n } catch (error) {\n return Promise.reject(error);\n }\n }","title":""},{"docid":"9e4e0a33a7ba181be839a1feedd5b17d","score":"0.5522911","text":"getFeaturedPlayers(){\n return client({\n method: 'GET',\n path: PLAYER_SEARCH_ROOT+\"getAllByOrderByEloDesc\",\n params: {\n page: 0,\n size: 3\n }\n })\n }","title":""},{"docid":"e60ef9b686d39d9588ce7c03aef76b26","score":"0.55207723","text":"function generateGamesList(game) {\n $('.js-gameUl').html('');\n $.each(game, function(index, value) { \n let gameElement = generateGameElement(value);\n $('.js-gameUl').append(gameElement);\n });\n}","title":""},{"docid":"954f53a8e95f4f20ff029c7d58c28be6","score":"0.551993","text":"async getMatchListing() {\n console.log(\"Entering getMatchListing()\");\n // Defining rest-api endpoint for querying state data\n let stateRequest = 'http://rest-api:8008/state?address=' + addressDeleted;\n let stateResponse = await fetch(stateRequest);\n let stateJSON = await stateResponse.json();\n return stateJSON;\n }","title":""},{"docid":"13bd0f85dcd57f4718abad33f359ed9d","score":"0.5513846","text":"function getMatches() {\n if (\"caches\" in window) {\n caches.match(`${BASE_URL}competitions/2015/teams`).then((res) => {\n if (res) {\n res.json().then((data) => {\n renderCardList(data);\n });\n }\n });\n }\n\n fetch(`${BASE_URL}competitions/2015/teams`, header)\n .then(status)\n .then(json)\n .then((data) => {\n renderCardList(data);\n })\n .catch(error);\n}","title":""},{"docid":"4ad0b21865087f0d280e0954e55bfaff","score":"0.55127376","text":"getPlayers(){\n let players = fetch(API_URL + '/api/players',\n {method: 'GET'}).then((response) => response.json())\n return players;\n }","title":""},{"docid":"2333eeeed2cfb95886d8b7495cc8d548","score":"0.5506753","text":"function getPreviousGames() {\n\t$.getJSON(\"/games\").done(function(response){\n\t\tconsole.log(response.games);\n\t\tshowGames(response.games);\n\t});\n}","title":""},{"docid":"84c61fd96e48eee0e45dfcb82cb91919","score":"0.5501252","text":"function getData() {\nvar url1 = 'http://localhost:8080/api/game_view/' + myParam\n fetch(url1)\n .then(response => response.json())\n .then(response => {\n let slvGames = response\n console.log(response)\n main(slvGames)\n })\n .catch(err => console.log(err));\n}","title":""},{"docid":"2b130870f33f068b54fd18918daad368","score":"0.54991794","text":"function printGames(game) {\n let queryUrl = `https://rawg.io/api/games?search=${game}&platforms=23`;\n $.ajax({\n url: queryUrl,\n method: 'GET'\n }).then(function (response) {\n console.log(response);\n let p = $('#results');\n p.empty();\n $('#info').empty();\n let array = response.results;\n for (let i = 0; i < array.length; i++) {\n let span = $('<span>');\n let name = $('<div>').text(array[i].name).attr('class','name');\n let image = $('<img>').attr({\n 'class': 'image thumbnail',\n 'src': array[i].background_image,\n 'alt': array[i].name\n });\n span.append(name, image);\n p.append(span);\n }\n listOfResults = response.results;\n })\n $('.boxdescription').css('height', '350px');\n\n }","title":""},{"docid":"142be8aa7e3c5bf08109ce406f2b1f29","score":"0.5495462","text":"function loadTeams() {\n doAjax(TEAM_URL + '/get').then(data => {\n data.forEach(team => {\n console.log('Team ->', team.name);\n });\n });\n}","title":""},{"docid":"21ef7dc53c3b20993ffabcae7f6e12a3","score":"0.54927665","text":"function get_game_overview(game_id) {\n view_game_id = game_id;\n var dataObj = {\n \"content\" : [ {\n \"session_id\" : get_cookie()\n }, {\n \"game_id\" : game_id\n } ]\n };\n call_server('game_overview', dataObj);\n}","title":""}],"string":"[\n {\n \"docid\": \"4dcc33453988784deb2c1831a624db70\",\n \"score\": \"0.7437258\",\n \"text\": \"function fetchGameList(){\\n\\tfetch(\\\"https://rawg-video-games-database.p.rapidapi.com/games?page=1\\\", {\\n\\t\\\"method\\\": \\\"GET\\\",\\n\\t\\\"headers\\\": {\\n\\t\\t\\\"x-rapidapi-host\\\": \\\"rawg-video-games-database.p.rapidapi.com\\\",\\n\\t\\t\\\"x-rapidapi-key\\\": \\\"ba56e18dfbmsha0533de8919d27bp10d3dcjsn5229ce979bb3\\\"\\n\\t}\\n\\t})\\n\\t.then((resp) => resp.json())\\n\\t.then(function (response) {\\n\\t\\t\\tvar jsonGameList = response;\\n\\t\\t\\t//Envia el ID de cada uno de los juegos en la primera página\\n\\t\\t\\tfor(var i = 0; i < 19; i++){\\n\\t\\t\\t\\tfetchGameInfo(jsonGameList.results[i].id);\\n\\t\\t\\t}\\n\\t})\\n\\t.catch(function (err) {\\n\\t\\t\\tconsole.log(\\\"No se puedo obtener el recurso\\\", err);\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41d762be1471ec420765517ebdd2fd9d\",\n \"score\": \"0.71969146\",\n \"text\": \"async listGames(init) {\\r\\n return this.request('/games', init);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e6cf68431c24b1ee832f26985632670\",\n \"score\": \"0.6822302\",\n \"text\": \"async function getGameData() {\\n var res = await fetch(\\\"/games/search?limit=-1\\\")\\n var resp = await res.json();\\n return resp\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1066df36c0a14daa4705407b2a563ef5\",\n \"score\": \"0.68061924\",\n \"text\": \"async getGameInfos() {\\n\\t\\tawait this.login(LOGIN_ACCOUNT_GAUTIER)\\n\\t\\tconst game = await this.sendRequest({ rsn:'2ynbmhanlb',guide:{ login:{ language:1,platform:'gaotukc',ug:'' } } }, '699002934')\\n\\n\\t\\treturn game.a\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c52b1b7e052c80341cc8b0338a9364d5\",\n \"score\": \"0.67902493\",\n \"text\": \"list(req, res) {\\n Game.findAll()\\n .then((games) => {\\n res.status(200).json(games);\\n })\\n .catch((error) => {\\n res.status(500).json(error);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca87a146dc41ceb01c192fa99a3d7d28\",\n \"score\": \"0.6733176\",\n \"text\": \"function getGames(cmd, str, callbackObj) {\\n let gamesJSON = [];\\n\\n let requestURL = \\\"http://api.steampowered.com/ISteamApps/GetAppList/v0002\\\";\\n\\n let r = request(requestURL, function (err, res, body) {\\n search(cmd, str, JSON.parse(body).applist.apps, callbackObj);\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1bdd524af421dcc6bc5fdcee86cbb598\",\n \"score\": \"0.67256856\",\n \"text\": \"function getAllGames()\\n {\\n ajaxHelper(gamesUri, 'GET').done(function (data)\\n {\\n self.games(data);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e62f5abf9f30bd76b4e9b09047ae5e93\",\n \"score\": \"0.67047113\",\n \"text\": \"getGames(){\\n let games = fetch(API_URL +'/api/games',\\n {method: 'GET'}).then((response) => response.json())\\n return games;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20b1acd602d869936792e0046bdd0f87\",\n \"score\": \"0.6700918\",\n \"text\": \"async myGames (data = {}) {\\n return await this.request('get', '/my-games', data, {games: ensureArray})\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"848162a2a6a38c4c8f6462f2917ec741\",\n \"score\": \"0.6609713\",\n \"text\": \"async function games() {\\n const allGamesResponse = await axios.get(`https://api.steampowered.com/ISteamApps/GetAppList/v2/`);\\n // console.log(allGames);\\n // console.log(allGames.data.applist.apps);// indiviudal item will be an element inside the array apps; the entire array of apps exist would be data.applist.apps\\n const allGames = allGamesResponse.data.applist.apps\\n return allGames;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18a31b4415c7e43c19da6e05cc3d7e04\",\n \"score\": \"0.66035795\",\n \"text\": \"retrieveAllGames() {\\n return freendiesApi.retrieveAllGames()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"747a67a778d93e31c82cd1d1badc30e9\",\n \"score\": \"0.6552598\",\n \"text\": \"getLiveLeagueGames() {\\n const query_params = {\\n key: this.apiKey\\n }\\n return fetch(BASE_URL + DOTA_MATCHES + 'GetLiveLeagueGames/v1/?' + handleQueryParams(query_params))\\n .then(response => responseHandler(response))\\n .catch(e => e)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70319906e6f2c58a2515bc105323debd\",\n \"score\": \"0.65334445\",\n \"text\": \"async function getAllGameIds(url = defaultUrl) {\\n const response = await fetch(`/api/game`, {\\n method: \\\"GET\\\",\\n headers: {\\n 'Content-Type': 'application/json'\\n }\\n });\\n return await response.json();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fbd5e7e4306ad1c0a5bc6dc8fdaa946\",\n \"score\": \"0.6528095\",\n \"text\": \"function getOwnedGames(force_update = false){\\n\\tif (settings.steam_id.length != 17){\\n\\t\\tmyApp.alert('Invalid Steam ID 64 supplied,<br/>Must be 17 characters long..');\\n\\t\\treturn;\\n\\t}\\n\\t//check if we have a steamID & check if it has been 24 hours since last update\\n\\tif (!!force_update || +local_settings.owned_apps_next_update < +new Date().getTime() ){\\n\\t\\t$.ajax({\\n\\t\\t\\tcache: false,\\n\\t\\t\\tdataType: 'json',\\n\\t\\t\\turl: 'https://store.steampowered.com/dynamicstore/userdata/',\\n\\t\\t\\tsuccess: (res) => {\\n\\t\\t\\t\\tconst rgOwnedApps = res.rgOwnedApps || [];\\n\\t\\t\\t\\tconst rgOwnedPackages = res.rgOwnedPackages || [];\\n\\t\\t\\t\\tconst ownedApps = [...new Set([...rgOwnedPackages, ...rgOwnedApps])];\\n\\t\\t\\t\\tif (ownedApps.length <= 0){\\n\\t\\t\\t\\t\\tmyApp.alert('No owned games found,<br/>Try signing into steam first.<br/><br/>Attempting fallback server, Less owned games will be retrieved though.');\\n\\t\\t\\t\\t\\tgetOwnedGamesFallback(force_update);\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Set owned apps\\n\\t\\t\\t\\tlocal_settings.owned_apps = ownedApps;\\n\\t\\t\\t\\t// Set current time + 24 hours as next updated time\\n\\t\\t\\t\\tlocal_settings.owned_apps_next_update = +new Date().getTime() + (24 * 60 * 60 * 1000);\\n\\t\\t\\t\\tsave_options('local');\\n\\t\\t\\t\\tmyApp.alert(`Owned Games List Updated!<br/>Games Found: ${ownedApps.length}`);\\n\\t\\t\\t},\\n\\t\\t\\terror: (err) => {\\n\\t\\t\\t\\tmyApp.alert('Are you signed into steam?<br/>Attempting fallback server, Less owned games will be retrieved though.');\\n\\t\\t\\t\\tgetOwnedGamesFallback(force_update);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ddab0ad9e6bb478c1fe34a5ee9f0d9c\",\n \"score\": \"0.64364207\",\n \"text\": \"async getAllUserGames ({ auth, response }) {\\n const allUserGames = await Game.query()\\n .where('user_id', auth.current.user.id)\\n return response.json({\\n status: 'success',\\n data: allUserGames\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90a4f1864a967a002ee2a3b387de08b9\",\n \"score\": \"0.6419179\",\n \"text\": \"getGames() {\\n return axios.get(Constants.GAMES_ENDPOINT)\\n .then((result) => {\\n return result.data;\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e570265c28785bba58dd8937aaf1a773\",\n \"score\": \"0.6360097\",\n \"text\": \"getAllGames(){\\t\\n\\t\\tlet games = [];\\n\\t\\tfor(let i = 0;i<this.games.length();i++){\\n\\t\\t\\tgames.push(this.games.at(i).getLobbyVersion());\\n\\t\\t}\\n\\t\\treturn games;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a751b42979d1293e9bbc0301f86e4ec\",\n \"score\": \"0.6340395\",\n \"text\": \"function getGames(player) {\\n playerId = player || \\\"\\\";\\n if (playerId) {\\n playerId = \\\"/?player_id=\\\" + playerId;\\n }\\n $.get(\\\"/api/games\\\" + playerId, function(data) {\\n console.log(\\\"Games\\\", data);\\n games = data;\\n if (!games || !games.length) {\\n displayEmpty(player);\\n }\\n else {\\n initializeRows();\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfcc58c3039bf373064ebe249707848b\",\n \"score\": \"0.6327575\",\n \"text\": \"async function loadGames() {\\n const allGameInfoResponse = await fetch(url + '/readAllGames', {\\n method: \\\"GET\\\",\\n headers: {\\n \\\"Content-type\\\": \\\"application/json; charset=UTF-8\\\"\\n }\\n });\\n if (allGameInfoResponse.ok) {\\n const games = await allGameInfoResponse.json();\\n window.games = games;\\n console.log(games);\\n }\\n else {\\n console.log(allGameInfoResponse);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"140c319a5c6736fdd31a65f616f2602a\",\n \"score\": \"0.6281858\",\n \"text\": \"function getTeamList() {\\n if (\\\"caches\\\" in window) {\\n caches.match(ENDPOINT_EPL + \\\"teams\\\").then(function (response) {\\n if (response) {\\n response.json().then(function (data) {\\n showTeamList(data);\\n })\\n }\\n })\\n }\\n\\n fetchAPI(ENDPOINT_EPL + \\\"teams\\\")\\n .then(data => {\\n showTeamList(data);\\n })\\n .catch(error);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3e8dbf07437e6e260772d792f7782eb\",\n \"score\": \"0.62816083\",\n \"text\": \"function getLiChessGames(username){\\n var url = \\\"https://us-central1-lazhack7-3b615.cloudfunctions.net/games?username=\\\" + username;\\n return $http.get(url)\\n .then(function(result){\\n var gameStrings = result.data.replace(/(\\\\r\\\\n|\\\\n|\\\\r)/gm,\\\"\\\\n\\\").split(\\\"\\\\n\\\");\\n var games = [];\\n gameStrings.forEach(function(str) {\\n try {\\n games.push(JSON.parse(str));\\n } catch(e){\\n\\n }\\n });\\n return games;\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21f713b348d4baf7cc87d59c20484ceb\",\n \"score\": \"0.6223511\",\n \"text\": \"async getGame() {\\n return (await this._client.helix.games.getGameById(this._data.game_id));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f2bd050522117b1bbd91fdf94670809\",\n \"score\": \"0.6222597\",\n \"text\": \"async function getUserGameplays(user, type) {\\n return fetch(URL + '/players/' + user.id + '/games?gameType=' + type, {\\n method: 'GET',\\n mode: 'cors',\\n headers: {\\n 'Authorization': 'Bearer ' + user.token\\n }\\n }).then(res => res.json());\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a5aaa8c075c1a5ab08955654a053133\",\n \"score\": \"0.62211716\",\n \"text\": \"static fetchAllGames(url) {\\n fetch(url)\\n .then(res => res.json())\\n .then(gamesObjects => {\\n\\n // Show the \\\"Create New Game\\\" form on the page\\n Game.showCreateGameForm();\\n\\n gamesObjects.forEach(gameObject => {\\n \\n \\n\\n // Create a new Game object on the front-end\\n const game = new Game(gameObject.id, gameObject.name, gameObject.status, gameObject.phase)\\n gameObject.players.forEach(playerObject => {\\n const player = new Player(playerObject.id, playerObject.name);\\n game.players.push(player);\\n }) \\n \\n // Renders a specific game on the page\\n game.renderGameListCard();\\n\\n })\\n\\n // Open websocket connection with new games\\n Game.createGamesWebsocketConnection();\\n\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb9b05e051d9e4f291f219d8492e585c\",\n \"score\": \"0.62157345\",\n \"text\": \"async function getSteam (req, res, next) {\\n const steamId = req.user.steam;\\n const params = { l: 'english', steamid: steamId, key: process.env.STEAM_KEY };\\n const getAsync = promisify(request.get);\\n \\n // get the list of the recently played games, pick the most recent one and get its achievements\\n const getPlayerAchievements = () =>\\n getAsync({ url: 'http://api.steampowered.com/IPlayerService/GetRecentlyPlayedGames/v0001/', qs: params, json: true })\\n .then(({ request, body }) => {\\n if (request.statusCode === 401) {\\n throw new Error('Invalid Steam API Key');\\n }\\n if (body.response.total_count > 0) {\\n params.appid = body.response.games[0].appid;\\n return getAsync({ url: 'http://api.steampowered.com/ISteamUserStats/GetPlayerAchievements/v0001/', qs: params, json: true })\\n .then(({ request, body }) => {\\n if (request.statusCode === 401) {\\n throw new Error('Invalid Steam API Key');\\n }\\n return body;\\n });\\n }\\n });\\n const getPlayerSummaries = () => {\\n params.steamids = steamId;\\n return getAsync({ url: 'http://api.steampowered.com/ISteamUser/GetPlayerSummaries/v0002/', qs: params, json: true })\\n .then(({ request, body }) => {\\n if (request.statusCode === 401) {\\n throw Error('Missing or Invalid Steam API Key');\\n }\\n return body;\\n });\\n };\\n const getOwnedGames = () => {\\n params.include_appinfo = 1;\\n params.include_played_free_games = 1;\\n return getAsync({ url: 'http://api.steampowered.com/IPlayerService/GetOwnedGames/v0001/', qs: params, json: true })\\n .then(({ request, body }) => {\\n if (request.statusCode === 401) {\\n throw new Error('Missing or Invalid Steam API Key');\\n }\\n return body;\\n });\\n };\\n try {\\n const { playerstats } = await getPlayerAchievements();\\n const playerSummaries = await getPlayerSummaries();\\n const ownedGames = await getOwnedGames();\\n res.render('original/example/steam', {\\n title: 'Steam Web API',\\n ownedGames: ownedGames.response,\\n playerAchievemments: playerstats.success ? playerstats : null,\\n playerSummary: playerSummaries.response.players[0]\\n });\\n } catch (err) {\\n next(err);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15900c1c4ad81d3afa57650f121919e0\",\n \"score\": \"0.62093765\",\n \"text\": \"async getGame() {\\n return this.__request(`${this.api_url}/game/start`, \\\"POST\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2762153d5fbaa4ba9f2a4dc1880e5fe0\",\n \"score\": \"0.61890465\",\n \"text\": \"function getGameInfo() {\\n limiter.request({\\n url: `https://global.api.pvp.net/api/lol/static-data/euw/v1.2/champion?champData=all&${api}`,\\n method: 'GET',\\n json: true,\\n }, (error, response) => {\\n if (!error && response.statusCode === 200) {\\n champions = response.body.data;\\n version = response.body.version;\\n console.log(champions);\\n }\\n if (error) {\\n throw new Error('Cannot connect to Riot API');\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07a7b007ff777bc1a15fd09c98e2299d\",\n \"score\": \"0.61703235\",\n \"text\": \"function getLiveGames(){\\n\\n fetch('https://api.opendota.com/api/live')\\n .then(convertToJSON) \\n .then(getMatchInfo)\\n .then(filterTeams)\\n .then(writeMatchInfo)\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"793e8dcbd9772803002844bd966b9ed5\",\n \"score\": \"0.616957\",\n \"text\": \"searchGames(game, callback){\\n\\n console.log(\\\"Searching for: \\\", game)\\n\\n fetch('https://api.twitch.tv/kraken/search/games?query=' + game, {\\n method: 'GET',\\n headers: {\\n 'Accept': 'application/vnd.twitchtv.v5+json',\\n 'Client-ID': Twitch.clientID\\n }\\n }).then(response => response.json()).then(json => {\\n console.log(json.games);\\n callback(json.games)\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eba22228867c8229f5eb9e5d41e7f953\",\n \"score\": \"0.61151683\",\n \"text\": \"function getGames (champion, player) {\\n request('https://' + oneTricks[champion][player][\\\"region\\\"] + '.api.pvp.net/api/lol/' + oneTricks[champion][player][\\\"region\\\"] + '/v2.2/matchlist/by-summoner/' + oneTricks[champion][player][\\\"id\\\"] + '?championIds=' + champion + '&seasons=SEASON2016&api_key=' + RIOT_KEY, function (err, res, data) {\\n if (data !== undefined && JSON.parse(data).status === undefined) {\\n data = JSON.parse(data);\\n if (data.matches === undefined || data.matches.length < 10) {\\n delete oneTricks[champion][player];\\n } else {\\n data = data[\\\"matches\\\"].slice(0,10);\\n console.log(data);\\n for (var j=0; j < data.length; j++) {\\n oneTricks[champion][player][\\\"matchDetails\\\"][j][\\\"matchId\\\"] = data[j];\\n }\\n }\\n } else {\\n getGames(champion, player);\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5591b27117834ce3e2b49234161c98e7\",\n \"score\": \"0.60765016\",\n \"text\": \"function getGames(query) {\\n const params = {\\n id: query,\\n };\\n const queryString = formatQueryParams(params);\\n const url = searchUrl + \\\"?\\\" + queryString;\\n //fetches api from events url\\n fetch(url)\\n .then((response) => {\\n if (response.ok) {\\n return response.json();\\n }\\n throw new Error(response.statusText);\\n })\\n .then((responseJson) => displayEventResults(responseJson))\\n .catch((err) => {\\n $(\\\"#js-error-message\\\").text(`Something went wrong:${err.message}`);\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0dcb5d7b21f077ae8166c0b70bda6617\",\n \"score\": \"0.59533584\",\n \"text\": \"getGamesByTeam(team) {\\n TTTPost(\\\"/games-by-team\\\", {\\n team_id: team.team_id\\n })\\n .then(res => {\\n this.setState({team: team, games: res.data.games});\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89570917721c45cf3740924d67f865c1\",\n \"score\": \"0.5934758\",\n \"text\": \"function getLevelList(gameName) {\\n\\t$.ajax({\\n\\t\\ttype: \\\"POST\\\",\\n\\t\\turl: '../../../../../backend/getLevelList.php',\\n\\t\\tdata: {game_name: gameName},\\n\\t\\tsuccess: function(data){\\n\\t\\t\\t//since AJAX is async, its up to the current game to implement loadLevel and handle async on its own\\n\\t\\t\\tdisplayLevelList(data);\\n\\t\\t}\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d03a3817bfbf77c05683598f34896451\",\n \"score\": \"0.5903512\",\n \"text\": \"function fetchGames(callback){\\n var url = 'http://wap.mlb.com/gdcross/components/game/mlb/year_'+year+'/month_'+month+'/day_'+day+'/miniscoreboard.json';\\n console.log('fetching url: ' + url);\\n http.get(url, function(res){\\n var body = '';\\n res.on('data', function(chunk) {\\n body += chunk;\\n });\\n res.on('end', function() {\\n var mlbResponse = JSON.parse(body)\\n callback(mlbResponse.data.games.game);\\n });\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8614bdfeac3d20a5d7f8844b90cf9e36\",\n \"score\": \"0.5897309\",\n \"text\": \"getCurrentGames() {\\n\\n // TODO: AXIOS Requeset to get information about active games for this user\\n\\n let activeGamesList = [];\\n\\n let numGames = 0;\\n\\n // Axios request\\n // Iterating on games\\n\\n if (numGames === 0) {\\n // No past games :(\\n activeGamesList.push(\\n <div className = \\\"noPast\\\">You are currently not part of any games</div>\\n );\\n }\\n\\n return activeGamesList;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28c825dcc638df2dfb7ea5bd41e2cde2\",\n \"score\": \"0.5895521\",\n \"text\": \"async function displayAllGames(){\\n //getting games from server\\n const gamesFromServer = await fetchApi.getGamesList();\\n \\n //turning the array of games from server in an array of game objects\\n const gamesList = gamesFromServer.map(gameServer => new Game(gameServer._id,\\n gameServer.title,\\n gameServer.imageUrl,\\n gameServer.description\\n )\\n )\\n \\n //creating an array of DOM objects\\n const domGamesArr = gamesList.map(game => game.displayGame());\\n //creating the container and appending each game (DOM object) to it\\n const container = document.querySelector('.container');\\n domGamesArr.forEach((domGame => container.appendChild(domGame)));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e6b8b7fd4814c68f694594f7f8f50f7\",\n \"score\": \"0.5891269\",\n \"text\": \"loadMujeresForGame () {\\n return http.get(\\\"auth/data/gameMujeres\\\", User.getToken());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2a6cd31ba2bf64551e8299ea77f1e03\",\n \"score\": \"0.58833456\",\n \"text\": \"function ListUsers(ws) {\\n var returnMessage = {}\\n returnMessage[\\\"type\\\"] = \\\"user-list\\\";\\n returnMessage[\\\"data\\\"] = [];\\n \\n switch (ws.gamemode) {\\n case \\\"server\\\":\\n wss.clients.forEach(function each(client) {\\n var user = {}\\n user[\\\"user-id\\\"] = client.userId;\\n user[\\\"user-name\\\"] = client.userName;\\n user[\\\"lobby-id\\\"] = client.lobbyId;\\n user[\\\"gamemode\\\"] = client.gamemode;\\n returnMessage.data.push(user);\\n });\\n break;\\n case \\\"player\\\" || \\\"spectator\\\":\\n if (ws.lobbyId === -1) {\\n SendUserError(ws, \\\"list-users\\\", \\\"not in a lobby\\\")\\n return;\\n }\\n for (var i=0; i<lobbies[lobbyId][\\\"users\\\"].length; i++) {\\n var user = {}\\n user[\\\"user-id\\\"] = lobbies[lobbyId][\\\"users\\\"][i].userId;\\n user[\\\"user-name\\\"] = lobbies[lobbyId][\\\"users\\\"][i].userName;\\n user[\\\"lobby-id\\\"] = lobbies[lobbyId][\\\"users\\\"][i].lobbyId;\\n user[\\\"gamemode\\\"] = lobbies[lobbyId][\\\"users\\\"][i].gamemode;\\n returnMessage.data.push(user);\\n }\\n break;\\n }\\n ws.send(JSON.stringify(returnMessage));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8c4811069e32cc506d0a145737e6b50\",\n \"score\": \"0.5876842\",\n \"text\": \"function STEAMSTAT() {\\n // Steam (Not currently in use)\\n var qryURL = {\\n //\\\"url\\\": \\\"https://cors-anywhere.herokuapp.com/steamspy.com/api.php?request=appdetails&appid=620\\\",\\n \\\"url\\\" : \\\"https://cors-any-m.herokuapp.com/api.steampowered.com/ISteamUserStats/GetGlobalStatsForGame/v0001/?format=xml&appid=17740&count=1&name[0]=global.map.emp_isle\\\",\\n \\\"async\\\": true,\\n \\\"crossDomain\\\": true,\\n \\\"method\\\": \\\"GET\\\"\\n }\\n\\n $.ajax(qryURL).done(function (steamInfo) {\\n console.log(steamInfo)\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d1af891e278c9e53bd1f7dd35e21294\",\n \"score\": \"0.5861581\",\n \"text\": \"async getGamesWithApplication ({ request, auth, response }) {\\n const user = auth.current.user\\n try {\\n const applics = await Application.all()\\n return response.json({\\n status: 'success',\\n data: applics\\n })\\n } catch (error) {\\n return response.status(400).json({\\n status: 'error',\\n message: 'Tivemos um problema. Por favor tente novamente.'\\n })\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"510b7266ec8957ce9ed6029a4e41c5f2\",\n \"score\": \"0.5860687\",\n \"text\": \"function getAndDisplayBoardGames() {\\n $.getJSON(GAMES_URL, function(result) {\\n \\tlet element = result.boardGames;\\n let boardGameElements = $(element).map(function(i) {\\n return makeBoardGame(\\n element[i].id, \\n element[i].name, \\n element[i].type, \\n element[i].players, \\n element[i].plays, \\n element[i].averageScore,\\n element[i].winsAndLosses\\n );\\n }).get();\\n\\t\\t$('.game-box').html(boardGameElements); \\n\\t\\t$('.js-bgame').velocity(\\\"transition.swoopIn\\\", { duration: 600, stagger: 100 })\\n }); \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef9c65b3f5216b662638cc1c2ace0b57\",\n \"score\": \"0.5854332\",\n \"text\": \"function activeGames(jwt) {\\n const activeGamesURL = BASE_URL + '/game/active_games'\\n return httpRequestJWT(activeGamesURL, 'get', jwt)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bb63f5bb1496ea3399498cd2ead8217\",\n \"score\": \"0.5834768\",\n \"text\": \"function gamesGET (req, res, next) {\\n\\n\\tvar page = 'games';\\n\\tvar title = 'Games';\\n\\n\\tif (req.session.user)\\n\\t\\tUser\\n\\t\\t.findOne({\\n\\t\\t\\temail : req.session.user.email\\n\\t\\t})\\n\\t\\t.exec(function (err, user) {\\n\\t\\t\\tif (err)\\n\\t\\t\\t\\tres.send(err);\\n\\t\\t\\telse\\n\\t\\t\\t\\tGame\\n\\t\\t\\t\\t.find({ \\n\\t\\t\\t\\t\\tid : {\\n\\t\\t\\t\\t\\t\\t$nin : [\\\"congkak\\\"]\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t})\\n\\t\\t\\t\\t.exec(function (err, games) {\\n\\t\\t\\t\\t\\tif (err)\\n\\t\\t\\t\\t\\t\\tres.send(err);\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tres.render(page, {\\n\\t\\t\\t\\t\\t\\t\\tuser : user,\\n\\t\\t\\t\\t\\t\\t\\ttitle : title,\\n\\t\\t\\t\\t\\t\\t\\tisGamesPage : true,\\n\\t\\t\\t\\t\\t\\t\\tgames : games,\\n\\t\\t\\t\\t\\t\\t\\tpartials : {\\n\\t\\t\\t\\t\\t\\t\\t\\theader : 'header',\\n\\t\\t\\t\\t\\t\\t\\t\\tfooter : 'footer'\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t});\\n\\t\\t});\\n\\telse\\n\\t\\tGame\\n\\t\\t.find({})\\n\\t\\t.exec(function (err, games) {\\n\\t\\t\\tif (err)\\n\\t\\t\\t\\tres.send(err);\\n\\t\\t\\telse\\n\\t\\t\\t\\tres.render(page, {\\n\\t\\t\\t\\t\\ttitle : title,\\n\\t\\t\\t\\t\\tisGamesPage : true,\\n\\t\\t\\t\\t\\tgames : games,\\n\\t\\t\\t\\t\\tpartials : {\\n\\t\\t\\t\\t\\t\\theader : 'header',\\n\\t\\t\\t\\t\\t\\tfooter : 'footer'\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t});\\n\\t\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12d5e1ce5783f1ba39791736ae0a119b\",\n \"score\": \"0.5834505\",\n \"text\": \"function getMatchList() {\\n if (\\\"caches\\\" in window) {\\n caches.match(ENDPOINT_EPL + \\\"matches\\\").then(function (response) {\\n if (response) {\\n response.json().then(function (data) {\\n showMatchList(data);\\n })\\n }\\n })\\n }\\n\\n fetchAPI(ENDPOINT_EPL + \\\"matches\\\")\\n .then(data => {\\n showMatchList(data);\\n })\\n .catch(error)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47d4822113fda510e9df7a3149860697\",\n \"score\": \"0.5833585\",\n \"text\": \"async function getGamesFromUser(username)\\n{\\n // Get the user\\n var user = await get(username);\\n\\n // Return the games\\n return gamesdb.idsToGames(user.games);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97898c0caa621b34afa6a6f6b401a562\",\n \"score\": \"0.58261156\",\n \"text\": \"async function getGames(season) {\\n try {\\n const response = await fetch(`https://hasses-sega-gubbar.herokuapp.com/games/${season}`, {});\\n const data = await response.json();\\n setSeasonGames(data)\\n } catch {\\n console.log(\\\"Error\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"feb22e93e79331bf7bd810a4c7cde6f6\",\n \"score\": \"0.58139956\",\n \"text\": \"function getAvailableGames() {\\n ticTacToeData\\n .getAvailableGames(auth.access_token())\\n .then(function (data) {\\n $scope.availableGames = data;\\n $scope.allMyGames = $scope.allMyGames.concat(data);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"38488de78217a2f81c97e453763f7908\",\n \"score\": \"0.5806788\",\n \"text\": \"async function getAllTeams(){\\n return await season_utils.getTeamsBySeasonId(18334);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c076096f8113896c91172badb90a4c9\",\n \"score\": \"0.58048105\",\n \"text\": \"function getListOfGames() {\\r\\n var dropdowns = document.getElementsByClassName(\\\"dropdown-content\\\");\\r\\n multiplayer.server.list().done(function (result) {\\r\\n if (result) {\\r\\n var list = document.getElementById(\\\"listDrpdwn\\\");\\r\\n for (var i = 0; i < result.length; i++) {\\r\\n if (!isContains(list, result[i])) {\\r\\n var op = document.createElement('option');\\r\\n op.value = result[i];\\r\\n op.text = result[i];\\r\\n list.appendChild(op);\\r\\n }\\r\\n }\\r\\n }\\r\\n });\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4210e5dd2126c35fd6ce7bb823ed9abf\",\n \"score\": \"0.57855904\",\n \"text\": \"function _handleRequestGames(data) {\\r\\n\\tconsole.log('REQUESTED GAMES:', data.toString().trim());\\r\\n\\tstate = SELECT_GAME;\\r\\n\\r\\n\\tauthServer.write('N\\\\t' + game + '\\\\n');\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cef5b57e2563666e978ee0369dcc50b4\",\n \"score\": \"0.5781876\",\n \"text\": \"function getAllGamesListed(){\\n console.log(\\\"getting all the games in the database for the select list....\\\");\\n var url = \\\"/getGames\\\";\\n callAjax(url, handleGamesListed);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d0f05f7f7a344ff00d08bb4d8e41c94\",\n \"score\": \"0.57777464\",\n \"text\": \"function displayGame(gameName, game) {\\n var gameUrl = 'http://boardgamegeek.com/boardgame/';\\n var userUrl = 'http://boardgamegeek.com/user/';\\n var gameClass = 'game-' + game.id;\\n var liGame;\\n \\n // If game doesn't exist in list, create it\\n if($('.' + gameClass).length)\\n {\\n liGame = $('.' + gameClass);\\n }\\n else\\n {\\n // Creates hyperlink for game\\n var gameAnchorString = $('<a>', {href:gameUrl + game.id})\\n .append(gameName)\\n .prop('outerHTML');\\n \\n // Creates list item for game\\n liGame = $('<li>', {class:gameClass}).append(gameAnchorString);\\n }\\n \\n // Creates <span> of comma-separated hyperlinks for each user\\n var userAnchorsString = \\n $.map(\\n getUnique(game.owners)\\n .filter(function(item) {\\n return $('.' + gameClass + ' .user-list a').length == 0 || \\n $('.' + gameClass + ' .user-list a:not(:contains(\\\"' + item + '\\\"))').length > 0;\\n }),\\n function(item, index) {\\n return $('<a>', {href:userUrl + item})\\n .append(item)\\n .prop('outerHTML')\\n }\\n )\\n .sort()\\n .join(', ');\\n var spanUserList = $('<span>', {'class':'user-list'}).append(userAnchorsString);\\n liGame.append(spanUserList);\\n \\n $('#olGamesAvailable').append(liGame);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fcb86891ebdc8066fb0d72c729229d11\",\n \"score\": \"0.5769379\",\n \"text\": \"function sendSearch(){\\r\\n let xhttp = new XMLHttpRequest();\\r\\n xhttp.onreadystatechange = function() {\\r\\n if (this.readyState == 4 && this.status == 200) {\\r\\n gamesArr= JSON.parse(this.responseText); //this should be an array now?\\r\\n //update the currentTurn so that we start at the end of the games\\r\\n if(gamesArr.length !== 0){\\r\\n currentTurn = gamesArr[0].turns.length - 1;\\r\\n }\\r\\n displayCurrGame();\\r\\n console.log(gamesArr);\\r\\n }\\r\\n };\\r\\n console.log(getQuery());\\r\\n xhttp.open(\\\"GET\\\", getQuery(), true); //I need the user object\\r\\n xhttp.send();\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8247a994d8113675ab8e52117c1e87cb\",\n \"score\": \"0.57683754\",\n \"text\": \"function getMatches (gameArray) {\\n\\tlet num = 0;\\n\\tgameArray.forEach(function (id) {\\n\\t\\t$.ajax({\\n\\t\\t\\turl: RIOT_ENDPOINT + `/lol/match/v3/matches/${id}?api_key=${apiKey}`,\\n\\t\\t\\ttype: 'GET',\\n\\t\\t\\tdataType: 'json',\\n\\t\\t\\tsuccess: function (e) {\\n\\t\\t\\t\\tnum++\\n\\t\\t\\t\\trenderScreen(e, num)\\n\\t\\t\\t}\\n\\t\\t})\\n\\t})\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c91c775247510b35c0fa8a89a52841d\",\n \"score\": \"0.5767244\",\n \"text\": \"function getJoinedGames() {\\n ticTacToeData\\n .getJoinedGames(auth.access_token())\\n .then(function (data) {\\n $scope.joinedGames = data;\\n $scope.allMyGames = $scope.allMyGames.concat(data);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb1505441ecf472870290e730b0e4838\",\n \"score\": \"0.5763073\",\n \"text\": \"getGameData () {\\n let siteIdIndex = window.location.search('games/');\\n let gameId = window.location.slice(siteIdIndex + 6);\\n fetch(API_URL.games + `/${gameId}`, {\\n headers: {\\n 'Authorization': `Bearer ${this.props.authToken}`\\n }\\n })\\n .then(res=> res.json())\\n .then(data=> {\\n this.props.dispatch(loadGameState(data));\\n })\\n .catch(err=> {\\n console.log(JSON.stringify(err));\\n //display in status component, don't redirect\\n //this.props.dispatch(updateGameStatusError(err))\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02de2927a86fb147091e0f6aac5821e4\",\n \"score\": \"0.5762754\",\n \"text\": \"function getUsersGames(req, res, next) {\\n Games.findAll()\\n .then((data) => {\\n const games = [];\\n data.forEach((g) => {\\n const game = g.get({ plain: true });\\n if (game.user_ids.indexOf(Number(req.params.user_id)) > -1)\\n games.push(game);\\n });\\n res.status(constants.http_ok)\\n .json({\\n status: 'success',\\n content: games,\\n message: 'Got all games'\\n });\\n })\\n .catch((err) => {\\n res.status(constants.http_bad_request)\\n .json({\\n status: 'failure',\\n content: err.message,\\n message: 'Failed to get user\\\\'s games'\\n });\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05cb23289769066d9030ef8039607e1d\",\n \"score\": \"0.575588\",\n \"text\": \"function getShowAllTeams() {\\n if ('caches' in window) {\\n caches.match(ENDPOINT_SHOW_ALL_TEAMS).then(function (response) {\\n if (response) {\\n response.json().then((data) => getViewTeamPremierLeague(data));\\n }\\n });\\n }\\n\\n fetchAPI(ENDPOINT_SHOW_ALL_TEAMS)\\n .then(status)\\n .then(json)\\n .then(data => getViewTeamPremierLeague(data))\\n .catch(error);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"013865ce484f07440075c9c69f6b142f\",\n \"score\": \"0.57332647\",\n \"text\": \"getGameStatus() {\\n this.setMethod('GET');\\n this.setPlayerId();\\n return this.getApiResult(`${Config.PLAY_API}/${this.playerId}/status`);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abe5cab94466895aea9aaa3b2e2eb63d\",\n \"score\": \"0.57321054\",\n \"text\": \"getPastGames() {\\n\\n // TODO: AXIOS Requeset to get information about old games for this user\\n\\n let pastGamesList = [];\\n\\n let numGames = 0;\\n\\n // Axios request\\n // Iterating on games\\n\\n if (numGames === 0) {\\n // No past games :(\\n pastGamesList.push(\\n <div className = \\\"noPast\\\">You have not participated in any games</div>\\n );\\n }\\n\\n return pastGamesList;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f86044db945a4550ea1bc1650265702\",\n \"score\": \"0.5715093\",\n \"text\": \"function fetchSuggestedGames(game) {\\r\\n return fetch(\\\"/api/games\\\", {\\r\\n method: \\\"post\\\",\\r\\n body:\\r\\n \\\"fields name, summary, cover; where id=(\\\" +\\r\\n game.similar_games.join(\\\", \\\") +\\r\\n \\\");\\\",\\r\\n headers: {\\r\\n \\\"Content-Type\\\": \\\"text/plain\\\"\\r\\n }\\r\\n })\\r\\n .then(\\r\\n response => response.json(),\\r\\n\\r\\n error => console.log(\\\"An error occurred.\\\", error)\\r\\n )\\r\\n .then(json => {\\r\\n return json;\\r\\n });\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15d30545c3fb63c18a8792ef9efd4ccc\",\n \"score\": \"0.5704835\",\n \"text\": \"function fetchGame(gameUrl) {\\n switch(gameUrl) {\\n case 'stryk':\\n return fetch(URL_STRYKTIPSET)\\n .then(result => result.json())\\n .then(data => parseGameData_(data)) \\n\\n break;\\n case 'europa':\\n return fetch(URL_EUROPATIPSET)\\n .then(result => result.json())\\n .then(data => parseGameData_(data)) \\n break;\\n case 'topp':\\n return fetch(URL_TOPPTIPSET)\\n .then(result => result.json())\\n .then(data => parseGameData_(data)) \\n break;\\n default: console.warn('Wrong API call');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2803d0125e3647a08880d2d30f077745\",\n \"score\": \"0.5699265\",\n \"text\": \"async function getSteam(){\\n try {\\n //get the Json data from the steam api\\n const response = await fetch(api_url);\\n const data = await response.json();\\n console.log(data);\\n // aswell as casting it into html on the page\\n document.getElementById(\\\"imaginedude\\\").innerHTML = `\\n <h1 class=\\\"sameColor text-center\\\"> Recent games played</h1>\\n ${data.response.games.map(gamelogoTemplate).join('')}`\\n\\n } catch (error) {\\n document.getElementById(\\\"imaginedude\\\").innerHTML =`API failed to load please try again later`;\\n console.log(\\\"steam no work\\\");\\n console.log(error);\\n }\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc84805abbcae405362808e4a0242945\",\n \"score\": \"0.5696814\",\n \"text\": \"function loadGame() {\\n\\ttry {\\n\\t\\tvar gameArray = [];\\n\\t\\t\\n\\n\\t\\tfor (var i = 0; i < gameList.length; i++) {\\n\\t\\t\\tif (gameList[i].Notification == 1) {\\n\\n\\t\\t\\t\\t//Ti.API.info('gameIcons', \\\"/images/gameIcons/\\\" + \\\"C\\\" + gameList[i].CTestID + \\\".png\\\");\\n\\n\\t\\t\\t\\tgameArray.push({\\n\\t\\t\\t\\t\\ttemplate : \\\"gameListTemplate\\\",\\n\\n\\t\\t\\t\\t\\tgameNameLabel : {\\n\\t\\t\\t\\t\\t\\ttext : gameList[i].CTestName\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\ticonImage : {\\n\\t\\t\\t\\t\\t\\timage : \\\"/images/gameIcons/\\\" + \\\"C\\\" + gameList[i].CTestID + \\\".png\\\"\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t$.lstSection.setItems(gameArray);\\n\\n\\t} catch(ex) {\\n\\t\\tcommonFunctions.handleException(\\\"welcomeContentScreen\\\", \\\"loadGame\\\", ex);\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25159e415be7f29dae39911fe20302ab\",\n \"score\": \"0.56882066\",\n \"text\": \"async function getAllGameInfo(game){\\n const res = await fetch(\\\"/api/game/info\\\",{\\n method:\\\"POST\\\",\\n headers: { \\\"Content-Type\\\": \\\"application/json\\\" },\\n body: JSON.stringify({\\n info:{\\n game: game,\\n admin: adminId\\n }\\n })\\n });\\n return res.json();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77c0b90e0a16bfe9f981d9128da26490\",\n \"score\": \"0.56851804\",\n \"text\": \"function getGameID (callback){\\n console.log('enter getGameID');\\n \\n // steam api url\\n var url1 ='https://api.steampowered.com/ISteamApps/GetAppList/v2';\\n var tempData = '';\\n var tempdata1;\\n \\n // calls the steam url and processes\\n https.get(url1, function(response) {\\n \\n // while response event is data, add all incoming data to tempData variable\\n response.on(\\\"data\\\", function (data) {\\n tempData += data;\\n });\\n \\n // on end event parse json and add data to appData variable\\n response.on(\\\"end\\\", function() {\\n tempdata1 = JSON.parse(tempData);\\n appData = tempdata1.applist.apps;\\n console.log('exit getGameID');\\n //console.log(appData.length);\\n callback();\\n //msg.reply('App ID : ' + info.appid + '\\\\nGame Name : ' +info.name);\\n });\\n });\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03dcd2e7cfb8fe00397b82b0124f77dc\",\n \"score\": \"0.5680731\",\n \"text\": \"function getGames(f) {\\n request({url: \\\"/lobby-games\\\", method: \\\"GET\\\"})\\n .then(data => {\\n console.log(\\\"success, updating games\\\");\\n f(data);\\n })\\n .catch(error => {\\n console.log(\\\"error: \\\" + error);\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3ce02b6287bf28e1577bd15e20aeab9\",\n \"score\": \"0.56801754\",\n \"text\": \"function getPlayerList(){\\n var db = getPlayersDatabase();\\n var result = new Array()\\n\\n try {\\n db.transaction(function(tx) {\\n var rs = tx.executeSql('SELECT * FROM players_storage');\\n for(var i = 0; i < rs.rows.length; i++) {\\n var dbItem = rs.rows.item(i);\\n result[i] = {\\n 'name': dbItem.name,\\n 'wins': dbItem.wins,\\n 'loses': dbItem.loses\\n }\\n }\\n })\\n } catch(e) {\\n return []\\n }\\n return result;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f5f2090f1b6cd09576f50d2ca9a9518\",\n \"score\": \"0.5676075\",\n \"text\": \"async function requestGameState() {\\n await fetch(`/api/game/state/${roomId}`).then(res => res.json());\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6bcedfb43aa328efd3ed4b7026c3e9d5\",\n \"score\": \"0.5671723\",\n \"text\": \"function getRecentGames(summoner, callback)\\n{\\n // Summary info\\n irelia.getRecentGamesBySummonerId(summoner.region, summoner.id, function (err, summonerRecentGames) {\\n if(err) {\\n // Play catch\\n callback({status: 'error', data: err});\\n console.log(err);\\n } else {\\n // Play catch\\n //console.log(summonerRecentGames.games);\\n callback({status: 'success', data: summonerRecentGames});\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e3a265bc2e6fe9896b6f31f5fd79902\",\n \"score\": \"0.5667258\",\n \"text\": \"function getStates(game) {\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"416d26d165cc4dd47ae5b61ac8839848\",\n \"score\": \"0.5665826\",\n \"text\": \"getGameInfos() {\\n return game_infos;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c0afca19c06e559ddf15cb80d0f6115\",\n \"score\": \"0.56647044\",\n \"text\": \"function getGame(gameName) {\\r\\n return fetch('api/games', {\\r\\n method: \\\"post\\\",\\r\\n body: 'fields name, similar_games; where name ~\\\"' + gameName+ '\\\";',\\r\\n headers: {\\r\\n \\\"Content-Type\\\": \\\"text/plain\\\"\\r\\n }\\r\\n })\\r\\n .then(\\r\\n response => response.json(),\\r\\n\\r\\n error => console.log(\\\"An error occurred.\\\", error)\\r\\n )\\r\\n .then(json => {\\r\\n return json[0];\\r\\n });\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"393b581bce59b16c958dd25fe37b90d5\",\n \"score\": \"0.5662635\",\n \"text\": \"function get_games_current() {\\n var dataObj = {\\n \\\"content\\\" : [ {\\n \\\"session_id\\\" : get_cookie()\\n } ]\\n };\\n call_server('games_current', dataObj);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b36ccbe6f2f2ab7a7cfc724b20fabaf3\",\n \"score\": \"0.5657\",\n \"text\": \"function loadGames(){\\n\\tvar request = loadViaAjax(\\\"AllGames.json\\\");\\n\\trequest.done(function(data) {\\n\\t\\tGames = data;\\n\\t\\tcreateGameCategories();\\n\\t\\tcreateGameCategoryAll();\\n\\t});\\n\\treturn request;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0f3f080e08c441e9dd6e6606bcaaf80\",\n \"score\": \"0.56551373\",\n \"text\": \"function getLeagueList() {\\n return League.find({}, \\\"name\\\").exec();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"721ca0a581c3664a212d031ee3d9a51a\",\n \"score\": \"0.56337976\",\n \"text\": \"async function getStat() {\\n const responseFromServer = await fetch('/game-data');\\n game_data = await responseFromServer.json();\\n \\n displayPrompt();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8f1b04474b89771623aee22e3548b5b\",\n \"score\": \"0.56310344\",\n \"text\": \"function getTeams() {\\n\\tvar teams = [];\\n\\tajax.controllers.Application.getTeams().ajax({\\n\\t\\tasync: false,\\n\\t success: function(data) {\\n\\t \\tteams = data;\\n\\t },\\n\\t\\terror: function(data) {\\n\\t\\t\\talert(\\\"Erro ao obter os times\\\");\\n\\t\\t}\\n\\t});\\n\\t\\n\\treturn teams;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f56ec583256cc32809e60113888aaa4\",\n \"score\": \"0.562757\",\n \"text\": \"function getProviderPlaylists() {\\n let playlistsRequest = new Request(`http://${PROXY_SERVER}/playlists/`);\\n let headers = playlistsRequest.headers;\\n headers.append('X-Audiowings-DeviceId', MAC_ADDRESS);\\n return fetch(playlistsRequest)\\n .then(status)\\n .then(response => response.json())\\n .catch(error => console.log(':( Request failed', error));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbdd5cba66e198ebf5c7fea2c3c67633\",\n \"score\": \"0.5625745\",\n \"text\": \"getBotsList() {\\n let bot_status = {};\\n bot_status.count = utils.objectLength(this.bots);\\n let bots_list = [];\\n for (const idx in this.bots) {\\n let url = new URL(this.bots[idx].page.url());\\n let room_url = url.origin + url.pathname;\\n bots_list.push({\\n uuid: this.bots[idx].uuid,\\n name: this.bots[idx].name,\\n room_url: room_url,\\n avatar_id: this.bots[idx].avatar_id,\\n });\\n }\\n bot_status.bots = bots_list;\\n return utils.buildJsonResponse({\\n command: \\\"bots list\\\",\\n success: true,\\n message: \\\"Ok\\\",\\n data: bots_list,\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c6775debc9373329353b9deef6cd4e3\",\n \"score\": \"0.56244206\",\n \"text\": \"function getAwaitedGames() {\\n let xmlContent = \\\"\\\";\\n fetch(\\\"https://gamezone.ninja/Resources/games.xml\\\").then((response) => {\\n response.text().then((xml) => {\\n xmlContent = xml;\\n let parser = new DOMParser();\\n let xmlDOM = parser.parseFromString(xmlContent, \\\"application/xml\\\");\\n let games = xmlDOM.querySelectorAll(\\\"game\\\");\\n var xmlContent2 = \\\"\\\";\\n\\n xmlContent2 = assembleContent(\\\"awaited\\\", xmlContent2, games);\\n document.getElementById(\\\"games-game-list\\\").innerHTML = xmlContent2;\\n });\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6879161fade928b7706969b393354165\",\n \"score\": \"0.5611254\",\n \"text\": \"async getPlaylists() {\\n const accessToken = this.accessToken || this.getAccessToken();\\n const headers = { Authorization: `Bearer ${accessToken}` };\\n const userID = await this.getUserID();\\n //GET method\\n try {\\n const response = await fetch(\\n 'https://api.spotify.com/v1/me/playlists?limit=50',\\n { headers: headers }\\n );\\n if (response.ok) {\\n const jsonResponse = await response.json();\\n if (jsonResponse && jsonResponse !== {}) {\\n return jsonResponse.items\\n .filter(playlist => playlist.owner.id === userID)\\n .map(playlist => {\\n return {\\n id: playlist.id,\\n name: playlist.name,\\n tracksURL: playlist.tracks.href,\\n image: playlist.images[1],\\n uri: playlist.uri,\\n };\\n });\\n }\\n } else {\\n throw new Error('Request to GET Playlists Failed!');\\n }\\n } catch (err) {\\n this.authFailed();\\n console.log(err);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6162655fb716a2bb71e1e3b2a25c536c\",\n \"score\": \"0.5599031\",\n \"text\": \"function getStreams(gameIDs, token, cursor = \\\"\\\") {\\n return rp.get(\\\"https://api.twitch.tv/helix/streams\\\", {\\n headers: {\\n \\\"Client-ID\\\": config[\\\"twitch-client-id\\\"],\\n \\\"Authorization\\\": \\\"Bearer \\\" + token,\\n },\\n qs: {\\n \\\"game_id\\\": gameIDs,\\n \\\"first\\\": 99,\\n \\\"type\\\": 'live',\\n \\\"after\\\": cursor\\n },\\n json: true,\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bcff9ab21855613aecf8d9cf3786783\",\n \"score\": \"0.5593518\",\n \"text\": \"function getGameSessions() {\\n $.ajax({\\n url: SERVER_HOST + \\\"api/gamesession/list\\\",\\n type: \\\"GET\\\",\\n success: function (gameSessions) {\\n $(GAME_SESSIONS_ID).empty();\\n\\n let tableHeaders = '<tr><th>Название сессии</th><th>Количество игроков</th><th></th><th></th></tr>';\\n $(GAME_SESSIONS_ID).append(tableHeaders);\\n\\n for (let i = 0; i < gameSessions.length; i++) {\\n appendGameSession(gameSessions[i]);\\n }\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1d7ef542b99f2af79dbce01771b37fd\",\n \"score\": \"0.55812955\",\n \"text\": \"function getTopRatedGames() {\\n let xmlContent = \\\"\\\";\\n fetch(\\\"https://gamezone.ninja/Resources/games.xml\\\").then((response) => {\\n response.text().then((xml) => {\\n xmlContent = xml;\\n let parser = new DOMParser();\\n let xmlDOM = parser.parseFromString(xmlContent, \\\"application/xml\\\");\\n let games = xmlDOM.querySelectorAll(\\\"game\\\");\\n var xmlContent2 = \\\"\\\";\\n\\n xmlContent2 = assembleContent(\\\"top\\\", xmlContent2, games);\\n document.getElementById(\\\"games-game-list\\\").innerHTML = xmlContent2;\\n });\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b5df43e985a1e4bcc41d6a48e465dff\",\n \"score\": \"0.5566806\",\n \"text\": \"async function getGame(req, res) {\\n const game = await Game.findByIdAndUser(req.params.id, req.user);\\n\\n res.json(game.outputForUser(req.user._id));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2510c7e8dd4a54c81324e1f05550e6c3\",\n \"score\": \"0.5564799\",\n \"text\": \"function getGame(name) {\\n let xmlContent = \\\"\\\";\\n fetch(\\\"https://gamezone.ninja/Resources/games.xml\\\").then((response) => {\\n response.text().then((xml) => {\\n xmlContent = xml;\\n let parser = new DOMParser();\\n let xmlDOM = parser.parseFromString(xmlContent, \\\"application/xml\\\");\\n let games = xmlDOM.querySelectorAll(\\\"game\\\");\\n var xmlContent2 = \\\"\\\";\\n\\n games.forEach((gameXmlNode) => {\\n if (gameXmlNode.children[0].innerHTML.includes(name)) {\\n xmlContent2 +=\\n \\\"<div class='category'>\\\" +\\n \\\" Category: \\\" +\\n gameXmlNode.children[8].innerHTML +\\n \\\"</div>\\\" +\\n \\\"<img class='gamePic' src=\\\" +\\n gameXmlNode.children[2].innerHTML +\\n \\\" alt=''>\\\" +\\n \\\"<div class='publisher'>\\\" +\\n \\\"Publisher: \\\" +\\n gameXmlNode.children[6].innerHTML +\\n \\\"</div>\\\" +\\n \\\"<div class='release'>\\\" +\\n \\\"Release Date: \\\" +\\n gameXmlNode.children[4].innerHTML +\\n \\\"</div>\\\" +\\n \\\"<div class='rating'>\\\" +\\n \\\"Rating: \\\" +\\n gameXmlNode.children[7].innerHTML +\\n \\\"</div>\\\" +\\n \\\"<div class='description'>\\\" +\\n \\\"<h3>Description</h3> <br/>\\\" +\\n gameXmlNode.children[1].innerHTML +\\n \\\"</div>\\\" +\\n \\\"<iframe width='1200' height='700' src='\\\" +\\n gameXmlNode.children[3].innerHTML +\\n \\\"' frameborder='0' allow='accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture' allowfullscreen></iframe>\\\" +\\n \\\"<div class='review'>\\\" +\\n \\\"<h3>Review</h3> <br/>\\\" +\\n gameXmlNode.children[5].innerHTML +\\n \\\"</div>\\\";\\n }\\n });\\n document.getElementById(\\\"games-game-list\\\").innerHTML = xmlContent2;\\n });\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"205bd4326a36cabcb3acb5da405ba743\",\n \"score\": \"0.5551379\",\n \"text\": \"function getSports() {\\n hideButtonsAndText();\\n let url = INDEX_URL + \\\"sport=list\\\";\\n fetch(url, {mode: 'cors'})\\n .then(checkStatus)\\n .then(showSports)\\n .catch(printError);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f226f04871e47a9a1664986fccb2763\",\n \"score\": \"0.5551213\",\n \"text\": \"function renderGames() {\\n var rows = document.getElementsByClassName(\\\"Tst-table Table\\\")[0].rows;\\n var playerInfo;\\n\\n //go through rows of table\\n for (var i = 1; i < rows.length; i++) {\\n //grab all text from the <td> that includes the team/player name\\n playerInfo = rows[i].cells[1].innerText.split(\\\" \\\");\\n teamsString += getTeamFromInfo(playerInfo) + \\\",\\\";\\n }\\n //console.log(teamsString)\\n var dateString = getFormattedDate();\\n var leagueIDString = \\\"leagueID=\\\" + getLeagueID();\\n //console.log(\\\"dateString = \\\" + dateString);\\n var url =\\n \\\"https://www.sportswzrd.com/gamesremaining/?pageName=transactionTrends&\\\" +\\n teamsString +\\n \\\"&format=json&date=\\\" +\\n dateString +\\n \\\"&\\\" +\\n leagueIDString;\\n //console.log(\\\"before request\\\");\\n chrome.runtime.sendMessage(\\n {\\n endpoint: \\\"gamesremaining\\\",\\n date: dateString,\\n leagueID: getLeagueID(),\\n teams: teamsString,\\n pageName: \\\"yTransactionTrends\\\"\\n },\\n function(response) {\\n addGames(response.data);\\n }\\n );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"326baa0c05d4d7e1cb1eaa3413ffdab0\",\n \"score\": \"0.5539648\",\n \"text\": \"async function getAllGroups() {\\n try {\\n // This return the id [g:1:${id}]\\n const { response } = await doAjax({\\n type: \\\"GET\\\",\\n url: \\\"https://api.steampowered.com/ISteamUser/GetUserGroupList/v1/\\\",\\n data: {\\n key: SteamApiKey,\\n steamid: steamId,\\n },\\n dataType: \\\"json\\\",\\n });\\n\\n return response.groups.map(function (groups) {\\n return groups.gid;\\n });\\n } catch (error) {\\n return Promise.reject(error);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e4e0a33a7ba181be839a1feedd5b17d\",\n \"score\": \"0.5522911\",\n \"text\": \"getFeaturedPlayers(){\\n return client({\\n method: 'GET',\\n path: PLAYER_SEARCH_ROOT+\\\"getAllByOrderByEloDesc\\\",\\n params: {\\n page: 0,\\n size: 3\\n }\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e60ef9b686d39d9588ce7c03aef76b26\",\n \"score\": \"0.55207723\",\n \"text\": \"function generateGamesList(game) {\\n $('.js-gameUl').html('');\\n $.each(game, function(index, value) { \\n let gameElement = generateGameElement(value);\\n $('.js-gameUl').append(gameElement);\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"954f53a8e95f4f20ff029c7d58c28be6\",\n \"score\": \"0.551993\",\n \"text\": \"async getMatchListing() {\\n console.log(\\\"Entering getMatchListing()\\\");\\n // Defining rest-api endpoint for querying state data\\n let stateRequest = 'http://rest-api:8008/state?address=' + addressDeleted;\\n let stateResponse = await fetch(stateRequest);\\n let stateJSON = await stateResponse.json();\\n return stateJSON;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13bd0f85dcd57f4718abad33f359ed9d\",\n \"score\": \"0.5513846\",\n \"text\": \"function getMatches() {\\n if (\\\"caches\\\" in window) {\\n caches.match(`${BASE_URL}competitions/2015/teams`).then((res) => {\\n if (res) {\\n res.json().then((data) => {\\n renderCardList(data);\\n });\\n }\\n });\\n }\\n\\n fetch(`${BASE_URL}competitions/2015/teams`, header)\\n .then(status)\\n .then(json)\\n .then((data) => {\\n renderCardList(data);\\n })\\n .catch(error);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ad0b21865087f0d280e0954e55bfaff\",\n \"score\": \"0.55127376\",\n \"text\": \"getPlayers(){\\n let players = fetch(API_URL + '/api/players',\\n {method: 'GET'}).then((response) => response.json())\\n return players;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2333eeeed2cfb95886d8b7495cc8d548\",\n \"score\": \"0.5506753\",\n \"text\": \"function getPreviousGames() {\\n\\t$.getJSON(\\\"/games\\\").done(function(response){\\n\\t\\tconsole.log(response.games);\\n\\t\\tshowGames(response.games);\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84c61fd96e48eee0e45dfcb82cb91919\",\n \"score\": \"0.5501252\",\n \"text\": \"function getData() {\\nvar url1 = 'http://localhost:8080/api/game_view/' + myParam\\n fetch(url1)\\n .then(response => response.json())\\n .then(response => {\\n let slvGames = response\\n console.log(response)\\n main(slvGames)\\n })\\n .catch(err => console.log(err));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b130870f33f068b54fd18918daad368\",\n \"score\": \"0.54991794\",\n \"text\": \"function printGames(game) {\\n let queryUrl = `https://rawg.io/api/games?search=${game}&platforms=23`;\\n $.ajax({\\n url: queryUrl,\\n method: 'GET'\\n }).then(function (response) {\\n console.log(response);\\n let p = $('#results');\\n p.empty();\\n $('#info').empty();\\n let array = response.results;\\n for (let i = 0; i < array.length; i++) {\\n let span = $('<span>');\\n let name = $('<div>').text(array[i].name).attr('class','name');\\n let image = $('<img>').attr({\\n 'class': 'image thumbnail',\\n 'src': array[i].background_image,\\n 'alt': array[i].name\\n });\\n span.append(name, image);\\n p.append(span);\\n }\\n listOfResults = response.results;\\n })\\n $('.boxdescription').css('height', '350px');\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"142be8aa7e3c5bf08109ce406f2b1f29\",\n \"score\": \"0.5495462\",\n \"text\": \"function loadTeams() {\\n doAjax(TEAM_URL + '/get').then(data => {\\n data.forEach(team => {\\n console.log('Team ->', team.name);\\n });\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21ef7dc53c3b20993ffabcae7f6e12a3\",\n \"score\": \"0.54927665\",\n \"text\": \"function get_game_overview(game_id) {\\n view_game_id = game_id;\\n var dataObj = {\\n \\\"content\\\" : [ {\\n \\\"session_id\\\" : get_cookie()\\n }, {\\n \\\"game_id\\\" : game_id\\n } ]\\n };\\n call_server('game_overview', dataObj);\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":87,"cells":{"query_id":{"kind":"string","value":"a1dc34970fec7ab79a35de215a33066d"},"query":{"kind":"string","value":"This function will redirect you to a page where you can edit this person's profile page."},"positive_passages":{"kind":"list like","value":[{"docid":"d3f9d0150e96509c6b74a72095074dc2","score":"0.0","text":"function handleEdit(e) {\n e.preventDefault();\n setEdited(true);\n \n }","title":""}],"string":"[\n {\n \"docid\": \"d3f9d0150e96509c6b74a72095074dc2\",\n \"score\": \"0.0\",\n \"text\": \"function handleEdit(e) {\\n e.preventDefault();\\n setEdited(true);\\n \\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"611e91bb3036b274e8968d9efe39942c","score":"0.80398744","text":"function goEditProfile() {\n var dirPath = dirname(location.href);\n var fullPath = dirPath + \"/editprofile.html\";\n window.location = fullPath;\n}","title":""},{"docid":"b437445df49582a8c23cfc41c76277ca","score":"0.78915787","text":"editProfie() {\n window.location.replace('http://localhost:3000/EditProfile');\n }","title":""},{"docid":"885ec5432b5ddaf069cdeb05e30cb9ac","score":"0.71922606","text":"function goToProfile(){\n\tvar text = Parse.User.current().id;\n\twindow.location.href = \"../profile.html?\" + text;\n}","title":""},{"docid":"30793aca92e5361ccea66325cd812088","score":"0.714225","text":"function handelEdit (){\n let uid = this.id ?? \"\";\n window.location.href=`${USER_ADD_FORM_URL}?uid=${uid}`;\n}","title":""},{"docid":"31e80f3476318fa7ffbbaf105254f570","score":"0.709794","text":"function toCorppassProfileLandingPage() {\n\twindow.location = corppassProfileLandingPage;\n}","title":""},{"docid":"aab622a35255405fddba9b15aabec9f1","score":"0.6970729","text":"function redirect() {\n // this.html(\"Redirecting to my profile...\");\n window.location = \"/profile/\";\n}","title":""},{"docid":"ec8ef0c240ad785477835e75ecf2bbc1","score":"0.6859175","text":"function _editBtn() {\n $state.go(\"profileEditor\");\n }","title":""},{"docid":"de90bc3c2b8930d32a7d4aa9a77459d3","score":"0.6756414","text":"function editUser() {\n $location.path('/user/' + vm.user.id);\n }","title":""},{"docid":"c7dc2fb491cf5657b51002f97dcaaedb","score":"0.674889","text":"function redirect() {\n $location.path('/profile');\n }","title":""},{"docid":"2c5d7208c44d0a6df8aa50dc14f2e093","score":"0.66651034","text":"function redirectToWidgetEdit() {\n res.redirect(\"/assignment/#/user/\" + userId + \"/website/\" + websiteId + \"/page/\" + pageId + \"/widget/\" + widgetId);\n }","title":""},{"docid":"a6ba59be037a2fc5c58be1c6013e782f","score":"0.6597479","text":"function editProfile(response, user, navbar) {\r\n\r\n\tvar profile = builder.editProfile(user);\r\n\r\n\tvar head = builder.head(\"Profile\");\r\n\tvar body = builder.body(navbar, profile);\r\n\tvar page = builder.page(head, body);\r\n\r\n\tmisc.buildResponse(response, page);\r\n\r\n}","title":""},{"docid":"9959396ffaac9185a5995363bce8d9c5","score":"0.65849245","text":"Goedit() {\n this.presentToast('goedit');\n let navigationExtras = {\n state: {\n dataUser: this.dataUser\n }\n };\n this.router.navigate(['asso-edit-profile'], navigationExtras);\n }","title":""},{"docid":"ca40d58032067fe2b73ab07fc5100f43","score":"0.6433912","text":"function profileClick(accountID) {\n $(\"#profile-new\").click(function (event) {\n window.location.href = \"/gwa/pages/profile.html?accountID=\" + accountID;\n })\n }","title":""},{"docid":"c40027d2d206248f8ecdc3da072d9920","score":"0.6412225","text":"function show (err, req, res) {\n req.model.load('profile', req)\n req.model.load('whoshiring')\n req.model.end(function (er, m) {\n var profile = m.profile\n var statusCode = 200\n if (er || !profile || !profile.name) {\n req.session.set('done', req.url)\n return res.redirect('/login')\n }\n if (er || profile.error) {\n return res.error(er || profile.error)\n }\n var locals = {\n profile: profile,\n hiring: m.whoshiring,\n fields: profile.fields,\n title: 'Edit profile',\n error: err\n }\n\n if (err) {\n statusCode = 400\n }\n\n res.template(\"profile-edit.ejs\", locals, statusCode)\n })\n}","title":""},{"docid":"7835a315b88c17a8dbf9952d6f1e926d","score":"0.6389545","text":"editProfile() {\n this.$router.push({ name: \"profile-edit\" });\n }","title":""},{"docid":"ce60b3af1cc9252b5c8ce371ff8ac54d","score":"0.638096","text":"function profileClick(accountID) {\n $(\"#profile-new\").click(function (event) {\n window.location.href = \"/gwa/pages/profile.html?accountID=\" + accountID;\n })\n }","title":""},{"docid":"00c26036e2b171d7cc89311ff2841c0b","score":"0.63564277","text":"function edition(req, res) {\n var id = req.session.user._id\n\n db.collection('users').updateOne({\n _id: new mongo.ObjectID(id)\n }, {\n $set: {\n firstname: req.body.firstname,\n lastname: req.body.lastname,\n place: req.body.place,\n bio: req.body.bio\n }\n }, done)\n\n function done(err, data) {\n if (err) {\n res.status(404).render('error.ejs', {\n id: 404,\n title: 'Not found',\n detail: 'Oops, er gaat wat mis...'\n })\n } else {\n res.redirect('/profile/' + id)\n }\n }\n}","title":""},{"docid":"afdca51eda6a1f0f97deb47c31a57f1f","score":"0.63535625","text":"function changeProfile(req, res) {\n // finds the current user of the app, and sends data\n User.findById(req.session.users, function(err, users) {\n if (err) {\n console.log(err);\n } else {\n res.render(\"changeprofile.ejs\", {\n pageTitle: \"Change profile\",\n users: users\n });\n }\n });\n}","title":""},{"docid":"b877581d7673e2927d0fed77a8f00fb7","score":"0.6332271","text":"function view_profile(child_id)\n{\n window.location.href='profiles-page/' + child_id;\n}","title":""},{"docid":"154fc6fd58f5e5b00228a4868a3fb2ab","score":"0.62579685","text":"function goToSettings() {\n const url = 'user_settings.html';\n location.href = url;\n}","title":""},{"docid":"eade30a48d0f222e573fcef6a5a863fd","score":"0.6257514","text":"function goMyProfile() {\n if (localStorage[config.app.storage_key+\"_session\"] == null) {\n visitHomePage();\n } else {\n var Session = JSON.parse(localStorage[config.app.storage_key+\"_session\"]);\n if (Session == null) {\n visitHomePage();\n } else {\n if (Session[\"login_status\"] == \"Active\") {\n var dirPath = dirname(location.href);\n var fullPath = dirPath + \"/profile.html\";\n window.location = fullPath;\n } else {\n visitHomePage();\n }\n }\n }\n}","title":""},{"docid":"3b9f875a38f8b323c78ee96b937986aa","score":"0.6230687","text":"function profileEdit (req, res) {\n // show a form if it's a GET, or accept body if it's a POST.\n switch (req.method) {\n case 'POST':\n case 'PUT':\n req.maxLen = 1024 * 1024\n return req.on('form', function (data) {\n saveThenShow(data, req, res)\n })\n\n case 'HEAD':\n case 'GET':\n return show(null, req, res)\n\n default:\n return res.error(405)\n }\n}","title":""},{"docid":"29d5d95860e1b78e839ce4faadc5118a","score":"0.62222755","text":"goToCurrentUploadersProfile() {\n const href = this.getCurrentUploadersProfileURL();\n if (href)\n location.href = href;\n }","title":""},{"docid":"7da216af5791f6474ef9b4189dc2ad68","score":"0.6189225","text":"editUserInfo() {\n this.props.history.push('/edit-user');\n }","title":""},{"docid":"76f1a6054deb9c029068130d3d2ebdee","score":"0.61850387","text":"function goTothisPage() {\r\n window.location.replace(\"budgetEditBudgetPage.html\");\r\n}","title":""},{"docid":"aab48bfa7d84c1ac83610db95efce57d","score":"0.61760134","text":"function reloadProfile() {\n var url = window.location.href;\n window.location.href = url;\n}","title":""},{"docid":"553c0efdede90f99359a5613747929e3","score":"0.61736935","text":"function editUser() {\n\n\tvar obj = getContext ();\n\t\n\t/* show form */\n\tvar form = new Form(\"cocoon:/page/model/userData?mode=edit\");\n\tform.createBinding(\"cocoon:/page/binding/userData?mode=edit\");\n form.load(obj);\n form.showForm(\"page/form/userData?mode=edit\");\n}","title":""},{"docid":"b341ed5987c5e52839b574fa741b90c3","score":"0.61735696","text":"function signUp(){\n window.location.href = \"userAddUpdate.html\";\n}","title":""},{"docid":"756ef892ebf5f01887836329c3ea3048","score":"0.61483204","text":"function dash_board() {\n\twindow.location.href = \"../dashboard/profile.html\";\n}","title":""},{"docid":"9ccd7b3e5d1b33fd5cd3a5e74042efaf","score":"0.6147402","text":"function goToProfile(objectId) {\n $state.go(\"profile\", {id: objectId});\n }","title":""},{"docid":"1d41eb325a5fe4490d95beac457c9433","score":"0.6131068","text":"function dash_board() {\n window.location.href = \"../dashboard/profile.html\";\n}","title":""},{"docid":"eb62b85610a6f4ea71b6b66a34686816","score":"0.61146146","text":"function editProfile() {\n $http.post(\"/api/account/editprofile\", service.editUser)\n .then(function (response) {\n editProfileForm.hide();\n $state.reload();\n growl.info(\"You have successfully edited your profile.\");\n }, function (error) {\n var modelState = error.data.ModelState;\n angular.forEach(modelState, function (errorMessages, attribute) {\n\n if (attribute != \"$id\") {\n angular.forEach(errorMessages, function (value, key) {\n growl.error(value, { ttl: 10000 }); //display errors sent from back end and display them on notifier\n });\n }\n });\n });\n }","title":""},{"docid":"c36fe4015ab46bde3a150779e890c9a1","score":"0.61086947","text":"function edit_sch()\n{\n window.location = document.getElementById('cfg').className + '/local/placement/user/viewprincipal.php?view=editschool';\n}","title":""},{"docid":"daf93a26b7cf66f0e4c4279c15340a74","score":"0.60651267","text":"function editPrivileges(noteID){\n window.location.href = \"/listPrivileges/\" + noteID;\n}","title":""},{"docid":"bd8e6a9dbcfbe61d27bec51a330b35bc","score":"0.6030009","text":"async handle(req, res, next) {\n\n if (!req.user)\n return next();\n\n return res.redirect(helpers.route(\"profile\", {\n \":section\": \"library\"\n }));\n\n }","title":""},{"docid":"baed0d204560b518245df8b3bedfec8a","score":"0.6025168","text":"function handleCharacterEdit() {\n var currentCharacter = $(this)\n .parent()\n .parent()\n .data(\"superHero\");\n window.location.href = \"/addCharacter?character_id=\" + currentCharacter.id;\n }","title":""},{"docid":"07e7941616eaddecc9df94916897ba40","score":"0.6018132","text":"function editPasar(id){\n window.location.href = id;\n}","title":""},{"docid":"4ab86dcb98dad54e858b65278480b447","score":"0.60122204","text":"function gotoaboutme(){\n\twindow.location = \"about-me.html\"\n}","title":""},{"docid":"794a939b75083f6081e99011e2bbee2a","score":"0.5992392","text":"function editProfileInfo(e){\n e.preventDefault();\n //get the stuff to send to createProfile.addProfile\n console.log(\"updating profile\");\n\n var email = $('#newEmail').val();\n var phone = $('#newPhone').val();\n\n var userJson = {\n 'email': email,\n 'phone': phone\n };\n $.post('/editProfile/updateProfileInfo', userJson, function() {\n window.location.href = '/home'; // go to the homepage\n });\n}","title":""},{"docid":"c03330216d99d51655cc9daa81d87403","score":"0.5984946","text":"function setupEditUserDetailFormErrorCase(id) { \n window.location.replace(\"/users/edit?id=\"+id+\"&msgDisplay=Error: Cannot get current data of user id \"+id+\"&msgType=fail\");\n}","title":""},{"docid":"f9bfe02d1e79bc2984773f7ad2de74b4","score":"0.59615713","text":"goToSuccessPage() {\n window.location.href = '/myaccount/profile?password-reset=success';\n }","title":""},{"docid":"6e1ca392e76374cab461100b92645b6b","score":"0.5961495","text":"function anotherQuiz() {\n window.location.href = \"/chooseQuizToEdit\";\n}","title":""},{"docid":"a0ae7e33411bf993a4fbeb96ff4b6d18","score":"0.5960604","text":"function handleProfileSubmit(e) {\n e.preventDefault();\n\n editPopup.toggleButtonText();\n\n const {name, bio: about} = editPopup.getInputValues();\n api.updateUser({name, about})\n .then(() => {\n profileView.setUserInfo({name, about});\n editPopup.close();\n })\n .finally(editPopup.toggleButtonText)\n .catch(handleApiError);\n}","title":""},{"docid":"eb22ae934ed6f4b0d680ee6efd7253bb","score":"0.59441125","text":"function displayUserDetails(id) {\n localStorage.setItem(\"idUs\", id);\n location.replace(\"display-user.html\");\n}","title":""},{"docid":"bd1613cf0da4b7b4e5c241d3a0f4d97f","score":"0.59427375","text":"function toProfile() {\n activePage.hide();\n $(\"#bio-page\").show().removeClass(\"deactivated\").addClass(\"activated\"); //To Be Rplaced\n activePage = $(\"#bio-page\");\n console.log(\"reasigned\", activePage);\n }","title":""},{"docid":"8221b753c5a275cd8b7e49c005365991","score":"0.5939191","text":"function profilePage(index){\n $scope.goToPlayerUsername = $scope.playsWith[index];\n $location.path('/profile/' + $scope.goToPlayerUsername);\n }","title":""},{"docid":"5b035d8200a5c068e6c1aa4cec1d638b","score":"0.59377223","text":"function goToProfile() {\n\n var win = window.open('../profile', '_self');\n\n if (win) {\n //Browser has allowed it to be opened\n win.focus();\n } else {\n //Browser has blocked it\n console.log('Please allow popups for this website');\n }\n\n}","title":""},{"docid":"5c13af9163102b0acf1bb3394804aca3","score":"0.59375775","text":"function update() {\n var newUser = {\n username: $scope.profileUsername,\n password: $scope.profilePassword,\n firstName: $scope.profileFirstName,\n lastName: $scope.profileLastName,\n email: $scope.profileEmail\n };\n\n UserService.updateUser(currentUser._id, newUser, function(found) {\n if (found) {\n $location.url(\"profile\");\n console.log(found);\n }\n });\n\n }","title":""},{"docid":"1e5e2cfae6882d4c805eeace0b43fcbd","score":"0.59343904","text":"function onProfileClick(e) {\n\t\tvar item = e.section.getItemAt(e.itemIndex);\n\t\tif (e.bindId === \"profile_pic\" || e.bindId === \"profile_name\") {\n\t\t\tgo_to_friend_profile(SysEnum.WINDOWS_AND_STATES.PROFILE_BY_ID, item.properties.user_id);\n\t\t\tcloseWindow();\n\t\t}\n\t}","title":""},{"docid":"77dbfc6f6486735fbc0bbc6ef9bd8ecf","score":"0.5933079","text":"showProfile() {\n router.push({\n name: \"user-profile\",\n });\n }","title":""},{"docid":"5b45c9b12997e894760d35972aeab3ef","score":"0.5928727","text":"function post_edit(request, response) {\r\n\r\n\t// The session token.\r\n\tvar sessionToken = request.cookies[cookieName];\r\n\r\n\t// If there is a user signed in.\r\n\tif (sessions.validSession(sessionToken)) {\r\n\r\n\t\t// Extend the user\r\n\t\tsessions.extend(sessionToken, response);\r\n\r\n\t\tvar user = sessions.getDetails(sessionToken);\r\n\r\n\t\t// Iterate over the user's details\r\n\r\n\t\t// Change the profile picture\r\n\t\tvar newPicture = changePicure(request, user);\r\n\r\n\t\t// Updated the password if there is a new password\r\n\t\t// specified\r\n\t\tvar password = user.password;\r\n\t\tif (request.body.password !== \"\") {\r\n\t\t\tpassword = MD5.hash(request.body.password + user.salt);\r\n\t\t}\r\n\r\n\t\t// The updated user details\r\n\t\tvar newRow = {\r\n\t\t\t\"email\" : user.email,\r\n\t\t\t\"name\" : (user.name !== request.body.name) ? request.body.name : user.name,\r\n\t\t\t\"organiser\" : request.body.organiser ? 'true' : 'false',\r\n\t\t\t\"picture\" : (newPicture !== user.picture) ? newPicture : user.picture,\r\n\t\t\t\"password\" : password,\r\n\t\t\t\"salt\" : user.salt,\r\n\t\t\t\"dob\" : user.dob,\r\n\t\t\t\"telephone\" : (user.telephone !== request.body.telephone) ? request.body.telephone : user.telephone\r\n\t\t};\r\n\r\n\t\t// Update the user details in the database\r\n\t\tdb.run(\r\n\t\t\t\"UPDATE Users SET name = ?, organiser = ?, picture = ?, password = ?, telephone = ? WHERE email = ?;\", \r\n\t\t\t[newRow.name, newRow.organiser, newRow.picture, newRow.password, newRow.telephone, newRow.email ]\r\n\t\t);\r\n\t\t\r\n\t\t// Update the user's deatils that are stored in the session.\r\n\t\tsessions.updateUser(sessionToken, newRow)\r\n\r\n\t\tconsole.log(\"Profile Update [\" + user.email + \"]\");\r\n\r\n\t\tresponse.redirect('/profile?email=' + user.email);\r\n\r\n\t} else {\r\n\t\t// If the session was invalid\r\n\t\tresponse.redirect('/');\r\n\t}\r\n\r\n}","title":""},{"docid":"2145c2dc32e4ec20e2a09fb2add66188","score":"0.59246194","text":"function notificationProfile(profileid){\r\n\tlocalStorage.setItem(\"userprofileid\", profileid);\r\n\twindow.location = \"User_Profile.html\";\r\n}","title":""},{"docid":"784e7b6365cdd72c017c6260da5b9e3f","score":"0.5916971","text":"function redirectionFromSignUP(){\n \n username = document.getElementById('user_name').value;\n password = document.getElementById('password').value;\n data= 'profile.html';\n x();\n}","title":""},{"docid":"1dee6ec76545c2f4d9401cd2df7d55a9","score":"0.59148693","text":"renderPage() {\n const { from } = this.props.location.state || { from: { pathname: /profile/ } };\n // if correct authentication, redirect to from: page instead of signup screen\n if (this.state.redirectToReferer) {\n return <Redirect to={from}/>;\n }\n return (\n <Grid container centered>\n <Grid.Column>\n <Divider hidden/>\n <Header as=\"h2\" textAlign=\"center\">Edit Profile</Header>\n <AutoForm schema={ProfileSchema} onSubmit={data => this.submit(data)} model={this.props.doc}>\n <Segment inverted className='profileForm' very padded>\n <Header as='h3' textAlign='center'>Profile Information</Header>\n <Grid className='doubleLine'>\n <TextField name='name'/>\n <SelectField name='gender'/>\n </Grid>\n <TextField name='image' label='Image (URL)'/>\n <LongTextField className='descBox' name='description'/>\n <Header as='h3' textAlign='center'>Matching Information</Header>\n <MultiSelectField name='interests'/>\n <Grid className='doubleLine'>\n <SelectField className='dropDownFix' name='seeking'/>\n <SelectField className='dropDownFix' name='level'/>\n <NumField name='age'/>\n </Grid>\n <TextField name='goals'/>\n <SubmitField className='editProfileButton' value='Submit Changes'/>\n <ErrorsField/>\n <HiddenField name='owner'/>\n </Segment>\n </AutoForm>\n </Grid.Column>\n </Grid>\n );\n }","title":""},{"docid":"0aa2e0309f7bb2e973cbd8623d977cca","score":"0.59141827","text":"editJob(id) {\n window.location = \"/EditJob/\" + id;\n }","title":""},{"docid":"32a5a6a69f7f54427e4dcdb4cd244380","score":"0.5903399","text":"function redirectIfLoggedIn(nextState, replace) {\n\t\tif (Store.getState().user.loggedIn) {\n\t\t\treplace('/profile');\n\t\t}\n\t}","title":""},{"docid":"a571b6a66277cef7ea3a0c7eb12e06a0","score":"0.58814776","text":"function newAccount() {\n window.location.href = 'createAccount.html';\n}","title":""},{"docid":"11ec93c082e4a2f74498a99aa815407f","score":"0.58717185","text":"function onlineprofileclick(val) {\r\n\tlocalStorage.setItem(\"userprofileid\", val);\r\n\twindow.location = \"User_Profile.html\";\r\n}","title":""},{"docid":"87afc8d22499c48ba03a1a942c27b308","score":"0.58678454","text":"function pEdit(req, res){\n let name = req.user.name\n User.findOne({name: name})\n .then(person=>{\n let port = person.portfolio.id(req.params.id)\n res.render('users/edit', {\n port,\n user: req.user,\n title: 'Portfolios'\n })\n })\n}","title":""},{"docid":"8c3af040e1acec83006b2bf06f1b8998","score":"0.5867791","text":"function goToElon() {\n var usp = new URLSearchParams();\n usp.set(\"user\", \"user1\");\n var url = location.pathname;\n url = `${url}?${usp.toString()}`;\n location.href = url;\n}","title":""},{"docid":"1b830c03697264bc042252bc3b6a9d73","score":"0.5854384","text":"function goToURL(param, url){\r\n\tvar user = url.substring(url.indexOf('=')+1);\r\n\tif (param=='view'){\r\n\t window.location ='http://localhost:3000/get?username='+user;\r\n\t}\r\n\tif (param=='post'){\r\n\t window.location ='http://localhost:3000/createDonation?username='+user;\r\n\t}\r\n\r\n\tif (param=='edit'){\r\n window.location ='http://localhost:3000/editProfile?username='+user;\r\n }\r\n}","title":""},{"docid":"d1ce6fdd4bfa03754fc9b74bd1ea2c86","score":"0.58525735","text":"function gotomakeaccount(e){\n history.push(\"/register\");\n }","title":""},{"docid":"300e6be6265a30536d5b80c030edf5c3","score":"0.5849804","text":"function addNewUserDetail() {\n $(location).attr(\"href\", \"/login/new/add\");\n}","title":""},{"docid":"7d5d7dca4dcecc8a1161a03640cdd958","score":"0.584968","text":"function personBtnUp(evt){\n\t\tif(g.loginStatus){\n\t\t\tlocation.href = \"../personal-center/index.html\";\n\t\t}\n\t\telse{\n\t\t\tlocation.href = \"../login/login.html\";\n\t\t}\n\t}","title":""},{"docid":"ead6a436bab17ab002148f34c76ba808","score":"0.5842591","text":"get editProfileLink() {\n return this.clone(Profiles, \"EditProfileLink\").get();\n }","title":""},{"docid":"397cef7c818333e6aaf9792c3ccac1f9","score":"0.5841215","text":"function act_pres(idPresidente){\t\n\twindow.location.assign('/admin/presidente/'+idPresidente); //es el que existe en el servidor\n}","title":""},{"docid":"a1c1739b5e3440f361fdb881f4ced865","score":"0.58254176","text":"function requestEditProfile(username) {\n\tvar queryString = $(\"#profile-\" + username).serialize();\n\t$.ajax(\n\t{\n\t\ttype: \"post\",\n\t\turl: \"/profiles/:\" + username,\n\t\tdata: queryString\n\t})\n\t.done(function(data)\n\t{\n\t\talert(\"Profile updated!\");\n\t\tlocation.reload();\n\t})\n\t.fail(function( jqXHR, textStatus )\n {\n alert( \"Failed to edit: \" + textStatus );\n });\n}","title":""},{"docid":"665d68fa339da3b0a90061b1613b331a","score":"0.5823749","text":"function myFunc(arg) {\r\n\r\n\r\n res.redirect('/profile/profile');\r\n }","title":""},{"docid":"ac1f6b55f170940a7059f5e9dff498ef","score":"0.5802028","text":"function goToEditPage(button) {\n // get the relevant item's id from the button.\n let id = button.id; // id is in this format: edit-item-IT123 where IT123 is the itemId.\n let itemId = id.includes('edit-item-') ? id.replace('edit-item-', '') : '';\n\n // navigate to edit page.\n // we embed the item id in the edit page's URL so that the script/function running on that page,\n // can identify which item needs to be edited.\n // url: <host>:<port>/suppliers/items/edit-supply-item.html#<item id>.\n // having something starting with a hash in the end of the url won't do any harm to url navigation.\n window.location.href = currentLocation.includes('view-supply-items') ? currentLocation.replace('view-supply-items', 'edit-supply-item') + '#' + itemId : currentLocation; // redirection.\n}","title":""},{"docid":"7b42234a49271acdeaa2a70f8a3943d6","score":"0.57973224","text":"function signUp(){\n window.location.href = 'http://localhost/fitness.html' + '#signUp';\n \n}","title":""},{"docid":"b3bb9225136657b8784409d26a66f5cf","score":"0.57902807","text":"editAppDeveloper() {\n I.scrollTo(this.editUserLocators.bio);\n I.fillField(this.editUserLocators.bio, 'I am Application Developer');\n I.click(this.editUserLocators.save);\n }","title":""},{"docid":"e9c75651d0a4233415798af7da7dd924","score":"0.5789823","text":"function viewProfile(response, user, canEdit, navbar) {\r\n\r\n\tvar profile = builder.viewProfile(user, canEdit);\r\n\r\n\tvar head = builder.head(\"Profile\");\r\n\tvar body = builder.body(navbar, profile);\r\n\tvar page = builder.page(head, body);\r\n\r\n\tmisc.buildResponse(response, page);\r\n\r\n}","title":""},{"docid":"da13532d9e57590f0e9bf2486e73084d","score":"0.5788009","text":"function newAccount() {\n window.location.href = \"../CreateAccountPage/createAccount.html\";\n}","title":""},{"docid":"128cc670512e12502466ff93544d611a","score":"0.57752013","text":"function goToAboutUs(){\n window.location.href = \"../aboutus.html\";\n}","title":""},{"docid":"c38fcef31737420e8474ce87bc166f8e","score":"0.5766108","text":"function profile(currentUser) {\n $http.get(`/users/${currentUser._id}`)\n .then(function(response){\n console.log('Profile route: ', response)\n $state.go('profile', {userId: currentUser._id});\n })\n }","title":""},{"docid":"0f66292ae62890c3cc71b19a62183674","score":"0.5763795","text":"function editProfileModal() {\n service.editUser = service.user;\n editProfileForm.$promise.then(editProfileForm.show);\n }","title":""},{"docid":"4c3449a4da9b6060aaa4731d4bbdbea0","score":"0.5751036","text":"function userRedirection(userType) {\n console.log(\"userRedirection Fired!\");\n console.log(userType);\n switch (userType) {\n case \"student\":\n console.log(userType);\n window.location.replace(`${sessionCurrentURLPrefix}/Client/student.html`); //Change url here as shown in your port number.\n break;\n case \"worker\":\n console.log(userType);\n window.location.replace(`${sessionCurrentURLPrefix}/Client/worker.html`); //Change url here as shown in your port number.\n break;\n default:\n console.log(userType);\n console.log(\"No such email in system.\");\n alert(\"No such user! Try Again...\");\n document.getElementById(\"email\").value = \"\";\n break;\n }\n ;\n}","title":""},{"docid":"ebafefde0806e5adc8a342402ed8c349","score":"0.5741862","text":"function forwardUser(){\n window.location.href = \"../login/login.html\";\n}","title":""},{"docid":"4c22d617c91208a0d19fff80260539c3","score":"0.5739567","text":"function get_edit(request, response) {\r\n\r\n\t// If the email has been specifed.\r\n\tif (request.query.email) {\r\n\r\n\t\tvar email = request.query.email;\r\n\r\n\t\tdb.each(\r\n\t\t\t\"SELECT * FROM Users WHERE email = ?\", \r\n\t\t\t[ email ], \r\n\t\t\tfunction(user) {\r\n\r\n\t\t\t\t// Check for the session cookie and wherther it is\r\n\t\t\t\t// active.\r\n\t\t\t\tvar sessionToken = request.cookies[cookieName];\r\n\t\r\n\t\t\t\tif (sessions.validSession(sessionToken)) {\r\n\t\t\t\t\tsessions.extend(sessionToken, response);\r\n\t\r\n\t\t\t\t\tvar sessionUser = sessions.getDetails(sessionToken);\r\n\t\r\n\t\t\t\t\tif (sessionUser.email === email) {\r\n\t\r\n\t\t\t\t\t\tvar home = builder.navbarLink(\"/\", \"Home\");\r\n\t\t\t\t\t\tvar logout = builder.navbarLink(\"/logout\", \"Logout\");\r\n\t\t\t\t\t\tvar newEvent = builder.navbarLink(\"/organise\", \"Orgainse Event\");\r\n\t\t\t\t\t\tvar search = builder.navbarLink(\"/search\", \"Search Events\");\r\n\t\t\t\t\t\tvar myEvents = builder.navbarLink(\"/events\", \"My Events\");\r\n\t\r\n\t\t\t\t\t\tvar navbar = builder.navbar((user.organiser === 'true') ? [ home, newEvent, myEvents, search,\r\n\t\t\t\t\t\t\t\tlogout ] : [ home, search, logout ]);\r\n\t\r\n\t\t\t\t\t\t// If the current user owns the profile\r\n\t\t\t\t\t\t// allow them to edit it.\r\n\t\t\t\t\t\teditProfile(response, user, navbar);\r\n\t\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tresponse.redirect('/profile?email=' + email);\r\n\t\t\t\t\t}\r\n\t\r\n\t\t\t\t} else {\r\n\t\t\t\t\tresponse.redirect('/profile?email=' + email);\r\n\t\t\t\t}\r\n\r\n\t\t\t}, \r\n\t\t\tfunction(count) {\r\n\r\n\t\t\t\t/*\r\n\t\t\t\t * If there is no user with that email redirect to the landing page.\r\n\t\t\t\t */\r\n\t\t\t\tif (count == 0) {\r\n\t\t\t\t\tresponse.redirect('/');\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t);\r\n\r\n\t} else {\r\n\t\t// No valid session redirect the user to the home screen.\r\n\t\tresponse.redirect('/');\r\n\t}\r\n\r\n}","title":""},{"docid":"b1da06eb258bcda8c6bc9449a9c20b1a","score":"0.5731587","text":"function onEditClick() {\n\tvar site = location.origin\n\tvar path = site + \"/srv/events/edit/\" + $(this).attr(\"eid\");\n\tlocation.assign(path);\n}","title":""},{"docid":"98999d09d6ad71778d88313a480c7e52","score":"0.57167834","text":"function handleActivityEdit() {\n var currentActivity = $(this)\n .parent()\n .parent()\n .data(\"activity\");\n window.location.href = \"/cms?activity_id=\" + currentActivity.id;\n }","title":""},{"docid":"1f445d54847a9f1f2549b57d45937c7e","score":"0.57149094","text":"onUpdateClick (e) {\n this.props.history.push('/profile-update');\n }","title":""},{"docid":"c460ea87d2a3de08e9311e5f4a20cdef","score":"0.57099456","text":"_onViewProfile() {\n this.authenticate(this._secret, () => {\n this.authenticatorDialogs.setProfile(this._user);\n this.authenticatorDialogs.get('profile').open();\n });\n }","title":""},{"docid":"f9c5867868bf3eb174ee25a652cc2d47","score":"0.5705813","text":"render() {\n let redirect = \"\";\n if (this.state.tempId === \"\") {\n redirect = <Redirect to=\"/signup\" />;\n }\n return (\n <div className=\"container\">\n {redirect}\n <h1 className=\"headerGreen\">Edit Profile</h1>\n <hr />\n <Form\n model=\"editprofie\"\n onSubmit={(values) => this.handlePatchedInfo(values)}\n >\n {\" \"}\n <Row className=\"form-group\">\n <Col xs={12} md={{ size: 6, offset: 3 }}>\n <Label>Name</Label>\n <Control.text\n className=\"form-control\"\n model=\".ID\"\n id=\"ID\"\n name=\"ID\"\n placeholder=\"New Username\"\n />\n </Col>\n </Row>\n <Row className=\"form-group\">\n <Col xs={12} md={{ size: 6, offset: 3 }}>\n <Label>Email</Label>\n <Control.text\n className=\"form-control\"\n model=\".email\"\n id=\"email\"\n name=\"email\"\n placeholder=\"New Email\"\n />\n </Col>\n </Row>\n \n <Row className=\"form-group\">\n <Col xs={12} md={{ size: 6, offset: 3 }}>\n <Label>Age</Label>\n <Control.text\n className=\"form-control\"\n model=\".age\"\n id=\"age\"\n name=\"age\"\n placeholder=\"New Age\"\n />\n </Col>\n </Row>\n\n <Row className=\"form-group\">\n <Col>\n <Button className=\"EditProfileCancelButton\">\n <Link className=\"EditProfileLinkInsideCancelButton\" to=\"/account/overview\">\n cancel\n </Link>\n </Button>\n </Col>\n <Col>\n <Button type=\"submit\" className=\"EditProfileSaveButton\">\n Save Changes\n </Button>\n </Col>\n </Row>\n </Form>\n </div>\n );\n }","title":""},{"docid":"7b4d4b10551126b18d0752bc8767a509","score":"0.5702829","text":"function goToProfile(userId, goodreadsId) {\n\t\tconsole.log('doing gotorpofile');\n\t\t$scope.grDone = true;\t\t\n\t\t$timeout(function(){\n\t\t\t$location.path( \"/profile\" )\n\t\t //$location.path('#/profile').replace();\n\t //$scope.$apply();\n\t\t});\t\n\t}","title":""},{"docid":"ffc683ba6f3028bada9ab5ee5c208d3b","score":"0.56992257","text":"function handleEntryEdit() {\n var currentEntry = $(this)\n .parent()\n .parent()\n .data(\"entry\");\n window.location.href = \"/entry/:entry_id=\" + currentEntry.entryId;\n }","title":""},{"docid":"0df74ac988c11c911c3aa46cc2d1dd4e","score":"0.5698632","text":"function register(){\n window.location.href = window.location + '#signUp';\n \n}","title":""},{"docid":"6fb236437aeeb77a6073b27c05f7501d","score":"0.5690241","text":"function gotopage(pageID) {\n\n\t// REDIRECT USER TO PAGE\n\tswitch(pageID) {\n\t\tcase \"dashpage\":\n\t\t\twindow.location.replace(\"dashpage.html\");\n\t\t\tbreak;\n\t\tcase \"favpage\":\n\t\t\twindow.location.replace(\"favpage.html\");\n\t\t\tbreak;\n\t}\n}","title":""},{"docid":"6fe6cb9d0fd1dfc088ff294827cd7ca9","score":"0.56854236","text":"function backUser(){\n location.href = \"UserPage.html\";\n}","title":""},{"docid":"055b9455cb754c26f850182b58c30c92","score":"0.568242","text":"function redirectToPetDetail() {\n res.redirect(\"/project/#/shelter/\" + shelterId + \"/pet/\" + petId);\n }","title":""},{"docid":"5c129c9be8f42a529e91786ff25c4368","score":"0.5682128","text":"function redirectUser(nextLink) {\n\tconsole.log(\"redirecting user...\");\n\twindow.location.replace(nextLink);\n}","title":""},{"docid":"a6bee2f32d80cf754cde5de48df9bd2a","score":"0.5681647","text":"function newpages() {\n window.location.href = \"applicant-details.html\";\n}","title":""},{"docid":"c6304e44b115d4214d523b2c7136b384","score":"0.5681463","text":"function editUser($userId) {\n $state.go('admin.users.edit', {userId : $userId});\n\n }","title":""},{"docid":"ea336a744a1cd02d70ccdd0b517be50a","score":"0.56699353","text":"function updateAuthor(id){\r\n window.location = \"/authors?type=Update&_id=\"+id;\r\n}","title":""},{"docid":"1c3d43ee6aedcfc3eb0efbd90cb68ccc","score":"0.5666268","text":"function Redirect() {\n window.location.replace(\"/post/\" + postId);\n }","title":""},{"docid":"dda1afcfb34868b79af2e56dea447ae6","score":"0.56467694","text":"function courseInfoChange(){\n alert(\"The course information has been successfully editted.\");\n window.location = 'http://cs3319.gaul.csd.uwo.ca/vm071/a3joseph/indexpage.php';\n}","title":""},{"docid":"ceda38e4564ed4f21347d74ea3647fb7","score":"0.56463355","text":"function redirectPage(){\n setCookie(\"tutorial\", \"true\");\n window.location.href = \"https://foodwheelapp.herokuapp.com/profile\";\n}","title":""},{"docid":"9ca51bf95cda364ee12dd5a484ff3e5e","score":"0.56461364","text":"function add_teacher()\n{\n window.location = document.getElementById('cfg').className + '/local/placement/user/viewprincipal.php?view=add';\n}","title":""},{"docid":"d8e1eb1e58494311767daba89be8aaab","score":"0.5633231","text":"function gotocontact(){\n\twindow.location = \"contact.html\"\n}","title":""},{"docid":"c3492a7ccf1c8bd57fe263b29b6b6170","score":"0.562621","text":"function clickProfile(k) {\r\n\tvar id = useridlist[k].value1;\r\n\tlocalStorage.setItem(\"userprofileid\", id);\r\n\tlocalStorage.setItem(\"wantbudyrequest\", \"no\");\r\n\twindow.location = \"User_Profile.html\";\r\n}","title":""},{"docid":"6e84f71b78117a0cbe462e35f936c5e7","score":"0.56239426","text":"async function EditProfile(e) {\n e.preventDefault();\n await updateRow(user.data.id, { nama: name, email: email }).then(\n handleClose\n );\n window.location.reload();\n }","title":""}],"string":"[\n {\n \"docid\": \"611e91bb3036b274e8968d9efe39942c\",\n \"score\": \"0.80398744\",\n \"text\": \"function goEditProfile() {\\n var dirPath = dirname(location.href);\\n var fullPath = dirPath + \\\"/editprofile.html\\\";\\n window.location = fullPath;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b437445df49582a8c23cfc41c76277ca\",\n \"score\": \"0.78915787\",\n \"text\": \"editProfie() {\\n window.location.replace('http://localhost:3000/EditProfile');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"885ec5432b5ddaf069cdeb05e30cb9ac\",\n \"score\": \"0.71922606\",\n \"text\": \"function goToProfile(){\\n\\tvar text = Parse.User.current().id;\\n\\twindow.location.href = \\\"../profile.html?\\\" + text;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30793aca92e5361ccea66325cd812088\",\n \"score\": \"0.714225\",\n \"text\": \"function handelEdit (){\\n let uid = this.id ?? \\\"\\\";\\n window.location.href=`${USER_ADD_FORM_URL}?uid=${uid}`;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31e80f3476318fa7ffbbaf105254f570\",\n \"score\": \"0.709794\",\n \"text\": \"function toCorppassProfileLandingPage() {\\n\\twindow.location = corppassProfileLandingPage;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aab622a35255405fddba9b15aabec9f1\",\n \"score\": \"0.6970729\",\n \"text\": \"function redirect() {\\n // this.html(\\\"Redirecting to my profile...\\\");\\n window.location = \\\"/profile/\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec8ef0c240ad785477835e75ecf2bbc1\",\n \"score\": \"0.6859175\",\n \"text\": \"function _editBtn() {\\n $state.go(\\\"profileEditor\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de90bc3c2b8930d32a7d4aa9a77459d3\",\n \"score\": \"0.6756414\",\n \"text\": \"function editUser() {\\n $location.path('/user/' + vm.user.id);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7dc2fb491cf5657b51002f97dcaaedb\",\n \"score\": \"0.674889\",\n \"text\": \"function redirect() {\\n $location.path('/profile');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c5d7208c44d0a6df8aa50dc14f2e093\",\n \"score\": \"0.66651034\",\n \"text\": \"function redirectToWidgetEdit() {\\n res.redirect(\\\"/assignment/#/user/\\\" + userId + \\\"/website/\\\" + websiteId + \\\"/page/\\\" + pageId + \\\"/widget/\\\" + widgetId);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6ba59be037a2fc5c58be1c6013e782f\",\n \"score\": \"0.6597479\",\n \"text\": \"function editProfile(response, user, navbar) {\\r\\n\\r\\n\\tvar profile = builder.editProfile(user);\\r\\n\\r\\n\\tvar head = builder.head(\\\"Profile\\\");\\r\\n\\tvar body = builder.body(navbar, profile);\\r\\n\\tvar page = builder.page(head, body);\\r\\n\\r\\n\\tmisc.buildResponse(response, page);\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9959396ffaac9185a5995363bce8d9c5\",\n \"score\": \"0.65849245\",\n \"text\": \"Goedit() {\\n this.presentToast('goedit');\\n let navigationExtras = {\\n state: {\\n dataUser: this.dataUser\\n }\\n };\\n this.router.navigate(['asso-edit-profile'], navigationExtras);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca40d58032067fe2b73ab07fc5100f43\",\n \"score\": \"0.6433912\",\n \"text\": \"function profileClick(accountID) {\\n $(\\\"#profile-new\\\").click(function (event) {\\n window.location.href = \\\"/gwa/pages/profile.html?accountID=\\\" + accountID;\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c40027d2d206248f8ecdc3da072d9920\",\n \"score\": \"0.6412225\",\n \"text\": \"function show (err, req, res) {\\n req.model.load('profile', req)\\n req.model.load('whoshiring')\\n req.model.end(function (er, m) {\\n var profile = m.profile\\n var statusCode = 200\\n if (er || !profile || !profile.name) {\\n req.session.set('done', req.url)\\n return res.redirect('/login')\\n }\\n if (er || profile.error) {\\n return res.error(er || profile.error)\\n }\\n var locals = {\\n profile: profile,\\n hiring: m.whoshiring,\\n fields: profile.fields,\\n title: 'Edit profile',\\n error: err\\n }\\n\\n if (err) {\\n statusCode = 400\\n }\\n\\n res.template(\\\"profile-edit.ejs\\\", locals, statusCode)\\n })\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7835a315b88c17a8dbf9952d6f1e926d\",\n \"score\": \"0.6389545\",\n \"text\": \"editProfile() {\\n this.$router.push({ name: \\\"profile-edit\\\" });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce60b3af1cc9252b5c8ce371ff8ac54d\",\n \"score\": \"0.638096\",\n \"text\": \"function profileClick(accountID) {\\n $(\\\"#profile-new\\\").click(function (event) {\\n window.location.href = \\\"/gwa/pages/profile.html?accountID=\\\" + accountID;\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00c26036e2b171d7cc89311ff2841c0b\",\n \"score\": \"0.63564277\",\n \"text\": \"function edition(req, res) {\\n var id = req.session.user._id\\n\\n db.collection('users').updateOne({\\n _id: new mongo.ObjectID(id)\\n }, {\\n $set: {\\n firstname: req.body.firstname,\\n lastname: req.body.lastname,\\n place: req.body.place,\\n bio: req.body.bio\\n }\\n }, done)\\n\\n function done(err, data) {\\n if (err) {\\n res.status(404).render('error.ejs', {\\n id: 404,\\n title: 'Not found',\\n detail: 'Oops, er gaat wat mis...'\\n })\\n } else {\\n res.redirect('/profile/' + id)\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afdca51eda6a1f0f97deb47c31a57f1f\",\n \"score\": \"0.63535625\",\n \"text\": \"function changeProfile(req, res) {\\n // finds the current user of the app, and sends data\\n User.findById(req.session.users, function(err, users) {\\n if (err) {\\n console.log(err);\\n } else {\\n res.render(\\\"changeprofile.ejs\\\", {\\n pageTitle: \\\"Change profile\\\",\\n users: users\\n });\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b877581d7673e2927d0fed77a8f00fb7\",\n \"score\": \"0.6332271\",\n \"text\": \"function view_profile(child_id)\\n{\\n window.location.href='profiles-page/' + child_id;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"154fc6fd58f5e5b00228a4868a3fb2ab\",\n \"score\": \"0.62579685\",\n \"text\": \"function goToSettings() {\\n const url = 'user_settings.html';\\n location.href = url;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eade30a48d0f222e573fcef6a5a863fd\",\n \"score\": \"0.6257514\",\n \"text\": \"function goMyProfile() {\\n if (localStorage[config.app.storage_key+\\\"_session\\\"] == null) {\\n visitHomePage();\\n } else {\\n var Session = JSON.parse(localStorage[config.app.storage_key+\\\"_session\\\"]);\\n if (Session == null) {\\n visitHomePage();\\n } else {\\n if (Session[\\\"login_status\\\"] == \\\"Active\\\") {\\n var dirPath = dirname(location.href);\\n var fullPath = dirPath + \\\"/profile.html\\\";\\n window.location = fullPath;\\n } else {\\n visitHomePage();\\n }\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b9f875a38f8b323c78ee96b937986aa\",\n \"score\": \"0.6230687\",\n \"text\": \"function profileEdit (req, res) {\\n // show a form if it's a GET, or accept body if it's a POST.\\n switch (req.method) {\\n case 'POST':\\n case 'PUT':\\n req.maxLen = 1024 * 1024\\n return req.on('form', function (data) {\\n saveThenShow(data, req, res)\\n })\\n\\n case 'HEAD':\\n case 'GET':\\n return show(null, req, res)\\n\\n default:\\n return res.error(405)\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29d5d95860e1b78e839ce4faadc5118a\",\n \"score\": \"0.62222755\",\n \"text\": \"goToCurrentUploadersProfile() {\\n const href = this.getCurrentUploadersProfileURL();\\n if (href)\\n location.href = href;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7da216af5791f6474ef9b4189dc2ad68\",\n \"score\": \"0.6189225\",\n \"text\": \"editUserInfo() {\\n this.props.history.push('/edit-user');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"76f1a6054deb9c029068130d3d2ebdee\",\n \"score\": \"0.61850387\",\n \"text\": \"function goTothisPage() {\\r\\n window.location.replace(\\\"budgetEditBudgetPage.html\\\");\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aab48bfa7d84c1ac83610db95efce57d\",\n \"score\": \"0.61760134\",\n \"text\": \"function reloadProfile() {\\n var url = window.location.href;\\n window.location.href = url;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"553c0efdede90f99359a5613747929e3\",\n \"score\": \"0.61736935\",\n \"text\": \"function editUser() {\\n\\n\\tvar obj = getContext ();\\n\\t\\n\\t/* show form */\\n\\tvar form = new Form(\\\"cocoon:/page/model/userData?mode=edit\\\");\\n\\tform.createBinding(\\\"cocoon:/page/binding/userData?mode=edit\\\");\\n form.load(obj);\\n form.showForm(\\\"page/form/userData?mode=edit\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b341ed5987c5e52839b574fa741b90c3\",\n \"score\": \"0.61735696\",\n \"text\": \"function signUp(){\\n window.location.href = \\\"userAddUpdate.html\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"756ef892ebf5f01887836329c3ea3048\",\n \"score\": \"0.61483204\",\n \"text\": \"function dash_board() {\\n\\twindow.location.href = \\\"../dashboard/profile.html\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ccd7b3e5d1b33fd5cd3a5e74042efaf\",\n \"score\": \"0.6147402\",\n \"text\": \"function goToProfile(objectId) {\\n $state.go(\\\"profile\\\", {id: objectId});\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d41eb325a5fe4490d95beac457c9433\",\n \"score\": \"0.6131068\",\n \"text\": \"function dash_board() {\\n window.location.href = \\\"../dashboard/profile.html\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb62b85610a6f4ea71b6b66a34686816\",\n \"score\": \"0.61146146\",\n \"text\": \"function editProfile() {\\n $http.post(\\\"/api/account/editprofile\\\", service.editUser)\\n .then(function (response) {\\n editProfileForm.hide();\\n $state.reload();\\n growl.info(\\\"You have successfully edited your profile.\\\");\\n }, function (error) {\\n var modelState = error.data.ModelState;\\n angular.forEach(modelState, function (errorMessages, attribute) {\\n\\n if (attribute != \\\"$id\\\") {\\n angular.forEach(errorMessages, function (value, key) {\\n growl.error(value, { ttl: 10000 }); //display errors sent from back end and display them on notifier\\n });\\n }\\n });\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c36fe4015ab46bde3a150779e890c9a1\",\n \"score\": \"0.61086947\",\n \"text\": \"function edit_sch()\\n{\\n window.location = document.getElementById('cfg').className + '/local/placement/user/viewprincipal.php?view=editschool';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"daf93a26b7cf66f0e4c4279c15340a74\",\n \"score\": \"0.60651267\",\n \"text\": \"function editPrivileges(noteID){\\n window.location.href = \\\"/listPrivileges/\\\" + noteID;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd8e6a9dbcfbe61d27bec51a330b35bc\",\n \"score\": \"0.6030009\",\n \"text\": \"async handle(req, res, next) {\\n\\n if (!req.user)\\n return next();\\n\\n return res.redirect(helpers.route(\\\"profile\\\", {\\n \\\":section\\\": \\\"library\\\"\\n }));\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"baed0d204560b518245df8b3bedfec8a\",\n \"score\": \"0.6025168\",\n \"text\": \"function handleCharacterEdit() {\\n var currentCharacter = $(this)\\n .parent()\\n .parent()\\n .data(\\\"superHero\\\");\\n window.location.href = \\\"/addCharacter?character_id=\\\" + currentCharacter.id;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07e7941616eaddecc9df94916897ba40\",\n \"score\": \"0.6018132\",\n \"text\": \"function editPasar(id){\\n window.location.href = id;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ab86dcb98dad54e858b65278480b447\",\n \"score\": \"0.60122204\",\n \"text\": \"function gotoaboutme(){\\n\\twindow.location = \\\"about-me.html\\\"\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"794a939b75083f6081e99011e2bbee2a\",\n \"score\": \"0.5992392\",\n \"text\": \"function editProfileInfo(e){\\n e.preventDefault();\\n //get the stuff to send to createProfile.addProfile\\n console.log(\\\"updating profile\\\");\\n\\n var email = $('#newEmail').val();\\n var phone = $('#newPhone').val();\\n\\n var userJson = {\\n 'email': email,\\n 'phone': phone\\n };\\n $.post('/editProfile/updateProfileInfo', userJson, function() {\\n window.location.href = '/home'; // go to the homepage\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c03330216d99d51655cc9daa81d87403\",\n \"score\": \"0.5984946\",\n \"text\": \"function setupEditUserDetailFormErrorCase(id) { \\n window.location.replace(\\\"/users/edit?id=\\\"+id+\\\"&msgDisplay=Error: Cannot get current data of user id \\\"+id+\\\"&msgType=fail\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9bfe02d1e79bc2984773f7ad2de74b4\",\n \"score\": \"0.59615713\",\n \"text\": \"goToSuccessPage() {\\n window.location.href = '/myaccount/profile?password-reset=success';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e1ca392e76374cab461100b92645b6b\",\n \"score\": \"0.5961495\",\n \"text\": \"function anotherQuiz() {\\n window.location.href = \\\"/chooseQuizToEdit\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a0ae7e33411bf993a4fbeb96ff4b6d18\",\n \"score\": \"0.5960604\",\n \"text\": \"function handleProfileSubmit(e) {\\n e.preventDefault();\\n\\n editPopup.toggleButtonText();\\n\\n const {name, bio: about} = editPopup.getInputValues();\\n api.updateUser({name, about})\\n .then(() => {\\n profileView.setUserInfo({name, about});\\n editPopup.close();\\n })\\n .finally(editPopup.toggleButtonText)\\n .catch(handleApiError);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb22ae934ed6f4b0d680ee6efd7253bb\",\n \"score\": \"0.59441125\",\n \"text\": \"function displayUserDetails(id) {\\n localStorage.setItem(\\\"idUs\\\", id);\\n location.replace(\\\"display-user.html\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd1613cf0da4b7b4e5c241d3a0f4d97f\",\n \"score\": \"0.59427375\",\n \"text\": \"function toProfile() {\\n activePage.hide();\\n $(\\\"#bio-page\\\").show().removeClass(\\\"deactivated\\\").addClass(\\\"activated\\\"); //To Be Rplaced\\n activePage = $(\\\"#bio-page\\\");\\n console.log(\\\"reasigned\\\", activePage);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8221b753c5a275cd8b7e49c005365991\",\n \"score\": \"0.5939191\",\n \"text\": \"function profilePage(index){\\n $scope.goToPlayerUsername = $scope.playsWith[index];\\n $location.path('/profile/' + $scope.goToPlayerUsername);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b035d8200a5c068e6c1aa4cec1d638b\",\n \"score\": \"0.59377223\",\n \"text\": \"function goToProfile() {\\n\\n var win = window.open('../profile', '_self');\\n\\n if (win) {\\n //Browser has allowed it to be opened\\n win.focus();\\n } else {\\n //Browser has blocked it\\n console.log('Please allow popups for this website');\\n }\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c13af9163102b0acf1bb3394804aca3\",\n \"score\": \"0.59375775\",\n \"text\": \"function update() {\\n var newUser = {\\n username: $scope.profileUsername,\\n password: $scope.profilePassword,\\n firstName: $scope.profileFirstName,\\n lastName: $scope.profileLastName,\\n email: $scope.profileEmail\\n };\\n\\n UserService.updateUser(currentUser._id, newUser, function(found) {\\n if (found) {\\n $location.url(\\\"profile\\\");\\n console.log(found);\\n }\\n });\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e5e2cfae6882d4c805eeace0b43fcbd\",\n \"score\": \"0.59343904\",\n \"text\": \"function onProfileClick(e) {\\n\\t\\tvar item = e.section.getItemAt(e.itemIndex);\\n\\t\\tif (e.bindId === \\\"profile_pic\\\" || e.bindId === \\\"profile_name\\\") {\\n\\t\\t\\tgo_to_friend_profile(SysEnum.WINDOWS_AND_STATES.PROFILE_BY_ID, item.properties.user_id);\\n\\t\\t\\tcloseWindow();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77dbfc6f6486735fbc0bbc6ef9bd8ecf\",\n \"score\": \"0.5933079\",\n \"text\": \"showProfile() {\\n router.push({\\n name: \\\"user-profile\\\",\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b45c9b12997e894760d35972aeab3ef\",\n \"score\": \"0.5928727\",\n \"text\": \"function post_edit(request, response) {\\r\\n\\r\\n\\t// The session token.\\r\\n\\tvar sessionToken = request.cookies[cookieName];\\r\\n\\r\\n\\t// If there is a user signed in.\\r\\n\\tif (sessions.validSession(sessionToken)) {\\r\\n\\r\\n\\t\\t// Extend the user\\r\\n\\t\\tsessions.extend(sessionToken, response);\\r\\n\\r\\n\\t\\tvar user = sessions.getDetails(sessionToken);\\r\\n\\r\\n\\t\\t// Iterate over the user's details\\r\\n\\r\\n\\t\\t// Change the profile picture\\r\\n\\t\\tvar newPicture = changePicure(request, user);\\r\\n\\r\\n\\t\\t// Updated the password if there is a new password\\r\\n\\t\\t// specified\\r\\n\\t\\tvar password = user.password;\\r\\n\\t\\tif (request.body.password !== \\\"\\\") {\\r\\n\\t\\t\\tpassword = MD5.hash(request.body.password + user.salt);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// The updated user details\\r\\n\\t\\tvar newRow = {\\r\\n\\t\\t\\t\\\"email\\\" : user.email,\\r\\n\\t\\t\\t\\\"name\\\" : (user.name !== request.body.name) ? request.body.name : user.name,\\r\\n\\t\\t\\t\\\"organiser\\\" : request.body.organiser ? 'true' : 'false',\\r\\n\\t\\t\\t\\\"picture\\\" : (newPicture !== user.picture) ? newPicture : user.picture,\\r\\n\\t\\t\\t\\\"password\\\" : password,\\r\\n\\t\\t\\t\\\"salt\\\" : user.salt,\\r\\n\\t\\t\\t\\\"dob\\\" : user.dob,\\r\\n\\t\\t\\t\\\"telephone\\\" : (user.telephone !== request.body.telephone) ? request.body.telephone : user.telephone\\r\\n\\t\\t};\\r\\n\\r\\n\\t\\t// Update the user details in the database\\r\\n\\t\\tdb.run(\\r\\n\\t\\t\\t\\\"UPDATE Users SET name = ?, organiser = ?, picture = ?, password = ?, telephone = ? WHERE email = ?;\\\", \\r\\n\\t\\t\\t[newRow.name, newRow.organiser, newRow.picture, newRow.password, newRow.telephone, newRow.email ]\\r\\n\\t\\t);\\r\\n\\t\\t\\r\\n\\t\\t// Update the user's deatils that are stored in the session.\\r\\n\\t\\tsessions.updateUser(sessionToken, newRow)\\r\\n\\r\\n\\t\\tconsole.log(\\\"Profile Update [\\\" + user.email + \\\"]\\\");\\r\\n\\r\\n\\t\\tresponse.redirect('/profile?email=' + user.email);\\r\\n\\r\\n\\t} else {\\r\\n\\t\\t// If the session was invalid\\r\\n\\t\\tresponse.redirect('/');\\r\\n\\t}\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2145c2dc32e4ec20e2a09fb2add66188\",\n \"score\": \"0.59246194\",\n \"text\": \"function notificationProfile(profileid){\\r\\n\\tlocalStorage.setItem(\\\"userprofileid\\\", profileid);\\r\\n\\twindow.location = \\\"User_Profile.html\\\";\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"784e7b6365cdd72c017c6260da5b9e3f\",\n \"score\": \"0.5916971\",\n \"text\": \"function redirectionFromSignUP(){\\n \\n username = document.getElementById('user_name').value;\\n password = document.getElementById('password').value;\\n data= 'profile.html';\\n x();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dee6ec76545c2f4d9401cd2df7d55a9\",\n \"score\": \"0.59148693\",\n \"text\": \"renderPage() {\\n const { from } = this.props.location.state || { from: { pathname: /profile/ } };\\n // if correct authentication, redirect to from: page instead of signup screen\\n if (this.state.redirectToReferer) {\\n return <Redirect to={from}/>;\\n }\\n return (\\n <Grid container centered>\\n <Grid.Column>\\n <Divider hidden/>\\n <Header as=\\\"h2\\\" textAlign=\\\"center\\\">Edit Profile</Header>\\n <AutoForm schema={ProfileSchema} onSubmit={data => this.submit(data)} model={this.props.doc}>\\n <Segment inverted className='profileForm' very padded>\\n <Header as='h3' textAlign='center'>Profile Information</Header>\\n <Grid className='doubleLine'>\\n <TextField name='name'/>\\n <SelectField name='gender'/>\\n </Grid>\\n <TextField name='image' label='Image (URL)'/>\\n <LongTextField className='descBox' name='description'/>\\n <Header as='h3' textAlign='center'>Matching Information</Header>\\n <MultiSelectField name='interests'/>\\n <Grid className='doubleLine'>\\n <SelectField className='dropDownFix' name='seeking'/>\\n <SelectField className='dropDownFix' name='level'/>\\n <NumField name='age'/>\\n </Grid>\\n <TextField name='goals'/>\\n <SubmitField className='editProfileButton' value='Submit Changes'/>\\n <ErrorsField/>\\n <HiddenField name='owner'/>\\n </Segment>\\n </AutoForm>\\n </Grid.Column>\\n </Grid>\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0aa2e0309f7bb2e973cbd8623d977cca\",\n \"score\": \"0.59141827\",\n \"text\": \"editJob(id) {\\n window.location = \\\"/EditJob/\\\" + id;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32a5a6a69f7f54427e4dcdb4cd244380\",\n \"score\": \"0.5903399\",\n \"text\": \"function redirectIfLoggedIn(nextState, replace) {\\n\\t\\tif (Store.getState().user.loggedIn) {\\n\\t\\t\\treplace('/profile');\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a571b6a66277cef7ea3a0c7eb12e06a0\",\n \"score\": \"0.58814776\",\n \"text\": \"function newAccount() {\\n window.location.href = 'createAccount.html';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11ec93c082e4a2f74498a99aa815407f\",\n \"score\": \"0.58717185\",\n \"text\": \"function onlineprofileclick(val) {\\r\\n\\tlocalStorage.setItem(\\\"userprofileid\\\", val);\\r\\n\\twindow.location = \\\"User_Profile.html\\\";\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87afc8d22499c48ba03a1a942c27b308\",\n \"score\": \"0.58678454\",\n \"text\": \"function pEdit(req, res){\\n let name = req.user.name\\n User.findOne({name: name})\\n .then(person=>{\\n let port = person.portfolio.id(req.params.id)\\n res.render('users/edit', {\\n port,\\n user: req.user,\\n title: 'Portfolios'\\n })\\n })\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c3af040e1acec83006b2bf06f1b8998\",\n \"score\": \"0.5867791\",\n \"text\": \"function goToElon() {\\n var usp = new URLSearchParams();\\n usp.set(\\\"user\\\", \\\"user1\\\");\\n var url = location.pathname;\\n url = `${url}?${usp.toString()}`;\\n location.href = url;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b830c03697264bc042252bc3b6a9d73\",\n \"score\": \"0.5854384\",\n \"text\": \"function goToURL(param, url){\\r\\n\\tvar user = url.substring(url.indexOf('=')+1);\\r\\n\\tif (param=='view'){\\r\\n\\t window.location ='http://localhost:3000/get?username='+user;\\r\\n\\t}\\r\\n\\tif (param=='post'){\\r\\n\\t window.location ='http://localhost:3000/createDonation?username='+user;\\r\\n\\t}\\r\\n\\r\\n\\tif (param=='edit'){\\r\\n window.location ='http://localhost:3000/editProfile?username='+user;\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1ce6fdd4bfa03754fc9b74bd1ea2c86\",\n \"score\": \"0.58525735\",\n \"text\": \"function gotomakeaccount(e){\\n history.push(\\\"/register\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"300e6be6265a30536d5b80c030edf5c3\",\n \"score\": \"0.5849804\",\n \"text\": \"function addNewUserDetail() {\\n $(location).attr(\\\"href\\\", \\\"/login/new/add\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d5d7dca4dcecc8a1161a03640cdd958\",\n \"score\": \"0.584968\",\n \"text\": \"function personBtnUp(evt){\\n\\t\\tif(g.loginStatus){\\n\\t\\t\\tlocation.href = \\\"../personal-center/index.html\\\";\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tlocation.href = \\\"../login/login.html\\\";\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ead6a436bab17ab002148f34c76ba808\",\n \"score\": \"0.5842591\",\n \"text\": \"get editProfileLink() {\\n return this.clone(Profiles, \\\"EditProfileLink\\\").get();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"397cef7c818333e6aaf9792c3ccac1f9\",\n \"score\": \"0.5841215\",\n \"text\": \"function act_pres(idPresidente){\\t\\n\\twindow.location.assign('/admin/presidente/'+idPresidente); //es el que existe en el servidor\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1c1739b5e3440f361fdb881f4ced865\",\n \"score\": \"0.58254176\",\n \"text\": \"function requestEditProfile(username) {\\n\\tvar queryString = $(\\\"#profile-\\\" + username).serialize();\\n\\t$.ajax(\\n\\t{\\n\\t\\ttype: \\\"post\\\",\\n\\t\\turl: \\\"/profiles/:\\\" + username,\\n\\t\\tdata: queryString\\n\\t})\\n\\t.done(function(data)\\n\\t{\\n\\t\\talert(\\\"Profile updated!\\\");\\n\\t\\tlocation.reload();\\n\\t})\\n\\t.fail(function( jqXHR, textStatus )\\n {\\n alert( \\\"Failed to edit: \\\" + textStatus );\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"665d68fa339da3b0a90061b1613b331a\",\n \"score\": \"0.5823749\",\n \"text\": \"function myFunc(arg) {\\r\\n\\r\\n\\r\\n res.redirect('/profile/profile');\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac1f6b55f170940a7059f5e9dff498ef\",\n \"score\": \"0.5802028\",\n \"text\": \"function goToEditPage(button) {\\n // get the relevant item's id from the button.\\n let id = button.id; // id is in this format: edit-item-IT123 where IT123 is the itemId.\\n let itemId = id.includes('edit-item-') ? id.replace('edit-item-', '') : '';\\n\\n // navigate to edit page.\\n // we embed the item id in the edit page's URL so that the script/function running on that page,\\n // can identify which item needs to be edited.\\n // url: <host>:<port>/suppliers/items/edit-supply-item.html#<item id>.\\n // having something starting with a hash in the end of the url won't do any harm to url navigation.\\n window.location.href = currentLocation.includes('view-supply-items') ? currentLocation.replace('view-supply-items', 'edit-supply-item') + '#' + itemId : currentLocation; // redirection.\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b42234a49271acdeaa2a70f8a3943d6\",\n \"score\": \"0.57973224\",\n \"text\": \"function signUp(){\\n window.location.href = 'http://localhost/fitness.html' + '#signUp';\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3bb9225136657b8784409d26a66f5cf\",\n \"score\": \"0.57902807\",\n \"text\": \"editAppDeveloper() {\\n I.scrollTo(this.editUserLocators.bio);\\n I.fillField(this.editUserLocators.bio, 'I am Application Developer');\\n I.click(this.editUserLocators.save);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9c75651d0a4233415798af7da7dd924\",\n \"score\": \"0.5789823\",\n \"text\": \"function viewProfile(response, user, canEdit, navbar) {\\r\\n\\r\\n\\tvar profile = builder.viewProfile(user, canEdit);\\r\\n\\r\\n\\tvar head = builder.head(\\\"Profile\\\");\\r\\n\\tvar body = builder.body(navbar, profile);\\r\\n\\tvar page = builder.page(head, body);\\r\\n\\r\\n\\tmisc.buildResponse(response, page);\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da13532d9e57590f0e9bf2486e73084d\",\n \"score\": \"0.5788009\",\n \"text\": \"function newAccount() {\\n window.location.href = \\\"../CreateAccountPage/createAccount.html\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"128cc670512e12502466ff93544d611a\",\n \"score\": \"0.57752013\",\n \"text\": \"function goToAboutUs(){\\n window.location.href = \\\"../aboutus.html\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c38fcef31737420e8474ce87bc166f8e\",\n \"score\": \"0.5766108\",\n \"text\": \"function profile(currentUser) {\\n $http.get(`/users/${currentUser._id}`)\\n .then(function(response){\\n console.log('Profile route: ', response)\\n $state.go('profile', {userId: currentUser._id});\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f66292ae62890c3cc71b19a62183674\",\n \"score\": \"0.5763795\",\n \"text\": \"function editProfileModal() {\\n service.editUser = service.user;\\n editProfileForm.$promise.then(editProfileForm.show);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c3449a4da9b6060aaa4731d4bbdbea0\",\n \"score\": \"0.5751036\",\n \"text\": \"function userRedirection(userType) {\\n console.log(\\\"userRedirection Fired!\\\");\\n console.log(userType);\\n switch (userType) {\\n case \\\"student\\\":\\n console.log(userType);\\n window.location.replace(`${sessionCurrentURLPrefix}/Client/student.html`); //Change url here as shown in your port number.\\n break;\\n case \\\"worker\\\":\\n console.log(userType);\\n window.location.replace(`${sessionCurrentURLPrefix}/Client/worker.html`); //Change url here as shown in your port number.\\n break;\\n default:\\n console.log(userType);\\n console.log(\\\"No such email in system.\\\");\\n alert(\\\"No such user! Try Again...\\\");\\n document.getElementById(\\\"email\\\").value = \\\"\\\";\\n break;\\n }\\n ;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebafefde0806e5adc8a342402ed8c349\",\n \"score\": \"0.5741862\",\n \"text\": \"function forwardUser(){\\n window.location.href = \\\"../login/login.html\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c22d617c91208a0d19fff80260539c3\",\n \"score\": \"0.5739567\",\n \"text\": \"function get_edit(request, response) {\\r\\n\\r\\n\\t// If the email has been specifed.\\r\\n\\tif (request.query.email) {\\r\\n\\r\\n\\t\\tvar email = request.query.email;\\r\\n\\r\\n\\t\\tdb.each(\\r\\n\\t\\t\\t\\\"SELECT * FROM Users WHERE email = ?\\\", \\r\\n\\t\\t\\t[ email ], \\r\\n\\t\\t\\tfunction(user) {\\r\\n\\r\\n\\t\\t\\t\\t// Check for the session cookie and wherther it is\\r\\n\\t\\t\\t\\t// active.\\r\\n\\t\\t\\t\\tvar sessionToken = request.cookies[cookieName];\\r\\n\\t\\r\\n\\t\\t\\t\\tif (sessions.validSession(sessionToken)) {\\r\\n\\t\\t\\t\\t\\tsessions.extend(sessionToken, response);\\r\\n\\t\\r\\n\\t\\t\\t\\t\\tvar sessionUser = sessions.getDetails(sessionToken);\\r\\n\\t\\r\\n\\t\\t\\t\\t\\tif (sessionUser.email === email) {\\r\\n\\t\\r\\n\\t\\t\\t\\t\\t\\tvar home = builder.navbarLink(\\\"/\\\", \\\"Home\\\");\\r\\n\\t\\t\\t\\t\\t\\tvar logout = builder.navbarLink(\\\"/logout\\\", \\\"Logout\\\");\\r\\n\\t\\t\\t\\t\\t\\tvar newEvent = builder.navbarLink(\\\"/organise\\\", \\\"Orgainse Event\\\");\\r\\n\\t\\t\\t\\t\\t\\tvar search = builder.navbarLink(\\\"/search\\\", \\\"Search Events\\\");\\r\\n\\t\\t\\t\\t\\t\\tvar myEvents = builder.navbarLink(\\\"/events\\\", \\\"My Events\\\");\\r\\n\\t\\r\\n\\t\\t\\t\\t\\t\\tvar navbar = builder.navbar((user.organiser === 'true') ? [ home, newEvent, myEvents, search,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tlogout ] : [ home, search, logout ]);\\r\\n\\t\\r\\n\\t\\t\\t\\t\\t\\t// If the current user owns the profile\\r\\n\\t\\t\\t\\t\\t\\t// allow them to edit it.\\r\\n\\t\\t\\t\\t\\t\\teditProfile(response, user, navbar);\\r\\n\\t\\r\\n\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\tresponse.redirect('/profile?email=' + email);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tresponse.redirect('/profile?email=' + email);\\r\\n\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t}, \\r\\n\\t\\t\\tfunction(count) {\\r\\n\\r\\n\\t\\t\\t\\t/*\\r\\n\\t\\t\\t\\t * If there is no user with that email redirect to the landing page.\\r\\n\\t\\t\\t\\t */\\r\\n\\t\\t\\t\\tif (count == 0) {\\r\\n\\t\\t\\t\\t\\tresponse.redirect('/');\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t);\\r\\n\\r\\n\\t} else {\\r\\n\\t\\t// No valid session redirect the user to the home screen.\\r\\n\\t\\tresponse.redirect('/');\\r\\n\\t}\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1da06eb258bcda8c6bc9449a9c20b1a\",\n \"score\": \"0.5731587\",\n \"text\": \"function onEditClick() {\\n\\tvar site = location.origin\\n\\tvar path = site + \\\"/srv/events/edit/\\\" + $(this).attr(\\\"eid\\\");\\n\\tlocation.assign(path);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98999d09d6ad71778d88313a480c7e52\",\n \"score\": \"0.57167834\",\n \"text\": \"function handleActivityEdit() {\\n var currentActivity = $(this)\\n .parent()\\n .parent()\\n .data(\\\"activity\\\");\\n window.location.href = \\\"/cms?activity_id=\\\" + currentActivity.id;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f445d54847a9f1f2549b57d45937c7e\",\n \"score\": \"0.57149094\",\n \"text\": \"onUpdateClick (e) {\\n this.props.history.push('/profile-update');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c460ea87d2a3de08e9311e5f4a20cdef\",\n \"score\": \"0.57099456\",\n \"text\": \"_onViewProfile() {\\n this.authenticate(this._secret, () => {\\n this.authenticatorDialogs.setProfile(this._user);\\n this.authenticatorDialogs.get('profile').open();\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9c5867868bf3eb174ee25a652cc2d47\",\n \"score\": \"0.5705813\",\n \"text\": \"render() {\\n let redirect = \\\"\\\";\\n if (this.state.tempId === \\\"\\\") {\\n redirect = <Redirect to=\\\"/signup\\\" />;\\n }\\n return (\\n <div className=\\\"container\\\">\\n {redirect}\\n <h1 className=\\\"headerGreen\\\">Edit Profile</h1>\\n <hr />\\n <Form\\n model=\\\"editprofie\\\"\\n onSubmit={(values) => this.handlePatchedInfo(values)}\\n >\\n {\\\" \\\"}\\n <Row className=\\\"form-group\\\">\\n <Col xs={12} md={{ size: 6, offset: 3 }}>\\n <Label>Name</Label>\\n <Control.text\\n className=\\\"form-control\\\"\\n model=\\\".ID\\\"\\n id=\\\"ID\\\"\\n name=\\\"ID\\\"\\n placeholder=\\\"New Username\\\"\\n />\\n </Col>\\n </Row>\\n <Row className=\\\"form-group\\\">\\n <Col xs={12} md={{ size: 6, offset: 3 }}>\\n <Label>Email</Label>\\n <Control.text\\n className=\\\"form-control\\\"\\n model=\\\".email\\\"\\n id=\\\"email\\\"\\n name=\\\"email\\\"\\n placeholder=\\\"New Email\\\"\\n />\\n </Col>\\n </Row>\\n \\n <Row className=\\\"form-group\\\">\\n <Col xs={12} md={{ size: 6, offset: 3 }}>\\n <Label>Age</Label>\\n <Control.text\\n className=\\\"form-control\\\"\\n model=\\\".age\\\"\\n id=\\\"age\\\"\\n name=\\\"age\\\"\\n placeholder=\\\"New Age\\\"\\n />\\n </Col>\\n </Row>\\n\\n <Row className=\\\"form-group\\\">\\n <Col>\\n <Button className=\\\"EditProfileCancelButton\\\">\\n <Link className=\\\"EditProfileLinkInsideCancelButton\\\" to=\\\"/account/overview\\\">\\n cancel\\n </Link>\\n </Button>\\n </Col>\\n <Col>\\n <Button type=\\\"submit\\\" className=\\\"EditProfileSaveButton\\\">\\n Save Changes\\n </Button>\\n </Col>\\n </Row>\\n </Form>\\n </div>\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b4d4b10551126b18d0752bc8767a509\",\n \"score\": \"0.5702829\",\n \"text\": \"function goToProfile(userId, goodreadsId) {\\n\\t\\tconsole.log('doing gotorpofile');\\n\\t\\t$scope.grDone = true;\\t\\t\\n\\t\\t$timeout(function(){\\n\\t\\t\\t$location.path( \\\"/profile\\\" )\\n\\t\\t //$location.path('#/profile').replace();\\n\\t //$scope.$apply();\\n\\t\\t});\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffc683ba6f3028bada9ab5ee5c208d3b\",\n \"score\": \"0.56992257\",\n \"text\": \"function handleEntryEdit() {\\n var currentEntry = $(this)\\n .parent()\\n .parent()\\n .data(\\\"entry\\\");\\n window.location.href = \\\"/entry/:entry_id=\\\" + currentEntry.entryId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0df74ac988c11c911c3aa46cc2d1dd4e\",\n \"score\": \"0.5698632\",\n \"text\": \"function register(){\\n window.location.href = window.location + '#signUp';\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fb236437aeeb77a6073b27c05f7501d\",\n \"score\": \"0.5690241\",\n \"text\": \"function gotopage(pageID) {\\n\\n\\t// REDIRECT USER TO PAGE\\n\\tswitch(pageID) {\\n\\t\\tcase \\\"dashpage\\\":\\n\\t\\t\\twindow.location.replace(\\\"dashpage.html\\\");\\n\\t\\t\\tbreak;\\n\\t\\tcase \\\"favpage\\\":\\n\\t\\t\\twindow.location.replace(\\\"favpage.html\\\");\\n\\t\\t\\tbreak;\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fe6cb9d0fd1dfc088ff294827cd7ca9\",\n \"score\": \"0.56854236\",\n \"text\": \"function backUser(){\\n location.href = \\\"UserPage.html\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"055b9455cb754c26f850182b58c30c92\",\n \"score\": \"0.568242\",\n \"text\": \"function redirectToPetDetail() {\\n res.redirect(\\\"/project/#/shelter/\\\" + shelterId + \\\"/pet/\\\" + petId);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c129c9be8f42a529e91786ff25c4368\",\n \"score\": \"0.5682128\",\n \"text\": \"function redirectUser(nextLink) {\\n\\tconsole.log(\\\"redirecting user...\\\");\\n\\twindow.location.replace(nextLink);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6bee2f32d80cf754cde5de48df9bd2a\",\n \"score\": \"0.5681647\",\n \"text\": \"function newpages() {\\n window.location.href = \\\"applicant-details.html\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6304e44b115d4214d523b2c7136b384\",\n \"score\": \"0.5681463\",\n \"text\": \"function editUser($userId) {\\n $state.go('admin.users.edit', {userId : $userId});\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea336a744a1cd02d70ccdd0b517be50a\",\n \"score\": \"0.56699353\",\n \"text\": \"function updateAuthor(id){\\r\\n window.location = \\\"/authors?type=Update&_id=\\\"+id;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c3d43ee6aedcfc3eb0efbd90cb68ccc\",\n \"score\": \"0.5666268\",\n \"text\": \"function Redirect() {\\n window.location.replace(\\\"/post/\\\" + postId);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dda1afcfb34868b79af2e56dea447ae6\",\n \"score\": \"0.56467694\",\n \"text\": \"function courseInfoChange(){\\n alert(\\\"The course information has been successfully editted.\\\");\\n window.location = 'http://cs3319.gaul.csd.uwo.ca/vm071/a3joseph/indexpage.php';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ceda38e4564ed4f21347d74ea3647fb7\",\n \"score\": \"0.56463355\",\n \"text\": \"function redirectPage(){\\n setCookie(\\\"tutorial\\\", \\\"true\\\");\\n window.location.href = \\\"https://foodwheelapp.herokuapp.com/profile\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ca51bf95cda364ee12dd5a484ff3e5e\",\n \"score\": \"0.56461364\",\n \"text\": \"function add_teacher()\\n{\\n window.location = document.getElementById('cfg').className + '/local/placement/user/viewprincipal.php?view=add';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8e1eb1e58494311767daba89be8aaab\",\n \"score\": \"0.5633231\",\n \"text\": \"function gotocontact(){\\n\\twindow.location = \\\"contact.html\\\"\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3492a7ccf1c8bd57fe263b29b6b6170\",\n \"score\": \"0.562621\",\n \"text\": \"function clickProfile(k) {\\r\\n\\tvar id = useridlist[k].value1;\\r\\n\\tlocalStorage.setItem(\\\"userprofileid\\\", id);\\r\\n\\tlocalStorage.setItem(\\\"wantbudyrequest\\\", \\\"no\\\");\\r\\n\\twindow.location = \\\"User_Profile.html\\\";\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e84f71b78117a0cbe462e35f936c5e7\",\n \"score\": \"0.56239426\",\n \"text\": \"async function EditProfile(e) {\\n e.preventDefault();\\n await updateRow(user.data.id, { nama: name, email: email }).then(\\n handleClose\\n );\\n window.location.reload();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":88,"cells":{"query_id":{"kind":"string","value":"6b1dce8cde8b24e069020263745fbf26"},"query":{"kind":"string","value":"Is stdout a TTY? Colored output is enabled when `true`."},"positive_passages":{"kind":"list like","value":[{"docid":"637a3c942a626401fe3c5bc99f726b4e","score":"0.69316745","text":"function useColors() {\n var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\n if (0 === debugColors.length) {\n return tty.isatty(fd);\n } else {\n return '0' !== debugColors\n && 'no' !== debugColors\n && 'false' !== debugColors\n && 'disabled' !== debugColors;\n }\n}","title":""}],"string":"[\n {\n \"docid\": \"637a3c942a626401fe3c5bc99f726b4e\",\n \"score\": \"0.69316745\",\n \"text\": \"function useColors() {\\n var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\\n if (0 === debugColors.length) {\\n return tty.isatty(fd);\\n } else {\\n return '0' !== debugColors\\n && 'no' !== debugColors\\n && 'false' !== debugColors\\n && 'disabled' !== debugColors;\\n }\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"0e40e3456ca6a316c8fcd7d0d38c545f","score":"0.7625948","text":"function stdoutOK() {\n\treturn process.stdout._type === 'tty' || typeof config !== 'object' || config?.console?.output;\n} // stdoutOK()","title":""},{"docid":"4985d83c67c8e9785aefbe56b8f83dfa","score":"0.74181","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","title":""},{"docid":"4985d83c67c8e9785aefbe56b8f83dfa","score":"0.74181","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","title":""},{"docid":"4985d83c67c8e9785aefbe56b8f83dfa","score":"0.74181","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","title":""},{"docid":"4985d83c67c8e9785aefbe56b8f83dfa","score":"0.74181","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","title":""},{"docid":"4985d83c67c8e9785aefbe56b8f83dfa","score":"0.74181","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","title":""},{"docid":"4985d83c67c8e9785aefbe56b8f83dfa","score":"0.74181","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","title":""},{"docid":"36ca6fc5fe19f6fe0bc41d3933785cb3","score":"0.74055946","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n }","title":""},{"docid":"bb8656a1fb840d97013f4b19c08560b8","score":"0.73937875","text":"function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","title":""},{"docid":"bb8656a1fb840d97013f4b19c08560b8","score":"0.73937875","text":"function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","title":""},{"docid":"bb8656a1fb840d97013f4b19c08560b8","score":"0.73937875","text":"function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","title":""},{"docid":"251c9b075376a234bd53d0a9e502e09d","score":"0.73526853","text":"function useColors() {\n return \"colors\" in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n }","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"e6855d323c837f92fb1235aa2dcd2b3b","score":"0.73336977","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(fd);\n}","title":""},{"docid":"0cd8e71020ff2a4869c1c2833ccf0a52","score":"0.72921425","text":"function useColors() {\n \treturn 'colors' in exports.inspectOpts ?\n \t\tBoolean(exports.inspectOpts.colors) :\n \t\ttty.isatty(process.stderr.fd);\n }","title":""},{"docid":"0cd8e71020ff2a4869c1c2833ccf0a52","score":"0.72921425","text":"function useColors() {\n \treturn 'colors' in exports.inspectOpts ?\n \t\tBoolean(exports.inspectOpts.colors) :\n \t\ttty.isatty(process.stderr.fd);\n }","title":""},{"docid":"e62df80a0f8ee9c372f040e841b2a506","score":"0.72740763","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty__default['default'].isatty(process.stderr.fd);\n}","title":""},{"docid":"067b9ebdb7323b9af040b5359c9df867","score":"0.7270053","text":"function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(fd);\n}","title":""},{"docid":"067b9ebdb7323b9af040b5359c9df867","score":"0.7270053","text":"function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(fd);\n}","title":""},{"docid":"34c0e7bdef5116e1348ca555dd79e1c7","score":"0.7268683","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty$1.isatty(fd);\n}","title":""},{"docid":"34c0e7bdef5116e1348ca555dd79e1c7","score":"0.7268683","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty$1.isatty(fd);\n}","title":""},{"docid":"34c0e7bdef5116e1348ca555dd79e1c7","score":"0.7268683","text":"function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty$1.isatty(fd);\n}","title":""},{"docid":"badda53e7f20069c4395cf77cbf3d699","score":"0.72624487","text":"function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(fd);\n }","title":""},{"docid":"badda53e7f20069c4395cf77cbf3d699","score":"0.72624487","text":"function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(fd);\n }","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"d193868ecdf3226b1ed1edf51f54b2e8","score":"0.72593033","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty.isatty(process.stderr.fd);\n}","title":""},{"docid":"63a25bbc6a9e6487a2eaa59b4dc73bda","score":"0.72201","text":"function useColors() {\n return \"colors\" in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : $3uB8d$tty.isatty(fd);\n}","title":""},{"docid":"63a25bbc6a9e6487a2eaa59b4dc73bda","score":"0.72201","text":"function useColors() {\n return \"colors\" in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : $3uB8d$tty.isatty(fd);\n}","title":""},{"docid":"0358a41697735acfc4eb0523fdaff0df","score":"0.7214083","text":"function useColors() {\n\treturn 'colors' in exports.inspectOpts ?\n\t\tBoolean(exports.inspectOpts.colors) :\n\t\ttty__default[\"default\"].isatty(process.stderr.fd);\n}","title":""},{"docid":"ee3678c2fad5aa8b826d66a11192d2ac","score":"0.71970433","text":"function useColors() {\n\t\treturn 'colors' in exports.inspectOpts\n\t\t\t? Boolean(exports.inspectOpts.colors)\n\t\t\t: tty.isatty(process.stderr.fd);\n\t}","title":""},{"docid":"ef9c6a387560f6a779b29a9e55c367e5","score":"0.6978733","text":"function useColors() {\n\t var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\n\t if (0 === debugColors.length) {\n\t return tty.isatty(fd);\n\t } else {\n\t return '0' !== debugColors\n\t && 'no' !== debugColors\n\t && 'false' !== debugColors\n\t && 'disabled' !== debugColors;\n\t }\n\t}","title":""},{"docid":"ef9c6a387560f6a779b29a9e55c367e5","score":"0.6978733","text":"function useColors() {\n\t var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\n\t if (0 === debugColors.length) {\n\t return tty.isatty(fd);\n\t } else {\n\t return '0' !== debugColors\n\t && 'no' !== debugColors\n\t && 'false' !== debugColors\n\t && 'disabled' !== debugColors;\n\t }\n\t}","title":""},{"docid":"682b9d4ba29e12a953cbb19c524531ed","score":"0.69431925","text":"function useColors() {\n var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\n if (0 === debugColors.length) {\n return tty.isatty(fd);\n } else {\n return '0' !== debugColors && 'no' !== debugColors && 'false' !== debugColors && 'disabled' !== debugColors;\n }\n}","title":""},{"docid":"f08dbd09f607fa2caaf63d958e5d9635","score":"0.6916647","text":"function useColors() {\n var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\n if (0 === debugColors.length) {\n return tty.isatty(fd);\n } else {\n return '0' !== debugColors\n && 'no' !== debugColors\n && 'false' !== debugColors\n && 'disabled' !== debugColors;\n }\n }","title":""},{"docid":"73504e42cf62b1b73a6e00c4029d257a","score":"0.68504375","text":"function $a221420965ec853c$var$useColors() {\n return \"colors\" in module.exports.inspectOpts ? Boolean(module.exports.inspectOpts.colors) : $3uB8d$tty.isatty(process.stderr.fd);\n}","title":""},{"docid":"b682c57a39071f3c3a0b2a61d9316e37","score":"0.6833869","text":"function useColors() {\n var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\n if (0 === debugColors.length) {\n return tty.isatty(1);\n } else {\n return '0' !== debugColors\n && 'no' !== debugColors\n && 'false' !== debugColors\n && 'disabled' !== debugColors;\n }\n}","title":""},{"docid":"e93a8000bd9de1505ae43dd1d3483d3e","score":"0.6822965","text":"function should_not_output() {\n\t// Err on the side of caution\n\tif (typeof config === 'undefined') return false;\n\tif (typeof config.console === 'undefined') return false;\n\tif (typeof config.console.output === 'undefined') return false;\n\n\t// If we're in a TTY, output to stdout\n\t// If we're not, only output if config.console.output is true\n\tlet active_tty = Boolean(process.stdout.isTTY) && Boolean(process.stdin.isTTY);\n\tswitch (active_tty) {\n\t\tcase true : return false;\n\t\tcase false : return !config.console.output;\n\t}\n}","title":""},{"docid":"35a9053c594824028dfa14b14b57997d","score":"0.6616449","text":"function useColors() {\n\t var debugColors = (({\"NODE_ENV\":\"production\"}).DEBUG_COLORS || '').trim().toLowerCase();\n\t if (0 === debugColors.length) {\n\t return tty.isatty(fd);\n\t } else {\n\t return '0' !== debugColors\n\t && 'no' !== debugColors\n\t && 'false' !== debugColors\n\t && 'disabled' !== debugColors;\n\t }\n\t}","title":""},{"docid":"cbc2e5a62b6a3d09896624e8dfe811f2","score":"0.6390999","text":"function isConsoleActive()\r\n\t{\r\n\t\tif (typeof console == 'undefined')\r\n\t\t{\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn ('log' in console);\r\n\t}","title":""},{"docid":"c6d215dbdcde92d4a97e38b6ff60a3a6","score":"0.591949","text":"function setIsTTY (isTTY) {\n Object.defineProperty(this, 'isTTY', {\n value: isTTY,\n enumerable: true,\n writable: true,\n configurable: true\n })\n}","title":""},{"docid":"c6d215dbdcde92d4a97e38b6ff60a3a6","score":"0.591949","text":"function setIsTTY (isTTY) {\n Object.defineProperty(this, 'isTTY', {\n value: isTTY,\n enumerable: true,\n writable: true,\n configurable: true\n })\n}","title":""}],"string":"[\n {\n \"docid\": \"0e40e3456ca6a316c8fcd7d0d38c545f\",\n \"score\": \"0.7625948\",\n \"text\": \"function stdoutOK() {\\n\\treturn process.stdout._type === 'tty' || typeof config !== 'object' || config?.console?.output;\\n} // stdoutOK()\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4985d83c67c8e9785aefbe56b8f83dfa\",\n \"score\": \"0.74181\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4985d83c67c8e9785aefbe56b8f83dfa\",\n \"score\": \"0.74181\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4985d83c67c8e9785aefbe56b8f83dfa\",\n \"score\": \"0.74181\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4985d83c67c8e9785aefbe56b8f83dfa\",\n \"score\": \"0.74181\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4985d83c67c8e9785aefbe56b8f83dfa\",\n \"score\": \"0.74181\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4985d83c67c8e9785aefbe56b8f83dfa\",\n \"score\": \"0.74181\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36ca6fc5fe19f6fe0bc41d3933785cb3\",\n \"score\": \"0.74055946\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb8656a1fb840d97013f4b19c08560b8\",\n \"score\": \"0.73937875\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb8656a1fb840d97013f4b19c08560b8\",\n \"score\": \"0.73937875\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb8656a1fb840d97013f4b19c08560b8\",\n \"score\": \"0.73937875\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"251c9b075376a234bd53d0a9e502e09d\",\n \"score\": \"0.73526853\",\n \"text\": \"function useColors() {\\n return \\\"colors\\\" in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6855d323c837f92fb1235aa2dcd2b3b\",\n \"score\": \"0.73336977\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cd8e71020ff2a4869c1c2833ccf0a52\",\n \"score\": \"0.72921425\",\n \"text\": \"function useColors() {\\n \\treturn 'colors' in exports.inspectOpts ?\\n \\t\\tBoolean(exports.inspectOpts.colors) :\\n \\t\\ttty.isatty(process.stderr.fd);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cd8e71020ff2a4869c1c2833ccf0a52\",\n \"score\": \"0.72921425\",\n \"text\": \"function useColors() {\\n \\treturn 'colors' in exports.inspectOpts ?\\n \\t\\tBoolean(exports.inspectOpts.colors) :\\n \\t\\ttty.isatty(process.stderr.fd);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e62df80a0f8ee9c372f040e841b2a506\",\n \"score\": \"0.72740763\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty__default['default'].isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"067b9ebdb7323b9af040b5359c9df867\",\n \"score\": \"0.7270053\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"067b9ebdb7323b9af040b5359c9df867\",\n \"score\": \"0.7270053\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34c0e7bdef5116e1348ca555dd79e1c7\",\n \"score\": \"0.7268683\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty$1.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34c0e7bdef5116e1348ca555dd79e1c7\",\n \"score\": \"0.7268683\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty$1.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34c0e7bdef5116e1348ca555dd79e1c7\",\n \"score\": \"0.7268683\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty$1.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"badda53e7f20069c4395cf77cbf3d699\",\n \"score\": \"0.72624487\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(fd);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"badda53e7f20069c4395cf77cbf3d699\",\n \"score\": \"0.72624487\",\n \"text\": \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(fd);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d193868ecdf3226b1ed1edf51f54b2e8\",\n \"score\": \"0.72593033\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63a25bbc6a9e6487a2eaa59b4dc73bda\",\n \"score\": \"0.72201\",\n \"text\": \"function useColors() {\\n return \\\"colors\\\" in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : $3uB8d$tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63a25bbc6a9e6487a2eaa59b4dc73bda\",\n \"score\": \"0.72201\",\n \"text\": \"function useColors() {\\n return \\\"colors\\\" in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : $3uB8d$tty.isatty(fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0358a41697735acfc4eb0523fdaff0df\",\n \"score\": \"0.7214083\",\n \"text\": \"function useColors() {\\n\\treturn 'colors' in exports.inspectOpts ?\\n\\t\\tBoolean(exports.inspectOpts.colors) :\\n\\t\\ttty__default[\\\"default\\\"].isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee3678c2fad5aa8b826d66a11192d2ac\",\n \"score\": \"0.71970433\",\n \"text\": \"function useColors() {\\n\\t\\treturn 'colors' in exports.inspectOpts\\n\\t\\t\\t? Boolean(exports.inspectOpts.colors)\\n\\t\\t\\t: tty.isatty(process.stderr.fd);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef9c6a387560f6a779b29a9e55c367e5\",\n \"score\": \"0.6978733\",\n \"text\": \"function useColors() {\\n\\t var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\\n\\t if (0 === debugColors.length) {\\n\\t return tty.isatty(fd);\\n\\t } else {\\n\\t return '0' !== debugColors\\n\\t && 'no' !== debugColors\\n\\t && 'false' !== debugColors\\n\\t && 'disabled' !== debugColors;\\n\\t }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef9c6a387560f6a779b29a9e55c367e5\",\n \"score\": \"0.6978733\",\n \"text\": \"function useColors() {\\n\\t var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\\n\\t if (0 === debugColors.length) {\\n\\t return tty.isatty(fd);\\n\\t } else {\\n\\t return '0' !== debugColors\\n\\t && 'no' !== debugColors\\n\\t && 'false' !== debugColors\\n\\t && 'disabled' !== debugColors;\\n\\t }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"682b9d4ba29e12a953cbb19c524531ed\",\n \"score\": \"0.69431925\",\n \"text\": \"function useColors() {\\n var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\\n if (0 === debugColors.length) {\\n return tty.isatty(fd);\\n } else {\\n return '0' !== debugColors && 'no' !== debugColors && 'false' !== debugColors && 'disabled' !== debugColors;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f08dbd09f607fa2caaf63d958e5d9635\",\n \"score\": \"0.6916647\",\n \"text\": \"function useColors() {\\n var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\\n if (0 === debugColors.length) {\\n return tty.isatty(fd);\\n } else {\\n return '0' !== debugColors\\n && 'no' !== debugColors\\n && 'false' !== debugColors\\n && 'disabled' !== debugColors;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73504e42cf62b1b73a6e00c4029d257a\",\n \"score\": \"0.68504375\",\n \"text\": \"function $a221420965ec853c$var$useColors() {\\n return \\\"colors\\\" in module.exports.inspectOpts ? Boolean(module.exports.inspectOpts.colors) : $3uB8d$tty.isatty(process.stderr.fd);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b682c57a39071f3c3a0b2a61d9316e37\",\n \"score\": \"0.6833869\",\n \"text\": \"function useColors() {\\n var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\\n if (0 === debugColors.length) {\\n return tty.isatty(1);\\n } else {\\n return '0' !== debugColors\\n && 'no' !== debugColors\\n && 'false' !== debugColors\\n && 'disabled' !== debugColors;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e93a8000bd9de1505ae43dd1d3483d3e\",\n \"score\": \"0.6822965\",\n \"text\": \"function should_not_output() {\\n\\t// Err on the side of caution\\n\\tif (typeof config === 'undefined') return false;\\n\\tif (typeof config.console === 'undefined') return false;\\n\\tif (typeof config.console.output === 'undefined') return false;\\n\\n\\t// If we're in a TTY, output to stdout\\n\\t// If we're not, only output if config.console.output is true\\n\\tlet active_tty = Boolean(process.stdout.isTTY) && Boolean(process.stdin.isTTY);\\n\\tswitch (active_tty) {\\n\\t\\tcase true : return false;\\n\\t\\tcase false : return !config.console.output;\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35a9053c594824028dfa14b14b57997d\",\n \"score\": \"0.6616449\",\n \"text\": \"function useColors() {\\n\\t var debugColors = (({\\\"NODE_ENV\\\":\\\"production\\\"}).DEBUG_COLORS || '').trim().toLowerCase();\\n\\t if (0 === debugColors.length) {\\n\\t return tty.isatty(fd);\\n\\t } else {\\n\\t return '0' !== debugColors\\n\\t && 'no' !== debugColors\\n\\t && 'false' !== debugColors\\n\\t && 'disabled' !== debugColors;\\n\\t }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbc2e5a62b6a3d09896624e8dfe811f2\",\n \"score\": \"0.6390999\",\n \"text\": \"function isConsoleActive()\\r\\n\\t{\\r\\n\\t\\tif (typeof console == 'undefined')\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\t\\treturn ('log' in console);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6d215dbdcde92d4a97e38b6ff60a3a6\",\n \"score\": \"0.591949\",\n \"text\": \"function setIsTTY (isTTY) {\\n Object.defineProperty(this, 'isTTY', {\\n value: isTTY,\\n enumerable: true,\\n writable: true,\\n configurable: true\\n })\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6d215dbdcde92d4a97e38b6ff60a3a6\",\n \"score\": \"0.591949\",\n \"text\": \"function setIsTTY (isTTY) {\\n Object.defineProperty(this, 'isTTY', {\\n value: isTTY,\\n enumerable: true,\\n writable: true,\\n configurable: true\\n })\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":89,"cells":{"query_id":{"kind":"string","value":"a40766ae734abb32e6155521f076e305"},"query":{"kind":"string","value":"Close modal window and bg"},"positive_passages":{"kind":"list like","value":[{"docid":"af8546168a97cb0a51a50d3ec523674b","score":"0.6966335","text":"function closeModal(){\r\n\t\t$modal.fadeOut(200, function(){\r\n\t\t\t$(\".jqx-validator-error-label\").html(\"\");\r\n\t\t\t$(\"#joinUserId, #joinpassword, #passwordChk, #joinemail, #VerificationCode\").val(\"\");\r\n\t\t});\r\n\t\t$modal_bg.fadeOut(200, function(){\r\n\t\t\t$(\".jqx-validator-error-label\").html(\"\");\r\n\t\t\t$(\"#joinUserId, #joinpassword, #passwordChk, #joinemail, #VerificationCode\").val(\"\");\r\n\t\t});\r\n\t\t$('a[href^=\"#modal-\"].active').focus().removeClass('active');\r\n\t\t$(\"#user_id, #password\").val(\"\");\r\n\t}","title":""}],"string":"[\n {\n \"docid\": \"af8546168a97cb0a51a50d3ec523674b\",\n \"score\": \"0.6966335\",\n \"text\": \"function closeModal(){\\r\\n\\t\\t$modal.fadeOut(200, function(){\\r\\n\\t\\t\\t$(\\\".jqx-validator-error-label\\\").html(\\\"\\\");\\r\\n\\t\\t\\t$(\\\"#joinUserId, #joinpassword, #passwordChk, #joinemail, #VerificationCode\\\").val(\\\"\\\");\\r\\n\\t\\t});\\r\\n\\t\\t$modal_bg.fadeOut(200, function(){\\r\\n\\t\\t\\t$(\\\".jqx-validator-error-label\\\").html(\\\"\\\");\\r\\n\\t\\t\\t$(\\\"#joinUserId, #joinpassword, #passwordChk, #joinemail, #VerificationCode\\\").val(\\\"\\\");\\r\\n\\t\\t});\\r\\n\\t\\t$('a[href^=\\\"#modal-\\\"].active').focus().removeClass('active');\\r\\n\\t\\t$(\\\"#user_id, #password\\\").val(\\\"\\\");\\r\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"a99f87148fb915298b5ac756c0833f4c","score":"0.7837651","text":"function closeModal() {\n modalbg.style.display = \"none\";\n}","title":""},{"docid":"66e83cf7ef711a18672ca45668a10231","score":"0.7817357","text":"function close_modal(){\n $('#modal_background').toggle();\n $('#modal_dialog').toggle()\n}","title":""},{"docid":"443f75492776ddd99d96be835cd74584","score":"0.7745006","text":"function closeModal() {\n windows.close($('#modalContainer .window').attr('id'));\n }","title":""},{"docid":"f3ec1f55b9683992759cddb111069281","score":"0.7708287","text":"function closeModal() {\n bodyId.removeAttribute(\"style\");\n modalId.removeAttribute(\"style\");\n memoryGameBoard();\n }","title":""},{"docid":"cbcaf7cfc1ef1633ff7a674ac1b0a721","score":"0.7701133","text":"function closeModal2() {\n modBackground.style.display = \"none\";\n}","title":""},{"docid":"8b8e8da85a0877a757ace9aa0c4fc739","score":"0.7683922","text":"function closePopup(){\n $('.overlay-bg, .modal').hide();\n }","title":""},{"docid":"a130dd88868e755087b8f5ab69b2550c","score":"0.76555836","text":"function _modal_close() {\n\t\t\tvar _overlay = wpmUi._modal_overlay();\n\t\t\tif ( ! _wnd ) { return false; }\n\t\t\tif ( ! _overlay instanceof jQuery ) { return false; }\n\n\t\t\t_overlay.off( 'click', _modal_close );\n\t\t\t_me.hide();\n\t\t}","title":""},{"docid":"70728c9b70a668bb184960d8768c4a74","score":"0.7601219","text":"function closePopup()\n\t\t{\t\t\t\t\n\t\t\tif (isLocalfileOrServer!=true) {\n\t\t\t\twindow.shell.checkhostReachable() \n\t\t\t\tif(onLineFlag==\"offline\"){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\t$('#modalwrapper').hide();\n\t\t\t$(\"#shellHeader\").show();\t\n\t\t\t$(\".btnclose\").off('click');\t\t\t\n\t\t\t$(ref.globalThumb).find('.svgIcon').show();\t\t\t\n\t\t\t$(ref.container).find('.modal-dialog').find('.modal-content').find('.modal-body').find('div').getNiceScroll().hide();\n\t\t\tenableNext(ref.modalID)\n\t\t}","title":""},{"docid":"8379aff3c4d9accc11b11096bd2c0dcc","score":"0.759455","text":"function closeModal() {\n modalbg.style.display = \"none\";\n form.reset();\n removeInvalidStyling();\n removeConfirmation();\n}","title":""},{"docid":"c92e0cf42e3f99845751ee4087d4c391","score":"0.75569725","text":"function closeModal(){\n c('.pizzaWindowArea').style.opacity = 0;\n setTimeout(()=>{\n c('.pizzaWindowArea').style.display = 'none'\n }, 500)\n}","title":""},{"docid":"7b9dc59e334e98777e74ffc5716a6ea0","score":"0.7468964","text":"function close() {\n bulmaModal.destroy();\n }","title":""},{"docid":"2f51758f04dd66b03ecd9c0d88fd73c6","score":"0.74655753","text":"function closeModal() {\n\t$('.modal-bg').fadeOut();\n\t$('.modal').fadeOut().removeClass('modal-on');\n}","title":""},{"docid":"7bb9ecbd0a4b75c264e95eb633073a57","score":"0.7443704","text":"closeModal() {\n\t\tthis.modal.removeClass(\"modal--is-visible\");\n\t\treturn false; /* don't forget to add --is-visible rule in _modal.css */\n\t}","title":""},{"docid":"df882a7a2828cbdef015fb0a0da3421f","score":"0.7442379","text":"function closePopUp() { modal.style.display = \"none\"; }","title":""},{"docid":"a69168dfc21d1aafda2b1f290a82532f","score":"0.7388993","text":"closeModal() {\n this.args.close();\n }","title":""},{"docid":"af8e2fd232eb55640614631fccf0cd6b","score":"0.7388634","text":"close() {\n this.stopSlideVideo(this.activeSlide)\n addClass(this.modal, 'glightbox-closing')\n animateElement(this.overlay, this.settings.cssEfects.fade.out)\n animateElement(this.activeSlide, this.settings.cssEfects.zoom.out, () => {\n this.activeSlide = null\n this.prevActiveSlideIndex = null\n this.prevActiveSlide = null\n\n if (this.events) {\n for (var key in this.events) {\n if (this.events.hasOwnProperty(key)) {\n this.events[key].destroy()\n }\n }\n }\n\n removeClass(body, 'glightbox-open')\n removeClass(html, 'glightbox-open')\n removeClass(body, 'touching')\n removeClass(body, 'gdesc-open')\n body.style.width = '';\n this.modal.parentNode.removeChild(this.modal)\n if (utils.isFunction(this.settings.onClose)) {\n this.settings.onClose();\n }\n });\n }","title":""},{"docid":"bca1d6a86689947dd133026d7412ef9e","score":"0.7360758","text":"closeModal() {\n this.bShowModal = false;\n }","title":""},{"docid":"bca1d6a86689947dd133026d7412ef9e","score":"0.7360758","text":"closeModal() {\n this.bShowModal = false;\n }","title":""},{"docid":"0fc241d635a6f5a5ec585c3de3339f74","score":"0.7335422","text":"function closeModal() {\n\tmodalmegan.style.display = 'none';\n}","title":""},{"docid":"80c0e94f931480a92af51422fd39b565","score":"0.7333819","text":"function close(){\n\t\tresizePopin();\n\t\toptions.hide(domElement);\n\t}","title":""},{"docid":"2446d67836dfc736f2fbaced4520ea61","score":"0.73219526","text":"function closes3en() {\r\n document.getElementById(\"modal3en\").style.display=\"none\"; \r\n}","title":""},{"docid":"3c8454dda1390cb09fe7149fa7b4543d","score":"0.7314044","text":"function modalClose() {\n\n modal.animate([{opacity: '1.0'}, {opacity: '0.0'}], \n {duration: 300, fill:'forwards'});\n\n modalOverlay.animate([{opacity: '1.0'}, {opacity: '0.0'}], \n {duration: 150, fill:'forwards'});\n\n body.style.overflow = \"\";\n\n setTimeout(() => { modalOverlay.style.display = \"none\"; modal.style.display = \"none\"; }, 400);\n\n }","title":""},{"docid":"89fa016873090cc09580b06c632022d6","score":"0.7297828","text":"function closeModal(result) {\n close(null, 500);\n }","title":""},{"docid":"179cea8435a23e01f7df9393b9e6b37d","score":"0.72935534","text":"async closeModal() {\r\n this.emitAnalyticsData(dxp.i18n.t('Modal:cancel'));\r\n const shadowRoot = this.element ? this.element : this.element;\r\n const demoButton = shadowRoot.querySelector('#demoButton');\r\n shadowRoot.querySelector('.dxp-modal').classList.remove('show');\r\n shadowRoot.querySelector('.dxp-comp-modal').classList.remove('visible');\r\n document.querySelector('body').style.overflow = 'auto';\r\n if (demoButton) {\r\n setTimeout(() => {\r\n this.focusElement(demoButton);\r\n });\r\n }\r\n this.modalClose.emit();\r\n }","title":""},{"docid":"526cf098fb78c70319c9c6cce387abf7","score":"0.728774","text":"closeModal() {\n this.close();\n }","title":""},{"docid":"526cf098fb78c70319c9c6cce387abf7","score":"0.728774","text":"closeModal() {\n this.close();\n }","title":""},{"docid":"14041180539b4f11f3b38ba78d770468","score":"0.72725326","text":"function closeModal() {\n modalbg.style.display = \"none\";\n document.location.reload();\n}","title":""},{"docid":"862e3dc0271dbe736a3aad228967c70d","score":"0.72703034","text":"function closes3decom() {\r\n document.getElementById(\"modal3decom\").style.display=\"none\"; \r\n}","title":""},{"docid":"e0e14da166f6a953a06fdfbce044abeb","score":"0.7262207","text":"function closeNonModal(event){if(myNonModalLightbox)myNonModalLightbox.close();}","title":""},{"docid":"068a1631537f2e2b1e7a746f79014a7d","score":"0.7244844","text":"function closeModal() {\n modal.style.display = \"none\";\n }","title":""},{"docid":"6b486aafae83fc9c8762ed4937487b6d","score":"0.7233731","text":"function modalClose () {\n modal.style.display = 'none';\n}","title":""},{"docid":"2e1583a37f1f447735d6d88b9f3ef05e","score":"0.7229048","text":"function closes3com() {\r\n document.getElementById(\"modal3com\").style.display=\"none\"; \r\n}","title":""},{"docid":"7668d970948f1f1807430947aa5cba6a","score":"0.72264946","text":"function closeModal() {\n\t\t\tdocument.getElementById(\"winnerModal\").style.display = \"none\";\n\t\t}","title":""},{"docid":"c1f4b4ef51d43c8a959931857cd50417","score":"0.72081846","text":"function closeModal() {\r\n clothModal.style.display = \"none\";\r\n}","title":""},{"docid":"4c1ac9a22e5a3c1f901e05825fe2d5e0","score":"0.72041744","text":"exit() {\n if (this.view) {\n $('#modalShadow').hide();\n this.view.hide();\n this.view = null;\n }\n }","title":""},{"docid":"9c54fcca85b4c8a488681a9e01f54c27","score":"0.71827024","text":"function close_modal() {\n $overlay.fadeOut(200);\n $modal.css({ 'display' : 'none' });\n\n $overlay.off('click', close_modal);\n $(o.closeButton).off('click', close_modal);\n $window.off('resize', resizeDebouncer);\n\n }","title":""},{"docid":"c96c648963b3cd83e625edefb5871f44","score":"0.7171839","text":"function closeLeetCodeModal() {\n document.getElementById(\"leetCodeModal\").classList.remove(\"is-active\");\n document.documentElement.classList.remove(\"is-clipped\");\n}","title":""},{"docid":"6ab393098a144563a72f9e23b353d65c","score":"0.71428835","text":"function closePopUp() {\n document.getElementById(\"modalForRemoteLogger\").setAttribute(\"show\", false);\n }","title":""},{"docid":"7ccb28fe3a2741e82e3943cfd1bc7f90","score":"0.71405077","text":"function closeModal(){\n $(\".modal-mask\").removeClass(\"modal-active\");\n }","title":""},{"docid":"4f9e314386d50a17ca6f5b5210f78fd0","score":"0.71369416","text":"function closeModal() {\r\n modal.style.display = \"none\";\r\n}","title":""},{"docid":"74a929cd86092aaf36b1ca8b3c31bacc","score":"0.7135547","text":"function close(){\n modal.style.display = \"none\";\n init();\n}","title":""},{"docid":"266eed5a046b6386c93215a04c2f17b3","score":"0.71327823","text":"function closeModal() {\n body.removeChild(modalContainer);\n}","title":""},{"docid":"8a2dd87fbc499f8162b9f1b1e248c241","score":"0.71285766","text":"function closeLightbox(){\n modal.style.display = 'none';\n}","title":""},{"docid":"f0c1ca264336d3afaf9229551735ce0b","score":"0.712613","text":"function closeModal()\r\n{\r\n modal.style.display = 'none';\r\n}","title":""},{"docid":"a35c63b4751c5ea22d8c98f3a520f8af","score":"0.7106692","text":"function closeModal() {\n const closeIcon = document.querySelector(\".exit\");\n closeIcon.addEventListener(\"click\", function(){\n const popUp = document.getElementById(\"modal\");\n popUp.classList.remove(\"show\");\n document.querySelector(\"#canvas\").style.visibility=\"hidden\";\n //initGame();\n})\n}","title":""},{"docid":"e693d0b5cd035fdd675f0582e8d2e191","score":"0.7093997","text":"function closegoModal(evt) {\n gameOver.style.display = \"none\";\n}","title":""},{"docid":"e693d0b5cd035fdd675f0582e8d2e191","score":"0.7093997","text":"function closegoModal(evt) {\n gameOver.style.display = \"none\";\n}","title":""},{"docid":"517062e7058fd3892d1dc49d4cc92b5a","score":"0.7090302","text":"function closeModal() {\n\tmodal.style.display = 'none';\n}","title":""},{"docid":"2032beb010589b5d7854d7cef962d84b","score":"0.7087029","text":"function closeModal() {\n modal.style.display = \"none\";\n}","title":""},{"docid":"2032beb010589b5d7854d7cef962d84b","score":"0.7087029","text":"function closeModal() {\n modal.style.display = \"none\";\n}","title":""},{"docid":"4c4ab4384f5ecc5ec116da0249d50415","score":"0.7077802","text":"function modalClose() {\n\n // fade out container\n container.style.opacity = 1.0;\n\n // bring modal to front\n modal.style.display = \"none\";\n\n // set modal state\n modalState = \"closed\";\n}","title":""},{"docid":"f903d6501f0093478a8d3c1cd5cbac40","score":"0.70773345","text":"function closeModal() {\r\n modal.style.display = \"none\";\r\n}","title":""},{"docid":"a85822d7fd0670a5cdde970f3eacb16d","score":"0.70718676","text":"close() {\n if (!this.active_) {\n return;\n }\n\n if (this.keyboardHandler_) {\n document.body.removeEventListener('keydown', this.keyboardHandler_);\n this.keyboardHandler_ = null;\n }\n\n // Restore the original Y position before the modal was opened.\n window.scrollTo(0, this.scrollY_);\n\n // Move the modal body element back to its original container.\n const modalEl = this.getModalWrapper();\n modalEl.appendChild(this.modalDialog_.getModalBody());\n\n // Destroy the modal element.\n this.modalDialog_.destroy();\n this.modalDialog_ = null;\n\n if (this.enableHashHistory_) {\n window.history.pushState({\n 'modalId': null,\n }, '' /* title */, window.location.pathname);\n }\n\n this.active_ = false;\n\n if (this.onClose_) {\n this.onClose_();\n }\n }","title":""},{"docid":"7c35f51389ef2ef508da67b73c7d29a0","score":"0.70715946","text":"function closeModal() {\r\n // Hide modal divs, hide modal from screen-readers and resset main content to scroll\r\n modal[0].setAttribute('hidden', 'hidden');\r\n modal[0].setAttribute('aria-hidden', 'true');\r\n overlay[0].setAttribute('hidden', 'hidden');\r\n document.body.style.overflow = '';\r\n\r\n // Remove event listeners for when modal is open\r\n closeButtons[0].removeEventListener('click', closeModal);\r\n closeButtons[1].removeEventListener('click', closeModal);\r\n document.body.removeEventListener('keydown', checkKeyPress);\r\n gameSetup(urlParams.game);\r\n}","title":""},{"docid":"a635706aa6f4cbc8f29f0e458a63864e","score":"0.707111","text":"function closeModal() {\n modal.style.display = 'none';\n}","title":""},{"docid":"a635706aa6f4cbc8f29f0e458a63864e","score":"0.707111","text":"function closeModal() {\n modal.style.display = 'none';\n}","title":""},{"docid":"a635706aa6f4cbc8f29f0e458a63864e","score":"0.707111","text":"function closeModal() {\n modal.style.display = 'none';\n}","title":""},{"docid":"4fc2c99ca6d2bcd2e7f18e66689a7906","score":"0.70710105","text":"function closeModal() {\n document.querySelector(\".mask\").classList.remove(\"active\");\n }","title":""},{"docid":"ce4c148a13fa3d24bee9faf4308a549e","score":"0.7060905","text":"function closeModal(){\n \n modal.style.display=\"none\";\n \n }","title":""},{"docid":"ce90fd2d0bef21dcd623356e5b8651a5","score":"0.7057585","text":"close(){\n isfull = false;\n myWindow.close();\n return \"bye\";\n }","title":""},{"docid":"3e834e0e1189ad571ca1e51b5c9b8c12","score":"0.7057301","text":"function closeModalArtiste(){\n\tdocument.getElementById(\"fader\").style.display=\"none\";\n\tdocument.getElementById(\"popup_artiste\").innerHTML=\"\";\n}","title":""},{"docid":"c7c70dcda234396667ec47dca6b724fe","score":"0.7054391","text":"function closeModal() {\n\t$(\"#welcome_modal\").modal(\"hide\");\n\twindow.showModal = false;\n}","title":""},{"docid":"56976258ee2d44c612fff98f0f1f26fb","score":"0.7054267","text":"function closeModal() {\n modal.style.display = \"none\"; \n}","title":""},{"docid":"485e706fd776fce0116097037391c1bf","score":"0.7052939","text":"function closeModal(){\n\tmodal.style.display = \"none\";\n init();\n}","title":""},{"docid":"8d8b61f61b365865413326d8ca72b75d","score":"0.70521045","text":"function closeModal() {\n modal.style.display = \"none\";\n}","title":""},{"docid":"708f29073f1da6a248853d5c878b76a8","score":"0.70515335","text":"function closeModal(e) {\n if(e.key === 'Escape') {\n Anim.Helpers.hidshowbody('auto')\n SetAppState.setImageModalState({ isOpen: false, current: 0, images: {} })\n }\n }","title":""},{"docid":"b76af3eb5451b3bb72b38f2cf8ef28b0","score":"0.7048322","text":"function closeModalWindow() {\n //Fade out the greyed background\n $('.modal-bg').fadeOut();\n //Fade out the modal window\n $('.modal').fadeOut();\n // Clear input fields\n $('.inputField').val('');\n // Reset select value to default\n $('#subjectInput option').prop('selected', function() {\n return this.defaultSelected;\n });\n}","title":""},{"docid":"c967fe95721765ae5f97a2eb87583e86","score":"0.70471126","text":"function closeModal(){\r\n closeicon.addEventListener(\"click\", function(e){\r\n modal.classList.remove(\"show\");\r\n window.close();\r\n });\r\n}","title":""},{"docid":"67fe005963c193c012d04c8db8f70294","score":"0.7042235","text":"function closeModal() {\n modal.style.display = 'none';\n}","title":""},{"docid":"67fe005963c193c012d04c8db8f70294","score":"0.7042235","text":"function closeModal() {\n modal.style.display = 'none';\n}","title":""},{"docid":"2c1ea8c88c2c17a1c12333ad25d2b86b","score":"0.7041773","text":"function closeModalAtWindowClick(event){\n if (event.target.classList.contains('modal-container')){\n $modalContainer.classList.remove('show-modal');\n render();\n }\n}","title":""},{"docid":"42769fcaaeb558e31e2b58e9548f1b6f","score":"0.7041279","text":"close() {\n\t\tthis._closeHandlers.forEach(fn => fn(this));\n\n\t\tthis.remove();\n\t\tdocument.body.style.overflowY = 'scroll';\n\t\tALBModal.currentModal = null;\n\t}","title":""},{"docid":"2248a99c59223777e89d5e265027207a","score":"0.7035261","text":"function closePopup()\n {\n var win = document.querySelector(\".window--modal\");\n if (win) {\n var api = win.data_api;\n if(api) api.close();\n }\n }","title":""},{"docid":"9dff939c5a29937c8a8f8b2a06a4cba9","score":"0.70349747","text":"function closeModal() {\n handleOpen(!modalOpen)\n }","title":""},{"docid":"a59dff27a5e6471b57261d0fc614d281","score":"0.70293593","text":"function closeModal(){\n\tmodal.style.display = 'none';\n}","title":""},{"docid":"37cba95e7e2d142fcf88eb2922d0e703","score":"0.7024939","text":"function closeClassicRulesModal() {\n classicRulesModal.style.display = 'none';\n }","title":""},{"docid":"909729ae14de98a47c04d26ae70b9557","score":"0.702359","text":"function closeModal(){\n $('#div_modal').remove();\n $('.fade').css('opacity','1');\n $('#result p').text('');\n $('#div_loading4').removeClass('hide');\n $('#div_loading4').addClass('centreV');\n recalculate();\n\n }","title":""},{"docid":"6ce0ed0b3455988a9df3ff0d0c37bfea","score":"0.702165","text":"handleModalClosing(){\n this.openModal = false;\n }","title":""},{"docid":"616af40051af631d2020bd7af55fcdae","score":"0.7017989","text":"function closePopup(){\n $('.overlay-bg, .overlay-content').hide(); //hide the overlay\n }","title":""},{"docid":"bfad92cb588dcb18ebaee435901831ee","score":"0.701578","text":"function closeWindow() {\n\toPopup.hide();\n}","title":""},{"docid":"f77f334777fa44ad906c91873f488107","score":"0.7009528","text":"function closeModal(){\n // modal.style.display = 'none';\n // backdrop.style.display = 'none';\n\n //similarly other pages won't have modals, so in order to get js executed,\n //we need to check if the modal exists and only then remove or add classes\n if (modal) modal.classList.remove('open');\n \n backdrop.classList.remove('open');\n}","title":""},{"docid":"238e6e417e6d172de515a6de615e2eeb","score":"0.700529","text":"function fn_ev_closeBTN () {\n \n modal._hide(function () {\n $this.removeClass('modal_blur');\n });\n }","title":""},{"docid":"9ab977d2e8e67e66dfa730a62fb9ead5","score":"0.6997922","text":"function closeModal() {\n overlay.classList.remove('show-modal');\n startGame();\n}","title":""},{"docid":"837cc793caa587837a51f9a9dab76469","score":"0.6994996","text":"function close(args)\n {\n args = args || {};\n \n var element = args.element || false;\n if (element) {\n $('#' + element).hide();\n } else {\n $('div.lightbox').hide();\n }\n \n // Only hide the modal if no other lightboxes exist\n // This is meant to prevent closing a lightbox on an lightbox from hiding both modals.\n // e.g., \"it was used on themes template within the toolkit lightbox\" - Kyle 12/15/10\n $.each($('.lightbox'), function()\n {\n if ($(this).css('display') !== 'none') {\n return false;\n } else {\n hideModal();\n }\n });\n \n // Currently this is only used for stopping playback of flowplayers in clickPic\n $('body').trigger('lightbox.closed');\n }","title":""},{"docid":"9b217d3703dde632720bb4413f1026fb","score":"0.6989021","text":"function closeMmodal(){\n\t\tvar $this = $(this);\n\t\t$('.project_show', $body).removeClass('project_show');\n\t}","title":""},{"docid":"eed35b73e1da70aee97964775762d5ca","score":"0.69866276","text":"function closeModal(){\n modal.style.display = 'none';\n}","title":""},{"docid":"03e13fd656e6742ff7d436e499b871bc","score":"0.69785076","text":"function closeModal() {\n $(\".modal\").css(\"display\",\"none\");\n}","title":""},{"docid":"95a02c1b96837ec97ad60140ca275994","score":"0.6977545","text":"function closeWindow () {\n event.preventDefault()\n overlayShowing.style.display = \"none\"\n modalShowing.style.display = \"none\"\n clearFields()\n}","title":""},{"docid":"0df62b39a723f0cac9d71b05997f1829","score":"0.6970575","text":"function closeModal(){\n\tmodal.style.display='none';\n}","title":""},{"docid":"4e8b3a1c39d761e0eda2f3b2c289290c","score":"0.6964541","text":"function closeModal(){\n modal.style.display = 'none';\n}","title":""},{"docid":"4e8b3a1c39d761e0eda2f3b2c289290c","score":"0.6964541","text":"function closeModal(){\n modal.style.display = 'none';\n}","title":""},{"docid":"4e8b3a1c39d761e0eda2f3b2c289290c","score":"0.6964541","text":"function closeModal(){\n modal.style.display = 'none';\n}","title":""},{"docid":"4e8b3a1c39d761e0eda2f3b2c289290c","score":"0.6964541","text":"function closeModal(){\n modal.style.display = 'none';\n}","title":""},{"docid":"1a8db7f8d44e81722a08984f8506aef4","score":"0.6961207","text":"function closeFunction() {\n modal.style.display = \"none\";\n modalImg.style.display = \"none\";//hhhh\n}","title":""},{"docid":"a136292cacd3ad19baa4b5e8920668b3","score":"0.6960013","text":"function draugiemWindowClose() {\n\tdraugiemLoadUrl({'action': 'closeinfobox'});\n}","title":""},{"docid":"7bfaf449bb423167aa10d99210bf064e","score":"0.69580096","text":"function closeModal(e){\r\n document.getElementById(\"uploadModal\").style.visibility = 'hidden';\r\n document.getElementById(\"uploadModalContent\").style.visibility = 'hidden';\r\n document.getElementById(\"fullmodal\").style.visibility = 'hidden';\r\n document.getElementById(\"uploadModal\").style.zIndex = '-1';\r\n document.getElementById(\"fullmodal\").style.zIndex = '-1';\r\n}","title":""},{"docid":"36159ca36e8c9f4c673d881d9b4689ba","score":"0.69575095","text":"function closeModal(){\n\n\t\tvar modalXClicked = document.getElementsByClassName(\"modal\")[0];\n\t\tvar modalXClicked2 = document.getElementsByClassName(\"modal__content\")[0];\n\t\tmodalXClicked.style.display = \"none\";\n\t\tmodalXClicked2.style.display = \"none\";\n\t}","title":""},{"docid":"d53ec8704349fead7a8014e4bbaa7210","score":"0.6954834","text":"function quitFromQuitModal(){\n document.getElementById(\"quit-modal\").style.display = 'none';\n returnToMenu();\n}","title":""},{"docid":"8f361809f1a3a1895ed5aefecf90b912","score":"0.6954308","text":"function close() {\n // Unbind the events\n $(window).unbind('resize', modalContentResize);\n $('body').unbind( 'focus', modalEventHandler);\n $('body').unbind( 'keypress', modalEventHandler );\n $('.close').unbind('click', modalContentClose);\n $('body').unbind('keypress', modalEventEscapeCloseHandler);\n $(document).trigger('CToolsDetachBehaviors', $('#modalContent'));\n\n // Set our animation parameters and use them\n if ( animation == 'fadeIn' ) animation = 'fadeOut';\n if ( animation == 'slideDown' ) animation = 'slideUp';\n if ( animation == 'show' ) animation = 'hide';\n\n // Close the content\n modalContent.hide()[animation](speed);\n\n // Remove the content\n $('#modalContent').remove();\n $('#modalBackdrop').remove();\n }","title":""},{"docid":"8f361809f1a3a1895ed5aefecf90b912","score":"0.6954308","text":"function close() {\n // Unbind the events\n $(window).unbind('resize', modalContentResize);\n $('body').unbind( 'focus', modalEventHandler);\n $('body').unbind( 'keypress', modalEventHandler );\n $('.close').unbind('click', modalContentClose);\n $('body').unbind('keypress', modalEventEscapeCloseHandler);\n $(document).trigger('CToolsDetachBehaviors', $('#modalContent'));\n\n // Set our animation parameters and use them\n if ( animation == 'fadeIn' ) animation = 'fadeOut';\n if ( animation == 'slideDown' ) animation = 'slideUp';\n if ( animation == 'show' ) animation = 'hide';\n\n // Close the content\n modalContent.hide()[animation](speed);\n\n // Remove the content\n $('#modalContent').remove();\n $('#modalBackdrop').remove();\n }","title":""}],"string":"[\n {\n \"docid\": \"a99f87148fb915298b5ac756c0833f4c\",\n \"score\": \"0.7837651\",\n \"text\": \"function closeModal() {\\n modalbg.style.display = \\\"none\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66e83cf7ef711a18672ca45668a10231\",\n \"score\": \"0.7817357\",\n \"text\": \"function close_modal(){\\n $('#modal_background').toggle();\\n $('#modal_dialog').toggle()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"443f75492776ddd99d96be835cd74584\",\n \"score\": \"0.7745006\",\n \"text\": \"function closeModal() {\\n windows.close($('#modalContainer .window').attr('id'));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3ec1f55b9683992759cddb111069281\",\n \"score\": \"0.7708287\",\n \"text\": \"function closeModal() {\\n bodyId.removeAttribute(\\\"style\\\");\\n modalId.removeAttribute(\\\"style\\\");\\n memoryGameBoard();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbcaf7cfc1ef1633ff7a674ac1b0a721\",\n \"score\": \"0.7701133\",\n \"text\": \"function closeModal2() {\\n modBackground.style.display = \\\"none\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b8e8da85a0877a757ace9aa0c4fc739\",\n \"score\": \"0.7683922\",\n \"text\": \"function closePopup(){\\n $('.overlay-bg, .modal').hide();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a130dd88868e755087b8f5ab69b2550c\",\n \"score\": \"0.76555836\",\n \"text\": \"function _modal_close() {\\n\\t\\t\\tvar _overlay = wpmUi._modal_overlay();\\n\\t\\t\\tif ( ! _wnd ) { return false; }\\n\\t\\t\\tif ( ! _overlay instanceof jQuery ) { return false; }\\n\\n\\t\\t\\t_overlay.off( 'click', _modal_close );\\n\\t\\t\\t_me.hide();\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70728c9b70a668bb184960d8768c4a74\",\n \"score\": \"0.7601219\",\n \"text\": \"function closePopup()\\n\\t\\t{\\t\\t\\t\\t\\n\\t\\t\\tif (isLocalfileOrServer!=true) {\\n\\t\\t\\t\\twindow.shell.checkhostReachable() \\n\\t\\t\\t\\tif(onLineFlag==\\\"offline\\\"){\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t$('#modalwrapper').hide();\\n\\t\\t\\t$(\\\"#shellHeader\\\").show();\\t\\n\\t\\t\\t$(\\\".btnclose\\\").off('click');\\t\\t\\t\\n\\t\\t\\t$(ref.globalThumb).find('.svgIcon').show();\\t\\t\\t\\n\\t\\t\\t$(ref.container).find('.modal-dialog').find('.modal-content').find('.modal-body').find('div').getNiceScroll().hide();\\n\\t\\t\\tenableNext(ref.modalID)\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8379aff3c4d9accc11b11096bd2c0dcc\",\n \"score\": \"0.759455\",\n \"text\": \"function closeModal() {\\n modalbg.style.display = \\\"none\\\";\\n form.reset();\\n removeInvalidStyling();\\n removeConfirmation();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c92e0cf42e3f99845751ee4087d4c391\",\n \"score\": \"0.75569725\",\n \"text\": \"function closeModal(){\\n c('.pizzaWindowArea').style.opacity = 0;\\n setTimeout(()=>{\\n c('.pizzaWindowArea').style.display = 'none'\\n }, 500)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b9dc59e334e98777e74ffc5716a6ea0\",\n \"score\": \"0.7468964\",\n \"text\": \"function close() {\\n bulmaModal.destroy();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f51758f04dd66b03ecd9c0d88fd73c6\",\n \"score\": \"0.74655753\",\n \"text\": \"function closeModal() {\\n\\t$('.modal-bg').fadeOut();\\n\\t$('.modal').fadeOut().removeClass('modal-on');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bb9ecbd0a4b75c264e95eb633073a57\",\n \"score\": \"0.7443704\",\n \"text\": \"closeModal() {\\n\\t\\tthis.modal.removeClass(\\\"modal--is-visible\\\");\\n\\t\\treturn false; /* don't forget to add --is-visible rule in _modal.css */\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df882a7a2828cbdef015fb0a0da3421f\",\n \"score\": \"0.7442379\",\n \"text\": \"function closePopUp() { modal.style.display = \\\"none\\\"; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a69168dfc21d1aafda2b1f290a82532f\",\n \"score\": \"0.7388993\",\n \"text\": \"closeModal() {\\n this.args.close();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af8e2fd232eb55640614631fccf0cd6b\",\n \"score\": \"0.7388634\",\n \"text\": \"close() {\\n this.stopSlideVideo(this.activeSlide)\\n addClass(this.modal, 'glightbox-closing')\\n animateElement(this.overlay, this.settings.cssEfects.fade.out)\\n animateElement(this.activeSlide, this.settings.cssEfects.zoom.out, () => {\\n this.activeSlide = null\\n this.prevActiveSlideIndex = null\\n this.prevActiveSlide = null\\n\\n if (this.events) {\\n for (var key in this.events) {\\n if (this.events.hasOwnProperty(key)) {\\n this.events[key].destroy()\\n }\\n }\\n }\\n\\n removeClass(body, 'glightbox-open')\\n removeClass(html, 'glightbox-open')\\n removeClass(body, 'touching')\\n removeClass(body, 'gdesc-open')\\n body.style.width = '';\\n this.modal.parentNode.removeChild(this.modal)\\n if (utils.isFunction(this.settings.onClose)) {\\n this.settings.onClose();\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bca1d6a86689947dd133026d7412ef9e\",\n \"score\": \"0.7360758\",\n \"text\": \"closeModal() {\\n this.bShowModal = false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bca1d6a86689947dd133026d7412ef9e\",\n \"score\": \"0.7360758\",\n \"text\": \"closeModal() {\\n this.bShowModal = false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0fc241d635a6f5a5ec585c3de3339f74\",\n \"score\": \"0.7335422\",\n \"text\": \"function closeModal() {\\n\\tmodalmegan.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80c0e94f931480a92af51422fd39b565\",\n \"score\": \"0.7333819\",\n \"text\": \"function close(){\\n\\t\\tresizePopin();\\n\\t\\toptions.hide(domElement);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2446d67836dfc736f2fbaced4520ea61\",\n \"score\": \"0.73219526\",\n \"text\": \"function closes3en() {\\r\\n document.getElementById(\\\"modal3en\\\").style.display=\\\"none\\\"; \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c8454dda1390cb09fe7149fa7b4543d\",\n \"score\": \"0.7314044\",\n \"text\": \"function modalClose() {\\n\\n modal.animate([{opacity: '1.0'}, {opacity: '0.0'}], \\n {duration: 300, fill:'forwards'});\\n\\n modalOverlay.animate([{opacity: '1.0'}, {opacity: '0.0'}], \\n {duration: 150, fill:'forwards'});\\n\\n body.style.overflow = \\\"\\\";\\n\\n setTimeout(() => { modalOverlay.style.display = \\\"none\\\"; modal.style.display = \\\"none\\\"; }, 400);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89fa016873090cc09580b06c632022d6\",\n \"score\": \"0.7297828\",\n \"text\": \"function closeModal(result) {\\n close(null, 500);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"179cea8435a23e01f7df9393b9e6b37d\",\n \"score\": \"0.72935534\",\n \"text\": \"async closeModal() {\\r\\n this.emitAnalyticsData(dxp.i18n.t('Modal:cancel'));\\r\\n const shadowRoot = this.element ? this.element : this.element;\\r\\n const demoButton = shadowRoot.querySelector('#demoButton');\\r\\n shadowRoot.querySelector('.dxp-modal').classList.remove('show');\\r\\n shadowRoot.querySelector('.dxp-comp-modal').classList.remove('visible');\\r\\n document.querySelector('body').style.overflow = 'auto';\\r\\n if (demoButton) {\\r\\n setTimeout(() => {\\r\\n this.focusElement(demoButton);\\r\\n });\\r\\n }\\r\\n this.modalClose.emit();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"526cf098fb78c70319c9c6cce387abf7\",\n \"score\": \"0.728774\",\n \"text\": \"closeModal() {\\n this.close();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"526cf098fb78c70319c9c6cce387abf7\",\n \"score\": \"0.728774\",\n \"text\": \"closeModal() {\\n this.close();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14041180539b4f11f3b38ba78d770468\",\n \"score\": \"0.72725326\",\n \"text\": \"function closeModal() {\\n modalbg.style.display = \\\"none\\\";\\n document.location.reload();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"862e3dc0271dbe736a3aad228967c70d\",\n \"score\": \"0.72703034\",\n \"text\": \"function closes3decom() {\\r\\n document.getElementById(\\\"modal3decom\\\").style.display=\\\"none\\\"; \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0e14da166f6a953a06fdfbce044abeb\",\n \"score\": \"0.7262207\",\n \"text\": \"function closeNonModal(event){if(myNonModalLightbox)myNonModalLightbox.close();}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"068a1631537f2e2b1e7a746f79014a7d\",\n \"score\": \"0.7244844\",\n \"text\": \"function closeModal() {\\n modal.style.display = \\\"none\\\";\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b486aafae83fc9c8762ed4937487b6d\",\n \"score\": \"0.7233731\",\n \"text\": \"function modalClose () {\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e1583a37f1f447735d6d88b9f3ef05e\",\n \"score\": \"0.7229048\",\n \"text\": \"function closes3com() {\\r\\n document.getElementById(\\\"modal3com\\\").style.display=\\\"none\\\"; \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7668d970948f1f1807430947aa5cba6a\",\n \"score\": \"0.72264946\",\n \"text\": \"function closeModal() {\\n\\t\\t\\tdocument.getElementById(\\\"winnerModal\\\").style.display = \\\"none\\\";\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1f4b4ef51d43c8a959931857cd50417\",\n \"score\": \"0.72081846\",\n \"text\": \"function closeModal() {\\r\\n clothModal.style.display = \\\"none\\\";\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c1ac9a22e5a3c1f901e05825fe2d5e0\",\n \"score\": \"0.72041744\",\n \"text\": \"exit() {\\n if (this.view) {\\n $('#modalShadow').hide();\\n this.view.hide();\\n this.view = null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c54fcca85b4c8a488681a9e01f54c27\",\n \"score\": \"0.71827024\",\n \"text\": \"function close_modal() {\\n $overlay.fadeOut(200);\\n $modal.css({ 'display' : 'none' });\\n\\n $overlay.off('click', close_modal);\\n $(o.closeButton).off('click', close_modal);\\n $window.off('resize', resizeDebouncer);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c96c648963b3cd83e625edefb5871f44\",\n \"score\": \"0.7171839\",\n \"text\": \"function closeLeetCodeModal() {\\n document.getElementById(\\\"leetCodeModal\\\").classList.remove(\\\"is-active\\\");\\n document.documentElement.classList.remove(\\\"is-clipped\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ab393098a144563a72f9e23b353d65c\",\n \"score\": \"0.71428835\",\n \"text\": \"function closePopUp() {\\n document.getElementById(\\\"modalForRemoteLogger\\\").setAttribute(\\\"show\\\", false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ccb28fe3a2741e82e3943cfd1bc7f90\",\n \"score\": \"0.71405077\",\n \"text\": \"function closeModal(){\\n $(\\\".modal-mask\\\").removeClass(\\\"modal-active\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f9e314386d50a17ca6f5b5210f78fd0\",\n \"score\": \"0.71369416\",\n \"text\": \"function closeModal() {\\r\\n modal.style.display = \\\"none\\\";\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74a929cd86092aaf36b1ca8b3c31bacc\",\n \"score\": \"0.7135547\",\n \"text\": \"function close(){\\n modal.style.display = \\\"none\\\";\\n init();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"266eed5a046b6386c93215a04c2f17b3\",\n \"score\": \"0.71327823\",\n \"text\": \"function closeModal() {\\n body.removeChild(modalContainer);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a2dd87fbc499f8162b9f1b1e248c241\",\n \"score\": \"0.71285766\",\n \"text\": \"function closeLightbox(){\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0c1ca264336d3afaf9229551735ce0b\",\n \"score\": \"0.712613\",\n \"text\": \"function closeModal()\\r\\n{\\r\\n modal.style.display = 'none';\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a35c63b4751c5ea22d8c98f3a520f8af\",\n \"score\": \"0.7106692\",\n \"text\": \"function closeModal() {\\n const closeIcon = document.querySelector(\\\".exit\\\");\\n closeIcon.addEventListener(\\\"click\\\", function(){\\n const popUp = document.getElementById(\\\"modal\\\");\\n popUp.classList.remove(\\\"show\\\");\\n document.querySelector(\\\"#canvas\\\").style.visibility=\\\"hidden\\\";\\n //initGame();\\n})\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e693d0b5cd035fdd675f0582e8d2e191\",\n \"score\": \"0.7093997\",\n \"text\": \"function closegoModal(evt) {\\n gameOver.style.display = \\\"none\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e693d0b5cd035fdd675f0582e8d2e191\",\n \"score\": \"0.7093997\",\n \"text\": \"function closegoModal(evt) {\\n gameOver.style.display = \\\"none\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"517062e7058fd3892d1dc49d4cc92b5a\",\n \"score\": \"0.7090302\",\n \"text\": \"function closeModal() {\\n\\tmodal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2032beb010589b5d7854d7cef962d84b\",\n \"score\": \"0.7087029\",\n \"text\": \"function closeModal() {\\n modal.style.display = \\\"none\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2032beb010589b5d7854d7cef962d84b\",\n \"score\": \"0.7087029\",\n \"text\": \"function closeModal() {\\n modal.style.display = \\\"none\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c4ab4384f5ecc5ec116da0249d50415\",\n \"score\": \"0.7077802\",\n \"text\": \"function modalClose() {\\n\\n // fade out container\\n container.style.opacity = 1.0;\\n\\n // bring modal to front\\n modal.style.display = \\\"none\\\";\\n\\n // set modal state\\n modalState = \\\"closed\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f903d6501f0093478a8d3c1cd5cbac40\",\n \"score\": \"0.70773345\",\n \"text\": \"function closeModal() {\\r\\n modal.style.display = \\\"none\\\";\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a85822d7fd0670a5cdde970f3eacb16d\",\n \"score\": \"0.70718676\",\n \"text\": \"close() {\\n if (!this.active_) {\\n return;\\n }\\n\\n if (this.keyboardHandler_) {\\n document.body.removeEventListener('keydown', this.keyboardHandler_);\\n this.keyboardHandler_ = null;\\n }\\n\\n // Restore the original Y position before the modal was opened.\\n window.scrollTo(0, this.scrollY_);\\n\\n // Move the modal body element back to its original container.\\n const modalEl = this.getModalWrapper();\\n modalEl.appendChild(this.modalDialog_.getModalBody());\\n\\n // Destroy the modal element.\\n this.modalDialog_.destroy();\\n this.modalDialog_ = null;\\n\\n if (this.enableHashHistory_) {\\n window.history.pushState({\\n 'modalId': null,\\n }, '' /* title */, window.location.pathname);\\n }\\n\\n this.active_ = false;\\n\\n if (this.onClose_) {\\n this.onClose_();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c35f51389ef2ef508da67b73c7d29a0\",\n \"score\": \"0.70715946\",\n \"text\": \"function closeModal() {\\r\\n // Hide modal divs, hide modal from screen-readers and resset main content to scroll\\r\\n modal[0].setAttribute('hidden', 'hidden');\\r\\n modal[0].setAttribute('aria-hidden', 'true');\\r\\n overlay[0].setAttribute('hidden', 'hidden');\\r\\n document.body.style.overflow = '';\\r\\n\\r\\n // Remove event listeners for when modal is open\\r\\n closeButtons[0].removeEventListener('click', closeModal);\\r\\n closeButtons[1].removeEventListener('click', closeModal);\\r\\n document.body.removeEventListener('keydown', checkKeyPress);\\r\\n gameSetup(urlParams.game);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a635706aa6f4cbc8f29f0e458a63864e\",\n \"score\": \"0.707111\",\n \"text\": \"function closeModal() {\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a635706aa6f4cbc8f29f0e458a63864e\",\n \"score\": \"0.707111\",\n \"text\": \"function closeModal() {\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a635706aa6f4cbc8f29f0e458a63864e\",\n \"score\": \"0.707111\",\n \"text\": \"function closeModal() {\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fc2c99ca6d2bcd2e7f18e66689a7906\",\n \"score\": \"0.70710105\",\n \"text\": \"function closeModal() {\\n document.querySelector(\\\".mask\\\").classList.remove(\\\"active\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce4c148a13fa3d24bee9faf4308a549e\",\n \"score\": \"0.7060905\",\n \"text\": \"function closeModal(){\\n \\n modal.style.display=\\\"none\\\";\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce90fd2d0bef21dcd623356e5b8651a5\",\n \"score\": \"0.7057585\",\n \"text\": \"close(){\\n isfull = false;\\n myWindow.close();\\n return \\\"bye\\\";\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e834e0e1189ad571ca1e51b5c9b8c12\",\n \"score\": \"0.7057301\",\n \"text\": \"function closeModalArtiste(){\\n\\tdocument.getElementById(\\\"fader\\\").style.display=\\\"none\\\";\\n\\tdocument.getElementById(\\\"popup_artiste\\\").innerHTML=\\\"\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7c70dcda234396667ec47dca6b724fe\",\n \"score\": \"0.7054391\",\n \"text\": \"function closeModal() {\\n\\t$(\\\"#welcome_modal\\\").modal(\\\"hide\\\");\\n\\twindow.showModal = false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56976258ee2d44c612fff98f0f1f26fb\",\n \"score\": \"0.7054267\",\n \"text\": \"function closeModal() {\\n modal.style.display = \\\"none\\\"; \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"485e706fd776fce0116097037391c1bf\",\n \"score\": \"0.7052939\",\n \"text\": \"function closeModal(){\\n\\tmodal.style.display = \\\"none\\\";\\n init();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d8b61f61b365865413326d8ca72b75d\",\n \"score\": \"0.70521045\",\n \"text\": \"function closeModal() {\\n modal.style.display = \\\"none\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"708f29073f1da6a248853d5c878b76a8\",\n \"score\": \"0.70515335\",\n \"text\": \"function closeModal(e) {\\n if(e.key === 'Escape') {\\n Anim.Helpers.hidshowbody('auto')\\n SetAppState.setImageModalState({ isOpen: false, current: 0, images: {} })\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b76af3eb5451b3bb72b38f2cf8ef28b0\",\n \"score\": \"0.7048322\",\n \"text\": \"function closeModalWindow() {\\n //Fade out the greyed background\\n $('.modal-bg').fadeOut();\\n //Fade out the modal window\\n $('.modal').fadeOut();\\n // Clear input fields\\n $('.inputField').val('');\\n // Reset select value to default\\n $('#subjectInput option').prop('selected', function() {\\n return this.defaultSelected;\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c967fe95721765ae5f97a2eb87583e86\",\n \"score\": \"0.70471126\",\n \"text\": \"function closeModal(){\\r\\n closeicon.addEventListener(\\\"click\\\", function(e){\\r\\n modal.classList.remove(\\\"show\\\");\\r\\n window.close();\\r\\n });\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67fe005963c193c012d04c8db8f70294\",\n \"score\": \"0.7042235\",\n \"text\": \"function closeModal() {\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67fe005963c193c012d04c8db8f70294\",\n \"score\": \"0.7042235\",\n \"text\": \"function closeModal() {\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c1ea8c88c2c17a1c12333ad25d2b86b\",\n \"score\": \"0.7041773\",\n \"text\": \"function closeModalAtWindowClick(event){\\n if (event.target.classList.contains('modal-container')){\\n $modalContainer.classList.remove('show-modal');\\n render();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42769fcaaeb558e31e2b58e9548f1b6f\",\n \"score\": \"0.7041279\",\n \"text\": \"close() {\\n\\t\\tthis._closeHandlers.forEach(fn => fn(this));\\n\\n\\t\\tthis.remove();\\n\\t\\tdocument.body.style.overflowY = 'scroll';\\n\\t\\tALBModal.currentModal = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2248a99c59223777e89d5e265027207a\",\n \"score\": \"0.7035261\",\n \"text\": \"function closePopup()\\n {\\n var win = document.querySelector(\\\".window--modal\\\");\\n if (win) {\\n var api = win.data_api;\\n if(api) api.close();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dff939c5a29937c8a8f8b2a06a4cba9\",\n \"score\": \"0.70349747\",\n \"text\": \"function closeModal() {\\n handleOpen(!modalOpen)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a59dff27a5e6471b57261d0fc614d281\",\n \"score\": \"0.70293593\",\n \"text\": \"function closeModal(){\\n\\tmodal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37cba95e7e2d142fcf88eb2922d0e703\",\n \"score\": \"0.7024939\",\n \"text\": \"function closeClassicRulesModal() {\\n classicRulesModal.style.display = 'none';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"909729ae14de98a47c04d26ae70b9557\",\n \"score\": \"0.702359\",\n \"text\": \"function closeModal(){\\n $('#div_modal').remove();\\n $('.fade').css('opacity','1');\\n $('#result p').text('');\\n $('#div_loading4').removeClass('hide');\\n $('#div_loading4').addClass('centreV');\\n recalculate();\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ce0ed0b3455988a9df3ff0d0c37bfea\",\n \"score\": \"0.702165\",\n \"text\": \"handleModalClosing(){\\n this.openModal = false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"616af40051af631d2020bd7af55fcdae\",\n \"score\": \"0.7017989\",\n \"text\": \"function closePopup(){\\n $('.overlay-bg, .overlay-content').hide(); //hide the overlay\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfad92cb588dcb18ebaee435901831ee\",\n \"score\": \"0.701578\",\n \"text\": \"function closeWindow() {\\n\\toPopup.hide();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f77f334777fa44ad906c91873f488107\",\n \"score\": \"0.7009528\",\n \"text\": \"function closeModal(){\\n // modal.style.display = 'none';\\n // backdrop.style.display = 'none';\\n\\n //similarly other pages won't have modals, so in order to get js executed,\\n //we need to check if the modal exists and only then remove or add classes\\n if (modal) modal.classList.remove('open');\\n \\n backdrop.classList.remove('open');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"238e6e417e6d172de515a6de615e2eeb\",\n \"score\": \"0.700529\",\n \"text\": \"function fn_ev_closeBTN () {\\n \\n modal._hide(function () {\\n $this.removeClass('modal_blur');\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ab977d2e8e67e66dfa730a62fb9ead5\",\n \"score\": \"0.6997922\",\n \"text\": \"function closeModal() {\\n overlay.classList.remove('show-modal');\\n startGame();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"837cc793caa587837a51f9a9dab76469\",\n \"score\": \"0.6994996\",\n \"text\": \"function close(args)\\n {\\n args = args || {};\\n \\n var element = args.element || false;\\n if (element) {\\n $('#' + element).hide();\\n } else {\\n $('div.lightbox').hide();\\n }\\n \\n // Only hide the modal if no other lightboxes exist\\n // This is meant to prevent closing a lightbox on an lightbox from hiding both modals.\\n // e.g., \\\"it was used on themes template within the toolkit lightbox\\\" - Kyle 12/15/10\\n $.each($('.lightbox'), function()\\n {\\n if ($(this).css('display') !== 'none') {\\n return false;\\n } else {\\n hideModal();\\n }\\n });\\n \\n // Currently this is only used for stopping playback of flowplayers in clickPic\\n $('body').trigger('lightbox.closed');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b217d3703dde632720bb4413f1026fb\",\n \"score\": \"0.6989021\",\n \"text\": \"function closeMmodal(){\\n\\t\\tvar $this = $(this);\\n\\t\\t$('.project_show', $body).removeClass('project_show');\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eed35b73e1da70aee97964775762d5ca\",\n \"score\": \"0.69866276\",\n \"text\": \"function closeModal(){\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03e13fd656e6742ff7d436e499b871bc\",\n \"score\": \"0.69785076\",\n \"text\": \"function closeModal() {\\n $(\\\".modal\\\").css(\\\"display\\\",\\\"none\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95a02c1b96837ec97ad60140ca275994\",\n \"score\": \"0.6977545\",\n \"text\": \"function closeWindow () {\\n event.preventDefault()\\n overlayShowing.style.display = \\\"none\\\"\\n modalShowing.style.display = \\\"none\\\"\\n clearFields()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0df62b39a723f0cac9d71b05997f1829\",\n \"score\": \"0.6970575\",\n \"text\": \"function closeModal(){\\n\\tmodal.style.display='none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e8b3a1c39d761e0eda2f3b2c289290c\",\n \"score\": \"0.6964541\",\n \"text\": \"function closeModal(){\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e8b3a1c39d761e0eda2f3b2c289290c\",\n \"score\": \"0.6964541\",\n \"text\": \"function closeModal(){\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e8b3a1c39d761e0eda2f3b2c289290c\",\n \"score\": \"0.6964541\",\n \"text\": \"function closeModal(){\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e8b3a1c39d761e0eda2f3b2c289290c\",\n \"score\": \"0.6964541\",\n \"text\": \"function closeModal(){\\n modal.style.display = 'none';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a8db7f8d44e81722a08984f8506aef4\",\n \"score\": \"0.6961207\",\n \"text\": \"function closeFunction() {\\n modal.style.display = \\\"none\\\";\\n modalImg.style.display = \\\"none\\\";//hhhh\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a136292cacd3ad19baa4b5e8920668b3\",\n \"score\": \"0.6960013\",\n \"text\": \"function draugiemWindowClose() {\\n\\tdraugiemLoadUrl({'action': 'closeinfobox'});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bfaf449bb423167aa10d99210bf064e\",\n \"score\": \"0.69580096\",\n \"text\": \"function closeModal(e){\\r\\n document.getElementById(\\\"uploadModal\\\").style.visibility = 'hidden';\\r\\n document.getElementById(\\\"uploadModalContent\\\").style.visibility = 'hidden';\\r\\n document.getElementById(\\\"fullmodal\\\").style.visibility = 'hidden';\\r\\n document.getElementById(\\\"uploadModal\\\").style.zIndex = '-1';\\r\\n document.getElementById(\\\"fullmodal\\\").style.zIndex = '-1';\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36159ca36e8c9f4c673d881d9b4689ba\",\n \"score\": \"0.69575095\",\n \"text\": \"function closeModal(){\\n\\n\\t\\tvar modalXClicked = document.getElementsByClassName(\\\"modal\\\")[0];\\n\\t\\tvar modalXClicked2 = document.getElementsByClassName(\\\"modal__content\\\")[0];\\n\\t\\tmodalXClicked.style.display = \\\"none\\\";\\n\\t\\tmodalXClicked2.style.display = \\\"none\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d53ec8704349fead7a8014e4bbaa7210\",\n \"score\": \"0.6954834\",\n \"text\": \"function quitFromQuitModal(){\\n document.getElementById(\\\"quit-modal\\\").style.display = 'none';\\n returnToMenu();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f361809f1a3a1895ed5aefecf90b912\",\n \"score\": \"0.6954308\",\n \"text\": \"function close() {\\n // Unbind the events\\n $(window).unbind('resize', modalContentResize);\\n $('body').unbind( 'focus', modalEventHandler);\\n $('body').unbind( 'keypress', modalEventHandler );\\n $('.close').unbind('click', modalContentClose);\\n $('body').unbind('keypress', modalEventEscapeCloseHandler);\\n $(document).trigger('CToolsDetachBehaviors', $('#modalContent'));\\n\\n // Set our animation parameters and use them\\n if ( animation == 'fadeIn' ) animation = 'fadeOut';\\n if ( animation == 'slideDown' ) animation = 'slideUp';\\n if ( animation == 'show' ) animation = 'hide';\\n\\n // Close the content\\n modalContent.hide()[animation](speed);\\n\\n // Remove the content\\n $('#modalContent').remove();\\n $('#modalBackdrop').remove();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f361809f1a3a1895ed5aefecf90b912\",\n \"score\": \"0.6954308\",\n \"text\": \"function close() {\\n // Unbind the events\\n $(window).unbind('resize', modalContentResize);\\n $('body').unbind( 'focus', modalEventHandler);\\n $('body').unbind( 'keypress', modalEventHandler );\\n $('.close').unbind('click', modalContentClose);\\n $('body').unbind('keypress', modalEventEscapeCloseHandler);\\n $(document).trigger('CToolsDetachBehaviors', $('#modalContent'));\\n\\n // Set our animation parameters and use them\\n if ( animation == 'fadeIn' ) animation = 'fadeOut';\\n if ( animation == 'slideDown' ) animation = 'slideUp';\\n if ( animation == 'show' ) animation = 'hide';\\n\\n // Close the content\\n modalContent.hide()[animation](speed);\\n\\n // Remove the content\\n $('#modalContent').remove();\\n $('#modalBackdrop').remove();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":90,"cells":{"query_id":{"kind":"string","value":"464e0930f3c307bdabe192ade0db326e"},"query":{"kind":"string","value":"creating child divs inside a div to make snow particles"},"positive_passages":{"kind":"list like","value":[{"docid":"442f4abc7f8f84e0e88b82dbdd5374aa","score":"0.74549365","text":"function createSnowChildDivs(element,snowDotArray){\n let snowDot;\n for(i=0;i<100;i++){\n snowDot = document.createElement(\"div\");\n element.appendChild(snowDot);\n snowDot.setAttribute(\"class\",\"snowDot\");\n randomSnowSizes(snowDot);\n snowDot.style.opacity=0;\n fuzzySnow(snowDot);\n startingPosition(snowDot);\n snowDotArray.push(snowDot);\n }\n}","title":""}],"string":"[\n {\n \"docid\": \"442f4abc7f8f84e0e88b82dbdd5374aa\",\n \"score\": \"0.74549365\",\n \"text\": \"function createSnowChildDivs(element,snowDotArray){\\n let snowDot;\\n for(i=0;i<100;i++){\\n snowDot = document.createElement(\\\"div\\\");\\n element.appendChild(snowDot);\\n snowDot.setAttribute(\\\"class\\\",\\\"snowDot\\\");\\n randomSnowSizes(snowDot);\\n snowDot.style.opacity=0;\\n fuzzySnow(snowDot);\\n startingPosition(snowDot);\\n snowDotArray.push(snowDot);\\n }\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"bae08515a8304528da296cc4ec8bea1a","score":"0.7164519","text":"function initSnow() {\n\n var container = document.createElement('div');\n\n container.style.position = 'absolute';\n container.style.top = '0';\n container.style.left = '0';\n\n document.body.appendChild(container);\n\n canvasScene = new THREE.Scene();\n\n canvasRenderer = new THREE.CanvasRenderer();\n canvasRenderer.setSize(window.innerWidth, window.innerHeight);\n\n particleImage.src = 'images/ParticleSmoke.png';\n var material = new THREE.ParticleBasicMaterial( { map: new THREE.Texture(particleImage) } );\n\n for (var i = 0; i < 100; i++) {\n\n particle = new Particle3D(material);\n particle.position.x = Math.random() * 2000 - 1000;\n particle.position.y = Math.random() * 2000 - 1000;\n particle.position.z = Math.random() * 2000 - 1000;\n particle.scale.x = particle.scale.y = 1;\n canvasScene.add( particle );\n\n particles.push(particle);\n }\n\n canvasRenderer.domElement.style.position = 'absolute';\n\n container.appendChild( canvasRenderer.domElement );\n\n}","title":""},{"docid":"6334a6717988637ce374f3e5c70735c7","score":"0.6911757","text":"function renderParticles(posLeft, posTop, parAmount, parDistance) {\n var main = $('main');\n var particleFragment = document.createDocumentFragment();\n var particlesAmount = parAmount;\n \n function randomColor() {\n var colorsArray = [\n 'rgb(3,0,0) radial-gradient(circle, rgba(51,6,6,1) 5%, rgba(167,19,19,1) 74%, rgba(156,14,14,1) 100%)',\n ];\n // to get random colors from array: colorsArray[Math.floor(Math.random() * colorsArray.length)]\n return colorsArray[0];\n }\n\n var getColor = randomColor();\n\n for (var i = 0; i < particlesAmount; i++) {\n var particleElement = document.createElement('div');\n particleElement.classList.add('particle-' + clickCounter);\n particleElement.style.left = posLeft + 'px';\n particleElement.style.top = posTop + 'px';\n particleElement.style.background = getColor;\n // to get rainbow colors of particle just uncoment it\n // particleElement.style.background = randomColor();\n particleFragment.append(particleElement);\n }\n\n main.append(particleFragment);\n \n function randomPosition(left, top) {\n function runRandomize(pos) {\n if (Math.floor(Math.random() * 2)) {\n return pos - Math.random() * parDistance;\n } else {\n return pos + Math.random() * parDistance;\n }\n }\n \n return {\n left: runRandomize(left),\n top: runRandomize(top)\n }\n }\n\n $('.particle-' + clickCounter).each(function () {\n var left = randomPosition($(this).position().left, $(this).position().top).left;\n var top = randomPosition($(this).position().left, $(this).position().top).top;\n var $this = $(this);\n\n $(this).css({\n left: left,\n top: top,\n opacity: 0,\n width: 0,\n height: 0\n });\n setTimeout(function () {\n $this.remove();\n }, 600);\n });\n }","title":""},{"docid":"248659200aaae760bce3c11d22a4c7fc","score":"0.6908777","text":"function createsnow() {\n let snowContainer = document.getElementById('snow_container');\n snowContainer.innerHTML = '';\n\n // Specify how much snow you want.\n // Based on CSS, only goes up to a max of 50.\n let numSnowFlakes = 50;\n for (; numSnowFlakes > 0; numSnowFlakes--) {\n let snowFlake = document.createElement(\"div\");\n snowFlake.className = 'snow';\n snowContainer.append(snowFlake);\n }\n}","title":""},{"docid":"dc46d2d4675e4a8d84f60203cddbc69f","score":"0.6904361","text":"function particles() {\r\n var count = 1000;\r\n var container = document.querySelector(\".container\");\r\n var i = 0;\r\n while (i < count) {\r\n// creating an element i for every particle\r\n var singleParticle = document.createElement(\"i\");\r\n// giving random size to the particles\r\n var x = Math.floor(Math.random() * window.innerWidth);\r\n var y = Math.floor(Math.random() * window.innerHeight);\r\n var size = Math.random() * 10;\r\n// applying styles to the new element i\r\n singleParticle.style.left = x + \"px\";\r\n singleParticle.style.top = y + \"px\";\r\n singleParticle.style.width = 1 + size + \"px\";\r\n singleParticle.style.height = 1 + size + \"px\";\r\n singleParticle.style.animationDuration = 5 + size + \"s\";\r\n singleParticle.style.animationDelay = -size + \"s\";\r\n// appending the element i in the container div\r\n container.appendChild(singleParticle);\r\n i++;\r\n }\r\n}","title":""},{"docid":"caa58d49f749fe42d9c087df9181fa1b","score":"0.68236077","text":"createParticle() {\r\n noStroke();\r\n this.color.setAlpha(this.alpha);\r\n fill(this.color);\r\n circle(this.x, this.y, this.r);\r\n if(sf > 1){\r\n //tint(255, this.alpha);\r\n image(this.cell, this.x, this.y, this.r, this.r);\r\n }\r\n }","title":""},{"docid":"dd15a58828302bef5792e69092ccae6d","score":"0.6755793","text":"function bubbles() {\n $.each($(\".particletext.bubbles\"), function(){\n var bubblecount = ($(this).width()/50)*10;\n for(var i = 0; i <= bubblecount; i++) {\n var size = ($.rnd(40,80)/10);\n $(this).append('<span class=\"particle\" style=\"top:' + $.rnd(20,80) + '%; left:' + $.rnd(0,95) + '%;width:' + size + 'px; height:' + size + 'px;animation-delay: ' + ($.rnd(0,30)/10) + 's;\"></span>');\n }\n });\n }","title":""},{"docid":"3ff6cba7f255f7cd4eba7b1c01ade71b","score":"0.6649344","text":"function createParticles(){\n\tscene.remove.apply(scene, scene.children);\n\tspheres = [];\n\tgeometry = new THREE.SphereGeometry(2,10,10);\n\tmaterial = new THREE.MeshBasicMaterial({color:0xffffff});\n\n\t//lineMaterial = new THREE.LineBasicMaterial( { color: 0xFFFFFF, transparent: true, opacity: 0.1 } );\n\t//ahora creamos cada particula\n\tfor(var p=0; p < particleCount; p++){\n\t\t//creamos una particula con posiciones aleatorias a partir del cero\n\t\t//el canvas mide 400,400 asi que el random sera entre -200 a 200\n\n\t\t//las particulas pueden salirse fuera del render\n\t\tvar pX = (Math.random() * params.tamOctree) - params.tamOctree;\n\t\tvar pY = (Math.random() * params.tamOctree) - params.tamOctree;\n\t\tvar pZ = (Math.random() * params.tamOctree) - params.tamOctree;\n\n\t\t\n\t\tparticle = new THREE.Mesh(geometry,material);\n\t\t//particle.material.transparent = true;\n\t\tparticle.position.set(pX,pY,pZ);\n\t\t//agregamos a la geometria de particulas\n\t\tspheres.push(particle);\n\t\tscene.add( particle );\n\t}\n}","title":""},{"docid":"29482a405441a3ae3603d6c92411fdc1","score":"0.6533131","text":"function createMightyParticles(focalPoint){\n awesomeSound.play();\n var hue = random(20, 300);\n var pp;\n if(!focalPoint){\n pp = createVector(mouseX,mouseY);\n }else{\n pp = createVector(focalPoint.x, focalPoint.y);\n } \n var numberOfParticles = random(15, 35);\n for(var i=0; i<numberOfParticles; i++){\n var vv = createVector(0, 1);\n vv.rotate(random(0, TWO_PI));\n vv.mult(random(1, 3));\n \n var newBorn = new Particle(pp, vv, hue);\n particleSystem.push(newBorn); \n }\n \n /*var checkEdges = function(){\n if (pp.x > width){\n pp.x = width;\n vv.x *=-1;\n }else if (pp.x < 0){\n vv.x *=-1;\n pp.x = 0\n }\n \n if (pp.y > height){\n vv.y *=-1;\n pp.y = height;\n }\n }*/\n \n \n}","title":""},{"docid":"60723b9c7dddc4fb1e8541c6e23841dc","score":"0.65119386","text":"function initParticles() {\n for (var i = 0; i < 2000; i++) {\n particles.push(new PaintParticle(width * 0.5, height * 0.5));\n }\n}","title":""},{"docid":"39ecae1365f18cb98d0513652a1163ea","score":"0.65087706","text":"function setup() {\r\n createCanvas(800, 800);\r\n \r\n //inside setup\r\n\r\n for(let i = 0;i<width/10;i++){\r\n particlesBg.push(new ParticleBg());\r\n }\r\n}","title":""},{"docid":"dc4e6dd1606a244a6c77541356bde729","score":"0.6487803","text":"function createParticles()\n {\n // Adds 10 particles to the array with random positions, colours, velocities and lifespans\n for(var i = 0; i < 10; i++)\n {\n particles.push(new create());\n }\n }","title":""},{"docid":"e8266e8a50a23794982d218983d1fb49","score":"0.6473716","text":"function positionParticles() {\n columns = Math.round(canvas.width / distance);\n rows = Math.round(canvas.height / distance);\n\n for (i = 0; i < rows * columns; i++) {\n let x = (i % columns) * distance;\n let y = Math.floor(i / columns) * distance;\n particles.push(new Particle(x, y));\n }\n}","title":""},{"docid":"6a8b6e9117ab7a4fb675c89452f3f86a","score":"0.6469174","text":"function createParticles(n){\n particles = [];\n for(var x = 0; x < n; x++){\n particles.push({\n x: x,\n w: 0,\n h: getY(mark_width * x)\n });\n }\n }","title":""},{"docid":"cb46790485773319620e7216d6931a8a","score":"0.6363177","text":"createParticleSystem() {\n this._particleSystem = new BABYLON.ParticleSystem('particle', 3500, this._scene);\n this._particleSystem.particleTexture = new BABYLON.Texture(`${baseUrl}/images/driehoek.svg`, this._scene);\n\n // add particle system onto the mesh\n this._particleSystem.emitter = this._mesh;\n this._particleSystem.minEmitBox = new BABYLON.Vector3(-30, 0, 0);\n this._particleSystem.maxEmitBox = new BABYLON.Vector3(30, 0, 0);\n\n Object.assign(this._particleSystem, config.snow);\n\n // set emission rate\n this._particleSystem.emitRate = this._emitRate * physicsManager.speed;\n\n // init particle system\n this._particleSystem.start();\n }","title":""},{"docid":"49c4ba4fb5afc34c64b4944c29ab60c8","score":"0.63541603","text":"function setup() {\n \n createCanvas( windowWidth, windowHeight );\n washImg = loadImage( 'wash.png' ); // wash picto\n \n for( let i=0; i<width/14; i++ ) {\n \n particles.push( new Particle() );\n }\n}","title":""},{"docid":"b698ea349ec7fb002c4863a57ec5a3e1","score":"0.6320724","text":"function draw() {\n ctx.clearRect(0, 0, W, H);\n ctx.fillStyle = \"rgba(255, 255, 255, 0.8)\";\n ctx.beginPath();\n\n for (var _i2 = 0; _i2 < mp; _i2++) {\n var p = particles[_i2];\n ctx.moveTo(p.x, p.y);\n ctx.arc(p.x, p.y, p.r, 0, Math.PI * 2, true);\n }\n\n ctx.fill();\n update();\n } //Function to move the snowflakes","title":""},{"docid":"8d3bc43abb9834b4fb8570cd3c9f38a5","score":"0.63005906","text":"function generateSnow() {\n for (i = 0; i < snowflakeCount; ++i) {\n amplitude[i] = Math.random() * ampMultiplier;\n posX[i] = Math.random() * (width - amplitude[i]);\n posY[i] = Math.random() * height;\n placeX[i] = Math.random() * flakeFluctSpeed; // Х displacement\n placeY[i] = Math.random() + flakeDownSpeed; // Y displacement\n deltaX[i] = 0;\n\n var elem = document.createElement('img');\n elem.id = \"snowflake\" + i;\n elem.style = \"position:absolute;\" + \"z-index: \" + i + \"; visibility:visible; top:-50px; left:-50px;\";\n elem.src = imgsrc;\n elem.border = 0;\n document.body.appendChild(elem);\n\n obj[i] = document.getElementById(\"snowflake\" + i);\n }\n}","title":""},{"docid":"b19330b4eea60b85bfff036ecb527cc6","score":"0.62871575","text":"function draw() {\r\n background(0,5);\r\n // inside draw\r\n\r\nfor(let i = 0;i<particlesBg.length;i++) {\r\n \r\n particlesBg[i].createParticleBg();\r\n particlesBg[i].moveParticleBg();\r\n particlesBg[i].joinParticlesBg(particlesBg.slice(i));\r\n }\r\n}","title":""},{"docid":"64d4a00f75df8c6a0b2a72261397facb","score":"0.6267741","text":"run(){\n \n //loop for making multiple particles\n for(var i = 0; i < this.particles.length; i++){\n var p = this.particles[i]; \n p.show(); //show the particles\n p.move(); //move the particles\n \n if(p.Dead()){\n this.particles.splice(i,1);\n }\n }\n }","title":""},{"docid":"5f9639ec9fc76842fe9c1d0a838b7067","score":"0.6263363","text":"function PotionExperience(){\n giraffe.underPotionInfluence=1;\n world.SetGravity(new b2Vec2(0,1));\n var potionBackgroundProps={ \n color: \"black\",\n type: \"static\",\n desc: \"potionBackground\",\n x:visibleCanvasCenter.x,//for some reason, don't have to adjust these by gradient radius. Radians draw from center'\n y:visibleCanvasCenter.y,//for some reason, don't have to adjust these by gradient radius. Radians draw from center. Maybe due to the draw function we have?\n width:rightBoundPos-leftBoundPos,\n height:bottomBoundPos-topBoundPos,\n maskBits:0x0008\n }; \n potionBackground=createABody(potionBackgroundProps,this);\n \n particleIndex=0;//makes sure new ones appear behind\n for (var i=1;i<200;i++){\n \n new PotionParticle();\n }\n \n\n}","title":""},{"docid":"9f07a3337a341b95e177d4be7948fd8c","score":"0.62447053","text":"function initParticles(){\n\t\t\tvar i = 0;\n\n\t\t\t//Draw ref image on ref canvas\n\t\t\tctxRef.drawImage(ref_image,(canvasRef.width-ref_image.width)/2,(canvasRef.height-ref_image.height)/2);\n\t\t\t//Get the pixels of the image\n\t\t\tvar pixels = ctxRef.getImageData(0,0,canvasRef.width,canvasRef.height);\n\n\t\t\t//Add text particles\n\t\t\tfor(i=0;i<200;i++){\n\t\t\t\tvar pX = Math.floor(Math.random()*canvasRef.width);\n\t\t\t\tvar pY = Math.floor(Math.random()*canvasRef.height);\n\n\t\t\t\tvar a = pixels.data[(pX+(canvasRef.width*pY))*4+3];\n\t\t\t\twhile(a==0){\n\t\t\t\t\tpX = Math.floor(Math.random()*canvasRef.width);\n\t\t\t\t\tpY = Math.floor(Math.random()*canvasRef.height);\n\t\t\t\t\ta = pixels.data[(pX+(canvasRef.width*pY))*4+3];\n\t\t\t\t}\n\n\t\t\t\t//Test to see if this particle is going to be an anchor\n\t\t\t\tvar anchor = false;\n\t\t\t\tif(Math.random()>0.85){\n\t\t\t\t\tanchor = true;\n\t\t\t\t}\n\n\t\t\t\tparticles.push({\n\t\t\t\t\ttouchID:0,\n\t\t\t\t\tdist:0,\n\t\t\t\t\tposX:pX,posY:pY,\n\t\t\t\t\torX:pX,orY:pY,\n\t\t\t\t\tisAffected:false,\n\t\t\t\t\tisOut:false,\n\t\t\t\t\toutDest:Math.random()*15,\n\t\t\t\t\toutCount:0,\n\t\t\t\t\tcharge:30,\n\t\t\t\t\tscale:0,\n\t\t\t\t\tscaleNoise:Math.random(),\n\t\t\t\t\tscaleNoiseSpeed:Math.random()*0.005,\n\t\t\t\t\toffX:Math.random(),offY:Math.random(),\n\t\t\t\t\tnoiseAmount:Math.random()*2,\n\t\t\t\t\trandSpeed:Math.random()*0.01,\n\t\t\t\t\tangle : 0,\n\t\t\t\t\thasRepulsion : false,\n\t\t\t\t\tisAnchor:anchor,\n\t\t\t\t\tisSprite : false,\n\t\t\t\t\tmag:Math.random()*40+160\n\t\t\t\t});\n\t\t\t}\n\n\t\t\t//Run through all the pixel to create particles where there is text\n\t\t\tfor(i=0;i<canvasRef.width;i++){\n\t\t\t\tfor(var j=0;j<canvasRef.height;j++){\n\t\t\t\t\t//Get the alpha of that pixel\n\t\t\t\t\tvar a = pixels.data[(i+(canvasRef.width*j))*4+3];\n\t\t\t\t\t\n\t\t\t\t\t//If alpha is more than 0, create a particle at that position\n\t\t\t\t\tif(a>0 && Math.random()>0.996){\n\t\t\t\t\t\tvar repulsion = true;\n\t\t\t\t\t\tvar anchor = false;\n\t\t\t\t\t\tvar isS = false;\n\t\t\t\t\t\tvar c = 30;\n\t\t\t\t\t\tvar sFactor = 0.06;\n\n\t\t\t\t\t\t//Test to see if the particle will be an anchor\n\t\t\t\t\t\tif(Math.random()>0.85){\n\t\t\t\t\t\t\tanchor = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t//Test to see if the particle is gonna be a sprite\n\t\t\t\t\t\telse if(Math.random()>0.45 && repulsion){\n\t\t\t\t\t\t\tisS = true;\n\t\t\t\t\t\t\tc = Math.random()*5+25;\n\t\t\t\t\t\t\tif(Math.random()>0.4){\n\t\t\t\t\t\t\t\tsFactor = 0.03;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t//Add particle\n\t\t\t\t\t\tparticles.push({\n\t\t\t\t\t\t\ttouchID:0,\n\t\t\t\t\t\t\tdist:0,\n\t\t\t\t\t\t\tposX:i,posY:j,\n\t\t\t\t\t\t\torX:i,orY:j,\n\t\t\t\t\t\t\tisAffected:false,\n\t\t\t\t\t\t\tisOut:false,\n\t\t\t\t\t\t\toutDest:Math.random()*15,\n\t\t\t\t\t\t\toutCount:0,\n\t\t\t\t\t\t\tcharge:c,\n\t\t\t\t\t\t\tscale:0,\n\t\t\t\t\t\t\tscaleFactor:sFactor,\n\t\t\t\t\t\t\tscaleNoise:Math.random(),\n\t\t\t\t\t\t\tscaleNoiseSpeed:Math.random()*0.005,\n\t\t\t\t\t\t\toffX:Math.random(),offY:Math.random(),\n\t\t\t\t\t\t\tnoiseAmount:Math.random()*10,\n\t\t\t\t\t\t\trandSpeed:Math.random()*0.01,\n\t\t\t\t\t\t\tangle : 0,\n\t\t\t\t\t\t\thasRepulsion : repulsion,\n\t\t\t\t\t\t\tisAnchor:anchor,\n\t\t\t\t\t\t\tsprite:sprites[Math.floor(Math.random()*sprites.length)],\n\t\t\t\t\t\t\tisSprite : isS,\n\t\t\t\t\t\t\tmag:Math.random()*40+300\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//$(window).mousemove(onWindowMouseMove);\n\t\t\tanimate();\n\t\t}","title":""},{"docid":"6ee65534a0b41f77682c01d6cae5962b","score":"0.6227803","text":"function getParticlesAnimation() {\n \n //var particlesTimeline = new TimelineLite();\n var particlesTimeline = new TimelineMax({ repeat: -1 });\n var i = 200;\n var radius = $( document ).width() * 0.5;\n var centerX= $( document ).width() * 0.5;\n var centerY = $( document ).height() * 0.5;\n var dots = [];\n var rawDots = [];\n\n while (--i > -1) {\n var angle = Math.random() * Math.PI * 2;\n var insertionTime = i * 0.015;\n\n dot = document.createElement('img');\n dot.src = '/assets/images/dot.png';\n dot.id = 'dot' + i;\n dotContainer.append(dot);\n dot.style.cssText = 'position:absolute; left:' + centerX + 'px; top:' + centerY + 'px; width:1px; height:1px;';\n \n \n particlesTimeline.from(dot, 0.05, {opacity:0, immediateRender:true}, insertionTime);\n \n particlesTimeline.to(dot, .7, {left:Math.cos(angle) * radius + centerX, \n top:Math.sin(angle) * radius + centerY, \n width:22, \n height:22,\n //repeat: -1,\n ease:Cubic.easeIn\n }, insertionTime);\n \n }\n return particlesTimeline;\n }","title":""},{"docid":"3334f21d107ae5a405263bd25742e58b","score":"0.6201238","text":"createParticle() {\n stroke('black');\n \n push();\n translate(this.x-windowWidth/2,this.y-windowHeight/2);\n if (dist(mouseX, mouseY, this.x, this.y) < 50) {\n fill('black');\n stroke('white');\n rotateX(frameCount * 0.05);\n rotateY(frameCount * 0.05);\n box(this.r*2);\n } else {\n box(this.r);\n }\n pop();\n\n push();\n translate(this.x-windowWidth/2,this.y-windowHeight/2);\n if (dist(mouseX, mouseY, this.x, this.y) < 50) {\n textAlign(CENTER, CENTER);\n fill('black');\n textSize(14 + this.r/2);\n textFont(fontSans);\n text(this.word,0,12);\n }\n pop();\n }","title":""},{"docid":"554c9e335793eb45e2be9a34ca651abc","score":"0.6189754","text":"function start_snowing(num_snowAmount, num_windSpeed, num_fallSpeed){\n\t//clear first (just incase)\n\tarr_snow_div = [];\n\tarr_snow_ids = [];\n\t//\n\tfor (var i = 0; i<num_snowAmount; ++i){\n\t\t//\n\t\tvar snow_flake = document.createElement(\"div\");\n\t\tsnow_flake.id = \"_snow_flake_\" + String(i);\n\t\tsnow_flake.className = \"snow\";\n\t\t//snow.appendChild(snow_flake);\n\t\t//images\n\t\tsnow_flake.innerHTML = '<img src=' + str_snow_imagePath + arr_snow_images[Math.ceil(Math.random()*arr_snow_images.length)-1] + '>';\n\t\tsnow_flake.style.position = 'absolute';\n\t\tsnow_place_randomly(snow_flake);\n\t\tsnow_flake.style.pointerEvents = \"none\";\n\t\t//\n\t\tdocument.getElementsByTagName(\"body\")[0].appendChild(snow_flake);\n\t\tarr_snow_div.push(snow_flake);\n\t\tinit_snow(snow_flake, i, num_windSpeed, num_fallSpeed);\n\t};\n\t//\n}","title":""},{"docid":"6c87722251def645b50c4047600f6bf7","score":"0.6183091","text":"function makeParticles() {\n $.getJSON('data.json', function(data) {\n //WLF\n drawPoints(data.WLFX, data.WLFY, data.WLFZ, 'rgb(255,255,255,150)');\n\n //WRFX\n drawPoints(data.WRFX, data.WRFY, data.WRFZ, 'rgb(255,255,0)');\n\n //DAN waistLBack\n drawPoints(data.WLBX, data.WLBY, data.WLBZ, 'rgb(0,255,0)');\n\n //DAN waistRBack\n drawPoints(data.WRBX, data.WRBY, data.WRBZ, 'rgb(0,0,255)');\n\n //DAN BackTOP\n drawPoints(data.BTX, data.BTY, data.BTZ, 'rgb(0,255,255)');\n\n //DAN CHEST\n drawPoints(data.CX, data.CY, data.CZ, 'rgb(100,100,255)');\n\n //DAN BACK LEFT\n drawPoints(data.BLX, data.BLY, data.BLZ, 'rgb(255,100,100)');\n\n //DAN BACK RIGHT\n drawPoints(data.BRX, data.BRY, data.BRZ, 'rgb(155,100,0)');\n\n //DAN head top\n drawPoints(data.HTX, data.HTY, data.HTZ, 'rgb(200,80,190)');\n\n //DAN head FRONT\n drawPoints(data.HFX, data.HFY, data.HFZ, 'rgb(190,180,130)');\n\n //DAN LFET SHOULDER BACK\n drawPoints(data.LSBX, data.LSBY, data.LSBZ, 'rgb(200,185,195)');\n\n //DAN LFET SHOULDER TOP\n drawPoints(data.LSTX, data.LSTY, data.LSTZ, 'rgb(200,100,130)');\n\n //DAN Left Elbow Out\n drawPoints(data.LEOX, data.LEOY, data.LEOZ, 'rgb(10,190,255)');\n\n //Dan:LUArmHigh\n drawPoints(data.LUAHX, data.LUAHY, data.LUAHZ, 'rgb(10, 90, 55)');\n\n //Dan:RShoulderBack\n drawPoints(data.RSBX, data.RSBY, data.RSBZ, 'rgb(200, 130, 55)');\n\n //Dan:RShoulderTop\n\n drawPoints(data.RSTX, data.RSTY, data.RSTZ, 'rgb(35, 201, 186,150)');\n //Dan:RElbowOut\n\n drawPoints(data.REOX, data.REOY, data.REOZ, 'rgb(245, 55, 127,150)');\n //Dan:RUArmHigh\n drawPoints(data.RUAHX, data.RUAHY, data.RUAHZ, 'rgb(255, 131, 0,150)');\n });\n}","title":""},{"docid":"d03f7343c7018673e1ff7bc9f2b8cf05","score":"0.6177895","text":"function drawDraggableParticles() {\n for (var i = 0; i < particles.length; i++) {\n var p = particles[i];\n drawParticle(p.x, p.y, p.radius, 2, p.fill, \"#000000\");\n }\n }","title":""},{"docid":"0bee61c4320ecb5f5c9925bbabf4888e","score":"0.6130625","text":"function init() {\n particleArray = [];\n for (let i=0; i < 100; i++) { // change the amount of particles.\n let size = Math.random() * 20; // change this value to alter particle size.\n let x = Math.random() * (innerWidth - size * 2);\n let y = Math.random() * (innerHeight - size * 2);\n let directionX = (Math.random() * .4) - .2; // these values adjust the X direction\n let directionY = (Math.random() * .4) - .2; // these values adjust the Y direction\n let color = 'white'; // change this value to affect particle colour.\n\n particleArray.push(new Particle(x, y, directionX, directionY, size, color));\n }\n}","title":""},{"docid":"2876107a6a6ac26de049aeb6a2af1352","score":"0.61256367","text":"createParticle() {\n noStroke();\n fill('darkorange');\n circle(this.x,this.y,this.d);\n }","title":""},{"docid":"43fe0ecf9e481ab031bd97884713f011","score":"0.6121046","text":"createParticle() {\n noStroke();\n this.blue = random(0,155)\n circle(this.x,this.y,this.r);\n }","title":""},{"docid":"6282dee375f774b58dd70c352b0e2328","score":"0.6116509","text":"createParticle() {\n noStroke();\n fill('rgba(200, 169, 169, 0.5)');\n circle(this.x, this.y, this.r);\n }","title":""},{"docid":"4aedc6dd39f8a49dc30475cbc3564db0","score":"0.60936356","text":"function initFluidParticles() {\n var $particlsA = $(\"#particles\");\n if ($particlsA.length) {\n $particlsA.particleground({\n minSpeedX: 0.6,\n minSpeedY: 0.6,\n dotColor: '#ffffff',\n lineColor: '#ffffff',\n density: 6000,\n particleRadius: 2, // curvedLines: true,\n parallaxMultiplier: 5.2,\n proximity: 0\n });\n }\n }","title":""},{"docid":"bff53e1b7770b90f743e1314589348e8","score":"0.6092107","text":"function pebbles()\n{\n\tvar j = 0;\n\n\tfor (var i = 0; i < 9; i++) {\n\t\tvar geo = new THREE.SphereGeometry(0.5); //width, height, depth,\n\t\tvar mat = new Physijs.createMaterial(new THREE.MeshBasicMaterial({ color: 'ffffff' }), .95, .95);\n\t\tvar msh = new Physijs.BoxMesh(geo, mat);\n\t\tvar msh2 = new Physijs.BoxMesh(geo, mat);\n\n\t\tmsh.position.x = i * 5; msh.position.y = -1; msh.position.z += j; \n\t\tmsh2.position.x = -i * 5; msh2.position.y = -1; msh2.position.z += -j;\n\n\t\tscene.add(msh);\n\t\tscene.add(msh2);\n\n\t\tj++;\n\t}\n}","title":""},{"docid":"28d2ee14c14b60d3aadc2a2861b01ae9","score":"0.60845125","text":"seed() {\n const { height, width } = this;\n let count = 40;\n\n if (bowser.mobile) {\n count = 30;\n } else if (lowEnd) {\n count = 100;\n }\n\n for (let i = 0; i < count; i += 1) {\n this.addEntity(new Particle(width, height, lowEnd));\n }\n }","title":""},{"docid":"4770ef35c22dc3687c9597362bcfdb5f","score":"0.60837835","text":"_blockBreakParticles(blok){\n\t\tvar bpos = new vec2(blok.col.position.x + blok.col.size.x / 2, blok.col.position.y + blok.col.size.y / 2);\n\t\tvar s = 6;\n\t\tfor(var i = 4; i > 0; i--){ //right\n\t\t\tvar p = new seekerParticle(bpos.x, bpos.y + Math.random() * tilesize - tilesize / 2, \"#333\", p1);\n\t\t\tp.vel = new vec2(Math.random() * s, 0);\n\t\t\tp.pos = p.pos.plus(p.vel.multiply(2));\n\t\t\tparticles.push(p);\n\t\t\tp.seekspeed = 2;\n\t\t}\n\t\tfor(var i = 4; i > 0; i--){ //left\n\t\t\tvar p = new seekerParticle(bpos.x, bpos.y + Math.random() * tilesize - tilesize / 2, \"#333\", p1);\n\t\t\tp.vel = new vec2(Math.random() * -s, 0);\n\t\t\tp.pos = p.pos.plus(p.vel.multiply(2));\n\t\t\tparticles.push(p);\n\t\t\tp.seekspeed = 2;\n\t\t}\n\t\tfor(var i = 4; i > 0; i--){ //down\n\t\t\tvar p = new seekerParticle(bpos.x + Math.random() * tilesize - tilesize / 2, bpos.y, \"#333\", p1);\n\t\t\tp.vel = new vec2(0, Math.random() * s);\n\t\t\tp.pos = p.pos.plus(p.vel.multiply(2));\n\t\t\tparticles.push(p);\n\t\t\tp.seekspeed = 2;\n\t\t}\n\t\tfor(var i = 4; i > 0; i--){ //up\n\t\t\tvar p = new seekerParticle(bpos.x + Math.random() * tilesize - tilesize / 2, bpos.y, \"#333\", p1);\n\t\t\tp.vel = new vec2(0, Math.random() * -s);\n\t\t\tp.pos = p.pos.plus(p.vel.multiply(2));\n\t\t\tparticles.push(p);\n\t\t\tp.seekspeed = 2;\n\t\t}\n\t}","title":""},{"docid":"4f8288ab2b309e6361ec0ce3181f2ead","score":"0.60467905","text":"function setup() {\n noFill();\n\n // Defines the simulator's layout as well as \"canWidth\", \"canHeight\"\n makeLayout();\n\n var topLeft = new Point( 0, 0 );\n var topRight = new Point( canWidth, 0 );\n var botRight = new Point( canWidth, canHeight/2-thickness );\n var botLeft = new Point( 0, ( canHeight/2-thickness ) );\n\n //Relative to parent coordinate\n\n containers[\"outside\"] = new Container(topLeft, topRight, botRight, botLeft, containerProperties[\"outside\"][\"color\"],\"outside\");\n //containers[\"outside\"].draw();\n\n\n var topLeft = new Point( 0, 0 );\n var topRight = new Point( canWidth, 0 );\n var botRight = new Point( canWidth, canHeight/2 );\n var botLeft = new Point( 0, canHeight/2 );\n UIBoxs[0] = new UIBox( topLeft, topRight, botRight, botLeft );\n UIBoxs[0].draw();\n\n var topLeft = new Point( 0, canHeight/2+thickness );\n var topRight = new Point( canWidth, canHeight/2+thickness );\n var botRight = new Point( canWidth, canHeight );\n var botLeft = new Point( 0, canHeight );\n\n containers[\"inside\"] = new Container(topLeft, topRight, botRight, botLeft, containerProperties[\"inside\"][\"color\"],\"inside\");\n //containers[\"inside\"].draw();\n\n var topLeft = new Point( 0, canHeight/2 );\n var topRight = new Point( canWidth, canHeight/2 );\n var botRight = new Point( canWidth, canHeight );\n var botLeft = new Point( 0, canHeight );\n UIBoxs[1] = new UIBox( topLeft, topRight, botRight, botLeft );\n UIBoxs[1].draw();\n\n for (var location in particles) {\n for (var particle in particles[location]) {\n xRange = containers[location].tr.x - containers[location].tl.x - 100;\n yRange = containers[location].br.y - containers[location].tr.y - 100;\n var amount = particlesProperties[particle][location];\n for (var i=0; i<amount; i++) {\n velocities = velocityRange;\n var x_vel = Math.floor(Math.random() * (velocities.length-1)) + 0;\n var y_vel = Math.floor(Math.random() * (velocities.length-1)) + 0;\n var velocity = createVector(velocities[x_vel],velocities[y_vel]);\n // Get random location\n randomX = containers[location].tl.x + particlesProperties[particle][\"radius\"] + (Math.floor(Math.random() * xRange));\n randomY = containers[location].tl.y + particlesProperties[particle][\"radius\"] + (Math.floor(Math.random() * yRange));\n particles[location][particle].push(new factory[particle](randomX,randomY,particlesProperties[particle][\"radius\"],velocity, true));\n }\n }\n }\n makeUIs();\n GHKFormula()\n}","title":""},{"docid":"506d8919ceaa96f8a4786ca5ae1937db","score":"0.6042969","text":"function setup() {\r\n createCanvas(canvasWidth, canvasHeight)\r\n background(black)\r\n\r\n // Repeat the following sets 10 times\r\n // - Create a new partile in the center of the screen\r\n // - Add it to the list\r\n for (let i = 0; i < 10; i = i + 1) {\r\n let newParticle = new Particle(centerX, centerY)\r\n particles.push(newParticle)\r\n }\r\n}","title":""},{"docid":"031d56b3401d22c92e86e394c6a6cec2","score":"0.6042398","text":"function setup() {\n createCanvas(window.innerWidth, window.innerHeight);\n\n const count = Math.floor(window.innerWidth / 8);\n for (let i = 0; i < count; i++) {\n particles.push(new Particle());\n }\n}","title":""},{"docid":"75fc3ff83ee6622f459df1581c84b0ce","score":"0.6041845","text":"function init(){\n particleArray = [];\n\n for(let y=0 , y2 = textCoordinates.height; y < y2; y++){\n for(let x = 0, x2 = textCoordinates.width; x< x2 ; x++){\n if(textCoordinates.data[(y * 4 * textCoordinates.width) + (x * 4) + 4] > 128){\n let positionX = x + adjustX;\n let positionY = y + adjustY;\n particleArray.push(new Particle(positionX * 2.2 ,positionY *2.2));\n }\n }\n }\n /*for(let i = 0; i < 500; i++){\n let x = Math.random() * canvas.width;\n let y = Math.random() * canvas.height;\n particleArray.push(new Particle(x , y));\n }\n //particleArray = [];\n //particleArray.push(new Particles(50, 50));*/\n}","title":""},{"docid":"37c110ec269d23f26c427653a6042ddb","score":"0.6028897","text":"function createExplosion(x, y, color, text)\n\t{\n\t\tvar count = 8;\n\t\t\n\t\tfor (var i=0; i<count; i++)\n\t\t{\n var angle = i*360/count;\n\t\t\tvar particle = new Particle();\n\t\t\t\n\t\t\tparticle.x = x;\n\t\t\tparticle.y = y;\n\t\t\t\n // size of particle\n\t\t\tparticle.radius = 5;\n\t\t\t\n\t\t\tparticle.color = color;\n\t\t\t\n // life time, the higher the value the faster particle \n // will die\n\t\t\tparticle.scaleSpeed = 1.5;//randomFloat(0.3, 0.5);\n \n // use gravity\n particle.useGravity = false;\n\t\t\t\n\t\t\tvar speed = 100;\n\t\t\t\n\t\t\tparticle.velocityX = speed * Math.cos(angle * Math.PI / 180.0);\n\t\t\tparticle.velocityY = speed * Math.sin(angle * Math.PI / 180.0);\n\t\t\t\n\t\t\tparticles.push(particle);\n\t\t}\n\t\t// text 'particle'\n\t\t// because it was easier than creating a whole new system ;)\n \tvar ptext = new Particle();\n\t\tptext.x = x;\n\t\tptext.y = y;\n\t\tptext.color = color;\n\t\tptext.text = text;\n\t\tptext.velocityX = 0;\n\t\tptext.velocityY = -50;\n\t\tptext.scaleSpeed = 1.5;\n\t\tptext.useGravity = false;\n\t\tparticles.push(ptext);\n\t}","title":""},{"docid":"150368fc5770b46d79268c431572d22b","score":"0.60280496","text":"constructor(direz,nPf,x,y,dim,rx1,ry1,rx2,ry2,dx,dy) {\n this.direz = direz || 1;\n \tthis.particles = [];\n \tthis.nPf = nPf || 2;\n this.x = x || width/2;\n this.y = y || height-100;\n this.dim = dim || 4;\n this.rx1 = rx1 || -5 * this.direz;\n this.rx2 = rx2 || -1 * this.direz;\n this.ry1 = ry1 || 0.2 * this.direz;\n this.ry2 = ry2 || -0.2 * this.direz;\n this.s = this.dim * 2 * this.direz;\n // this.dx = dx || this.dim / 5 * this.direz; // per creare prospettiva con diverse dim\n this.dx = dx || width / 60 * this.direz; // per creare prospettiva con diverse dim\n // this.dx = dx || random(1); // per sfalsare\n // this.dx = dx || 1; // tutti uguali\n // this.dx = dx || 0; // tutti fremi\n this.dy = dy || 0;\n this.sparabile = true;\n this.sparato = false;\n }","title":""},{"docid":"d3a05452c405b632755fabec49ce22eb","score":"0.60123444","text":"function init() {\n particlesArray = [];\n\n //let the number of particles existing be dependent on the canvas dimensions. \n let numberOfParticles = (canvas.height * canvas.width) / 9000;\n\n //create the individual particles, randomly assign their properties, and push\n //them into the particles array.\n \n for (let i = 0; i < numberOfParticles; i++) {\n\n //VARIABLE ME FOR CLASS\n // let size = (Math.random() * 0.1) + 0.8;\n let size = 0;\n\n\n let x = (Math.random() * ((innerWidth - size * 2) - (size * 2)) + size * 2);\n let y = (Math.random() * ((innerHeight - size * 2) - (size * 2)) + size * 2);\n \n //VARIABLE ME (multipliers here dictate the velocity around the canvas)\n let directionX = (Math.random() * 0.25);\n let directionY = (Math.random() * 0.7);\n let color = '#ECFDFD';\n\n particlesArray.push(new Particle(x, y, directionX, directionY, size, color));\n }\n}","title":""},{"docid":"9adf1e801f5beb9b13b9c9d19e0d8ea6","score":"0.600142","text":"function createSimultaneousParticles(disObj) {\r\n\t let dimensions = getVisibleDimensions(disObj.elem, disObj.container);\r\n\t let pos = dimensions.boundingRect;\r\n\t\r\n\t let screenshotData = getAllImageData(disObj);\r\n\t\r\n\t disObj.particleArr[0] = {\r\n\t \"startTime\": Date.now(),\r\n\t \"myParticles\": []\r\n\t };\r\n\t\r\n\t // Process the pixels\r\n\t if(screenshotData) {\r\n\t for(let i = 0; i < screenshotData.length; i += 4) {\r\n\t // Do it every once in a while\r\n\t if(disObj.count % disObj.particleReductionFactor === 0) {\r\n\t let worldX = pos.left + (i / 4) % dimensions.width;\r\n\t let worldY = pos.top + Math.floor((i / 4) / dimensions.width);\r\n\t\r\n\t let colorData;\r\n\t if(disObj.particleColor.length > 0) {\r\n\t colorData = disObj.particleColor;\r\n\t } else {\r\n\t colorData = screenshotData.slice(i, i + 4);\r\n\t }\r\n\t\r\n\t // Create a particle of the given pixel color at the given location\r\n\t createParticle(disObj, worldX - pos.left, worldY - pos.top, worldX, worldY, colorData, 0);\r\n\t }\r\n\t disObj.count++;\r\n\t }\r\n\t } \r\n\t}","title":""},{"docid":"a12bf86cea562efd4494eb99f5010fdf","score":"0.59919983","text":"static function OnCreatePlaygroundParticles (playgroundParticles : PlaygroundParticles) {\n\t\tplaygroundParticles.playgroundCache = new PlaygroundCache();\n\t\tplaygroundParticles.paint = new PaintObject();\n\t\tplaygroundParticles.states = new List.<ParticleState>();\n\t\tplaygroundParticles.colliders = new List.<PlaygroundCollider>();\n\t\tplaygroundParticles.particleSystemId = Playground.particlesQuantity;\n\t\t\n\t\tplaygroundParticles.playgroundCache.size = new float[playgroundParticles.particleCount];\n\t\tplaygroundParticles.playgroundCache.size = Playground.RandomFloat(playgroundParticles.playgroundCache.size.Length, playgroundParticles.sizeMin, playgroundParticles.sizeMax);\n\t\t\n\t\tplaygroundParticles.previousParticleCount = playgroundParticles.particleCount;\n\t\tplaygroundParticles.lifetimeSize = new AnimationCurve(Keyframe(0,1), Keyframe(1,1));\n\t\t\n\t\tplaygroundParticles.shurikenParticleSystem.Emit(playgroundParticles.particleCount);\n\t\tplaygroundParticles.shurikenParticleSystem.GetParticles(playgroundParticles.particleCache.particles);\n\t\tfor (var p = 0; p<playgroundParticles.particleCache.particles.Length; p++) {\n\t\t\tplaygroundParticles.particleCache.particles[p].size = playgroundParticles.playgroundCache.size[p];\n\t\t}\n\t\t\n\t\tPlaygroundParticles.SetParticleCount(playgroundParticles, playgroundParticles.particleCount);\n\t\t\n\t\tif (Playground.reference!=null) {\n\t\t\tPlayground.particlesQuantity++;\n\t\t\tPlayground.reference.particleSystems.Add(playgroundParticles);\n\t\t\tplaygroundParticles.particleSystemId = Playground.particlesQuantity;\n\t\t}\n\t}","title":""},{"docid":"088615c4f1293b9b7054b2835d6a6022","score":"0.5973614","text":"function init_snow(canvas, width, height)\n{\n\n\tsnow_buffer = document.createElement('canvas');\n\tsnow_buffer.width = width;\n\tsnow_buffer.height = height;\n\tctx = snow_buffer.getContext(\"2d\");\n\n\tfor (var i = 0; i < flakeCount; i++)\n\t{\n\t\tvar x = Math.floor(Math.random() * snow_buffer.width);\n\t\tvar y = Math.floor(Math.random() * snow_buffer.height);\n\t\tvar size = (Math.random() * 3) + 2;\n\t\tvar speed = (Math.random() * 1) + 0.5;\n\t\tvar opacity = (Math.random() * 0.5) + 0.3;\n\n\t\tflakes.push(\n\t\t{\n\t\t\tspeed : speed,\n\t\t\tvelY : speed,\n\t\t\tvelX : 0,\n\t\t\tx : x,\n\t\t\ty : y,\n\t\t\tsize : size,\n\t\t\tstepSize : (Math.random()) / 30,\n\t\t\tstep : 0,\n\t\t\tangle : 180,\n\t\t\topacity : opacity\n\t\t});\n\t}\n\n\tsnow();\n\n\tcanvas.addEventListener(\"mousemove\", function(e)\n\t{\n\t\tvar main_canvas = document.getElementById('the_canvas');\n\t\tvar rect = main_canvas.getBoundingClientRect();\n\n\t\tmX = e.clientX - rect.left;\n\t\tmY = e.clientY - rect.top;\n\t});\n\n}","title":""},{"docid":"3cf55e3dc1a03995d6c74faa32ad1c2d","score":"0.5971006","text":"function snowAnimation(volume) {\n $(\"#snow\").empty();\n while (volume > 0) {\n let left = Math.floor(Math.random() * 9) * 10;\n let top = Math.floor(Math.random() * 3) * 10 - 20;\n let src =\n Math.floor(Math.random() * 2) == 1\n ? \"src/assets/snowFlake.png\"\n : \"src/assets/snowFlake2.png\";\n $(\"#snow\").append(\n $(\"<img>\", { src: src, width: \"5%\" })\n .css({ top: top + \"%\", left: left + \"%\", position: \"absolute\" })\n .animate(\n {\n top: \"100%\"\n },\n (100 / 9.8) * 1000\n )\n );\n volume--;\n }\n}","title":""},{"docid":"8dd963cbafb89b50edfd89e83dd0a567","score":"0.59643394","text":"function globes() {\n for (i=0;i<20;i++) {\n particles[i] = new Particle(random(840),random(280,560), \n random(1,4));\n }\n}","title":""},{"docid":"458c41fdb8a01d5bb9607a1844624d98","score":"0.5962007","text":"function drawParticles()\n {\n // Render each particle in the particle array\n for(var i = 0; i < particles.length; i++)\n {\n var particle = particles[i];\n canvasContext.beginPath();\n //applies the colour to the fillStyle\n canvasContext.fillStyle = particle.color;\n //creates the arc to be drawn as the particle to the screen\n canvasContext.arc(particle.x, particle.y, particle.radius, Math.PI*2, false);\n //draws the particle to the canvas\n canvasContext.fill();\n //resets the canvas fill style to stop the colour from applying to the text\n canvasContext.fillStyle = \"rgba(0,0,0,1)\";\n //applies physics to the particles\n f(particle);\n bounce(particle);\n speedCap(particle, 1);\n particle.x += particle.vx;\n particle.y += particle.vy;\n //counts down the death timer of each particle and removes it if it goes below 0\n particle.lifeSpan -= 10;\n if(particle.lifeSpan < 0)\n {\n particles.splice(i,1);\n }\n\n }\n }","title":""},{"docid":"2feed256d35448ce387fdb41622f167d","score":"0.5952231","text":"function Animate() {\n\n var canvas;\n var context;\n\n var width;\n var height;\n\n var oX;\n var oY;\n\n var v = 2;\n var obj_max = 10;\n\n var max = 20;\n var amax = 0;\n\n var firstParticle;\n\n var interval;\n\n this.initialize = function() {\n canvas = document.getElementById(\"canvas\");\n context = canvas.getContext('2d');\n\n width = document.getElementById('contentBody').offsetWidth\n if(width<=480)\n height = 2154\n else{\n height = document.getElementById('content').offsetHeight\n }\n\n oX = width / 2;\n oY = 0;\n\n canvas.width = width;\n canvas.height = height;\n\n createParticles();\n\n window.addEventListener('resize', resizeWindow, false);\n\n //Set interval - Bad! - I know!\n var interval = setInterval(Update, 16);\n }\n\n var createParticles = function() {\n\n var sr = 200;\n var vr = 0.5;\n\n firstParticle = new Particle();\n var p = firstParticle;\n\n //Detect browser, get pixels for vertical radius of particle changes\n var browser;\n\n var browserDetect = function() {\n if (bowser.msie) {\n browser = 80\n } else if (bowser.msedge) {\n browser = 80\n } else if (bowser.android) {\n browser = 20\n } else if (bowser.ios) {\n browser = 20\n } else if (bowser.chrome) {\n browser = 60\n } else if (bowser.opera) {\n browser = 200\n } else if (bowser.safari) {\n browser = 100\n } else {\n browser = 40\n } \n }\n\n browserDetect();\n\n //Detect operating system, get pixels for starting radius of particles\n var userOS;\n\n var osDetect = function() {\n if (bowser.mac) {\n userOS = 20\n } else if (bowser.windows) {\n userOS = 60\n } else if (bowser.windowsphone) {\n userOS = 40\n } else if (bowser.linux) {\n userOS = 100\n } else if (bowser.chromeos) {\n userOS = 80\n } else if (bowser.android) {\n userOS = 50\n } else if (bowser.ios) {\n userOS = 30\n } else {\n userOS = 70\n } \n }\n\n osDetect();\n\n var i;\n for (i = 0; i < max; i++) {\n p.ang = i * max;\n p.vang = 1;\n p.r = userOS;\n //vr is vertical radius of particles\n p.vr = browser;\n p.x = oX;\n p.y = oY;\n\n if (i != max - 1) {\n p.next = new Particle();\n p = p.next;\n }\n }\n }\n\n //Point class.\n var Particle = function() {\n this.ang;\n this.vang;\n this.r;\n this.vr;\n this.x;\n this.y;\n this.next; //Child\n }\n\n var Update = function() {\n\n var count = 0;\n var p = firstParticle;\n\n while (p) {\n count++;\n\n if (p.r > 4000) {\n\n p = p.next;\n continue;\n\n }\n\n var ran = Math.random();\n\n if (ran < 0.2) {\n\n p.vang = 0;\n p.vr = v;\n\n } else if (ran < 0.4) {\n\n p.vang = -v;\n p.vr = 0;\n\n } else if (ran < 0.07) {\n\n p.vang = v;\n p.vr = 0;\n\n } else if (ran < 0.09 && amax < obj_max) {\n var newP = new Particle();\n newP.ang = p.ang;\n\n if (p.ang == 0) {\n newP.vang = 0;\n } else {\n newP.vang = (Math.random() < 50) ? -1 : 1;\n }\n\n newP.r = p.r;\n\n if (p.vang == 0) {\n\n newP.vr = 100;\n } else {\n\n newP.vr = 0;\n }\n\n newP.x = p.x;\n newP.y = p.y;\n\n newP.next = p.next;\n p.next = newP;\n\n }\n\n var r = p.ang + p.vang;\n p.r = p.r + p.vr;\n\n var ang = Math.PI / 120 * r;\n\n var ax = p.r * Math.cos(ang);\n //console.log(ax);\n var ay = p.r * Math.sin(ang);\n\n var rr = Math.sqrt(ax * ax + ay * ay);\n\n var anga = Math.PI / 120 * (r - (r - p.ang) / 2);\n\n var px = rr * Math.cos(anga);\n var py = rr * Math.sin(anga);\n\n\n //Get date, convert to 12hr, and bind to variable \"colour\", then initialize\n var d = new Date();\n var hour = d.getHours() / 2;\n var colour;\n\n var randomColour = function() {\n if (hour <2) {\n colour = \"224, 42, 55,\"\n } else if (hour <4) {\n colour = \"0, 32, 51,\"\n } else if (hour <6) {\n colour = \"212, 218, 224,\"\n } else if (hour <8) {\n colour = \"224, 42, 55,\"\n } else if (hour <10) {\n colour = \"0, 32, 51,\"\n } else {\n colour = \"212, 218, 224,\"\n } \n }\n randomColour();\n //Start drawing\n\n context.beginPath();\n context.strokeStyle = 'rgba(' + colour + '0.1)';\n context.moveTo(p.x, p.y);\n context.quadraticCurveTo(px + oX, py + oY, ax + oX, ay + oY);\n context.stroke();\n context.closePath();\n\n if (p.r > 20) {\n context.beginPath();\n context.fillStyle = 'rgba(' + colour + '0.5)';\n context.arc(px + oX, py + oY, 1, 0, 2*Math.PI, false);\n context.fill();\n context.closePath();\n }\n p.x = ax + oX;\n p.y = ay + oY;\n p.ang = r;\n p = p.next;\n\n }\n amax = count;\n\n }\n\n //Clear the screen on window resize \n var resizeWindow = function(e) {\n e.preventDefault();\n context.fillStyle = 'rgba(247, 251, 254, 1.0)';\n context.beginPath();\n context.rect(0, 0, width, height);\n context.closePath();\n context.fill(); \n width = document.getElementById('contentBody').offsetWidth\n if(width<=480)\n height = 2154\n else{\n height = document.getElementById('content').offsetHeight\n }\n canvas.width = width;\n canvas.height = height;\n\n oX = width / 2;\n oY = 0;\n //Restart!\n createParticles();\n }\n}","title":""},{"docid":"5f23f4d2d01dafd995aff4af74a00bab","score":"0.59503627","text":"function initParticles() {\n var scene = threeLayer.getScene();\n var loader = new THREE.TextureLoader();\n\n particleGroup = new SPE.Group({\n type: SPE.distributions.SPHERE,\n texture: {\n value: loader.load('../textures/cloud.png')\n },\n blending: THREE.NormalBlending,\n maxParticleCount: 5000,\n scale: 200000,\n fog: false\n });\n\n emitter = new SPE.Emitter({\n particleCount: 100,\n maxAge: {\n value: 10,\n },\n position: {\n value: new THREE.Vector3(0, 0, 0),\n spread: new THREE.Vector3(1500, 0, 0),\n distribution: SPE.distributions.SPHERE,\n radiusScale: new THREE.Vector3(1, 1, 0),\n randomise: true\n },\n direction: -1,\n size: {\n value: 80\n },\n opacity: {\n value: [0, 0.5, 0.2]\n },\n color: {\n value: new THREE.Color(1, 1, 1),\n spread: new THREE.Color(0.1, 0.1, 0.1)\n }\n });\n\n particleGroup.addEmitter(emitter);\n\n particleGroup.mesh.position.set(-27589453.947005168, -16645787.262404276, 0);\n\n scene.add(particleGroup.mesh);\n}","title":""},{"docid":"6f3a3c79fe4dd87dca1b80959b1177d2","score":"0.5934297","text":"_spawnParticles (x, y) {\n // const { colors } = this.props;\n const length = this._particles.length;\n const colors = this.props.wowMode\n ? values(this.props.colors).map(toHex)\n : [toHex(this.props.cursorColor)];\n const numParticles = PARTICLE_NUM_RANGE();\n for (let i = 0; i < numParticles; i++) {\n const colorCode = colors[i % colors.length];\n const r = parseInt(colorCode.slice(1, 3), 16);\n const g = parseInt(colorCode.slice(3, 5), 16);\n const b = parseInt(colorCode.slice(5, 7), 16);\n const color = [r, g, b];\n this._particles.push(this._createParticle(x, y, color));\n }\n if (length === 0) {\n window.requestAnimationFrame(this._drawFrame);\n }\n }","title":""},{"docid":"9d74731d05fc8bf51f6252b182cc66e2","score":"0.5932026","text":"function generateConfetti() {\n const container = document.createElement('div');\n container.setAttribute('id', 'pinataConfettiContainer');\n container.style.position = 'absolute';\n container.style.top = \"0\";\n container.style.left = \"0\";\n for (let i = 0; i < 400; i++) {\n let t = 1 + .01*rand(0, 100);\n // Creating the confetti as the specified element type\n const element = document.createElement('div');\n\n element.setAttribute(\"class\", 'particle');\n element.style.transform = \"translate(\" + rand(0, 100) + \"vw, \" + rand(0, 100) + \"vh)\";\n element.style.background = \"hsl(\" + rand(0, 360) + \", 100%, 65%)\";\n element.style.animationDuration = t + \"s\";\n element.style.animationDelay = -0.1*rand(0, 100)*t + \"s\";\n // Inserts the confetti into the container\n container.appendChild(element);\n }\n\n document.getElementById(pinataModalBoxId).appendChild(container);\n}","title":""},{"docid":"13083e2a1447c85bbda346119d8e4e5a","score":"0.59289396","text":"function Snow() {\n\t\tthis.canvas = document.createElement('canvas');\n\t\tthis.canvas.id = 'snow';\n\t\tthis.canvas.className = 'background';\n\t\tthis.canvas.style.background = defaultBgColor;\n\t\tdocument.body.insertBefore(this.canvas, document.body.firstElementChild);\n\n\t\tthis.flakes = [];\n\t\tthis.ctx = this.canvas.getContext('2d');\n\t\tthis.flakeCount = 300;\n\t\tthis.mX = -100,\n\t\tthis.mY = -100\n\n\t\tthis.width = this.canvas.width = window.innerWidth;\n\t\tthis.height = this.canvas.height = window.innerHeight;\n\n\t\tthis._init1();\n\t}","title":""},{"docid":"c941e89f82c58d2f32a34c436ea0f9ae","score":"0.5920191","text":"initialize() {\n const pw = this.imageWidth || 30;\n const ph = this.imageHeight || 30;\n for (let i = 0; i < this.num; ++i) {\n this._particles.push(new FanfareParticle({\n /* Start anywhere along the bottom of the screen */\n xmin: 0,\n xmax: this._host.width - pw,\n ymin: this._host.height - ph - 60,\n ymax: this._host.height - ph,\n /* Ease through [0, 1, 0, -1, 0] over 80 ticks; using a random starting\n * location through the ease */\n dxFunc: function(t, dx) {\n return 4 * Math.sin((t % 80) / 80 * 2 * Math.PI + this.seed);\n },\n /* Particles gradually move upwards */\n dyrange: [-1, 1],\n dvyrange: [-0.15, 0],\n /* Random starting ease */\n seed: Math.random() * 2 * Math.PI,\n image: this._image,\n canvasWidth: this._host.width,\n canvasHeight: this._host.height,\n /* Particles last much longer than usual */\n lifeTick: 0.005,\n /* Ignore the borders */\n borderAction: FanfareParticle.BORDER_DEFAULT\n }));\n }\n }","title":""},{"docid":"05ec8bb00b2b2155d4c380b6211233d9","score":"0.59163713","text":"createParticle() {\n p5.noStroke();\n p5.fill('rgba(200,169,169)');\n p5.circle(this.x, this.y, this.r);\n }","title":""},{"docid":"05ec8bb00b2b2155d4c380b6211233d9","score":"0.59163713","text":"createParticle() {\n p5.noStroke();\n p5.fill('rgba(200,169,169)');\n p5.circle(this.x, this.y, this.r);\n }","title":""},{"docid":"1715cf0260921d89f96159c93a441a2a","score":"0.5903424","text":"ParticleSystem(){\n }","title":""},{"docid":"f979a8dc240f75cd6612524816c40788","score":"0.59019494","text":"_breakParticles(){\n\t\tfor(var i = 12; i > 0; i--){\n\t\t\tvar p = new particle(this.pos.x, this.pos.y, \"#00a\");\n\t\t\tp.vel = this.aimDir.multiply(Math.random() * 5 + 3);\n\t\t\tp.vel = p.vel.plus(new vec2((Math.random() - .5) * 3, 3 * (Math.random() - .5)));\n\t\t\t//p.vel = p.vel.plus(new vec2(this.vel.x, 0));\n\t\t\tp.pos = p.pos.plus(p.vel.multiply(3));\n\t\t\tparticles.push(p);\n\t\t}\n\t}","title":""},{"docid":"bab29de0d6580e4c71833275e1452cd4","score":"0.58972967","text":"function playButtonClick() {\n breakSound.play();\n challengeCompleteSound.play();\n\n for (let i = 0; i < 6; i++) {\n let particle = new HexBreakParticleSystem(374 + (i - 2.5) * 80, 330, i, i, i);\n hexBreakParticles.push(particle);\n app.stage.addChild(particle);\n }\n}","title":""},{"docid":"666f9150005d3f50e42753509a866686","score":"0.5872684","text":"createParticleBg() {\r\n noStroke();\r\n var r = random(255); // r is a random number between 0 - 255\r\n var g = random(100,200); // g is a random number betwen 100 - 200\r\n var b = random(100); // b is a random number between 0 - 100\r\n var a = random(200,255); // a is a random number between 200 - 255\r\n fill(r, g, b, a);\r\n //noFill();\r\n circle(this.x,this.y,this.r);\r\n }","title":""},{"docid":"a831a104840c6599560a0ea2071e0486","score":"0.58700997","text":"addParticleSupershape (num, where) {\r\n const amnt = TWO_PI / num;\r\n const a = 1;\r\n const b = 1;\r\n const m = 5;\r\n const n1 = 0.14;\r\n const n2 = 1.7;\r\n const n3 = 1.7;\r\n\r\n for (let i = 0; i < TWO_PI; i+= amnt) {\r\n let force = p5.Vector.fromAngle(i);\r\n force.mult(this.supershape(i, a, b, m, n1, n2, n3));\r\n \r\n this.particleRandomly(where, force);\r\n }\r\n }","title":""},{"docid":"8131bc79a94195d191c8effb201441fd","score":"0.58642274","text":"function draw() {\n ctx.clearRect(0, 0, W, H)\n\n ctx.fillStyle = 'rgba(221, 191, 218, 0.8)'\n ctx.beginPath()\n for (let i = 0; i < mp; i++) {\n const p = particles[i]\n ctx.moveTo(p.x, p.y)\n ctx.arc(p.x, p.y, p.r, 0, Math.PI * 2, true)\n }\n ctx.fill()\n update()\n }","title":""},{"docid":"b1157573c163828799679643e1a22427","score":"0.5860806","text":"function draw() {\n\n // Go through all of the particles and draw them.\n particles.forEach(function(particle) {\n particle.draw();\n });\n}","title":""},{"docid":"dc4cabab9fa41656147e4a5e2233b509","score":"0.58554727","text":"function createFirework() {\n createParticle();\n }","title":""},{"docid":"f915abd934bac81520e39b0eca8e1a37","score":"0.58487487","text":"function snow(x,y){\n for(var i=1; i<= 5; i++){\n ellipse(mouseX+random(-5,5), mouseY+random(1,20),random(1,6));\n }\n}","title":""},{"docid":"f6ab64469a84b2235b375092f186e870","score":"0.5844784","text":"function setup(){\n\tcreateCanvas(windowWidth, windowHeight); // Create canvas that fills screen\n\n\t// // Create a single ball using the particle object!\n\t// var redColor = random(0, 255);\n\t// var radius = random(50, 100);\n\t// var xCenter = random(radius, width - radius);\n\t// var yCenter = random(radius, height - radius);\n\t// var xVelocity = random(-10, 10);\n\t// var yVelocity = random(-10, 10);\n\t// ball = new Particle(xCenter, yCenter, radius, xVelocity, yVelocity, redColor);\n\n\t// // Fill an array with balls!\n\t// for (var i=0; i<20; i++){\n\t// \tvar redColor = random(0, 255);\n\t// \tvar radius = random(50, 100);\n\t// \tvar xCenter = random(radius, width - radius);\n\t// \tvar yCenter = random(radius, height - radius);\n\t// \tvar xVelocity = random(-10, 10);\n\t// \tvar yVelocity = random(-10, 10);\n\t// \tball = new Particle(xCenter, yCenter, radius, xVelocity, yVelocity, redColor);\n\n\t// \tballArray.push(ball);\n\t// }\n\n\t// Create a new particle group to hold the ball pit\n\tballPit = new ParticleGroup(20);\n}","title":""},{"docid":"d9d4d77a299f3751f8967a3f16cb54c1","score":"0.58382577","text":"function drawParticles() {\n // Orb (ellipse) figures that trail, used a for loop to run the code frequently.\n for (var i = 0; i < orbs.length; i++) {\n// Incorporated methods such as move and display for the orbs to move at a constant while being displayed in various colors.\n orbs[i].move();\n orbs[i].display();\n }\n\n if (lvlsflicker) {\n strokeWeight(4);\n stroke(random(255), random(20), 100);\n fill(0);\n push();\n translate(random(width), random(height));\n sphere(random(100), 5, 5);\n pop();\n }\n\n}","title":""},{"docid":"e412b267108b6e1ab1483d00fa1443d9","score":"0.583562","text":"function drawParticlesDetails() {\n ctx.fillStyle = \"#000000\";\n ctx.font = \"15px Arial\";\n var text = \"\";\n for (var i = 0; i < 5; i++) {\n if (i == 0) {\n text = \"Heavy: 1\";\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 45);\n text = \"Charge: +1\";\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 60);\n } else if (i == 1) {\n text = \"Heavy: 1\";\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 45);\n text = \"Charge: 0\";\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 60);\n } else if (i == 2) {\n text = \"Light: 1\";\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 45);\n text = \"Charge: -1\";\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 60);\n } else if (i == 3) {\n text = \"Light: 1\";\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 45);\n text = \"Charge: 0\";\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 60);\n } else {\n text = \"Light: -1\";\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 45);\n text = \"Charge: +1\";\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 60);\n }\n \n \n }\n }","title":""},{"docid":"a54da115093b3660a48ffdd656c8f960","score":"0.5809166","text":"function getParticleSystem(){\n //geomerty to render points for particles\n var particleGeo = new t.Geometry();\n var particleMaterial = new t.PointsMaterial({\n color: 0xffffff, \n size: 2,\n map: new t.TextureLoader().load('./assets/particle.jpg'),\n transparent: true,\n blending: t.AdditiveBlending,\n depthWrite: false\n \n });\n \n for(let i =0; i< 2000; i++){\n let point = new t.Vector3(\n (Math.random() -.5) * 100,\n 0, \n (Math.random() -.5) * 100,\n );\n particleGeo.vertices.push(point);\n }\n \n return new t.Points(particleGeo, particleMaterial);\n}","title":""},{"docid":"3c822964e3055a03a26db953aa210afc","score":"0.58056223","text":"function renderParticles() {\n context.clearRect(0, 0, width, height);\n for (let i = 0; i < particles.length; i++) {\n const waypoint = waypoints[i];\n const particle = particles[i];\n context.fillStyle = 'red';\n context.fillRect(waypoint[0], waypoint[1], 2, 2);\n context.fillStyle = 'white';\n context.fillRect(particle[0], particle[1], 2, 2);\n }\n}","title":""},{"docid":"6213c2f8c5ef97121747a2bfdd060453","score":"0.57891226","text":"function loadParticles(scene){\n\tvar fountain = BABYLOn.Mesh.CreateBox('fountain',1.0,scene);\n\t\n\tvar particleSystem = new BABYLON.ParticleSystem('parts',200,scene);\n\t\n}","title":""},{"docid":"05c25ecf362ca6e3c408d0e8da15d8cd","score":"0.5776272","text":"ParticleSystem(x, y){\n this.place.x = x;\n this.place.y = y;\n }","title":""},{"docid":"fcd247059f7fa74df2f702de7112d989","score":"0.5774511","text":"function createParticles(x, y) {\n var particleCount = Math.round(random(options.particleMinCount, options.particleMaxCount));\n while(particleCount--) {\n particles.push(new Particle(x, y));\n }\n}","title":""},{"docid":"de69a9c1b1b847bc60bc1c82df3c434a","score":"0.5771445","text":"function SkeletonKingParticleClass(){\n\tthis.x = 75;\n\tthis.y = 75;\n\tthis.velX = 5;\n\tthis.velY = -7;\n\tthis.amountOfSmoke = 100;\n\tthis.readyToRemove = false;\n\tthis.cyclesLeft = 300;\n\tthis.myColor;\n\n\tthis.move = function() {\n\t\tthis.cyclesLeft--;\n\n\t\tif(this.cyclesLeft < 0) {\n\t\t\tthis.readyToRemove = true;\n\t\t}\n\n\t\tthis.x += this.velX;\n\t\tthis.y += this.velY;\n\t}\n\n\tthis.draw = function() {\n\t\tcanvasContext.drawImage(greenParticlePic,this.x,this.y);\n\t}\n}","title":""},{"docid":"70423196c48904c99ff2dc54aef8c66d","score":"0.57677114","text":"function particleDraw() {\n fill(255);\n ellipse(this.px, this.py, 9, 9);\n}","title":""},{"docid":"a419189028358ac6d8c942deedc9fb6c","score":"0.57626855","text":"createParticle(p) {\r\n p.noStroke();\r\n // p.fill('rgba(200,169,169,1)');\r\n p.fill('rgba(0,0,0,1)');\r\n p.circle(this.x, this.y, this.r);\r\n }","title":""},{"docid":"03661c49f1cde63eee5652625d39a818","score":"0.5757868","text":"createParticles(){\n const particleGeometry = new THREE.BufferGeometry;\n const particleCount = 5000;\n\n const positions = new Float32Array(particleCount * 3);\n\n for(let i = 0; i < particleCount * 3; i++){\n positions[i] = (Math.random() - 0.5) * 500;\n }\n\n particleGeometry.setAttribute('position', new THREE.BufferAttribute(positions, 3));\n\n const material = new THREE.PointsMaterial({\n size: 0.05\n })\n const particles = new THREE.Points(particleGeometry, material);\n particles.name = \"Stars\";\n this.scene.add(particles);\n }","title":""},{"docid":"aacbcb722740a818516ceeb5621dbc38","score":"0.5757828","text":"function createParticles(x1, y1, lifeCycles, speedMult=1.0){\n\t\tif(lifeCycles === undefined){\n\t\t\tlifeCycles = MINCYCLE+Math.random()*CYCLEANCHOR;\n\t\t}\n\t\tfor(var i=0;i<PARTICLESNUM;i++){\n\t\t\tvar particlesClass = new ParticlesTwoClass(speedMult);\n\t\t\tparticlesClass.x=x1;\n\t\t\tparticlesClass.y=y1;\n\n\t\t\tparticlesClass.cyclesLeft=lifeCycles;\n\t\t\tparticleList.push(particlesClass);\n\n\t\t\tif(Math.random()<0.5){\n\t\t\t\tparticlesClass.myColor=\"#ED1313\";//red\n\t\t\t} else {\n\t\t\t\tparticlesClass.myColor=\"#E4E418 \";//yellow\n\t\t\t}\n\t\t\t/*particlesClass.random = Math.random();\n\t\t\tvar interval=particlesClass.random* (0.7 - 0.3) + 0.3;\n\n\t\t\t\tif(particlesClass.random<0.3){\n\t\t\t\t\tparticlesClass.myColor=\"#e8a3e4\";//burnt blue5C5D91\n\t\t\t\t} else if (interval>0.3 && interval<0.7){\n\t\t\t\t\tparticlesClass.myColor=\"#67eaf3\"//burnt redA0372D\n\t\t\t\t} else {\n\t\t\t\t\tparticlesClass.myColor=\"red\"//burnt yellowA0372D\n\t\t\t\t}*/\n\t\t}\n\t}","title":""},{"docid":"68d4dbf46e616db229325f638ffb6402","score":"0.57570684","text":"render() {\n return (\n <section className=\"text-center\" id=\"jumbotron\">\n <div className=\"container\">\n <Particles\n className=\"jumbo-animation\"\n params={{\n particles: {\n number: {\n value: 90,\n\n density: {\n enable: false,\n value_area: 1000\n }\n },\n color: {\n value: [\"#1F7A8C\", \"#E3B505\", \"#BFDBF7\"]\n },\n shape: {\n type: [\"circle\", \"polygon\"],\n stroke: {\n width: 0,\n color: \"#ffffff\"\n },\n polygon: {\n nb_sides: 5\n },\n image: {\n src: \"https://ubisafe.org/images/bubble-transparent-6.png\",\n width: 100,\n height: 100\n }\n },\n opacity: {\n value: 0.5,\n random: false,\n anim: {\n enable: false,\n speed: 1,\n opacity_min: 0.1,\n sync: true\n }\n },\n size: {\n value: 10,\n random: false,\n anim: {\n enable: false,\n speed: 9.744926547616142,\n size_min: 0.1,\n sync: true\n }\n },\n line_linked: {\n enable: true,\n distance: 130,\n color: \"#ffffff\",\n opacity: 0.4,\n width: 1\n },\n move: {\n enable: true,\n speed: 6,\n direction: \"top-right\",\n random: false,\n straight: true,\n out_mode: \"out\",\n bounce: false,\n attract: {\n enable: false,\n rotateX: 600,\n rotateY: 1200\n }\n }\n },\n interactivity: {\n detect_on: \"canvas\",\n events: {\n onhover: {\n enable: true,\n mode: \"grab\"\n },\n onclick: {\n enable: true,\n mode: \"push\"\n },\n resize: true\n },\n modes: {\n grab: {\n distance: 400,\n line_linked: {\n opacity: 1\n }\n },\n bubble: {\n distance: 400,\n size: 40,\n duration: 2,\n opacity: 8,\n speed: 3\n },\n repulse: {\n distance: 200,\n duration: 0.4\n },\n push: {\n particles_nb: 4\n },\n remove: {\n particles_nb: 2\n }\n }\n },\n retina_detect: true\n }}\n />\n </div>\n <div className=\"jumbotron\" id=\"jumbo\">\n <div className=\"overlay container\">\n <div className=\"jumbo-heading\">\n <h1 className=\"\" id=\"jumbo-text \">\n Hi, I'm\n <strong className=\"jumbo-name\"> Cian O'Gralaigh</strong> <br />\n and I'm a full-stack web developer.\n </h1>\n </div>\n <div className=\"jumbo-btn-div\">\n <a href=\"#projects\">\n <button type=\"button\" className=\"btn \" id=\"jumbo-button\">\n See My Work {\" \"}\n <FontAwesomeIcon className=\"jumbo-arrow\" icon=\"arrow-right\" />\n </button>\n </a>\n </div>\n </div>\n </div>\n </section>\n );\n }","title":""},{"docid":"4a4606c7d91c3ef586904bdb6216de41","score":"0.5751363","text":"_spawnParticles(){\n\t\tif(Math.random() > dt)\n\t\t\treturn;\n\t\tvar p = new seekerParticle(this.pos.x, this.pos.y, \"#c00\", this);\n\t\tp.setRandVel(Math.random() * 3 + 3);\n\t\tp.pos = p.pos.plus(p.vel.multiply(Math.random() + 1));\n\t\tparticles.push(p);\n\t}","title":""},{"docid":"34e32ea8bb07ea51e42ba2da428091a7","score":"0.57453","text":"function init() {\n\n //In case it isn't empty for some reason\n particlesArray = [];\n\n //This is to make the number of particles scale up or down with size of the screen\n let numberOfParticles = canvas.width * canvas.height / 9000;\n\n //Will create i number of particles with randomized values and fill up particlesArray\n for (var i = 0; i < numberOfParticles; i++) {\n\n let radius = (Math.random() * 2) + 1;\n let x = (Math.random() * (canvas.width - radius * 4)) + radius * 4;\n let y = (Math.random() * (canvas.height - radius * 4)) + radius * 4;\n let directionX = randomizedSpeed();\n let directionY = randomizedSpeed();\n\n let color = particleColor;\n\n particlesArray.push(new Particle(x, y, directionX, directionY, radius, color));\n }\n\n}","title":""},{"docid":"10ec73dfae3580055fc7abb456d145b1","score":"0.57388276","text":"function placeDiv() {\n\t\tfor (var i=1; i<=dots; i+=1) {\n\t\t\tvar isBlack = document.getElementById(i).innerHTML;\n\t\t\tif (isBlack!=='<div class=\"round black\"></div>') {\n\t\t\tdocument.getElementById(i).innerHTML = drawDiv();\n\t\t\t}\n\t\t\n}\t}","title":""},{"docid":"8a5bc77ee775dd5b267dd6f33f06cc20","score":"0.57337284","text":"gridStage2() {\n for (let i = 0; i < this.psArray.length; i++) {\n /////////pick up the special ten dots////////////\n if (\n i == 0 ||\n i == 4 ||\n i == 8 ||\n i == 28 ||\n i == 40 ||\n i == 44 ||\n i == 60 ||\n i == 72 ||\n i == 76 ||\n i == 80\n ) {\n ////////save the special dots positions//////////\n this.specialDotsPos.push(this.psArray[i].particle.position);\n\n ////////fade out and delete the ten dots in the grid/////////////\n var targetVector = new Vector2(0, 0);\n this.psArray[i].updateScale(targetVector, 50, 0).onComplete(() => {\n this.scene.remove(targetVector);\n this.scene.remove(this.psArray[i]);\n });\n } else {\n ////////////from right to left column///////////////\n for (let k = 4; k >= -4; k--) {\n setTimeout(() => {\n if (this.psArray[i].pos.x == k * this.gap) {\n let delayTime = 0;\n if (k % 4 != 0) {\n delayTime = Math.abs(this.psArray[i].pos.y) * this.gap;\n } else {\n delayTime = (4 - Math.abs(this.psArray[i].pos.y)) * this.gap;\n }\n //make the particles fade out to 0 after scale up and dowm with random delay time\n var chainB = this.psArray[i].updateScale(\n new Vector2(0, 0),\n 200,\n 0\n );\n //particles start to scale up and down with random delay time\n let targetVector = new Vector2(2, 2);\n this.psArray[i]\n .updateScale(targetVector, 300, delayTime)\n .repeat(1)\n .yoyo(true)\n .chain(chainB)\n .onComplete(() => {\n this.scene.remove(targetVector);\n this.scene.remove(this.psArray[i]);\n });\n\n //update the pos\n var updatePos = new THREE.Vector3(4, 0, 0);\n updatePos.add(this.psArray[i].pos);\n this.psArray[i]\n .updatePos(updatePos, 850, 0)\n .easing(TWEEN.Easing.Sinusoidal.InOut)\n .onComplete(() => {\n this.scene.remove(updatePos);\n });\n }\n }, (4 - k) * 50);\n }\n }\n }\n }","title":""},{"docid":"b0bc771d6c36d452b8d5486323543fec","score":"0.57295674","text":"function create_particle()\n{\n\t//Random position on the canvas\n\tthis.x = Math.random()*W;\n\tthis.y = Math.random()*H;\n\t\n\t//Random velocity to each particle\n\tthis.vx = Math.random()*10-5;\n\tthis.vy = Math.random()*10-5;\n\t\n\t//Random colors - kept as white, but found code to make the colors random\n\t// var r = Math.random()*255>>0;\n\t// var g = Math.random()*255>>0;\n\t// var b = Math.random()*255>>0;\n\tthis.color = \"rgba(255, 255, 255, 0.5)\";\n\t\n\t//Random size\n\tthis.radius = Math.random()*5;\n\n}","title":""},{"docid":"9cd7806ba727b22e42eb84ac09e94bcb","score":"0.5724009","text":"ParticleSystem(p){\n this.place.x = p.x;\n this.place.y = p.y;\n }","title":""},{"docid":"53ad222af460efc4bf964a6c02b64129","score":"0.5712909","text":"function Particle ()\n\t{\n\t\tthis.scale = 1.0;\n\t\tthis.x = 0;\n\t\tthis.y = 0;\n\t\tthis.radius = 20;\n\t\tthis.color = \"#000\";\n\t\tthis.velocityX = 0;\n\t\tthis.velocityY = 0;\n\t\tthis.scaleSpeed = 0.5;\n\t\tthis.useGravity = false;\n\t\tthis.text = ''; // hello ugly hack!\n \n\t\tthis.update = function(ms)\n\t\t{\n\t\t\t// shrinking\n \n\t\t\tthis.scale -= this.scaleSpeed * ms / 1000.0;\n \n\t\t\tif (this.scale <= 0)\n\t\t\t{\n // particle is dead, remove it\n removeFromArray(particles, this);\n \n\t\t\t}\n\t\t\t\n\t\t\t// moving away from explosion center\n\t\t\tthis.x += this.velocityX * ms/1000.0;\n\t\t\tthis.y += this.velocityY * ms/1000.0;\n \n // and then later come downwards when our\n\t\t // gravity is added to it. We should add parameters \n // for the values that fake the gravity\n if(this.useGravity) {\n this.velocityY += Math.random()*4 +4;\n }\n\t\t};\n\t\t\n\t\tthis.draw = function(ctx)\n\t\t{\n\t\t\tif (this.scale <= 0)\n\t\t\t\treturn;\n\t\t\tif(this.text) {\n\t\t\t\tctx.save();\n\t\t\t\tctx.globalAlpha = this.scale;\n\t\t\t\tctx.font = '10pt Arial';\n\t\t\t\ttextWithShadow(ctx, this.text, this.x, this.y, 1.0, 'White', 'Black');\n\t\t\t\tctx.restore();\n\t\t\t}\n\t\t\telse {\n\t\t\t\t// from http://stackoverflow.com/questions/25837158/how-to-draw-a-star-by-using-canvas-html5\n\t\t\t\tvar spikes = 5;\n\t\t\t\tvar outerRadius = 4+4*this.scale;\n\t\t\t\tvar innerRadius = 2+2*this.scale;\n\t\t\t\tvar rot=Math.PI/2*3;\n\t\t\t\tvar cx = this.x;\n\t\t\t\tvar cy = this.y;\n\t\t\t\tvar px=cx;\n\t\t\t\tvar py=cy;\n\t\t\t\tvar step=Math.PI/spikes;\n\n\t\t\t\tctx.save();\n\t\t\t\tctx.globalAlpha = this.scale*2;\n\t\t\t\tctx.strokeStyle=this.color;\n\t\t\t\tctx.beginPath();\n\t\t\t\tctx.moveTo(cx,cy-outerRadius);\n\t\t\t\tfor(i=0;i<spikes;i++){\n\t\t\t\t px=cx+Math.cos(rot)*outerRadius;\n\t\t\t\t py=cy+Math.sin(rot)*outerRadius;\n\t\t\t\t ctx.lineTo(px,py);\n\t\t\t\t rot+=step;\n\n\t\t\t\t px=cx+Math.cos(rot)*innerRadius;\n\t\t\t\t py=cy+Math.sin(rot)*innerRadius;\n\t\t\t\t ctx.lineTo(px,py);\n\t\t\t\t rot+=step;\n\t\t\t\t}\n\t\t\t\tctx.lineTo(cx,cy-outerRadius);\n\t\t\t\tctx.stroke();\n\t\t\t\tctx.closePath();\n\t\t\t\tctx.restore();\n\t\t\t}\n\t\t};\n\t}","title":""},{"docid":"9d4c9a69f3bbd349e7035ed49de45863","score":"0.5707153","text":"_jumpParticles(){\n\t\tvar c = this.getCol();\n\t\tfor(var i = 10; i > 0; i -= 1){\n\t\t\tvar p = new particle(c.position.x + Math.random() * c.size.x, c.bottom());\n\t\t\tp.setRandVel(Math.random() * 10, -Math.PI, 0);\n\t\t\tp.vel = p.vel.minus(this.vel);\n\t\t\tp.add();\n\t\t}\n\t}","title":""},{"docid":"77be18399a6cdccf2f4f31e68bf335c3","score":"0.5701661","text":"function init() {\n for (let index = 0; index < numberOfParticles; index++) {\n particlesArray.push(new Particle());\n }\n }","title":""},{"docid":"741d37b70f404e897dd8bd620a53dfe8","score":"0.5699769","text":"function thirdLevelSetup() {\n\n // climber class\n //\n // To put postion, the size, putting image and the speed\n // This is also to reset the position when the climber goes up\n climber = new Climber(width / 2, 500, 500, 500, 3.5, climbImg, UP_ARROW, DOWN_ARROW, LEFT_ARROW, RIGHT_ARROW);\n\n //Array\n //\n // For the starting platform\n for (let s3 = 0; s3 < numbStartP; s3++) {\n // Starting platform\n //\n //this is a platform for the climber for the start of the game\n // in case all the the random platform doesn't spawn under\n startingPlatPlus = new Platform(width / 2, 700, 2000, 1000, platLongImg);\n\n // push\n //\n // To add the platform as an array\n startingPlat.push(startingPlatPlus);\n }\n\n // Clearing the amount of snow from the last level\n snowFall = [];\n\n // For loop for snow\n //\n // To make the number of snows that will fall\n for (let f3 = 0; f3 < snowNumb; f3++) {\n // random()\n //\n // Making the snow spawn on top of the screen\n let snowX = random(0, width);\n let snowY = random(0, height);\n\n\n // snowFallPlus\n //\n // New snow that will fall\n snowFallPlus = new Snow(snowX, snowY, color(230, 255, 255), 5);\n\n // push()\n //\n // to make array objects for snow\n snowFall.push(snowFallPlus);\n }\n\n // For loop for snow\n //\n // To make the number of snows that will fall\n for (let fT3 = 0; fT3 < snowNumb; fT3++) {\n // random()\n //\n // Making the snow spawn on top of the screen\n let snowX = random(0, width);\n let snowY = random(0, height);\n\n\n // snowFallPlus\n //\n // New snow that will fall\n snowFallPlus = new Snow(snowX, snowY, color(230, 255, 255), 2);\n\n // push()\n //\n // to make array objects for snow\n snowFall.push(snowFallPlus);\n }\n\n // Clearing the amount of avalanche from the previous level\n avalanche = [];\n\n // Avalanche\n //\n // This part will show a falling avalanche\n for (let a3 = 0; a3 < avaNumb; a3++) {\n // random()\n //\n // Making an avalanche spawn randomly at the top screen\n let avalX = random(0, width);\n let avalY = random(0, height);\n\n // avalanchePlus\n //\n // Making avalanche into array\n avalanchePlus = new Avalanche(avalX, avalY, 1000, 500, avalancheImg);\n\n // push()\n //\n // To make more array objects of avalanche\n avalanche.push(avalanchePlus);\n\n\n }\n // To clear the previous platform from the last level\n // and make new ones\n platformShort = [];\n platformLong = [];\n\n // For loop for the second level\n //\n // To make array objects for platform\n //\n // and the z is to differentiate the array from the previous level\n for (let w = 0; w < numbPlat; w++) {\n\n // random()\n //\n // adding position for the platforms\n\n // For the position the short platform\n let reShortXW = random(300, width - 300);\n let reShortYW = random(0, height);\n\n // For the position for long platform\n let reLongXW = random(300, width - 300);\n let reLongYW = random(0, height - 300);\n\n // Platform classes\n //\n // Platform that will be generated in the screen\n platformShortPlusW = new Platform(reShortXW, reShortYW, 500, 500, platShortImg);\n platformLongPlusW = new Platform(reLongXW, reLongYW, 1000, 500, platLongImg);\n\n // push()\n //\n // To add more platform in the screen as an array\n platformShort.push(platformShortPlusW);\n platformLong.push(platformLongPlusW);\n\n }\n}","title":""},{"docid":"6d2bc7d10307308592ed26a8f8eb1617","score":"0.5696343","text":"render(props) {\n\n const num = props.num;\n const styleClass = props['style-class'] || '';\n const circles = [];\n\n for (let i = 0; i < num; i++) {\n circles.push({});\n }\n\n return (<div class={`${styleClass}`}>\n {circles.map((c, idx) => {\n\n const _size = (100 / num) * (idx + 1)\n const position = (100 - _size) / 2;\n\n return (<div class={`${styles.mut_sphere} ${styleClass}`} style={`width: ${_size}%; height:${_size}%; top: ${position}%; left: ${position}%; z-index: ${10 - idx }; animation-delay: ${idx * 200}ms;`}></div>);\n })}\n </div>)\n\n }","title":""},{"docid":"d1a47eeb0f26db6778d3d4f8c348a388","score":"0.56960106","text":"function play() {\n // Move background sky to make infinitely scrolling background\n sky.tileX -= 1\n\n\n //Loop through all the blocks and check for a collision between\n //each block and the snowman.\n var snowmanVsBlock = iceBlocks.children.some(function(block) {\n let snowmanVsBlockCollisionType = g.rectangleCollision(snowman, block);\n if (snowmanVsBlockCollisionType === \"bottom\") {\n floorLevel = block.gy;\n if (block.type === \"finish\") {\n finish.gotoAndStop(1);\n g.wait(2000, function() {\n g.state = end;\n });\n }\n } else if ((snowmanVsBlockCollisionType === \"right\") && (iceBlocks.vx < 0)) {\n iceBlocks.vx = 0;\n } else if ((snowmanVsBlockCollisionType === \"left\") && (iceBlocks.vx > 0)) {\n iceBlocks.vx = 0;\n }\n });\n\n\n var snowmanVsSnowflake = snowflakes.children.some(function(snowflake) {\n let collisionBoolean = g.hitTestRectangle(snowman, snowflake, true);\n if (collisionBoolean === true) {\n if (snowflake.visible) {\n renderParticles = true;\n snowflake.visible = false;\n } else {\n renderParticles = false;\n }\n }\n });\n\n\n if (renderParticles) {\n if (snowballCount < 5) {\n snowballCount++;\n }\n //Create dust explosion\n g.createParticles(\n snowman.centerX, snowman.centerY, //x and y position\n () => g.sprite(dustFrames), //Particle sprite\n g.stage, //The container to add the particles to \n 40, //Number of particles\n 0.5, //Gravity\n false, //Random spacing\n 3.95, 5.49, //Min/max angle\n 5, 16, //Min/max size\n 1, 2 //Min/max speed\n );\n }\n\n\n // Render snowballs depending on snowman course\n if (snowmanDirection === \"left\") {\n targetX = snowman.x + 40;\n } else {\n targetX = snowman.x - 10;\n }\n targetY = snowman.y + 70;\n\n let index = 0;\n var snowballBounce = snowballs.children.some(function(snowball) {\n snowball.visible = false;\n index++;\n snowball.vx += (targetX - snowball.x) * spring;\n snowball.vy += (targetY - snowball.y) * spring;\n // snowball.vy += gravity * 5;\n snowball.vx *= friction;\n snowball.vy *= friction;\n snowball.x += snowball.vx;\n snowball.y += snowball.vy;\n\n // Update target for next ball running through loop \n if (snowmanDirection === \"left\") {\n targetX = snowball.x + 20;\n } else {\n targetX = snowball.x - 20;\n }\n targetY = snowball.y;\n\n if (index <= snowballCount) {\n snowball.visible = true;\n }\n });\n\n\n var penguinBounce = bouncingPenguins.children.some(function(bPenguin) {\n let penguinVSblock = iceBlocks.children.some(function(iBlock) {\n penguinCollisionType = g.rectangleCollision(bPenguin, iBlock, true);\n if (penguinCollisionType === \"bottom\") {\n bPenguin.floorL = iBlock.y;\n }\n });\n\n if (bPenguin.y < bPenguin.floorL - 150) {\n bPenguin.vy += gravity * 0.2;\n }\n bPenguin.vx = bPenguin.oVx + iceBlocks.vx;\n bPenguin.oX += bPenguin.oVx;\n var temp = numberOfPillars * 48;\n // Make bouncing penguins turn left when they've reached end of course\n if (bPenguin.oX > (numberOfPillars * 48)) {\n bPenguin.oVx = -bPenguin.oVx;\n bPenguin.playAnimation(bouncingLeft);\n }\n g.move(bPenguin);\n });\n\n var snowmanVsBouncePenguin = bouncingPenguins.children.some(function(bPenguin) {\n if (bPenguin.visible === true) {\n let snowmanPenguinCollisionType = g.rectangleCollision(snowman, bPenguin);\n if (snowmanPenguinCollisionType) {\n // Decrease snowball count\n if (snowballCount > 0) {\n snowballCount--;\n }\n // Render hurt snowman for 0.3 sec\n snowman.gotoAndStop(2);\n g.wait(300, function() {\n snowman.gotoAndStop(0);\n });\n }\n }\n\n });\n\n // Skating penguin motion\n skatingPenguin.oX += iceBlocks.vx;\n if (skatingPenguin.x > skatingPenguin.oX + 9 * 64) {\n skatingPenguin.vx = -skatingPenguin.vx;\n skatingPenguin.playAnimation(skatingLeft);\n skatingPenguin.x = skatingPenguin.oX + 9 * 64 - 30;\n } else if (skatingPenguin.x < skatingPenguin.oX) {\n skatingPenguin.vx = -skatingPenguin.vx;\n skatingPenguin.playAnimation(skatingRight);\n skatingPenguin.x = skatingPenguin.oX;\n }\n skatingPenguin.x += skatingPenguin.vx + iceBlocks.vx;\n\n let activePenguinIndex = 0;\n if (skatingPenguin.visible === true) {\n activePenguinIndex++;\n let snowmanVsSkatePenguin = g.rectangleCollision(snowman, skatingPenguin);\n if (snowmanVsSkatePenguin) {\n // Decrease snowball count\n if (snowballCount > 0) {\n snowballCount--;\n }\n // Render hurt snowman for 0.3 sec\n snowman.gotoAndStop(2);\n g.wait(300, function() {\n snowman.gotoAndStop(0);\n });\n }\n }\n\n // Set an upper limit for Y velocity\n // Even if user keeps pressing the up arrow, \n // Y velocity will stop incrementing\n if (snowman.vy > minVelocityY) {\n snowman.vy += snowman.ay;\n }\n\n // Apply gravity only if snowman above floor level\n if (snowman.y < floorLevel - snowman.height) {\n snowman.vy += gravity;\n }\n\n // Attack snowball physics\n if (attackSnowball.attack === false) {\n attackSnowball.x = snowman.centerX + Math.cos(attackSnowball.angle) * attackSnowball.radius;\n attackSnowball.y = snowman.centerY - snowman.halfHeight + Math.sin(attackSnowball.angle) * attackSnowball.radius;\n if (attackSnowball.angle >= 0.785) {\n attackSnowball.w = -attackSnowball.w;\n //attackSnowball.angle += attackSnowball.w;\n } else if (attackSnowball.angle <= -3.926) {\n attackSnowball.w = -attackSnowball.w;\n }\n attackSnowball.angle += attackSnowball.w;\n }\n\n if (attackSnowball.attack === true) {\n g.move(attackSnowball);\n }\n\n var snowballVsBouncePenguin = bouncingPenguins.children.some(function(bPenguin) {\n if (bPenguin.visible === true) {\n activePenguinIndex++;\n }\n // Only if the penguin is active and if snowball has been thrown\n if ((bPenguin.visible === true) && (attackSnowball.attack === true) && (snowballCount >= 0)) {\n let snowballPenguinCollisionType = g.rectangleCollision(attackSnowball, bPenguin);\n if (snowballPenguinCollisionType) {\n bPenguin.visible = false;\n g.createParticles(\n g.canvas.width - 130, 25, //x and y position\n () => g.sprite(dustFrames), //Particle sprite\n g.stage, //The container to add the particles to \n 40, //Number of particles\n 0.5, //Gravity\n false, //Random spacing\n 3.95, 5.49, //Min/max angle\n 5, 10, //Min/max size\n 1, 2 //Min/max speed\n );\n }\n }\n });\n\n let snowballVsSkatePenguin = g.rectangleCollision(attackSnowball, skatingPenguin);\n if (snowballVsSkatePenguin) {\n skatingPenguin.visible = false;\n g.createParticles(\n g.canvas.width - 130, 25, //x and y position\n () => g.sprite(dustFrames), //Particle sprite\n g.stage, //The container to add the particles to \n 40, //Number of particles\n 0.5, //Gravity\n false, //Random spacing\n 3.95, 5.49, //Min/max angle\n 5, 10, //Min/max size\n 1, 2 //Min/max speed\n );\n }\n\n // Update points \n let pIndex = 0;\n if (activePenguinIndex < totalPenguins) {\n pointCount = totalPenguins - activePenguinIndex;\n var updatePoints = points.children.some(function(p) {\n //p.visible = false;\n pIndex++;\n if (pIndex <= pointCount) {\n p.visible = true;\n }\n });\n }\n\n\n // Move snowman\n g.move(snowman);\n\n\n // If we have not reached the finish, move blocks to the \n // left each frame\n if ((finish.gx > 156)) {\n finish.vx = iceBlocks.vx;\n g.move(finish);\n snowflakes.vx = iceBlocks.vx;\n g.move(snowflakes);\n igloo.vx = iceBlocks.vx;\n g.move(igloo);\n g.move(iceBlocks);\n }\n\n // Keep player contained inside the stage area\n // Second argument here any JS object\n g.contain(snowman, {\n x: 32,\n y: 16,\n width: g.canvas.width * 3 / 4,\n height: g.canvas.height\n });\n\n\n\n}","title":""},{"docid":"d9a196d4aa3ba2ce4f0d64433502c677","score":"0.5695283","text":"function ParticleFountain(params){\n this.init = function(){\n for(var i = 0; i < this.count; i++){\n this.particles.push(new Particle({'x': this.x, \n 'y': this.y, \n 'context': this.context,\n 'red': this.r+150,\n 'green': this.g+150/2,\n 'blue': this.b+150/2,\n 'direction': this.direction-40+randomInt(80),\n 'speed': (this.speed)+randomInt(3),\n 'ttl': this.ttl + randomInt(30)\n })\n );\n }\n }\n\n this.update = function(){\n for(var i = 0; i < this.count; i++){\n if(this.particles[i].update()){\n var color_mod = randomInt(150);\n this.particles.splice(i, 1);\n this.particles.push(new Particle({'x': this.x, \n 'y': this.y, \n 'context': this.context,\n 'red': this.r+color_mod,\n 'green': this.g+color_mod/2,\n 'blue': this.b+color_mod/2,\n 'direction': this.direction-40+randomInt(80),\n 'speed': (this.speed)+randomInt(3),\n 'ttl': this.ttl + randomInt(30)\n })\n );\n }\n else{\n this.particles[i].draw();\n }\n }\n }\n \n this.update_ex = function(params){\n var cust_dir = params.direction || this.direction;\n var cust_x = params.x || this.x;\n var cust_y = params.y || this.y;\n var cust_create = params.create;\n \n for(var i = 0; i < this.count; i++){\n \n if(this.particles[i].update()){\n this.particles.splice(i, 1);\n var color_mod = randomInt(150);\n this.particles.push(new Particle({'x': this.x, \n 'y': this.y, \n 'context': this.context,\n 'red': this.r+color_mod,\n 'green': this.g+color_mod/2,\n 'blue': this.b+color_mod/2,\n 'direction': this.direction-30+randomInt(60),\n 'speed': this.speed*randomInt(2)+1,\n 'ttl': this.ttl + randomInt(30)\n })\n );\n };\n }\n }\n \n this.ttl = params.ttl || 60;\n this.context = params.context;\n this.direction = params.direction; // degrees\n this.x = params.x;\n this.y = params.y;\n this.count = params.count;\n this.speed = params.speed; // this will be ~randomized\n this.r = params.red;\n this.g = params.green;\n this.b = params.blue;\n this.particles = [];\n this.init();\n}","title":""},{"docid":"d290f96747e4766b6c480b388e28d428","score":"0.56949264","text":"function draw() {\n background(backgroundColor);\n particles.forEach((particle, index) => {\n particle.update();\n particle.draw();\n particle.check(particles.slice(index));\n });\n}","title":""},{"docid":"346c2c2152a054082175a89463a83e02","score":"0.5691519","text":"_emitParticles() {\n const particleInterval = setInterval(async () => {\n if (!this.spinning) clearInterval(particleInterval);\n\n const particle = new Sprite.from('star');\n particle.name = 'particle';\n particle.anchor.set(0.5);\n \n this._particles.addChild(particle);\n \n gsap.to(particle, { y: window.innerHeight, ease: 'back.in(5)', duration: 2 });\n gsap.to(particle.scale, { x: 0, y: 0, duration: 2 });\n await gsap.to(particle, { \n x: (window.innerWidth * Math.random() + 500) * (Math.random() > 0.5 ? -1 : 1), \n rotation: Math.PI * Math.random() * 4,\n duration: 2\n });\n \n this._particles.removeChild(particle);\n }, 50);\n }","title":""},{"docid":"789f7a45eea8d2e4dfea44af75a3cf1a","score":"0.56903714","text":"function create()\n {\n // sets the position of each particle to where the user has clicked\n this.x = clickX;\n this.y = clickY;\n // Add random velocity to each particle\n this.vx = Math.random()*5-2;\n this.vy = Math.random()*5-2;\n \n //Randomised the RGB values of the colours\n var red = Math.random()*255>>0;\n var green = Math.random()*255>>0;\n var blue = Math.random()*255>>0;\n this.color = \"rgba(\"+red+\", \"+green+\", \"+blue+\", 0.5)\";\n \n //applies a random size to the radius of the particle\n this.radius = Math.random()*7;\n \n // adds a lifetime value for the particle\n this.lifeSpan = Math.random()*200;\n\n }","title":""},{"docid":"a77867939a7d2e98bc19ad57e5ca8ab4","score":"0.56798255","text":"function createPieces(num) {\r\n\tvar pieces = document.createElement('div');\r\n\tif (pieces.className.indexOf(\"each\") == -1)\r\n\t\tpieces.className += \" \" + \"each\";\r\n\tpieces.index = num;\r\n\tvar top = parseInt(num / 4) * 88;\r\n\tvar left = num % 4 * 88;\r\n\tpieces.style.top = top + 'px';\r\n\tpieces.style.left = left + 'px';\r\n\tpieces.style.backgroundPosition = left * -1 + 'px' + ' ' + top * -1 + 'px';\r\n\treturn pieces;\r\n}","title":""},{"docid":"c7eceb0ab1be46743923e2f2ddbcaa1f","score":"0.5679127","text":"function initAllParticles(){\n\n for(var k=0;k<sentence.length;k++){\n var offset = k * 6* edgeSize;\n for(var j=0;j<7;j+=1){\n for(var i=0;i<5;i+=1){\n var particle = new Particle(ctx,Math.round(offsetX+i*edgeSize + offset),offsetY+j*edgeSize);\n memory.push(particle);\n }\n }\n }\n console.log(memory.length);\n}","title":""},{"docid":"65b256a4fb8d80933cab307355d03dd5","score":"0.56787026","text":"function setup() {\n createCanvas(windowWidth, 500); \n \n \n for(var i = 0; i < nums; i++){\n\t\tparticles_a[i] = new Particle(random(0, width),random(0,height));\n\t\tparticles_b[i] = new Particle(random(0, width),random(0,height));\n\t\tparticles_c[i] = new Particle(random(0, width),random(0,height));\n particles_d[i] =new Particle (random (0, width),random(0,height));\n\t}\n \n //leaf + bud\n for(i=0;i<numWaterlilies;i++){\n // drawleaf(x,y,r,g,b)\n\t\tleaf1 = new drawleaf (random(width),random(height),random(35,98),random(30,50),random(17,97),1) ;// generate one leaf\n\t\twaterlilies.push(leaf1); //add it to the array.\n lilybuds [i] = new drawLily (random(0, width),random(0,height));\n \n\t}\n \n \n}//setup ends","title":""},{"docid":"ddde5f64568530e66ecb362f56337064","score":"0.5678595","text":"draw() {\n for (let particle in this.particles) {\n this.particles[particle].draw();\n }\n }","title":""},{"docid":"78ba407fb5e6e508695c760c205b74bf","score":"0.56771797","text":"addParticleSuperellipse (num, where) {\r\n const amnt = TWO_PI / num;\r\n const n = 0.5;\r\n const b = 1.5;\r\n const a = 1.5;\r\n\r\n for (let i = 0; i < TWO_PI; i+= amnt) {\r\n const na = 2 / n;\r\n const x = pow(abs(cos(i)), na) * a * this.sgn(cos(i));\r\n const y = pow(abs(sin(i)), na) * b * this.sgn(sin(i));\r\n\r\n const force = createVector(x, y);\r\n \r\n this.particleRandomly(where, force);\r\n }\r\n }","title":""},{"docid":"fdbd8586e09199c80fb3eb00482030a8","score":"0.56760085","text":"function createParticles2() {\n //Materiale:\n\tlet material = new THREE.PointsMaterial({\n\t size: 1,\n\t\tvertexColors : true,\n\t\tcolor : 0xff500\n\t});\n\n //Geometri, legger til posisjon og farge per verteks:\n\tlet geom = new THREE.Geometry();\n\tfor (let x = -5; x < 5; x++) {\n\t\tfor (let y = -5; y < 5; y++) {\n\t\t\tlet particle = new THREE.Vector3(x * 10, y * 10, 0);\n\t\t\tgeom.vertices.push(particle);\n\t\t\tgeom.colors.push(new THREE.Color(Math.random() * 0x00ffff));\n\t\t}\n\t}\n\n\tlet points = new THREE.Points(geom, material);\n\tscene.add(points);\n}","title":""}],"string":"[\n {\n \"docid\": \"bae08515a8304528da296cc4ec8bea1a\",\n \"score\": \"0.7164519\",\n \"text\": \"function initSnow() {\\n\\n var container = document.createElement('div');\\n\\n container.style.position = 'absolute';\\n container.style.top = '0';\\n container.style.left = '0';\\n\\n document.body.appendChild(container);\\n\\n canvasScene = new THREE.Scene();\\n\\n canvasRenderer = new THREE.CanvasRenderer();\\n canvasRenderer.setSize(window.innerWidth, window.innerHeight);\\n\\n particleImage.src = 'images/ParticleSmoke.png';\\n var material = new THREE.ParticleBasicMaterial( { map: new THREE.Texture(particleImage) } );\\n\\n for (var i = 0; i < 100; i++) {\\n\\n particle = new Particle3D(material);\\n particle.position.x = Math.random() * 2000 - 1000;\\n particle.position.y = Math.random() * 2000 - 1000;\\n particle.position.z = Math.random() * 2000 - 1000;\\n particle.scale.x = particle.scale.y = 1;\\n canvasScene.add( particle );\\n\\n particles.push(particle);\\n }\\n\\n canvasRenderer.domElement.style.position = 'absolute';\\n\\n container.appendChild( canvasRenderer.domElement );\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6334a6717988637ce374f3e5c70735c7\",\n \"score\": \"0.6911757\",\n \"text\": \"function renderParticles(posLeft, posTop, parAmount, parDistance) {\\n var main = $('main');\\n var particleFragment = document.createDocumentFragment();\\n var particlesAmount = parAmount;\\n \\n function randomColor() {\\n var colorsArray = [\\n 'rgb(3,0,0) radial-gradient(circle, rgba(51,6,6,1) 5%, rgba(167,19,19,1) 74%, rgba(156,14,14,1) 100%)',\\n ];\\n // to get random colors from array: colorsArray[Math.floor(Math.random() * colorsArray.length)]\\n return colorsArray[0];\\n }\\n\\n var getColor = randomColor();\\n\\n for (var i = 0; i < particlesAmount; i++) {\\n var particleElement = document.createElement('div');\\n particleElement.classList.add('particle-' + clickCounter);\\n particleElement.style.left = posLeft + 'px';\\n particleElement.style.top = posTop + 'px';\\n particleElement.style.background = getColor;\\n // to get rainbow colors of particle just uncoment it\\n // particleElement.style.background = randomColor();\\n particleFragment.append(particleElement);\\n }\\n\\n main.append(particleFragment);\\n \\n function randomPosition(left, top) {\\n function runRandomize(pos) {\\n if (Math.floor(Math.random() * 2)) {\\n return pos - Math.random() * parDistance;\\n } else {\\n return pos + Math.random() * parDistance;\\n }\\n }\\n \\n return {\\n left: runRandomize(left),\\n top: runRandomize(top)\\n }\\n }\\n\\n $('.particle-' + clickCounter).each(function () {\\n var left = randomPosition($(this).position().left, $(this).position().top).left;\\n var top = randomPosition($(this).position().left, $(this).position().top).top;\\n var $this = $(this);\\n\\n $(this).css({\\n left: left,\\n top: top,\\n opacity: 0,\\n width: 0,\\n height: 0\\n });\\n setTimeout(function () {\\n $this.remove();\\n }, 600);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"248659200aaae760bce3c11d22a4c7fc\",\n \"score\": \"0.6908777\",\n \"text\": \"function createsnow() {\\n let snowContainer = document.getElementById('snow_container');\\n snowContainer.innerHTML = '';\\n\\n // Specify how much snow you want.\\n // Based on CSS, only goes up to a max of 50.\\n let numSnowFlakes = 50;\\n for (; numSnowFlakes > 0; numSnowFlakes--) {\\n let snowFlake = document.createElement(\\\"div\\\");\\n snowFlake.className = 'snow';\\n snowContainer.append(snowFlake);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc46d2d4675e4a8d84f60203cddbc69f\",\n \"score\": \"0.6904361\",\n \"text\": \"function particles() {\\r\\n var count = 1000;\\r\\n var container = document.querySelector(\\\".container\\\");\\r\\n var i = 0;\\r\\n while (i < count) {\\r\\n// creating an element i for every particle\\r\\n var singleParticle = document.createElement(\\\"i\\\");\\r\\n// giving random size to the particles\\r\\n var x = Math.floor(Math.random() * window.innerWidth);\\r\\n var y = Math.floor(Math.random() * window.innerHeight);\\r\\n var size = Math.random() * 10;\\r\\n// applying styles to the new element i\\r\\n singleParticle.style.left = x + \\\"px\\\";\\r\\n singleParticle.style.top = y + \\\"px\\\";\\r\\n singleParticle.style.width = 1 + size + \\\"px\\\";\\r\\n singleParticle.style.height = 1 + size + \\\"px\\\";\\r\\n singleParticle.style.animationDuration = 5 + size + \\\"s\\\";\\r\\n singleParticle.style.animationDelay = -size + \\\"s\\\";\\r\\n// appending the element i in the container div\\r\\n container.appendChild(singleParticle);\\r\\n i++;\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"caa58d49f749fe42d9c087df9181fa1b\",\n \"score\": \"0.68236077\",\n \"text\": \"createParticle() {\\r\\n noStroke();\\r\\n this.color.setAlpha(this.alpha);\\r\\n fill(this.color);\\r\\n circle(this.x, this.y, this.r);\\r\\n if(sf > 1){\\r\\n //tint(255, this.alpha);\\r\\n image(this.cell, this.x, this.y, this.r, this.r);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd15a58828302bef5792e69092ccae6d\",\n \"score\": \"0.6755793\",\n \"text\": \"function bubbles() {\\n $.each($(\\\".particletext.bubbles\\\"), function(){\\n var bubblecount = ($(this).width()/50)*10;\\n for(var i = 0; i <= bubblecount; i++) {\\n var size = ($.rnd(40,80)/10);\\n $(this).append('<span class=\\\"particle\\\" style=\\\"top:' + $.rnd(20,80) + '%; left:' + $.rnd(0,95) + '%;width:' + size + 'px; height:' + size + 'px;animation-delay: ' + ($.rnd(0,30)/10) + 's;\\\"></span>');\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ff6cba7f255f7cd4eba7b1c01ade71b\",\n \"score\": \"0.6649344\",\n \"text\": \"function createParticles(){\\n\\tscene.remove.apply(scene, scene.children);\\n\\tspheres = [];\\n\\tgeometry = new THREE.SphereGeometry(2,10,10);\\n\\tmaterial = new THREE.MeshBasicMaterial({color:0xffffff});\\n\\n\\t//lineMaterial = new THREE.LineBasicMaterial( { color: 0xFFFFFF, transparent: true, opacity: 0.1 } );\\n\\t//ahora creamos cada particula\\n\\tfor(var p=0; p < particleCount; p++){\\n\\t\\t//creamos una particula con posiciones aleatorias a partir del cero\\n\\t\\t//el canvas mide 400,400 asi que el random sera entre -200 a 200\\n\\n\\t\\t//las particulas pueden salirse fuera del render\\n\\t\\tvar pX = (Math.random() * params.tamOctree) - params.tamOctree;\\n\\t\\tvar pY = (Math.random() * params.tamOctree) - params.tamOctree;\\n\\t\\tvar pZ = (Math.random() * params.tamOctree) - params.tamOctree;\\n\\n\\t\\t\\n\\t\\tparticle = new THREE.Mesh(geometry,material);\\n\\t\\t//particle.material.transparent = true;\\n\\t\\tparticle.position.set(pX,pY,pZ);\\n\\t\\t//agregamos a la geometria de particulas\\n\\t\\tspheres.push(particle);\\n\\t\\tscene.add( particle );\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29482a405441a3ae3603d6c92411fdc1\",\n \"score\": \"0.6533131\",\n \"text\": \"function createMightyParticles(focalPoint){\\n awesomeSound.play();\\n var hue = random(20, 300);\\n var pp;\\n if(!focalPoint){\\n pp = createVector(mouseX,mouseY);\\n }else{\\n pp = createVector(focalPoint.x, focalPoint.y);\\n } \\n var numberOfParticles = random(15, 35);\\n for(var i=0; i<numberOfParticles; i++){\\n var vv = createVector(0, 1);\\n vv.rotate(random(0, TWO_PI));\\n vv.mult(random(1, 3));\\n \\n var newBorn = new Particle(pp, vv, hue);\\n particleSystem.push(newBorn); \\n }\\n \\n /*var checkEdges = function(){\\n if (pp.x > width){\\n pp.x = width;\\n vv.x *=-1;\\n }else if (pp.x < 0){\\n vv.x *=-1;\\n pp.x = 0\\n }\\n \\n if (pp.y > height){\\n vv.y *=-1;\\n pp.y = height;\\n }\\n }*/\\n \\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60723b9c7dddc4fb1e8541c6e23841dc\",\n \"score\": \"0.65119386\",\n \"text\": \"function initParticles() {\\n for (var i = 0; i < 2000; i++) {\\n particles.push(new PaintParticle(width * 0.5, height * 0.5));\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39ecae1365f18cb98d0513652a1163ea\",\n \"score\": \"0.65087706\",\n \"text\": \"function setup() {\\r\\n createCanvas(800, 800);\\r\\n \\r\\n //inside setup\\r\\n\\r\\n for(let i = 0;i<width/10;i++){\\r\\n particlesBg.push(new ParticleBg());\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc4e6dd1606a244a6c77541356bde729\",\n \"score\": \"0.6487803\",\n \"text\": \"function createParticles()\\n {\\n // Adds 10 particles to the array with random positions, colours, velocities and lifespans\\n for(var i = 0; i < 10; i++)\\n {\\n particles.push(new create());\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8266e8a50a23794982d218983d1fb49\",\n \"score\": \"0.6473716\",\n \"text\": \"function positionParticles() {\\n columns = Math.round(canvas.width / distance);\\n rows = Math.round(canvas.height / distance);\\n\\n for (i = 0; i < rows * columns; i++) {\\n let x = (i % columns) * distance;\\n let y = Math.floor(i / columns) * distance;\\n particles.push(new Particle(x, y));\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a8b6e9117ab7a4fb675c89452f3f86a\",\n \"score\": \"0.6469174\",\n \"text\": \"function createParticles(n){\\n particles = [];\\n for(var x = 0; x < n; x++){\\n particles.push({\\n x: x,\\n w: 0,\\n h: getY(mark_width * x)\\n });\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb46790485773319620e7216d6931a8a\",\n \"score\": \"0.6363177\",\n \"text\": \"createParticleSystem() {\\n this._particleSystem = new BABYLON.ParticleSystem('particle', 3500, this._scene);\\n this._particleSystem.particleTexture = new BABYLON.Texture(`${baseUrl}/images/driehoek.svg`, this._scene);\\n\\n // add particle system onto the mesh\\n this._particleSystem.emitter = this._mesh;\\n this._particleSystem.minEmitBox = new BABYLON.Vector3(-30, 0, 0);\\n this._particleSystem.maxEmitBox = new BABYLON.Vector3(30, 0, 0);\\n\\n Object.assign(this._particleSystem, config.snow);\\n\\n // set emission rate\\n this._particleSystem.emitRate = this._emitRate * physicsManager.speed;\\n\\n // init particle system\\n this._particleSystem.start();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49c4ba4fb5afc34c64b4944c29ab60c8\",\n \"score\": \"0.63541603\",\n \"text\": \"function setup() {\\n \\n createCanvas( windowWidth, windowHeight );\\n washImg = loadImage( 'wash.png' ); // wash picto\\n \\n for( let i=0; i<width/14; i++ ) {\\n \\n particles.push( new Particle() );\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b698ea349ec7fb002c4863a57ec5a3e1\",\n \"score\": \"0.6320724\",\n \"text\": \"function draw() {\\n ctx.clearRect(0, 0, W, H);\\n ctx.fillStyle = \\\"rgba(255, 255, 255, 0.8)\\\";\\n ctx.beginPath();\\n\\n for (var _i2 = 0; _i2 < mp; _i2++) {\\n var p = particles[_i2];\\n ctx.moveTo(p.x, p.y);\\n ctx.arc(p.x, p.y, p.r, 0, Math.PI * 2, true);\\n }\\n\\n ctx.fill();\\n update();\\n } //Function to move the snowflakes\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d3bc43abb9834b4fb8570cd3c9f38a5\",\n \"score\": \"0.63005906\",\n \"text\": \"function generateSnow() {\\n for (i = 0; i < snowflakeCount; ++i) {\\n amplitude[i] = Math.random() * ampMultiplier;\\n posX[i] = Math.random() * (width - amplitude[i]);\\n posY[i] = Math.random() * height;\\n placeX[i] = Math.random() * flakeFluctSpeed; // Х displacement\\n placeY[i] = Math.random() + flakeDownSpeed; // Y displacement\\n deltaX[i] = 0;\\n\\n var elem = document.createElement('img');\\n elem.id = \\\"snowflake\\\" + i;\\n elem.style = \\\"position:absolute;\\\" + \\\"z-index: \\\" + i + \\\"; visibility:visible; top:-50px; left:-50px;\\\";\\n elem.src = imgsrc;\\n elem.border = 0;\\n document.body.appendChild(elem);\\n\\n obj[i] = document.getElementById(\\\"snowflake\\\" + i);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b19330b4eea60b85bfff036ecb527cc6\",\n \"score\": \"0.62871575\",\n \"text\": \"function draw() {\\r\\n background(0,5);\\r\\n // inside draw\\r\\n\\r\\nfor(let i = 0;i<particlesBg.length;i++) {\\r\\n \\r\\n particlesBg[i].createParticleBg();\\r\\n particlesBg[i].moveParticleBg();\\r\\n particlesBg[i].joinParticlesBg(particlesBg.slice(i));\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64d4a00f75df8c6a0b2a72261397facb\",\n \"score\": \"0.6267741\",\n \"text\": \"run(){\\n \\n //loop for making multiple particles\\n for(var i = 0; i < this.particles.length; i++){\\n var p = this.particles[i]; \\n p.show(); //show the particles\\n p.move(); //move the particles\\n \\n if(p.Dead()){\\n this.particles.splice(i,1);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f9639ec9fc76842fe9c1d0a838b7067\",\n \"score\": \"0.6263363\",\n \"text\": \"function PotionExperience(){\\n giraffe.underPotionInfluence=1;\\n world.SetGravity(new b2Vec2(0,1));\\n var potionBackgroundProps={ \\n color: \\\"black\\\",\\n type: \\\"static\\\",\\n desc: \\\"potionBackground\\\",\\n x:visibleCanvasCenter.x,//for some reason, don't have to adjust these by gradient radius. Radians draw from center'\\n y:visibleCanvasCenter.y,//for some reason, don't have to adjust these by gradient radius. Radians draw from center. Maybe due to the draw function we have?\\n width:rightBoundPos-leftBoundPos,\\n height:bottomBoundPos-topBoundPos,\\n maskBits:0x0008\\n }; \\n potionBackground=createABody(potionBackgroundProps,this);\\n \\n particleIndex=0;//makes sure new ones appear behind\\n for (var i=1;i<200;i++){\\n \\n new PotionParticle();\\n }\\n \\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f07a3337a341b95e177d4be7948fd8c\",\n \"score\": \"0.62447053\",\n \"text\": \"function initParticles(){\\n\\t\\t\\tvar i = 0;\\n\\n\\t\\t\\t//Draw ref image on ref canvas\\n\\t\\t\\tctxRef.drawImage(ref_image,(canvasRef.width-ref_image.width)/2,(canvasRef.height-ref_image.height)/2);\\n\\t\\t\\t//Get the pixels of the image\\n\\t\\t\\tvar pixels = ctxRef.getImageData(0,0,canvasRef.width,canvasRef.height);\\n\\n\\t\\t\\t//Add text particles\\n\\t\\t\\tfor(i=0;i<200;i++){\\n\\t\\t\\t\\tvar pX = Math.floor(Math.random()*canvasRef.width);\\n\\t\\t\\t\\tvar pY = Math.floor(Math.random()*canvasRef.height);\\n\\n\\t\\t\\t\\tvar a = pixels.data[(pX+(canvasRef.width*pY))*4+3];\\n\\t\\t\\t\\twhile(a==0){\\n\\t\\t\\t\\t\\tpX = Math.floor(Math.random()*canvasRef.width);\\n\\t\\t\\t\\t\\tpY = Math.floor(Math.random()*canvasRef.height);\\n\\t\\t\\t\\t\\ta = pixels.data[(pX+(canvasRef.width*pY))*4+3];\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//Test to see if this particle is going to be an anchor\\n\\t\\t\\t\\tvar anchor = false;\\n\\t\\t\\t\\tif(Math.random()>0.85){\\n\\t\\t\\t\\t\\tanchor = true;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tparticles.push({\\n\\t\\t\\t\\t\\ttouchID:0,\\n\\t\\t\\t\\t\\tdist:0,\\n\\t\\t\\t\\t\\tposX:pX,posY:pY,\\n\\t\\t\\t\\t\\torX:pX,orY:pY,\\n\\t\\t\\t\\t\\tisAffected:false,\\n\\t\\t\\t\\t\\tisOut:false,\\n\\t\\t\\t\\t\\toutDest:Math.random()*15,\\n\\t\\t\\t\\t\\toutCount:0,\\n\\t\\t\\t\\t\\tcharge:30,\\n\\t\\t\\t\\t\\tscale:0,\\n\\t\\t\\t\\t\\tscaleNoise:Math.random(),\\n\\t\\t\\t\\t\\tscaleNoiseSpeed:Math.random()*0.005,\\n\\t\\t\\t\\t\\toffX:Math.random(),offY:Math.random(),\\n\\t\\t\\t\\t\\tnoiseAmount:Math.random()*2,\\n\\t\\t\\t\\t\\trandSpeed:Math.random()*0.01,\\n\\t\\t\\t\\t\\tangle : 0,\\n\\t\\t\\t\\t\\thasRepulsion : false,\\n\\t\\t\\t\\t\\tisAnchor:anchor,\\n\\t\\t\\t\\t\\tisSprite : false,\\n\\t\\t\\t\\t\\tmag:Math.random()*40+160\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\\n\\n\\t\\t\\t//Run through all the pixel to create particles where there is text\\n\\t\\t\\tfor(i=0;i<canvasRef.width;i++){\\n\\t\\t\\t\\tfor(var j=0;j<canvasRef.height;j++){\\n\\t\\t\\t\\t\\t//Get the alpha of that pixel\\n\\t\\t\\t\\t\\tvar a = pixels.data[(i+(canvasRef.width*j))*4+3];\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//If alpha is more than 0, create a particle at that position\\n\\t\\t\\t\\t\\tif(a>0 && Math.random()>0.996){\\n\\t\\t\\t\\t\\t\\tvar repulsion = true;\\n\\t\\t\\t\\t\\t\\tvar anchor = false;\\n\\t\\t\\t\\t\\t\\tvar isS = false;\\n\\t\\t\\t\\t\\t\\tvar c = 30;\\n\\t\\t\\t\\t\\t\\tvar sFactor = 0.06;\\n\\n\\t\\t\\t\\t\\t\\t//Test to see if the particle will be an anchor\\n\\t\\t\\t\\t\\t\\tif(Math.random()>0.85){\\n\\t\\t\\t\\t\\t\\t\\tanchor = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t//Test to see if the particle is gonna be a sprite\\n\\t\\t\\t\\t\\t\\telse if(Math.random()>0.45 && repulsion){\\n\\t\\t\\t\\t\\t\\t\\tisS = true;\\n\\t\\t\\t\\t\\t\\t\\tc = Math.random()*5+25;\\n\\t\\t\\t\\t\\t\\t\\tif(Math.random()>0.4){\\n\\t\\t\\t\\t\\t\\t\\t\\tsFactor = 0.03;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t//Add particle\\n\\t\\t\\t\\t\\t\\tparticles.push({\\n\\t\\t\\t\\t\\t\\t\\ttouchID:0,\\n\\t\\t\\t\\t\\t\\t\\tdist:0,\\n\\t\\t\\t\\t\\t\\t\\tposX:i,posY:j,\\n\\t\\t\\t\\t\\t\\t\\torX:i,orY:j,\\n\\t\\t\\t\\t\\t\\t\\tisAffected:false,\\n\\t\\t\\t\\t\\t\\t\\tisOut:false,\\n\\t\\t\\t\\t\\t\\t\\toutDest:Math.random()*15,\\n\\t\\t\\t\\t\\t\\t\\toutCount:0,\\n\\t\\t\\t\\t\\t\\t\\tcharge:c,\\n\\t\\t\\t\\t\\t\\t\\tscale:0,\\n\\t\\t\\t\\t\\t\\t\\tscaleFactor:sFactor,\\n\\t\\t\\t\\t\\t\\t\\tscaleNoise:Math.random(),\\n\\t\\t\\t\\t\\t\\t\\tscaleNoiseSpeed:Math.random()*0.005,\\n\\t\\t\\t\\t\\t\\t\\toffX:Math.random(),offY:Math.random(),\\n\\t\\t\\t\\t\\t\\t\\tnoiseAmount:Math.random()*10,\\n\\t\\t\\t\\t\\t\\t\\trandSpeed:Math.random()*0.01,\\n\\t\\t\\t\\t\\t\\t\\tangle : 0,\\n\\t\\t\\t\\t\\t\\t\\thasRepulsion : repulsion,\\n\\t\\t\\t\\t\\t\\t\\tisAnchor:anchor,\\n\\t\\t\\t\\t\\t\\t\\tsprite:sprites[Math.floor(Math.random()*sprites.length)],\\n\\t\\t\\t\\t\\t\\t\\tisSprite : isS,\\n\\t\\t\\t\\t\\t\\t\\tmag:Math.random()*40+300\\n\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t//$(window).mousemove(onWindowMouseMove);\\n\\t\\t\\tanimate();\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ee65534a0b41f77682c01d6cae5962b\",\n \"score\": \"0.6227803\",\n \"text\": \"function getParticlesAnimation() {\\n \\n //var particlesTimeline = new TimelineLite();\\n var particlesTimeline = new TimelineMax({ repeat: -1 });\\n var i = 200;\\n var radius = $( document ).width() * 0.5;\\n var centerX= $( document ).width() * 0.5;\\n var centerY = $( document ).height() * 0.5;\\n var dots = [];\\n var rawDots = [];\\n\\n while (--i > -1) {\\n var angle = Math.random() * Math.PI * 2;\\n var insertionTime = i * 0.015;\\n\\n dot = document.createElement('img');\\n dot.src = '/assets/images/dot.png';\\n dot.id = 'dot' + i;\\n dotContainer.append(dot);\\n dot.style.cssText = 'position:absolute; left:' + centerX + 'px; top:' + centerY + 'px; width:1px; height:1px;';\\n \\n \\n particlesTimeline.from(dot, 0.05, {opacity:0, immediateRender:true}, insertionTime);\\n \\n particlesTimeline.to(dot, .7, {left:Math.cos(angle) * radius + centerX, \\n top:Math.sin(angle) * radius + centerY, \\n width:22, \\n height:22,\\n //repeat: -1,\\n ease:Cubic.easeIn\\n }, insertionTime);\\n \\n }\\n return particlesTimeline;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3334f21d107ae5a405263bd25742e58b\",\n \"score\": \"0.6201238\",\n \"text\": \"createParticle() {\\n stroke('black');\\n \\n push();\\n translate(this.x-windowWidth/2,this.y-windowHeight/2);\\n if (dist(mouseX, mouseY, this.x, this.y) < 50) {\\n fill('black');\\n stroke('white');\\n rotateX(frameCount * 0.05);\\n rotateY(frameCount * 0.05);\\n box(this.r*2);\\n } else {\\n box(this.r);\\n }\\n pop();\\n\\n push();\\n translate(this.x-windowWidth/2,this.y-windowHeight/2);\\n if (dist(mouseX, mouseY, this.x, this.y) < 50) {\\n textAlign(CENTER, CENTER);\\n fill('black');\\n textSize(14 + this.r/2);\\n textFont(fontSans);\\n text(this.word,0,12);\\n }\\n pop();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"554c9e335793eb45e2be9a34ca651abc\",\n \"score\": \"0.6189754\",\n \"text\": \"function start_snowing(num_snowAmount, num_windSpeed, num_fallSpeed){\\n\\t//clear first (just incase)\\n\\tarr_snow_div = [];\\n\\tarr_snow_ids = [];\\n\\t//\\n\\tfor (var i = 0; i<num_snowAmount; ++i){\\n\\t\\t//\\n\\t\\tvar snow_flake = document.createElement(\\\"div\\\");\\n\\t\\tsnow_flake.id = \\\"_snow_flake_\\\" + String(i);\\n\\t\\tsnow_flake.className = \\\"snow\\\";\\n\\t\\t//snow.appendChild(snow_flake);\\n\\t\\t//images\\n\\t\\tsnow_flake.innerHTML = '<img src=' + str_snow_imagePath + arr_snow_images[Math.ceil(Math.random()*arr_snow_images.length)-1] + '>';\\n\\t\\tsnow_flake.style.position = 'absolute';\\n\\t\\tsnow_place_randomly(snow_flake);\\n\\t\\tsnow_flake.style.pointerEvents = \\\"none\\\";\\n\\t\\t//\\n\\t\\tdocument.getElementsByTagName(\\\"body\\\")[0].appendChild(snow_flake);\\n\\t\\tarr_snow_div.push(snow_flake);\\n\\t\\tinit_snow(snow_flake, i, num_windSpeed, num_fallSpeed);\\n\\t};\\n\\t//\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c87722251def645b50c4047600f6bf7\",\n \"score\": \"0.6183091\",\n \"text\": \"function makeParticles() {\\n $.getJSON('data.json', function(data) {\\n //WLF\\n drawPoints(data.WLFX, data.WLFY, data.WLFZ, 'rgb(255,255,255,150)');\\n\\n //WRFX\\n drawPoints(data.WRFX, data.WRFY, data.WRFZ, 'rgb(255,255,0)');\\n\\n //DAN waistLBack\\n drawPoints(data.WLBX, data.WLBY, data.WLBZ, 'rgb(0,255,0)');\\n\\n //DAN waistRBack\\n drawPoints(data.WRBX, data.WRBY, data.WRBZ, 'rgb(0,0,255)');\\n\\n //DAN BackTOP\\n drawPoints(data.BTX, data.BTY, data.BTZ, 'rgb(0,255,255)');\\n\\n //DAN CHEST\\n drawPoints(data.CX, data.CY, data.CZ, 'rgb(100,100,255)');\\n\\n //DAN BACK LEFT\\n drawPoints(data.BLX, data.BLY, data.BLZ, 'rgb(255,100,100)');\\n\\n //DAN BACK RIGHT\\n drawPoints(data.BRX, data.BRY, data.BRZ, 'rgb(155,100,0)');\\n\\n //DAN head top\\n drawPoints(data.HTX, data.HTY, data.HTZ, 'rgb(200,80,190)');\\n\\n //DAN head FRONT\\n drawPoints(data.HFX, data.HFY, data.HFZ, 'rgb(190,180,130)');\\n\\n //DAN LFET SHOULDER BACK\\n drawPoints(data.LSBX, data.LSBY, data.LSBZ, 'rgb(200,185,195)');\\n\\n //DAN LFET SHOULDER TOP\\n drawPoints(data.LSTX, data.LSTY, data.LSTZ, 'rgb(200,100,130)');\\n\\n //DAN Left Elbow Out\\n drawPoints(data.LEOX, data.LEOY, data.LEOZ, 'rgb(10,190,255)');\\n\\n //Dan:LUArmHigh\\n drawPoints(data.LUAHX, data.LUAHY, data.LUAHZ, 'rgb(10, 90, 55)');\\n\\n //Dan:RShoulderBack\\n drawPoints(data.RSBX, data.RSBY, data.RSBZ, 'rgb(200, 130, 55)');\\n\\n //Dan:RShoulderTop\\n\\n drawPoints(data.RSTX, data.RSTY, data.RSTZ, 'rgb(35, 201, 186,150)');\\n //Dan:RElbowOut\\n\\n drawPoints(data.REOX, data.REOY, data.REOZ, 'rgb(245, 55, 127,150)');\\n //Dan:RUArmHigh\\n drawPoints(data.RUAHX, data.RUAHY, data.RUAHZ, 'rgb(255, 131, 0,150)');\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d03f7343c7018673e1ff7bc9f2b8cf05\",\n \"score\": \"0.6177895\",\n \"text\": \"function drawDraggableParticles() {\\n for (var i = 0; i < particles.length; i++) {\\n var p = particles[i];\\n drawParticle(p.x, p.y, p.radius, 2, p.fill, \\\"#000000\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bee61c4320ecb5f5c9925bbabf4888e\",\n \"score\": \"0.6130625\",\n \"text\": \"function init() {\\n particleArray = [];\\n for (let i=0; i < 100; i++) { // change the amount of particles.\\n let size = Math.random() * 20; // change this value to alter particle size.\\n let x = Math.random() * (innerWidth - size * 2);\\n let y = Math.random() * (innerHeight - size * 2);\\n let directionX = (Math.random() * .4) - .2; // these values adjust the X direction\\n let directionY = (Math.random() * .4) - .2; // these values adjust the Y direction\\n let color = 'white'; // change this value to affect particle colour.\\n\\n particleArray.push(new Particle(x, y, directionX, directionY, size, color));\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2876107a6a6ac26de049aeb6a2af1352\",\n \"score\": \"0.61256367\",\n \"text\": \"createParticle() {\\n noStroke();\\n fill('darkorange');\\n circle(this.x,this.y,this.d);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43fe0ecf9e481ab031bd97884713f011\",\n \"score\": \"0.6121046\",\n \"text\": \"createParticle() {\\n noStroke();\\n this.blue = random(0,155)\\n circle(this.x,this.y,this.r);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6282dee375f774b58dd70c352b0e2328\",\n \"score\": \"0.6116509\",\n \"text\": \"createParticle() {\\n noStroke();\\n fill('rgba(200, 169, 169, 0.5)');\\n circle(this.x, this.y, this.r);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4aedc6dd39f8a49dc30475cbc3564db0\",\n \"score\": \"0.60936356\",\n \"text\": \"function initFluidParticles() {\\n var $particlsA = $(\\\"#particles\\\");\\n if ($particlsA.length) {\\n $particlsA.particleground({\\n minSpeedX: 0.6,\\n minSpeedY: 0.6,\\n dotColor: '#ffffff',\\n lineColor: '#ffffff',\\n density: 6000,\\n particleRadius: 2, // curvedLines: true,\\n parallaxMultiplier: 5.2,\\n proximity: 0\\n });\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bff53e1b7770b90f743e1314589348e8\",\n \"score\": \"0.6092107\",\n \"text\": \"function pebbles()\\n{\\n\\tvar j = 0;\\n\\n\\tfor (var i = 0; i < 9; i++) {\\n\\t\\tvar geo = new THREE.SphereGeometry(0.5); //width, height, depth,\\n\\t\\tvar mat = new Physijs.createMaterial(new THREE.MeshBasicMaterial({ color: 'ffffff' }), .95, .95);\\n\\t\\tvar msh = new Physijs.BoxMesh(geo, mat);\\n\\t\\tvar msh2 = new Physijs.BoxMesh(geo, mat);\\n\\n\\t\\tmsh.position.x = i * 5; msh.position.y = -1; msh.position.z += j; \\n\\t\\tmsh2.position.x = -i * 5; msh2.position.y = -1; msh2.position.z += -j;\\n\\n\\t\\tscene.add(msh);\\n\\t\\tscene.add(msh2);\\n\\n\\t\\tj++;\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28d2ee14c14b60d3aadc2a2861b01ae9\",\n \"score\": \"0.60845125\",\n \"text\": \"seed() {\\n const { height, width } = this;\\n let count = 40;\\n\\n if (bowser.mobile) {\\n count = 30;\\n } else if (lowEnd) {\\n count = 100;\\n }\\n\\n for (let i = 0; i < count; i += 1) {\\n this.addEntity(new Particle(width, height, lowEnd));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4770ef35c22dc3687c9597362bcfdb5f\",\n \"score\": \"0.60837835\",\n \"text\": \"_blockBreakParticles(blok){\\n\\t\\tvar bpos = new vec2(blok.col.position.x + blok.col.size.x / 2, blok.col.position.y + blok.col.size.y / 2);\\n\\t\\tvar s = 6;\\n\\t\\tfor(var i = 4; i > 0; i--){ //right\\n\\t\\t\\tvar p = new seekerParticle(bpos.x, bpos.y + Math.random() * tilesize - tilesize / 2, \\\"#333\\\", p1);\\n\\t\\t\\tp.vel = new vec2(Math.random() * s, 0);\\n\\t\\t\\tp.pos = p.pos.plus(p.vel.multiply(2));\\n\\t\\t\\tparticles.push(p);\\n\\t\\t\\tp.seekspeed = 2;\\n\\t\\t}\\n\\t\\tfor(var i = 4; i > 0; i--){ //left\\n\\t\\t\\tvar p = new seekerParticle(bpos.x, bpos.y + Math.random() * tilesize - tilesize / 2, \\\"#333\\\", p1);\\n\\t\\t\\tp.vel = new vec2(Math.random() * -s, 0);\\n\\t\\t\\tp.pos = p.pos.plus(p.vel.multiply(2));\\n\\t\\t\\tparticles.push(p);\\n\\t\\t\\tp.seekspeed = 2;\\n\\t\\t}\\n\\t\\tfor(var i = 4; i > 0; i--){ //down\\n\\t\\t\\tvar p = new seekerParticle(bpos.x + Math.random() * tilesize - tilesize / 2, bpos.y, \\\"#333\\\", p1);\\n\\t\\t\\tp.vel = new vec2(0, Math.random() * s);\\n\\t\\t\\tp.pos = p.pos.plus(p.vel.multiply(2));\\n\\t\\t\\tparticles.push(p);\\n\\t\\t\\tp.seekspeed = 2;\\n\\t\\t}\\n\\t\\tfor(var i = 4; i > 0; i--){ //up\\n\\t\\t\\tvar p = new seekerParticle(bpos.x + Math.random() * tilesize - tilesize / 2, bpos.y, \\\"#333\\\", p1);\\n\\t\\t\\tp.vel = new vec2(0, Math.random() * -s);\\n\\t\\t\\tp.pos = p.pos.plus(p.vel.multiply(2));\\n\\t\\t\\tparticles.push(p);\\n\\t\\t\\tp.seekspeed = 2;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f8288ab2b309e6361ec0ce3181f2ead\",\n \"score\": \"0.60467905\",\n \"text\": \"function setup() {\\n noFill();\\n\\n // Defines the simulator's layout as well as \\\"canWidth\\\", \\\"canHeight\\\"\\n makeLayout();\\n\\n var topLeft = new Point( 0, 0 );\\n var topRight = new Point( canWidth, 0 );\\n var botRight = new Point( canWidth, canHeight/2-thickness );\\n var botLeft = new Point( 0, ( canHeight/2-thickness ) );\\n\\n //Relative to parent coordinate\\n\\n containers[\\\"outside\\\"] = new Container(topLeft, topRight, botRight, botLeft, containerProperties[\\\"outside\\\"][\\\"color\\\"],\\\"outside\\\");\\n //containers[\\\"outside\\\"].draw();\\n\\n\\n var topLeft = new Point( 0, 0 );\\n var topRight = new Point( canWidth, 0 );\\n var botRight = new Point( canWidth, canHeight/2 );\\n var botLeft = new Point( 0, canHeight/2 );\\n UIBoxs[0] = new UIBox( topLeft, topRight, botRight, botLeft );\\n UIBoxs[0].draw();\\n\\n var topLeft = new Point( 0, canHeight/2+thickness );\\n var topRight = new Point( canWidth, canHeight/2+thickness );\\n var botRight = new Point( canWidth, canHeight );\\n var botLeft = new Point( 0, canHeight );\\n\\n containers[\\\"inside\\\"] = new Container(topLeft, topRight, botRight, botLeft, containerProperties[\\\"inside\\\"][\\\"color\\\"],\\\"inside\\\");\\n //containers[\\\"inside\\\"].draw();\\n\\n var topLeft = new Point( 0, canHeight/2 );\\n var topRight = new Point( canWidth, canHeight/2 );\\n var botRight = new Point( canWidth, canHeight );\\n var botLeft = new Point( 0, canHeight );\\n UIBoxs[1] = new UIBox( topLeft, topRight, botRight, botLeft );\\n UIBoxs[1].draw();\\n\\n for (var location in particles) {\\n for (var particle in particles[location]) {\\n xRange = containers[location].tr.x - containers[location].tl.x - 100;\\n yRange = containers[location].br.y - containers[location].tr.y - 100;\\n var amount = particlesProperties[particle][location];\\n for (var i=0; i<amount; i++) {\\n velocities = velocityRange;\\n var x_vel = Math.floor(Math.random() * (velocities.length-1)) + 0;\\n var y_vel = Math.floor(Math.random() * (velocities.length-1)) + 0;\\n var velocity = createVector(velocities[x_vel],velocities[y_vel]);\\n // Get random location\\n randomX = containers[location].tl.x + particlesProperties[particle][\\\"radius\\\"] + (Math.floor(Math.random() * xRange));\\n randomY = containers[location].tl.y + particlesProperties[particle][\\\"radius\\\"] + (Math.floor(Math.random() * yRange));\\n particles[location][particle].push(new factory[particle](randomX,randomY,particlesProperties[particle][\\\"radius\\\"],velocity, true));\\n }\\n }\\n }\\n makeUIs();\\n GHKFormula()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"506d8919ceaa96f8a4786ca5ae1937db\",\n \"score\": \"0.6042969\",\n \"text\": \"function setup() {\\r\\n createCanvas(canvasWidth, canvasHeight)\\r\\n background(black)\\r\\n\\r\\n // Repeat the following sets 10 times\\r\\n // - Create a new partile in the center of the screen\\r\\n // - Add it to the list\\r\\n for (let i = 0; i < 10; i = i + 1) {\\r\\n let newParticle = new Particle(centerX, centerY)\\r\\n particles.push(newParticle)\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"031d56b3401d22c92e86e394c6a6cec2\",\n \"score\": \"0.6042398\",\n \"text\": \"function setup() {\\n createCanvas(window.innerWidth, window.innerHeight);\\n\\n const count = Math.floor(window.innerWidth / 8);\\n for (let i = 0; i < count; i++) {\\n particles.push(new Particle());\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75fc3ff83ee6622f459df1581c84b0ce\",\n \"score\": \"0.6041845\",\n \"text\": \"function init(){\\n particleArray = [];\\n\\n for(let y=0 , y2 = textCoordinates.height; y < y2; y++){\\n for(let x = 0, x2 = textCoordinates.width; x< x2 ; x++){\\n if(textCoordinates.data[(y * 4 * textCoordinates.width) + (x * 4) + 4] > 128){\\n let positionX = x + adjustX;\\n let positionY = y + adjustY;\\n particleArray.push(new Particle(positionX * 2.2 ,positionY *2.2));\\n }\\n }\\n }\\n /*for(let i = 0; i < 500; i++){\\n let x = Math.random() * canvas.width;\\n let y = Math.random() * canvas.height;\\n particleArray.push(new Particle(x , y));\\n }\\n //particleArray = [];\\n //particleArray.push(new Particles(50, 50));*/\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37c110ec269d23f26c427653a6042ddb\",\n \"score\": \"0.6028897\",\n \"text\": \"function createExplosion(x, y, color, text)\\n\\t{\\n\\t\\tvar count = 8;\\n\\t\\t\\n\\t\\tfor (var i=0; i<count; i++)\\n\\t\\t{\\n var angle = i*360/count;\\n\\t\\t\\tvar particle = new Particle();\\n\\t\\t\\t\\n\\t\\t\\tparticle.x = x;\\n\\t\\t\\tparticle.y = y;\\n\\t\\t\\t\\n // size of particle\\n\\t\\t\\tparticle.radius = 5;\\n\\t\\t\\t\\n\\t\\t\\tparticle.color = color;\\n\\t\\t\\t\\n // life time, the higher the value the faster particle \\n // will die\\n\\t\\t\\tparticle.scaleSpeed = 1.5;//randomFloat(0.3, 0.5);\\n \\n // use gravity\\n particle.useGravity = false;\\n\\t\\t\\t\\n\\t\\t\\tvar speed = 100;\\n\\t\\t\\t\\n\\t\\t\\tparticle.velocityX = speed * Math.cos(angle * Math.PI / 180.0);\\n\\t\\t\\tparticle.velocityY = speed * Math.sin(angle * Math.PI / 180.0);\\n\\t\\t\\t\\n\\t\\t\\tparticles.push(particle);\\n\\t\\t}\\n\\t\\t// text 'particle'\\n\\t\\t// because it was easier than creating a whole new system ;)\\n \\tvar ptext = new Particle();\\n\\t\\tptext.x = x;\\n\\t\\tptext.y = y;\\n\\t\\tptext.color = color;\\n\\t\\tptext.text = text;\\n\\t\\tptext.velocityX = 0;\\n\\t\\tptext.velocityY = -50;\\n\\t\\tptext.scaleSpeed = 1.5;\\n\\t\\tptext.useGravity = false;\\n\\t\\tparticles.push(ptext);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"150368fc5770b46d79268c431572d22b\",\n \"score\": \"0.60280496\",\n \"text\": \"constructor(direz,nPf,x,y,dim,rx1,ry1,rx2,ry2,dx,dy) {\\n this.direz = direz || 1;\\n \\tthis.particles = [];\\n \\tthis.nPf = nPf || 2;\\n this.x = x || width/2;\\n this.y = y || height-100;\\n this.dim = dim || 4;\\n this.rx1 = rx1 || -5 * this.direz;\\n this.rx2 = rx2 || -1 * this.direz;\\n this.ry1 = ry1 || 0.2 * this.direz;\\n this.ry2 = ry2 || -0.2 * this.direz;\\n this.s = this.dim * 2 * this.direz;\\n // this.dx = dx || this.dim / 5 * this.direz; // per creare prospettiva con diverse dim\\n this.dx = dx || width / 60 * this.direz; // per creare prospettiva con diverse dim\\n // this.dx = dx || random(1); // per sfalsare\\n // this.dx = dx || 1; // tutti uguali\\n // this.dx = dx || 0; // tutti fremi\\n this.dy = dy || 0;\\n this.sparabile = true;\\n this.sparato = false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3a05452c405b632755fabec49ce22eb\",\n \"score\": \"0.60123444\",\n \"text\": \"function init() {\\n particlesArray = [];\\n\\n //let the number of particles existing be dependent on the canvas dimensions. \\n let numberOfParticles = (canvas.height * canvas.width) / 9000;\\n\\n //create the individual particles, randomly assign their properties, and push\\n //them into the particles array.\\n \\n for (let i = 0; i < numberOfParticles; i++) {\\n\\n //VARIABLE ME FOR CLASS\\n // let size = (Math.random() * 0.1) + 0.8;\\n let size = 0;\\n\\n\\n let x = (Math.random() * ((innerWidth - size * 2) - (size * 2)) + size * 2);\\n let y = (Math.random() * ((innerHeight - size * 2) - (size * 2)) + size * 2);\\n \\n //VARIABLE ME (multipliers here dictate the velocity around the canvas)\\n let directionX = (Math.random() * 0.25);\\n let directionY = (Math.random() * 0.7);\\n let color = '#ECFDFD';\\n\\n particlesArray.push(new Particle(x, y, directionX, directionY, size, color));\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9adf1e801f5beb9b13b9c9d19e0d8ea6\",\n \"score\": \"0.600142\",\n \"text\": \"function createSimultaneousParticles(disObj) {\\r\\n\\t let dimensions = getVisibleDimensions(disObj.elem, disObj.container);\\r\\n\\t let pos = dimensions.boundingRect;\\r\\n\\t\\r\\n\\t let screenshotData = getAllImageData(disObj);\\r\\n\\t\\r\\n\\t disObj.particleArr[0] = {\\r\\n\\t \\\"startTime\\\": Date.now(),\\r\\n\\t \\\"myParticles\\\": []\\r\\n\\t };\\r\\n\\t\\r\\n\\t // Process the pixels\\r\\n\\t if(screenshotData) {\\r\\n\\t for(let i = 0; i < screenshotData.length; i += 4) {\\r\\n\\t // Do it every once in a while\\r\\n\\t if(disObj.count % disObj.particleReductionFactor === 0) {\\r\\n\\t let worldX = pos.left + (i / 4) % dimensions.width;\\r\\n\\t let worldY = pos.top + Math.floor((i / 4) / dimensions.width);\\r\\n\\t\\r\\n\\t let colorData;\\r\\n\\t if(disObj.particleColor.length > 0) {\\r\\n\\t colorData = disObj.particleColor;\\r\\n\\t } else {\\r\\n\\t colorData = screenshotData.slice(i, i + 4);\\r\\n\\t }\\r\\n\\t\\r\\n\\t // Create a particle of the given pixel color at the given location\\r\\n\\t createParticle(disObj, worldX - pos.left, worldY - pos.top, worldX, worldY, colorData, 0);\\r\\n\\t }\\r\\n\\t disObj.count++;\\r\\n\\t }\\r\\n\\t } \\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a12bf86cea562efd4494eb99f5010fdf\",\n \"score\": \"0.59919983\",\n \"text\": \"static function OnCreatePlaygroundParticles (playgroundParticles : PlaygroundParticles) {\\n\\t\\tplaygroundParticles.playgroundCache = new PlaygroundCache();\\n\\t\\tplaygroundParticles.paint = new PaintObject();\\n\\t\\tplaygroundParticles.states = new List.<ParticleState>();\\n\\t\\tplaygroundParticles.colliders = new List.<PlaygroundCollider>();\\n\\t\\tplaygroundParticles.particleSystemId = Playground.particlesQuantity;\\n\\t\\t\\n\\t\\tplaygroundParticles.playgroundCache.size = new float[playgroundParticles.particleCount];\\n\\t\\tplaygroundParticles.playgroundCache.size = Playground.RandomFloat(playgroundParticles.playgroundCache.size.Length, playgroundParticles.sizeMin, playgroundParticles.sizeMax);\\n\\t\\t\\n\\t\\tplaygroundParticles.previousParticleCount = playgroundParticles.particleCount;\\n\\t\\tplaygroundParticles.lifetimeSize = new AnimationCurve(Keyframe(0,1), Keyframe(1,1));\\n\\t\\t\\n\\t\\tplaygroundParticles.shurikenParticleSystem.Emit(playgroundParticles.particleCount);\\n\\t\\tplaygroundParticles.shurikenParticleSystem.GetParticles(playgroundParticles.particleCache.particles);\\n\\t\\tfor (var p = 0; p<playgroundParticles.particleCache.particles.Length; p++) {\\n\\t\\t\\tplaygroundParticles.particleCache.particles[p].size = playgroundParticles.playgroundCache.size[p];\\n\\t\\t}\\n\\t\\t\\n\\t\\tPlaygroundParticles.SetParticleCount(playgroundParticles, playgroundParticles.particleCount);\\n\\t\\t\\n\\t\\tif (Playground.reference!=null) {\\n\\t\\t\\tPlayground.particlesQuantity++;\\n\\t\\t\\tPlayground.reference.particleSystems.Add(playgroundParticles);\\n\\t\\t\\tplaygroundParticles.particleSystemId = Playground.particlesQuantity;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"088615c4f1293b9b7054b2835d6a6022\",\n \"score\": \"0.5973614\",\n \"text\": \"function init_snow(canvas, width, height)\\n{\\n\\n\\tsnow_buffer = document.createElement('canvas');\\n\\tsnow_buffer.width = width;\\n\\tsnow_buffer.height = height;\\n\\tctx = snow_buffer.getContext(\\\"2d\\\");\\n\\n\\tfor (var i = 0; i < flakeCount; i++)\\n\\t{\\n\\t\\tvar x = Math.floor(Math.random() * snow_buffer.width);\\n\\t\\tvar y = Math.floor(Math.random() * snow_buffer.height);\\n\\t\\tvar size = (Math.random() * 3) + 2;\\n\\t\\tvar speed = (Math.random() * 1) + 0.5;\\n\\t\\tvar opacity = (Math.random() * 0.5) + 0.3;\\n\\n\\t\\tflakes.push(\\n\\t\\t{\\n\\t\\t\\tspeed : speed,\\n\\t\\t\\tvelY : speed,\\n\\t\\t\\tvelX : 0,\\n\\t\\t\\tx : x,\\n\\t\\t\\ty : y,\\n\\t\\t\\tsize : size,\\n\\t\\t\\tstepSize : (Math.random()) / 30,\\n\\t\\t\\tstep : 0,\\n\\t\\t\\tangle : 180,\\n\\t\\t\\topacity : opacity\\n\\t\\t});\\n\\t}\\n\\n\\tsnow();\\n\\n\\tcanvas.addEventListener(\\\"mousemove\\\", function(e)\\n\\t{\\n\\t\\tvar main_canvas = document.getElementById('the_canvas');\\n\\t\\tvar rect = main_canvas.getBoundingClientRect();\\n\\n\\t\\tmX = e.clientX - rect.left;\\n\\t\\tmY = e.clientY - rect.top;\\n\\t});\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3cf55e3dc1a03995d6c74faa32ad1c2d\",\n \"score\": \"0.5971006\",\n \"text\": \"function snowAnimation(volume) {\\n $(\\\"#snow\\\").empty();\\n while (volume > 0) {\\n let left = Math.floor(Math.random() * 9) * 10;\\n let top = Math.floor(Math.random() * 3) * 10 - 20;\\n let src =\\n Math.floor(Math.random() * 2) == 1\\n ? \\\"src/assets/snowFlake.png\\\"\\n : \\\"src/assets/snowFlake2.png\\\";\\n $(\\\"#snow\\\").append(\\n $(\\\"<img>\\\", { src: src, width: \\\"5%\\\" })\\n .css({ top: top + \\\"%\\\", left: left + \\\"%\\\", position: \\\"absolute\\\" })\\n .animate(\\n {\\n top: \\\"100%\\\"\\n },\\n (100 / 9.8) * 1000\\n )\\n );\\n volume--;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8dd963cbafb89b50edfd89e83dd0a567\",\n \"score\": \"0.59643394\",\n \"text\": \"function globes() {\\n for (i=0;i<20;i++) {\\n particles[i] = new Particle(random(840),random(280,560), \\n random(1,4));\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"458c41fdb8a01d5bb9607a1844624d98\",\n \"score\": \"0.5962007\",\n \"text\": \"function drawParticles()\\n {\\n // Render each particle in the particle array\\n for(var i = 0; i < particles.length; i++)\\n {\\n var particle = particles[i];\\n canvasContext.beginPath();\\n //applies the colour to the fillStyle\\n canvasContext.fillStyle = particle.color;\\n //creates the arc to be drawn as the particle to the screen\\n canvasContext.arc(particle.x, particle.y, particle.radius, Math.PI*2, false);\\n //draws the particle to the canvas\\n canvasContext.fill();\\n //resets the canvas fill style to stop the colour from applying to the text\\n canvasContext.fillStyle = \\\"rgba(0,0,0,1)\\\";\\n //applies physics to the particles\\n f(particle);\\n bounce(particle);\\n speedCap(particle, 1);\\n particle.x += particle.vx;\\n particle.y += particle.vy;\\n //counts down the death timer of each particle and removes it if it goes below 0\\n particle.lifeSpan -= 10;\\n if(particle.lifeSpan < 0)\\n {\\n particles.splice(i,1);\\n }\\n\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2feed256d35448ce387fdb41622f167d\",\n \"score\": \"0.5952231\",\n \"text\": \"function Animate() {\\n\\n var canvas;\\n var context;\\n\\n var width;\\n var height;\\n\\n var oX;\\n var oY;\\n\\n var v = 2;\\n var obj_max = 10;\\n\\n var max = 20;\\n var amax = 0;\\n\\n var firstParticle;\\n\\n var interval;\\n\\n this.initialize = function() {\\n canvas = document.getElementById(\\\"canvas\\\");\\n context = canvas.getContext('2d');\\n\\n width = document.getElementById('contentBody').offsetWidth\\n if(width<=480)\\n height = 2154\\n else{\\n height = document.getElementById('content').offsetHeight\\n }\\n\\n oX = width / 2;\\n oY = 0;\\n\\n canvas.width = width;\\n canvas.height = height;\\n\\n createParticles();\\n\\n window.addEventListener('resize', resizeWindow, false);\\n\\n //Set interval - Bad! - I know!\\n var interval = setInterval(Update, 16);\\n }\\n\\n var createParticles = function() {\\n\\n var sr = 200;\\n var vr = 0.5;\\n\\n firstParticle = new Particle();\\n var p = firstParticle;\\n\\n //Detect browser, get pixels for vertical radius of particle changes\\n var browser;\\n\\n var browserDetect = function() {\\n if (bowser.msie) {\\n browser = 80\\n } else if (bowser.msedge) {\\n browser = 80\\n } else if (bowser.android) {\\n browser = 20\\n } else if (bowser.ios) {\\n browser = 20\\n } else if (bowser.chrome) {\\n browser = 60\\n } else if (bowser.opera) {\\n browser = 200\\n } else if (bowser.safari) {\\n browser = 100\\n } else {\\n browser = 40\\n } \\n }\\n\\n browserDetect();\\n\\n //Detect operating system, get pixels for starting radius of particles\\n var userOS;\\n\\n var osDetect = function() {\\n if (bowser.mac) {\\n userOS = 20\\n } else if (bowser.windows) {\\n userOS = 60\\n } else if (bowser.windowsphone) {\\n userOS = 40\\n } else if (bowser.linux) {\\n userOS = 100\\n } else if (bowser.chromeos) {\\n userOS = 80\\n } else if (bowser.android) {\\n userOS = 50\\n } else if (bowser.ios) {\\n userOS = 30\\n } else {\\n userOS = 70\\n } \\n }\\n\\n osDetect();\\n\\n var i;\\n for (i = 0; i < max; i++) {\\n p.ang = i * max;\\n p.vang = 1;\\n p.r = userOS;\\n //vr is vertical radius of particles\\n p.vr = browser;\\n p.x = oX;\\n p.y = oY;\\n\\n if (i != max - 1) {\\n p.next = new Particle();\\n p = p.next;\\n }\\n }\\n }\\n\\n //Point class.\\n var Particle = function() {\\n this.ang;\\n this.vang;\\n this.r;\\n this.vr;\\n this.x;\\n this.y;\\n this.next; //Child\\n }\\n\\n var Update = function() {\\n\\n var count = 0;\\n var p = firstParticle;\\n\\n while (p) {\\n count++;\\n\\n if (p.r > 4000) {\\n\\n p = p.next;\\n continue;\\n\\n }\\n\\n var ran = Math.random();\\n\\n if (ran < 0.2) {\\n\\n p.vang = 0;\\n p.vr = v;\\n\\n } else if (ran < 0.4) {\\n\\n p.vang = -v;\\n p.vr = 0;\\n\\n } else if (ran < 0.07) {\\n\\n p.vang = v;\\n p.vr = 0;\\n\\n } else if (ran < 0.09 && amax < obj_max) {\\n var newP = new Particle();\\n newP.ang = p.ang;\\n\\n if (p.ang == 0) {\\n newP.vang = 0;\\n } else {\\n newP.vang = (Math.random() < 50) ? -1 : 1;\\n }\\n\\n newP.r = p.r;\\n\\n if (p.vang == 0) {\\n\\n newP.vr = 100;\\n } else {\\n\\n newP.vr = 0;\\n }\\n\\n newP.x = p.x;\\n newP.y = p.y;\\n\\n newP.next = p.next;\\n p.next = newP;\\n\\n }\\n\\n var r = p.ang + p.vang;\\n p.r = p.r + p.vr;\\n\\n var ang = Math.PI / 120 * r;\\n\\n var ax = p.r * Math.cos(ang);\\n //console.log(ax);\\n var ay = p.r * Math.sin(ang);\\n\\n var rr = Math.sqrt(ax * ax + ay * ay);\\n\\n var anga = Math.PI / 120 * (r - (r - p.ang) / 2);\\n\\n var px = rr * Math.cos(anga);\\n var py = rr * Math.sin(anga);\\n\\n\\n //Get date, convert to 12hr, and bind to variable \\\"colour\\\", then initialize\\n var d = new Date();\\n var hour = d.getHours() / 2;\\n var colour;\\n\\n var randomColour = function() {\\n if (hour <2) {\\n colour = \\\"224, 42, 55,\\\"\\n } else if (hour <4) {\\n colour = \\\"0, 32, 51,\\\"\\n } else if (hour <6) {\\n colour = \\\"212, 218, 224,\\\"\\n } else if (hour <8) {\\n colour = \\\"224, 42, 55,\\\"\\n } else if (hour <10) {\\n colour = \\\"0, 32, 51,\\\"\\n } else {\\n colour = \\\"212, 218, 224,\\\"\\n } \\n }\\n randomColour();\\n //Start drawing\\n\\n context.beginPath();\\n context.strokeStyle = 'rgba(' + colour + '0.1)';\\n context.moveTo(p.x, p.y);\\n context.quadraticCurveTo(px + oX, py + oY, ax + oX, ay + oY);\\n context.stroke();\\n context.closePath();\\n\\n if (p.r > 20) {\\n context.beginPath();\\n context.fillStyle = 'rgba(' + colour + '0.5)';\\n context.arc(px + oX, py + oY, 1, 0, 2*Math.PI, false);\\n context.fill();\\n context.closePath();\\n }\\n p.x = ax + oX;\\n p.y = ay + oY;\\n p.ang = r;\\n p = p.next;\\n\\n }\\n amax = count;\\n\\n }\\n\\n //Clear the screen on window resize \\n var resizeWindow = function(e) {\\n e.preventDefault();\\n context.fillStyle = 'rgba(247, 251, 254, 1.0)';\\n context.beginPath();\\n context.rect(0, 0, width, height);\\n context.closePath();\\n context.fill(); \\n width = document.getElementById('contentBody').offsetWidth\\n if(width<=480)\\n height = 2154\\n else{\\n height = document.getElementById('content').offsetHeight\\n }\\n canvas.width = width;\\n canvas.height = height;\\n\\n oX = width / 2;\\n oY = 0;\\n //Restart!\\n createParticles();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f23f4d2d01dafd995aff4af74a00bab\",\n \"score\": \"0.59503627\",\n \"text\": \"function initParticles() {\\n var scene = threeLayer.getScene();\\n var loader = new THREE.TextureLoader();\\n\\n particleGroup = new SPE.Group({\\n type: SPE.distributions.SPHERE,\\n texture: {\\n value: loader.load('../textures/cloud.png')\\n },\\n blending: THREE.NormalBlending,\\n maxParticleCount: 5000,\\n scale: 200000,\\n fog: false\\n });\\n\\n emitter = new SPE.Emitter({\\n particleCount: 100,\\n maxAge: {\\n value: 10,\\n },\\n position: {\\n value: new THREE.Vector3(0, 0, 0),\\n spread: new THREE.Vector3(1500, 0, 0),\\n distribution: SPE.distributions.SPHERE,\\n radiusScale: new THREE.Vector3(1, 1, 0),\\n randomise: true\\n },\\n direction: -1,\\n size: {\\n value: 80\\n },\\n opacity: {\\n value: [0, 0.5, 0.2]\\n },\\n color: {\\n value: new THREE.Color(1, 1, 1),\\n spread: new THREE.Color(0.1, 0.1, 0.1)\\n }\\n });\\n\\n particleGroup.addEmitter(emitter);\\n\\n particleGroup.mesh.position.set(-27589453.947005168, -16645787.262404276, 0);\\n\\n scene.add(particleGroup.mesh);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f3a3c79fe4dd87dca1b80959b1177d2\",\n \"score\": \"0.5934297\",\n \"text\": \"_spawnParticles (x, y) {\\n // const { colors } = this.props;\\n const length = this._particles.length;\\n const colors = this.props.wowMode\\n ? values(this.props.colors).map(toHex)\\n : [toHex(this.props.cursorColor)];\\n const numParticles = PARTICLE_NUM_RANGE();\\n for (let i = 0; i < numParticles; i++) {\\n const colorCode = colors[i % colors.length];\\n const r = parseInt(colorCode.slice(1, 3), 16);\\n const g = parseInt(colorCode.slice(3, 5), 16);\\n const b = parseInt(colorCode.slice(5, 7), 16);\\n const color = [r, g, b];\\n this._particles.push(this._createParticle(x, y, color));\\n }\\n if (length === 0) {\\n window.requestAnimationFrame(this._drawFrame);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d74731d05fc8bf51f6252b182cc66e2\",\n \"score\": \"0.5932026\",\n \"text\": \"function generateConfetti() {\\n const container = document.createElement('div');\\n container.setAttribute('id', 'pinataConfettiContainer');\\n container.style.position = 'absolute';\\n container.style.top = \\\"0\\\";\\n container.style.left = \\\"0\\\";\\n for (let i = 0; i < 400; i++) {\\n let t = 1 + .01*rand(0, 100);\\n // Creating the confetti as the specified element type\\n const element = document.createElement('div');\\n\\n element.setAttribute(\\\"class\\\", 'particle');\\n element.style.transform = \\\"translate(\\\" + rand(0, 100) + \\\"vw, \\\" + rand(0, 100) + \\\"vh)\\\";\\n element.style.background = \\\"hsl(\\\" + rand(0, 360) + \\\", 100%, 65%)\\\";\\n element.style.animationDuration = t + \\\"s\\\";\\n element.style.animationDelay = -0.1*rand(0, 100)*t + \\\"s\\\";\\n // Inserts the confetti into the container\\n container.appendChild(element);\\n }\\n\\n document.getElementById(pinataModalBoxId).appendChild(container);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13083e2a1447c85bbda346119d8e4e5a\",\n \"score\": \"0.59289396\",\n \"text\": \"function Snow() {\\n\\t\\tthis.canvas = document.createElement('canvas');\\n\\t\\tthis.canvas.id = 'snow';\\n\\t\\tthis.canvas.className = 'background';\\n\\t\\tthis.canvas.style.background = defaultBgColor;\\n\\t\\tdocument.body.insertBefore(this.canvas, document.body.firstElementChild);\\n\\n\\t\\tthis.flakes = [];\\n\\t\\tthis.ctx = this.canvas.getContext('2d');\\n\\t\\tthis.flakeCount = 300;\\n\\t\\tthis.mX = -100,\\n\\t\\tthis.mY = -100\\n\\n\\t\\tthis.width = this.canvas.width = window.innerWidth;\\n\\t\\tthis.height = this.canvas.height = window.innerHeight;\\n\\n\\t\\tthis._init1();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c941e89f82c58d2f32a34c436ea0f9ae\",\n \"score\": \"0.5920191\",\n \"text\": \"initialize() {\\n const pw = this.imageWidth || 30;\\n const ph = this.imageHeight || 30;\\n for (let i = 0; i < this.num; ++i) {\\n this._particles.push(new FanfareParticle({\\n /* Start anywhere along the bottom of the screen */\\n xmin: 0,\\n xmax: this._host.width - pw,\\n ymin: this._host.height - ph - 60,\\n ymax: this._host.height - ph,\\n /* Ease through [0, 1, 0, -1, 0] over 80 ticks; using a random starting\\n * location through the ease */\\n dxFunc: function(t, dx) {\\n return 4 * Math.sin((t % 80) / 80 * 2 * Math.PI + this.seed);\\n },\\n /* Particles gradually move upwards */\\n dyrange: [-1, 1],\\n dvyrange: [-0.15, 0],\\n /* Random starting ease */\\n seed: Math.random() * 2 * Math.PI,\\n image: this._image,\\n canvasWidth: this._host.width,\\n canvasHeight: this._host.height,\\n /* Particles last much longer than usual */\\n lifeTick: 0.005,\\n /* Ignore the borders */\\n borderAction: FanfareParticle.BORDER_DEFAULT\\n }));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05ec8bb00b2b2155d4c380b6211233d9\",\n \"score\": \"0.59163713\",\n \"text\": \"createParticle() {\\n p5.noStroke();\\n p5.fill('rgba(200,169,169)');\\n p5.circle(this.x, this.y, this.r);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05ec8bb00b2b2155d4c380b6211233d9\",\n \"score\": \"0.59163713\",\n \"text\": \"createParticle() {\\n p5.noStroke();\\n p5.fill('rgba(200,169,169)');\\n p5.circle(this.x, this.y, this.r);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1715cf0260921d89f96159c93a441a2a\",\n \"score\": \"0.5903424\",\n \"text\": \"ParticleSystem(){\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f979a8dc240f75cd6612524816c40788\",\n \"score\": \"0.59019494\",\n \"text\": \"_breakParticles(){\\n\\t\\tfor(var i = 12; i > 0; i--){\\n\\t\\t\\tvar p = new particle(this.pos.x, this.pos.y, \\\"#00a\\\");\\n\\t\\t\\tp.vel = this.aimDir.multiply(Math.random() * 5 + 3);\\n\\t\\t\\tp.vel = p.vel.plus(new vec2((Math.random() - .5) * 3, 3 * (Math.random() - .5)));\\n\\t\\t\\t//p.vel = p.vel.plus(new vec2(this.vel.x, 0));\\n\\t\\t\\tp.pos = p.pos.plus(p.vel.multiply(3));\\n\\t\\t\\tparticles.push(p);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bab29de0d6580e4c71833275e1452cd4\",\n \"score\": \"0.58972967\",\n \"text\": \"function playButtonClick() {\\n breakSound.play();\\n challengeCompleteSound.play();\\n\\n for (let i = 0; i < 6; i++) {\\n let particle = new HexBreakParticleSystem(374 + (i - 2.5) * 80, 330, i, i, i);\\n hexBreakParticles.push(particle);\\n app.stage.addChild(particle);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"666f9150005d3f50e42753509a866686\",\n \"score\": \"0.5872684\",\n \"text\": \"createParticleBg() {\\r\\n noStroke();\\r\\n var r = random(255); // r is a random number between 0 - 255\\r\\n var g = random(100,200); // g is a random number betwen 100 - 200\\r\\n var b = random(100); // b is a random number between 0 - 100\\r\\n var a = random(200,255); // a is a random number between 200 - 255\\r\\n fill(r, g, b, a);\\r\\n //noFill();\\r\\n circle(this.x,this.y,this.r);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a831a104840c6599560a0ea2071e0486\",\n \"score\": \"0.58700997\",\n \"text\": \"addParticleSupershape (num, where) {\\r\\n const amnt = TWO_PI / num;\\r\\n const a = 1;\\r\\n const b = 1;\\r\\n const m = 5;\\r\\n const n1 = 0.14;\\r\\n const n2 = 1.7;\\r\\n const n3 = 1.7;\\r\\n\\r\\n for (let i = 0; i < TWO_PI; i+= amnt) {\\r\\n let force = p5.Vector.fromAngle(i);\\r\\n force.mult(this.supershape(i, a, b, m, n1, n2, n3));\\r\\n \\r\\n this.particleRandomly(where, force);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8131bc79a94195d191c8effb201441fd\",\n \"score\": \"0.58642274\",\n \"text\": \"function draw() {\\n ctx.clearRect(0, 0, W, H)\\n\\n ctx.fillStyle = 'rgba(221, 191, 218, 0.8)'\\n ctx.beginPath()\\n for (let i = 0; i < mp; i++) {\\n const p = particles[i]\\n ctx.moveTo(p.x, p.y)\\n ctx.arc(p.x, p.y, p.r, 0, Math.PI * 2, true)\\n }\\n ctx.fill()\\n update()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1157573c163828799679643e1a22427\",\n \"score\": \"0.5860806\",\n \"text\": \"function draw() {\\n\\n // Go through all of the particles and draw them.\\n particles.forEach(function(particle) {\\n particle.draw();\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc4cabab9fa41656147e4a5e2233b509\",\n \"score\": \"0.58554727\",\n \"text\": \"function createFirework() {\\n createParticle();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f915abd934bac81520e39b0eca8e1a37\",\n \"score\": \"0.58487487\",\n \"text\": \"function snow(x,y){\\n for(var i=1; i<= 5; i++){\\n ellipse(mouseX+random(-5,5), mouseY+random(1,20),random(1,6));\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6ab64469a84b2235b375092f186e870\",\n \"score\": \"0.5844784\",\n \"text\": \"function setup(){\\n\\tcreateCanvas(windowWidth, windowHeight); // Create canvas that fills screen\\n\\n\\t// // Create a single ball using the particle object!\\n\\t// var redColor = random(0, 255);\\n\\t// var radius = random(50, 100);\\n\\t// var xCenter = random(radius, width - radius);\\n\\t// var yCenter = random(radius, height - radius);\\n\\t// var xVelocity = random(-10, 10);\\n\\t// var yVelocity = random(-10, 10);\\n\\t// ball = new Particle(xCenter, yCenter, radius, xVelocity, yVelocity, redColor);\\n\\n\\t// // Fill an array with balls!\\n\\t// for (var i=0; i<20; i++){\\n\\t// \\tvar redColor = random(0, 255);\\n\\t// \\tvar radius = random(50, 100);\\n\\t// \\tvar xCenter = random(radius, width - radius);\\n\\t// \\tvar yCenter = random(radius, height - radius);\\n\\t// \\tvar xVelocity = random(-10, 10);\\n\\t// \\tvar yVelocity = random(-10, 10);\\n\\t// \\tball = new Particle(xCenter, yCenter, radius, xVelocity, yVelocity, redColor);\\n\\n\\t// \\tballArray.push(ball);\\n\\t// }\\n\\n\\t// Create a new particle group to hold the ball pit\\n\\tballPit = new ParticleGroup(20);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9d4d77a299f3751f8967a3f16cb54c1\",\n \"score\": \"0.58382577\",\n \"text\": \"function drawParticles() {\\n // Orb (ellipse) figures that trail, used a for loop to run the code frequently.\\n for (var i = 0; i < orbs.length; i++) {\\n// Incorporated methods such as move and display for the orbs to move at a constant while being displayed in various colors.\\n orbs[i].move();\\n orbs[i].display();\\n }\\n\\n if (lvlsflicker) {\\n strokeWeight(4);\\n stroke(random(255), random(20), 100);\\n fill(0);\\n push();\\n translate(random(width), random(height));\\n sphere(random(100), 5, 5);\\n pop();\\n }\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e412b267108b6e1ab1483d00fa1443d9\",\n \"score\": \"0.583562\",\n \"text\": \"function drawParticlesDetails() {\\n ctx.fillStyle = \\\"#000000\\\";\\n ctx.font = \\\"15px Arial\\\";\\n var text = \\\"\\\";\\n for (var i = 0; i < 5; i++) {\\n if (i == 0) {\\n text = \\\"Heavy: 1\\\";\\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 45);\\n text = \\\"Charge: +1\\\";\\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 60);\\n } else if (i == 1) {\\n text = \\\"Heavy: 1\\\";\\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 45);\\n text = \\\"Charge: 0\\\";\\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 60);\\n } else if (i == 2) {\\n text = \\\"Light: 1\\\";\\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 45);\\n text = \\\"Charge: -1\\\";\\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 60);\\n } else if (i == 3) {\\n text = \\\"Light: 1\\\";\\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 45);\\n text = \\\"Charge: 0\\\";\\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 60);\\n } else {\\n text = \\\"Light: -1\\\";\\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 45);\\n text = \\\"Charge: +1\\\";\\n ctx.fillText(text, protonStartingX - 25 + i * particleStartingSeperation, protonStartingY + 60);\\n }\\n \\n \\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a54da115093b3660a48ffdd656c8f960\",\n \"score\": \"0.5809166\",\n \"text\": \"function getParticleSystem(){\\n //geomerty to render points for particles\\n var particleGeo = new t.Geometry();\\n var particleMaterial = new t.PointsMaterial({\\n color: 0xffffff, \\n size: 2,\\n map: new t.TextureLoader().load('./assets/particle.jpg'),\\n transparent: true,\\n blending: t.AdditiveBlending,\\n depthWrite: false\\n \\n });\\n \\n for(let i =0; i< 2000; i++){\\n let point = new t.Vector3(\\n (Math.random() -.5) * 100,\\n 0, \\n (Math.random() -.5) * 100,\\n );\\n particleGeo.vertices.push(point);\\n }\\n \\n return new t.Points(particleGeo, particleMaterial);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c822964e3055a03a26db953aa210afc\",\n \"score\": \"0.58056223\",\n \"text\": \"function renderParticles() {\\n context.clearRect(0, 0, width, height);\\n for (let i = 0; i < particles.length; i++) {\\n const waypoint = waypoints[i];\\n const particle = particles[i];\\n context.fillStyle = 'red';\\n context.fillRect(waypoint[0], waypoint[1], 2, 2);\\n context.fillStyle = 'white';\\n context.fillRect(particle[0], particle[1], 2, 2);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6213c2f8c5ef97121747a2bfdd060453\",\n \"score\": \"0.57891226\",\n \"text\": \"function loadParticles(scene){\\n\\tvar fountain = BABYLOn.Mesh.CreateBox('fountain',1.0,scene);\\n\\t\\n\\tvar particleSystem = new BABYLON.ParticleSystem('parts',200,scene);\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05c25ecf362ca6e3c408d0e8da15d8cd\",\n \"score\": \"0.5776272\",\n \"text\": \"ParticleSystem(x, y){\\n this.place.x = x;\\n this.place.y = y;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fcd247059f7fa74df2f702de7112d989\",\n \"score\": \"0.5774511\",\n \"text\": \"function createParticles(x, y) {\\n var particleCount = Math.round(random(options.particleMinCount, options.particleMaxCount));\\n while(particleCount--) {\\n particles.push(new Particle(x, y));\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de69a9c1b1b847bc60bc1c82df3c434a\",\n \"score\": \"0.5771445\",\n \"text\": \"function SkeletonKingParticleClass(){\\n\\tthis.x = 75;\\n\\tthis.y = 75;\\n\\tthis.velX = 5;\\n\\tthis.velY = -7;\\n\\tthis.amountOfSmoke = 100;\\n\\tthis.readyToRemove = false;\\n\\tthis.cyclesLeft = 300;\\n\\tthis.myColor;\\n\\n\\tthis.move = function() {\\n\\t\\tthis.cyclesLeft--;\\n\\n\\t\\tif(this.cyclesLeft < 0) {\\n\\t\\t\\tthis.readyToRemove = true;\\n\\t\\t}\\n\\n\\t\\tthis.x += this.velX;\\n\\t\\tthis.y += this.velY;\\n\\t}\\n\\n\\tthis.draw = function() {\\n\\t\\tcanvasContext.drawImage(greenParticlePic,this.x,this.y);\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70423196c48904c99ff2dc54aef8c66d\",\n \"score\": \"0.57677114\",\n \"text\": \"function particleDraw() {\\n fill(255);\\n ellipse(this.px, this.py, 9, 9);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a419189028358ac6d8c942deedc9fb6c\",\n \"score\": \"0.57626855\",\n \"text\": \"createParticle(p) {\\r\\n p.noStroke();\\r\\n // p.fill('rgba(200,169,169,1)');\\r\\n p.fill('rgba(0,0,0,1)');\\r\\n p.circle(this.x, this.y, this.r);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03661c49f1cde63eee5652625d39a818\",\n \"score\": \"0.5757868\",\n \"text\": \"createParticles(){\\n const particleGeometry = new THREE.BufferGeometry;\\n const particleCount = 5000;\\n\\n const positions = new Float32Array(particleCount * 3);\\n\\n for(let i = 0; i < particleCount * 3; i++){\\n positions[i] = (Math.random() - 0.5) * 500;\\n }\\n\\n particleGeometry.setAttribute('position', new THREE.BufferAttribute(positions, 3));\\n\\n const material = new THREE.PointsMaterial({\\n size: 0.05\\n })\\n const particles = new THREE.Points(particleGeometry, material);\\n particles.name = \\\"Stars\\\";\\n this.scene.add(particles);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aacbcb722740a818516ceeb5621dbc38\",\n \"score\": \"0.5757828\",\n \"text\": \"function createParticles(x1, y1, lifeCycles, speedMult=1.0){\\n\\t\\tif(lifeCycles === undefined){\\n\\t\\t\\tlifeCycles = MINCYCLE+Math.random()*CYCLEANCHOR;\\n\\t\\t}\\n\\t\\tfor(var i=0;i<PARTICLESNUM;i++){\\n\\t\\t\\tvar particlesClass = new ParticlesTwoClass(speedMult);\\n\\t\\t\\tparticlesClass.x=x1;\\n\\t\\t\\tparticlesClass.y=y1;\\n\\n\\t\\t\\tparticlesClass.cyclesLeft=lifeCycles;\\n\\t\\t\\tparticleList.push(particlesClass);\\n\\n\\t\\t\\tif(Math.random()<0.5){\\n\\t\\t\\t\\tparticlesClass.myColor=\\\"#ED1313\\\";//red\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tparticlesClass.myColor=\\\"#E4E418 \\\";//yellow\\n\\t\\t\\t}\\n\\t\\t\\t/*particlesClass.random = Math.random();\\n\\t\\t\\tvar interval=particlesClass.random* (0.7 - 0.3) + 0.3;\\n\\n\\t\\t\\t\\tif(particlesClass.random<0.3){\\n\\t\\t\\t\\t\\tparticlesClass.myColor=\\\"#e8a3e4\\\";//burnt blue5C5D91\\n\\t\\t\\t\\t} else if (interval>0.3 && interval<0.7){\\n\\t\\t\\t\\t\\tparticlesClass.myColor=\\\"#67eaf3\\\"//burnt redA0372D\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tparticlesClass.myColor=\\\"red\\\"//burnt yellowA0372D\\n\\t\\t\\t\\t}*/\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68d4dbf46e616db229325f638ffb6402\",\n \"score\": \"0.57570684\",\n \"text\": \"render() {\\n return (\\n <section className=\\\"text-center\\\" id=\\\"jumbotron\\\">\\n <div className=\\\"container\\\">\\n <Particles\\n className=\\\"jumbo-animation\\\"\\n params={{\\n particles: {\\n number: {\\n value: 90,\\n\\n density: {\\n enable: false,\\n value_area: 1000\\n }\\n },\\n color: {\\n value: [\\\"#1F7A8C\\\", \\\"#E3B505\\\", \\\"#BFDBF7\\\"]\\n },\\n shape: {\\n type: [\\\"circle\\\", \\\"polygon\\\"],\\n stroke: {\\n width: 0,\\n color: \\\"#ffffff\\\"\\n },\\n polygon: {\\n nb_sides: 5\\n },\\n image: {\\n src: \\\"https://ubisafe.org/images/bubble-transparent-6.png\\\",\\n width: 100,\\n height: 100\\n }\\n },\\n opacity: {\\n value: 0.5,\\n random: false,\\n anim: {\\n enable: false,\\n speed: 1,\\n opacity_min: 0.1,\\n sync: true\\n }\\n },\\n size: {\\n value: 10,\\n random: false,\\n anim: {\\n enable: false,\\n speed: 9.744926547616142,\\n size_min: 0.1,\\n sync: true\\n }\\n },\\n line_linked: {\\n enable: true,\\n distance: 130,\\n color: \\\"#ffffff\\\",\\n opacity: 0.4,\\n width: 1\\n },\\n move: {\\n enable: true,\\n speed: 6,\\n direction: \\\"top-right\\\",\\n random: false,\\n straight: true,\\n out_mode: \\\"out\\\",\\n bounce: false,\\n attract: {\\n enable: false,\\n rotateX: 600,\\n rotateY: 1200\\n }\\n }\\n },\\n interactivity: {\\n detect_on: \\\"canvas\\\",\\n events: {\\n onhover: {\\n enable: true,\\n mode: \\\"grab\\\"\\n },\\n onclick: {\\n enable: true,\\n mode: \\\"push\\\"\\n },\\n resize: true\\n },\\n modes: {\\n grab: {\\n distance: 400,\\n line_linked: {\\n opacity: 1\\n }\\n },\\n bubble: {\\n distance: 400,\\n size: 40,\\n duration: 2,\\n opacity: 8,\\n speed: 3\\n },\\n repulse: {\\n distance: 200,\\n duration: 0.4\\n },\\n push: {\\n particles_nb: 4\\n },\\n remove: {\\n particles_nb: 2\\n }\\n }\\n },\\n retina_detect: true\\n }}\\n />\\n </div>\\n <div className=\\\"jumbotron\\\" id=\\\"jumbo\\\">\\n <div className=\\\"overlay container\\\">\\n <div className=\\\"jumbo-heading\\\">\\n <h1 className=\\\"\\\" id=\\\"jumbo-text \\\">\\n Hi, I'm\\n <strong className=\\\"jumbo-name\\\"> Cian O'Gralaigh</strong> <br />\\n and I'm a full-stack web developer.\\n </h1>\\n </div>\\n <div className=\\\"jumbo-btn-div\\\">\\n <a href=\\\"#projects\\\">\\n <button type=\\\"button\\\" className=\\\"btn \\\" id=\\\"jumbo-button\\\">\\n See My Work {\\\" \\\"}\\n <FontAwesomeIcon className=\\\"jumbo-arrow\\\" icon=\\\"arrow-right\\\" />\\n </button>\\n </a>\\n </div>\\n </div>\\n </div>\\n </section>\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a4606c7d91c3ef586904bdb6216de41\",\n \"score\": \"0.5751363\",\n \"text\": \"_spawnParticles(){\\n\\t\\tif(Math.random() > dt)\\n\\t\\t\\treturn;\\n\\t\\tvar p = new seekerParticle(this.pos.x, this.pos.y, \\\"#c00\\\", this);\\n\\t\\tp.setRandVel(Math.random() * 3 + 3);\\n\\t\\tp.pos = p.pos.plus(p.vel.multiply(Math.random() + 1));\\n\\t\\tparticles.push(p);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34e32ea8bb07ea51e42ba2da428091a7\",\n \"score\": \"0.57453\",\n \"text\": \"function init() {\\n\\n //In case it isn't empty for some reason\\n particlesArray = [];\\n\\n //This is to make the number of particles scale up or down with size of the screen\\n let numberOfParticles = canvas.width * canvas.height / 9000;\\n\\n //Will create i number of particles with randomized values and fill up particlesArray\\n for (var i = 0; i < numberOfParticles; i++) {\\n\\n let radius = (Math.random() * 2) + 1;\\n let x = (Math.random() * (canvas.width - radius * 4)) + radius * 4;\\n let y = (Math.random() * (canvas.height - radius * 4)) + radius * 4;\\n let directionX = randomizedSpeed();\\n let directionY = randomizedSpeed();\\n\\n let color = particleColor;\\n\\n particlesArray.push(new Particle(x, y, directionX, directionY, radius, color));\\n }\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10ec73dfae3580055fc7abb456d145b1\",\n \"score\": \"0.57388276\",\n \"text\": \"function placeDiv() {\\n\\t\\tfor (var i=1; i<=dots; i+=1) {\\n\\t\\t\\tvar isBlack = document.getElementById(i).innerHTML;\\n\\t\\t\\tif (isBlack!=='<div class=\\\"round black\\\"></div>') {\\n\\t\\t\\tdocument.getElementById(i).innerHTML = drawDiv();\\n\\t\\t\\t}\\n\\t\\t\\n}\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a5bc77ee775dd5b267dd6f33f06cc20\",\n \"score\": \"0.57337284\",\n \"text\": \"gridStage2() {\\n for (let i = 0; i < this.psArray.length; i++) {\\n /////////pick up the special ten dots////////////\\n if (\\n i == 0 ||\\n i == 4 ||\\n i == 8 ||\\n i == 28 ||\\n i == 40 ||\\n i == 44 ||\\n i == 60 ||\\n i == 72 ||\\n i == 76 ||\\n i == 80\\n ) {\\n ////////save the special dots positions//////////\\n this.specialDotsPos.push(this.psArray[i].particle.position);\\n\\n ////////fade out and delete the ten dots in the grid/////////////\\n var targetVector = new Vector2(0, 0);\\n this.psArray[i].updateScale(targetVector, 50, 0).onComplete(() => {\\n this.scene.remove(targetVector);\\n this.scene.remove(this.psArray[i]);\\n });\\n } else {\\n ////////////from right to left column///////////////\\n for (let k = 4; k >= -4; k--) {\\n setTimeout(() => {\\n if (this.psArray[i].pos.x == k * this.gap) {\\n let delayTime = 0;\\n if (k % 4 != 0) {\\n delayTime = Math.abs(this.psArray[i].pos.y) * this.gap;\\n } else {\\n delayTime = (4 - Math.abs(this.psArray[i].pos.y)) * this.gap;\\n }\\n //make the particles fade out to 0 after scale up and dowm with random delay time\\n var chainB = this.psArray[i].updateScale(\\n new Vector2(0, 0),\\n 200,\\n 0\\n );\\n //particles start to scale up and down with random delay time\\n let targetVector = new Vector2(2, 2);\\n this.psArray[i]\\n .updateScale(targetVector, 300, delayTime)\\n .repeat(1)\\n .yoyo(true)\\n .chain(chainB)\\n .onComplete(() => {\\n this.scene.remove(targetVector);\\n this.scene.remove(this.psArray[i]);\\n });\\n\\n //update the pos\\n var updatePos = new THREE.Vector3(4, 0, 0);\\n updatePos.add(this.psArray[i].pos);\\n this.psArray[i]\\n .updatePos(updatePos, 850, 0)\\n .easing(TWEEN.Easing.Sinusoidal.InOut)\\n .onComplete(() => {\\n this.scene.remove(updatePos);\\n });\\n }\\n }, (4 - k) * 50);\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0bc771d6c36d452b8d5486323543fec\",\n \"score\": \"0.57295674\",\n \"text\": \"function create_particle()\\n{\\n\\t//Random position on the canvas\\n\\tthis.x = Math.random()*W;\\n\\tthis.y = Math.random()*H;\\n\\t\\n\\t//Random velocity to each particle\\n\\tthis.vx = Math.random()*10-5;\\n\\tthis.vy = Math.random()*10-5;\\n\\t\\n\\t//Random colors - kept as white, but found code to make the colors random\\n\\t// var r = Math.random()*255>>0;\\n\\t// var g = Math.random()*255>>0;\\n\\t// var b = Math.random()*255>>0;\\n\\tthis.color = \\\"rgba(255, 255, 255, 0.5)\\\";\\n\\t\\n\\t//Random size\\n\\tthis.radius = Math.random()*5;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9cd7806ba727b22e42eb84ac09e94bcb\",\n \"score\": \"0.5724009\",\n \"text\": \"ParticleSystem(p){\\n this.place.x = p.x;\\n this.place.y = p.y;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53ad222af460efc4bf964a6c02b64129\",\n \"score\": \"0.5712909\",\n \"text\": \"function Particle ()\\n\\t{\\n\\t\\tthis.scale = 1.0;\\n\\t\\tthis.x = 0;\\n\\t\\tthis.y = 0;\\n\\t\\tthis.radius = 20;\\n\\t\\tthis.color = \\\"#000\\\";\\n\\t\\tthis.velocityX = 0;\\n\\t\\tthis.velocityY = 0;\\n\\t\\tthis.scaleSpeed = 0.5;\\n\\t\\tthis.useGravity = false;\\n\\t\\tthis.text = ''; // hello ugly hack!\\n \\n\\t\\tthis.update = function(ms)\\n\\t\\t{\\n\\t\\t\\t// shrinking\\n \\n\\t\\t\\tthis.scale -= this.scaleSpeed * ms / 1000.0;\\n \\n\\t\\t\\tif (this.scale <= 0)\\n\\t\\t\\t{\\n // particle is dead, remove it\\n removeFromArray(particles, this);\\n \\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// moving away from explosion center\\n\\t\\t\\tthis.x += this.velocityX * ms/1000.0;\\n\\t\\t\\tthis.y += this.velocityY * ms/1000.0;\\n \\n // and then later come downwards when our\\n\\t\\t // gravity is added to it. We should add parameters \\n // for the values that fake the gravity\\n if(this.useGravity) {\\n this.velocityY += Math.random()*4 +4;\\n }\\n\\t\\t};\\n\\t\\t\\n\\t\\tthis.draw = function(ctx)\\n\\t\\t{\\n\\t\\t\\tif (this.scale <= 0)\\n\\t\\t\\t\\treturn;\\n\\t\\t\\tif(this.text) {\\n\\t\\t\\t\\tctx.save();\\n\\t\\t\\t\\tctx.globalAlpha = this.scale;\\n\\t\\t\\t\\tctx.font = '10pt Arial';\\n\\t\\t\\t\\ttextWithShadow(ctx, this.text, this.x, this.y, 1.0, 'White', 'Black');\\n\\t\\t\\t\\tctx.restore();\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\t// from http://stackoverflow.com/questions/25837158/how-to-draw-a-star-by-using-canvas-html5\\n\\t\\t\\t\\tvar spikes = 5;\\n\\t\\t\\t\\tvar outerRadius = 4+4*this.scale;\\n\\t\\t\\t\\tvar innerRadius = 2+2*this.scale;\\n\\t\\t\\t\\tvar rot=Math.PI/2*3;\\n\\t\\t\\t\\tvar cx = this.x;\\n\\t\\t\\t\\tvar cy = this.y;\\n\\t\\t\\t\\tvar px=cx;\\n\\t\\t\\t\\tvar py=cy;\\n\\t\\t\\t\\tvar step=Math.PI/spikes;\\n\\n\\t\\t\\t\\tctx.save();\\n\\t\\t\\t\\tctx.globalAlpha = this.scale*2;\\n\\t\\t\\t\\tctx.strokeStyle=this.color;\\n\\t\\t\\t\\tctx.beginPath();\\n\\t\\t\\t\\tctx.moveTo(cx,cy-outerRadius);\\n\\t\\t\\t\\tfor(i=0;i<spikes;i++){\\n\\t\\t\\t\\t px=cx+Math.cos(rot)*outerRadius;\\n\\t\\t\\t\\t py=cy+Math.sin(rot)*outerRadius;\\n\\t\\t\\t\\t ctx.lineTo(px,py);\\n\\t\\t\\t\\t rot+=step;\\n\\n\\t\\t\\t\\t px=cx+Math.cos(rot)*innerRadius;\\n\\t\\t\\t\\t py=cy+Math.sin(rot)*innerRadius;\\n\\t\\t\\t\\t ctx.lineTo(px,py);\\n\\t\\t\\t\\t rot+=step;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tctx.lineTo(cx,cy-outerRadius);\\n\\t\\t\\t\\tctx.stroke();\\n\\t\\t\\t\\tctx.closePath();\\n\\t\\t\\t\\tctx.restore();\\n\\t\\t\\t}\\n\\t\\t};\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d4c9a69f3bbd349e7035ed49de45863\",\n \"score\": \"0.5707153\",\n \"text\": \"_jumpParticles(){\\n\\t\\tvar c = this.getCol();\\n\\t\\tfor(var i = 10; i > 0; i -= 1){\\n\\t\\t\\tvar p = new particle(c.position.x + Math.random() * c.size.x, c.bottom());\\n\\t\\t\\tp.setRandVel(Math.random() * 10, -Math.PI, 0);\\n\\t\\t\\tp.vel = p.vel.minus(this.vel);\\n\\t\\t\\tp.add();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77be18399a6cdccf2f4f31e68bf335c3\",\n \"score\": \"0.5701661\",\n \"text\": \"function init() {\\n for (let index = 0; index < numberOfParticles; index++) {\\n particlesArray.push(new Particle());\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"741d37b70f404e897dd8bd620a53dfe8\",\n \"score\": \"0.5699769\",\n \"text\": \"function thirdLevelSetup() {\\n\\n // climber class\\n //\\n // To put postion, the size, putting image and the speed\\n // This is also to reset the position when the climber goes up\\n climber = new Climber(width / 2, 500, 500, 500, 3.5, climbImg, UP_ARROW, DOWN_ARROW, LEFT_ARROW, RIGHT_ARROW);\\n\\n //Array\\n //\\n // For the starting platform\\n for (let s3 = 0; s3 < numbStartP; s3++) {\\n // Starting platform\\n //\\n //this is a platform for the climber for the start of the game\\n // in case all the the random platform doesn't spawn under\\n startingPlatPlus = new Platform(width / 2, 700, 2000, 1000, platLongImg);\\n\\n // push\\n //\\n // To add the platform as an array\\n startingPlat.push(startingPlatPlus);\\n }\\n\\n // Clearing the amount of snow from the last level\\n snowFall = [];\\n\\n // For loop for snow\\n //\\n // To make the number of snows that will fall\\n for (let f3 = 0; f3 < snowNumb; f3++) {\\n // random()\\n //\\n // Making the snow spawn on top of the screen\\n let snowX = random(0, width);\\n let snowY = random(0, height);\\n\\n\\n // snowFallPlus\\n //\\n // New snow that will fall\\n snowFallPlus = new Snow(snowX, snowY, color(230, 255, 255), 5);\\n\\n // push()\\n //\\n // to make array objects for snow\\n snowFall.push(snowFallPlus);\\n }\\n\\n // For loop for snow\\n //\\n // To make the number of snows that will fall\\n for (let fT3 = 0; fT3 < snowNumb; fT3++) {\\n // random()\\n //\\n // Making the snow spawn on top of the screen\\n let snowX = random(0, width);\\n let snowY = random(0, height);\\n\\n\\n // snowFallPlus\\n //\\n // New snow that will fall\\n snowFallPlus = new Snow(snowX, snowY, color(230, 255, 255), 2);\\n\\n // push()\\n //\\n // to make array objects for snow\\n snowFall.push(snowFallPlus);\\n }\\n\\n // Clearing the amount of avalanche from the previous level\\n avalanche = [];\\n\\n // Avalanche\\n //\\n // This part will show a falling avalanche\\n for (let a3 = 0; a3 < avaNumb; a3++) {\\n // random()\\n //\\n // Making an avalanche spawn randomly at the top screen\\n let avalX = random(0, width);\\n let avalY = random(0, height);\\n\\n // avalanchePlus\\n //\\n // Making avalanche into array\\n avalanchePlus = new Avalanche(avalX, avalY, 1000, 500, avalancheImg);\\n\\n // push()\\n //\\n // To make more array objects of avalanche\\n avalanche.push(avalanchePlus);\\n\\n\\n }\\n // To clear the previous platform from the last level\\n // and make new ones\\n platformShort = [];\\n platformLong = [];\\n\\n // For loop for the second level\\n //\\n // To make array objects for platform\\n //\\n // and the z is to differentiate the array from the previous level\\n for (let w = 0; w < numbPlat; w++) {\\n\\n // random()\\n //\\n // adding position for the platforms\\n\\n // For the position the short platform\\n let reShortXW = random(300, width - 300);\\n let reShortYW = random(0, height);\\n\\n // For the position for long platform\\n let reLongXW = random(300, width - 300);\\n let reLongYW = random(0, height - 300);\\n\\n // Platform classes\\n //\\n // Platform that will be generated in the screen\\n platformShortPlusW = new Platform(reShortXW, reShortYW, 500, 500, platShortImg);\\n platformLongPlusW = new Platform(reLongXW, reLongYW, 1000, 500, platLongImg);\\n\\n // push()\\n //\\n // To add more platform in the screen as an array\\n platformShort.push(platformShortPlusW);\\n platformLong.push(platformLongPlusW);\\n\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d2bc7d10307308592ed26a8f8eb1617\",\n \"score\": \"0.5696343\",\n \"text\": \"render(props) {\\n\\n const num = props.num;\\n const styleClass = props['style-class'] || '';\\n const circles = [];\\n\\n for (let i = 0; i < num; i++) {\\n circles.push({});\\n }\\n\\n return (<div class={`${styleClass}`}>\\n {circles.map((c, idx) => {\\n\\n const _size = (100 / num) * (idx + 1)\\n const position = (100 - _size) / 2;\\n\\n return (<div class={`${styles.mut_sphere} ${styleClass}`} style={`width: ${_size}%; height:${_size}%; top: ${position}%; left: ${position}%; z-index: ${10 - idx }; animation-delay: ${idx * 200}ms;`}></div>);\\n })}\\n </div>)\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1a47eeb0f26db6778d3d4f8c348a388\",\n \"score\": \"0.56960106\",\n \"text\": \"function play() {\\n // Move background sky to make infinitely scrolling background\\n sky.tileX -= 1\\n\\n\\n //Loop through all the blocks and check for a collision between\\n //each block and the snowman.\\n var snowmanVsBlock = iceBlocks.children.some(function(block) {\\n let snowmanVsBlockCollisionType = g.rectangleCollision(snowman, block);\\n if (snowmanVsBlockCollisionType === \\\"bottom\\\") {\\n floorLevel = block.gy;\\n if (block.type === \\\"finish\\\") {\\n finish.gotoAndStop(1);\\n g.wait(2000, function() {\\n g.state = end;\\n });\\n }\\n } else if ((snowmanVsBlockCollisionType === \\\"right\\\") && (iceBlocks.vx < 0)) {\\n iceBlocks.vx = 0;\\n } else if ((snowmanVsBlockCollisionType === \\\"left\\\") && (iceBlocks.vx > 0)) {\\n iceBlocks.vx = 0;\\n }\\n });\\n\\n\\n var snowmanVsSnowflake = snowflakes.children.some(function(snowflake) {\\n let collisionBoolean = g.hitTestRectangle(snowman, snowflake, true);\\n if (collisionBoolean === true) {\\n if (snowflake.visible) {\\n renderParticles = true;\\n snowflake.visible = false;\\n } else {\\n renderParticles = false;\\n }\\n }\\n });\\n\\n\\n if (renderParticles) {\\n if (snowballCount < 5) {\\n snowballCount++;\\n }\\n //Create dust explosion\\n g.createParticles(\\n snowman.centerX, snowman.centerY, //x and y position\\n () => g.sprite(dustFrames), //Particle sprite\\n g.stage, //The container to add the particles to \\n 40, //Number of particles\\n 0.5, //Gravity\\n false, //Random spacing\\n 3.95, 5.49, //Min/max angle\\n 5, 16, //Min/max size\\n 1, 2 //Min/max speed\\n );\\n }\\n\\n\\n // Render snowballs depending on snowman course\\n if (snowmanDirection === \\\"left\\\") {\\n targetX = snowman.x + 40;\\n } else {\\n targetX = snowman.x - 10;\\n }\\n targetY = snowman.y + 70;\\n\\n let index = 0;\\n var snowballBounce = snowballs.children.some(function(snowball) {\\n snowball.visible = false;\\n index++;\\n snowball.vx += (targetX - snowball.x) * spring;\\n snowball.vy += (targetY - snowball.y) * spring;\\n // snowball.vy += gravity * 5;\\n snowball.vx *= friction;\\n snowball.vy *= friction;\\n snowball.x += snowball.vx;\\n snowball.y += snowball.vy;\\n\\n // Update target for next ball running through loop \\n if (snowmanDirection === \\\"left\\\") {\\n targetX = snowball.x + 20;\\n } else {\\n targetX = snowball.x - 20;\\n }\\n targetY = snowball.y;\\n\\n if (index <= snowballCount) {\\n snowball.visible = true;\\n }\\n });\\n\\n\\n var penguinBounce = bouncingPenguins.children.some(function(bPenguin) {\\n let penguinVSblock = iceBlocks.children.some(function(iBlock) {\\n penguinCollisionType = g.rectangleCollision(bPenguin, iBlock, true);\\n if (penguinCollisionType === \\\"bottom\\\") {\\n bPenguin.floorL = iBlock.y;\\n }\\n });\\n\\n if (bPenguin.y < bPenguin.floorL - 150) {\\n bPenguin.vy += gravity * 0.2;\\n }\\n bPenguin.vx = bPenguin.oVx + iceBlocks.vx;\\n bPenguin.oX += bPenguin.oVx;\\n var temp = numberOfPillars * 48;\\n // Make bouncing penguins turn left when they've reached end of course\\n if (bPenguin.oX > (numberOfPillars * 48)) {\\n bPenguin.oVx = -bPenguin.oVx;\\n bPenguin.playAnimation(bouncingLeft);\\n }\\n g.move(bPenguin);\\n });\\n\\n var snowmanVsBouncePenguin = bouncingPenguins.children.some(function(bPenguin) {\\n if (bPenguin.visible === true) {\\n let snowmanPenguinCollisionType = g.rectangleCollision(snowman, bPenguin);\\n if (snowmanPenguinCollisionType) {\\n // Decrease snowball count\\n if (snowballCount > 0) {\\n snowballCount--;\\n }\\n // Render hurt snowman for 0.3 sec\\n snowman.gotoAndStop(2);\\n g.wait(300, function() {\\n snowman.gotoAndStop(0);\\n });\\n }\\n }\\n\\n });\\n\\n // Skating penguin motion\\n skatingPenguin.oX += iceBlocks.vx;\\n if (skatingPenguin.x > skatingPenguin.oX + 9 * 64) {\\n skatingPenguin.vx = -skatingPenguin.vx;\\n skatingPenguin.playAnimation(skatingLeft);\\n skatingPenguin.x = skatingPenguin.oX + 9 * 64 - 30;\\n } else if (skatingPenguin.x < skatingPenguin.oX) {\\n skatingPenguin.vx = -skatingPenguin.vx;\\n skatingPenguin.playAnimation(skatingRight);\\n skatingPenguin.x = skatingPenguin.oX;\\n }\\n skatingPenguin.x += skatingPenguin.vx + iceBlocks.vx;\\n\\n let activePenguinIndex = 0;\\n if (skatingPenguin.visible === true) {\\n activePenguinIndex++;\\n let snowmanVsSkatePenguin = g.rectangleCollision(snowman, skatingPenguin);\\n if (snowmanVsSkatePenguin) {\\n // Decrease snowball count\\n if (snowballCount > 0) {\\n snowballCount--;\\n }\\n // Render hurt snowman for 0.3 sec\\n snowman.gotoAndStop(2);\\n g.wait(300, function() {\\n snowman.gotoAndStop(0);\\n });\\n }\\n }\\n\\n // Set an upper limit for Y velocity\\n // Even if user keeps pressing the up arrow, \\n // Y velocity will stop incrementing\\n if (snowman.vy > minVelocityY) {\\n snowman.vy += snowman.ay;\\n }\\n\\n // Apply gravity only if snowman above floor level\\n if (snowman.y < floorLevel - snowman.height) {\\n snowman.vy += gravity;\\n }\\n\\n // Attack snowball physics\\n if (attackSnowball.attack === false) {\\n attackSnowball.x = snowman.centerX + Math.cos(attackSnowball.angle) * attackSnowball.radius;\\n attackSnowball.y = snowman.centerY - snowman.halfHeight + Math.sin(attackSnowball.angle) * attackSnowball.radius;\\n if (attackSnowball.angle >= 0.785) {\\n attackSnowball.w = -attackSnowball.w;\\n //attackSnowball.angle += attackSnowball.w;\\n } else if (attackSnowball.angle <= -3.926) {\\n attackSnowball.w = -attackSnowball.w;\\n }\\n attackSnowball.angle += attackSnowball.w;\\n }\\n\\n if (attackSnowball.attack === true) {\\n g.move(attackSnowball);\\n }\\n\\n var snowballVsBouncePenguin = bouncingPenguins.children.some(function(bPenguin) {\\n if (bPenguin.visible === true) {\\n activePenguinIndex++;\\n }\\n // Only if the penguin is active and if snowball has been thrown\\n if ((bPenguin.visible === true) && (attackSnowball.attack === true) && (snowballCount >= 0)) {\\n let snowballPenguinCollisionType = g.rectangleCollision(attackSnowball, bPenguin);\\n if (snowballPenguinCollisionType) {\\n bPenguin.visible = false;\\n g.createParticles(\\n g.canvas.width - 130, 25, //x and y position\\n () => g.sprite(dustFrames), //Particle sprite\\n g.stage, //The container to add the particles to \\n 40, //Number of particles\\n 0.5, //Gravity\\n false, //Random spacing\\n 3.95, 5.49, //Min/max angle\\n 5, 10, //Min/max size\\n 1, 2 //Min/max speed\\n );\\n }\\n }\\n });\\n\\n let snowballVsSkatePenguin = g.rectangleCollision(attackSnowball, skatingPenguin);\\n if (snowballVsSkatePenguin) {\\n skatingPenguin.visible = false;\\n g.createParticles(\\n g.canvas.width - 130, 25, //x and y position\\n () => g.sprite(dustFrames), //Particle sprite\\n g.stage, //The container to add the particles to \\n 40, //Number of particles\\n 0.5, //Gravity\\n false, //Random spacing\\n 3.95, 5.49, //Min/max angle\\n 5, 10, //Min/max size\\n 1, 2 //Min/max speed\\n );\\n }\\n\\n // Update points \\n let pIndex = 0;\\n if (activePenguinIndex < totalPenguins) {\\n pointCount = totalPenguins - activePenguinIndex;\\n var updatePoints = points.children.some(function(p) {\\n //p.visible = false;\\n pIndex++;\\n if (pIndex <= pointCount) {\\n p.visible = true;\\n }\\n });\\n }\\n\\n\\n // Move snowman\\n g.move(snowman);\\n\\n\\n // If we have not reached the finish, move blocks to the \\n // left each frame\\n if ((finish.gx > 156)) {\\n finish.vx = iceBlocks.vx;\\n g.move(finish);\\n snowflakes.vx = iceBlocks.vx;\\n g.move(snowflakes);\\n igloo.vx = iceBlocks.vx;\\n g.move(igloo);\\n g.move(iceBlocks);\\n }\\n\\n // Keep player contained inside the stage area\\n // Second argument here any JS object\\n g.contain(snowman, {\\n x: 32,\\n y: 16,\\n width: g.canvas.width * 3 / 4,\\n height: g.canvas.height\\n });\\n\\n\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9a196d4aa3ba2ce4f0d64433502c677\",\n \"score\": \"0.5695283\",\n \"text\": \"function ParticleFountain(params){\\n this.init = function(){\\n for(var i = 0; i < this.count; i++){\\n this.particles.push(new Particle({'x': this.x, \\n 'y': this.y, \\n 'context': this.context,\\n 'red': this.r+150,\\n 'green': this.g+150/2,\\n 'blue': this.b+150/2,\\n 'direction': this.direction-40+randomInt(80),\\n 'speed': (this.speed)+randomInt(3),\\n 'ttl': this.ttl + randomInt(30)\\n })\\n );\\n }\\n }\\n\\n this.update = function(){\\n for(var i = 0; i < this.count; i++){\\n if(this.particles[i].update()){\\n var color_mod = randomInt(150);\\n this.particles.splice(i, 1);\\n this.particles.push(new Particle({'x': this.x, \\n 'y': this.y, \\n 'context': this.context,\\n 'red': this.r+color_mod,\\n 'green': this.g+color_mod/2,\\n 'blue': this.b+color_mod/2,\\n 'direction': this.direction-40+randomInt(80),\\n 'speed': (this.speed)+randomInt(3),\\n 'ttl': this.ttl + randomInt(30)\\n })\\n );\\n }\\n else{\\n this.particles[i].draw();\\n }\\n }\\n }\\n \\n this.update_ex = function(params){\\n var cust_dir = params.direction || this.direction;\\n var cust_x = params.x || this.x;\\n var cust_y = params.y || this.y;\\n var cust_create = params.create;\\n \\n for(var i = 0; i < this.count; i++){\\n \\n if(this.particles[i].update()){\\n this.particles.splice(i, 1);\\n var color_mod = randomInt(150);\\n this.particles.push(new Particle({'x': this.x, \\n 'y': this.y, \\n 'context': this.context,\\n 'red': this.r+color_mod,\\n 'green': this.g+color_mod/2,\\n 'blue': this.b+color_mod/2,\\n 'direction': this.direction-30+randomInt(60),\\n 'speed': this.speed*randomInt(2)+1,\\n 'ttl': this.ttl + randomInt(30)\\n })\\n );\\n };\\n }\\n }\\n \\n this.ttl = params.ttl || 60;\\n this.context = params.context;\\n this.direction = params.direction; // degrees\\n this.x = params.x;\\n this.y = params.y;\\n this.count = params.count;\\n this.speed = params.speed; // this will be ~randomized\\n this.r = params.red;\\n this.g = params.green;\\n this.b = params.blue;\\n this.particles = [];\\n this.init();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d290f96747e4766b6c480b388e28d428\",\n \"score\": \"0.56949264\",\n \"text\": \"function draw() {\\n background(backgroundColor);\\n particles.forEach((particle, index) => {\\n particle.update();\\n particle.draw();\\n particle.check(particles.slice(index));\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"346c2c2152a054082175a89463a83e02\",\n \"score\": \"0.5691519\",\n \"text\": \"_emitParticles() {\\n const particleInterval = setInterval(async () => {\\n if (!this.spinning) clearInterval(particleInterval);\\n\\n const particle = new Sprite.from('star');\\n particle.name = 'particle';\\n particle.anchor.set(0.5);\\n \\n this._particles.addChild(particle);\\n \\n gsap.to(particle, { y: window.innerHeight, ease: 'back.in(5)', duration: 2 });\\n gsap.to(particle.scale, { x: 0, y: 0, duration: 2 });\\n await gsap.to(particle, { \\n x: (window.innerWidth * Math.random() + 500) * (Math.random() > 0.5 ? -1 : 1), \\n rotation: Math.PI * Math.random() * 4,\\n duration: 2\\n });\\n \\n this._particles.removeChild(particle);\\n }, 50);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"789f7a45eea8d2e4dfea44af75a3cf1a\",\n \"score\": \"0.56903714\",\n \"text\": \"function create()\\n {\\n // sets the position of each particle to where the user has clicked\\n this.x = clickX;\\n this.y = clickY;\\n // Add random velocity to each particle\\n this.vx = Math.random()*5-2;\\n this.vy = Math.random()*5-2;\\n \\n //Randomised the RGB values of the colours\\n var red = Math.random()*255>>0;\\n var green = Math.random()*255>>0;\\n var blue = Math.random()*255>>0;\\n this.color = \\\"rgba(\\\"+red+\\\", \\\"+green+\\\", \\\"+blue+\\\", 0.5)\\\";\\n \\n //applies a random size to the radius of the particle\\n this.radius = Math.random()*7;\\n \\n // adds a lifetime value for the particle\\n this.lifeSpan = Math.random()*200;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a77867939a7d2e98bc19ad57e5ca8ab4\",\n \"score\": \"0.56798255\",\n \"text\": \"function createPieces(num) {\\r\\n\\tvar pieces = document.createElement('div');\\r\\n\\tif (pieces.className.indexOf(\\\"each\\\") == -1)\\r\\n\\t\\tpieces.className += \\\" \\\" + \\\"each\\\";\\r\\n\\tpieces.index = num;\\r\\n\\tvar top = parseInt(num / 4) * 88;\\r\\n\\tvar left = num % 4 * 88;\\r\\n\\tpieces.style.top = top + 'px';\\r\\n\\tpieces.style.left = left + 'px';\\r\\n\\tpieces.style.backgroundPosition = left * -1 + 'px' + ' ' + top * -1 + 'px';\\r\\n\\treturn pieces;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7eceb0ab1be46743923e2f2ddbcaa1f\",\n \"score\": \"0.5679127\",\n \"text\": \"function initAllParticles(){\\n\\n for(var k=0;k<sentence.length;k++){\\n var offset = k * 6* edgeSize;\\n for(var j=0;j<7;j+=1){\\n for(var i=0;i<5;i+=1){\\n var particle = new Particle(ctx,Math.round(offsetX+i*edgeSize + offset),offsetY+j*edgeSize);\\n memory.push(particle);\\n }\\n }\\n }\\n console.log(memory.length);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65b256a4fb8d80933cab307355d03dd5\",\n \"score\": \"0.56787026\",\n \"text\": \"function setup() {\\n createCanvas(windowWidth, 500); \\n \\n \\n for(var i = 0; i < nums; i++){\\n\\t\\tparticles_a[i] = new Particle(random(0, width),random(0,height));\\n\\t\\tparticles_b[i] = new Particle(random(0, width),random(0,height));\\n\\t\\tparticles_c[i] = new Particle(random(0, width),random(0,height));\\n particles_d[i] =new Particle (random (0, width),random(0,height));\\n\\t}\\n \\n //leaf + bud\\n for(i=0;i<numWaterlilies;i++){\\n // drawleaf(x,y,r,g,b)\\n\\t\\tleaf1 = new drawleaf (random(width),random(height),random(35,98),random(30,50),random(17,97),1) ;// generate one leaf\\n\\t\\twaterlilies.push(leaf1); //add it to the array.\\n lilybuds [i] = new drawLily (random(0, width),random(0,height));\\n \\n\\t}\\n \\n \\n}//setup ends\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ddde5f64568530e66ecb362f56337064\",\n \"score\": \"0.5678595\",\n \"text\": \"draw() {\\n for (let particle in this.particles) {\\n this.particles[particle].draw();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78ba407fb5e6e508695c760c205b74bf\",\n \"score\": \"0.56771797\",\n \"text\": \"addParticleSuperellipse (num, where) {\\r\\n const amnt = TWO_PI / num;\\r\\n const n = 0.5;\\r\\n const b = 1.5;\\r\\n const a = 1.5;\\r\\n\\r\\n for (let i = 0; i < TWO_PI; i+= amnt) {\\r\\n const na = 2 / n;\\r\\n const x = pow(abs(cos(i)), na) * a * this.sgn(cos(i));\\r\\n const y = pow(abs(sin(i)), na) * b * this.sgn(sin(i));\\r\\n\\r\\n const force = createVector(x, y);\\r\\n \\r\\n this.particleRandomly(where, force);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fdbd8586e09199c80fb3eb00482030a8\",\n \"score\": \"0.56760085\",\n \"text\": \"function createParticles2() {\\n //Materiale:\\n\\tlet material = new THREE.PointsMaterial({\\n\\t size: 1,\\n\\t\\tvertexColors : true,\\n\\t\\tcolor : 0xff500\\n\\t});\\n\\n //Geometri, legger til posisjon og farge per verteks:\\n\\tlet geom = new THREE.Geometry();\\n\\tfor (let x = -5; x < 5; x++) {\\n\\t\\tfor (let y = -5; y < 5; y++) {\\n\\t\\t\\tlet particle = new THREE.Vector3(x * 10, y * 10, 0);\\n\\t\\t\\tgeom.vertices.push(particle);\\n\\t\\t\\tgeom.colors.push(new THREE.Color(Math.random() * 0x00ffff));\\n\\t\\t}\\n\\t}\\n\\n\\tlet points = new THREE.Points(geom, material);\\n\\tscene.add(points);\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":91,"cells":{"query_id":{"kind":"string","value":"a1278ab0785c9c8aa90a1ad36e1f52a1"},"query":{"kind":"string","value":"=========================================================================== Compress as much as possible from the input stream, return the current block state. This function does not perform lazy evaluation of matches and inserts new strings in the dictionary only for unmatched strings or for short matches. It is used only for the fast compression options."},"positive_passages":{"kind":"list like","value":[{"docid":"a25e77007fcfed846c6e48e83551cc9a","score":"0.0","text":"function deflate_fast(s, flush) {\n var hash_head; /* head of the hash chain */\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}","title":""}],"string":"[\n {\n \"docid\": \"a25e77007fcfed846c6e48e83551cc9a\",\n \"score\": \"0.0\",\n \"text\": \"function deflate_fast(s, flush) {\\n var hash_head; /* head of the hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) {\\n break; /* flush the current block */\\n }\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n * At this point we have always match_length < MIN_MATCH\\n */\\n if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n }\\n if (s.match_length >= MIN_MATCH) {\\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\\n\\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\\n s.match_length - MIN_MATCH, bflush); ***/\\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\\n\\n s.lookahead -= s.match_length;\\n\\n /* Insert new strings in the hash table only if the match length\\n * is not too large. This saves time but degrades compression.\\n */\\n if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\\n s.match_length--; /* string at strstart already in table */\\n do {\\n s.strstart++;\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\\n * always MIN_MATCH bytes ahead.\\n */\\n } while (--s.match_length !== 0);\\n s.strstart++;\\n } else\\n {\\n s.strstart += s.match_length;\\n s.match_length = 0;\\n s.ins_h = s.window[s.strstart];\\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\\n\\n//#if MIN_MATCH != 3\\n// Call UPDATE_HASH() MIN_MATCH-3 more times\\n//#endif\\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\\n * matter since it will be recomputed at next deflate call.\\n */\\n }\\n } else {\\n /* No match, output a literal byte */\\n //Tracevv((stderr,\\\"%c\\\", s.window[s.strstart]));\\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\\n\\n s.lookahead--;\\n s.strstart++;\\n }\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n }\\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"f7270f04a4e803be9ef4735a42ab0d3f","score":"0.6782075","text":"function zip_deflate_fast() {\n while (zip_lookahead != 0 && zip_qhead == null) {\n var flush; // set if current block must be flushed\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n zip_INSERT_STRING();\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (zip_hash_head != zip_NIL &&\n zip_strstart - zip_hash_head <= zip_MAX_DIST) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n zip_match_length = zip_longest_match(zip_hash_head);\n /* longest_match() sets match_start */\n if (zip_match_length > zip_lookahead) { zip_match_length = zip_lookahead; }\n }\n if (zip_match_length >= zip_MIN_MATCH) {\n //\t check_match(strstart, match_start, match_length);\n\n flush = zip_ct_tally(zip_strstart - zip_match_start,\n zip_match_length - zip_MIN_MATCH);\n zip_lookahead -= zip_match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (zip_match_length <= zip_max_lazy_match) {\n zip_match_length--; // string at strstart already in hash table\n do {\n zip_strstart++;\n zip_INSERT_STRING();\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH\n * these bytes are garbage, but it does not matter since\n * the next lookahead bytes will be emitted as literals.\n */\n } while (--zip_match_length != 0);\n zip_strstart++;\n } else {\n zip_strstart += zip_match_length;\n zip_match_length = 0;\n zip_ins_h = zip_window[zip_strstart] & 0xff;\n //\t\tUPDATE_HASH(ins_h, window[strstart + 1]);\n zip_ins_h = ((zip_ins_h << zip_H_SHIFT) ^ (zip_window[zip_strstart + 1] & 0xff)) & zip_HASH_MASK;\n\n //#if MIN_MATCH != 3\n //\t\tCall UPDATE_HASH() MIN_MATCH-3 more times\n //#endif\n\n }\n } else {\n /* No match, output a literal byte */\n flush = zip_ct_tally(0, zip_window[zip_strstart] & 0xff);\n zip_lookahead--;\n zip_strstart++;\n }\n if (flush) {\n zip_flush_block(0);\n zip_block_start = zip_strstart;\n }\n\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n while (zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile) { zip_fill_window(); }\n }\n}","title":""},{"docid":"26419d96139f531d77dcbd2cebb7a0c2","score":"0.67528456","text":"function deflate_fast() {\n \t\twhile (lookahead !== 0 && qhead === null) {\n \t\t\tvar flush; // set if current block must be flushed\n \n \t\t\t// Insert the string window[strstart .. strstart+2] in the\n \t\t\t// dictionary, and set hash_head to the head of the hash chain:\n \t\t\tINSERT_STRING();\n \n \t\t\t// Find the longest match, discarding those <= prev_length.\n \t\t\t// At this point we have always match_length < MIN_MATCH\n \t\t\tif (hash_head !== NIL && strstart - hash_head <= MAX_DIST) {\n \t\t\t\t// To simplify the code, we prevent matches with the string\n \t\t\t\t// of window index 0 (in particular we have to avoid a match\n \t\t\t\t// of the string with itself at the start of the input file).\n \t\t\t\tmatch_length = longest_match(hash_head);\n \t\t\t\t// longest_match() sets match_start */\n \t\t\t\tif (match_length > lookahead) {\n \t\t\t\t\tmatch_length = lookahead;\n \t\t\t\t}\n \t\t\t}\n \t\t\tif (match_length >= MIN_MATCH) {\n \t\t\t\t// check_match(strstart, match_start, match_length);\n \n \t\t\t\tflush = ct_tally(strstart - match_start, match_length - MIN_MATCH);\n \t\t\t\tlookahead -= match_length;\n \n \t\t\t\t// Insert new strings in the hash table only if the match length\n \t\t\t\t// is not too large. This saves time but degrades compression.\n \t\t\t\tif (match_length <= max_lazy_match) {\n \t\t\t\t\tmatch_length--; // string at strstart already in hash table\n \t\t\t\t\tdo {\n \t\t\t\t\t\tstrstart++;\n \t\t\t\t\t\tINSERT_STRING();\n \t\t\t\t\t\t// strstart never exceeds WSIZE-MAX_MATCH, so there are\n \t\t\t\t\t\t// always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH\n \t\t\t\t\t\t// these bytes are garbage, but it does not matter since\n \t\t\t\t\t\t// the next lookahead bytes will be emitted as literals.\n \t\t\t\t\t} while (--match_length !== 0);\n \t\t\t\t\tstrstart++;\n \t\t\t\t} else {\n \t\t\t\t\tstrstart += match_length;\n \t\t\t\t\tmatch_length = 0;\n \t\t\t\t\tins_h = window[strstart] & 0xff;\n \t\t\t\t\t// UPDATE_HASH(ins_h, window[strstart + 1]);\n \t\t\t\t\tins_h = ((ins_h << H_SHIFT) ^ (window[strstart + 1] & 0xff)) & HASH_MASK;\n \n \t\t\t\t//#if MIN_MATCH !== 3\n \t\t\t\t//\t\tCall UPDATE_HASH() MIN_MATCH-3 more times\n \t\t\t\t//#endif\n \n \t\t\t\t}\n \t\t\t} else {\n \t\t\t\t// No match, output a literal byte */\n \t\t\t\tflush = ct_tally(0, window[strstart] & 0xff);\n \t\t\t\tlookahead--;\n \t\t\t\tstrstart++;\n \t\t\t}\n \t\t\tif (flush) {\n \t\t\t\tflush_block(0);\n \t\t\t\tblock_start = strstart;\n \t\t\t}\n \n \t\t\t// Make sure that we always have enough lookahead, except\n \t\t\t// at the end of the input file. We need MAX_MATCH bytes\n \t\t\t// for the next match, plus MIN_MATCH bytes to insert the\n \t\t\t// string following the next match.\n \t\t\twhile (lookahead < MIN_LOOKAHEAD && !eofile) {\n \t\t\t\tfill_window();\n \t\t\t}\n \t\t}\n \t}","title":""},{"docid":"089de3d5a95902ba60afd05f61545bfb","score":"0.6682843","text":"function deflate_fast() {\n\t\twhile (lookahead !== 0 && qhead === null) {\n\t\t\tvar flush; // set if current block must be flushed\n\n\t\t\t// Insert the string window[strstart .. strstart+2] in the\n\t\t\t// dictionary, and set hash_head to the head of the hash chain:\n\t\t\tINSERT_STRING();\n\n\t\t\t// Find the longest match, discarding those <= prev_length.\n\t\t\t// At this point we have always match_length < MIN_MATCH\n\t\t\tif (hash_head !== NIL && strstart - hash_head <= MAX_DIST) {\n\t\t\t\t// To simplify the code, we prevent matches with the string\n\t\t\t\t// of window index 0 (in particular we have to avoid a match\n\t\t\t\t// of the string with itself at the start of the input file).\n\t\t\t\tmatch_length = longest_match(hash_head);\n\t\t\t\t// longest_match() sets match_start */\n\t\t\t\tif (match_length > lookahead) {\n\t\t\t\t\tmatch_length = lookahead;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (match_length >= MIN_MATCH) {\n\t\t\t\t// check_match(strstart, match_start, match_length);\n\n\t\t\t\tflush = ct_tally(strstart - match_start, match_length - MIN_MATCH);\n\t\t\t\tlookahead -= match_length;\n\n\t\t\t\t// Insert new strings in the hash table only if the match length\n\t\t\t\t// is not too large. This saves time but degrades compression.\n\t\t\t\tif (match_length <= max_lazy_match) {\n\t\t\t\t\tmatch_length--; // string at strstart already in hash table\n\t\t\t\t\tdo {\n\t\t\t\t\t\tstrstart++;\n\t\t\t\t\t\tINSERT_STRING();\n\t\t\t\t\t\t// strstart never exceeds WSIZE-MAX_MATCH, so there are\n\t\t\t\t\t\t// always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH\n\t\t\t\t\t\t// these bytes are garbage, but it does not matter since\n\t\t\t\t\t\t// the next lookahead bytes will be emitted as literals.\n\t\t\t\t\t} while (--match_length !== 0);\n\t\t\t\t\tstrstart++;\n\t\t\t\t} else {\n\t\t\t\t\tstrstart += match_length;\n\t\t\t\t\tmatch_length = 0;\n\t\t\t\t\tins_h = window[strstart] & 0xff;\n\t\t\t\t\t// UPDATE_HASH(ins_h, window[strstart + 1]);\n\t\t\t\t\tins_h = ((ins_h << H_SHIFT) ^ (window[strstart + 1] & 0xff)) & HASH_MASK;\n\n\t\t\t\t//#if MIN_MATCH !== 3\n\t\t\t\t//\t\tCall UPDATE_HASH() MIN_MATCH-3 more times\n\t\t\t\t//#endif\n\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// No match, output a literal byte */\n\t\t\t\tflush = ct_tally(0, window[strstart] & 0xff);\n\t\t\t\tlookahead--;\n\t\t\t\tstrstart++;\n\t\t\t}\n\t\t\tif (flush) {\n\t\t\t\tflush_block(0);\n\t\t\t\tblock_start = strstart;\n\t\t\t}\n\n\t\t\t// Make sure that we always have enough lookahead, except\n\t\t\t// at the end of the input file. We need MAX_MATCH bytes\n\t\t\t// for the next match, plus MIN_MATCH bytes to insert the\n\t\t\t// string following the next match.\n\t\t\twhile (lookahead < MIN_LOOKAHEAD && !eofile) {\n\t\t\t\tfill_window();\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"6e9de76f1bd9c8568dadc40116c7e688","score":"0.6670824","text":"function deflate_fast(s,flush){var hash_head; /* head of the hash chain */var bflush; /* set if current block must be flushed */for(;;){ /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */if(s.lookahead<MIN_LOOKAHEAD){fill_window(s);if(s.lookahead<MIN_LOOKAHEAD&&flush===Z_NO_FLUSH){return BS_NEED_MORE;}if(s.lookahead===0){break; /* flush the current block */}} /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */hash_head=0 /*NIL*/;if(s.lookahead>=MIN_MATCH){ /*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart; /***/} /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */if(hash_head!==0 /*NIL*/&&s.strstart-hash_head<=s.w_size-MIN_LOOKAHEAD){ /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */s.match_length=longest_match(s,hash_head); /* longest_match() sets match_start */}if(s.match_length>=MIN_MATCH){ // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/bflush=trees._tr_tally(s,s.strstart-s.match_start,s.match_length-MIN_MATCH);s.lookahead-=s.match_length; /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */if(s.match_length<=s.max_lazy_match /*max_insert_length*/&&s.lookahead>=MIN_MATCH){s.match_length--; /* string at strstart already in table */do {s.strstart++; /*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart; /***/ /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */}while(--s.match_length!==0);s.strstart++;}else {s.strstart+=s.match_length;s.match_length=0;s.ins_h=s.window[s.strstart]; /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+1])&s.hash_mask; //#if MIN_MATCH != 3\n // Call UPDATE_HASH() MIN_MATCH-3 more times\n //#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */}}else { /* No match, output a literal byte */ //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart]);s.lookahead--;s.strstart++;}if(bflush){ /*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;} /***/}}s.insert=s.strstart<MIN_MATCH-1?s.strstart:MIN_MATCH-1;if(flush===Z_FINISH){ /*** FLUSH_BLOCK(s, 1); ***/flush_block_only(s,true);if(s.strm.avail_out===0){return BS_FINISH_STARTED;} /***/return BS_FINISH_DONE;}if(s.last_lit){ /*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;} /***/}return BS_BLOCK_DONE;}","title":""},{"docid":"78dfebb5d991ca33c5b59ded04097108","score":"0.66418016","text":"function deflate_slow(s,flush){var hash_head; /* head of hash chain */var bflush; /* set if current block must be flushed */var max_insert; /* Process the input block. */for(;;){ /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */if(s.lookahead<MIN_LOOKAHEAD){fill_window(s);if(s.lookahead<MIN_LOOKAHEAD&&flush===Z_NO_FLUSH){return BS_NEED_MORE;}if(s.lookahead===0){break;} /* flush the current block */} /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */hash_head=0 /*NIL*/;if(s.lookahead>=MIN_MATCH){ /*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart; /***/} /* Find the longest match, discarding those <= prev_length.\n */s.prev_length=s.match_length;s.prev_match=s.match_start;s.match_length=MIN_MATCH-1;if(hash_head!==0 /*NIL*/&&s.prev_length<s.max_lazy_match&&s.strstart-hash_head<=s.w_size-MIN_LOOKAHEAD /*MAX_DIST(s)*/){ /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */s.match_length=longest_match(s,hash_head); /* longest_match() sets match_start */if(s.match_length<=5&&(s.strategy===Z_FILTERED||s.match_length===MIN_MATCH&&s.strstart-s.match_start>4096 /*TOO_FAR*/)){ /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */s.match_length=MIN_MATCH-1;}} /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */if(s.prev_length>=MIN_MATCH&&s.match_length<=s.prev_length){max_insert=s.strstart+s.lookahead-MIN_MATCH; /* Do not insert strings in hash table beyond this. */ //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/bflush=trees._tr_tally(s,s.strstart-1-s.prev_match,s.prev_length-MIN_MATCH); /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */s.lookahead-=s.prev_length-1;s.prev_length-=2;do {if(++s.strstart<=max_insert){ /*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart; /***/}}while(--s.prev_length!==0);s.match_available=0;s.match_length=MIN_MATCH-1;s.strstart++;if(bflush){ /*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;} /***/}}else if(s.match_available){ /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */ //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart-1]);if(bflush){ /*** FLUSH_BLOCK_ONLY(s, 0) ***/flush_block_only(s,false); /***/}s.strstart++;s.lookahead--;if(s.strm.avail_out===0){return BS_NEED_MORE;}}else { /* There is no previous match to compare with, wait for\n * the next step to decide.\n */s.match_available=1;s.strstart++;s.lookahead--;}} //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if(s.match_available){ //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart-1]);s.match_available=0;}s.insert=s.strstart<MIN_MATCH-1?s.strstart:MIN_MATCH-1;if(flush===Z_FINISH){ /*** FLUSH_BLOCK(s, 1); ***/flush_block_only(s,true);if(s.strm.avail_out===0){return BS_FINISH_STARTED;} /***/return BS_FINISH_DONE;}if(s.last_lit){ /*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;} /***/}return BS_BLOCK_DONE;}","title":""},{"docid":"5d7872db686268234b3b8de34ff6a183","score":"0.6633814","text":"function deflate_fast(s,flush){var hash_head;/* head of the hash chain */var bflush;/* set if current block must be flushed */for(;;){/* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */if(s.lookahead<MIN_LOOKAHEAD){fill_window(s);if(s.lookahead<MIN_LOOKAHEAD&&flush===Z_NO_FLUSH){return BS_NEED_MORE;}if(s.lookahead===0){break;/* flush the current block */}}/* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */hash_head=0/*NIL*/;if(s.lookahead>=MIN_MATCH){/*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart;/***/}/* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */if(hash_head!==0/*NIL*/&&s.strstart-hash_head<=s.w_size-MIN_LOOKAHEAD){/* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */s.match_length=longest_match(s,hash_head);/* longest_match() sets match_start */}if(s.match_length>=MIN_MATCH){// check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n/*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/bflush=trees._tr_tally(s,s.strstart-s.match_start,s.match_length-MIN_MATCH);s.lookahead-=s.match_length;/* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */if(s.match_length<=s.max_lazy_match/*max_insert_length*/&&s.lookahead>=MIN_MATCH){s.match_length--;/* string at strstart already in table */do{s.strstart++;/*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart;/***//* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */}while(--s.match_length!==0);s.strstart++;}else{s.strstart+=s.match_length;s.match_length=0;s.ins_h=s.window[s.strstart];/* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+1])&s.hash_mask;//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n/* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */}}else{/* No match, output a literal byte *///Tracevv((stderr,\"%c\", s.window[s.strstart]));\n/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart]);s.lookahead--;s.strstart++;}if(bflush){/*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;}/***/}}s.insert=s.strstart<MIN_MATCH-1?s.strstart:MIN_MATCH-1;if(flush===Z_FINISH){/*** FLUSH_BLOCK(s, 1); ***/flush_block_only(s,true);if(s.strm.avail_out===0){return BS_FINISH_STARTED;}/***/return BS_FINISH_DONE;}if(s.last_lit){/*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;}/***/}return BS_BLOCK_DONE;}","title":""},{"docid":"b5875fcc8f56e56edd745939c1280af6","score":"0.66142404","text":"function deflate_slow(s,flush){var hash_head;/* head of hash chain */var bflush;/* set if current block must be flushed */var max_insert;/* Process the input block. */for(;;){/* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */if(s.lookahead<MIN_LOOKAHEAD){fill_window(s);if(s.lookahead<MIN_LOOKAHEAD&&flush===Z_NO_FLUSH){return BS_NEED_MORE;}if(s.lookahead===0){break;}/* flush the current block */}/* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */hash_head=0/*NIL*/;if(s.lookahead>=MIN_MATCH){/*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart;/***/}/* Find the longest match, discarding those <= prev_length.\n */s.prev_length=s.match_length;s.prev_match=s.match_start;s.match_length=MIN_MATCH-1;if(hash_head!==0/*NIL*/&&s.prev_length<s.max_lazy_match&&s.strstart-hash_head<=s.w_size-MIN_LOOKAHEAD/*MAX_DIST(s)*/){/* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */s.match_length=longest_match(s,hash_head);/* longest_match() sets match_start */if(s.match_length<=5&&(s.strategy===Z_FILTERED||s.match_length===MIN_MATCH&&s.strstart-s.match_start>4096/*TOO_FAR*/)){/* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */s.match_length=MIN_MATCH-1;}}/* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */if(s.prev_length>=MIN_MATCH&&s.match_length<=s.prev_length){max_insert=s.strstart+s.lookahead-MIN_MATCH;/* Do not insert strings in hash table beyond this. *///check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n/***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/bflush=trees._tr_tally(s,s.strstart-1-s.prev_match,s.prev_length-MIN_MATCH);/* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */s.lookahead-=s.prev_length-1;s.prev_length-=2;do{if(++s.strstart<=max_insert){/*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart;/***/}}while(--s.prev_length!==0);s.match_available=0;s.match_length=MIN_MATCH-1;s.strstart++;if(bflush){/*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;}/***/}}else if(s.match_available){/* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n *///Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart-1]);if(bflush){/*** FLUSH_BLOCK_ONLY(s, 0) ***/flush_block_only(s,false);/***/}s.strstart++;s.lookahead--;if(s.strm.avail_out===0){return BS_NEED_MORE;}}else{/* There is no previous match to compare with, wait for\n * the next step to decide.\n */s.match_available=1;s.strstart++;s.lookahead--;}}//Assert (flush != Z_NO_FLUSH, \"no flush?\");\nif(s.match_available){//Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart-1]);s.match_available=0;}s.insert=s.strstart<MIN_MATCH-1?s.strstart:MIN_MATCH-1;if(flush===Z_FINISH){/*** FLUSH_BLOCK(s, 1); ***/flush_block_only(s,true);if(s.strm.avail_out===0){return BS_FINISH_STARTED;}/***/return BS_FINISH_DONE;}if(s.last_lit){/*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;}/***/}return BS_BLOCK_DONE;}","title":""},{"docid":"8125726b1113cd09f1a3238db474c360","score":"0.6500689","text":"function compress_block(s,ltree,dtree)// deflate_state *s;\n// const ct_data *ltree; /* literal tree */\n// const ct_data *dtree; /* distance tree */\n{var dist;/* distance of matched string */var lc;/* match length or unmatched char (if dist == 0) */var lx=0;/* running index in l_buf */var code;/* the code to send */var extra;/* number of extra bits to send */if(s.last_lit!==0){do{dist=s.pending_buf[s.d_buf+lx*2]<<8|s.pending_buf[s.d_buf+lx*2+1];lc=s.pending_buf[s.l_buf+lx];lx++;if(dist===0){send_code(s,lc,ltree);/* send a literal byte *///Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n}else{/* Here, lc is the match length - MIN_MATCH */code=_length_code[lc];send_code(s,code+LITERALS+1,ltree);/* send the length code */extra=extra_lbits[code];if(extra!==0){lc-=base_length[code];send_bits(s,lc,extra);/* send the extra length bits */}dist--;/* dist is now the match distance - 1 */code=d_code(dist);//Assert (code < D_CODES, \"bad d_code\");\nsend_code(s,code,dtree);/* send the distance code */extra=extra_dbits[code];if(extra!==0){dist-=base_dist[code];send_bits(s,dist,extra);/* send the extra distance bits */}}/* literal or match pair ? *//* Check that the overlay between pending_buf and d_buf+l_buf is ok: *///Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n// \"pendingBuf overflow\");\n}while(lx<s.last_lit);}send_code(s,END_BLOCK,ltree);}","title":""},{"docid":"02ad2097d8fda0bb3c61d9d9eae4fb02","score":"0.6439615","text":"function deflate_slow(flush) {\n// short hash_head = 0; // head of hash chain\nvar hash_head = 0; // head of hash chain\nvar bflush; // set if current block must be flushed\nvar max_insert;\n// Process the input block.\nwhile (true) {\n// Make sure that we always have enough lookahead, except\n// at the end of the input file. We need MAX_MATCH bytes\n// for the next match, plus MIN_MATCH bytes to insert the\n// string following the next match.\nif (lookahead < MIN_LOOKAHEAD) {\nfill_window();\nif (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\nreturn NeedMore;\n}\nif (lookahead === 0)\nbreak; // flush the current block\n}\n// Insert the string window[strstart .. strstart+2] in the\n// dictionary, and set hash_head to the head of the hash chain:\nif (lookahead >= MIN_MATCH) {\nins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\n// prev[strstart&w_mask]=hash_head=head[ins_h];\nhash_head = (head[ins_h] & 0xffff);\nprev[strstart & w_mask] = head[ins_h];\nhead[ins_h] = strstart;\n}\n// Find the longest match, discarding those <= prev_length.\nprev_length = match_length;\nprev_match = match_start;\nmatch_length = MIN_MATCH - 1;\nif (hash_head !== 0 && prev_length < max_lazy_match && ((strstart - hash_head) & 0xffff) <= w_size - MIN_LOOKAHEAD) {\n// To simplify the code, we prevent matches with the string\n// of window index 0 (in particular we have to avoid a match\n// of the string with itself at the start of the input file).\nif (strategy != Z_HUFFMAN_ONLY) {\nmatch_length = longest_match(hash_head);\n}\n// longest_match() sets match_start\nif (match_length <= 5 && (strategy == Z_FILTERED || (match_length == MIN_MATCH && strstart - match_start > 4096))) {\n// If prev_match is also MIN_MATCH, match_start is garbage\n// but we will ignore the current match anyway.\nmatch_length = MIN_MATCH - 1;\n}\n}\n// If there was a match at the previous step and the current\n// match is not better, output the previous match:\nif (prev_length >= MIN_MATCH && match_length <= prev_length) {\nmax_insert = strstart + lookahead - MIN_MATCH;\n// Do not insert strings in hash table beyond this.\n// check_match(strstart-1, prev_match, prev_length);\nbflush = _tr_tally(strstart - 1 - prev_match, prev_length - MIN_MATCH);\n// Insert in hash table all strings up to the end of the match.\n// strstart-1 and strstart are already inserted. If there is not\n// enough lookahead, the last two strings are not inserted in\n// the hash table.\nlookahead -= prev_length - 1;\nprev_length -= 2;\ndo {\nif (++strstart <= max_insert) {\nins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\n// prev[strstart&w_mask]=hash_head=head[ins_h];\nhash_head = (head[ins_h] & 0xffff);\nprev[strstart & w_mask] = head[ins_h];\nhead[ins_h] = strstart;\n}\n} while (--prev_length !== 0);\nmatch_available = 0;\nmatch_length = MIN_MATCH - 1;\nstrstart++;\nif (bflush) {\nflush_block_only(false);\nif (strm.avail_out === 0)\nreturn NeedMore;\n}\n} else if (match_available !== 0) {\n// If there was no match at the previous position, output a\n// single literal. If there was a match but the current match\n// is longer, truncate the previous match to a single literal.\nbflush = _tr_tally(0, window[strstart - 1] & 0xff);\nif (bflush) {\nflush_block_only(false);\n}\nstrstart++;\nlookahead--;\nif (strm.avail_out === 0)\nreturn NeedMore;\n} else {\n// There is no previous match to compare with, wait for\n// the next step to decide.\nmatch_available = 1;\nstrstart++;\nlookahead--;\n}\n}\nif (match_available !== 0) {\nbflush = _tr_tally(0, window[strstart - 1] & 0xff);\nmatch_available = 0;\n}\nflush_block_only(flush == Z_FINISH);\nif (strm.avail_out === 0) {\nif (flush == Z_FINISH)\nreturn FinishStarted;\nelse\nreturn NeedMore;\n}\nreturn flush == Z_FINISH ? FinishDone : BlockDone;\n}","title":""},{"docid":"824d723e1c8f1cfe2e5878612d0e8085","score":"0.6399828","text":"function deflate_slow(s, flush) {\n\t var hash_head; /* head of hash chain */\n\t var bflush; /* set if current block must be flushed */\n\n\t var max_insert;\n\n\t /* Process the input block. */\n\t for (;;) {\n\t /* Make sure that we always have enough lookahead, except\n\t * at the end of the input file. We need MAX_MATCH bytes\n\t * for the next match, plus MIN_MATCH bytes to insert the\n\t * string following the next match.\n\t */\n\t if (s.lookahead < MIN_LOOKAHEAD) {\n\t fill_window(s);\n\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n\t return BS_NEED_MORE;\n\t }\n\t if (s.lookahead === 0) {\n\t break;\n\t } /* flush the current block */\n\t }\n\n\t /* Insert the string window[strstart .. strstart+2] in the\n\t * dictionary, and set hash_head to the head of the hash chain:\n\t */\n\t hash_head = 0 /*NIL*/;\n\t if (s.lookahead >= MIN_MATCH) {\n\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t s.head[s.ins_h] = s.strstart;\n\t /***/\n\t }\n\n\t /* Find the longest match, discarding those <= prev_length.\n\t */\n\t s.prev_length = s.match_length;\n\t s.prev_match = s.match_start;\n\t s.match_length = MIN_MATCH - 1;\n\n\t if (hash_head !== 0 /*NIL*/ && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD /*MAX_DIST(s)*/) {\n\t /* To simplify the code, we prevent matches with the string\n\t * of window index 0 (in particular we have to avoid a match\n\t * of the string with itself at the start of the input file).\n\t */\n\t s.match_length = longest_match(s, hash_head);\n\t /* longest_match() sets match_start */\n\n\t if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096 /*TOO_FAR*/)) {\n\n\t /* If prev_match is also MIN_MATCH, match_start is garbage\n\t * but we will ignore the current match anyway.\n\t */\n\t s.match_length = MIN_MATCH - 1;\n\t }\n\t }\n\t /* If there was a match at the previous step and the current\n\t * match is not better, output the previous match:\n\t */\n\t if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n\t max_insert = s.strstart + s.lookahead - MIN_MATCH;\n\t /* Do not insert strings in hash table beyond this. */\n\n\t //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n\t /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n\t s.prev_length - MIN_MATCH, bflush);***/\n\t bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n\t /* Insert in hash table all strings up to the end of the match.\n\t * strstart-1 and strstart are already inserted. If there is not\n\t * enough lookahead, the last two strings are not inserted in\n\t * the hash table.\n\t */\n\t s.lookahead -= s.prev_length - 1;\n\t s.prev_length -= 2;\n\t do {\n\t if (++s.strstart <= max_insert) {\n\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t s.head[s.ins_h] = s.strstart;\n\t /***/\n\t }\n\t } while (--s.prev_length !== 0);\n\t s.match_available = 0;\n\t s.match_length = MIN_MATCH - 1;\n\t s.strstart++;\n\n\t if (bflush) {\n\t /*** FLUSH_BLOCK(s, 0); ***/\n\t flush_block_only(s, false);\n\t if (s.strm.avail_out === 0) {\n\t return BS_NEED_MORE;\n\t }\n\t /***/\n\t }\n\t } else if (s.match_available) {\n\t /* If there was no match at the previous position, output a\n\t * single literal. If there was a match but the current match\n\t * is longer, truncate the previous match to a single literal.\n\t */\n\t //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n\t if (bflush) {\n\t /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n\t flush_block_only(s, false);\n\t /***/\n\t }\n\t s.strstart++;\n\t s.lookahead--;\n\t if (s.strm.avail_out === 0) {\n\t return BS_NEED_MORE;\n\t }\n\t } else {\n\t /* There is no previous match to compare with, wait for\n\t * the next step to decide.\n\t */\n\t s.match_available = 1;\n\t s.strstart++;\n\t s.lookahead--;\n\t }\n\t }\n\t //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n\t if (s.match_available) {\n\t //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n\t s.match_available = 0;\n\t }\n\t s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n\t if (flush === Z_FINISH) {\n\t /*** FLUSH_BLOCK(s, 1); ***/\n\t flush_block_only(s, true);\n\t if (s.strm.avail_out === 0) {\n\t return BS_FINISH_STARTED;\n\t }\n\t /***/\n\t return BS_FINISH_DONE;\n\t }\n\t if (s.last_lit) {\n\t /*** FLUSH_BLOCK(s, 0); ***/\n\t flush_block_only(s, false);\n\t if (s.strm.avail_out === 0) {\n\t return BS_NEED_MORE;\n\t }\n\t /***/\n\t }\n\n\t return BS_BLOCK_DONE;\n\t }","title":""},{"docid":"f104070965e8adc0fb83ca6b1a32878b","score":"0.63928217","text":"function deflate_fast(flush) {\n// short hash_head = 0; // head of the hash chain\nvar hash_head = 0; // head of the hash chain\nvar bflush; // set if current block must be flushed\nwhile (true) {\n// Make sure that we always have enough lookahead, except\n// at the end of the input file. We need MAX_MATCH bytes\n// for the next match, plus MIN_MATCH bytes to insert the\n// string following the next match.\nif (lookahead < MIN_LOOKAHEAD) {\nfill_window();\nif (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\nreturn NeedMore;\n}\nif (lookahead === 0)\nbreak; // flush the current block\n}\n// Insert the string window[strstart .. strstart+2] in the\n// dictionary, and set hash_head to the head of the hash chain:\nif (lookahead >= MIN_MATCH) {\nins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\n// prev[strstart&w_mask]=hash_head=head[ins_h];\nhash_head = (head[ins_h] & 0xffff);\nprev[strstart & w_mask] = head[ins_h];\nhead[ins_h] = strstart;\n}\n// Find the longest match, discarding those <= prev_length.\n// At this point we have always match_length < MIN_MATCH\nif (hash_head !== 0 && ((strstart - hash_head) & 0xffff) <= w_size - MIN_LOOKAHEAD) {\n// To simplify the code, we prevent matches with the string\n// of window index 0 (in particular we have to avoid a match\n// of the string with itself at the start of the input file).\nif (strategy != Z_HUFFMAN_ONLY) {\nmatch_length = longest_match(hash_head);\n}\n// longest_match() sets match_start\n}\nif (match_length >= MIN_MATCH) {\n// check_match(strstart, match_start, match_length);\nbflush = _tr_tally(strstart - match_start, match_length - MIN_MATCH);\nlookahead -= match_length;\n// Insert new strings in the hash table only if the match length\n// is not too large. This saves time but degrades compression.\nif (match_length <= max_lazy_match && lookahead >= MIN_MATCH) {\nmatch_length--; // string at strstart already in hash table\ndo {\nstrstart++;\nins_h = ((ins_h << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\n// prev[strstart&w_mask]=hash_head=head[ins_h];\nhash_head = (head[ins_h] & 0xffff);\nprev[strstart & w_mask] = head[ins_h];\nhead[ins_h] = strstart;\n// strstart never exceeds WSIZE-MAX_MATCH, so there are\n// always MIN_MATCH bytes ahead.\n} while (--match_length !== 0);\nstrstart++;\n} else {\nstrstart += match_length;\nmatch_length = 0;\nins_h = window[strstart] & 0xff;\nins_h = (((ins_h) << hash_shift) ^ (window[strstart + 1] & 0xff)) & hash_mask;\n// If lookahead < MIN_MATCH, ins_h is garbage, but it does\n// not\n// matter since it will be recomputed at next deflate call.\n}\n} else {\n// No match, output a literal byte\nbflush = _tr_tally(0, window[strstart] & 0xff);\nlookahead--;\nstrstart++;\n}\nif (bflush) {\nflush_block_only(false);\nif (strm.avail_out === 0)\nreturn NeedMore;\n}\n}\nflush_block_only(flush == Z_FINISH);\nif (strm.avail_out === 0) {\nif (flush == Z_FINISH)\nreturn FinishStarted;\nelse\nreturn NeedMore;\n}\nreturn flush == Z_FINISH ? FinishDone : BlockDone;\n}","title":""},{"docid":"00c4b65a8a31f003603939c3ba135484","score":"0.6382474","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break;\n } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0 /*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0 /*NIL*/ && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD /*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096 /*TOO_FAR*/)) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"262d13b90e64cf7b2022cded1d827cd0","score":"0.63665056","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break;\n } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0;\n /*NIL*/if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0 /*NIL*/ && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD /*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096 /*TOO_FAR*/)) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"16452f6a746aec50b194579bcf75b70a","score":"0.63631576","text":"function deflate_slow(s, flush) {\n\t\t var hash_head; /* head of hash chain */\n\t\t var bflush; /* set if current block must be flushed */\n\n\t\t var max_insert;\n\n\t\t /* Process the input block. */\n\t\t for (;;) {\n\t\t /* Make sure that we always have enough lookahead, except\n\t\t * at the end of the input file. We need MAX_MATCH bytes\n\t\t * for the next match, plus MIN_MATCH bytes to insert the\n\t\t * string following the next match.\n\t\t */\n\t\t if (s.lookahead < MIN_LOOKAHEAD) {\n\t\t fill_window(s);\n\t\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n\t\t return BS_NEED_MORE;\n\t\t }\n\t\t if (s.lookahead === 0) { break; } /* flush the current block */\n\t\t }\n\n\t\t /* Insert the string window[strstart .. strstart+2] in the\n\t\t * dictionary, and set hash_head to the head of the hash chain:\n\t\t */\n\t\t hash_head = 0/*NIL*/;\n\t\t if (s.lookahead >= MIN_MATCH) {\n\t\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t\t s.head[s.ins_h] = s.strstart;\n\t\t /***/\n\t\t }\n\n\t\t /* Find the longest match, discarding those <= prev_length.\n\t\t */\n\t\t s.prev_length = s.match_length;\n\t\t s.prev_match = s.match_start;\n\t\t s.match_length = MIN_MATCH - 1;\n\n\t\t if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n\t\t s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n\t\t /* To simplify the code, we prevent matches with the string\n\t\t * of window index 0 (in particular we have to avoid a match\n\t\t * of the string with itself at the start of the input file).\n\t\t */\n\t\t s.match_length = longest_match(s, hash_head);\n\t\t /* longest_match() sets match_start */\n\n\t\t if (s.match_length <= 5 &&\n\t\t (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n\t\t /* If prev_match is also MIN_MATCH, match_start is garbage\n\t\t * but we will ignore the current match anyway.\n\t\t */\n\t\t s.match_length = MIN_MATCH - 1;\n\t\t }\n\t\t }\n\t\t /* If there was a match at the previous step and the current\n\t\t * match is not better, output the previous match:\n\t\t */\n\t\t if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n\t\t max_insert = s.strstart + s.lookahead - MIN_MATCH;\n\t\t /* Do not insert strings in hash table beyond this. */\n\n\t\t //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n\t\t /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n\t\t s.prev_length - MIN_MATCH, bflush);***/\n\t\t bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n\t\t /* Insert in hash table all strings up to the end of the match.\n\t\t * strstart-1 and strstart are already inserted. If there is not\n\t\t * enough lookahead, the last two strings are not inserted in\n\t\t * the hash table.\n\t\t */\n\t\t s.lookahead -= s.prev_length - 1;\n\t\t s.prev_length -= 2;\n\t\t do {\n\t\t if (++s.strstart <= max_insert) {\n\t\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t\t s.head[s.ins_h] = s.strstart;\n\t\t /***/\n\t\t }\n\t\t } while (--s.prev_length !== 0);\n\t\t s.match_available = 0;\n\t\t s.match_length = MIN_MATCH - 1;\n\t\t s.strstart++;\n\n\t\t if (bflush) {\n\t\t /*** FLUSH_BLOCK(s, 0); ***/\n\t\t flush_block_only(s, false);\n\t\t if (s.strm.avail_out === 0) {\n\t\t return BS_NEED_MORE;\n\t\t }\n\t\t /***/\n\t\t }\n\n\t\t } else if (s.match_available) {\n\t\t /* If there was no match at the previous position, output a\n\t\t * single literal. If there was a match but the current match\n\t\t * is longer, truncate the previous match to a single literal.\n\t\t */\n\t\t //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n\t\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n\t\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n\t\t if (bflush) {\n\t\t /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n\t\t flush_block_only(s, false);\n\t\t /***/\n\t\t }\n\t\t s.strstart++;\n\t\t s.lookahead--;\n\t\t if (s.strm.avail_out === 0) {\n\t\t return BS_NEED_MORE;\n\t\t }\n\t\t } else {\n\t\t /* There is no previous match to compare with, wait for\n\t\t * the next step to decide.\n\t\t */\n\t\t s.match_available = 1;\n\t\t s.strstart++;\n\t\t s.lookahead--;\n\t\t }\n\t\t }\n\t\t //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n\t\t if (s.match_available) {\n\t\t //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n\t\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n\t\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n\t\t s.match_available = 0;\n\t\t }\n\t\t s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n\t\t if (flush === Z_FINISH) {\n\t\t /*** FLUSH_BLOCK(s, 1); ***/\n\t\t flush_block_only(s, true);\n\t\t if (s.strm.avail_out === 0) {\n\t\t return BS_FINISH_STARTED;\n\t\t }\n\t\t /***/\n\t\t return BS_FINISH_DONE;\n\t\t }\n\t\t if (s.last_lit) {\n\t\t /*** FLUSH_BLOCK(s, 0); ***/\n\t\t flush_block_only(s, false);\n\t\t if (s.strm.avail_out === 0) {\n\t\t return BS_NEED_MORE;\n\t\t }\n\t\t /***/\n\t\t }\n\n\t\t return BS_BLOCK_DONE;\n\t\t}","title":""},{"docid":"e89c6eb7fa181cff76630a939a0dfc1d","score":"0.6344129","text":"function deflate_fast(s, flush) {\n\t\t var hash_head; /* head of the hash chain */\n\t\t var bflush; /* set if current block must be flushed */\n\n\t\t for (;;) {\n\t\t /* Make sure that we always have enough lookahead, except\n\t\t * at the end of the input file. We need MAX_MATCH bytes\n\t\t * for the next match, plus MIN_MATCH bytes to insert the\n\t\t * string following the next match.\n\t\t */\n\t\t if (s.lookahead < MIN_LOOKAHEAD) {\n\t\t fill_window(s);\n\t\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n\t\t return BS_NEED_MORE;\n\t\t }\n\t\t if (s.lookahead === 0) {\n\t\t break; /* flush the current block */\n\t\t }\n\t\t }\n\n\t\t /* Insert the string window[strstart .. strstart+2] in the\n\t\t * dictionary, and set hash_head to the head of the hash chain:\n\t\t */\n\t\t hash_head = 0/*NIL*/;\n\t\t if (s.lookahead >= MIN_MATCH) {\n\t\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t\t s.head[s.ins_h] = s.strstart;\n\t\t /***/\n\t\t }\n\n\t\t /* Find the longest match, discarding those <= prev_length.\n\t\t * At this point we have always match_length < MIN_MATCH\n\t\t */\n\t\t if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n\t\t /* To simplify the code, we prevent matches with the string\n\t\t * of window index 0 (in particular we have to avoid a match\n\t\t * of the string with itself at the start of the input file).\n\t\t */\n\t\t s.match_length = longest_match(s, hash_head);\n\t\t /* longest_match() sets match_start */\n\t\t }\n\t\t if (s.match_length >= MIN_MATCH) {\n\t\t // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n\t\t /*** _tr_tally_dist(s, s.strstart - s.match_start,\n\t\t s.match_length - MIN_MATCH, bflush); ***/\n\t\t bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n\t\t s.lookahead -= s.match_length;\n\n\t\t /* Insert new strings in the hash table only if the match length\n\t\t * is not too large. This saves time but degrades compression.\n\t\t */\n\t\t if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n\t\t s.match_length--; /* string at strstart already in table */\n\t\t do {\n\t\t s.strstart++;\n\t\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t\t s.head[s.ins_h] = s.strstart;\n\t\t /***/\n\t\t /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n\t\t * always MIN_MATCH bytes ahead.\n\t\t */\n\t\t } while (--s.match_length !== 0);\n\t\t s.strstart++;\n\t\t } else\n\t\t {\n\t\t s.strstart += s.match_length;\n\t\t s.match_length = 0;\n\t\t s.ins_h = s.window[s.strstart];\n\t\t /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n\t\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n\t\t//#if MIN_MATCH != 3\n\t\t// Call UPDATE_HASH() MIN_MATCH-3 more times\n\t\t//#endif\n\t\t /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n\t\t * matter since it will be recomputed at next deflate call.\n\t\t */\n\t\t }\n\t\t } else {\n\t\t /* No match, output a literal byte */\n\t\t //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n\t\t /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n\t\t bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n\t\t s.lookahead--;\n\t\t s.strstart++;\n\t\t }\n\t\t if (bflush) {\n\t\t /*** FLUSH_BLOCK(s, 0); ***/\n\t\t flush_block_only(s, false);\n\t\t if (s.strm.avail_out === 0) {\n\t\t return BS_NEED_MORE;\n\t\t }\n\t\t /***/\n\t\t }\n\t\t }\n\t\t s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n\t\t if (flush === Z_FINISH) {\n\t\t /*** FLUSH_BLOCK(s, 1); ***/\n\t\t flush_block_only(s, true);\n\t\t if (s.strm.avail_out === 0) {\n\t\t return BS_FINISH_STARTED;\n\t\t }\n\t\t /***/\n\t\t return BS_FINISH_DONE;\n\t\t }\n\t\t if (s.last_lit) {\n\t\t /*** FLUSH_BLOCK(s, 0); ***/\n\t\t flush_block_only(s, false);\n\t\t if (s.strm.avail_out === 0) {\n\t\t return BS_NEED_MORE;\n\t\t }\n\t\t /***/\n\t\t }\n\t\t return BS_BLOCK_DONE;\n\t\t}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"9dbb01b7ec6bbf50aa40f009c8713dba","score":"0.63382655","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"c7a79b6c8b430c2f1a9dd4a1a7b61be7","score":"0.6337994","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"ec097776686cb5e94c81cb386fc378c1","score":"0.6335972","text":"function deflate_slow(flush) {\n\t\t\t// short hash_head = 0; // head of hash chain\n\t\t\tvar hash_head = 0; // head of hash chain\n\t\t\tvar bflush; // set if current block must be flushed\n\t\t\tvar max_insert;\n\n\t\t\t// Process the input block.\n\t\t\twhile (true) {\n\t\t\t\t// Make sure that we always have enough lookahead, except\n\t\t\t\t// at the end of the input file. We need MAX_MATCH bytes\n\t\t\t\t// for the next match, plus MIN_MATCH bytes to insert the\n\t\t\t\t// string following the next match.\n\n\t\t\t\tif (lookahead < MIN_LOOKAHEAD) {\n\t\t\t\t\tfill_window();\n\t\t\t\t\tif (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\n\t\t\t\t\t\treturn NeedMore;\n\t\t\t\t\t}\n\t\t\t\t\tif (lookahead === 0)\n\t\t\t\t\t\tbreak; // flush the current block\n\t\t\t\t}\n\n\t\t\t\t// Insert the string window[strstart .. strstart+2] in the\n\t\t\t\t// dictionary, and set hash_head to the head of the hash chain:\n\n\t\t\t\tif (lookahead >= MIN_MATCH) {\n\t\t\t\t\tins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\n\t\t\t\t\t// prev[strstart&w_mask]=hash_head=head[ins_h];\n\t\t\t\t\thash_head = (head[ins_h] & 0xffff);\n\t\t\t\t\tprev[strstart & w_mask] = head[ins_h];\n\t\t\t\t\thead[ins_h] = strstart;\n\t\t\t\t}\n\n\t\t\t\t// Find the longest match, discarding those <= prev_length.\n\t\t\t\tprev_length = match_length;\n\t\t\t\tprev_match = match_start;\n\t\t\t\tmatch_length = MIN_MATCH - 1;\n\n\t\t\t\tif (hash_head !== 0 && prev_length < max_lazy_match && ((strstart - hash_head) & 0xffff) <= w_size - MIN_LOOKAHEAD) {\n\t\t\t\t\t// To simplify the code, we prevent matches with the string\n\t\t\t\t\t// of window index 0 (in particular we have to avoid a match\n\t\t\t\t\t// of the string with itself at the start of the input file).\n\n\t\t\t\t\tif (strategy != Z_HUFFMAN_ONLY) {\n\t\t\t\t\t\tmatch_length = longest_match(hash_head);\n\t\t\t\t\t}\n\t\t\t\t\t// longest_match() sets match_start\n\n\t\t\t\t\tif (match_length <= 5 && (strategy == Z_FILTERED || (match_length == MIN_MATCH && strstart - match_start > 4096))) {\n\n\t\t\t\t\t\t// If prev_match is also MIN_MATCH, match_start is garbage\n\t\t\t\t\t\t// but we will ignore the current match anyway.\n\t\t\t\t\t\tmatch_length = MIN_MATCH - 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// If there was a match at the previous step and the current\n\t\t\t\t// match is not better, output the previous match:\n\t\t\t\tif (prev_length >= MIN_MATCH && match_length <= prev_length) {\n\t\t\t\t\tmax_insert = strstart + lookahead - MIN_MATCH;\n\t\t\t\t\t// Do not insert strings in hash table beyond this.\n\n\t\t\t\t\t// check_match(strstart-1, prev_match, prev_length);\n\n\t\t\t\t\tbflush = _tr_tally(strstart - 1 - prev_match, prev_length - MIN_MATCH);\n\n\t\t\t\t\t// Insert in hash table all strings up to the end of the match.\n\t\t\t\t\t// strstart-1 and strstart are already inserted. If there is not\n\t\t\t\t\t// enough lookahead, the last two strings are not inserted in\n\t\t\t\t\t// the hash table.\n\t\t\t\t\tlookahead -= prev_length - 1;\n\t\t\t\t\tprev_length -= 2;\n\t\t\t\t\tdo {\n\t\t\t\t\t\tif (++strstart <= max_insert) {\n\t\t\t\t\t\t\tins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\n\t\t\t\t\t\t\t// prev[strstart&w_mask]=hash_head=head[ins_h];\n\t\t\t\t\t\t\thash_head = (head[ins_h] & 0xffff);\n\t\t\t\t\t\t\tprev[strstart & w_mask] = head[ins_h];\n\t\t\t\t\t\t\thead[ins_h] = strstart;\n\t\t\t\t\t\t}\n\t\t\t\t\t} while (--prev_length !== 0);\n\t\t\t\t\tmatch_available = 0;\n\t\t\t\t\tmatch_length = MIN_MATCH - 1;\n\t\t\t\t\tstrstart++;\n\n\t\t\t\t\tif (bflush) {\n\t\t\t\t\t\tflush_block_only(false);\n\t\t\t\t\t\tif (strm.avail_out === 0)\n\t\t\t\t\t\t\treturn NeedMore;\n\t\t\t\t\t}\n\t\t\t\t} else if (match_available !== 0) {\n\n\t\t\t\t\t// If there was no match at the previous position, output a\n\t\t\t\t\t// single literal. If there was a match but the current match\n\t\t\t\t\t// is longer, truncate the previous match to a single literal.\n\n\t\t\t\t\tbflush = _tr_tally(0, window[strstart - 1] & 0xff);\n\n\t\t\t\t\tif (bflush) {\n\t\t\t\t\t\tflush_block_only(false);\n\t\t\t\t\t}\n\t\t\t\t\tstrstart++;\n\t\t\t\t\tlookahead--;\n\t\t\t\t\tif (strm.avail_out === 0)\n\t\t\t\t\t\treturn NeedMore;\n\t\t\t\t} else {\n\t\t\t\t\t// There is no previous match to compare with, wait for\n\t\t\t\t\t// the next step to decide.\n\n\t\t\t\t\tmatch_available = 1;\n\t\t\t\t\tstrstart++;\n\t\t\t\t\tlookahead--;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (match_available !== 0) {\n\t\t\t\tbflush = _tr_tally(0, window[strstart - 1] & 0xff);\n\t\t\t\tmatch_available = 0;\n\t\t\t}\n\t\t\tflush_block_only(flush == Z_FINISH);\n\n\t\t\tif (strm.avail_out === 0) {\n\t\t\t\tif (flush == Z_FINISH)\n\t\t\t\t\treturn FinishStarted;\n\t\t\t\telse\n\t\t\t\t\treturn NeedMore;\n\t\t\t}\n\n\t\t\treturn flush == Z_FINISH ? FinishDone : BlockDone;\n\t\t}","title":""},{"docid":"81f958b4900f67c6970f36348777661d","score":"0.63294035","text":"function deflate_slow(s, flush) {\r\n var hash_head; /* head of hash chain */\r\n var bflush; /* set if current block must be flushed */\r\n\r\n var max_insert;\r\n\r\n /* Process the input block. */\r\n for (;;) {\r\n /* Make sure that we always have enough lookahead, except\r\n * at the end of the input file. We need MAX_MATCH bytes\r\n * for the next match, plus MIN_MATCH bytes to insert the\r\n * string following the next match.\r\n */\r\n if (s.lookahead < MIN_LOOKAHEAD) {\r\n fill_window(s);\r\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\r\n return BS_NEED_MORE;\r\n }\r\n if (s.lookahead === 0) { break; } /* flush the current block */\r\n }\r\n\r\n /* Insert the string window[strstart .. strstart+2] in the\r\n * dictionary, and set hash_head to the head of the hash chain:\r\n */\r\n hash_head = 0/*NIL*/;\r\n if (s.lookahead >= MIN_MATCH) {\r\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\r\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\r\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\r\n s.head[s.ins_h] = s.strstart;\r\n /***/\r\n }\r\n\r\n /* Find the longest match, discarding those <= prev_length.\r\n */\r\n s.prev_length = s.match_length;\r\n s.prev_match = s.match_start;\r\n s.match_length = MIN_MATCH - 1;\r\n\r\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\r\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\r\n /* To simplify the code, we prevent matches with the string\r\n * of window index 0 (in particular we have to avoid a match\r\n * of the string with itself at the start of the input file).\r\n */\r\n s.match_length = longest_match(s, hash_head);\r\n /* longest_match() sets match_start */\r\n\r\n if (s.match_length <= 5 &&\r\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\r\n\r\n /* If prev_match is also MIN_MATCH, match_start is garbage\r\n * but we will ignore the current match anyway.\r\n */\r\n s.match_length = MIN_MATCH - 1;\r\n }\r\n }\r\n /* If there was a match at the previous step and the current\r\n * match is not better, output the previous match:\r\n */\r\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\r\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\r\n /* Do not insert strings in hash table beyond this. */\r\n\r\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\r\n\r\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\r\n s.prev_length - MIN_MATCH, bflush);***/\r\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\r\n /* Insert in hash table all strings up to the end of the match.\r\n * strstart-1 and strstart are already inserted. If there is not\r\n * enough lookahead, the last two strings are not inserted in\r\n * the hash table.\r\n */\r\n s.lookahead -= s.prev_length - 1;\r\n s.prev_length -= 2;\r\n do {\r\n if (++s.strstart <= max_insert) {\r\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\r\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\r\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\r\n s.head[s.ins_h] = s.strstart;\r\n /***/\r\n }\r\n } while (--s.prev_length !== 0);\r\n s.match_available = 0;\r\n s.match_length = MIN_MATCH - 1;\r\n s.strstart++;\r\n\r\n if (bflush) {\r\n /*** FLUSH_BLOCK(s, 0); ***/\r\n flush_block_only(s, false);\r\n if (s.strm.avail_out === 0) {\r\n return BS_NEED_MORE;\r\n }\r\n /***/\r\n }\r\n\r\n } else if (s.match_available) {\r\n /* If there was no match at the previous position, output a\r\n * single literal. If there was a match but the current match\r\n * is longer, truncate the previous match to a single literal.\r\n */\r\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\r\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\r\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\r\n\r\n if (bflush) {\r\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\r\n flush_block_only(s, false);\r\n /***/\r\n }\r\n s.strstart++;\r\n s.lookahead--;\r\n if (s.strm.avail_out === 0) {\r\n return BS_NEED_MORE;\r\n }\r\n } else {\r\n /* There is no previous match to compare with, wait for\r\n * the next step to decide.\r\n */\r\n s.match_available = 1;\r\n s.strstart++;\r\n s.lookahead--;\r\n }\r\n }\r\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\r\n if (s.match_available) {\r\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\r\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\r\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\r\n\r\n s.match_available = 0;\r\n }\r\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\r\n if (flush === Z_FINISH) {\r\n /*** FLUSH_BLOCK(s, 1); ***/\r\n flush_block_only(s, true);\r\n if (s.strm.avail_out === 0) {\r\n return BS_FINISH_STARTED;\r\n }\r\n /***/\r\n return BS_FINISH_DONE;\r\n }\r\n if (s.last_lit) {\r\n /*** FLUSH_BLOCK(s, 0); ***/\r\n flush_block_only(s, false);\r\n if (s.strm.avail_out === 0) {\r\n return BS_NEED_MORE;\r\n }\r\n /***/\r\n }\r\n\r\n return BS_BLOCK_DONE;\r\n}","title":""},{"docid":"81f958b4900f67c6970f36348777661d","score":"0.63294035","text":"function deflate_slow(s, flush) {\r\n var hash_head; /* head of hash chain */\r\n var bflush; /* set if current block must be flushed */\r\n\r\n var max_insert;\r\n\r\n /* Process the input block. */\r\n for (;;) {\r\n /* Make sure that we always have enough lookahead, except\r\n * at the end of the input file. We need MAX_MATCH bytes\r\n * for the next match, plus MIN_MATCH bytes to insert the\r\n * string following the next match.\r\n */\r\n if (s.lookahead < MIN_LOOKAHEAD) {\r\n fill_window(s);\r\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\r\n return BS_NEED_MORE;\r\n }\r\n if (s.lookahead === 0) { break; } /* flush the current block */\r\n }\r\n\r\n /* Insert the string window[strstart .. strstart+2] in the\r\n * dictionary, and set hash_head to the head of the hash chain:\r\n */\r\n hash_head = 0/*NIL*/;\r\n if (s.lookahead >= MIN_MATCH) {\r\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\r\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\r\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\r\n s.head[s.ins_h] = s.strstart;\r\n /***/\r\n }\r\n\r\n /* Find the longest match, discarding those <= prev_length.\r\n */\r\n s.prev_length = s.match_length;\r\n s.prev_match = s.match_start;\r\n s.match_length = MIN_MATCH - 1;\r\n\r\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\r\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\r\n /* To simplify the code, we prevent matches with the string\r\n * of window index 0 (in particular we have to avoid a match\r\n * of the string with itself at the start of the input file).\r\n */\r\n s.match_length = longest_match(s, hash_head);\r\n /* longest_match() sets match_start */\r\n\r\n if (s.match_length <= 5 &&\r\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\r\n\r\n /* If prev_match is also MIN_MATCH, match_start is garbage\r\n * but we will ignore the current match anyway.\r\n */\r\n s.match_length = MIN_MATCH - 1;\r\n }\r\n }\r\n /* If there was a match at the previous step and the current\r\n * match is not better, output the previous match:\r\n */\r\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\r\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\r\n /* Do not insert strings in hash table beyond this. */\r\n\r\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\r\n\r\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\r\n s.prev_length - MIN_MATCH, bflush);***/\r\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\r\n /* Insert in hash table all strings up to the end of the match.\r\n * strstart-1 and strstart are already inserted. If there is not\r\n * enough lookahead, the last two strings are not inserted in\r\n * the hash table.\r\n */\r\n s.lookahead -= s.prev_length - 1;\r\n s.prev_length -= 2;\r\n do {\r\n if (++s.strstart <= max_insert) {\r\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\r\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\r\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\r\n s.head[s.ins_h] = s.strstart;\r\n /***/\r\n }\r\n } while (--s.prev_length !== 0);\r\n s.match_available = 0;\r\n s.match_length = MIN_MATCH - 1;\r\n s.strstart++;\r\n\r\n if (bflush) {\r\n /*** FLUSH_BLOCK(s, 0); ***/\r\n flush_block_only(s, false);\r\n if (s.strm.avail_out === 0) {\r\n return BS_NEED_MORE;\r\n }\r\n /***/\r\n }\r\n\r\n } else if (s.match_available) {\r\n /* If there was no match at the previous position, output a\r\n * single literal. If there was a match but the current match\r\n * is longer, truncate the previous match to a single literal.\r\n */\r\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\r\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\r\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\r\n\r\n if (bflush) {\r\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\r\n flush_block_only(s, false);\r\n /***/\r\n }\r\n s.strstart++;\r\n s.lookahead--;\r\n if (s.strm.avail_out === 0) {\r\n return BS_NEED_MORE;\r\n }\r\n } else {\r\n /* There is no previous match to compare with, wait for\r\n * the next step to decide.\r\n */\r\n s.match_available = 1;\r\n s.strstart++;\r\n s.lookahead--;\r\n }\r\n }\r\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\r\n if (s.match_available) {\r\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\r\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\r\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\r\n\r\n s.match_available = 0;\r\n }\r\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\r\n if (flush === Z_FINISH) {\r\n /*** FLUSH_BLOCK(s, 1); ***/\r\n flush_block_only(s, true);\r\n if (s.strm.avail_out === 0) {\r\n return BS_FINISH_STARTED;\r\n }\r\n /***/\r\n return BS_FINISH_DONE;\r\n }\r\n if (s.last_lit) {\r\n /*** FLUSH_BLOCK(s, 0); ***/\r\n flush_block_only(s, false);\r\n if (s.strm.avail_out === 0) {\r\n return BS_NEED_MORE;\r\n }\r\n /***/\r\n }\r\n\r\n return BS_BLOCK_DONE;\r\n}","title":""},{"docid":"55ea0bda49ce789b47f12f6c122f1cef","score":"0.6320948","text":"function deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$1) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH$2) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"cc25e8accda80aec5d2da86ceb181ae4","score":"0.63184196","text":"function deflate_fast(s, flush) {\n\t var hash_head; /* head of the hash chain */\n\t var bflush; /* set if current block must be flushed */\n\n\t for (;;) {\n\t /* Make sure that we always have enough lookahead, except\n\t * at the end of the input file. We need MAX_MATCH bytes\n\t * for the next match, plus MIN_MATCH bytes to insert the\n\t * string following the next match.\n\t */\n\t if (s.lookahead < MIN_LOOKAHEAD) {\n\t fill_window(s);\n\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n\t return BS_NEED_MORE;\n\t }\n\t if (s.lookahead === 0) {\n\t break; /* flush the current block */\n\t }\n\t }\n\n\t /* Insert the string window[strstart .. strstart+2] in the\n\t * dictionary, and set hash_head to the head of the hash chain:\n\t */\n\t hash_head = 0 /*NIL*/;\n\t if (s.lookahead >= MIN_MATCH) {\n\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t s.head[s.ins_h] = s.strstart;\n\t /***/\n\t }\n\n\t /* Find the longest match, discarding those <= prev_length.\n\t * At this point we have always match_length < MIN_MATCH\n\t */\n\t if (hash_head !== 0 /*NIL*/ && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) {\n\t /* To simplify the code, we prevent matches with the string\n\t * of window index 0 (in particular we have to avoid a match\n\t * of the string with itself at the start of the input file).\n\t */\n\t s.match_length = longest_match(s, hash_head);\n\t /* longest_match() sets match_start */\n\t }\n\t if (s.match_length >= MIN_MATCH) {\n\t // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n\t /*** _tr_tally_dist(s, s.strstart - s.match_start,\n\t s.match_length - MIN_MATCH, bflush); ***/\n\t bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n\t s.lookahead -= s.match_length;\n\n\t /* Insert new strings in the hash table only if the match length\n\t * is not too large. This saves time but degrades compression.\n\t */\n\t if (s.match_length <= s.max_lazy_match /*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n\t s.match_length--; /* string at strstart already in table */\n\t do {\n\t s.strstart++;\n\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t s.head[s.ins_h] = s.strstart;\n\t /***/\n\t /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n\t * always MIN_MATCH bytes ahead.\n\t */\n\t } while (--s.match_length !== 0);\n\t s.strstart++;\n\t } else {\n\t s.strstart += s.match_length;\n\t s.match_length = 0;\n\t s.ins_h = s.window[s.strstart];\n\t /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n\t s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n\t //#if MIN_MATCH != 3\n\t // Call UPDATE_HASH() MIN_MATCH-3 more times\n\t //#endif\n\t /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n\t * matter since it will be recomputed at next deflate call.\n\t */\n\t }\n\t } else {\n\t /* No match, output a literal byte */\n\t //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n\t /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n\t bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n\t s.lookahead--;\n\t s.strstart++;\n\t }\n\t if (bflush) {\n\t /*** FLUSH_BLOCK(s, 0); ***/\n\t flush_block_only(s, false);\n\t if (s.strm.avail_out === 0) {\n\t return BS_NEED_MORE;\n\t }\n\t /***/\n\t }\n\t }\n\t s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n\t if (flush === Z_FINISH) {\n\t /*** FLUSH_BLOCK(s, 1); ***/\n\t flush_block_only(s, true);\n\t if (s.strm.avail_out === 0) {\n\t return BS_FINISH_STARTED;\n\t }\n\t /***/\n\t return BS_FINISH_DONE;\n\t }\n\t if (s.last_lit) {\n\t /*** FLUSH_BLOCK(s, 0); ***/\n\t flush_block_only(s, false);\n\t if (s.strm.avail_out === 0) {\n\t return BS_NEED_MORE;\n\t }\n\t /***/\n\t }\n\t return BS_BLOCK_DONE;\n\t }","title":""},{"docid":"6437fc7decc81947736637e9566d36f0","score":"0.63000244","text":"function deflate_fast(s, flush) {\n var hash_head; /* head of the hash chain */\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0 /*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0 /*NIL*/ && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (s.match_length <= s.max_lazy_match /*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n //#if MIN_MATCH != 3\n // Call UPDATE_HASH() MIN_MATCH-3 more times\n //#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"68c2db5c656aff886897f63838a6ed2e","score":"0.6284709","text":"function compress_block(s,ltree,dtree) // deflate_state *s;\n // const ct_data *ltree; /* literal tree */\n // const ct_data *dtree; /* distance tree */\n {var dist; /* distance of matched string */var lc; /* match length or unmatched char (if dist == 0) */var lx=0; /* running index in l_buf */var code; /* the code to send */var extra; /* number of extra bits to send */if(s.last_lit!==0){do {dist=s.pending_buf[s.d_buf+lx*2]<<8|s.pending_buf[s.d_buf+lx*2+1];lc=s.pending_buf[s.l_buf+lx];lx++;if(dist===0){send_code(s,lc,ltree); /* send a literal byte */ //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n }else { /* Here, lc is the match length - MIN_MATCH */code=_length_code[lc];send_code(s,code+LITERALS+1,ltree); /* send the length code */extra=extra_lbits[code];if(extra!==0){lc-=base_length[code];send_bits(s,lc,extra); /* send the extra length bits */}dist--; /* dist is now the match distance - 1 */code=d_code(dist); //Assert (code < D_CODES, \"bad d_code\");\n send_code(s,code,dtree); /* send the distance code */extra=extra_dbits[code];if(extra!==0){dist-=base_dist[code];send_bits(s,dist,extra); /* send the extra distance bits */}} /* literal or match pair ? */ /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */ //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n // \"pendingBuf overflow\");\n }while(lx<s.last_lit);}send_code(s,END_BLOCK,ltree);}","title":""},{"docid":"4e0844e35e428fc6b394c85e2789d870","score":"0.6281818","text":"function deflate_fast(s, flush) {\n var hash_head; /* head of the hash chain */\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0;\n /*NIL*/if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0 /*NIL*/ && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (s.match_length <= s.max_lazy_match /*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n //#if MIN_MATCH != 3\n // Call UPDATE_HASH() MIN_MATCH-3 more times\n //#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}","title":""},{"docid":"fa7b8343b442ab0f71b927c8121c01d7","score":"0.6278382","text":"function deflate_slow(s, flush) {\n\t var hash_head; /* head of hash chain */\n\t var bflush; /* set if current block must be flushed */\n\t\n\t var max_insert;\n\t\n\t /* Process the input block. */\n\t for (;;) {\n\t /* Make sure that we always have enough lookahead, except\n\t * at the end of the input file. We need MAX_MATCH bytes\n\t * for the next match, plus MIN_MATCH bytes to insert the\n\t * string following the next match.\n\t */\n\t if (s.lookahead < MIN_LOOKAHEAD) {\n\t fill_window(s);\n\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n\t return BS_NEED_MORE;\n\t }\n\t if (s.lookahead === 0) { break; } /* flush the current block */\n\t }\n\t\n\t /* Insert the string window[strstart .. strstart+2] in the\n\t * dictionary, and set hash_head to the head of the hash chain:\n\t */\n\t hash_head = 0/*NIL*/;\n\t if (s.lookahead >= MIN_MATCH) {\n\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t s.head[s.ins_h] = s.strstart;\n\t /***/\n\t }\n\t\n\t /* Find the longest match, discarding those <= prev_length.\n\t */\n\t s.prev_length = s.match_length;\n\t s.prev_match = s.match_start;\n\t s.match_length = MIN_MATCH - 1;\n\t\n\t if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n\t s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n\t /* To simplify the code, we prevent matches with the string\n\t * of window index 0 (in particular we have to avoid a match\n\t * of the string with itself at the start of the input file).\n\t */\n\t s.match_length = longest_match(s, hash_head);\n\t /* longest_match() sets match_start */\n\t\n\t if (s.match_length <= 5 &&\n\t (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\t\n\t /* If prev_match is also MIN_MATCH, match_start is garbage\n\t * but we will ignore the current match anyway.\n\t */\n\t s.match_length = MIN_MATCH - 1;\n\t }\n\t }\n\t /* If there was a match at the previous step and the current\n\t * match is not better, output the previous match:\n\t */\n\t if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n\t max_insert = s.strstart + s.lookahead - MIN_MATCH;\n\t /* Do not insert strings in hash table beyond this. */\n\t\n\t //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\t\n\t /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n\t s.prev_length - MIN_MATCH, bflush);***/\n\t bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n\t /* Insert in hash table all strings up to the end of the match.\n\t * strstart-1 and strstart are already inserted. If there is not\n\t * enough lookahead, the last two strings are not inserted in\n\t * the hash table.\n\t */\n\t s.lookahead -= s.prev_length - 1;\n\t s.prev_length -= 2;\n\t do {\n\t if (++s.strstart <= max_insert) {\n\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t s.head[s.ins_h] = s.strstart;\n\t /***/\n\t }\n\t } while (--s.prev_length !== 0);\n\t s.match_available = 0;\n\t s.match_length = MIN_MATCH - 1;\n\t s.strstart++;\n\t\n\t if (bflush) {\n\t /*** FLUSH_BLOCK(s, 0); ***/\n\t flush_block_only(s, false);\n\t if (s.strm.avail_out === 0) {\n\t return BS_NEED_MORE;\n\t }\n\t /***/\n\t }\n\t\n\t } else if (s.match_available) {\n\t /* If there was no match at the previous position, output a\n\t * single literal. If there was a match but the current match\n\t * is longer, truncate the previous match to a single literal.\n\t */\n\t //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\t\n\t if (bflush) {\n\t /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n\t flush_block_only(s, false);\n\t /***/\n\t }\n\t s.strstart++;\n\t s.lookahead--;\n\t if (s.strm.avail_out === 0) {\n\t return BS_NEED_MORE;\n\t }\n\t } else {\n\t /* There is no previous match to compare with, wait for\n\t * the next step to decide.\n\t */\n\t s.match_available = 1;\n\t s.strstart++;\n\t s.lookahead--;\n\t }\n\t }\n\t //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n\t if (s.match_available) {\n\t //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\t\n\t s.match_available = 0;\n\t }\n\t s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n\t if (flush === Z_FINISH) {\n\t /*** FLUSH_BLOCK(s, 1); ***/\n\t flush_block_only(s, true);\n\t if (s.strm.avail_out === 0) {\n\t return BS_FINISH_STARTED;\n\t }\n\t /***/\n\t return BS_FINISH_DONE;\n\t }\n\t if (s.last_lit) {\n\t /*** FLUSH_BLOCK(s, 0); ***/\n\t flush_block_only(s, false);\n\t if (s.strm.avail_out === 0) {\n\t return BS_NEED_MORE;\n\t }\n\t /***/\n\t }\n\t\n\t return BS_BLOCK_DONE;\n\t}","title":""},{"docid":"fa7b8343b442ab0f71b927c8121c01d7","score":"0.6278382","text":"function deflate_slow(s, flush) {\n\t var hash_head; /* head of hash chain */\n\t var bflush; /* set if current block must be flushed */\n\t\n\t var max_insert;\n\t\n\t /* Process the input block. */\n\t for (;;) {\n\t /* Make sure that we always have enough lookahead, except\n\t * at the end of the input file. We need MAX_MATCH bytes\n\t * for the next match, plus MIN_MATCH bytes to insert the\n\t * string following the next match.\n\t */\n\t if (s.lookahead < MIN_LOOKAHEAD) {\n\t fill_window(s);\n\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n\t return BS_NEED_MORE;\n\t }\n\t if (s.lookahead === 0) { break; } /* flush the current block */\n\t }\n\t\n\t /* Insert the string window[strstart .. strstart+2] in the\n\t * dictionary, and set hash_head to the head of the hash chain:\n\t */\n\t hash_head = 0/*NIL*/;\n\t if (s.lookahead >= MIN_MATCH) {\n\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t s.head[s.ins_h] = s.strstart;\n\t /***/\n\t }\n\t\n\t /* Find the longest match, discarding those <= prev_length.\n\t */\n\t s.prev_length = s.match_length;\n\t s.prev_match = s.match_start;\n\t s.match_length = MIN_MATCH - 1;\n\t\n\t if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n\t s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n\t /* To simplify the code, we prevent matches with the string\n\t * of window index 0 (in particular we have to avoid a match\n\t * of the string with itself at the start of the input file).\n\t */\n\t s.match_length = longest_match(s, hash_head);\n\t /* longest_match() sets match_start */\n\t\n\t if (s.match_length <= 5 &&\n\t (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\t\n\t /* If prev_match is also MIN_MATCH, match_start is garbage\n\t * but we will ignore the current match anyway.\n\t */\n\t s.match_length = MIN_MATCH - 1;\n\t }\n\t }\n\t /* If there was a match at the previous step and the current\n\t * match is not better, output the previous match:\n\t */\n\t if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n\t max_insert = s.strstart + s.lookahead - MIN_MATCH;\n\t /* Do not insert strings in hash table beyond this. */\n\t\n\t //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\t\n\t /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n\t s.prev_length - MIN_MATCH, bflush);***/\n\t bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n\t /* Insert in hash table all strings up to the end of the match.\n\t * strstart-1 and strstart are already inserted. If there is not\n\t * enough lookahead, the last two strings are not inserted in\n\t * the hash table.\n\t */\n\t s.lookahead -= s.prev_length - 1;\n\t s.prev_length -= 2;\n\t do {\n\t if (++s.strstart <= max_insert) {\n\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n\t s.head[s.ins_h] = s.strstart;\n\t /***/\n\t }\n\t } while (--s.prev_length !== 0);\n\t s.match_available = 0;\n\t s.match_length = MIN_MATCH - 1;\n\t s.strstart++;\n\t\n\t if (bflush) {\n\t /*** FLUSH_BLOCK(s, 0); ***/\n\t flush_block_only(s, false);\n\t if (s.strm.avail_out === 0) {\n\t return BS_NEED_MORE;\n\t }\n\t /***/\n\t }\n\t\n\t } else if (s.match_available) {\n\t /* If there was no match at the previous position, output a\n\t * single literal. If there was a match but the current match\n\t * is longer, truncate the previous match to a single literal.\n\t */\n\t //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\t\n\t if (bflush) {\n\t /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n\t flush_block_only(s, false);\n\t /***/\n\t }\n\t s.strstart++;\n\t s.lookahead--;\n\t if (s.strm.avail_out === 0) {\n\t return BS_NEED_MORE;\n\t }\n\t } else {\n\t /* There is no previous match to compare with, wait for\n\t * the next step to decide.\n\t */\n\t s.match_available = 1;\n\t s.strstart++;\n\t s.lookahead--;\n\t }\n\t }\n\t //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n\t if (s.match_available) {\n\t //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\t\n\t s.match_available = 0;\n\t }\n\t s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n\t if (flush === Z_FINISH) {\n\t /*** FLUSH_BLOCK(s, 1); ***/\n\t flush_block_only(s, true);\n\t if (s.strm.avail_out === 0) {\n\t return BS_FINISH_STARTED;\n\t }\n\t /***/\n\t return BS_FINISH_DONE;\n\t }\n\t if (s.last_lit) {\n\t /*** FLUSH_BLOCK(s, 0); ***/\n\t flush_block_only(s, false);\n\t if (s.strm.avail_out === 0) {\n\t return BS_NEED_MORE;\n\t }\n\t /***/\n\t }\n\t\n\t return BS_BLOCK_DONE;\n\t}","title":""},{"docid":"69a9e1c7ef1533b219207985abb5c293","score":"0.6278211","text":"function deflate_fast(flush) { // 7544\n\t\t\t// short hash_head = 0; // head of the hash chain // 7545\n\t\t\tvar hash_head = 0; // head of the hash chain // 7546\n\t\t\tvar bflush; // set if current block must be flushed // 7547\n // 7548\n\t\t\twhile (true) { // 7549\n\t\t\t\t// Make sure that we always have enough lookahead, except // 7550\n\t\t\t\t// at the end of the input file. We need MAX_MATCH bytes // 7551\n\t\t\t\t// for the next match, plus MIN_MATCH bytes to insert the // 7552\n\t\t\t\t// string following the next match. // 7553\n\t\t\t\tif (lookahead < MIN_LOOKAHEAD) { // 7554\n\t\t\t\t\tfill_window(); // 7555\n\t\t\t\t\tif (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) { // 7556\n\t\t\t\t\t\treturn NeedMore; // 7557\n\t\t\t\t\t} // 7558\n\t\t\t\t\tif (lookahead === 0) // 7559\n\t\t\t\t\t\tbreak; // flush the current block // 7560\n\t\t\t\t} // 7561\n // 7562\n\t\t\t\t// Insert the string window[strstart .. strstart+2] in the // 7563\n\t\t\t\t// dictionary, and set hash_head to the head of the hash chain: // 7564\n\t\t\t\tif (lookahead >= MIN_MATCH) { // 7565\n\t\t\t\t\tins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask; // 7566\n // 7567\n\t\t\t\t\t// prev[strstart&w_mask]=hash_head=head[ins_h]; // 7568\n\t\t\t\t\thash_head = (head[ins_h] & 0xffff); // 7569\n\t\t\t\t\tprev[strstart & w_mask] = head[ins_h]; // 7570\n\t\t\t\t\thead[ins_h] = strstart; // 7571\n\t\t\t\t} // 7572\n // 7573\n\t\t\t\t// Find the longest match, discarding those <= prev_length. // 7574\n\t\t\t\t// At this point we have always match_length < MIN_MATCH // 7575\n // 7576\n\t\t\t\tif (hash_head !== 0 && ((strstart - hash_head) & 0xffff) <= w_size - MIN_LOOKAHEAD) { // 7577\n\t\t\t\t\t// To simplify the code, we prevent matches with the string // 7578\n\t\t\t\t\t// of window index 0 (in particular we have to avoid a match // 7579\n\t\t\t\t\t// of the string with itself at the start of the input file). // 7580\n\t\t\t\t\tif (strategy != Z_HUFFMAN_ONLY) { // 7581\n\t\t\t\t\t\tmatch_length = longest_match(hash_head); // 7582\n\t\t\t\t\t} // 7583\n\t\t\t\t\t// longest_match() sets match_start // 7584\n\t\t\t\t} // 7585\n\t\t\t\tif (match_length >= MIN_MATCH) { // 7586\n\t\t\t\t\t// check_match(strstart, match_start, match_length); // 7587\n // 7588\n\t\t\t\t\tbflush = _tr_tally(strstart - match_start, match_length - MIN_MATCH); // 7589\n // 7590\n\t\t\t\t\tlookahead -= match_length; // 7591\n // 7592\n\t\t\t\t\t// Insert new strings in the hash table only if the match length // 7593\n\t\t\t\t\t// is not too large. This saves time but degrades compression. // 7594\n\t\t\t\t\tif (match_length <= max_lazy_match && lookahead >= MIN_MATCH) { // 7595\n\t\t\t\t\t\tmatch_length--; // string at strstart already in hash table // 7596\n\t\t\t\t\t\tdo { // 7597\n\t\t\t\t\t\t\tstrstart++; // 7598\n // 7599\n\t\t\t\t\t\t\tins_h = ((ins_h << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask; // 7600\n\t\t\t\t\t\t\t// prev[strstart&w_mask]=hash_head=head[ins_h]; // 7601\n\t\t\t\t\t\t\thash_head = (head[ins_h] & 0xffff); // 7602\n\t\t\t\t\t\t\tprev[strstart & w_mask] = head[ins_h]; // 7603\n\t\t\t\t\t\t\thead[ins_h] = strstart; // 7604\n // 7605\n\t\t\t\t\t\t\t// strstart never exceeds WSIZE-MAX_MATCH, so there are // 7606\n\t\t\t\t\t\t\t// always MIN_MATCH bytes ahead. // 7607\n\t\t\t\t\t\t} while (--match_length !== 0); // 7608\n\t\t\t\t\t\tstrstart++; // 7609\n\t\t\t\t\t} else { // 7610\n\t\t\t\t\t\tstrstart += match_length; // 7611\n\t\t\t\t\t\tmatch_length = 0; // 7612\n\t\t\t\t\t\tins_h = window[strstart] & 0xff; // 7613\n // 7614\n\t\t\t\t\t\tins_h = (((ins_h) << hash_shift) ^ (window[strstart + 1] & 0xff)) & hash_mask; // 7615\n\t\t\t\t\t\t// If lookahead < MIN_MATCH, ins_h is garbage, but it does // 7616\n\t\t\t\t\t\t// not // 7617\n\t\t\t\t\t\t// matter since it will be recomputed at next deflate call. // 7618\n\t\t\t\t\t} // 7619\n\t\t\t\t} else { // 7620\n\t\t\t\t\t// No match, output a literal byte // 7621\n // 7622\n\t\t\t\t\tbflush = _tr_tally(0, window[strstart] & 0xff); // 7623\n\t\t\t\t\tlookahead--; // 7624\n\t\t\t\t\tstrstart++; // 7625\n\t\t\t\t} // 7626\n\t\t\t\tif (bflush) { // 7627\n // 7628\n\t\t\t\t\tflush_block_only(false); // 7629\n\t\t\t\t\tif (strm.avail_out === 0) // 7630\n\t\t\t\t\t\treturn NeedMore; // 7631\n\t\t\t\t} // 7632\n\t\t\t} // 7633\n // 7634\n\t\t\tflush_block_only(flush == Z_FINISH); // 7635\n\t\t\tif (strm.avail_out === 0) { // 7636\n\t\t\t\tif (flush == Z_FINISH) // 7637\n\t\t\t\t\treturn FinishStarted; // 7638\n\t\t\t\telse // 7639\n\t\t\t\t\treturn NeedMore; // 7640\n\t\t\t} // 7641\n\t\t\treturn flush == Z_FINISH ? FinishDone : BlockDone; // 7642\n\t\t} // 7643","title":""}],"string":"[\n {\n \"docid\": \"f7270f04a4e803be9ef4735a42ab0d3f\",\n \"score\": \"0.6782075\",\n \"text\": \"function zip_deflate_fast() {\\n while (zip_lookahead != 0 && zip_qhead == null) {\\n var flush; // set if current block must be flushed\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n zip_INSERT_STRING();\\n\\n /* Find the longest match, discarding those <= prev_length.\\n * At this point we have always match_length < MIN_MATCH\\n */\\n if (zip_hash_head != zip_NIL &&\\n zip_strstart - zip_hash_head <= zip_MAX_DIST) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n zip_match_length = zip_longest_match(zip_hash_head);\\n /* longest_match() sets match_start */\\n if (zip_match_length > zip_lookahead) { zip_match_length = zip_lookahead; }\\n }\\n if (zip_match_length >= zip_MIN_MATCH) {\\n //\\t check_match(strstart, match_start, match_length);\\n\\n flush = zip_ct_tally(zip_strstart - zip_match_start,\\n zip_match_length - zip_MIN_MATCH);\\n zip_lookahead -= zip_match_length;\\n\\n /* Insert new strings in the hash table only if the match length\\n * is not too large. This saves time but degrades compression.\\n */\\n if (zip_match_length <= zip_max_lazy_match) {\\n zip_match_length--; // string at strstart already in hash table\\n do {\\n zip_strstart++;\\n zip_INSERT_STRING();\\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\\n * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH\\n * these bytes are garbage, but it does not matter since\\n * the next lookahead bytes will be emitted as literals.\\n */\\n } while (--zip_match_length != 0);\\n zip_strstart++;\\n } else {\\n zip_strstart += zip_match_length;\\n zip_match_length = 0;\\n zip_ins_h = zip_window[zip_strstart] & 0xff;\\n //\\t\\tUPDATE_HASH(ins_h, window[strstart + 1]);\\n zip_ins_h = ((zip_ins_h << zip_H_SHIFT) ^ (zip_window[zip_strstart + 1] & 0xff)) & zip_HASH_MASK;\\n\\n //#if MIN_MATCH != 3\\n //\\t\\tCall UPDATE_HASH() MIN_MATCH-3 more times\\n //#endif\\n\\n }\\n } else {\\n /* No match, output a literal byte */\\n flush = zip_ct_tally(0, zip_window[zip_strstart] & 0xff);\\n zip_lookahead--;\\n zip_strstart++;\\n }\\n if (flush) {\\n zip_flush_block(0);\\n zip_block_start = zip_strstart;\\n }\\n\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n while (zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile) { zip_fill_window(); }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26419d96139f531d77dcbd2cebb7a0c2\",\n \"score\": \"0.67528456\",\n \"text\": \"function deflate_fast() {\\n \\t\\twhile (lookahead !== 0 && qhead === null) {\\n \\t\\t\\tvar flush; // set if current block must be flushed\\n \\n \\t\\t\\t// Insert the string window[strstart .. strstart+2] in the\\n \\t\\t\\t// dictionary, and set hash_head to the head of the hash chain:\\n \\t\\t\\tINSERT_STRING();\\n \\n \\t\\t\\t// Find the longest match, discarding those <= prev_length.\\n \\t\\t\\t// At this point we have always match_length < MIN_MATCH\\n \\t\\t\\tif (hash_head !== NIL && strstart - hash_head <= MAX_DIST) {\\n \\t\\t\\t\\t// To simplify the code, we prevent matches with the string\\n \\t\\t\\t\\t// of window index 0 (in particular we have to avoid a match\\n \\t\\t\\t\\t// of the string with itself at the start of the input file).\\n \\t\\t\\t\\tmatch_length = longest_match(hash_head);\\n \\t\\t\\t\\t// longest_match() sets match_start */\\n \\t\\t\\t\\tif (match_length > lookahead) {\\n \\t\\t\\t\\t\\tmatch_length = lookahead;\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t\\tif (match_length >= MIN_MATCH) {\\n \\t\\t\\t\\t// check_match(strstart, match_start, match_length);\\n \\n \\t\\t\\t\\tflush = ct_tally(strstart - match_start, match_length - MIN_MATCH);\\n \\t\\t\\t\\tlookahead -= match_length;\\n \\n \\t\\t\\t\\t// Insert new strings in the hash table only if the match length\\n \\t\\t\\t\\t// is not too large. This saves time but degrades compression.\\n \\t\\t\\t\\tif (match_length <= max_lazy_match) {\\n \\t\\t\\t\\t\\tmatch_length--; // string at strstart already in hash table\\n \\t\\t\\t\\t\\tdo {\\n \\t\\t\\t\\t\\t\\tstrstart++;\\n \\t\\t\\t\\t\\t\\tINSERT_STRING();\\n \\t\\t\\t\\t\\t\\t// strstart never exceeds WSIZE-MAX_MATCH, so there are\\n \\t\\t\\t\\t\\t\\t// always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH\\n \\t\\t\\t\\t\\t\\t// these bytes are garbage, but it does not matter since\\n \\t\\t\\t\\t\\t\\t// the next lookahead bytes will be emitted as literals.\\n \\t\\t\\t\\t\\t} while (--match_length !== 0);\\n \\t\\t\\t\\t\\tstrstart++;\\n \\t\\t\\t\\t} else {\\n \\t\\t\\t\\t\\tstrstart += match_length;\\n \\t\\t\\t\\t\\tmatch_length = 0;\\n \\t\\t\\t\\t\\tins_h = window[strstart] & 0xff;\\n \\t\\t\\t\\t\\t// UPDATE_HASH(ins_h, window[strstart + 1]);\\n \\t\\t\\t\\t\\tins_h = ((ins_h << H_SHIFT) ^ (window[strstart + 1] & 0xff)) & HASH_MASK;\\n \\n \\t\\t\\t\\t//#if MIN_MATCH !== 3\\n \\t\\t\\t\\t//\\t\\tCall UPDATE_HASH() MIN_MATCH-3 more times\\n \\t\\t\\t\\t//#endif\\n \\n \\t\\t\\t\\t}\\n \\t\\t\\t} else {\\n \\t\\t\\t\\t// No match, output a literal byte */\\n \\t\\t\\t\\tflush = ct_tally(0, window[strstart] & 0xff);\\n \\t\\t\\t\\tlookahead--;\\n \\t\\t\\t\\tstrstart++;\\n \\t\\t\\t}\\n \\t\\t\\tif (flush) {\\n \\t\\t\\t\\tflush_block(0);\\n \\t\\t\\t\\tblock_start = strstart;\\n \\t\\t\\t}\\n \\n \\t\\t\\t// Make sure that we always have enough lookahead, except\\n \\t\\t\\t// at the end of the input file. We need MAX_MATCH bytes\\n \\t\\t\\t// for the next match, plus MIN_MATCH bytes to insert the\\n \\t\\t\\t// string following the next match.\\n \\t\\t\\twhile (lookahead < MIN_LOOKAHEAD && !eofile) {\\n \\t\\t\\t\\tfill_window();\\n \\t\\t\\t}\\n \\t\\t}\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"089de3d5a95902ba60afd05f61545bfb\",\n \"score\": \"0.6682843\",\n \"text\": \"function deflate_fast() {\\n\\t\\twhile (lookahead !== 0 && qhead === null) {\\n\\t\\t\\tvar flush; // set if current block must be flushed\\n\\n\\t\\t\\t// Insert the string window[strstart .. strstart+2] in the\\n\\t\\t\\t// dictionary, and set hash_head to the head of the hash chain:\\n\\t\\t\\tINSERT_STRING();\\n\\n\\t\\t\\t// Find the longest match, discarding those <= prev_length.\\n\\t\\t\\t// At this point we have always match_length < MIN_MATCH\\n\\t\\t\\tif (hash_head !== NIL && strstart - hash_head <= MAX_DIST) {\\n\\t\\t\\t\\t// To simplify the code, we prevent matches with the string\\n\\t\\t\\t\\t// of window index 0 (in particular we have to avoid a match\\n\\t\\t\\t\\t// of the string with itself at the start of the input file).\\n\\t\\t\\t\\tmatch_length = longest_match(hash_head);\\n\\t\\t\\t\\t// longest_match() sets match_start */\\n\\t\\t\\t\\tif (match_length > lookahead) {\\n\\t\\t\\t\\t\\tmatch_length = lookahead;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (match_length >= MIN_MATCH) {\\n\\t\\t\\t\\t// check_match(strstart, match_start, match_length);\\n\\n\\t\\t\\t\\tflush = ct_tally(strstart - match_start, match_length - MIN_MATCH);\\n\\t\\t\\t\\tlookahead -= match_length;\\n\\n\\t\\t\\t\\t// Insert new strings in the hash table only if the match length\\n\\t\\t\\t\\t// is not too large. This saves time but degrades compression.\\n\\t\\t\\t\\tif (match_length <= max_lazy_match) {\\n\\t\\t\\t\\t\\tmatch_length--; // string at strstart already in hash table\\n\\t\\t\\t\\t\\tdo {\\n\\t\\t\\t\\t\\t\\tstrstart++;\\n\\t\\t\\t\\t\\t\\tINSERT_STRING();\\n\\t\\t\\t\\t\\t\\t// strstart never exceeds WSIZE-MAX_MATCH, so there are\\n\\t\\t\\t\\t\\t\\t// always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH\\n\\t\\t\\t\\t\\t\\t// these bytes are garbage, but it does not matter since\\n\\t\\t\\t\\t\\t\\t// the next lookahead bytes will be emitted as literals.\\n\\t\\t\\t\\t\\t} while (--match_length !== 0);\\n\\t\\t\\t\\t\\tstrstart++;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tstrstart += match_length;\\n\\t\\t\\t\\t\\tmatch_length = 0;\\n\\t\\t\\t\\t\\tins_h = window[strstart] & 0xff;\\n\\t\\t\\t\\t\\t// UPDATE_HASH(ins_h, window[strstart + 1]);\\n\\t\\t\\t\\t\\tins_h = ((ins_h << H_SHIFT) ^ (window[strstart + 1] & 0xff)) & HASH_MASK;\\n\\n\\t\\t\\t\\t//#if MIN_MATCH !== 3\\n\\t\\t\\t\\t//\\t\\tCall UPDATE_HASH() MIN_MATCH-3 more times\\n\\t\\t\\t\\t//#endif\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// No match, output a literal byte */\\n\\t\\t\\t\\tflush = ct_tally(0, window[strstart] & 0xff);\\n\\t\\t\\t\\tlookahead--;\\n\\t\\t\\t\\tstrstart++;\\n\\t\\t\\t}\\n\\t\\t\\tif (flush) {\\n\\t\\t\\t\\tflush_block(0);\\n\\t\\t\\t\\tblock_start = strstart;\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Make sure that we always have enough lookahead, except\\n\\t\\t\\t// at the end of the input file. We need MAX_MATCH bytes\\n\\t\\t\\t// for the next match, plus MIN_MATCH bytes to insert the\\n\\t\\t\\t// string following the next match.\\n\\t\\t\\twhile (lookahead < MIN_LOOKAHEAD && !eofile) {\\n\\t\\t\\t\\tfill_window();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e9de76f1bd9c8568dadc40116c7e688\",\n \"score\": \"0.6670824\",\n \"text\": \"function deflate_fast(s,flush){var hash_head; /* head of the hash chain */var bflush; /* set if current block must be flushed */for(;;){ /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */if(s.lookahead<MIN_LOOKAHEAD){fill_window(s);if(s.lookahead<MIN_LOOKAHEAD&&flush===Z_NO_FLUSH){return BS_NEED_MORE;}if(s.lookahead===0){break; /* flush the current block */}} /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */hash_head=0 /*NIL*/;if(s.lookahead>=MIN_MATCH){ /*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart; /***/} /* Find the longest match, discarding those <= prev_length.\\n * At this point we have always match_length < MIN_MATCH\\n */if(hash_head!==0 /*NIL*/&&s.strstart-hash_head<=s.w_size-MIN_LOOKAHEAD){ /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */s.match_length=longest_match(s,hash_head); /* longest_match() sets match_start */}if(s.match_length>=MIN_MATCH){ // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\\n s.match_length - MIN_MATCH, bflush); ***/bflush=trees._tr_tally(s,s.strstart-s.match_start,s.match_length-MIN_MATCH);s.lookahead-=s.match_length; /* Insert new strings in the hash table only if the match length\\n * is not too large. This saves time but degrades compression.\\n */if(s.match_length<=s.max_lazy_match /*max_insert_length*/&&s.lookahead>=MIN_MATCH){s.match_length--; /* string at strstart already in table */do {s.strstart++; /*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart; /***/ /* strstart never exceeds WSIZE-MAX_MATCH, so there are\\n * always MIN_MATCH bytes ahead.\\n */}while(--s.match_length!==0);s.strstart++;}else {s.strstart+=s.match_length;s.match_length=0;s.ins_h=s.window[s.strstart]; /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+1])&s.hash_mask; //#if MIN_MATCH != 3\\n // Call UPDATE_HASH() MIN_MATCH-3 more times\\n //#endif\\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\\n * matter since it will be recomputed at next deflate call.\\n */}}else { /* No match, output a literal byte */ //Tracevv((stderr,\\\"%c\\\", s.window[s.strstart]));\\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart]);s.lookahead--;s.strstart++;}if(bflush){ /*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;} /***/}}s.insert=s.strstart<MIN_MATCH-1?s.strstart:MIN_MATCH-1;if(flush===Z_FINISH){ /*** FLUSH_BLOCK(s, 1); ***/flush_block_only(s,true);if(s.strm.avail_out===0){return BS_FINISH_STARTED;} /***/return BS_FINISH_DONE;}if(s.last_lit){ /*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;} /***/}return BS_BLOCK_DONE;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78dfebb5d991ca33c5b59ded04097108\",\n \"score\": \"0.66418016\",\n \"text\": \"function deflate_slow(s,flush){var hash_head; /* head of hash chain */var bflush; /* set if current block must be flushed */var max_insert; /* Process the input block. */for(;;){ /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */if(s.lookahead<MIN_LOOKAHEAD){fill_window(s);if(s.lookahead<MIN_LOOKAHEAD&&flush===Z_NO_FLUSH){return BS_NEED_MORE;}if(s.lookahead===0){break;} /* flush the current block */} /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */hash_head=0 /*NIL*/;if(s.lookahead>=MIN_MATCH){ /*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart; /***/} /* Find the longest match, discarding those <= prev_length.\\n */s.prev_length=s.match_length;s.prev_match=s.match_start;s.match_length=MIN_MATCH-1;if(hash_head!==0 /*NIL*/&&s.prev_length<s.max_lazy_match&&s.strstart-hash_head<=s.w_size-MIN_LOOKAHEAD /*MAX_DIST(s)*/){ /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */s.match_length=longest_match(s,hash_head); /* longest_match() sets match_start */if(s.match_length<=5&&(s.strategy===Z_FILTERED||s.match_length===MIN_MATCH&&s.strstart-s.match_start>4096 /*TOO_FAR*/)){ /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */s.match_length=MIN_MATCH-1;}} /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */if(s.prev_length>=MIN_MATCH&&s.match_length<=s.prev_length){max_insert=s.strstart+s.lookahead-MIN_MATCH; /* Do not insert strings in hash table beyond this. */ //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/bflush=trees._tr_tally(s,s.strstart-1-s.prev_match,s.prev_length-MIN_MATCH); /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */s.lookahead-=s.prev_length-1;s.prev_length-=2;do {if(++s.strstart<=max_insert){ /*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart; /***/}}while(--s.prev_length!==0);s.match_available=0;s.match_length=MIN_MATCH-1;s.strstart++;if(bflush){ /*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;} /***/}}else if(s.match_available){ /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */ //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart-1]);if(bflush){ /*** FLUSH_BLOCK_ONLY(s, 0) ***/flush_block_only(s,false); /***/}s.strstart++;s.lookahead--;if(s.strm.avail_out===0){return BS_NEED_MORE;}}else { /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */s.match_available=1;s.strstart++;s.lookahead--;}} //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if(s.match_available){ //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart-1]);s.match_available=0;}s.insert=s.strstart<MIN_MATCH-1?s.strstart:MIN_MATCH-1;if(flush===Z_FINISH){ /*** FLUSH_BLOCK(s, 1); ***/flush_block_only(s,true);if(s.strm.avail_out===0){return BS_FINISH_STARTED;} /***/return BS_FINISH_DONE;}if(s.last_lit){ /*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;} /***/}return BS_BLOCK_DONE;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d7872db686268234b3b8de34ff6a183\",\n \"score\": \"0.6633814\",\n \"text\": \"function deflate_fast(s,flush){var hash_head;/* head of the hash chain */var bflush;/* set if current block must be flushed */for(;;){/* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */if(s.lookahead<MIN_LOOKAHEAD){fill_window(s);if(s.lookahead<MIN_LOOKAHEAD&&flush===Z_NO_FLUSH){return BS_NEED_MORE;}if(s.lookahead===0){break;/* flush the current block */}}/* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */hash_head=0/*NIL*/;if(s.lookahead>=MIN_MATCH){/*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart;/***/}/* Find the longest match, discarding those <= prev_length.\\n * At this point we have always match_length < MIN_MATCH\\n */if(hash_head!==0/*NIL*/&&s.strstart-hash_head<=s.w_size-MIN_LOOKAHEAD){/* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */s.match_length=longest_match(s,hash_head);/* longest_match() sets match_start */}if(s.match_length>=MIN_MATCH){// check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\\n/*** _tr_tally_dist(s, s.strstart - s.match_start,\\n s.match_length - MIN_MATCH, bflush); ***/bflush=trees._tr_tally(s,s.strstart-s.match_start,s.match_length-MIN_MATCH);s.lookahead-=s.match_length;/* Insert new strings in the hash table only if the match length\\n * is not too large. This saves time but degrades compression.\\n */if(s.match_length<=s.max_lazy_match/*max_insert_length*/&&s.lookahead>=MIN_MATCH){s.match_length--;/* string at strstart already in table */do{s.strstart++;/*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart;/***//* strstart never exceeds WSIZE-MAX_MATCH, so there are\\n * always MIN_MATCH bytes ahead.\\n */}while(--s.match_length!==0);s.strstart++;}else{s.strstart+=s.match_length;s.match_length=0;s.ins_h=s.window[s.strstart];/* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+1])&s.hash_mask;//#if MIN_MATCH != 3\\n// Call UPDATE_HASH() MIN_MATCH-3 more times\\n//#endif\\n/* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\\n * matter since it will be recomputed at next deflate call.\\n */}}else{/* No match, output a literal byte *///Tracevv((stderr,\\\"%c\\\", s.window[s.strstart]));\\n/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart]);s.lookahead--;s.strstart++;}if(bflush){/*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;}/***/}}s.insert=s.strstart<MIN_MATCH-1?s.strstart:MIN_MATCH-1;if(flush===Z_FINISH){/*** FLUSH_BLOCK(s, 1); ***/flush_block_only(s,true);if(s.strm.avail_out===0){return BS_FINISH_STARTED;}/***/return BS_FINISH_DONE;}if(s.last_lit){/*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;}/***/}return BS_BLOCK_DONE;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5875fcc8f56e56edd745939c1280af6\",\n \"score\": \"0.66142404\",\n \"text\": \"function deflate_slow(s,flush){var hash_head;/* head of hash chain */var bflush;/* set if current block must be flushed */var max_insert;/* Process the input block. */for(;;){/* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */if(s.lookahead<MIN_LOOKAHEAD){fill_window(s);if(s.lookahead<MIN_LOOKAHEAD&&flush===Z_NO_FLUSH){return BS_NEED_MORE;}if(s.lookahead===0){break;}/* flush the current block */}/* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */hash_head=0/*NIL*/;if(s.lookahead>=MIN_MATCH){/*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart;/***/}/* Find the longest match, discarding those <= prev_length.\\n */s.prev_length=s.match_length;s.prev_match=s.match_start;s.match_length=MIN_MATCH-1;if(hash_head!==0/*NIL*/&&s.prev_length<s.max_lazy_match&&s.strstart-hash_head<=s.w_size-MIN_LOOKAHEAD/*MAX_DIST(s)*/){/* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */s.match_length=longest_match(s,hash_head);/* longest_match() sets match_start */if(s.match_length<=5&&(s.strategy===Z_FILTERED||s.match_length===MIN_MATCH&&s.strstart-s.match_start>4096/*TOO_FAR*/)){/* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */s.match_length=MIN_MATCH-1;}}/* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */if(s.prev_length>=MIN_MATCH&&s.match_length<=s.prev_length){max_insert=s.strstart+s.lookahead-MIN_MATCH;/* Do not insert strings in hash table beyond this. *///check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n/***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/bflush=trees._tr_tally(s,s.strstart-1-s.prev_match,s.prev_length-MIN_MATCH);/* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */s.lookahead-=s.prev_length-1;s.prev_length-=2;do{if(++s.strstart<=max_insert){/*** INSERT_STRING(s, s.strstart, hash_head); ***/s.ins_h=(s.ins_h<<s.hash_shift^s.window[s.strstart+MIN_MATCH-1])&s.hash_mask;hash_head=s.prev[s.strstart&s.w_mask]=s.head[s.ins_h];s.head[s.ins_h]=s.strstart;/***/}}while(--s.prev_length!==0);s.match_available=0;s.match_length=MIN_MATCH-1;s.strstart++;if(bflush){/*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;}/***/}}else if(s.match_available){/* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n *///Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart-1]);if(bflush){/*** FLUSH_BLOCK_ONLY(s, 0) ***/flush_block_only(s,false);/***/}s.strstart++;s.lookahead--;if(s.strm.avail_out===0){return BS_NEED_MORE;}}else{/* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */s.match_available=1;s.strstart++;s.lookahead--;}}//Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\nif(s.match_available){//Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/bflush=trees._tr_tally(s,0,s.window[s.strstart-1]);s.match_available=0;}s.insert=s.strstart<MIN_MATCH-1?s.strstart:MIN_MATCH-1;if(flush===Z_FINISH){/*** FLUSH_BLOCK(s, 1); ***/flush_block_only(s,true);if(s.strm.avail_out===0){return BS_FINISH_STARTED;}/***/return BS_FINISH_DONE;}if(s.last_lit){/*** FLUSH_BLOCK(s, 0); ***/flush_block_only(s,false);if(s.strm.avail_out===0){return BS_NEED_MORE;}/***/}return BS_BLOCK_DONE;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8125726b1113cd09f1a3238db474c360\",\n \"score\": \"0.6500689\",\n \"text\": \"function compress_block(s,ltree,dtree)// deflate_state *s;\\n// const ct_data *ltree; /* literal tree */\\n// const ct_data *dtree; /* distance tree */\\n{var dist;/* distance of matched string */var lc;/* match length or unmatched char (if dist == 0) */var lx=0;/* running index in l_buf */var code;/* the code to send */var extra;/* number of extra bits to send */if(s.last_lit!==0){do{dist=s.pending_buf[s.d_buf+lx*2]<<8|s.pending_buf[s.d_buf+lx*2+1];lc=s.pending_buf[s.l_buf+lx];lx++;if(dist===0){send_code(s,lc,ltree);/* send a literal byte *///Tracecv(isgraph(lc), (stderr,\\\" '%c' \\\", lc));\\n}else{/* Here, lc is the match length - MIN_MATCH */code=_length_code[lc];send_code(s,code+LITERALS+1,ltree);/* send the length code */extra=extra_lbits[code];if(extra!==0){lc-=base_length[code];send_bits(s,lc,extra);/* send the extra length bits */}dist--;/* dist is now the match distance - 1 */code=d_code(dist);//Assert (code < D_CODES, \\\"bad d_code\\\");\\nsend_code(s,code,dtree);/* send the distance code */extra=extra_dbits[code];if(extra!==0){dist-=base_dist[code];send_bits(s,dist,extra);/* send the extra distance bits */}}/* literal or match pair ? *//* Check that the overlay between pending_buf and d_buf+l_buf is ok: *///Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\\n// \\\"pendingBuf overflow\\\");\\n}while(lx<s.last_lit);}send_code(s,END_BLOCK,ltree);}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02ad2097d8fda0bb3c61d9d9eae4fb02\",\n \"score\": \"0.6439615\",\n \"text\": \"function deflate_slow(flush) {\\n// short hash_head = 0; // head of hash chain\\nvar hash_head = 0; // head of hash chain\\nvar bflush; // set if current block must be flushed\\nvar max_insert;\\n// Process the input block.\\nwhile (true) {\\n// Make sure that we always have enough lookahead, except\\n// at the end of the input file. We need MAX_MATCH bytes\\n// for the next match, plus MIN_MATCH bytes to insert the\\n// string following the next match.\\nif (lookahead < MIN_LOOKAHEAD) {\\nfill_window();\\nif (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\\nreturn NeedMore;\\n}\\nif (lookahead === 0)\\nbreak; // flush the current block\\n}\\n// Insert the string window[strstart .. strstart+2] in the\\n// dictionary, and set hash_head to the head of the hash chain:\\nif (lookahead >= MIN_MATCH) {\\nins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\\n// prev[strstart&w_mask]=hash_head=head[ins_h];\\nhash_head = (head[ins_h] & 0xffff);\\nprev[strstart & w_mask] = head[ins_h];\\nhead[ins_h] = strstart;\\n}\\n// Find the longest match, discarding those <= prev_length.\\nprev_length = match_length;\\nprev_match = match_start;\\nmatch_length = MIN_MATCH - 1;\\nif (hash_head !== 0 && prev_length < max_lazy_match && ((strstart - hash_head) & 0xffff) <= w_size - MIN_LOOKAHEAD) {\\n// To simplify the code, we prevent matches with the string\\n// of window index 0 (in particular we have to avoid a match\\n// of the string with itself at the start of the input file).\\nif (strategy != Z_HUFFMAN_ONLY) {\\nmatch_length = longest_match(hash_head);\\n}\\n// longest_match() sets match_start\\nif (match_length <= 5 && (strategy == Z_FILTERED || (match_length == MIN_MATCH && strstart - match_start > 4096))) {\\n// If prev_match is also MIN_MATCH, match_start is garbage\\n// but we will ignore the current match anyway.\\nmatch_length = MIN_MATCH - 1;\\n}\\n}\\n// If there was a match at the previous step and the current\\n// match is not better, output the previous match:\\nif (prev_length >= MIN_MATCH && match_length <= prev_length) {\\nmax_insert = strstart + lookahead - MIN_MATCH;\\n// Do not insert strings in hash table beyond this.\\n// check_match(strstart-1, prev_match, prev_length);\\nbflush = _tr_tally(strstart - 1 - prev_match, prev_length - MIN_MATCH);\\n// Insert in hash table all strings up to the end of the match.\\n// strstart-1 and strstart are already inserted. If there is not\\n// enough lookahead, the last two strings are not inserted in\\n// the hash table.\\nlookahead -= prev_length - 1;\\nprev_length -= 2;\\ndo {\\nif (++strstart <= max_insert) {\\nins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\\n// prev[strstart&w_mask]=hash_head=head[ins_h];\\nhash_head = (head[ins_h] & 0xffff);\\nprev[strstart & w_mask] = head[ins_h];\\nhead[ins_h] = strstart;\\n}\\n} while (--prev_length !== 0);\\nmatch_available = 0;\\nmatch_length = MIN_MATCH - 1;\\nstrstart++;\\nif (bflush) {\\nflush_block_only(false);\\nif (strm.avail_out === 0)\\nreturn NeedMore;\\n}\\n} else if (match_available !== 0) {\\n// If there was no match at the previous position, output a\\n// single literal. If there was a match but the current match\\n// is longer, truncate the previous match to a single literal.\\nbflush = _tr_tally(0, window[strstart - 1] & 0xff);\\nif (bflush) {\\nflush_block_only(false);\\n}\\nstrstart++;\\nlookahead--;\\nif (strm.avail_out === 0)\\nreturn NeedMore;\\n} else {\\n// There is no previous match to compare with, wait for\\n// the next step to decide.\\nmatch_available = 1;\\nstrstart++;\\nlookahead--;\\n}\\n}\\nif (match_available !== 0) {\\nbflush = _tr_tally(0, window[strstart - 1] & 0xff);\\nmatch_available = 0;\\n}\\nflush_block_only(flush == Z_FINISH);\\nif (strm.avail_out === 0) {\\nif (flush == Z_FINISH)\\nreturn FinishStarted;\\nelse\\nreturn NeedMore;\\n}\\nreturn flush == Z_FINISH ? FinishDone : BlockDone;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"824d723e1c8f1cfe2e5878612d0e8085\",\n \"score\": \"0.6399828\",\n \"text\": \"function deflate_slow(s, flush) {\\n\\t var hash_head; /* head of hash chain */\\n\\t var bflush; /* set if current block must be flushed */\\n\\n\\t var max_insert;\\n\\n\\t /* Process the input block. */\\n\\t for (;;) {\\n\\t /* Make sure that we always have enough lookahead, except\\n\\t * at the end of the input file. We need MAX_MATCH bytes\\n\\t * for the next match, plus MIN_MATCH bytes to insert the\\n\\t * string following the next match.\\n\\t */\\n\\t if (s.lookahead < MIN_LOOKAHEAD) {\\n\\t fill_window(s);\\n\\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t if (s.lookahead === 0) {\\n\\t break;\\n\\t } /* flush the current block */\\n\\t }\\n\\n\\t /* Insert the string window[strstart .. strstart+2] in the\\n\\t * dictionary, and set hash_head to the head of the hash chain:\\n\\t */\\n\\t hash_head = 0 /*NIL*/;\\n\\t if (s.lookahead >= MIN_MATCH) {\\n\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t s.head[s.ins_h] = s.strstart;\\n\\t /***/\\n\\t }\\n\\n\\t /* Find the longest match, discarding those <= prev_length.\\n\\t */\\n\\t s.prev_length = s.match_length;\\n\\t s.prev_match = s.match_start;\\n\\t s.match_length = MIN_MATCH - 1;\\n\\n\\t if (hash_head !== 0 /*NIL*/ && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD /*MAX_DIST(s)*/) {\\n\\t /* To simplify the code, we prevent matches with the string\\n\\t * of window index 0 (in particular we have to avoid a match\\n\\t * of the string with itself at the start of the input file).\\n\\t */\\n\\t s.match_length = longest_match(s, hash_head);\\n\\t /* longest_match() sets match_start */\\n\\n\\t if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096 /*TOO_FAR*/)) {\\n\\n\\t /* If prev_match is also MIN_MATCH, match_start is garbage\\n\\t * but we will ignore the current match anyway.\\n\\t */\\n\\t s.match_length = MIN_MATCH - 1;\\n\\t }\\n\\t }\\n\\t /* If there was a match at the previous step and the current\\n\\t * match is not better, output the previous match:\\n\\t */\\n\\t if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n\\t max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n\\t /* Do not insert strings in hash table beyond this. */\\n\\n\\t //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n\\t /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n\\t s.prev_length - MIN_MATCH, bflush);***/\\n\\t bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n\\t /* Insert in hash table all strings up to the end of the match.\\n\\t * strstart-1 and strstart are already inserted. If there is not\\n\\t * enough lookahead, the last two strings are not inserted in\\n\\t * the hash table.\\n\\t */\\n\\t s.lookahead -= s.prev_length - 1;\\n\\t s.prev_length -= 2;\\n\\t do {\\n\\t if (++s.strstart <= max_insert) {\\n\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t s.head[s.ins_h] = s.strstart;\\n\\t /***/\\n\\t }\\n\\t } while (--s.prev_length !== 0);\\n\\t s.match_available = 0;\\n\\t s.match_length = MIN_MATCH - 1;\\n\\t s.strstart++;\\n\\n\\t if (bflush) {\\n\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t flush_block_only(s, false);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t /***/\\n\\t }\\n\\t } else if (s.match_available) {\\n\\t /* If there was no match at the previous position, output a\\n\\t * single literal. If there was a match but the current match\\n\\t * is longer, truncate the previous match to a single literal.\\n\\t */\\n\\t //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n\\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n\\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n\\t if (bflush) {\\n\\t /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n\\t flush_block_only(s, false);\\n\\t /***/\\n\\t }\\n\\t s.strstart++;\\n\\t s.lookahead--;\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t } else {\\n\\t /* There is no previous match to compare with, wait for\\n\\t * the next step to decide.\\n\\t */\\n\\t s.match_available = 1;\\n\\t s.strstart++;\\n\\t s.lookahead--;\\n\\t }\\n\\t }\\n\\t //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n\\t if (s.match_available) {\\n\\t //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n\\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n\\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n\\t s.match_available = 0;\\n\\t }\\n\\t s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n\\t if (flush === Z_FINISH) {\\n\\t /*** FLUSH_BLOCK(s, 1); ***/\\n\\t flush_block_only(s, true);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_FINISH_STARTED;\\n\\t }\\n\\t /***/\\n\\t return BS_FINISH_DONE;\\n\\t }\\n\\t if (s.last_lit) {\\n\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t flush_block_only(s, false);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t /***/\\n\\t }\\n\\n\\t return BS_BLOCK_DONE;\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f104070965e8adc0fb83ca6b1a32878b\",\n \"score\": \"0.63928217\",\n \"text\": \"function deflate_fast(flush) {\\n// short hash_head = 0; // head of the hash chain\\nvar hash_head = 0; // head of the hash chain\\nvar bflush; // set if current block must be flushed\\nwhile (true) {\\n// Make sure that we always have enough lookahead, except\\n// at the end of the input file. We need MAX_MATCH bytes\\n// for the next match, plus MIN_MATCH bytes to insert the\\n// string following the next match.\\nif (lookahead < MIN_LOOKAHEAD) {\\nfill_window();\\nif (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\\nreturn NeedMore;\\n}\\nif (lookahead === 0)\\nbreak; // flush the current block\\n}\\n// Insert the string window[strstart .. strstart+2] in the\\n// dictionary, and set hash_head to the head of the hash chain:\\nif (lookahead >= MIN_MATCH) {\\nins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\\n// prev[strstart&w_mask]=hash_head=head[ins_h];\\nhash_head = (head[ins_h] & 0xffff);\\nprev[strstart & w_mask] = head[ins_h];\\nhead[ins_h] = strstart;\\n}\\n// Find the longest match, discarding those <= prev_length.\\n// At this point we have always match_length < MIN_MATCH\\nif (hash_head !== 0 && ((strstart - hash_head) & 0xffff) <= w_size - MIN_LOOKAHEAD) {\\n// To simplify the code, we prevent matches with the string\\n// of window index 0 (in particular we have to avoid a match\\n// of the string with itself at the start of the input file).\\nif (strategy != Z_HUFFMAN_ONLY) {\\nmatch_length = longest_match(hash_head);\\n}\\n// longest_match() sets match_start\\n}\\nif (match_length >= MIN_MATCH) {\\n// check_match(strstart, match_start, match_length);\\nbflush = _tr_tally(strstart - match_start, match_length - MIN_MATCH);\\nlookahead -= match_length;\\n// Insert new strings in the hash table only if the match length\\n// is not too large. This saves time but degrades compression.\\nif (match_length <= max_lazy_match && lookahead >= MIN_MATCH) {\\nmatch_length--; // string at strstart already in hash table\\ndo {\\nstrstart++;\\nins_h = ((ins_h << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\\n// prev[strstart&w_mask]=hash_head=head[ins_h];\\nhash_head = (head[ins_h] & 0xffff);\\nprev[strstart & w_mask] = head[ins_h];\\nhead[ins_h] = strstart;\\n// strstart never exceeds WSIZE-MAX_MATCH, so there are\\n// always MIN_MATCH bytes ahead.\\n} while (--match_length !== 0);\\nstrstart++;\\n} else {\\nstrstart += match_length;\\nmatch_length = 0;\\nins_h = window[strstart] & 0xff;\\nins_h = (((ins_h) << hash_shift) ^ (window[strstart + 1] & 0xff)) & hash_mask;\\n// If lookahead < MIN_MATCH, ins_h is garbage, but it does\\n// not\\n// matter since it will be recomputed at next deflate call.\\n}\\n} else {\\n// No match, output a literal byte\\nbflush = _tr_tally(0, window[strstart] & 0xff);\\nlookahead--;\\nstrstart++;\\n}\\nif (bflush) {\\nflush_block_only(false);\\nif (strm.avail_out === 0)\\nreturn NeedMore;\\n}\\n}\\nflush_block_only(flush == Z_FINISH);\\nif (strm.avail_out === 0) {\\nif (flush == Z_FINISH)\\nreturn FinishStarted;\\nelse\\nreturn NeedMore;\\n}\\nreturn flush == Z_FINISH ? FinishDone : BlockDone;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00c4b65a8a31f003603939c3ba135484\",\n \"score\": \"0.6382474\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) {\\n break;\\n } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0 /*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0 /*NIL*/ && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD /*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096 /*TOO_FAR*/)) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"262d13b90e64cf7b2022cded1d827cd0\",\n \"score\": \"0.63665056\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) {\\n break;\\n } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0;\\n /*NIL*/if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0 /*NIL*/ && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD /*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096 /*TOO_FAR*/)) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16452f6a746aec50b194579bcf75b70a\",\n \"score\": \"0.63631576\",\n \"text\": \"function deflate_slow(s, flush) {\\n\\t\\t var hash_head; /* head of hash chain */\\n\\t\\t var bflush; /* set if current block must be flushed */\\n\\n\\t\\t var max_insert;\\n\\n\\t\\t /* Process the input block. */\\n\\t\\t for (;;) {\\n\\t\\t /* Make sure that we always have enough lookahead, except\\n\\t\\t * at the end of the input file. We need MAX_MATCH bytes\\n\\t\\t * for the next match, plus MIN_MATCH bytes to insert the\\n\\t\\t * string following the next match.\\n\\t\\t */\\n\\t\\t if (s.lookahead < MIN_LOOKAHEAD) {\\n\\t\\t fill_window(s);\\n\\t\\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n\\t\\t return BS_NEED_MORE;\\n\\t\\t }\\n\\t\\t if (s.lookahead === 0) { break; } /* flush the current block */\\n\\t\\t }\\n\\n\\t\\t /* Insert the string window[strstart .. strstart+2] in the\\n\\t\\t * dictionary, and set hash_head to the head of the hash chain:\\n\\t\\t */\\n\\t\\t hash_head = 0/*NIL*/;\\n\\t\\t if (s.lookahead >= MIN_MATCH) {\\n\\t\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t\\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t\\t s.head[s.ins_h] = s.strstart;\\n\\t\\t /***/\\n\\t\\t }\\n\\n\\t\\t /* Find the longest match, discarding those <= prev_length.\\n\\t\\t */\\n\\t\\t s.prev_length = s.match_length;\\n\\t\\t s.prev_match = s.match_start;\\n\\t\\t s.match_length = MIN_MATCH - 1;\\n\\n\\t\\t if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n\\t\\t s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n\\t\\t /* To simplify the code, we prevent matches with the string\\n\\t\\t * of window index 0 (in particular we have to avoid a match\\n\\t\\t * of the string with itself at the start of the input file).\\n\\t\\t */\\n\\t\\t s.match_length = longest_match(s, hash_head);\\n\\t\\t /* longest_match() sets match_start */\\n\\n\\t\\t if (s.match_length <= 5 &&\\n\\t\\t (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n\\t\\t /* If prev_match is also MIN_MATCH, match_start is garbage\\n\\t\\t * but we will ignore the current match anyway.\\n\\t\\t */\\n\\t\\t s.match_length = MIN_MATCH - 1;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t /* If there was a match at the previous step and the current\\n\\t\\t * match is not better, output the previous match:\\n\\t\\t */\\n\\t\\t if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n\\t\\t max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n\\t\\t /* Do not insert strings in hash table beyond this. */\\n\\n\\t\\t //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n\\t\\t /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n\\t\\t s.prev_length - MIN_MATCH, bflush);***/\\n\\t\\t bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n\\t\\t /* Insert in hash table all strings up to the end of the match.\\n\\t\\t * strstart-1 and strstart are already inserted. If there is not\\n\\t\\t * enough lookahead, the last two strings are not inserted in\\n\\t\\t * the hash table.\\n\\t\\t */\\n\\t\\t s.lookahead -= s.prev_length - 1;\\n\\t\\t s.prev_length -= 2;\\n\\t\\t do {\\n\\t\\t if (++s.strstart <= max_insert) {\\n\\t\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t\\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t\\t s.head[s.ins_h] = s.strstart;\\n\\t\\t /***/\\n\\t\\t }\\n\\t\\t } while (--s.prev_length !== 0);\\n\\t\\t s.match_available = 0;\\n\\t\\t s.match_length = MIN_MATCH - 1;\\n\\t\\t s.strstart++;\\n\\n\\t\\t if (bflush) {\\n\\t\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t\\t flush_block_only(s, false);\\n\\t\\t if (s.strm.avail_out === 0) {\\n\\t\\t return BS_NEED_MORE;\\n\\t\\t }\\n\\t\\t /***/\\n\\t\\t }\\n\\n\\t\\t } else if (s.match_available) {\\n\\t\\t /* If there was no match at the previous position, output a\\n\\t\\t * single literal. If there was a match but the current match\\n\\t\\t * is longer, truncate the previous match to a single literal.\\n\\t\\t */\\n\\t\\t //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n\\t\\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n\\t\\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n\\t\\t if (bflush) {\\n\\t\\t /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n\\t\\t flush_block_only(s, false);\\n\\t\\t /***/\\n\\t\\t }\\n\\t\\t s.strstart++;\\n\\t\\t s.lookahead--;\\n\\t\\t if (s.strm.avail_out === 0) {\\n\\t\\t return BS_NEED_MORE;\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t /* There is no previous match to compare with, wait for\\n\\t\\t * the next step to decide.\\n\\t\\t */\\n\\t\\t s.match_available = 1;\\n\\t\\t s.strstart++;\\n\\t\\t s.lookahead--;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n\\t\\t if (s.match_available) {\\n\\t\\t //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n\\t\\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n\\t\\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n\\t\\t s.match_available = 0;\\n\\t\\t }\\n\\t\\t s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n\\t\\t if (flush === Z_FINISH) {\\n\\t\\t /*** FLUSH_BLOCK(s, 1); ***/\\n\\t\\t flush_block_only(s, true);\\n\\t\\t if (s.strm.avail_out === 0) {\\n\\t\\t return BS_FINISH_STARTED;\\n\\t\\t }\\n\\t\\t /***/\\n\\t\\t return BS_FINISH_DONE;\\n\\t\\t }\\n\\t\\t if (s.last_lit) {\\n\\t\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t\\t flush_block_only(s, false);\\n\\t\\t if (s.strm.avail_out === 0) {\\n\\t\\t return BS_NEED_MORE;\\n\\t\\t }\\n\\t\\t /***/\\n\\t\\t }\\n\\n\\t\\t return BS_BLOCK_DONE;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e89c6eb7fa181cff76630a939a0dfc1d\",\n \"score\": \"0.6344129\",\n \"text\": \"function deflate_fast(s, flush) {\\n\\t\\t var hash_head; /* head of the hash chain */\\n\\t\\t var bflush; /* set if current block must be flushed */\\n\\n\\t\\t for (;;) {\\n\\t\\t /* Make sure that we always have enough lookahead, except\\n\\t\\t * at the end of the input file. We need MAX_MATCH bytes\\n\\t\\t * for the next match, plus MIN_MATCH bytes to insert the\\n\\t\\t * string following the next match.\\n\\t\\t */\\n\\t\\t if (s.lookahead < MIN_LOOKAHEAD) {\\n\\t\\t fill_window(s);\\n\\t\\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n\\t\\t return BS_NEED_MORE;\\n\\t\\t }\\n\\t\\t if (s.lookahead === 0) {\\n\\t\\t break; /* flush the current block */\\n\\t\\t }\\n\\t\\t }\\n\\n\\t\\t /* Insert the string window[strstart .. strstart+2] in the\\n\\t\\t * dictionary, and set hash_head to the head of the hash chain:\\n\\t\\t */\\n\\t\\t hash_head = 0/*NIL*/;\\n\\t\\t if (s.lookahead >= MIN_MATCH) {\\n\\t\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t\\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t\\t s.head[s.ins_h] = s.strstart;\\n\\t\\t /***/\\n\\t\\t }\\n\\n\\t\\t /* Find the longest match, discarding those <= prev_length.\\n\\t\\t * At this point we have always match_length < MIN_MATCH\\n\\t\\t */\\n\\t\\t if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\\n\\t\\t /* To simplify the code, we prevent matches with the string\\n\\t\\t * of window index 0 (in particular we have to avoid a match\\n\\t\\t * of the string with itself at the start of the input file).\\n\\t\\t */\\n\\t\\t s.match_length = longest_match(s, hash_head);\\n\\t\\t /* longest_match() sets match_start */\\n\\t\\t }\\n\\t\\t if (s.match_length >= MIN_MATCH) {\\n\\t\\t // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\\n\\n\\t\\t /*** _tr_tally_dist(s, s.strstart - s.match_start,\\n\\t\\t s.match_length - MIN_MATCH, bflush); ***/\\n\\t\\t bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\\n\\n\\t\\t s.lookahead -= s.match_length;\\n\\n\\t\\t /* Insert new strings in the hash table only if the match length\\n\\t\\t * is not too large. This saves time but degrades compression.\\n\\t\\t */\\n\\t\\t if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\\n\\t\\t s.match_length--; /* string at strstart already in table */\\n\\t\\t do {\\n\\t\\t s.strstart++;\\n\\t\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t\\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t\\t s.head[s.ins_h] = s.strstart;\\n\\t\\t /***/\\n\\t\\t /* strstart never exceeds WSIZE-MAX_MATCH, so there are\\n\\t\\t * always MIN_MATCH bytes ahead.\\n\\t\\t */\\n\\t\\t } while (--s.match_length !== 0);\\n\\t\\t s.strstart++;\\n\\t\\t } else\\n\\t\\t {\\n\\t\\t s.strstart += s.match_length;\\n\\t\\t s.match_length = 0;\\n\\t\\t s.ins_h = s.window[s.strstart];\\n\\t\\t /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\\n\\t\\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\\n\\n\\t\\t//#if MIN_MATCH != 3\\n\\t\\t// Call UPDATE_HASH() MIN_MATCH-3 more times\\n\\t\\t//#endif\\n\\t\\t /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\\n\\t\\t * matter since it will be recomputed at next deflate call.\\n\\t\\t */\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t /* No match, output a literal byte */\\n\\t\\t //Tracevv((stderr,\\\"%c\\\", s.window[s.strstart]));\\n\\t\\t /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\\n\\t\\t bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\\n\\n\\t\\t s.lookahead--;\\n\\t\\t s.strstart++;\\n\\t\\t }\\n\\t\\t if (bflush) {\\n\\t\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t\\t flush_block_only(s, false);\\n\\t\\t if (s.strm.avail_out === 0) {\\n\\t\\t return BS_NEED_MORE;\\n\\t\\t }\\n\\t\\t /***/\\n\\t\\t }\\n\\t\\t }\\n\\t\\t s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\\n\\t\\t if (flush === Z_FINISH) {\\n\\t\\t /*** FLUSH_BLOCK(s, 1); ***/\\n\\t\\t flush_block_only(s, true);\\n\\t\\t if (s.strm.avail_out === 0) {\\n\\t\\t return BS_FINISH_STARTED;\\n\\t\\t }\\n\\t\\t /***/\\n\\t\\t return BS_FINISH_DONE;\\n\\t\\t }\\n\\t\\t if (s.last_lit) {\\n\\t\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t\\t flush_block_only(s, false);\\n\\t\\t if (s.strm.avail_out === 0) {\\n\\t\\t return BS_NEED_MORE;\\n\\t\\t }\\n\\t\\t /***/\\n\\t\\t }\\n\\t\\t return BS_BLOCK_DONE;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbb01b7ec6bbf50aa40f009c8713dba\",\n \"score\": \"0.63382655\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7a79b6c8b430c2f1a9dd4a1a7b61be7\",\n \"score\": \"0.6337994\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH-1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH-1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length-1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH-1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec097776686cb5e94c81cb386fc378c1\",\n \"score\": \"0.6335972\",\n \"text\": \"function deflate_slow(flush) {\\n\\t\\t\\t// short hash_head = 0; // head of hash chain\\n\\t\\t\\tvar hash_head = 0; // head of hash chain\\n\\t\\t\\tvar bflush; // set if current block must be flushed\\n\\t\\t\\tvar max_insert;\\n\\n\\t\\t\\t// Process the input block.\\n\\t\\t\\twhile (true) {\\n\\t\\t\\t\\t// Make sure that we always have enough lookahead, except\\n\\t\\t\\t\\t// at the end of the input file. We need MAX_MATCH bytes\\n\\t\\t\\t\\t// for the next match, plus MIN_MATCH bytes to insert the\\n\\t\\t\\t\\t// string following the next match.\\n\\n\\t\\t\\t\\tif (lookahead < MIN_LOOKAHEAD) {\\n\\t\\t\\t\\t\\tfill_window();\\n\\t\\t\\t\\t\\tif (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\\n\\t\\t\\t\\t\\t\\treturn NeedMore;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (lookahead === 0)\\n\\t\\t\\t\\t\\t\\tbreak; // flush the current block\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// Insert the string window[strstart .. strstart+2] in the\\n\\t\\t\\t\\t// dictionary, and set hash_head to the head of the hash chain:\\n\\n\\t\\t\\t\\tif (lookahead >= MIN_MATCH) {\\n\\t\\t\\t\\t\\tins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\\n\\t\\t\\t\\t\\t// prev[strstart&w_mask]=hash_head=head[ins_h];\\n\\t\\t\\t\\t\\thash_head = (head[ins_h] & 0xffff);\\n\\t\\t\\t\\t\\tprev[strstart & w_mask] = head[ins_h];\\n\\t\\t\\t\\t\\thead[ins_h] = strstart;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// Find the longest match, discarding those <= prev_length.\\n\\t\\t\\t\\tprev_length = match_length;\\n\\t\\t\\t\\tprev_match = match_start;\\n\\t\\t\\t\\tmatch_length = MIN_MATCH - 1;\\n\\n\\t\\t\\t\\tif (hash_head !== 0 && prev_length < max_lazy_match && ((strstart - hash_head) & 0xffff) <= w_size - MIN_LOOKAHEAD) {\\n\\t\\t\\t\\t\\t// To simplify the code, we prevent matches with the string\\n\\t\\t\\t\\t\\t// of window index 0 (in particular we have to avoid a match\\n\\t\\t\\t\\t\\t// of the string with itself at the start of the input file).\\n\\n\\t\\t\\t\\t\\tif (strategy != Z_HUFFMAN_ONLY) {\\n\\t\\t\\t\\t\\t\\tmatch_length = longest_match(hash_head);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t// longest_match() sets match_start\\n\\n\\t\\t\\t\\t\\tif (match_length <= 5 && (strategy == Z_FILTERED || (match_length == MIN_MATCH && strstart - match_start > 4096))) {\\n\\n\\t\\t\\t\\t\\t\\t// If prev_match is also MIN_MATCH, match_start is garbage\\n\\t\\t\\t\\t\\t\\t// but we will ignore the current match anyway.\\n\\t\\t\\t\\t\\t\\tmatch_length = MIN_MATCH - 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// If there was a match at the previous step and the current\\n\\t\\t\\t\\t// match is not better, output the previous match:\\n\\t\\t\\t\\tif (prev_length >= MIN_MATCH && match_length <= prev_length) {\\n\\t\\t\\t\\t\\tmax_insert = strstart + lookahead - MIN_MATCH;\\n\\t\\t\\t\\t\\t// Do not insert strings in hash table beyond this.\\n\\n\\t\\t\\t\\t\\t// check_match(strstart-1, prev_match, prev_length);\\n\\n\\t\\t\\t\\t\\tbflush = _tr_tally(strstart - 1 - prev_match, prev_length - MIN_MATCH);\\n\\n\\t\\t\\t\\t\\t// Insert in hash table all strings up to the end of the match.\\n\\t\\t\\t\\t\\t// strstart-1 and strstart are already inserted. If there is not\\n\\t\\t\\t\\t\\t// enough lookahead, the last two strings are not inserted in\\n\\t\\t\\t\\t\\t// the hash table.\\n\\t\\t\\t\\t\\tlookahead -= prev_length - 1;\\n\\t\\t\\t\\t\\tprev_length -= 2;\\n\\t\\t\\t\\t\\tdo {\\n\\t\\t\\t\\t\\t\\tif (++strstart <= max_insert) {\\n\\t\\t\\t\\t\\t\\t\\tins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\\n\\t\\t\\t\\t\\t\\t\\t// prev[strstart&w_mask]=hash_head=head[ins_h];\\n\\t\\t\\t\\t\\t\\t\\thash_head = (head[ins_h] & 0xffff);\\n\\t\\t\\t\\t\\t\\t\\tprev[strstart & w_mask] = head[ins_h];\\n\\t\\t\\t\\t\\t\\t\\thead[ins_h] = strstart;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t} while (--prev_length !== 0);\\n\\t\\t\\t\\t\\tmatch_available = 0;\\n\\t\\t\\t\\t\\tmatch_length = MIN_MATCH - 1;\\n\\t\\t\\t\\t\\tstrstart++;\\n\\n\\t\\t\\t\\t\\tif (bflush) {\\n\\t\\t\\t\\t\\t\\tflush_block_only(false);\\n\\t\\t\\t\\t\\t\\tif (strm.avail_out === 0)\\n\\t\\t\\t\\t\\t\\t\\treturn NeedMore;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else if (match_available !== 0) {\\n\\n\\t\\t\\t\\t\\t// If there was no match at the previous position, output a\\n\\t\\t\\t\\t\\t// single literal. If there was a match but the current match\\n\\t\\t\\t\\t\\t// is longer, truncate the previous match to a single literal.\\n\\n\\t\\t\\t\\t\\tbflush = _tr_tally(0, window[strstart - 1] & 0xff);\\n\\n\\t\\t\\t\\t\\tif (bflush) {\\n\\t\\t\\t\\t\\t\\tflush_block_only(false);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tstrstart++;\\n\\t\\t\\t\\t\\tlookahead--;\\n\\t\\t\\t\\t\\tif (strm.avail_out === 0)\\n\\t\\t\\t\\t\\t\\treturn NeedMore;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t// There is no previous match to compare with, wait for\\n\\t\\t\\t\\t\\t// the next step to decide.\\n\\n\\t\\t\\t\\t\\tmatch_available = 1;\\n\\t\\t\\t\\t\\tstrstart++;\\n\\t\\t\\t\\t\\tlookahead--;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (match_available !== 0) {\\n\\t\\t\\t\\tbflush = _tr_tally(0, window[strstart - 1] & 0xff);\\n\\t\\t\\t\\tmatch_available = 0;\\n\\t\\t\\t}\\n\\t\\t\\tflush_block_only(flush == Z_FINISH);\\n\\n\\t\\t\\tif (strm.avail_out === 0) {\\n\\t\\t\\t\\tif (flush == Z_FINISH)\\n\\t\\t\\t\\t\\treturn FinishStarted;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\treturn NeedMore;\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn flush == Z_FINISH ? FinishDone : BlockDone;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81f958b4900f67c6970f36348777661d\",\n \"score\": \"0.63294035\",\n \"text\": \"function deflate_slow(s, flush) {\\r\\n var hash_head; /* head of hash chain */\\r\\n var bflush; /* set if current block must be flushed */\\r\\n\\r\\n var max_insert;\\r\\n\\r\\n /* Process the input block. */\\r\\n for (;;) {\\r\\n /* Make sure that we always have enough lookahead, except\\r\\n * at the end of the input file. We need MAX_MATCH bytes\\r\\n * for the next match, plus MIN_MATCH bytes to insert the\\r\\n * string following the next match.\\r\\n */\\r\\n if (s.lookahead < MIN_LOOKAHEAD) {\\r\\n fill_window(s);\\r\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\r\\n return BS_NEED_MORE;\\r\\n }\\r\\n if (s.lookahead === 0) { break; } /* flush the current block */\\r\\n }\\r\\n\\r\\n /* Insert the string window[strstart .. strstart+2] in the\\r\\n * dictionary, and set hash_head to the head of the hash chain:\\r\\n */\\r\\n hash_head = 0/*NIL*/;\\r\\n if (s.lookahead >= MIN_MATCH) {\\r\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\r\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\r\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\r\\n s.head[s.ins_h] = s.strstart;\\r\\n /***/\\r\\n }\\r\\n\\r\\n /* Find the longest match, discarding those <= prev_length.\\r\\n */\\r\\n s.prev_length = s.match_length;\\r\\n s.prev_match = s.match_start;\\r\\n s.match_length = MIN_MATCH - 1;\\r\\n\\r\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\r\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\r\\n /* To simplify the code, we prevent matches with the string\\r\\n * of window index 0 (in particular we have to avoid a match\\r\\n * of the string with itself at the start of the input file).\\r\\n */\\r\\n s.match_length = longest_match(s, hash_head);\\r\\n /* longest_match() sets match_start */\\r\\n\\r\\n if (s.match_length <= 5 &&\\r\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\r\\n\\r\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\r\\n * but we will ignore the current match anyway.\\r\\n */\\r\\n s.match_length = MIN_MATCH - 1;\\r\\n }\\r\\n }\\r\\n /* If there was a match at the previous step and the current\\r\\n * match is not better, output the previous match:\\r\\n */\\r\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\r\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\r\\n /* Do not insert strings in hash table beyond this. */\\r\\n\\r\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\r\\n\\r\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\r\\n s.prev_length - MIN_MATCH, bflush);***/\\r\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\r\\n /* Insert in hash table all strings up to the end of the match.\\r\\n * strstart-1 and strstart are already inserted. If there is not\\r\\n * enough lookahead, the last two strings are not inserted in\\r\\n * the hash table.\\r\\n */\\r\\n s.lookahead -= s.prev_length - 1;\\r\\n s.prev_length -= 2;\\r\\n do {\\r\\n if (++s.strstart <= max_insert) {\\r\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\r\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\r\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\r\\n s.head[s.ins_h] = s.strstart;\\r\\n /***/\\r\\n }\\r\\n } while (--s.prev_length !== 0);\\r\\n s.match_available = 0;\\r\\n s.match_length = MIN_MATCH - 1;\\r\\n s.strstart++;\\r\\n\\r\\n if (bflush) {\\r\\n /*** FLUSH_BLOCK(s, 0); ***/\\r\\n flush_block_only(s, false);\\r\\n if (s.strm.avail_out === 0) {\\r\\n return BS_NEED_MORE;\\r\\n }\\r\\n /***/\\r\\n }\\r\\n\\r\\n } else if (s.match_available) {\\r\\n /* If there was no match at the previous position, output a\\r\\n * single literal. If there was a match but the current match\\r\\n * is longer, truncate the previous match to a single literal.\\r\\n */\\r\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\r\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\r\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\r\\n\\r\\n if (bflush) {\\r\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\r\\n flush_block_only(s, false);\\r\\n /***/\\r\\n }\\r\\n s.strstart++;\\r\\n s.lookahead--;\\r\\n if (s.strm.avail_out === 0) {\\r\\n return BS_NEED_MORE;\\r\\n }\\r\\n } else {\\r\\n /* There is no previous match to compare with, wait for\\r\\n * the next step to decide.\\r\\n */\\r\\n s.match_available = 1;\\r\\n s.strstart++;\\r\\n s.lookahead--;\\r\\n }\\r\\n }\\r\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\r\\n if (s.match_available) {\\r\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\r\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\r\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\r\\n\\r\\n s.match_available = 0;\\r\\n }\\r\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\r\\n if (flush === Z_FINISH) {\\r\\n /*** FLUSH_BLOCK(s, 1); ***/\\r\\n flush_block_only(s, true);\\r\\n if (s.strm.avail_out === 0) {\\r\\n return BS_FINISH_STARTED;\\r\\n }\\r\\n /***/\\r\\n return BS_FINISH_DONE;\\r\\n }\\r\\n if (s.last_lit) {\\r\\n /*** FLUSH_BLOCK(s, 0); ***/\\r\\n flush_block_only(s, false);\\r\\n if (s.strm.avail_out === 0) {\\r\\n return BS_NEED_MORE;\\r\\n }\\r\\n /***/\\r\\n }\\r\\n\\r\\n return BS_BLOCK_DONE;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81f958b4900f67c6970f36348777661d\",\n \"score\": \"0.63294035\",\n \"text\": \"function deflate_slow(s, flush) {\\r\\n var hash_head; /* head of hash chain */\\r\\n var bflush; /* set if current block must be flushed */\\r\\n\\r\\n var max_insert;\\r\\n\\r\\n /* Process the input block. */\\r\\n for (;;) {\\r\\n /* Make sure that we always have enough lookahead, except\\r\\n * at the end of the input file. We need MAX_MATCH bytes\\r\\n * for the next match, plus MIN_MATCH bytes to insert the\\r\\n * string following the next match.\\r\\n */\\r\\n if (s.lookahead < MIN_LOOKAHEAD) {\\r\\n fill_window(s);\\r\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\r\\n return BS_NEED_MORE;\\r\\n }\\r\\n if (s.lookahead === 0) { break; } /* flush the current block */\\r\\n }\\r\\n\\r\\n /* Insert the string window[strstart .. strstart+2] in the\\r\\n * dictionary, and set hash_head to the head of the hash chain:\\r\\n */\\r\\n hash_head = 0/*NIL*/;\\r\\n if (s.lookahead >= MIN_MATCH) {\\r\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\r\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\r\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\r\\n s.head[s.ins_h] = s.strstart;\\r\\n /***/\\r\\n }\\r\\n\\r\\n /* Find the longest match, discarding those <= prev_length.\\r\\n */\\r\\n s.prev_length = s.match_length;\\r\\n s.prev_match = s.match_start;\\r\\n s.match_length = MIN_MATCH - 1;\\r\\n\\r\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\r\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\r\\n /* To simplify the code, we prevent matches with the string\\r\\n * of window index 0 (in particular we have to avoid a match\\r\\n * of the string with itself at the start of the input file).\\r\\n */\\r\\n s.match_length = longest_match(s, hash_head);\\r\\n /* longest_match() sets match_start */\\r\\n\\r\\n if (s.match_length <= 5 &&\\r\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\r\\n\\r\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\r\\n * but we will ignore the current match anyway.\\r\\n */\\r\\n s.match_length = MIN_MATCH - 1;\\r\\n }\\r\\n }\\r\\n /* If there was a match at the previous step and the current\\r\\n * match is not better, output the previous match:\\r\\n */\\r\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\r\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\r\\n /* Do not insert strings in hash table beyond this. */\\r\\n\\r\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\r\\n\\r\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\r\\n s.prev_length - MIN_MATCH, bflush);***/\\r\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\r\\n /* Insert in hash table all strings up to the end of the match.\\r\\n * strstart-1 and strstart are already inserted. If there is not\\r\\n * enough lookahead, the last two strings are not inserted in\\r\\n * the hash table.\\r\\n */\\r\\n s.lookahead -= s.prev_length - 1;\\r\\n s.prev_length -= 2;\\r\\n do {\\r\\n if (++s.strstart <= max_insert) {\\r\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\r\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\r\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\r\\n s.head[s.ins_h] = s.strstart;\\r\\n /***/\\r\\n }\\r\\n } while (--s.prev_length !== 0);\\r\\n s.match_available = 0;\\r\\n s.match_length = MIN_MATCH - 1;\\r\\n s.strstart++;\\r\\n\\r\\n if (bflush) {\\r\\n /*** FLUSH_BLOCK(s, 0); ***/\\r\\n flush_block_only(s, false);\\r\\n if (s.strm.avail_out === 0) {\\r\\n return BS_NEED_MORE;\\r\\n }\\r\\n /***/\\r\\n }\\r\\n\\r\\n } else if (s.match_available) {\\r\\n /* If there was no match at the previous position, output a\\r\\n * single literal. If there was a match but the current match\\r\\n * is longer, truncate the previous match to a single literal.\\r\\n */\\r\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\r\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\r\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\r\\n\\r\\n if (bflush) {\\r\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\r\\n flush_block_only(s, false);\\r\\n /***/\\r\\n }\\r\\n s.strstart++;\\r\\n s.lookahead--;\\r\\n if (s.strm.avail_out === 0) {\\r\\n return BS_NEED_MORE;\\r\\n }\\r\\n } else {\\r\\n /* There is no previous match to compare with, wait for\\r\\n * the next step to decide.\\r\\n */\\r\\n s.match_available = 1;\\r\\n s.strstart++;\\r\\n s.lookahead--;\\r\\n }\\r\\n }\\r\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\r\\n if (s.match_available) {\\r\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\r\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\r\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\r\\n\\r\\n s.match_available = 0;\\r\\n }\\r\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\r\\n if (flush === Z_FINISH) {\\r\\n /*** FLUSH_BLOCK(s, 1); ***/\\r\\n flush_block_only(s, true);\\r\\n if (s.strm.avail_out === 0) {\\r\\n return BS_FINISH_STARTED;\\r\\n }\\r\\n /***/\\r\\n return BS_FINISH_DONE;\\r\\n }\\r\\n if (s.last_lit) {\\r\\n /*** FLUSH_BLOCK(s, 0); ***/\\r\\n flush_block_only(s, false);\\r\\n if (s.strm.avail_out === 0) {\\r\\n return BS_NEED_MORE;\\r\\n }\\r\\n /***/\\r\\n }\\r\\n\\r\\n return BS_BLOCK_DONE;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55ea0bda49ce789b47f12f6c122f1cef\",\n \"score\": \"0.6320948\",\n \"text\": \"function deflate_slow(s, flush) {\\n var hash_head; /* head of hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n var max_insert;\\n\\n /* Process the input block. */\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$1) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) { break; } /* flush the current block */\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0/*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n */\\n s.prev_length = s.match_length;\\n s.prev_match = s.match_start;\\n s.match_length = MIN_MATCH - 1;\\n\\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n\\n if (s.match_length <= 5 &&\\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\n /* If prev_match is also MIN_MATCH, match_start is garbage\\n * but we will ignore the current match anyway.\\n */\\n s.match_length = MIN_MATCH - 1;\\n }\\n }\\n /* If there was a match at the previous step and the current\\n * match is not better, output the previous match:\\n */\\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n /* Do not insert strings in hash table beyond this. */\\n\\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n s.prev_length - MIN_MATCH, bflush);***/\\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n /* Insert in hash table all strings up to the end of the match.\\n * strstart-1 and strstart are already inserted. If there is not\\n * enough lookahead, the last two strings are not inserted in\\n * the hash table.\\n */\\n s.lookahead -= s.prev_length - 1;\\n s.prev_length -= 2;\\n do {\\n if (++s.strstart <= max_insert) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n } while (--s.prev_length !== 0);\\n s.match_available = 0;\\n s.match_length = MIN_MATCH - 1;\\n s.strstart++;\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n } else if (s.match_available) {\\n /* If there was no match at the previous position, output a\\n * single literal. If there was a match but the current match\\n * is longer, truncate the previous match to a single literal.\\n */\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n if (bflush) {\\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n flush_block_only(s, false);\\n /***/\\n }\\n s.strstart++;\\n s.lookahead--;\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n } else {\\n /* There is no previous match to compare with, wait for\\n * the next step to decide.\\n */\\n s.match_available = 1;\\n s.strstart++;\\n s.lookahead--;\\n }\\n }\\n //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n if (s.match_available) {\\n //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\n s.match_available = 0;\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH$2) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc25e8accda80aec5d2da86ceb181ae4\",\n \"score\": \"0.63184196\",\n \"text\": \"function deflate_fast(s, flush) {\\n\\t var hash_head; /* head of the hash chain */\\n\\t var bflush; /* set if current block must be flushed */\\n\\n\\t for (;;) {\\n\\t /* Make sure that we always have enough lookahead, except\\n\\t * at the end of the input file. We need MAX_MATCH bytes\\n\\t * for the next match, plus MIN_MATCH bytes to insert the\\n\\t * string following the next match.\\n\\t */\\n\\t if (s.lookahead < MIN_LOOKAHEAD) {\\n\\t fill_window(s);\\n\\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t if (s.lookahead === 0) {\\n\\t break; /* flush the current block */\\n\\t }\\n\\t }\\n\\n\\t /* Insert the string window[strstart .. strstart+2] in the\\n\\t * dictionary, and set hash_head to the head of the hash chain:\\n\\t */\\n\\t hash_head = 0 /*NIL*/;\\n\\t if (s.lookahead >= MIN_MATCH) {\\n\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t s.head[s.ins_h] = s.strstart;\\n\\t /***/\\n\\t }\\n\\n\\t /* Find the longest match, discarding those <= prev_length.\\n\\t * At this point we have always match_length < MIN_MATCH\\n\\t */\\n\\t if (hash_head !== 0 /*NIL*/ && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) {\\n\\t /* To simplify the code, we prevent matches with the string\\n\\t * of window index 0 (in particular we have to avoid a match\\n\\t * of the string with itself at the start of the input file).\\n\\t */\\n\\t s.match_length = longest_match(s, hash_head);\\n\\t /* longest_match() sets match_start */\\n\\t }\\n\\t if (s.match_length >= MIN_MATCH) {\\n\\t // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\\n\\n\\t /*** _tr_tally_dist(s, s.strstart - s.match_start,\\n\\t s.match_length - MIN_MATCH, bflush); ***/\\n\\t bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\\n\\n\\t s.lookahead -= s.match_length;\\n\\n\\t /* Insert new strings in the hash table only if the match length\\n\\t * is not too large. This saves time but degrades compression.\\n\\t */\\n\\t if (s.match_length <= s.max_lazy_match /*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\\n\\t s.match_length--; /* string at strstart already in table */\\n\\t do {\\n\\t s.strstart++;\\n\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t s.head[s.ins_h] = s.strstart;\\n\\t /***/\\n\\t /* strstart never exceeds WSIZE-MAX_MATCH, so there are\\n\\t * always MIN_MATCH bytes ahead.\\n\\t */\\n\\t } while (--s.match_length !== 0);\\n\\t s.strstart++;\\n\\t } else {\\n\\t s.strstart += s.match_length;\\n\\t s.match_length = 0;\\n\\t s.ins_h = s.window[s.strstart];\\n\\t /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\\n\\t s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + 1]) & s.hash_mask;\\n\\n\\t //#if MIN_MATCH != 3\\n\\t // Call UPDATE_HASH() MIN_MATCH-3 more times\\n\\t //#endif\\n\\t /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\\n\\t * matter since it will be recomputed at next deflate call.\\n\\t */\\n\\t }\\n\\t } else {\\n\\t /* No match, output a literal byte */\\n\\t //Tracevv((stderr,\\\"%c\\\", s.window[s.strstart]));\\n\\t /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\\n\\t bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\\n\\n\\t s.lookahead--;\\n\\t s.strstart++;\\n\\t }\\n\\t if (bflush) {\\n\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t flush_block_only(s, false);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t /***/\\n\\t }\\n\\t }\\n\\t s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n\\t if (flush === Z_FINISH) {\\n\\t /*** FLUSH_BLOCK(s, 1); ***/\\n\\t flush_block_only(s, true);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_FINISH_STARTED;\\n\\t }\\n\\t /***/\\n\\t return BS_FINISH_DONE;\\n\\t }\\n\\t if (s.last_lit) {\\n\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t flush_block_only(s, false);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t /***/\\n\\t }\\n\\t return BS_BLOCK_DONE;\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6437fc7decc81947736637e9566d36f0\",\n \"score\": \"0.63000244\",\n \"text\": \"function deflate_fast(s, flush) {\\n var hash_head; /* head of the hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) {\\n break; /* flush the current block */\\n }\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0 /*NIL*/;\\n if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n * At this point we have always match_length < MIN_MATCH\\n */\\n if (hash_head !== 0 /*NIL*/ && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n }\\n if (s.match_length >= MIN_MATCH) {\\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\\n\\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\\n s.match_length - MIN_MATCH, bflush); ***/\\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\\n\\n s.lookahead -= s.match_length;\\n\\n /* Insert new strings in the hash table only if the match length\\n * is not too large. This saves time but degrades compression.\\n */\\n if (s.match_length <= s.max_lazy_match /*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\\n s.match_length--; /* string at strstart already in table */\\n do {\\n s.strstart++;\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\\n * always MIN_MATCH bytes ahead.\\n */\\n } while (--s.match_length !== 0);\\n s.strstart++;\\n } else {\\n s.strstart += s.match_length;\\n s.match_length = 0;\\n s.ins_h = s.window[s.strstart];\\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + 1]) & s.hash_mask;\\n\\n //#if MIN_MATCH != 3\\n // Call UPDATE_HASH() MIN_MATCH-3 more times\\n //#endif\\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\\n * matter since it will be recomputed at next deflate call.\\n */\\n }\\n } else {\\n /* No match, output a literal byte */\\n //Tracevv((stderr,\\\"%c\\\", s.window[s.strstart]));\\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\\n\\n s.lookahead--;\\n s.strstart++;\\n }\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68c2db5c656aff886897f63838a6ed2e\",\n \"score\": \"0.6284709\",\n \"text\": \"function compress_block(s,ltree,dtree) // deflate_state *s;\\n // const ct_data *ltree; /* literal tree */\\n // const ct_data *dtree; /* distance tree */\\n {var dist; /* distance of matched string */var lc; /* match length or unmatched char (if dist == 0) */var lx=0; /* running index in l_buf */var code; /* the code to send */var extra; /* number of extra bits to send */if(s.last_lit!==0){do {dist=s.pending_buf[s.d_buf+lx*2]<<8|s.pending_buf[s.d_buf+lx*2+1];lc=s.pending_buf[s.l_buf+lx];lx++;if(dist===0){send_code(s,lc,ltree); /* send a literal byte */ //Tracecv(isgraph(lc), (stderr,\\\" '%c' \\\", lc));\\n }else { /* Here, lc is the match length - MIN_MATCH */code=_length_code[lc];send_code(s,code+LITERALS+1,ltree); /* send the length code */extra=extra_lbits[code];if(extra!==0){lc-=base_length[code];send_bits(s,lc,extra); /* send the extra length bits */}dist--; /* dist is now the match distance - 1 */code=d_code(dist); //Assert (code < D_CODES, \\\"bad d_code\\\");\\n send_code(s,code,dtree); /* send the distance code */extra=extra_dbits[code];if(extra!==0){dist-=base_dist[code];send_bits(s,dist,extra); /* send the extra distance bits */}} /* literal or match pair ? */ /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */ //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\\n // \\\"pendingBuf overflow\\\");\\n }while(lx<s.last_lit);}send_code(s,END_BLOCK,ltree);}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e0844e35e428fc6b394c85e2789d870\",\n \"score\": \"0.6281818\",\n \"text\": \"function deflate_fast(s, flush) {\\n var hash_head; /* head of the hash chain */\\n var bflush; /* set if current block must be flushed */\\n\\n for (;;) {\\n /* Make sure that we always have enough lookahead, except\\n * at the end of the input file. We need MAX_MATCH bytes\\n * for the next match, plus MIN_MATCH bytes to insert the\\n * string following the next match.\\n */\\n if (s.lookahead < MIN_LOOKAHEAD) {\\n fill_window(s);\\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n return BS_NEED_MORE;\\n }\\n if (s.lookahead === 0) {\\n break; /* flush the current block */\\n }\\n }\\n\\n /* Insert the string window[strstart .. strstart+2] in the\\n * dictionary, and set hash_head to the head of the hash chain:\\n */\\n hash_head = 0;\\n /*NIL*/if (s.lookahead >= MIN_MATCH) {\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n }\\n\\n /* Find the longest match, discarding those <= prev_length.\\n * At this point we have always match_length < MIN_MATCH\\n */\\n if (hash_head !== 0 /*NIL*/ && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) {\\n /* To simplify the code, we prevent matches with the string\\n * of window index 0 (in particular we have to avoid a match\\n * of the string with itself at the start of the input file).\\n */\\n s.match_length = longest_match(s, hash_head);\\n /* longest_match() sets match_start */\\n }\\n if (s.match_length >= MIN_MATCH) {\\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\\n\\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\\n s.match_length - MIN_MATCH, bflush); ***/\\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\\n\\n s.lookahead -= s.match_length;\\n\\n /* Insert new strings in the hash table only if the match length\\n * is not too large. This saves time but degrades compression.\\n */\\n if (s.match_length <= s.max_lazy_match /*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\\n s.match_length--; /* string at strstart already in table */\\n do {\\n s.strstart++;\\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n s.head[s.ins_h] = s.strstart;\\n /***/\\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\\n * always MIN_MATCH bytes ahead.\\n */\\n } while (--s.match_length !== 0);\\n s.strstart++;\\n } else {\\n s.strstart += s.match_length;\\n s.match_length = 0;\\n s.ins_h = s.window[s.strstart];\\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + 1]) & s.hash_mask;\\n\\n //#if MIN_MATCH != 3\\n // Call UPDATE_HASH() MIN_MATCH-3 more times\\n //#endif\\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\\n * matter since it will be recomputed at next deflate call.\\n */\\n }\\n } else {\\n /* No match, output a literal byte */\\n //Tracevv((stderr,\\\"%c\\\", s.window[s.strstart]));\\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\\n\\n s.lookahead--;\\n s.strstart++;\\n }\\n if (bflush) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n }\\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n if (flush === Z_FINISH) {\\n /*** FLUSH_BLOCK(s, 1); ***/\\n flush_block_only(s, true);\\n if (s.strm.avail_out === 0) {\\n return BS_FINISH_STARTED;\\n }\\n /***/\\n return BS_FINISH_DONE;\\n }\\n if (s.last_lit) {\\n /*** FLUSH_BLOCK(s, 0); ***/\\n flush_block_only(s, false);\\n if (s.strm.avail_out === 0) {\\n return BS_NEED_MORE;\\n }\\n /***/\\n }\\n return BS_BLOCK_DONE;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa7b8343b442ab0f71b927c8121c01d7\",\n \"score\": \"0.6278382\",\n \"text\": \"function deflate_slow(s, flush) {\\n\\t var hash_head; /* head of hash chain */\\n\\t var bflush; /* set if current block must be flushed */\\n\\t\\n\\t var max_insert;\\n\\t\\n\\t /* Process the input block. */\\n\\t for (;;) {\\n\\t /* Make sure that we always have enough lookahead, except\\n\\t * at the end of the input file. We need MAX_MATCH bytes\\n\\t * for the next match, plus MIN_MATCH bytes to insert the\\n\\t * string following the next match.\\n\\t */\\n\\t if (s.lookahead < MIN_LOOKAHEAD) {\\n\\t fill_window(s);\\n\\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t if (s.lookahead === 0) { break; } /* flush the current block */\\n\\t }\\n\\t\\n\\t /* Insert the string window[strstart .. strstart+2] in the\\n\\t * dictionary, and set hash_head to the head of the hash chain:\\n\\t */\\n\\t hash_head = 0/*NIL*/;\\n\\t if (s.lookahead >= MIN_MATCH) {\\n\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t s.head[s.ins_h] = s.strstart;\\n\\t /***/\\n\\t }\\n\\t\\n\\t /* Find the longest match, discarding those <= prev_length.\\n\\t */\\n\\t s.prev_length = s.match_length;\\n\\t s.prev_match = s.match_start;\\n\\t s.match_length = MIN_MATCH - 1;\\n\\t\\n\\t if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n\\t s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n\\t /* To simplify the code, we prevent matches with the string\\n\\t * of window index 0 (in particular we have to avoid a match\\n\\t * of the string with itself at the start of the input file).\\n\\t */\\n\\t s.match_length = longest_match(s, hash_head);\\n\\t /* longest_match() sets match_start */\\n\\t\\n\\t if (s.match_length <= 5 &&\\n\\t (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\t\\n\\t /* If prev_match is also MIN_MATCH, match_start is garbage\\n\\t * but we will ignore the current match anyway.\\n\\t */\\n\\t s.match_length = MIN_MATCH - 1;\\n\\t }\\n\\t }\\n\\t /* If there was a match at the previous step and the current\\n\\t * match is not better, output the previous match:\\n\\t */\\n\\t if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n\\t max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n\\t /* Do not insert strings in hash table beyond this. */\\n\\t\\n\\t //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\t\\n\\t /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n\\t s.prev_length - MIN_MATCH, bflush);***/\\n\\t bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n\\t /* Insert in hash table all strings up to the end of the match.\\n\\t * strstart-1 and strstart are already inserted. If there is not\\n\\t * enough lookahead, the last two strings are not inserted in\\n\\t * the hash table.\\n\\t */\\n\\t s.lookahead -= s.prev_length - 1;\\n\\t s.prev_length -= 2;\\n\\t do {\\n\\t if (++s.strstart <= max_insert) {\\n\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t s.head[s.ins_h] = s.strstart;\\n\\t /***/\\n\\t }\\n\\t } while (--s.prev_length !== 0);\\n\\t s.match_available = 0;\\n\\t s.match_length = MIN_MATCH - 1;\\n\\t s.strstart++;\\n\\t\\n\\t if (bflush) {\\n\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t flush_block_only(s, false);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t /***/\\n\\t }\\n\\t\\n\\t } else if (s.match_available) {\\n\\t /* If there was no match at the previous position, output a\\n\\t * single literal. If there was a match but the current match\\n\\t * is longer, truncate the previous match to a single literal.\\n\\t */\\n\\t //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n\\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n\\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\t\\n\\t if (bflush) {\\n\\t /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n\\t flush_block_only(s, false);\\n\\t /***/\\n\\t }\\n\\t s.strstart++;\\n\\t s.lookahead--;\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t } else {\\n\\t /* There is no previous match to compare with, wait for\\n\\t * the next step to decide.\\n\\t */\\n\\t s.match_available = 1;\\n\\t s.strstart++;\\n\\t s.lookahead--;\\n\\t }\\n\\t }\\n\\t //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n\\t if (s.match_available) {\\n\\t //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n\\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n\\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\t\\n\\t s.match_available = 0;\\n\\t }\\n\\t s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n\\t if (flush === Z_FINISH) {\\n\\t /*** FLUSH_BLOCK(s, 1); ***/\\n\\t flush_block_only(s, true);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_FINISH_STARTED;\\n\\t }\\n\\t /***/\\n\\t return BS_FINISH_DONE;\\n\\t }\\n\\t if (s.last_lit) {\\n\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t flush_block_only(s, false);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t /***/\\n\\t }\\n\\t\\n\\t return BS_BLOCK_DONE;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa7b8343b442ab0f71b927c8121c01d7\",\n \"score\": \"0.6278382\",\n \"text\": \"function deflate_slow(s, flush) {\\n\\t var hash_head; /* head of hash chain */\\n\\t var bflush; /* set if current block must be flushed */\\n\\t\\n\\t var max_insert;\\n\\t\\n\\t /* Process the input block. */\\n\\t for (;;) {\\n\\t /* Make sure that we always have enough lookahead, except\\n\\t * at the end of the input file. We need MAX_MATCH bytes\\n\\t * for the next match, plus MIN_MATCH bytes to insert the\\n\\t * string following the next match.\\n\\t */\\n\\t if (s.lookahead < MIN_LOOKAHEAD) {\\n\\t fill_window(s);\\n\\t if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t if (s.lookahead === 0) { break; } /* flush the current block */\\n\\t }\\n\\t\\n\\t /* Insert the string window[strstart .. strstart+2] in the\\n\\t * dictionary, and set hash_head to the head of the hash chain:\\n\\t */\\n\\t hash_head = 0/*NIL*/;\\n\\t if (s.lookahead >= MIN_MATCH) {\\n\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t s.head[s.ins_h] = s.strstart;\\n\\t /***/\\n\\t }\\n\\t\\n\\t /* Find the longest match, discarding those <= prev_length.\\n\\t */\\n\\t s.prev_length = s.match_length;\\n\\t s.prev_match = s.match_start;\\n\\t s.match_length = MIN_MATCH - 1;\\n\\t\\n\\t if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\\n\\t s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\\n\\t /* To simplify the code, we prevent matches with the string\\n\\t * of window index 0 (in particular we have to avoid a match\\n\\t * of the string with itself at the start of the input file).\\n\\t */\\n\\t s.match_length = longest_match(s, hash_head);\\n\\t /* longest_match() sets match_start */\\n\\t\\n\\t if (s.match_length <= 5 &&\\n\\t (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\\n\\t\\n\\t /* If prev_match is also MIN_MATCH, match_start is garbage\\n\\t * but we will ignore the current match anyway.\\n\\t */\\n\\t s.match_length = MIN_MATCH - 1;\\n\\t }\\n\\t }\\n\\t /* If there was a match at the previous step and the current\\n\\t * match is not better, output the previous match:\\n\\t */\\n\\t if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\\n\\t max_insert = s.strstart + s.lookahead - MIN_MATCH;\\n\\t /* Do not insert strings in hash table beyond this. */\\n\\t\\n\\t //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\\n\\t\\n\\t /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\\n\\t s.prev_length - MIN_MATCH, bflush);***/\\n\\t bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\\n\\t /* Insert in hash table all strings up to the end of the match.\\n\\t * strstart-1 and strstart are already inserted. If there is not\\n\\t * enough lookahead, the last two strings are not inserted in\\n\\t * the hash table.\\n\\t */\\n\\t s.lookahead -= s.prev_length - 1;\\n\\t s.prev_length -= 2;\\n\\t do {\\n\\t if (++s.strstart <= max_insert) {\\n\\t /*** INSERT_STRING(s, s.strstart, hash_head); ***/\\n\\t s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\\n\\t hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\\n\\t s.head[s.ins_h] = s.strstart;\\n\\t /***/\\n\\t }\\n\\t } while (--s.prev_length !== 0);\\n\\t s.match_available = 0;\\n\\t s.match_length = MIN_MATCH - 1;\\n\\t s.strstart++;\\n\\t\\n\\t if (bflush) {\\n\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t flush_block_only(s, false);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t /***/\\n\\t }\\n\\t\\n\\t } else if (s.match_available) {\\n\\t /* If there was no match at the previous position, output a\\n\\t * single literal. If there was a match but the current match\\n\\t * is longer, truncate the previous match to a single literal.\\n\\t */\\n\\t //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n\\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n\\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\t\\n\\t if (bflush) {\\n\\t /*** FLUSH_BLOCK_ONLY(s, 0) ***/\\n\\t flush_block_only(s, false);\\n\\t /***/\\n\\t }\\n\\t s.strstart++;\\n\\t s.lookahead--;\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t } else {\\n\\t /* There is no previous match to compare with, wait for\\n\\t * the next step to decide.\\n\\t */\\n\\t s.match_available = 1;\\n\\t s.strstart++;\\n\\t s.lookahead--;\\n\\t }\\n\\t }\\n\\t //Assert (flush != Z_NO_FLUSH, \\\"no flush?\\\");\\n\\t if (s.match_available) {\\n\\t //Tracevv((stderr,\\\"%c\\\", s->window[s->strstart-1]));\\n\\t /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\\n\\t bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\\n\\t\\n\\t s.match_available = 0;\\n\\t }\\n\\t s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\\n\\t if (flush === Z_FINISH) {\\n\\t /*** FLUSH_BLOCK(s, 1); ***/\\n\\t flush_block_only(s, true);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_FINISH_STARTED;\\n\\t }\\n\\t /***/\\n\\t return BS_FINISH_DONE;\\n\\t }\\n\\t if (s.last_lit) {\\n\\t /*** FLUSH_BLOCK(s, 0); ***/\\n\\t flush_block_only(s, false);\\n\\t if (s.strm.avail_out === 0) {\\n\\t return BS_NEED_MORE;\\n\\t }\\n\\t /***/\\n\\t }\\n\\t\\n\\t return BS_BLOCK_DONE;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69a9e1c7ef1533b219207985abb5c293\",\n \"score\": \"0.6278211\",\n \"text\": \"function deflate_fast(flush) { // 7544\\n\\t\\t\\t// short hash_head = 0; // head of the hash chain // 7545\\n\\t\\t\\tvar hash_head = 0; // head of the hash chain // 7546\\n\\t\\t\\tvar bflush; // set if current block must be flushed // 7547\\n // 7548\\n\\t\\t\\twhile (true) { // 7549\\n\\t\\t\\t\\t// Make sure that we always have enough lookahead, except // 7550\\n\\t\\t\\t\\t// at the end of the input file. We need MAX_MATCH bytes // 7551\\n\\t\\t\\t\\t// for the next match, plus MIN_MATCH bytes to insert the // 7552\\n\\t\\t\\t\\t// string following the next match. // 7553\\n\\t\\t\\t\\tif (lookahead < MIN_LOOKAHEAD) { // 7554\\n\\t\\t\\t\\t\\tfill_window(); // 7555\\n\\t\\t\\t\\t\\tif (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) { // 7556\\n\\t\\t\\t\\t\\t\\treturn NeedMore; // 7557\\n\\t\\t\\t\\t\\t} // 7558\\n\\t\\t\\t\\t\\tif (lookahead === 0) // 7559\\n\\t\\t\\t\\t\\t\\tbreak; // flush the current block // 7560\\n\\t\\t\\t\\t} // 7561\\n // 7562\\n\\t\\t\\t\\t// Insert the string window[strstart .. strstart+2] in the // 7563\\n\\t\\t\\t\\t// dictionary, and set hash_head to the head of the hash chain: // 7564\\n\\t\\t\\t\\tif (lookahead >= MIN_MATCH) { // 7565\\n\\t\\t\\t\\t\\tins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask; // 7566\\n // 7567\\n\\t\\t\\t\\t\\t// prev[strstart&w_mask]=hash_head=head[ins_h]; // 7568\\n\\t\\t\\t\\t\\thash_head = (head[ins_h] & 0xffff); // 7569\\n\\t\\t\\t\\t\\tprev[strstart & w_mask] = head[ins_h]; // 7570\\n\\t\\t\\t\\t\\thead[ins_h] = strstart; // 7571\\n\\t\\t\\t\\t} // 7572\\n // 7573\\n\\t\\t\\t\\t// Find the longest match, discarding those <= prev_length. // 7574\\n\\t\\t\\t\\t// At this point we have always match_length < MIN_MATCH // 7575\\n // 7576\\n\\t\\t\\t\\tif (hash_head !== 0 && ((strstart - hash_head) & 0xffff) <= w_size - MIN_LOOKAHEAD) { // 7577\\n\\t\\t\\t\\t\\t// To simplify the code, we prevent matches with the string // 7578\\n\\t\\t\\t\\t\\t// of window index 0 (in particular we have to avoid a match // 7579\\n\\t\\t\\t\\t\\t// of the string with itself at the start of the input file). // 7580\\n\\t\\t\\t\\t\\tif (strategy != Z_HUFFMAN_ONLY) { // 7581\\n\\t\\t\\t\\t\\t\\tmatch_length = longest_match(hash_head); // 7582\\n\\t\\t\\t\\t\\t} // 7583\\n\\t\\t\\t\\t\\t// longest_match() sets match_start // 7584\\n\\t\\t\\t\\t} // 7585\\n\\t\\t\\t\\tif (match_length >= MIN_MATCH) { // 7586\\n\\t\\t\\t\\t\\t// check_match(strstart, match_start, match_length); // 7587\\n // 7588\\n\\t\\t\\t\\t\\tbflush = _tr_tally(strstart - match_start, match_length - MIN_MATCH); // 7589\\n // 7590\\n\\t\\t\\t\\t\\tlookahead -= match_length; // 7591\\n // 7592\\n\\t\\t\\t\\t\\t// Insert new strings in the hash table only if the match length // 7593\\n\\t\\t\\t\\t\\t// is not too large. This saves time but degrades compression. // 7594\\n\\t\\t\\t\\t\\tif (match_length <= max_lazy_match && lookahead >= MIN_MATCH) { // 7595\\n\\t\\t\\t\\t\\t\\tmatch_length--; // string at strstart already in hash table // 7596\\n\\t\\t\\t\\t\\t\\tdo { // 7597\\n\\t\\t\\t\\t\\t\\t\\tstrstart++; // 7598\\n // 7599\\n\\t\\t\\t\\t\\t\\t\\tins_h = ((ins_h << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask; // 7600\\n\\t\\t\\t\\t\\t\\t\\t// prev[strstart&w_mask]=hash_head=head[ins_h]; // 7601\\n\\t\\t\\t\\t\\t\\t\\thash_head = (head[ins_h] & 0xffff); // 7602\\n\\t\\t\\t\\t\\t\\t\\tprev[strstart & w_mask] = head[ins_h]; // 7603\\n\\t\\t\\t\\t\\t\\t\\thead[ins_h] = strstart; // 7604\\n // 7605\\n\\t\\t\\t\\t\\t\\t\\t// strstart never exceeds WSIZE-MAX_MATCH, so there are // 7606\\n\\t\\t\\t\\t\\t\\t\\t// always MIN_MATCH bytes ahead. // 7607\\n\\t\\t\\t\\t\\t\\t} while (--match_length !== 0); // 7608\\n\\t\\t\\t\\t\\t\\tstrstart++; // 7609\\n\\t\\t\\t\\t\\t} else { // 7610\\n\\t\\t\\t\\t\\t\\tstrstart += match_length; // 7611\\n\\t\\t\\t\\t\\t\\tmatch_length = 0; // 7612\\n\\t\\t\\t\\t\\t\\tins_h = window[strstart] & 0xff; // 7613\\n // 7614\\n\\t\\t\\t\\t\\t\\tins_h = (((ins_h) << hash_shift) ^ (window[strstart + 1] & 0xff)) & hash_mask; // 7615\\n\\t\\t\\t\\t\\t\\t// If lookahead < MIN_MATCH, ins_h is garbage, but it does // 7616\\n\\t\\t\\t\\t\\t\\t// not // 7617\\n\\t\\t\\t\\t\\t\\t// matter since it will be recomputed at next deflate call. // 7618\\n\\t\\t\\t\\t\\t} // 7619\\n\\t\\t\\t\\t} else { // 7620\\n\\t\\t\\t\\t\\t// No match, output a literal byte // 7621\\n // 7622\\n\\t\\t\\t\\t\\tbflush = _tr_tally(0, window[strstart] & 0xff); // 7623\\n\\t\\t\\t\\t\\tlookahead--; // 7624\\n\\t\\t\\t\\t\\tstrstart++; // 7625\\n\\t\\t\\t\\t} // 7626\\n\\t\\t\\t\\tif (bflush) { // 7627\\n // 7628\\n\\t\\t\\t\\t\\tflush_block_only(false); // 7629\\n\\t\\t\\t\\t\\tif (strm.avail_out === 0) // 7630\\n\\t\\t\\t\\t\\t\\treturn NeedMore; // 7631\\n\\t\\t\\t\\t} // 7632\\n\\t\\t\\t} // 7633\\n // 7634\\n\\t\\t\\tflush_block_only(flush == Z_FINISH); // 7635\\n\\t\\t\\tif (strm.avail_out === 0) { // 7636\\n\\t\\t\\t\\tif (flush == Z_FINISH) // 7637\\n\\t\\t\\t\\t\\treturn FinishStarted; // 7638\\n\\t\\t\\t\\telse // 7639\\n\\t\\t\\t\\t\\treturn NeedMore; // 7640\\n\\t\\t\\t} // 7641\\n\\t\\t\\treturn flush == Z_FINISH ? FinishDone : BlockDone; // 7642\\n\\t\\t} // 7643\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":92,"cells":{"query_id":{"kind":"string","value":"b5736285a325c47809495c7cab28b5ed"},"query":{"kind":"string","value":"Catch all exit posix codes and stop server gracefully. Also bind q key to exit."},"positive_passages":{"kind":"list like","value":[{"docid":"6591d1e3cd8108a1c54118c9a8f33616","score":"0.7369915","text":"function exit(signal) {\n socket.close(() => {\n cli.log('Stopped server.');\n process.exit(signal === 'ERR' ? 1 : 0);\n });\n}","title":""}],"string":"[\n {\n \"docid\": \"6591d1e3cd8108a1c54118c9a8f33616\",\n \"score\": \"0.7369915\",\n \"text\": \"function exit(signal) {\\n socket.close(() => {\\n cli.log('Stopped server.');\\n process.exit(signal === 'ERR' ? 1 : 0);\\n });\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"9dfba6eda724418230543aabba059abc","score":"0.6939805","text":"function initTerminateHandlers() {\n var readLine;\n\n if (process.platform === \"win32\"){\n readLine = require(\"readline\");\n\n readLine.createInterface ({\n input: process.stdin,\n output: process.stdout\n }).on(\"SIGINT\", function () {\n process.emit(\"SIGINT\");\n });\n }\n\n // handle INTERRUPT (CTRL+C) and TERM/KILL signals\n process.on('exit', function () {\n if (server) {\n console.log(chalk.blue('*'), 'Shutting down server');\n server.stop();\n }\n console.log(); // extra blank line\n });\n process.on('SIGINT', function () {\n console.log(chalk.blue.bold('!'), chalk.yellow.bold('SIGINT'), 'detected');\n process.exit();\n });\n process.on('SIGTERM', function () {\n console.log(chalk.blue.bold('!'), chalk.yellow.bold('SIGTERM'), 'detected');\n process.exit(0);\n });\n}","title":""},{"docid":"561c66c7aae0df9407d3bdd820bd954d","score":"0.6772231","text":"function exitHandler(options, err) {\n\texec('sudo /etc/init.d/lirc stop', function(error, stdout, stderr) {\n\t\tconsole.log('stdout: ' + stdout);\n\t\tconsole.log('stderr: ' + stderr);\n\t\tif (error) {\n\t\t\tthrow(error);\n\t\t}\n\t\t\n\t});\n}","title":""},{"docid":"b9b66f92ab5f85e33cbcb75afdf0074c","score":"0.6726274","text":"function fnExit(signal) { //exit handler\n\tconsole.log(\"\\n--------------------\");\n\tconsole.log(\"> Received [\" + signal + \"].\");\n\tconsole.log(\"--------------------\");\n\n\tdao.close();\n\tsession.close();\n\tserver.close();\n\tsecsrv.close();\n\n\tconsole.log(\"> Http server closed.\");\n\tconsole.log(\"> \" + (new Date()));\n\tconsole.log(\"--------------------\\n\");\n\tprocess.exit(0);\n}","title":""},{"docid":"8bbadd74ebaea251f6ff96b11bb9d5a3","score":"0.6685012","text":"_bind_exit_handler() {\n let reference = this;\n ['exit', 'SIGINT', 'SIGUSR1', 'SIGUSR2', 'SIGTERM'].forEach((type) =>\n process.once(type, () => reference.close())\n );\n }","title":""},{"docid":"42617d175574f3a04a1189b324b4ce64","score":"0.66818327","text":"function shutdown() {\n console.log('\\nGot a stop signal, shutting down...');\n process.exit(1);\n}","title":""},{"docid":"d3eab76c4576730955cf6485e26aad87","score":"0.6667114","text":"async function exitHandler(options = {}) {\n await server\n .close()\n .then(() => {\n console.info('Server has been shut down successfuly')\n })\n .catch(e => {\n console.warn('An error ocurred while shutting down the server', e.stack)\n })\n if (options.exit) process.exit()\n }","title":""},{"docid":"300a6eb1b7b59c057827d8804c8dd320","score":"0.66499865","text":"function handleClose() {\n console.log('server closed!');\n process.exit();\n}","title":""},{"docid":"42e834229a5e254304f1d928b2a5a610","score":"0.6629558","text":"function terminationHandler (options, err) {\n\tif (err) {\n \t\tconsole.log (\"\\ntermination err: \" + err); //this is a custom error object, not a standard one\n \t}\n\n\tif (options.cleanup) {\n\t\tconsole.log ('Exiting...');\n\t\t//periodic.shutdown ();\n\t\tscreen.shutdown ();\n\t\tprocess.exit();\n\t}\n\n\tif (options.exit) {\n\t\tconsole.log (`\\n(Ctrl-C) server terminating.\\n`);\n\t\tperiodic.shutdown ();\n\t\t//screen.shutdown ();\n\t\tprocess.exit();\n\t}\n}","title":""},{"docid":"91e0acbeb6481fea5df22fd1fabc29a7","score":"0.66275823","text":"function exitHandler(options, exitCode) {\n for (const handler of exitHandlers) {\n handler();\n }\n if (exitCode || exitCode === 0) {\n if (typeof exitCode !== 'number') {\n /** not a 'clean' exit log to console */\n console.log(exitCode);\n }\n }\n // TODO: kill the server here. (but only if started from scully, not when started from another process)\n if (options.exit) {\n if (browser) {\n browser.close().then(() => process.exit(exitCode));\n }\n else {\n process.exit(exitCode);\n }\n }\n }","title":""},{"docid":"c646d43f0bb5bc0ee4f8b997ac4761d7","score":"0.65105885","text":"function exitHandler(options, exitCode) {\n client.say(channel,'GITSbot1000 signing off. Thanks for watching. GG everyone!');\n \n if (options.cleanup) console.log('clean');\n if (exitCode || exitCode === 0) console.log(exitCode);\n if (options.exit) process.exit();\n}","title":""},{"docid":"15e35b00cb5b9f0355fbff06ff4c4c8a","score":"0.65023774","text":"function processTerminator(sig) {\n if (typeof sig === 'string') {\n process.exit(1);\n }\n console.log('%s: Node server stopped.', Date(Date.now()));\n}","title":""},{"docid":"0501288a92472889b3f40f887d6e0570","score":"0.6489653","text":"function exitHandler(options, err) {\n var sshKeys = Object.keys(sshPortMap);\n var vncKeys = Object.keys(vncPortMap);\n \n _.each(sshKeys, function (item, index) {\n destroyTunnle(sshPortMap[item]);\n });\n\n _.each(vncKeys, function (item, index) {\n destroyTunnle(sshPortMap[item]);\n });\n\n process.exit();\n}","title":""},{"docid":"bed52460a329aed0905e410f24875611","score":"0.6488019","text":"function processTerminator(sig) {\n if (typeof sig === 'string') {\n process.exit(1);\n }\n console.log('%s: Node server stopped.', Date(Date.now()));\n}","title":""},{"docid":"6e36000a15b16e1351d2ab7011a122d0","score":"0.64670557","text":"function exitHandler(options, exitCode){\n if(options.cleanup){\n cmd.run('kill ' + rProc.pid);\n }\n\n if(exitCode || exitCode == 0){\n console.log(exitCode);\n }\n if(options.exit){\n process.exit();\n }\n}","title":""},{"docid":"4e24f7995ad08bfaac7b376f266cc412","score":"0.6385194","text":"function handle(signal) {\n console.log(`received ${signal}`);\n server.close(() => {\n console.log('server closed');\n process.exit(0);\n });\n}","title":""},{"docid":"83f44ecb18cff5f39dbe4e1eb8b51a63","score":"0.63848585","text":"async function exitHandler(options, exitCode) {\n if (browser) {\n if (typeof wsDebuggerHash == 'string' && wsDebuggerHash) {\n // pass\n } else {\n await browser.close();\n browser = null;\n }\n }\n\n if (options.cleanup) {\n console.log('clean up');\n }\n if (exitCode || exitCode === 0) {\n console.log(exitCode);\n }\n if (options.exit) {\n process.exit();\n }\n}","title":""},{"docid":"708d2f9455b2b8e41cad3a7f7ea51642","score":"0.6366643","text":"function exit() {\n send('exit');\n }","title":""},{"docid":"d88afb7427f030f3b119343ff8b65854","score":"0.63385904","text":"function setupCloseOnExit(server) {\n async function exitHandler(options = {}) {\n await server\n .close()\n .then(() => {\n console.info(`Server successfully closed at ${currentTime}`);\n })\n .catch((e) => {\n console.warn(`Something went wrong closing the server at ${currentTime}`, e.stack);\n });\n\n if (options.exit) {\n if (options.exit) {\n // process.exit();\n throw new Error(`Exit process.exit Node JS at ${currentTime}`);\n }\n }\n }\n\n // do something when app is closing\n process.on(\"exit\", exitHandler);\n // catches ctrl+c event\n process.on(\"SIGINT\", exitHandler.bind(null, { exit: true }));\n // catches \"kill pid\" (for example: nodemon restart)\n process.on(\"SIGUSR1\", exitHandler.bind(null, { exit: true }));\n process.on(\"SIGUSR2\", exitHandler.bind(null, { exit: true }));\n // catches uncaught exceptions\n process.on(\"uncaughtException\", (err) => {\n console.error(\"Caught exception: \", err);\n });\n}","title":""},{"docid":"87a6f154963e6fd7bc7282caa68accf6","score":"0.6321331","text":"function handle(signal) {\n console.log('Received exit signal. Bye!');\n process.exit(-1)\n }","title":""},{"docid":"87a6f154963e6fd7bc7282caa68accf6","score":"0.6321331","text":"function handle(signal) {\n console.log('Received exit signal. Bye!');\n process.exit(-1)\n }","title":""},{"docid":"52975db27960657ef9c50e3c2afb8e2f","score":"0.63128626","text":"function gracefulShutdown(){\n console.log('About to exit, closing servers.');\n\n servers.forEach(function(server, index){\n server.close();\n });\n\n process.exit();\n}","title":""},{"docid":"755f5fc112d32792476f85fe1a153616","score":"0.63077253","text":"function exitHandler(options, err) {\n\tstopBot( ).then( ( r ) => {\n\tif (options.cleanup) console.log('clean');\n\tif (err) console.log(err.stack);\n\tif (options.exit) process.exit();\n\t} );\n}","title":""},{"docid":"fe4e2c42b7e4f227af2794cf9c6f722d","score":"0.6290391","text":"function sigterm() {\n return stop('SIGTERM');\n}","title":""},{"docid":"836518df7cbc74a6fb9c1abad0b5abbb","score":"0.6288717","text":"async function exitHandler(options, exitCode) {\n console.log(options, exitCode);\n //Burada botun aktif olmadığına dair ana gruba mesaj atabiliriz\n //Yada botun durumunu, açıklamasını veya başka bir özelliğini değiştirerek çalışır olmadığını gösterebiliriz\n await cb();\n\n // if (options.cleanup) console.log('clean');\n // if (exitCode || exitCode === 0) console.log(exitCode);\n if (options.exit) process.exit();\n\n }","title":""},{"docid":"00a5d8bf6e7c1c267fb4c58ed5f73e90","score":"0.62526876","text":"function shutdown(exitCode) {\n logger.info('Server stopping...')\n\n server.close(() => {\n logger.info('Server stopped')\n process.exitCode = exitCode\n })\n\n // Forcibly shutdown after 10 seconds\n setTimeout(() => {\n throw new Error('Forcibly shutting down')\n }, 10000).unref()\n}","title":""},{"docid":"48bc9f83622f165eb63aceaaef468f24","score":"0.621217","text":"function setupCloseOnExit(server) {\n // thank you stack overflow\n // https://stackoverflow.com/a/14032965/971592\n async function exitHandler(options = {}) {\n await server\n .close()\n .then(() => {\n console.info('Server has been shut down successfuly')\n })\n .catch(e => {\n console.warn('An error ocurred while shutting down the server', e.stack)\n })\n if (options.exit) process.exit()\n }\n\n // do something when app is closing\n process.on('exit', exitHandler)\n\n // catches ctrl+c event\n process.on('SIGINT', exitHandler.bind(null, { exit: true }))\n\n // catches \"kill pid\" (for example: nodemon restart)\n process.on('SIGUSR1', exitHandler.bind(null, { exit: true }))\n process.on('SIGUSR2', exitHandler.bind(null, { exit: true }))\n\n // catches uncaught exceptions\n process.on('uncaughtException', exitHandler.bind(null, { exit: true }))\n}","title":""},{"docid":"4bce80f211ec22d2f43ab33e95ad92fc","score":"0.6202486","text":"function exitHandler(options, err){\n\tif(options.cleanup){\n\t\tglobal.reportNotify('WSAPP', 'EXITING APP', 0);\n\t\t//close mysql connections\n\t\t//Connection.terminateAll();\n\t}\n\tif(err){\n\t\tconsole.log(err.stack);\n\t}\n\tif(options.exit){\n\t\tprocess.exit();\n\t}\n}","title":""},{"docid":"fbb03c3822b2462f95ce83cd44569e31","score":"0.61925614","text":"function cleanExit() {\n serviceHelper.log(\n 'warn',\n 'Service stopping',\n );\n serviceHelper.log(\n 'trace',\n 'Close rest server',\n );\n server.close(() => {\n serviceHelper.log(\n 'info',\n 'Exit the app',\n );\n process.exit(1); // Exit app\n });\n }","title":""},{"docid":"be1af8e03b1b8a97fa0c5ada56a37e30","score":"0.6183949","text":"function exitHandler(options, exitCode) {\n endCalls();\n if (options.cleanup) console.log('clean');\n if (exitCode || exitCode === 0) console.log(exitCode);\n if (options.exit) process.exit();\n}","title":""},{"docid":"96318b19f94390fa19642748450d9090","score":"0.61807674","text":"function finish() {\n console.log(\"closing ports...\");\n for(var i = 0; i < 127; ++i)\n output.sendMessage([NOTEOFF,i,127]);\n output.closePort();\n process.exit(0);\n}","title":""},{"docid":"dec6e5a332ae9e5b4e8c1857f0d64289","score":"0.61710995","text":"function handleExit(options, err) {\n if (options.cleanup) {\n const actions = [server.close, db.destroy];\n actions.forEach((close, i) => {\n try {\n close(() => {\n if (i === actions.length - 1) process.exit();\n });\n } catch (err) {\n if (i === actions.length - 1) process.exit();\n }\n });\n }\n if (err) console.error(err);\n if (options.exit) process.exit();\n}","title":""},{"docid":"6a67681d6e58d404338b6840734364d0","score":"0.6168537","text":"function exitOnSignal(signal) {\n process.on(signal, function () {\n logger.warn(i18n.__('app.serverShutdown', signal));\n process.exit(1);\n });\n}","title":""},{"docid":"0483521aa50e3dbcf353666dbe8545ae","score":"0.6139169","text":"function shutdown() {\r\n\tprocess.exit();\r\n}","title":""},{"docid":"ffb22bcae02329c9b24f79ce02f41297","score":"0.61281496","text":"function exitHandler(cleanUpFn) {\n process.stdin.resume() // so the program will not close instantly\n const exit = () => {\n cleanUpFn()\n process.exit()\n }\n process.on('exit', exit)\n //catches ctrl+c event\n process.on('SIGINT', exit)\n // catches \"kill pid\" (for example: nodemon restart)\n process.on('SIGUSR1', exit)\n process.on('SIGUSR2', exit)\n //catches uncaught exceptions\n process.on('uncaughtException', exit)\n}","title":""},{"docid":"d53e200980977207bcbdf4d6bbfc13a1","score":"0.60999006","text":"function endClient() {\n\tconsole.log('Connection closed');\n\tprocess.exit(0);\n}","title":""},{"docid":"fd4e15c77199e937c5790055342c9d35","score":"0.60960764","text":"function exitApp() {\n console.log('\\nCleaning up GPIO...')\n io.close();\n console.log('Websocket Closed');\n http.close(() => {\n console.log('Server terminated')\n console.log('\\x1b[31m%s\\x1b[0m','EXIT');\n process.exit(0); //exit completely\n });\n}","title":""},{"docid":"3262ef30e2c80636827cf72585bfa394","score":"0.60906535","text":"async function exitHandler(options, exitCode) {\n await Stats.saveStats();\n if (options.cleanup) {\n await Listener.unsubAll();\n await Sync.unsubSync();\n await fs.writeFileSync(`./${ipfs.host}/hostedFiles.json`, JSON.stringify(ipfsearch.hostedFiles), (e) => {soLog(e);});\n log('Clean exit. Goodbye.')\n process.exit();\n }\n if (exitCode || exitCode === 0) {\n log(`Received exitcode: ${exitCode}`);\n }\n if (options.exit) {\n log('Exit.');\n process.exit();\n }\n}","title":""},{"docid":"c683aad3186859bda4c3d8f2d67d8d06","score":"0.6074944","text":"function exitHandler(options, err) {\n //console.log(\"SRVR:EXITING \"+id);\n //if (options.cleanup) { cleanup(); }\n if (err) console.log(err.stack);\n if (options.exit) process.exit();\n}","title":""},{"docid":"8729a644012f2c6fff8d3925c419c599","score":"0.603623","text":"function processExit() {\n process.removeListener('message', processMessageListener);\n\n process.send({ type: 'result', data: result });\n\n process.exit(0);\n}","title":""},{"docid":"892f66b3fb85731944684c3bb50a0cce","score":"0.6034791","text":"function gracefulShutdown() {\n console.log();\n console.log('Starting Shutdown ...');\n\n // Close all chat boxes to the server\n Object.keys(io.sockets.sockets).forEach(function(s) { \n io.sockets.sockets[s].disconnect(true);\n });\n\n // Once the server closes, exit\n server.close(function() {\n console.log('Shutdown complete');\n process.exit(0);\n });\n }","title":""},{"docid":"3414fa414ece7490e21d7dbd3e5687bd","score":"0.6033928","text":"function exitHandler(options, err) {\n motor.close(function (err) {\n if (err) {\n console.log(err);\n }\n console.log('motor port closed');\n process.exit();\n });\n if (err) {\n console.log(err.stack);\n process.exit();\n }\n }","title":""},{"docid":"abeed4c73914ad7414058713bcf4bb85","score":"0.60124195","text":"function exit(code) {\n /* istanbul ignore next */\n if (process.platform === 'win32' && process.stdout.bufferSize) {\n process.stdout.once('drain', function() {\n process.exit(code);\n });\n return;\n }\n process.exit(code);\n}","title":""},{"docid":"b89f164bd81faf94782ef78ddb39ed5e","score":"0.5982358","text":"function handleAppExit(options, err) {\n if (err) {\n console.log(err.stack)\n }\n\n if (options.cleanup) {\n client.publish('JANDI/connected', 'false');\n }\n\n if (options.exit) {\n process.exit()\n }\n}","title":""},{"docid":"a1ac7e1e1991c8a647d22ff46410e323","score":"0.5979099","text":"function exitHandler(options, err) {\n //lcdDisplay.clear();\n if (options.cleanup) console.log('clean');\n if (err) console.log(err.stack);\n if (options.exit) process.exit();\n}","title":""},{"docid":"140090dfd0ab882d25838bf9c6c62a55","score":"0.5964395","text":"async function exitHandler() {\n\tconsole.log('Exit detected, closing wallet');\n await httpDel('/wallet')\n\n\tconsole.log('Wallet closed, stopping process');\n\tprocess.exit();\n}","title":""},{"docid":"9185c4b01eaf2ea4f435803772337455","score":"0.59593713","text":"function sigint() {\n return stop('SIGINT');\n}","title":""},{"docid":"b95b1bfd44b15e496ebf6918ec673bbe","score":"0.5958556","text":"function killServers () {\n ui.log();\n\n // Hitting Ctrl-C more than once?\n // Take the hint.\n if (dying) ui.exit(\"Forced termination.\");\n dying = true;\n\n ui.log(\"Telling browsers to disconnect...\");\n ui.log(\"(Hit Ctrl-C again to force quit.)\");\n\n var ports = server.getPorts();\n ct = ports.length;\n ports.forEach(function (port) {\n var tests = server.getEmitterForPort(port);\n if (tests.listeners(\"shutdown\").length) {\n tests.emit(\"shutdown\", KILLCB);\n } else KILLCB();\n });\n}","title":""},{"docid":"a1dac635dc583aaefac6b79b6b8c33f0","score":"0.5957133","text":"function quit() {\n process.exit(true === hasErrors ? 2 : 0);\n}","title":""},{"docid":"0bd97e38e9b9358773a91d73e582bdd0","score":"0.59532946","text":"function exitHandler(options, exitCode) {\n gameSimDatabaseConnector.flushToDB( (err)=>{\n if (options.cleanup) console.log('clean');\n if (exitCode || exitCode === 0) console.log(exitCode);\n if (options.exit) process.exit();\n })\n}","title":""},{"docid":"431522075ab253fbb924b9841512d826","score":"0.5952484","text":"function exitApplication() {\n\tconsole.log(\"Good bye!\");\n\tconnection.end();\n\treturn;\n}","title":""},{"docid":"93e0b598802962b5f403a6e2a4f0f4f4","score":"0.59120905","text":"function interrupt() {\n if (interruptHandlers.length === 0) {\n return process.exit(0);\n }\n if (interrupted) {\n console.log('\\nKilling process with extreme prejudice');\n return process.exit(1);\n }\n else {\n interrupted = true;\n }\n close(function () { return process.exit(0); });\n console.log('\\nShutting down. Press ctrl-c again to kill immediately.');\n}","title":""},{"docid":"1751ac405796779e5af571da835ddbe7","score":"0.58893985","text":"function onExit(){\n app.emit(\"sandbox::shovel::stopped\")\n var err = Error(\"Sandbox process was shutdown\")\n err.refinedStack = \"Sandbox was shutdown, probably because you have reached a sandbox limit (memory, CPU) with your code\"\n app.emit(\"sandbox::return\", err)\n }","title":""},{"docid":"c3f1dbcf38e45550195df7803a0c7949","score":"0.58803064","text":"exit() {\n\t\tconsole.clear();\n\t\tconsole.warn('Shutting down the server');\n\t\ttry {\n\t\t\tSessionStorage.Instance.save();\n\t\t} catch(e) {\n\t\t\tconsole.error(e);\n\t\t}\n\n\t\tconsole.warn('------------------------');\n\t\tprocess.exit(1);\n\t}","title":""},{"docid":"d661dec168d5bad3312e4cdaed3304eb","score":"0.5862524","text":"async term() {\n\t\tlog.lib('Terminating');\n\n\t\tthis.terminating = true;\n\n\t\tfor (const intf in config.intf) {\n\t\t\tif (config.intf[intf].enabled !== true) continue;\n\t\t\tlog.lib(`Ending '${intf}' socket`);\n\n\t\t\tawait this.intf[intf].end();\n\t\t\tawait this.intf[intf]._socket.destroy();\n\n\t\t\tupdate.status(`server.sockets.${intf}.connected`, false, false);\n\t\t\tupdate.status(`server.sockets.${intf}.connecting`, false, false);\n\t\t\tupdate.status(`server.sockets.${intf}.reconnecting`, false, false);\n\t\t} // for (let intf in config.intf)\n\n\t\tlog.lib('Terminated');\n\t}","title":""},{"docid":"0cc629c2a6ce61af421c3a5f8f708b09","score":"0.5850836","text":"function handleAppExit(options, err){\n if (err){\n console.log(err.stack)\n }\n if (options.cleanup){\n client.publish('garage/connected','false')\n }\n if (option.exit){\n process.exit()\n }\n}","title":""},{"docid":"2ea3d1998616f413b05dfae71fa7a8bc","score":"0.58301145","text":"function exit(exitCode) {\n if (process.stdout._pendingWriteReqs || process.stderr._pendingWriteReqs) {\n process.nextTick(function() {\n exit(exitCode);\n });\n } else {\n process.exit(exitCode);\n }\n}","title":""},{"docid":"a8547b54b08b81492a6a0e218e86129f","score":"0.5825946","text":"function cleanup() {\n logger.info(\"Closing server;\");\n server.close();\n process.exit(0);\n }","title":""},{"docid":"fcd0b641dea3d8f1f284945e69634c74","score":"0.58223516","text":"function shutdown(sig) {\n\n return new Promise((resolve, reject) => {\n\n function cleanupHttp() {\n return new Promise((resolve, reject) => {\n destroyAllConnections();\n\n // normal shutdown / do not allow new connections\n server.close((err) => {\n if (err) { return reject(err); }\n resolve();\n });\n });\n }\n\n debug('shutdown signal - ' + sig);\n\n // Don't bother with graceful shutdown on development to speed up round trip\n if (options.development) {\n debug('DEV-Mode - imediate forceful shutdown');\n return process.exit(0);\n }\n\n const finalHandler = () => {\n if (!finalRun) {\n finalRun = true;\n if (options.finally && isFunction(options.finally)) {\n options.finally();\n }\n process.nextTick(() => {\n if (fnIntervall) {\n fnIntervall.unref();\n }\n if (options.forceExit) {\n process.exit(failed ? 1 : 0);\n }\n resolve();\n });\n }\n };\n\n const exitHandler = promise => promise\n .catch((err) => {\n const errString = (typeof err === 'string') ? err : JSON.stringify(err);\n debug(errString);\n failed = true;\n reject(errString);\n });\n\n if (!isShuttingDown) {\n isShuttingDown = true;\n debug('shutting down');\n\n const pollIterations = options.timeout ? Math.round(options.timeout / 250) : 0;\n // forcefull shutdown after timeout\n if (options.timeout) {\n let interation = 0;\n fnIntervall = setInterval(function () {\n interation++;\n\n // test all connections closed already?\n if (Object.keys(connections).length === 0 && Object.keys(secureConnections).length === 0) {\n if (options.onShutdown && isFunction(options.onShutdown && !shutdownRun)) {\n shutdownRun = true;\n exitHandler(options.onShutdown(sig)).then(() => {\n finalHandler();\n\n process.nextTick(() => {\n resolve();\n if (options.forceExit) {\n process.exit(1);\n }\n });\n });\n } else if (!shutdownRun) {\n // no onShutdown function\n finalHandler();\n\n process.nextTick(() => {\n resolve();\n if (options.forceExit) {\n process.exit(1);\n }\n });\n }\n }\n if (interation === pollIterations) {\n // timeout time reached! Now forcefully close all connections\n debug('Could not close connections in time (' + options.timeout + 'ms), forcefully shutting down');\n\n // destroy rest of connections\n destroyAllConnections(true);\n\n // call finally function (if provided in options)\n finalHandler();\n\n process.nextTick(() => {\n resolve();\n if (options.forceExit) {\n process.exit(1);\n }\n });\n }\n }, 250);\n }\n\n exitHandler(cleanupHttp()).then(() => {\n if (options.onShutdown && isFunction(options.onShutdown) && !shutdownRun) {\n\n shutdownRun = true;\n return exitHandler(options.onShutdown(sig));\n } else {\n return;\n }\n }).then(finalHandler);\n }\n });\n }","title":""},{"docid":"102e7462724a554d7cdcbe80a2f3521b","score":"0.5815354","text":"onStop (err, cb, code, signal) {\n console.log(`App has exited with code ${code}`)\n }","title":""},{"docid":"0beaae3070fbc08cd8ca6c8ec67ba542","score":"0.5813997","text":"function handleShutdown (handlerFn) {\n const signals = ['SIGHUP', 'SIGINT', 'SIGQUIT', 'SIGABRT', 'SIGTERM']\n signals.forEach(signal => process.on(signal, (signal) => {\n log.info(`Received ${signal}, shutting down...`)\n handlerFn()\n }))\n}","title":""},{"docid":"3bd11611b655c64a014915de48c4be71","score":"0.5811293","text":"async function stopServer() {\n eel.close_process('epic.exe')\n await sleep(1000)\n changeBtnFunc($('#serverButton'), 'start')\n changeBtn($('#serverButton'), 'start')\n changeIcon($('#serverIcon'), 'error')\n changeStatus($('#serverStatus'), 'Stopped')\n send_console('')\n}","title":""},{"docid":"3ca852294e147206578564b6ec8fde4e","score":"0.5802899","text":"function exitHandler() {\n console.log(\"Program exiting...\");\n\n if ( isRecording ) {\n stop_record();\n }\n\n process.exit();\n}","title":""},{"docid":"74beaa7846a0202435963aa8997502d5","score":"0.58007604","text":"function exitProcess(errCode) {\n\n\t// HACK: can't flush std, the correct approach is to not have\n\t// to process exit, but let node automatically exit when the event\n\t// loop becomes empty, but because of the logger issue we can't do that\n\n\treturn Q.delay(5000)\n\t\t.then(function() {\n\t\t\tprocess.exit(errCode);\n\t\t});\n}","title":""},{"docid":"223427905351ddbaf4fd47ecde5aa895","score":"0.57939476","text":"function gracefulShutdown() {\n logger.info('Closing application server ...');\n\n server.close(() => {\n logger.info('Application server closed');\n process.exit(0);\n });\n\n // Force close server after 5secs\n setTimeout((e) => {\n logger.info('Application server closed', e);\n process.exit(1);\n }, 5000);\n}","title":""},{"docid":"ee445c21bfb98172f08ac88f7a2eea49","score":"0.5790551","text":"function exitHandler(options, err) {\n if (options.cleanup) console.log('exit');\n if (err) console.log(err.stack);\n if (options.exit) process.exit();\n}","title":""},{"docid":"902c6411d6df17691fe8a9a77219c3b7","score":"0.5778841","text":"function terminator(sig) {\n if (typeof sig === \"string\") {\n console.log('%s: Received %s - terminating Node server ...',\n Date(Date.now()), sig);\n process.exit(1);\n }\n console.log('%s: Node server stopped.', Date(Date.now()) );\n}","title":""},{"docid":"902c6411d6df17691fe8a9a77219c3b7","score":"0.5778841","text":"function terminator(sig) {\n if (typeof sig === \"string\") {\n console.log('%s: Received %s - terminating Node server ...',\n Date(Date.now()), sig);\n process.exit(1);\n }\n console.log('%s: Node server stopped.', Date(Date.now()) );\n}","title":""},{"docid":"7921eb3fcfec0f0d65dc766529ab528f","score":"0.5765992","text":"function exitHandler(options, err) {\n if (options.cleanup) cleanUp();\n if (err && err.stack) console.log(err.stack);\n if (options.exit) process.exit();\n}","title":""},{"docid":"c02af6f4183da24082debdb49cffbb06","score":"0.5749573","text":"function exitHandler(options, err) {\n\n if (options.cleanup) {\n logger.debug('Closing logfiles...');\n uavConnectionManager.stopLogging();\n }\n\n if (err) {\n logger.error(util.inspect(err));\n }\n\n if (options.exit) process.exit();\n\n // For restarting with Nodemon\n if (options.killProcess) {\n process.kill(process.pid, 'SIGUSR2');\n }\n}","title":""},{"docid":"5a4137a77e925628c498f334fc3bf70d","score":"0.5738386","text":"function sigHandler(signal) {\n log(`Caught signal: ${signal}.`);\n if (signal == 'SIGINT' || signal == 'SIGTERM') {\n process.exit(0);\n }\n}","title":""},{"docid":"8d68475c2d995990b9815c4e943d1b43","score":"0.57271063","text":"function sigterm() {\n log.info('SIGTERM received...shutting down');\n killAllWorkers('SIGTERM');\n\n if (root) {\n fs.unlink(pidLocation, function(err) {\n if (err) {\n log.error(err);\n }\n });\n }\n}","title":""},{"docid":"51fe8746999763e049befbc0add0c075","score":"0.57226276","text":"function exit (){\n throw new Error('Exit requested by script')\n}","title":""},{"docid":"247250843c3c18e3fa8d11925ec412d0","score":"0.5714146","text":"function exitHandler() {\n // cursor restore\n if (cursor) {\n process.stdout.write(`\\x1b[${cursor.col};${cursor.row}H\\x1b[0m`);\n }\n // SGR restore\n process.stdout.write('\\x1b[0m');\n // termios restore\n initial.writeTo(0);\n console.log();\n}","title":""},{"docid":"3bae5e8a494f1c22c9769d611ce2f677","score":"0.57132465","text":"function exitHandler() {\n console.log('cleaning up...');\n clearInterval(blinkInterval);\n msleep(500);\n console.log(\"closing AMQP client...\")\n // client.close(\n // function(err, result){\n // if(err){\n // console.log(err);\n // }else{\n // console.log(result);\n // console.log(\"client disconnected!\");\n // }\n // }\n // );\n msleep(500);\n console.log(\"deallocating red...\")\n clearLED(red);\n msleep(500);\n console.log(\"deallocating yellow...\")\n clearLED(yellow);\n msleep(500);\n console.log(\"deallocating green...\")\n clearLED(green) \n msleep(500);\n console.log(\"I'M OUT! SEE YA!\");\n}","title":""},{"docid":"90a436ec5bd9ea52fce1fc6991aba577","score":"0.5711005","text":"function end () {\n if (childProc) {\n childProc.kill('SIGKILL');\n childProc = null;\n } \n console.log('\\b\\b ');\n console.log('emi-cli ended...'.bold.yellow);\n}","title":""},{"docid":"2d7479cb60a8ddcffcc08c1f6c8bcee5","score":"0.5692394","text":"function exit(code) {\n\n function done() {\n if (!(draining--)) _exit(code)\n }\n\n var draining = 0\n var streams = [process.stdout, process.stderr]\n\n exit.exited = true\n\n streams.forEach(function (stream) {\n // submit empty write request and wait for completion\n draining += 1\n stream.write('', done)\n })\n\n done()\n}","title":""},{"docid":"c8a27080d387c79c09e850cf485f0ce9","score":"0.5689293","text":"function sig_handle() {\n if (child) {\n child.kill('SIGINT');\n }\n}","title":""},{"docid":"e9885f1f88c85183d9ad1409fc89326d","score":"0.5688968","text":"async function quit() {\n process.exit();\n}","title":""},{"docid":"f893afac46e1a9a20f4178afc6c53cc2","score":"0.5688954","text":"function handleExit(message, error) {\n console.log(`\\n${message}\\n`);\n const exitCode = error ? 1 : 0;\n process.exit(exitCode);\n}","title":""},{"docid":"91b1678c5debb54418bbe114be8fbe12","score":"0.56814265","text":"function exitHandler(options, err) {\n//close connection to mongodb\n db.close();\n if (options.cleanup) console.log('clean exit');\n if (err) console.log(err.stack);\n if (options.exit) process.exit();\n}","title":""},{"docid":"746f633ac9b778128877f779cf35105e","score":"0.56748766","text":"exit() {}","title":""},{"docid":"b9eaf059afbcec159490943a896ea5ed","score":"0.5664019","text":"function exit() {\n connection.end();\n}","title":""},{"docid":"ad0cf137f27e7fc87e34f7da66cc8563","score":"0.56621754","text":"async processExit(exitCode) {\n await utils.sleep(1)\n debug('The ring-mqtt process is shutting down...')\n await ring.go2rtcShutdown()\n if (ring.devices.length > 0) {\n debug('Setting all devices offline...')\n await utils.sleep(1)\n ring.devices.forEach(ringDevice => {\n if (ringDevice.availabilityState === 'online') {\n ringDevice.shutdown = true\n ringDevice.offline()\n }\n })\n }\n await utils.sleep(2)\n if (exitCode || exitCode === 0) debug(`Exit code: ${exitCode}`);\n process.exit()\n }","title":""},{"docid":"4afeb455164a7a38d24b37afce48092d","score":"0.5657592","text":"function shutdown(error) {\n error ? console.error(error) : console.log('shutting down')\n try {\n if (server) server.close()\n } catch (err) {\n // noop who cares\n }\n process.exit(error ? 1 : 0)\n}","title":""},{"docid":"1d2f36a5f7ab296ae4de552cc54775ee","score":"0.565289","text":"function exit() {\n process.exit();\n}","title":""},{"docid":"30a59dc0a09348f15285cae054ae82d9","score":"0.5651382","text":"function exit(code) {\n function done() { if (!(draining--)) _exit(code); }\n\n var draining = 0;\n var streams = [process.stdout, process.stderr];\n\n exit.exited = true;\n\n streams.forEach(function(stream){\n // submit empty write request and wait for completion\n draining += 1;\n stream.write('', done);\n });\n\n done();\n}","title":""},{"docid":"112759753b352db5a8b8c29f7e8100df","score":"0.5649205","text":"function cleanup() {\n if (!SHUTDOWN) {\n SHUTDOWN = true;\n console.log(\"\\n\", \"IPC: Terminating.\", \"\\n\");\n connections.forEach(t => {\n console.log(\"IPC: Disconnecting\", t.timestamp);\n t.stream.write(composeFrame(JSON.stringify({ id: 1, method: \"disconnect\" })));\n t.stream.end();\n });\n server.close();\n process.exit(0);\n }\n }","title":""},{"docid":"928df189e0a3c04ba8ffb2b268af1302","score":"0.56392294","text":"function exit()\n{\n\txrxSessionExitApplication( \"http://127.0.0.1\", callbackFailure );\n}","title":""},{"docid":"928df189e0a3c04ba8ffb2b268af1302","score":"0.56392294","text":"function exit()\n{\n\txrxSessionExitApplication( \"http://127.0.0.1\", callbackFailure );\n}","title":""},{"docid":"1245ef4e253af21a8838c0e97d4f961a","score":"0.5627069","text":"function exit(code) {\n function done() {\n if (!(draining--)) _exit(code)\n }\n\n var draining = 0\n var streams = [process.stdout, process.stderr]\n\n exit.exited = true\n\n streams.forEach(function (stream) {\n // submit empty write request and wait for completion\n draining += 1\n stream.write('', done)\n })\n\n done()\n}","title":""},{"docid":"6584fd59f9d2877ade451e8d4a9ed361","score":"0.5617725","text":"function cleanup(){\n if(!SHUTDOWN){ SHUTDOWN = true;\n console.log('\\n',\"Terminating.\",'\\n');\n if(Object.keys(connections).length){\n let clients = Object.keys(connections);\n while(clients.length){\n let client = clients.pop();\n connections[client].write('__disconnect');\n connections[client].end(); \n }\n }\n server.close();\n process.exit(0);\n }\n }","title":""},{"docid":"a13c8a6dda6fe07fdc370289023e9d19","score":"0.55954874","text":"function initProcessExitHandlers() {\n process.stdin.resume();\n\n /**\n * @param {Error} error\n */\n function exitHandler(error) {\n if (error) {\n logger.err(`Process error: ${error.message}`);\n logger.err(error.stack);\n }\n }\n\n process.on(\"exit\", exitHandler);\n process.on(\"uncaughtException\", exitHandler);\n}","title":""},{"docid":"b8715e002174417e75f7a531f445a136","score":"0.55910295","text":"function exitHandler(deRegisterChoice) {\n if (this.deRegisterChoice) {\n client.stop();\n console.log('Client De-registered');\n }\n process.exit();\n}","title":""},{"docid":"2cc3f5d062f4a7d7c35e6aa63e75d5be","score":"0.55890083","text":"function exit(code) {\n if (code != null) process.exit(code)\n}","title":""},{"docid":"023077786d8bee5f424c53d4fecd0cd9","score":"0.5581767","text":"function earlyExitHandler(code) {\n process.exit(code);\n }","title":""},{"docid":"2f8fc6689c7027f11da58f1fb05d9ba6","score":"0.5574282","text":"function exitHandler() {\n\tconsole.log(\"]\");\n\tconsole.error(`Processed Lines: ${state.outLines}`);\n\tprocess.exit();\n}","title":""},{"docid":"48e1f9f8be5e4a6ead39d64d1888b873","score":"0.5560298","text":"async function main() {\n // Spawn a child task that will error. Since we don't handle the child error,\n // it will propagate as an unhandled, rejected promise and kill this task as\n // well.\n print(\"parent: spawning simple-exit-1.js\");\n spawn(\"./simple-exit-1.js\");\n\n // Wait for the error to propagate.\n while (true) {\n await timeout(9999);\n }\n}","title":""},{"docid":"c4b745d4893ad9cf9f567fb5d424e6e4","score":"0.5560056","text":"async function shutdown(e) {\n\n let err = e\n console.log('Finalizando aplicação...')\n\n try {\n\n console.log('Encerrando módulo: Servidor Web...')\n await webServer.close()\n\n } catch (e) {\n\n console.log('Erro ao encerrar Servidor Web', e)\n err = err || e\n }\n\n try {\n\n console.log('Encerrando módulo: Banco de dados...')\n await database.close()\n\n } catch (e) {\n\n console.log('Erro encontrado', e)\n err = err || e\n }\n\n console.log('Saindo do processo')\n\n if (err) {\n process.exit(1)\n } else {\n process.exit(0)\n }\n}","title":""},{"docid":"18d508c87454a06f162ddd8ac121ffe7","score":"0.5559835","text":"function handlePrematureExit(code, signal) {\n if (options.monitor) {\n return reject(new Error(name + ' exited prematurely.'));\n }\n\n // In case of error, we've really got an error\n if (code > 0) {\n return reject(new Error(name + ' exited with error code ' + code));\n }\n }","title":""},{"docid":"2a24aced1e42a65b6ed993b777660917","score":"0.5559229","text":"function quit() {\n console.log(\"bye!\");\n console.log(\"Have a nice Day!\");\n process.exit();\n}","title":""}],"string":"[\n {\n \"docid\": \"9dfba6eda724418230543aabba059abc\",\n \"score\": \"0.6939805\",\n \"text\": \"function initTerminateHandlers() {\\n var readLine;\\n\\n if (process.platform === \\\"win32\\\"){\\n readLine = require(\\\"readline\\\");\\n\\n readLine.createInterface ({\\n input: process.stdin,\\n output: process.stdout\\n }).on(\\\"SIGINT\\\", function () {\\n process.emit(\\\"SIGINT\\\");\\n });\\n }\\n\\n // handle INTERRUPT (CTRL+C) and TERM/KILL signals\\n process.on('exit', function () {\\n if (server) {\\n console.log(chalk.blue('*'), 'Shutting down server');\\n server.stop();\\n }\\n console.log(); // extra blank line\\n });\\n process.on('SIGINT', function () {\\n console.log(chalk.blue.bold('!'), chalk.yellow.bold('SIGINT'), 'detected');\\n process.exit();\\n });\\n process.on('SIGTERM', function () {\\n console.log(chalk.blue.bold('!'), chalk.yellow.bold('SIGTERM'), 'detected');\\n process.exit(0);\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"561c66c7aae0df9407d3bdd820bd954d\",\n \"score\": \"0.6772231\",\n \"text\": \"function exitHandler(options, err) {\\n\\texec('sudo /etc/init.d/lirc stop', function(error, stdout, stderr) {\\n\\t\\tconsole.log('stdout: ' + stdout);\\n\\t\\tconsole.log('stderr: ' + stderr);\\n\\t\\tif (error) {\\n\\t\\t\\tthrow(error);\\n\\t\\t}\\n\\t\\t\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9b66f92ab5f85e33cbcb75afdf0074c\",\n \"score\": \"0.6726274\",\n \"text\": \"function fnExit(signal) { //exit handler\\n\\tconsole.log(\\\"\\\\n--------------------\\\");\\n\\tconsole.log(\\\"> Received [\\\" + signal + \\\"].\\\");\\n\\tconsole.log(\\\"--------------------\\\");\\n\\n\\tdao.close();\\n\\tsession.close();\\n\\tserver.close();\\n\\tsecsrv.close();\\n\\n\\tconsole.log(\\\"> Http server closed.\\\");\\n\\tconsole.log(\\\"> \\\" + (new Date()));\\n\\tconsole.log(\\\"--------------------\\\\n\\\");\\n\\tprocess.exit(0);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bbadd74ebaea251f6ff96b11bb9d5a3\",\n \"score\": \"0.6685012\",\n \"text\": \"_bind_exit_handler() {\\n let reference = this;\\n ['exit', 'SIGINT', 'SIGUSR1', 'SIGUSR2', 'SIGTERM'].forEach((type) =>\\n process.once(type, () => reference.close())\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42617d175574f3a04a1189b324b4ce64\",\n \"score\": \"0.66818327\",\n \"text\": \"function shutdown() {\\n console.log('\\\\nGot a stop signal, shutting down...');\\n process.exit(1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3eab76c4576730955cf6485e26aad87\",\n \"score\": \"0.6667114\",\n \"text\": \"async function exitHandler(options = {}) {\\n await server\\n .close()\\n .then(() => {\\n console.info('Server has been shut down successfuly')\\n })\\n .catch(e => {\\n console.warn('An error ocurred while shutting down the server', e.stack)\\n })\\n if (options.exit) process.exit()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"300a6eb1b7b59c057827d8804c8dd320\",\n \"score\": \"0.66499865\",\n \"text\": \"function handleClose() {\\n console.log('server closed!');\\n process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42e834229a5e254304f1d928b2a5a610\",\n \"score\": \"0.6629558\",\n \"text\": \"function terminationHandler (options, err) {\\n\\tif (err) {\\n \\t\\tconsole.log (\\\"\\\\ntermination err: \\\" + err); //this is a custom error object, not a standard one\\n \\t}\\n\\n\\tif (options.cleanup) {\\n\\t\\tconsole.log ('Exiting...');\\n\\t\\t//periodic.shutdown ();\\n\\t\\tscreen.shutdown ();\\n\\t\\tprocess.exit();\\n\\t}\\n\\n\\tif (options.exit) {\\n\\t\\tconsole.log (`\\\\n(Ctrl-C) server terminating.\\\\n`);\\n\\t\\tperiodic.shutdown ();\\n\\t\\t//screen.shutdown ();\\n\\t\\tprocess.exit();\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91e0acbeb6481fea5df22fd1fabc29a7\",\n \"score\": \"0.66275823\",\n \"text\": \"function exitHandler(options, exitCode) {\\n for (const handler of exitHandlers) {\\n handler();\\n }\\n if (exitCode || exitCode === 0) {\\n if (typeof exitCode !== 'number') {\\n /** not a 'clean' exit log to console */\\n console.log(exitCode);\\n }\\n }\\n // TODO: kill the server here. (but only if started from scully, not when started from another process)\\n if (options.exit) {\\n if (browser) {\\n browser.close().then(() => process.exit(exitCode));\\n }\\n else {\\n process.exit(exitCode);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c646d43f0bb5bc0ee4f8b997ac4761d7\",\n \"score\": \"0.65105885\",\n \"text\": \"function exitHandler(options, exitCode) {\\n client.say(channel,'GITSbot1000 signing off. Thanks for watching. GG everyone!');\\n \\n if (options.cleanup) console.log('clean');\\n if (exitCode || exitCode === 0) console.log(exitCode);\\n if (options.exit) process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15e35b00cb5b9f0355fbff06ff4c4c8a\",\n \"score\": \"0.65023774\",\n \"text\": \"function processTerminator(sig) {\\n if (typeof sig === 'string') {\\n process.exit(1);\\n }\\n console.log('%s: Node server stopped.', Date(Date.now()));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0501288a92472889b3f40f887d6e0570\",\n \"score\": \"0.6489653\",\n \"text\": \"function exitHandler(options, err) {\\n var sshKeys = Object.keys(sshPortMap);\\n var vncKeys = Object.keys(vncPortMap);\\n \\n _.each(sshKeys, function (item, index) {\\n destroyTunnle(sshPortMap[item]);\\n });\\n\\n _.each(vncKeys, function (item, index) {\\n destroyTunnle(sshPortMap[item]);\\n });\\n\\n process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bed52460a329aed0905e410f24875611\",\n \"score\": \"0.6488019\",\n \"text\": \"function processTerminator(sig) {\\n if (typeof sig === 'string') {\\n process.exit(1);\\n }\\n console.log('%s: Node server stopped.', Date(Date.now()));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e36000a15b16e1351d2ab7011a122d0\",\n \"score\": \"0.64670557\",\n \"text\": \"function exitHandler(options, exitCode){\\n if(options.cleanup){\\n cmd.run('kill ' + rProc.pid);\\n }\\n\\n if(exitCode || exitCode == 0){\\n console.log(exitCode);\\n }\\n if(options.exit){\\n process.exit();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e24f7995ad08bfaac7b376f266cc412\",\n \"score\": \"0.6385194\",\n \"text\": \"function handle(signal) {\\n console.log(`received ${signal}`);\\n server.close(() => {\\n console.log('server closed');\\n process.exit(0);\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83f44ecb18cff5f39dbe4e1eb8b51a63\",\n \"score\": \"0.63848585\",\n \"text\": \"async function exitHandler(options, exitCode) {\\n if (browser) {\\n if (typeof wsDebuggerHash == 'string' && wsDebuggerHash) {\\n // pass\\n } else {\\n await browser.close();\\n browser = null;\\n }\\n }\\n\\n if (options.cleanup) {\\n console.log('clean up');\\n }\\n if (exitCode || exitCode === 0) {\\n console.log(exitCode);\\n }\\n if (options.exit) {\\n process.exit();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"708d2f9455b2b8e41cad3a7f7ea51642\",\n \"score\": \"0.6366643\",\n \"text\": \"function exit() {\\n send('exit');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d88afb7427f030f3b119343ff8b65854\",\n \"score\": \"0.63385904\",\n \"text\": \"function setupCloseOnExit(server) {\\n async function exitHandler(options = {}) {\\n await server\\n .close()\\n .then(() => {\\n console.info(`Server successfully closed at ${currentTime}`);\\n })\\n .catch((e) => {\\n console.warn(`Something went wrong closing the server at ${currentTime}`, e.stack);\\n });\\n\\n if (options.exit) {\\n if (options.exit) {\\n // process.exit();\\n throw new Error(`Exit process.exit Node JS at ${currentTime}`);\\n }\\n }\\n }\\n\\n // do something when app is closing\\n process.on(\\\"exit\\\", exitHandler);\\n // catches ctrl+c event\\n process.on(\\\"SIGINT\\\", exitHandler.bind(null, { exit: true }));\\n // catches \\\"kill pid\\\" (for example: nodemon restart)\\n process.on(\\\"SIGUSR1\\\", exitHandler.bind(null, { exit: true }));\\n process.on(\\\"SIGUSR2\\\", exitHandler.bind(null, { exit: true }));\\n // catches uncaught exceptions\\n process.on(\\\"uncaughtException\\\", (err) => {\\n console.error(\\\"Caught exception: \\\", err);\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87a6f154963e6fd7bc7282caa68accf6\",\n \"score\": \"0.6321331\",\n \"text\": \"function handle(signal) {\\n console.log('Received exit signal. Bye!');\\n process.exit(-1)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87a6f154963e6fd7bc7282caa68accf6\",\n \"score\": \"0.6321331\",\n \"text\": \"function handle(signal) {\\n console.log('Received exit signal. Bye!');\\n process.exit(-1)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52975db27960657ef9c50e3c2afb8e2f\",\n \"score\": \"0.63128626\",\n \"text\": \"function gracefulShutdown(){\\n console.log('About to exit, closing servers.');\\n\\n servers.forEach(function(server, index){\\n server.close();\\n });\\n\\n process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"755f5fc112d32792476f85fe1a153616\",\n \"score\": \"0.63077253\",\n \"text\": \"function exitHandler(options, err) {\\n\\tstopBot( ).then( ( r ) => {\\n\\tif (options.cleanup) console.log('clean');\\n\\tif (err) console.log(err.stack);\\n\\tif (options.exit) process.exit();\\n\\t} );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe4e2c42b7e4f227af2794cf9c6f722d\",\n \"score\": \"0.6290391\",\n \"text\": \"function sigterm() {\\n return stop('SIGTERM');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"836518df7cbc74a6fb9c1abad0b5abbb\",\n \"score\": \"0.6288717\",\n \"text\": \"async function exitHandler(options, exitCode) {\\n console.log(options, exitCode);\\n //Burada botun aktif olmadığına dair ana gruba mesaj atabiliriz\\n //Yada botun durumunu, açıklamasını veya başka bir özelliğini değiştirerek çalışır olmadığını gösterebiliriz\\n await cb();\\n\\n // if (options.cleanup) console.log('clean');\\n // if (exitCode || exitCode === 0) console.log(exitCode);\\n if (options.exit) process.exit();\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00a5d8bf6e7c1c267fb4c58ed5f73e90\",\n \"score\": \"0.62526876\",\n \"text\": \"function shutdown(exitCode) {\\n logger.info('Server stopping...')\\n\\n server.close(() => {\\n logger.info('Server stopped')\\n process.exitCode = exitCode\\n })\\n\\n // Forcibly shutdown after 10 seconds\\n setTimeout(() => {\\n throw new Error('Forcibly shutting down')\\n }, 10000).unref()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48bc9f83622f165eb63aceaaef468f24\",\n \"score\": \"0.621217\",\n \"text\": \"function setupCloseOnExit(server) {\\n // thank you stack overflow\\n // https://stackoverflow.com/a/14032965/971592\\n async function exitHandler(options = {}) {\\n await server\\n .close()\\n .then(() => {\\n console.info('Server has been shut down successfuly')\\n })\\n .catch(e => {\\n console.warn('An error ocurred while shutting down the server', e.stack)\\n })\\n if (options.exit) process.exit()\\n }\\n\\n // do something when app is closing\\n process.on('exit', exitHandler)\\n\\n // catches ctrl+c event\\n process.on('SIGINT', exitHandler.bind(null, { exit: true }))\\n\\n // catches \\\"kill pid\\\" (for example: nodemon restart)\\n process.on('SIGUSR1', exitHandler.bind(null, { exit: true }))\\n process.on('SIGUSR2', exitHandler.bind(null, { exit: true }))\\n\\n // catches uncaught exceptions\\n process.on('uncaughtException', exitHandler.bind(null, { exit: true }))\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4bce80f211ec22d2f43ab33e95ad92fc\",\n \"score\": \"0.6202486\",\n \"text\": \"function exitHandler(options, err){\\n\\tif(options.cleanup){\\n\\t\\tglobal.reportNotify('WSAPP', 'EXITING APP', 0);\\n\\t\\t//close mysql connections\\n\\t\\t//Connection.terminateAll();\\n\\t}\\n\\tif(err){\\n\\t\\tconsole.log(err.stack);\\n\\t}\\n\\tif(options.exit){\\n\\t\\tprocess.exit();\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbb03c3822b2462f95ce83cd44569e31\",\n \"score\": \"0.61925614\",\n \"text\": \"function cleanExit() {\\n serviceHelper.log(\\n 'warn',\\n 'Service stopping',\\n );\\n serviceHelper.log(\\n 'trace',\\n 'Close rest server',\\n );\\n server.close(() => {\\n serviceHelper.log(\\n 'info',\\n 'Exit the app',\\n );\\n process.exit(1); // Exit app\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be1af8e03b1b8a97fa0c5ada56a37e30\",\n \"score\": \"0.6183949\",\n \"text\": \"function exitHandler(options, exitCode) {\\n endCalls();\\n if (options.cleanup) console.log('clean');\\n if (exitCode || exitCode === 0) console.log(exitCode);\\n if (options.exit) process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96318b19f94390fa19642748450d9090\",\n \"score\": \"0.61807674\",\n \"text\": \"function finish() {\\n console.log(\\\"closing ports...\\\");\\n for(var i = 0; i < 127; ++i)\\n output.sendMessage([NOTEOFF,i,127]);\\n output.closePort();\\n process.exit(0);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dec6e5a332ae9e5b4e8c1857f0d64289\",\n \"score\": \"0.61710995\",\n \"text\": \"function handleExit(options, err) {\\n if (options.cleanup) {\\n const actions = [server.close, db.destroy];\\n actions.forEach((close, i) => {\\n try {\\n close(() => {\\n if (i === actions.length - 1) process.exit();\\n });\\n } catch (err) {\\n if (i === actions.length - 1) process.exit();\\n }\\n });\\n }\\n if (err) console.error(err);\\n if (options.exit) process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a67681d6e58d404338b6840734364d0\",\n \"score\": \"0.6168537\",\n \"text\": \"function exitOnSignal(signal) {\\n process.on(signal, function () {\\n logger.warn(i18n.__('app.serverShutdown', signal));\\n process.exit(1);\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0483521aa50e3dbcf353666dbe8545ae\",\n \"score\": \"0.6139169\",\n \"text\": \"function shutdown() {\\r\\n\\tprocess.exit();\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffb22bcae02329c9b24f79ce02f41297\",\n \"score\": \"0.61281496\",\n \"text\": \"function exitHandler(cleanUpFn) {\\n process.stdin.resume() // so the program will not close instantly\\n const exit = () => {\\n cleanUpFn()\\n process.exit()\\n }\\n process.on('exit', exit)\\n //catches ctrl+c event\\n process.on('SIGINT', exit)\\n // catches \\\"kill pid\\\" (for example: nodemon restart)\\n process.on('SIGUSR1', exit)\\n process.on('SIGUSR2', exit)\\n //catches uncaught exceptions\\n process.on('uncaughtException', exit)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d53e200980977207bcbdf4d6bbfc13a1\",\n \"score\": \"0.60999006\",\n \"text\": \"function endClient() {\\n\\tconsole.log('Connection closed');\\n\\tprocess.exit(0);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd4e15c77199e937c5790055342c9d35\",\n \"score\": \"0.60960764\",\n \"text\": \"function exitApp() {\\n console.log('\\\\nCleaning up GPIO...')\\n io.close();\\n console.log('Websocket Closed');\\n http.close(() => {\\n console.log('Server terminated')\\n console.log('\\\\x1b[31m%s\\\\x1b[0m','EXIT');\\n process.exit(0); //exit completely\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3262ef30e2c80636827cf72585bfa394\",\n \"score\": \"0.60906535\",\n \"text\": \"async function exitHandler(options, exitCode) {\\n await Stats.saveStats();\\n if (options.cleanup) {\\n await Listener.unsubAll();\\n await Sync.unsubSync();\\n await fs.writeFileSync(`./${ipfs.host}/hostedFiles.json`, JSON.stringify(ipfsearch.hostedFiles), (e) => {soLog(e);});\\n log('Clean exit. Goodbye.')\\n process.exit();\\n }\\n if (exitCode || exitCode === 0) {\\n log(`Received exitcode: ${exitCode}`);\\n }\\n if (options.exit) {\\n log('Exit.');\\n process.exit();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c683aad3186859bda4c3d8f2d67d8d06\",\n \"score\": \"0.6074944\",\n \"text\": \"function exitHandler(options, err) {\\n //console.log(\\\"SRVR:EXITING \\\"+id);\\n //if (options.cleanup) { cleanup(); }\\n if (err) console.log(err.stack);\\n if (options.exit) process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8729a644012f2c6fff8d3925c419c599\",\n \"score\": \"0.603623\",\n \"text\": \"function processExit() {\\n process.removeListener('message', processMessageListener);\\n\\n process.send({ type: 'result', data: result });\\n\\n process.exit(0);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"892f66b3fb85731944684c3bb50a0cce\",\n \"score\": \"0.6034791\",\n \"text\": \"function gracefulShutdown() {\\n console.log();\\n console.log('Starting Shutdown ...');\\n\\n // Close all chat boxes to the server\\n Object.keys(io.sockets.sockets).forEach(function(s) { \\n io.sockets.sockets[s].disconnect(true);\\n });\\n\\n // Once the server closes, exit\\n server.close(function() {\\n console.log('Shutdown complete');\\n process.exit(0);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3414fa414ece7490e21d7dbd3e5687bd\",\n \"score\": \"0.6033928\",\n \"text\": \"function exitHandler(options, err) {\\n motor.close(function (err) {\\n if (err) {\\n console.log(err);\\n }\\n console.log('motor port closed');\\n process.exit();\\n });\\n if (err) {\\n console.log(err.stack);\\n process.exit();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abeed4c73914ad7414058713bcf4bb85\",\n \"score\": \"0.60124195\",\n \"text\": \"function exit(code) {\\n /* istanbul ignore next */\\n if (process.platform === 'win32' && process.stdout.bufferSize) {\\n process.stdout.once('drain', function() {\\n process.exit(code);\\n });\\n return;\\n }\\n process.exit(code);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b89f164bd81faf94782ef78ddb39ed5e\",\n \"score\": \"0.5982358\",\n \"text\": \"function handleAppExit(options, err) {\\n if (err) {\\n console.log(err.stack)\\n }\\n\\n if (options.cleanup) {\\n client.publish('JANDI/connected', 'false');\\n }\\n\\n if (options.exit) {\\n process.exit()\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1ac7e1e1991c8a647d22ff46410e323\",\n \"score\": \"0.5979099\",\n \"text\": \"function exitHandler(options, err) {\\n //lcdDisplay.clear();\\n if (options.cleanup) console.log('clean');\\n if (err) console.log(err.stack);\\n if (options.exit) process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"140090dfd0ab882d25838bf9c6c62a55\",\n \"score\": \"0.5964395\",\n \"text\": \"async function exitHandler() {\\n\\tconsole.log('Exit detected, closing wallet');\\n await httpDel('/wallet')\\n\\n\\tconsole.log('Wallet closed, stopping process');\\n\\tprocess.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9185c4b01eaf2ea4f435803772337455\",\n \"score\": \"0.59593713\",\n \"text\": \"function sigint() {\\n return stop('SIGINT');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b95b1bfd44b15e496ebf6918ec673bbe\",\n \"score\": \"0.5958556\",\n \"text\": \"function killServers () {\\n ui.log();\\n\\n // Hitting Ctrl-C more than once?\\n // Take the hint.\\n if (dying) ui.exit(\\\"Forced termination.\\\");\\n dying = true;\\n\\n ui.log(\\\"Telling browsers to disconnect...\\\");\\n ui.log(\\\"(Hit Ctrl-C again to force quit.)\\\");\\n\\n var ports = server.getPorts();\\n ct = ports.length;\\n ports.forEach(function (port) {\\n var tests = server.getEmitterForPort(port);\\n if (tests.listeners(\\\"shutdown\\\").length) {\\n tests.emit(\\\"shutdown\\\", KILLCB);\\n } else KILLCB();\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1dac635dc583aaefac6b79b6b8c33f0\",\n \"score\": \"0.5957133\",\n \"text\": \"function quit() {\\n process.exit(true === hasErrors ? 2 : 0);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bd97e38e9b9358773a91d73e582bdd0\",\n \"score\": \"0.59532946\",\n \"text\": \"function exitHandler(options, exitCode) {\\n gameSimDatabaseConnector.flushToDB( (err)=>{\\n if (options.cleanup) console.log('clean');\\n if (exitCode || exitCode === 0) console.log(exitCode);\\n if (options.exit) process.exit();\\n })\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"431522075ab253fbb924b9841512d826\",\n \"score\": \"0.5952484\",\n \"text\": \"function exitApplication() {\\n\\tconsole.log(\\\"Good bye!\\\");\\n\\tconnection.end();\\n\\treturn;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93e0b598802962b5f403a6e2a4f0f4f4\",\n \"score\": \"0.59120905\",\n \"text\": \"function interrupt() {\\n if (interruptHandlers.length === 0) {\\n return process.exit(0);\\n }\\n if (interrupted) {\\n console.log('\\\\nKilling process with extreme prejudice');\\n return process.exit(1);\\n }\\n else {\\n interrupted = true;\\n }\\n close(function () { return process.exit(0); });\\n console.log('\\\\nShutting down. Press ctrl-c again to kill immediately.');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1751ac405796779e5af571da835ddbe7\",\n \"score\": \"0.58893985\",\n \"text\": \"function onExit(){\\n app.emit(\\\"sandbox::shovel::stopped\\\")\\n var err = Error(\\\"Sandbox process was shutdown\\\")\\n err.refinedStack = \\\"Sandbox was shutdown, probably because you have reached a sandbox limit (memory, CPU) with your code\\\"\\n app.emit(\\\"sandbox::return\\\", err)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3f1dbcf38e45550195df7803a0c7949\",\n \"score\": \"0.58803064\",\n \"text\": \"exit() {\\n\\t\\tconsole.clear();\\n\\t\\tconsole.warn('Shutting down the server');\\n\\t\\ttry {\\n\\t\\t\\tSessionStorage.Instance.save();\\n\\t\\t} catch(e) {\\n\\t\\t\\tconsole.error(e);\\n\\t\\t}\\n\\n\\t\\tconsole.warn('------------------------');\\n\\t\\tprocess.exit(1);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d661dec168d5bad3312e4cdaed3304eb\",\n \"score\": \"0.5862524\",\n \"text\": \"async term() {\\n\\t\\tlog.lib('Terminating');\\n\\n\\t\\tthis.terminating = true;\\n\\n\\t\\tfor (const intf in config.intf) {\\n\\t\\t\\tif (config.intf[intf].enabled !== true) continue;\\n\\t\\t\\tlog.lib(`Ending '${intf}' socket`);\\n\\n\\t\\t\\tawait this.intf[intf].end();\\n\\t\\t\\tawait this.intf[intf]._socket.destroy();\\n\\n\\t\\t\\tupdate.status(`server.sockets.${intf}.connected`, false, false);\\n\\t\\t\\tupdate.status(`server.sockets.${intf}.connecting`, false, false);\\n\\t\\t\\tupdate.status(`server.sockets.${intf}.reconnecting`, false, false);\\n\\t\\t} // for (let intf in config.intf)\\n\\n\\t\\tlog.lib('Terminated');\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cc629c2a6ce61af421c3a5f8f708b09\",\n \"score\": \"0.5850836\",\n \"text\": \"function handleAppExit(options, err){\\n if (err){\\n console.log(err.stack)\\n }\\n if (options.cleanup){\\n client.publish('garage/connected','false')\\n }\\n if (option.exit){\\n process.exit()\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ea3d1998616f413b05dfae71fa7a8bc\",\n \"score\": \"0.58301145\",\n \"text\": \"function exit(exitCode) {\\n if (process.stdout._pendingWriteReqs || process.stderr._pendingWriteReqs) {\\n process.nextTick(function() {\\n exit(exitCode);\\n });\\n } else {\\n process.exit(exitCode);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8547b54b08b81492a6a0e218e86129f\",\n \"score\": \"0.5825946\",\n \"text\": \"function cleanup() {\\n logger.info(\\\"Closing server;\\\");\\n server.close();\\n process.exit(0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fcd0b641dea3d8f1f284945e69634c74\",\n \"score\": \"0.58223516\",\n \"text\": \"function shutdown(sig) {\\n\\n return new Promise((resolve, reject) => {\\n\\n function cleanupHttp() {\\n return new Promise((resolve, reject) => {\\n destroyAllConnections();\\n\\n // normal shutdown / do not allow new connections\\n server.close((err) => {\\n if (err) { return reject(err); }\\n resolve();\\n });\\n });\\n }\\n\\n debug('shutdown signal - ' + sig);\\n\\n // Don't bother with graceful shutdown on development to speed up round trip\\n if (options.development) {\\n debug('DEV-Mode - imediate forceful shutdown');\\n return process.exit(0);\\n }\\n\\n const finalHandler = () => {\\n if (!finalRun) {\\n finalRun = true;\\n if (options.finally && isFunction(options.finally)) {\\n options.finally();\\n }\\n process.nextTick(() => {\\n if (fnIntervall) {\\n fnIntervall.unref();\\n }\\n if (options.forceExit) {\\n process.exit(failed ? 1 : 0);\\n }\\n resolve();\\n });\\n }\\n };\\n\\n const exitHandler = promise => promise\\n .catch((err) => {\\n const errString = (typeof err === 'string') ? err : JSON.stringify(err);\\n debug(errString);\\n failed = true;\\n reject(errString);\\n });\\n\\n if (!isShuttingDown) {\\n isShuttingDown = true;\\n debug('shutting down');\\n\\n const pollIterations = options.timeout ? Math.round(options.timeout / 250) : 0;\\n // forcefull shutdown after timeout\\n if (options.timeout) {\\n let interation = 0;\\n fnIntervall = setInterval(function () {\\n interation++;\\n\\n // test all connections closed already?\\n if (Object.keys(connections).length === 0 && Object.keys(secureConnections).length === 0) {\\n if (options.onShutdown && isFunction(options.onShutdown && !shutdownRun)) {\\n shutdownRun = true;\\n exitHandler(options.onShutdown(sig)).then(() => {\\n finalHandler();\\n\\n process.nextTick(() => {\\n resolve();\\n if (options.forceExit) {\\n process.exit(1);\\n }\\n });\\n });\\n } else if (!shutdownRun) {\\n // no onShutdown function\\n finalHandler();\\n\\n process.nextTick(() => {\\n resolve();\\n if (options.forceExit) {\\n process.exit(1);\\n }\\n });\\n }\\n }\\n if (interation === pollIterations) {\\n // timeout time reached! Now forcefully close all connections\\n debug('Could not close connections in time (' + options.timeout + 'ms), forcefully shutting down');\\n\\n // destroy rest of connections\\n destroyAllConnections(true);\\n\\n // call finally function (if provided in options)\\n finalHandler();\\n\\n process.nextTick(() => {\\n resolve();\\n if (options.forceExit) {\\n process.exit(1);\\n }\\n });\\n }\\n }, 250);\\n }\\n\\n exitHandler(cleanupHttp()).then(() => {\\n if (options.onShutdown && isFunction(options.onShutdown) && !shutdownRun) {\\n\\n shutdownRun = true;\\n return exitHandler(options.onShutdown(sig));\\n } else {\\n return;\\n }\\n }).then(finalHandler);\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"102e7462724a554d7cdcbe80a2f3521b\",\n \"score\": \"0.5815354\",\n \"text\": \"onStop (err, cb, code, signal) {\\n console.log(`App has exited with code ${code}`)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0beaae3070fbc08cd8ca6c8ec67ba542\",\n \"score\": \"0.5813997\",\n \"text\": \"function handleShutdown (handlerFn) {\\n const signals = ['SIGHUP', 'SIGINT', 'SIGQUIT', 'SIGABRT', 'SIGTERM']\\n signals.forEach(signal => process.on(signal, (signal) => {\\n log.info(`Received ${signal}, shutting down...`)\\n handlerFn()\\n }))\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3bd11611b655c64a014915de48c4be71\",\n \"score\": \"0.5811293\",\n \"text\": \"async function stopServer() {\\n eel.close_process('epic.exe')\\n await sleep(1000)\\n changeBtnFunc($('#serverButton'), 'start')\\n changeBtn($('#serverButton'), 'start')\\n changeIcon($('#serverIcon'), 'error')\\n changeStatus($('#serverStatus'), 'Stopped')\\n send_console('')\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ca852294e147206578564b6ec8fde4e\",\n \"score\": \"0.5802899\",\n \"text\": \"function exitHandler() {\\n console.log(\\\"Program exiting...\\\");\\n\\n if ( isRecording ) {\\n stop_record();\\n }\\n\\n process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74beaa7846a0202435963aa8997502d5\",\n \"score\": \"0.58007604\",\n \"text\": \"function exitProcess(errCode) {\\n\\n\\t// HACK: can't flush std, the correct approach is to not have\\n\\t// to process exit, but let node automatically exit when the event\\n\\t// loop becomes empty, but because of the logger issue we can't do that\\n\\n\\treturn Q.delay(5000)\\n\\t\\t.then(function() {\\n\\t\\t\\tprocess.exit(errCode);\\n\\t\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"223427905351ddbaf4fd47ecde5aa895\",\n \"score\": \"0.57939476\",\n \"text\": \"function gracefulShutdown() {\\n logger.info('Closing application server ...');\\n\\n server.close(() => {\\n logger.info('Application server closed');\\n process.exit(0);\\n });\\n\\n // Force close server after 5secs\\n setTimeout((e) => {\\n logger.info('Application server closed', e);\\n process.exit(1);\\n }, 5000);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee445c21bfb98172f08ac88f7a2eea49\",\n \"score\": \"0.5790551\",\n \"text\": \"function exitHandler(options, err) {\\n if (options.cleanup) console.log('exit');\\n if (err) console.log(err.stack);\\n if (options.exit) process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"902c6411d6df17691fe8a9a77219c3b7\",\n \"score\": \"0.5778841\",\n \"text\": \"function terminator(sig) {\\n if (typeof sig === \\\"string\\\") {\\n console.log('%s: Received %s - terminating Node server ...',\\n Date(Date.now()), sig);\\n process.exit(1);\\n }\\n console.log('%s: Node server stopped.', Date(Date.now()) );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"902c6411d6df17691fe8a9a77219c3b7\",\n \"score\": \"0.5778841\",\n \"text\": \"function terminator(sig) {\\n if (typeof sig === \\\"string\\\") {\\n console.log('%s: Received %s - terminating Node server ...',\\n Date(Date.now()), sig);\\n process.exit(1);\\n }\\n console.log('%s: Node server stopped.', Date(Date.now()) );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7921eb3fcfec0f0d65dc766529ab528f\",\n \"score\": \"0.5765992\",\n \"text\": \"function exitHandler(options, err) {\\n if (options.cleanup) cleanUp();\\n if (err && err.stack) console.log(err.stack);\\n if (options.exit) process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c02af6f4183da24082debdb49cffbb06\",\n \"score\": \"0.5749573\",\n \"text\": \"function exitHandler(options, err) {\\n\\n if (options.cleanup) {\\n logger.debug('Closing logfiles...');\\n uavConnectionManager.stopLogging();\\n }\\n\\n if (err) {\\n logger.error(util.inspect(err));\\n }\\n\\n if (options.exit) process.exit();\\n\\n // For restarting with Nodemon\\n if (options.killProcess) {\\n process.kill(process.pid, 'SIGUSR2');\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a4137a77e925628c498f334fc3bf70d\",\n \"score\": \"0.5738386\",\n \"text\": \"function sigHandler(signal) {\\n log(`Caught signal: ${signal}.`);\\n if (signal == 'SIGINT' || signal == 'SIGTERM') {\\n process.exit(0);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d68475c2d995990b9815c4e943d1b43\",\n \"score\": \"0.57271063\",\n \"text\": \"function sigterm() {\\n log.info('SIGTERM received...shutting down');\\n killAllWorkers('SIGTERM');\\n\\n if (root) {\\n fs.unlink(pidLocation, function(err) {\\n if (err) {\\n log.error(err);\\n }\\n });\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51fe8746999763e049befbc0add0c075\",\n \"score\": \"0.57226276\",\n \"text\": \"function exit (){\\n throw new Error('Exit requested by script')\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"247250843c3c18e3fa8d11925ec412d0\",\n \"score\": \"0.5714146\",\n \"text\": \"function exitHandler() {\\n // cursor restore\\n if (cursor) {\\n process.stdout.write(`\\\\x1b[${cursor.col};${cursor.row}H\\\\x1b[0m`);\\n }\\n // SGR restore\\n process.stdout.write('\\\\x1b[0m');\\n // termios restore\\n initial.writeTo(0);\\n console.log();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3bae5e8a494f1c22c9769d611ce2f677\",\n \"score\": \"0.57132465\",\n \"text\": \"function exitHandler() {\\n console.log('cleaning up...');\\n clearInterval(blinkInterval);\\n msleep(500);\\n console.log(\\\"closing AMQP client...\\\")\\n // client.close(\\n // function(err, result){\\n // if(err){\\n // console.log(err);\\n // }else{\\n // console.log(result);\\n // console.log(\\\"client disconnected!\\\");\\n // }\\n // }\\n // );\\n msleep(500);\\n console.log(\\\"deallocating red...\\\")\\n clearLED(red);\\n msleep(500);\\n console.log(\\\"deallocating yellow...\\\")\\n clearLED(yellow);\\n msleep(500);\\n console.log(\\\"deallocating green...\\\")\\n clearLED(green) \\n msleep(500);\\n console.log(\\\"I'M OUT! SEE YA!\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90a436ec5bd9ea52fce1fc6991aba577\",\n \"score\": \"0.5711005\",\n \"text\": \"function end () {\\n if (childProc) {\\n childProc.kill('SIGKILL');\\n childProc = null;\\n } \\n console.log('\\\\b\\\\b ');\\n console.log('emi-cli ended...'.bold.yellow);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d7479cb60a8ddcffcc08c1f6c8bcee5\",\n \"score\": \"0.5692394\",\n \"text\": \"function exit(code) {\\n\\n function done() {\\n if (!(draining--)) _exit(code)\\n }\\n\\n var draining = 0\\n var streams = [process.stdout, process.stderr]\\n\\n exit.exited = true\\n\\n streams.forEach(function (stream) {\\n // submit empty write request and wait for completion\\n draining += 1\\n stream.write('', done)\\n })\\n\\n done()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8a27080d387c79c09e850cf485f0ce9\",\n \"score\": \"0.5689293\",\n \"text\": \"function sig_handle() {\\n if (child) {\\n child.kill('SIGINT');\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9885f1f88c85183d9ad1409fc89326d\",\n \"score\": \"0.5688968\",\n \"text\": \"async function quit() {\\n process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f893afac46e1a9a20f4178afc6c53cc2\",\n \"score\": \"0.5688954\",\n \"text\": \"function handleExit(message, error) {\\n console.log(`\\\\n${message}\\\\n`);\\n const exitCode = error ? 1 : 0;\\n process.exit(exitCode);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91b1678c5debb54418bbe114be8fbe12\",\n \"score\": \"0.56814265\",\n \"text\": \"function exitHandler(options, err) {\\n//close connection to mongodb\\n db.close();\\n if (options.cleanup) console.log('clean exit');\\n if (err) console.log(err.stack);\\n if (options.exit) process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"746f633ac9b778128877f779cf35105e\",\n \"score\": \"0.56748766\",\n \"text\": \"exit() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9eaf059afbcec159490943a896ea5ed\",\n \"score\": \"0.5664019\",\n \"text\": \"function exit() {\\n connection.end();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad0cf137f27e7fc87e34f7da66cc8563\",\n \"score\": \"0.56621754\",\n \"text\": \"async processExit(exitCode) {\\n await utils.sleep(1)\\n debug('The ring-mqtt process is shutting down...')\\n await ring.go2rtcShutdown()\\n if (ring.devices.length > 0) {\\n debug('Setting all devices offline...')\\n await utils.sleep(1)\\n ring.devices.forEach(ringDevice => {\\n if (ringDevice.availabilityState === 'online') {\\n ringDevice.shutdown = true\\n ringDevice.offline()\\n }\\n })\\n }\\n await utils.sleep(2)\\n if (exitCode || exitCode === 0) debug(`Exit code: ${exitCode}`);\\n process.exit()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4afeb455164a7a38d24b37afce48092d\",\n \"score\": \"0.5657592\",\n \"text\": \"function shutdown(error) {\\n error ? console.error(error) : console.log('shutting down')\\n try {\\n if (server) server.close()\\n } catch (err) {\\n // noop who cares\\n }\\n process.exit(error ? 1 : 0)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d2f36a5f7ab296ae4de552cc54775ee\",\n \"score\": \"0.565289\",\n \"text\": \"function exit() {\\n process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30a59dc0a09348f15285cae054ae82d9\",\n \"score\": \"0.5651382\",\n \"text\": \"function exit(code) {\\n function done() { if (!(draining--)) _exit(code); }\\n\\n var draining = 0;\\n var streams = [process.stdout, process.stderr];\\n\\n exit.exited = true;\\n\\n streams.forEach(function(stream){\\n // submit empty write request and wait for completion\\n draining += 1;\\n stream.write('', done);\\n });\\n\\n done();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"112759753b352db5a8b8c29f7e8100df\",\n \"score\": \"0.5649205\",\n \"text\": \"function cleanup() {\\n if (!SHUTDOWN) {\\n SHUTDOWN = true;\\n console.log(\\\"\\\\n\\\", \\\"IPC: Terminating.\\\", \\\"\\\\n\\\");\\n connections.forEach(t => {\\n console.log(\\\"IPC: Disconnecting\\\", t.timestamp);\\n t.stream.write(composeFrame(JSON.stringify({ id: 1, method: \\\"disconnect\\\" })));\\n t.stream.end();\\n });\\n server.close();\\n process.exit(0);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"928df189e0a3c04ba8ffb2b268af1302\",\n \"score\": \"0.56392294\",\n \"text\": \"function exit()\\n{\\n\\txrxSessionExitApplication( \\\"http://127.0.0.1\\\", callbackFailure );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"928df189e0a3c04ba8ffb2b268af1302\",\n \"score\": \"0.56392294\",\n \"text\": \"function exit()\\n{\\n\\txrxSessionExitApplication( \\\"http://127.0.0.1\\\", callbackFailure );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1245ef4e253af21a8838c0e97d4f961a\",\n \"score\": \"0.5627069\",\n \"text\": \"function exit(code) {\\n function done() {\\n if (!(draining--)) _exit(code)\\n }\\n\\n var draining = 0\\n var streams = [process.stdout, process.stderr]\\n\\n exit.exited = true\\n\\n streams.forEach(function (stream) {\\n // submit empty write request and wait for completion\\n draining += 1\\n stream.write('', done)\\n })\\n\\n done()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6584fd59f9d2877ade451e8d4a9ed361\",\n \"score\": \"0.5617725\",\n \"text\": \"function cleanup(){\\n if(!SHUTDOWN){ SHUTDOWN = true;\\n console.log('\\\\n',\\\"Terminating.\\\",'\\\\n');\\n if(Object.keys(connections).length){\\n let clients = Object.keys(connections);\\n while(clients.length){\\n let client = clients.pop();\\n connections[client].write('__disconnect');\\n connections[client].end(); \\n }\\n }\\n server.close();\\n process.exit(0);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a13c8a6dda6fe07fdc370289023e9d19\",\n \"score\": \"0.55954874\",\n \"text\": \"function initProcessExitHandlers() {\\n process.stdin.resume();\\n\\n /**\\n * @param {Error} error\\n */\\n function exitHandler(error) {\\n if (error) {\\n logger.err(`Process error: ${error.message}`);\\n logger.err(error.stack);\\n }\\n }\\n\\n process.on(\\\"exit\\\", exitHandler);\\n process.on(\\\"uncaughtException\\\", exitHandler);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8715e002174417e75f7a531f445a136\",\n \"score\": \"0.55910295\",\n \"text\": \"function exitHandler(deRegisterChoice) {\\n if (this.deRegisterChoice) {\\n client.stop();\\n console.log('Client De-registered');\\n }\\n process.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cc3f5d062f4a7d7c35e6aa63e75d5be\",\n \"score\": \"0.55890083\",\n \"text\": \"function exit(code) {\\n if (code != null) process.exit(code)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"023077786d8bee5f424c53d4fecd0cd9\",\n \"score\": \"0.5581767\",\n \"text\": \"function earlyExitHandler(code) {\\n process.exit(code);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f8fc6689c7027f11da58f1fb05d9ba6\",\n \"score\": \"0.5574282\",\n \"text\": \"function exitHandler() {\\n\\tconsole.log(\\\"]\\\");\\n\\tconsole.error(`Processed Lines: ${state.outLines}`);\\n\\tprocess.exit();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48e1f9f8be5e4a6ead39d64d1888b873\",\n \"score\": \"0.5560298\",\n \"text\": \"async function main() {\\n // Spawn a child task that will error. Since we don't handle the child error,\\n // it will propagate as an unhandled, rejected promise and kill this task as\\n // well.\\n print(\\\"parent: spawning simple-exit-1.js\\\");\\n spawn(\\\"./simple-exit-1.js\\\");\\n\\n // Wait for the error to propagate.\\n while (true) {\\n await timeout(9999);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4b745d4893ad9cf9f567fb5d424e6e4\",\n \"score\": \"0.5560056\",\n \"text\": \"async function shutdown(e) {\\n\\n let err = e\\n console.log('Finalizando aplicação...')\\n\\n try {\\n\\n console.log('Encerrando módulo: Servidor Web...')\\n await webServer.close()\\n\\n } catch (e) {\\n\\n console.log('Erro ao encerrar Servidor Web', e)\\n err = err || e\\n }\\n\\n try {\\n\\n console.log('Encerrando módulo: Banco de dados...')\\n await database.close()\\n\\n } catch (e) {\\n\\n console.log('Erro encontrado', e)\\n err = err || e\\n }\\n\\n console.log('Saindo do processo')\\n\\n if (err) {\\n process.exit(1)\\n } else {\\n process.exit(0)\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18d508c87454a06f162ddd8ac121ffe7\",\n \"score\": \"0.5559835\",\n \"text\": \"function handlePrematureExit(code, signal) {\\n if (options.monitor) {\\n return reject(new Error(name + ' exited prematurely.'));\\n }\\n\\n // In case of error, we've really got an error\\n if (code > 0) {\\n return reject(new Error(name + ' exited with error code ' + code));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a24aced1e42a65b6ed993b777660917\",\n \"score\": \"0.5559229\",\n \"text\": \"function quit() {\\n console.log(\\\"bye!\\\");\\n console.log(\\\"Have a nice Day!\\\");\\n process.exit();\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":93,"cells":{"query_id":{"kind":"string","value":"1f006d25f488dab4d66b50184c5402dd"},"query":{"kind":"string","value":"MSG: rename in place"},"positive_passages":{"kind":"list like","value":[{"docid":"0b72352d2b1a06e75ffc04cb1ae5bdf5","score":"0.0","text":"function renameInPlace_4l(msger, logger) {\n return () => {\n msger.log(`${addTab()}... renamed files in place.`);\n };\n}","title":""}],"string":"[\n {\n \"docid\": \"0b72352d2b1a06e75ffc04cb1ae5bdf5\",\n \"score\": \"0.0\",\n \"text\": \"function renameInPlace_4l(msger, logger) {\\n return () => {\\n msger.log(`${addTab()}... renamed files in place.`);\\n };\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"4578810a4b67560ab5f5e7ee21f66996","score":"0.7102932","text":"rename(oldName, newName) {\n files.rename(files.pathJoin(this.cwd, oldName),\n files.pathJoin(this.cwd, newName));\n }","title":""},{"docid":"520abd173032cc53ce85a51b4bb5fea0","score":"0.70787907","text":"function rename(fso_name, is_file) {\r\n\t\t\tvar fso_key = is_file ? target_files[fso_name]\r\n\t\t\t\t\t: target_directories[fso_name];\r\n\t\t\tif (!fso_key || fso_name.includes(name)) {\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\tCeL.info(fso_name + '→' + name);\r\n\t\t\tvar error = CeL.fs_move(target_directory + fso_name,\r\n\t\t\t\t\ttarget_directory + CeL.to_file_name(name) + '.' + fso_name);\r\n\t\t\tif (error) {\r\n\t\t\t\tCeL.error(error);\r\n\t\t\t} else if (is_file) {\r\n\t\t\t\tdelete target_files[fso_name];\r\n\t\t\t} else {\r\n\t\t\t\tdelete target_directories[fso_name];\r\n\t\t\t}\r\n\t\t}","title":""},{"docid":"c10385755e16b854a48832c674d60415","score":"0.70648766","text":"function caml_sys_rename(o,n){\n var path = caml_make_path(o);\n var content = caml_fs_content(path);\n if(caml_sys_file_exists(n)){\n if(caml_sys_is_directory(n)) caml_raise_sys_error(n.toString() + \" : is a directory\");\n caml_sys_remove(n);\n }\n caml_fs_register(n, content);\n caml_sys_remove(o);\n return 0;\n}","title":""},{"docid":"bd3772a089e634138808903e8892ee96","score":"0.70324636","text":"function rename(old, newish, callback) {\n fs.rename(old.osFullPath, newish.osFullPath, function (err) {\n if (err) {\n callback(errors(err));\n } else {\n callback({\n \"Old Path\": old.uiPath,\n \"Old Name\": old.filename,\n \"New Path\": newish.uiPath,\n \"New Name\": newish.filename,\n \"Error\": \"\",\n \"Code\": 0\n });//callback\n }//if\n }); //fs.rename\n }//rename","title":""},{"docid":"c016cd758eca23503db1b712adf4cf4e","score":"0.70011467","text":"function rename(cwd, src, newName) {\n cwd.getFile(src, {}, function(fileEntry) {\n\tconsole.log(\"Renaming from \" + fileEntry.name + \" to \" + newName );\n fileEntry.moveTo(cwd, newName);\n }, errorHandler);\n}","title":""},{"docid":"f5429d23c1d56fbb8cfc7c75d4dcb130","score":"0.6935209","text":"function rename(record) {\n record.updateWith(function () {\n if (record.name === oldFull) record.name = newFull;\n if (record.PTRDName === oldFull) record.PTRDName = newFull;\n });\n }","title":""},{"docid":"a47fa1bdb5ea7fcce8224fcdb530152f","score":"0.662031","text":"function atualizaDia() {\n\n // Gerando carimbo de data e versão\n var nomeAntigo = SpreadsheetApp.getActiveSpreadsheet().getName();\n var nomeSemData = nomeAntigo.slice(11); // Fim da data é na posição 10\n var novoNome = \"[\" + hojeDia + \"] \" + nomeSemData;\n\n SpreadsheetApp.getActiveSpreadsheet().rename(novoNome);\n\n}","title":""},{"docid":"8f3b0c1c2810c52cb083962d1b296bae","score":"0.66114676","text":"changeChildsName(name, newName) {\n if (this.hasOwnProperty(name)) {\n this.newName = this.name;\n delete this.name;\n }\n }","title":""},{"docid":"a537ea4890e18033f93241e7c55274aa","score":"0.65974444","text":"function rename_file() {\n if (state.show_file_input_rename == false) {\n state.show_file_input_rename = true;\n render();\n } else {\n var file;\n var newname;\n \n if (state.mode == \"template\") {\n file = getSelectedTreeNode().id;\n newname = $('.add_input').val();\n }\n if (state.mode == \"logic\") {\n file = state.current_file;\n newname = $('.add_input').val();\n }\n \n // rename\n show_layer('rename_file');\n $.ajax({\n url: 'php/rename.php',\n type: 'post',\n dataType: 'json',\n data: {\n file: file,\n newname: newname\n },\n success: function(json) {\n state.show_file_input = false;\n state.show_file_input_rename = false;\n hide_layer('rename_file');\n if (state.mode == \"logic\")\n loadCurrentDir();\n if (state.mode == \"template\")\n $('#jstree_container').jstree().refresh();\n } \n });\n }\n}","title":""},{"docid":"6433b86cc0504af28ea0e5cea2879c69","score":"0.6586284","text":"function rename(obj) {\n\t\t myDiagram.startTransaction(\"rename\");\n\t\t var newName = prompt(\"Rename \" + obj.part.data.item + \" to:\");\n\t\t myDiagram.model.setDataProperty(obj.part.data, \"item\", newName);\n\t\t myDiagram.commitTransaction(\"rename\");\n\t\t}","title":""},{"docid":"c6820915d7f2c91a4cbca33f0c887403","score":"0.65593386","text":"function renameDotfile(files, metalsmith, done) {\n Object.keys(files)\n .filter((filename) => path.basename(filename).startsWith('_'))\n .forEach((filename) => {\n // eslint-disable-next-line\n files[`.${filename.substr(1)}`]= files[filename]\n // eslint-disable-next-line\n delete files[filename]\n })\n done()\n}","title":""},{"docid":"2908881c59b7448b21fe4f5ed085ee23","score":"0.65361583","text":"rename(oldPath, newPath, cb = nopCb) {\n const newCb = wrapCb(cb, 1);\n try {\n assertRoot(this.root).rename(normalizePath(oldPath), normalizePath(newPath), newCb);\n }\n catch (e) {\n newCb(e);\n }\n }","title":""},{"docid":"649216fd3d4eb88931542e96fca7f3ed","score":"0.65058625","text":"function OnRename( name ) {\n //Check up name.\n if( !isValidFileName( name ) ) {\n alert( \"Name contains invalid characters!\" );\n app.ShowTextDialog( \"Rename Program\", curFile, OnRename );\n return;\n };\n \n //Check if already exists.\n var newfile = APP_PATH + \"/\" + name;\n if( app.FileExists( newfile ) ) {\n app.Alert( \"File already exists!\" );\n } else {\n //Rename the .rs data file.\n var oldfile = APP_PATH + \"/\" + curFile;\n if( app.FileExists( oldfile ) ) app.RenameFile( oldfile, newfile );\n ShowFiles();\n };\n}","title":""},{"docid":"d9e8126e0c6486ed8ece2c1ac799b1b5","score":"0.64256346","text":"changeName(newName)\n {\n this.movieName_p= (newName);\n }","title":""},{"docid":"ea89ddb7e3ad47e0bd9f7b1bed30f49a","score":"0.6423163","text":"function rename(target, pattern, replc, counter, ph) {\n var min = counter * 1,\n max = target.length + min - 1;\n\n for (var i = 0, len = target.length; i < len; i++) {\n var newName = '',\n item = target[i];\n\n newName = pattern.replaceAll(ph.name, item.name);\n newName = newName.replaceAll(ph.numUp, fillZero(min + i, max.toString().length));\n newName = newName.replaceAll(ph.numDown, fillZero(max - i, max.toString().length));\n\n if (!isEmpty(replc)) {\n item.name = item.name.replaceAll(replc, newName);\n } else {\n item.name = newName;\n }\n }\n}","title":""},{"docid":"df6bc262fde862638629525438cba25b","score":"0.64220655","text":"function _rename(){\n self._visitingAlter = true;\n var table = self._queryNode.table;\n var result = ['EXEC sp_rename '+self.visit(table.toNode())+', '+self.visit(alter.nodes[0].nodes[0])];\n self._visitingAlter = false;\n return result;\n }","title":""},{"docid":"52d05158b0670fcc33c5fbea11e2fc22","score":"0.6390915","text":"setName (newName, cb) {\n\t\tif (tools.notType(newName, 'string')) {\n\t\t\treturn;\n\t\t}\n\t\tvar d = this.directory;\n\t\tvar newPath = d === '' ? newName : `${d}/${newName}`;\n\t\tthis.setPath(newPath, cb);\n\t}","title":""},{"docid":"5e61c2457037a41c440efb056b11d981","score":"0.63420784","text":"function rename (fullPathname, filename, prefix) {\n\n // get path without filename\n let pathWithoutFile = fullPathname.replace(filename,'')\n console.log('path without filename: ',pathWithoutFile)\n\n // rename file and save it\n fs.rename(`${fullPathname}`,`${pathWithoutFile}${prefix} - ${filename}`, function(err) {\n if ( err ) console.log('ERROR: ' + err);\n })\n\n}","title":""},{"docid":"7b051155f3ac40f7be8b290afab25320","score":"0.63261753","text":"rename() {\n return this._listing.rename();\n }","title":""},{"docid":"28f8877931c952692086ba86e8b1c3fa","score":"0.632556","text":"setName(newName) {\n\t\tthis.name = newName\n\t}","title":""},{"docid":"f047c67d1e20cbc8d700bfa86c7830d0","score":"0.62924975","text":"function renameFiles(files)\n{\n files.forEach(function (file)\n {\n debug('renameFiles', 'processing', file);\n var originalName = path.basename(file);\n var newFileName = originalName.toLowerCase();\n var directory = path.dirname(file);\n if (originalName != newFileName)\n {\n fs.renameSync(file, directory + \"/\" + newFileName); //, function(err)\n debug('renameFiles', 'renamed', originalName, '-->', newFileName);\n\n originalFiles.push(originalName);\n renamedFiles.push(newFileName);\n }\n });\n}","title":""},{"docid":"d627f6b80b1d4803ee7fc9e2f07d9542","score":"0.62733024","text":"function getNewName() \n{ \n var ext, docName, newName, saveInFile, docName; \n docName = sourceDoc.name; \n ext = '.ai'; // new extension for AI file \n newName = \"\"; \n \n for ( var i = 0 ; docName[i] != \".\" ; i++ ) \n { \n newName += docName[i]; \n } \n newName += ext; // full AI name of the file \n \n // Create a file object to save the ai file \n saveInFile = new File( destFolder + '/' + newName ); \n \n \n return saveInFile; \n}","title":""},{"docid":"73038d6c0592c50c4fc156bffd56e3fe","score":"0.62532413","text":"function renameFile(fileId, newTitle,callback) {\n\tvar successMessage = \"Rename complete.\";\n\tvar failMessage = \"Sorry, rename incomplete.\";\n\tvar body = {'title': newTitle};\n\tvar request = gapi.client.drive.files.patch({\n\t\t'fileId': fileId,\n\t\t'resource': body\n\t});\n\trequest.execute(function(resp) {\n\t\tif (!resp.error){\n\t\t\tconsole.log(\"Rename fileId:{0} to {1}\".f(fileId,newTitle));\n\t\t\tcallback && callback(successMessage,true);\n\t\t}else{\n\t\t\tcallback && callback(failMessage,false);\n\t\t}\n\t});\n}","title":""},{"docid":"9ba7e76a81922996ccc7aa9bb8acb73f","score":"0.6248389","text":"async rename(fromFile, toFile, retryCount = 0) {\n try {\n await opfs.rename(fromFile, toFile);\n } catch (err) {\n if (err.code !== \"EPERM\" || retryCount >= 5) {\n throw err;\n }\n await xaa.delay(50);\n await this.rename(fromFile, toFile, retryCount + 1);\n }\n }","title":""},{"docid":"9f6419d283a949b16a0f907e99f7591a","score":"0.6230031","text":"function renameBlurred(self) {\n\tif (removed) return; // because removing a node fires this again\n\tremoved = true;\n\tvar new_name = self.value;\n\tvar dv = document.createElement(\"div\");\n\tdv.innerHTML = new_name;\n\tself.parentNode.replaceChild(dv, self);\n\tdv.addEventListener(\"click\", function() {\n\t handleLocationClick(this, new_name);\n\t}); \n\tnavPub.publish(new ROSLIB.Message({\n\t\t\tcommand: \"name-location\",\n\t\t\tparam: new_name\n\t}));\n }","title":""},{"docid":"8c91dcdadb83c892baf08c8185e92e36","score":"0.62100357","text":"visitRename_object(ctx) {\n\t return this.visitChildren(ctx);\n\t}","title":""},{"docid":"978c46fde16897ea322bf5d380611b4b","score":"0.6201645","text":"editName(newName) {\n // Don't do anything if name didn't actually change\n if (newName !== this.state.folder.name) {\n this.setState({ loading: true });\n\n this.linksRef.update({\n name: newName\n })\n .catch((error) => {\n console.log(error);\n this.setState({ error: error.message });\n })\n .then(() => {\n this.setState({ loading: false });\n });\n }\n }","title":""},{"docid":"6a81d4a5e678eebeda4201e22e07119a","score":"0.6173433","text":"function getNewName() \n{ \n var ext, docName, newName, saveInFile, docName; \n docName = sourceDoc.name; \n ext = '.png'; // new extension for PNG \n newName = \"\"; \n \n for ( var i = 0 ; docName[i] != \".\" ; i++ ) \n { \n newName += docName[i]; \n } \n newName += ext; // full name of the new file including the png extension \n \n // create the new file with the corrected extension \n saveInFile = new File( destFolder + '/' + newName ); \n \n return saveInFile; \n}","title":""},{"docid":"019cac62f3f4721e53e0b4e9771e1ae4","score":"0.61710244","text":"function renameElement() {\n var id = $(this).parent().attr(\"data-id\");\n var item = fileSystem.findElementById(id);\n var editedItemName = prompt(\"Please enter the new name\", item.name);\n if (editedItemName == undefined) {\n return;\n }\n try {\n fileSystem.renameElement(id, editedItemName);\n } catch (err) {\n alert(err.message);\n }\n updateUI();\n }","title":""},{"docid":"b864fe90fef9c97d1d61e661becf0595","score":"0.6167889","text":"function renameIndividualFile(loopInfo, files, pp, callback, $index) {\n if (loopInfo.error === false) {\n var oldfilename = paths.join(__appRoot, files[$index].path),\n // new files comes with a directory, replaced files with a filename. I think there is a better way to handle this\n // but this works as a starting point\n newfilename = paths.join(\n pp.osFullDirectory,\n pp.isDirectory ? pp.relativePath : \"\",\n pp.isDirectory ? files[$index].originalname : pp.filename\n ); //not sure if this is the best way to handle this or not\n\n fs.rename(oldfilename, newfilename, function (err) {\n if (err) {\n loopInfo.error = true;\n console.log(\"savefiles error -> \", err);\n callback(errors(err));\n } else if ($index + 1 >= loopInfo.total) {\n callback({\n \"Path\": pp.relativePath,\n \"Name\": pp.filename,\n \"Error\": \"\",\n \"Code\": 0\n });//callback\n }//if\n });//fs.rename\n }//if not loop error\n }//renameIndividualFile","title":""},{"docid":"83481116242ba35ea040bef6ba7c3939","score":"0.616185","text":"switchName() {\n\t\tif (this[_nextName] !== undefined) {\n\t\t\tthis[_name] = this[_nextName];\n\t\t\tdelete this[_nextName];\n\t\t}\n\t}","title":""},{"docid":"25d55cc0cfa59f73cc70f5cd72d65126","score":"0.6126403","text":"function moveImage(from, to, callback) {\n fs.rename(from, to, function(error) {\n \tif(error) {\n \t\tconsole.log('Error while moving image');\n \t}\n \tcallback(null);\n }); \n}","title":""},{"docid":"822085a361bf83cf4d7611604d0f7178","score":"0.6124616","text":"function stopRenaming() {\n\t\t\tvar new_value = $.trim(textbox.getValue()),\n\t\t\t\told_value = $caption.text();\n\n\t\t\tcancelRenaming();\n\n\t\t\tif (new_value !== old_value) {\n\t\t\t\t//Set new value\n\t\t\t\tsetValue(new_value);\n\n\t\t\t\t$el.trigger('rn:rename:stop', [_self, new_value, old_value]);\n\t\t\t}\n\t\t}","title":""},{"docid":"093ec09db54df308790fdb7ea72a7fd4","score":"0.6116899","text":"function renameFile(files) {\n files.forEach(file => {\n file.name = file.name.replace(/^_/, '.').replace(/\\.ejs$/, '');\n });\n}","title":""},{"docid":"093ec09db54df308790fdb7ea72a7fd4","score":"0.6116899","text":"function renameFile(files) {\n files.forEach(file => {\n file.name = file.name.replace(/^_/, '.').replace(/\\.ejs$/, '');\n });\n}","title":""},{"docid":"2ee004e76f97795b46a2b425048eec50","score":"0.6107928","text":"addUpdatedProjectName(workspaceId, projectName, newProjectName) {\n this.httpBackend.when('POST', '/api/ext/project/' + workspaceId + '/rename/' + projectName + '?name=' + newProjectName).respond(newProjectName);\n }","title":""},{"docid":"9971838716d9321db8bfea5b80b9fb4d","score":"0.6072208","text":"function getNewName()\n{\n\tvar ext, docName, newName, saveInFile, docName;\n\tdocName = sourceDoc.name;\n\text = '.ai'; // new extension for pdf file\n\tnewName = \"\";\n\t\t\n\tfor ( var i = 0 ; docName[i] != \".\" ; i++ )\n\t{\n\t\tnewName += docName[i];\n\t}\n\tnewName += ext; // full pdf name of the file\n\t\n\t// Create a file object to save the pdf\n\tsaveInFile = new File( destFolder + '/' + newName );\n\t\n\n\treturn saveInFile;\n}","title":""},{"docid":"4fc650861fea33a99d5058abb3802973","score":"0.6065935","text":"renamePlayer(oldName, newName)\n\t{\n\t\tlet card = this._cards.find( (card) => card.name == oldName);\n\t\tif (card)\n\t\t{\n\t\t\tcard.name = newName;\n\t\t}\n\t}","title":""},{"docid":"11f41083f99aa64389a51c11a9432427","score":"0.60617375","text":"_renameChunk(x, y, x1, y1) {\n const key = `${x},${y}.dat`;\n const newKey = `${x1},${y1}.dat`;\n\n const chunkPath = path.resolve(this.dataPath, key);\n const newChunkPath = path.resolve(this.dataPath, newKey);\n\n if (fs.existsSync(chunkPath)) {\n fs.renameSync(chunkPath, newChunkPath);\n }\n }","title":""},{"docid":"7bffc3bf0e2ee5be2ba4dc1506a18af8","score":"0.6050948","text":"function __generateOriginalName(name) {\n\t return 'original:' + name;\n\t}","title":""},{"docid":"3827cb2fbe6f40d1e872e445780fd287","score":"0.60435426","text":"function renameFile(manager, oldPath, newPath) {\n return manager.rename(oldPath, newPath).catch(function (error) {\n if (error.message.indexOf('409') === -1) {\n throw error;\n }\n return shouldOverwrite(newPath).then(function (value) {\n if (value) {\n return manager.overwrite(oldPath, newPath);\n }\n return Promise.reject('File not renamed');\n });\n });\n}","title":""},{"docid":"0a28f0a3bc7c23727e426e4c81c989d9","score":"0.60377324","text":"function jchtml5_rename_title(argument0){\n\tdocument.title = argument0;\n}","title":""},{"docid":"0a28f0a3bc7c23727e426e4c81c989d9","score":"0.60377324","text":"function jchtml5_rename_title(argument0){\n\tdocument.title = argument0;\n}","title":""},{"docid":"b051bb18c78f2e49841aa66ed1a1f4c9","score":"0.60355496","text":"function renameTabConfirm(p_tab, p_name) {\n\n\tp_tab.tag.tab_title_span.innerHTML=p_name;\n\n}","title":""},{"docid":"51408ef5a8960adaad922f3c187a938f","score":"0.6034114","text":"function rename(obj) {\n return rename_(function(parsedPath) {\n return {\n extname: obj.extname || parsedPath.extname,\n dirname: (obj.dirnamePrefix || '') + parsedPath.dirname,\n basename: parsedPath.basename\n };\n });\n}","title":""},{"docid":"04beee51e680cedeefcb701359a8309c","score":"0.6033415","text":"renameTempUpload(pkfp, tempName, name){\n return new Promise((resolve, reject)=>{\n let self = this;\n let fPath = this.getPath(pkfp, \"files\");\n let oldName = path.join(fPath , tempName);\n let newName = path.join(fPath , name);\n let maxAttempts = 4;\n let timeout = 1000;\n let attempted = 0;\n\n function renameAttempt(){\n Logger.debug(`File exists. Renaming. Attempt: ${attempted}`, {cat: \"files\"});\n fs.rename(oldName, newName, (err)=>{\n if (err){\n if ((/BSY/i.test(err.code) || /BUSY/i.test(err.code)) && attempted < maxAttempts){\n Logger.warn(`Error renameing file: file is busy. Attempt: ${attempted}`, {cat: \"files\"})\n attempted++;\n setTimeout(renameAttempt, timeout);\n }else {\n Logger.error(\"Error renaming file: \" + err, {cat: \"files\"})\n console.log(\"ERROR renaming file: \" + err);\n reject(new Error(\"renameTempUpload error: \" + err));\n }\n } else {\n //success\n console.log(\"Renamed. Resolving...\")\n resolve();\n }\n\n });\n }\n renameAttempt();\n })\n }","title":""},{"docid":"b19a062f018df240251363d5c12d2426","score":"0.6029428","text":"function FileManagerRename(node)\r\n{\r\n var parent = $(node).parents(\"li:eq(0)\").get(0);\r\n var parentpath = $(parent).attr('fsdata');\r\n var title = $(node).children(\"a:visible\").text();\r\n \r\n $.post('/Admin/FileManager/CreateFolder', {name: title, path: parentpath}, function(folderPath){\r\n $(node).attr('fsdata', folderPath);\r\n $(node).attr('id', folderPath);\r\n var arr = folderPath.split('/');\r\n $(node).children(\"a:visible\").html(arr[arr.length-1]);\r\n });\r\n}","title":""},{"docid":"5d4d1f35f4caec38785b349034457088","score":"0.60146534","text":"renameItem(data, callback) {\n return this.db.run(\n `UPDATE tree SET name = ? WHERE name = ? AND parent = ?`,\n data, \n err => {\n callback(err);\n })\n }","title":""},{"docid":"144c9691abf2e0e609a2e7f5c0ad023b","score":"0.6003658","text":"function renameFileEventFn(type, oldFilename, newFilename, callback) {\n return function(err) {\n if(!err) {\n self.trigger(type, [oldFilename, newFilename]);\n }\n callback(err);\n };\n }","title":""},{"docid":"58ff911acc2b7ec78c4dcbea3f3572c9","score":"0.599823","text":"function mvFileKeepTimeStamp(from,to)\n{\n\tvar date = fs.statSync(from).mtime\n\tfs.renameSync(from, to);\n\tfs.open(to, (err,fd)=>{\n\t\tfs.futimesSync(fd, date, date);\n\t})\n\t\n}","title":""},{"docid":"3596180f1e8f2631b7fded3255fb8cf0","score":"0.5990751","text":"function main(file, dir2) {\n //gets file name and adds it to dir2\n var f = path.basename(file);\n var dest = path.resolve(dir2, f);\n\n fs.renameSync(file, dest);\n}","title":""},{"docid":"319c7748f17637d509ef4c8a151c9877","score":"0.5989605","text":"function rename_animation(animation,name)\n{\n /*fixes the name in the animation menu entry*/\n for(child of animation.target.animation_selection_menu.children)\n {\n if(child.animationtselect == animation) child.innerHTML = \"<a>\" + name + \"</a>\";\n }\n /*Setting new name of the animation*/\n animation.name = name;\n}","title":""},{"docid":"3424f7579f16f8f3c142a1b5ba51ebce","score":"0.5981969","text":"async renameItem(id) {\n try {\n const res = await this.endPoint.put(`/item/rename/${id}`)\n return res.data\n } catch (err) {\n throw new Error(err)\n }\n }","title":""},{"docid":"1c963b4a0366e16d6db7900dd090ec9b","score":"0.5979677","text":"function handleChange(newName) {\n setName(newName);\n }","title":""},{"docid":"b25c58881f9a0512658df1a1f1273226","score":"0.59724563","text":"function causeRenameHandler(data) {\n var oldNode = fd.graph.getNode(data.causeId);\n oldNode.title = data.newName;\n var node = $('#' + data.causeId);\n var children = node.children();\n // Here .html is used instead of .text, as CauseRenameEvent escapes HTML\n node.html(data.newName);\n node.append(children);\n}","title":""},{"docid":"cf3a1a70b682fc57209a7fbd125077a7","score":"0.59700704","text":"function rename(oldPath, newPath) {\n return fs.promises.rename(oldPath, newPath);\n}","title":""},{"docid":"f2001bcc93e2175abf8df189feaffc79","score":"0.59680504","text":"function renameFolder(folder, newName) {\n var current = [], future = [], modify = false;\n var title = $('.upper-title');\n title.empty();\n // Check the new name\n if (newName.length == 0 || g_folders[newName] != undefined) {\n title.append(folder.name);\n showFolderError('The folder <b>' + newName + '</b> already exists!');\n } else {\n title.append(newName);\n delete g_folders[folder.name];\n g_folders[newName] = folder;\n if (folder.name == g_homeFolderName) {\n // Remember the new home name\n Windows.Storage.ApplicationData.current.localSettings.values['home'] = newName;\n folder.name = newName;\n } else {\n // Modify the path of files\n folder.name = newName;\n current.push(folder);\n while (current.length > 0) {\n current.forEach(function (c) {\n future = future.concat(c.folders);\n c.files.forEach(function (f) {\n modify = true;\n setPath(c, f);\n });\n });\n current = future.slice(0);\n future = [];\n }\n }\n }\n if (modify) {\n uploadMetadata();\n }\n}","title":""},{"docid":"d2082e6a240bad9505011feb2a4f0d59","score":"0.5967815","text":"function rename(obj, newNames) {\n return _.reduce(\n newNames,\n (o, newKey, oldKey) => {\n if (_.has(obj, oldKey)) {\n o[newKey] = obj[oldKey]; // eslint-disable-line\n } else {\n o[newKey] = null; // eslint-disable-line\n }\n return o;\n },\n _.omit.apply(null, construct(obj, _.keys(newNames)))\n );\n}","title":""},{"docid":"d25fa3288fd19228d11d1699f5cda8ec","score":"0.59675545","text":"function actionRenameTag(e) {\n handleEventCancel(e, 'actionRenameTag');\n if (canTakeAction('actionRenameTag()') === false) {\n return;\n }\n genericModal($dlg.renameTag);\n }","title":""},{"docid":"bccb5f4f60672c752a3f2f071bf76437","score":"0.5960196","text":"changeName(newName) {\n this.name = newName;\n updateTeam(this._id, \"name\", this.name);\n }","title":""},{"docid":"f3391a0eb26e1ef9dbe68dcf44c2ce10","score":"0.5942692","text":"function changeIosBundleName(projectDir, projectName,options){\n if(!options.ios){\n return\n }\n var oldPacakgeName = 'org.reactjs.native.example.'\n var replacements = {}\n replacements[oldPacakgeName] = options.ios + '.'\n util.copyProjectTemplateAndReplace(projectDir+'/ios', projectDir+'/ios1', replacements )\n util.deleteDir(projectDir+'/ios')\n fs.renameSync(projectDir+'/ios1',projectDir+'/ios')\n }","title":""},{"docid":"3b5cdd43326f0873e20ed68047d74eee","score":"0.59242576","text":"function changeName(username) {\n return username = \"semper-ry\"\n}","title":""},{"docid":"1dad2a5febb2ef42ff0f72c8da1d04e3","score":"0.59083545","text":"onRename(user, oldUserid, isJoining, isForceRenamed) {\n\t\tif (!this.allowRenames || (!user.named && !isForceRenamed)) {\n\t\t\tif (!(user.userid in this.players)) {\n\t\t\t\tuser.games.delete(this.id);\n\t\t\t\tuser.updateSearch();\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tif (!(oldUserid in this.players)) return;\n\t\tthis.renamePlayer(user, oldUserid);\n\t\tif (this.childGame && this.childGame.onRename) this.childGame.onRename(user, oldUserid, isJoining, isForceRenamed);\n\t}","title":""},{"docid":"0981f74666ab73272a2f84e276df12a1","score":"0.5904401","text":"static renameTask(e) {\n if (e.key !== 'Enter') return\n\n const projectName = document.getElementById('project-name').textContent\n const taskName = this.previousElementSibling.textContent\n const newTaskName = this.value\n\n if (newTaskName === '') {\n alert(\"Task name can't be empty\")\n return\n }\n\n if (Storage.getTodoList().getProject(projectName).contains(newTaskName)) {\n this.value = ''\n alert('Task names must be different')\n return\n }\n\n if (projectName === 'Today' || projectName === 'This week') {\n const mainProjectName = taskName.split('(')[1].split(')')[0]\n const mainTaskName = taskName.split(' ')[0]\n Storage.renameTask(\n projectName,\n taskName,\n `${newTaskName} (${mainProjectName})`\n )\n Storage.renameTask(mainProjectName, mainTaskName, newTaskName)\n } else {\n Storage.renameTask(projectName, taskName, newTaskName)\n }\n UI.clearTasks()\n UI.loadTasks(projectName)\n UI.closeRenameInput(this.parentNode.parentNode)\n }","title":""},{"docid":"832af32d2b6b4363f0c666c64f356af7","score":"0.5898459","text":"function update_file_name(name) {\r\n\tparent.document.file.identifier.value = document.blosxom.plugin_blosxom_pwd.value + name;\r\n\tdocument.blosxom.entry.value = name;\r\n\tparent.document.file.filename.value = name;\r\n}","title":""},{"docid":"7884419498233fcb55dbbe001dc678ea","score":"0.58860093","text":"function renameNextFolder() {\n const oldPath = `./out/${oldName}`;\n const newPath = `./out/${newName}`;\n\n fs.rename(oldPath, newPath, function (error) {\n if (error) {\n console.error(error);\n } else {\n console.log(`'${oldName}' folder successfully renamed to '${newName}'`);\n }\n });\n}","title":""},{"docid":"81d8dd64e71b7346a34f202af5097916","score":"0.5885106","text":"function UpdateFileName(id, sNewFileName) {\n\tvar aPath = sNewFileName.split('\\\\')\n\tvar sNewFileName = aPath[aPath.length - 1]\n\n\t$('#' + id).val(sNewFileName)\n\t$('#' + id).trigger('validate')\n\t$('#name_' + id).text(sNewFileName)\n\treturn true\n}","title":""},{"docid":"bdd15b524eb1281cb4d150de45937c45","score":"0.5885023","text":"function getNewName()\r{\r\tvar ext, docName, newName, saveInFile, docName;\r\tdocName = sourceDoc.name;\r\text = '_AB_nobleed_HR.pdf'; // new extension for pdf file\r\tnewName = \"\";\r\t\t\r\tfor ( var i = 0 ; docName[i] != \".\" ; i++ )\r\t{\r\t\tnewName += docName[i];\r\t}\r\tnewName += ext; // full pdf name of the file\r\t\r\t// Create a file object to save the pdf\r\tsaveInFile = new File( folderPDF + '/' + newName );\r\t\r\r\treturn saveInFile;\r}","title":""},{"docid":"f81522c06968764e46a63298db923164","score":"0.58847314","text":"newFilename() {\n if (this.prevFilename !== this.currentFilename) {\n // Only do that after new file created\n this.prevFilename = this.currentFilename\n this.deleteOldFiles()\n }\n return super.newFilename()\n }","title":""},{"docid":"f5b92da6d4b7a81f538226b70a15c38a","score":"0.58809453","text":"async renameFile(options){\n // Options can be either of these:\n // 1. old path & new path.\n // 2. name, ext, folder & new path.\n // 3. name, ext, folder & new name.\n\n // Options not allowed: old path & new name.\n\n const self = this;\n const fsn = await this.getFileSchemaNameFromFH();\n const validateConfig = await ObjectValidator.validate({ object: options, against: \"Func_RenameFile\", });\n if(validateConfig.success){\n let pathToFile = validateConfig.object.path ? validateConfig.object.path : (\n validateConfig.object.name && validateConfig.object.ext && validateConfig.object.folder !== null ? `${validateConfig.object.folder}${validateConfig.object.folder === \"\" ? \"\" : \"/\"}${validateConfig.object.name}.${validateConfig.object.ext}` : null\n );\n\n let newPath = validateConfig.object.newPath ? validateConfig.object.newPath : (\n validateConfig.object.newName && validateConfig.object.ext && validateConfig.object.folder !== null ? `${validateConfig.object.folder}${validateConfig.object.folder === \"\" ? \"\" : \"/\"}${validateConfig.object.newName}.${validateConfig.object.ext}` : null\n );\n\n if(pathToFile == null || newPath == null){\n return false;\n }\n\n pathToFile = await this.beautifyPath(pathToFile, true);\n newPath = await this.beautifyPath(newPath, true);\n\n let response = await this.renameS3File(pathToFile, newPath);\n if(response){ Logger.log(`${fsn} renamed`); return true; }\n\n Logger.log(`${fsn} renaming failed`);\n }else{ Logger.log(`${fsn} renaming failed`); }\n\n return false;\n }","title":""},{"docid":"93701bf1857c7fff2e2d38e57eed5556","score":"0.58745474","text":"function cancelRenaming() {\n\t\t\tif (textbox) {\n\t\t\t\ttextbox.destroy();\n\t\t\t\ttextbox.remove();\n\t\t\t}\n\n\t\t\t$caption.show();\n\n\t\t\tdestroyCloseListLayer();\n\n\t\t\t$el.trigger('rn:rename:cancel', [_self]);\n\t\t}","title":""},{"docid":"6fd3c5317ddbd4bca108d583db7807bd","score":"0.5867363","text":"updateName(name) {\n\t\tthis[_nextName] = name;\n\t}","title":""},{"docid":"2e441907eb9e8808f70fc15762caf613","score":"0.5859029","text":"set name(newName){\n if(newName.length < 3){\n this._name = 'Name Error: Length must be at least 3 characters';\n } else {\n this._name = newName;\n }\n }","title":""},{"docid":"f89a31391ec397cbd76667ba2f2540da","score":"0.5858593","text":"function Rename(id, name, ctx) {\n return {\n id: id,\n name: name,\n context: ctx\n };\n }","title":""},{"docid":"9bd18c4d63dde197a9d441de713be3c2","score":"0.58584386","text":"function renameOld({name, type, culture: cultureId}) {\n if (type !== \"Folk\") return name;\n\n const haveOrganized =\n namedReligions.some(\n ({type, culture, expansion}) => culture === cultureId && type === \"Organized\" && expansion === \"culture\"\n ) ||\n lockedReligions.some(\n ({type, culture, expansion}) => culture === cultureId && type === \"Organized\" && expansion === \"culture\"\n );\n if (haveOrganized && name.slice(0, 3) !== \"Old\") return `Old ${name}`;\n return name;\n }","title":""},{"docid":"45f793a91dd909f335be70b487d03abd","score":"0.585084","text":"static async renameWorkspace(trace, newName, oldName) {\n log(trace, `Renaming workspace \"${oldName}\" to \"${newName}\"`);\n // Renaming to the same name should be a noop.\n if (newName === oldName)\n return Promise.resolve(newName);\n const aws = await WorkspaceManager.getActiveWorkspace(trace);\n const targetingActiveWorkspace = oldName === aws.name;\n const ws = await WorkspaceManager.getWorkspace(trace, oldName);\n const finalName = await WorkspaceManager.addWorkspace(trace, Object.assign({}, ws, { name: newName }));\n log(trace, `Final name of rename: ${finalName}`);\n const states = await WorkspaceManager._WS.getManyCompleteStates(ws.windows, oldName);\n log(trace, \"Window states\", states);\n await WorkspaceManager._WS.setManyCompleteStates(states, finalName);\n if (targetingActiveWorkspace) {\n const aStates = await WorkspaceManager._WS.getManyCompleteStates(aws.windows);\n await WorkspaceManager.setActiveWorkspace(trace, finalName);\n await WorkspaceManager._WS.setManyCompleteStates(aStates);\n await WorkspaceManager.updateActiveWorkspace(trace, aws => {\n return Object.assign({}, aws, { name: finalName });\n });\n }\n await WorkspaceManager.removeWorkspace(trace, oldName);\n return finalName;\n }","title":""},{"docid":"a09292d04813a50e46a97c8d626fbd72","score":"0.5842135","text":"function rename(d){\n if (d.key){\n d['name']=d.key;\n delete d.key;\n } else {\n lastchild = d[lastchild_I];\n for(var key in d){delete d[key];}; //remove all object properties\n //needed for proper rendering of data for d3 layouts\n d['name']=lastchild;\n };\n if (d.values){\n d['children'] = d.values;\n d['children'].forEach(rename);\n delete d.values;\n };\n }","title":""},{"docid":"d80fbbae8cac89a6ba0f14b57a3ccf55","score":"0.58348936","text":"function add_new_name ( obj, name ) {\n if ( obj.canonical_name !== undefined ) {\n if ( obj.canonical_name > name ) {\n add_secondary_name ( obj, obj.canonical_name );\n obj.canonical_name = name;\n }\n else {\n add_secondary_name ( obj, name );\n }\n }\n else {\n obj.canonical_name = name;\n }\n }","title":""},{"docid":"efdd5a71bc83f447f4195508512a74c6","score":"0.58277303","text":"renameTable(tableName, to) {\n this.pushQuery(`rename table ${this.formatter.wrap(tableName)} to ${this.formatter.wrap(to)}`);\n }","title":""},{"docid":"dc1b21a711ab560e686533a28553f5e6","score":"0.5826938","text":"function rename(res){\n fs.rename(saveDir + '.zip', saveDir + 'screenshots.zip', function (err) {\n if (err){\n console.log('Error renaming blank zip folder:');\n console.log(err);\n throw err;\n } \n console.log('Saved as ' + saveDir + 'screenshots.zip');\n // Send the response (zip file) back\n res.download(saveDir + 'screenshots.zip');\n setTimeout(function(){ removeFolder(); }, 30 * 1000);\n });\n }","title":""},{"docid":"f941f066b72901a8f60d727f9ba22ebb","score":"0.581719","text":"renameTable(from, to) {\n this.pushQuery(\n `alter table ${this.formatter.wrap(from)} rename to ${this.formatter.wrap(\n to\n )}`\n );\n }","title":""},{"docid":"fbe018716937792fde74cfb16fb3da93","score":"0.5814857","text":"function emitRenameReq(){\n var id = \"#cmInputRename\";\n action = \"rename\";\n\n if (!isDriver || cmActionLocks[action] || !cmNameValidation(id)) return;\n\n cmActionLocks[action] = true; // lock the action\n socket.emit('context_menu_clicked',\n {\n key: action,\n relPath: cmRelPath,\n user: username,\n room: roomname,\n name: $(id).val(),\n text: editor.getSession().getValue(),\n activePath: getActiveFolderPath()\n });\n}","title":""},{"docid":"cd64650459e94bc6191630978859de17","score":"0.5808675","text":"function updateExportNames() {\n $(\"modelValuesTable\").select('.modelName').each(\n function(ctrl) {\n var modelId = ctrl.readAttribute('model_id');\n var modelOrder = ctrl.readAttribute('model_order');\n }\n );\n\n if (!this.editor) { return; }\n var oldName = this.editor.undoText;\n var newName = this.editor.originalText;\n\n $A($(\"export_model_select\").options).each(function(option) {\n if (option.innerHTML == oldName) { option.innerHTML = newName; }\n }); \n}","title":""},{"docid":"7d7f486b37f02f26b6f4692cca9f6eee","score":"0.579444","text":"function tryRename(p1, p2) {\n try {\n fs.linkSync(p1, p2);\n } catch(e) {\n if (e.code === \"EEXIST\") {\n return false;\n } else {\n throw e;\n }\n }\n fs.unlinkSync(p1);\n return true;\n }","title":""},{"docid":"179650f00fc640f747684dadf4e5ed71","score":"0.5784263","text":"renameChat(dialogId, newName) {\n\t return babelHelpers.classPrivateFieldLooseBase(this, _renameService)[_renameService].renameChat(dialogId, newName);\n\t }","title":""},{"docid":"6f2b3ebc4b79480b5870a98f14f423a3","score":"0.5776471","text":"function move({ oldPath, newPath }, callback) {\n fs.rename(oldPath, newPath, function (err) {\n if (err) {\n if (err.code === 'EXDEV') {\n copy();\n } else {\n callback(err);\n }\n return;\n }\n callback();\n });\n\n function copy() {\n var readStream = fs.createReadStream(oldPath);\n var writeStream = fs.createWriteStream(newPath);\n\n readStream.on('error', callback);\n writeStream.on('error', callback);\n\n readStream.on('close', function () {\n fs.unlink(oldPath, callback);\n });\n\n readStream.pipe(writeStream);\n }\n}","title":""},{"docid":"158fc4fd107a7a05ab21595e4828cfa5","score":"0.5771346","text":"function dlRenameStart(){\n\t\n\trunning_action = 'dlRename'; // @todo unify\n\trename_dir_running = true;\n\t\n\t$li = $('#dirlist li.active');\n\t\t\n\tvar old_name = $li.attr('id').idToPath().filename();\n\n\t$li\n\t\t.addClass('in-action')\n\t\t.addClass('in-action-rename')\n\t\t.data('old_name', old_name)\n\t\t.find('> span').hide().end()\n\t\t.prepend('<input type=\"text\" class=\"new_name\" value=\"'+ old_name +'\" />')\n\t\t.find('input.new_name').select();\n\n}","title":""},{"docid":"9475fb3e5c1378227d5d58da8f223b19","score":"0.5756462","text":"function updateDbEntryAndMove(sFileNameOld, sFileNameNew, fCallback) {\n\t// update database entry\n\tvar sSql = esc(\"UPDATE datasets SET file_name = %Q WHERE file_name = %Q;\",\n\tsFileNameNew, sFileNameOld);\n\t\t\n\tpostgres.query(sSql, function(oErr, oResult) {\n\t\tif(oErr) {fCallback(oErr);}\n\t\t\t\n\t\t// move old file to the archive\n\t\tfs.rename(\n\t\t\tpath.join(config.app.dataset_root_path, sFileNameOld),\n\t\t\tpath.join(config.app.dataset_root_path, \"A\", sFileNameOld),\n\t\tfunction(oErr) {\n\t\t\tif(oErr) {fCalllback(oErr);}\n\t\t\tfCallback();\n\t\t});\n\t});\n}","title":""},{"docid":"316cd0ca881732450200def7f26ceac7","score":"0.57448095","text":"async changeName(route, newName, oldName) {\n const result = await axios.post(getRoute(\"changename\"), {\n route: route,\n oldName: oldName,\n newName: newName,\n });\n return result.data;\n }","title":""},{"docid":"6957b046e2c200febb8bd0ec46b7a956","score":"0.57290727","text":"function startRenaming() {\n\t\t\tvar offset = $el.offset(),\n\t\t\t\twidth = $el.width();\n\t\t\tvar special_class_name = $caption.data('js_rename_class') || '';\n\n\n\t\t\tcreateCloseListLayer();\n\n\t\t\ttextbox = $('<input type=\"text\" class=\"rename_component_input ' + special_class_name + '\" />').appendTo('body');\n\t\t\ttextbox.textbox({\n\t\t\t\ttype : 'text', value : 0, min : 3, max : 20, template : 'internal', live : true\n\t\t\t}).focus()\n\t\t\t.on('txt:key:enter', function() {\n\t\t\t\tstopRenaming();\n\t\t\t}).on('txt:key:esc', function() {\n\t\t\t\tcancelRenaming();\n\t\t\t});\n\n\t\t\ttextbox.css({left : offset.left, top : offset.top, width : width}).val(settings.text);\n\n\t\t\t$caption.hide();\n\n\t\t\t$el.addClass('renaming_started');\n\n\t\t\t$el.trigger('rn:rename:start', [_self]);\n\t\t}","title":""},{"docid":"f2ff5bde1cd1884af158765c1f8a22f3","score":"0.5719862","text":"function renameTable(tblData, tblName, newTblName, db, overwrite) {\n if (overwrite) {\n dropTable(tblData, newTblName, db);\n }\n tblData[newTblName] = tblData[tblName];\n delete tblData[tblName];\n executeSimpleSQL(db, \"ALTER TABLE \" + tblName +\n \" RENAME TO \" + newTblName);\n}","title":""},{"docid":"6b6709a8ada99b4baab0115ab69c2a6e","score":"0.56842726","text":"function handleNameChange(newName, position){\n setPlayers((oldPlayers) => oldPlayers.map(player => player.Id === position ? {...player, Name: newName} : {...player}));\n }","title":""},{"docid":"fdfa2b94bdebdec30b1f6fc165a42d6f","score":"0.56789297","text":"function defaultFilenameModifier (fileInfo, version) {\n if (fileInfo.dest.endsWith('index.um')) {\n return fileInfo.clone({\n dest: fileInfo.dest.replace('index.um', version) + '/' + 'index.um'\n })\n } else {\n return fileInfo.clone({\n dest: fileInfo.dest.replace('.um', '') + '/' + version + '.um'\n })\n }\n}","title":""},{"docid":"b8741191b52a92128b5cbde12c9899d2","score":"0.56684804","text":"function renameSprites() {\n return gulp.src([assets.components + '/*.css'])\n .pipe(plumber())\n .pipe(rename({\n basename: '_sprites',\n extname: '.scss'\n }))\n .pipe(gulp.dest(assets.components))\n}","title":""},{"docid":"f51457885ed1d059adb3394c5ba9ae9a","score":"0.56667155","text":"function fixPageName(){\n\tvar newPageTitle = getElementsByClassName(document, 'span', 'changePageTitle')[0]; // Find the span with the new title\n\tif(newPageTitle == null) return; // If not found exit\n\tvar oldPageTitle = getElementsByClassName(document, 'header', 'WikiaPageHeader')[0].getElementsByTagName( \"h1\" )[0]; //Find the page's title\n\tif(oldPageTitle == null) return; // If not found exit\n\toldPageTitle.innerHTML = newPageTitle.innerHTML; // Set the title\n}","title":""},{"docid":"447a34919d95269e66b0b40be50fdd74","score":"0.5656533","text":"_renameStream(streamName) {\n if (streamName.indexOf('/default/') !== -1) {\n return streamName\n } else {\n let tokens = streamName.split('/')\n return [tokens[0], 'default', tokens[2]].join('/')\n }\n }","title":""},{"docid":"d14a2b9070fc723213164182540dd578","score":"0.5655735","text":"function renameComponent(content) {\n return content.replace(/\\/\\*COMPONENT_NAME\\*\\//g, argv.name);\n}","title":""},{"docid":"3c95152df4c214aac85917742fb59374","score":"0.56539506","text":"async function rename_user(id, new_name) {\n const number = /^[0-9]*$/g\n const users = await db.read('./database/users.json')\n const user = await users.find(user => user.id == id)\n if(!id || !new_name) return console.log(`Inform the dm_id and username`)\n if(!id.match(number) || id.length != 18) return console.log(`DM_ID is incorret`)\n if(!user) return console.log(`User not found`)\n\n db.update('./database/users.json', id, new_name)\n console.log(`${user.name}, renamed to ${new_name}`)\n}","title":""},{"docid":"13dc70e721b8b452472efdb30f2b9f05","score":"0.56291616","text":"changeName() {\n\t\tif (this.lives < 2) {\n\t\t\tthis.imgName = 'player';\n\t\t} else if (this.lives == 2) {\n\t\t\tthis.imgName = 'playerUp';\n\t\t} else {\n\t\t\tthis.imgName = 'playerUltimate';\n\t\t}\n\t}","title":""},{"docid":"65b953bda1053b0ac406ee9cfb75da49","score":"0.5626902","text":"function dlRenameSend(from, to_name){\n\t\n\t$.ajax({\n\t\turl: '?do=ajax/renameDir',\n\t\ttype: 'post',\n\t\tdata: ({from:from, to_name:to_name}),\n\t\tdataType: 'json',\n\t\ttimeout: 5000,\n\t\tbeforeSend: function() {\n\t\t\tcontentWorkingStatusOn();\n\t\t},\n\t\terror: function(){\n\t\t\trenderError('Attempt to rename directory failed. Please, try again, maybe later.');\n\t\t\tcontentWorkingStatusOff();\n\t\t},\n\t\tsuccess: function(data) {\n\n\t\t\tcontentWorkingStatusOff();\n\t\t\t\n\t\t\tif (data['status'] == 'error')\n\t\t\t\trenderError(data['data']);\n\t\t\telse {\n\t\t\t\t\n\t\t\t\tvar new_name = data['data'];\n\t\t\t\tvar $li = $('#dirlist li.in-action-rename');\n\t\t\t\tvar new_id = ($li.attr('id').idToPath().dirname() + new_name).pathToId('dl');\n\n\t\t\t\t// hide input\n\t\t\t\t$li\n\t\t\t\t\t.attr('id', new_id)\n\t\t\t\t\t.find('> input')\n\t\t\t\t\t\t.remove().end()\n\t\t\t\t\t.find('> span')\n\t\t\t\t\t\t.text(new_name).show().end()\n\t\t\t\t\t.removeClass('in-action')\n\t\t\t\t\t.removeClass('in-action-rename')\n\t\t\t\t\t.removeData('old_name');\t\t\t\t\t\n\t\t\t\t\n\t\t\t\tif ($li.find('li').length) \n\t\t\t\t\tdlRebuild(new_id.idToPath()); // need to re-generate childrens' ids\n\t\t\t\telse\n\t\t\t\t\tdirActivate(new_id.idToPath());\n\t\t\t\t\n\n\t\t\t\tdlRenameFinally();\n\t\t\t}\n\t\t\t\n\t\t} // /success\n\t});\n\t\n}","title":""},{"docid":"d68029dfcfa80f38c9e82bd34f7f89ba","score":"0.5618406","text":"renameFile(file, cb) {\n let reader = new FileReader();\n\n reader.onloadend = function (event) {\n let dataset = dicomParser.parseDicom(new Uint8Array(event.target.result));\n let index = parseInt(dataset.string('x00200013'));\n let offset = (file.name.indexOf('.dcm') > -1) ? 4 : 0;\n let newName = file.name.substring(0, file.name.length - offset) + '_' + index + '.dcm';\n cb(newName);\n }\n\n reader.readAsArrayBuffer(file);\n }","title":""}],"string":"[\n {\n \"docid\": \"4578810a4b67560ab5f5e7ee21f66996\",\n \"score\": \"0.7102932\",\n \"text\": \"rename(oldName, newName) {\\n files.rename(files.pathJoin(this.cwd, oldName),\\n files.pathJoin(this.cwd, newName));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"520abd173032cc53ce85a51b4bb5fea0\",\n \"score\": \"0.70787907\",\n \"text\": \"function rename(fso_name, is_file) {\\r\\n\\t\\t\\tvar fso_key = is_file ? target_files[fso_name]\\r\\n\\t\\t\\t\\t\\t: target_directories[fso_name];\\r\\n\\t\\t\\tif (!fso_key || fso_name.includes(name)) {\\r\\n\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tCeL.info(fso_name + '→' + name);\\r\\n\\t\\t\\tvar error = CeL.fs_move(target_directory + fso_name,\\r\\n\\t\\t\\t\\t\\ttarget_directory + CeL.to_file_name(name) + '.' + fso_name);\\r\\n\\t\\t\\tif (error) {\\r\\n\\t\\t\\t\\tCeL.error(error);\\r\\n\\t\\t\\t} else if (is_file) {\\r\\n\\t\\t\\t\\tdelete target_files[fso_name];\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tdelete target_directories[fso_name];\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c10385755e16b854a48832c674d60415\",\n \"score\": \"0.70648766\",\n \"text\": \"function caml_sys_rename(o,n){\\n var path = caml_make_path(o);\\n var content = caml_fs_content(path);\\n if(caml_sys_file_exists(n)){\\n if(caml_sys_is_directory(n)) caml_raise_sys_error(n.toString() + \\\" : is a directory\\\");\\n caml_sys_remove(n);\\n }\\n caml_fs_register(n, content);\\n caml_sys_remove(o);\\n return 0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd3772a089e634138808903e8892ee96\",\n \"score\": \"0.70324636\",\n \"text\": \"function rename(old, newish, callback) {\\n fs.rename(old.osFullPath, newish.osFullPath, function (err) {\\n if (err) {\\n callback(errors(err));\\n } else {\\n callback({\\n \\\"Old Path\\\": old.uiPath,\\n \\\"Old Name\\\": old.filename,\\n \\\"New Path\\\": newish.uiPath,\\n \\\"New Name\\\": newish.filename,\\n \\\"Error\\\": \\\"\\\",\\n \\\"Code\\\": 0\\n });//callback\\n }//if\\n }); //fs.rename\\n }//rename\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c016cd758eca23503db1b712adf4cf4e\",\n \"score\": \"0.70011467\",\n \"text\": \"function rename(cwd, src, newName) {\\n cwd.getFile(src, {}, function(fileEntry) {\\n\\tconsole.log(\\\"Renaming from \\\" + fileEntry.name + \\\" to \\\" + newName );\\n fileEntry.moveTo(cwd, newName);\\n }, errorHandler);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5429d23c1d56fbb8cfc7c75d4dcb130\",\n \"score\": \"0.6935209\",\n \"text\": \"function rename(record) {\\n record.updateWith(function () {\\n if (record.name === oldFull) record.name = newFull;\\n if (record.PTRDName === oldFull) record.PTRDName = newFull;\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a47fa1bdb5ea7fcce8224fcdb530152f\",\n \"score\": \"0.662031\",\n \"text\": \"function atualizaDia() {\\n\\n // Gerando carimbo de data e versão\\n var nomeAntigo = SpreadsheetApp.getActiveSpreadsheet().getName();\\n var nomeSemData = nomeAntigo.slice(11); // Fim da data é na posição 10\\n var novoNome = \\\"[\\\" + hojeDia + \\\"] \\\" + nomeSemData;\\n\\n SpreadsheetApp.getActiveSpreadsheet().rename(novoNome);\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f3b0c1c2810c52cb083962d1b296bae\",\n \"score\": \"0.66114676\",\n \"text\": \"changeChildsName(name, newName) {\\n if (this.hasOwnProperty(name)) {\\n this.newName = this.name;\\n delete this.name;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a537ea4890e18033f93241e7c55274aa\",\n \"score\": \"0.65974444\",\n \"text\": \"function rename_file() {\\n if (state.show_file_input_rename == false) {\\n state.show_file_input_rename = true;\\n render();\\n } else {\\n var file;\\n var newname;\\n \\n if (state.mode == \\\"template\\\") {\\n file = getSelectedTreeNode().id;\\n newname = $('.add_input').val();\\n }\\n if (state.mode == \\\"logic\\\") {\\n file = state.current_file;\\n newname = $('.add_input').val();\\n }\\n \\n // rename\\n show_layer('rename_file');\\n $.ajax({\\n url: 'php/rename.php',\\n type: 'post',\\n dataType: 'json',\\n data: {\\n file: file,\\n newname: newname\\n },\\n success: function(json) {\\n state.show_file_input = false;\\n state.show_file_input_rename = false;\\n hide_layer('rename_file');\\n if (state.mode == \\\"logic\\\")\\n loadCurrentDir();\\n if (state.mode == \\\"template\\\")\\n $('#jstree_container').jstree().refresh();\\n } \\n });\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6433b86cc0504af28ea0e5cea2879c69\",\n \"score\": \"0.6586284\",\n \"text\": \"function rename(obj) {\\n\\t\\t myDiagram.startTransaction(\\\"rename\\\");\\n\\t\\t var newName = prompt(\\\"Rename \\\" + obj.part.data.item + \\\" to:\\\");\\n\\t\\t myDiagram.model.setDataProperty(obj.part.data, \\\"item\\\", newName);\\n\\t\\t myDiagram.commitTransaction(\\\"rename\\\");\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6820915d7f2c91a4cbca33f0c887403\",\n \"score\": \"0.65593386\",\n \"text\": \"function renameDotfile(files, metalsmith, done) {\\n Object.keys(files)\\n .filter((filename) => path.basename(filename).startsWith('_'))\\n .forEach((filename) => {\\n // eslint-disable-next-line\\n files[`.${filename.substr(1)}`]= files[filename]\\n // eslint-disable-next-line\\n delete files[filename]\\n })\\n done()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2908881c59b7448b21fe4f5ed085ee23\",\n \"score\": \"0.65361583\",\n \"text\": \"rename(oldPath, newPath, cb = nopCb) {\\n const newCb = wrapCb(cb, 1);\\n try {\\n assertRoot(this.root).rename(normalizePath(oldPath), normalizePath(newPath), newCb);\\n }\\n catch (e) {\\n newCb(e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"649216fd3d4eb88931542e96fca7f3ed\",\n \"score\": \"0.65058625\",\n \"text\": \"function OnRename( name ) {\\n //Check up name.\\n if( !isValidFileName( name ) ) {\\n alert( \\\"Name contains invalid characters!\\\" );\\n app.ShowTextDialog( \\\"Rename Program\\\", curFile, OnRename );\\n return;\\n };\\n \\n //Check if already exists.\\n var newfile = APP_PATH + \\\"/\\\" + name;\\n if( app.FileExists( newfile ) ) {\\n app.Alert( \\\"File already exists!\\\" );\\n } else {\\n //Rename the .rs data file.\\n var oldfile = APP_PATH + \\\"/\\\" + curFile;\\n if( app.FileExists( oldfile ) ) app.RenameFile( oldfile, newfile );\\n ShowFiles();\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9e8126e0c6486ed8ece2c1ac799b1b5\",\n \"score\": \"0.64256346\",\n \"text\": \"changeName(newName)\\n {\\n this.movieName_p= (newName);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea89ddb7e3ad47e0bd9f7b1bed30f49a\",\n \"score\": \"0.6423163\",\n \"text\": \"function rename(target, pattern, replc, counter, ph) {\\n var min = counter * 1,\\n max = target.length + min - 1;\\n\\n for (var i = 0, len = target.length; i < len; i++) {\\n var newName = '',\\n item = target[i];\\n\\n newName = pattern.replaceAll(ph.name, item.name);\\n newName = newName.replaceAll(ph.numUp, fillZero(min + i, max.toString().length));\\n newName = newName.replaceAll(ph.numDown, fillZero(max - i, max.toString().length));\\n\\n if (!isEmpty(replc)) {\\n item.name = item.name.replaceAll(replc, newName);\\n } else {\\n item.name = newName;\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df6bc262fde862638629525438cba25b\",\n \"score\": \"0.64220655\",\n \"text\": \"function _rename(){\\n self._visitingAlter = true;\\n var table = self._queryNode.table;\\n var result = ['EXEC sp_rename '+self.visit(table.toNode())+', '+self.visit(alter.nodes[0].nodes[0])];\\n self._visitingAlter = false;\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52d05158b0670fcc33c5fbea11e2fc22\",\n \"score\": \"0.6390915\",\n \"text\": \"setName (newName, cb) {\\n\\t\\tif (tools.notType(newName, 'string')) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tvar d = this.directory;\\n\\t\\tvar newPath = d === '' ? newName : `${d}/${newName}`;\\n\\t\\tthis.setPath(newPath, cb);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e61c2457037a41c440efb056b11d981\",\n \"score\": \"0.63420784\",\n \"text\": \"function rename (fullPathname, filename, prefix) {\\n\\n // get path without filename\\n let pathWithoutFile = fullPathname.replace(filename,'')\\n console.log('path without filename: ',pathWithoutFile)\\n\\n // rename file and save it\\n fs.rename(`${fullPathname}`,`${pathWithoutFile}${prefix} - ${filename}`, function(err) {\\n if ( err ) console.log('ERROR: ' + err);\\n })\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b051155f3ac40f7be8b290afab25320\",\n \"score\": \"0.63261753\",\n \"text\": \"rename() {\\n return this._listing.rename();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28f8877931c952692086ba86e8b1c3fa\",\n \"score\": \"0.632556\",\n \"text\": \"setName(newName) {\\n\\t\\tthis.name = newName\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f047c67d1e20cbc8d700bfa86c7830d0\",\n \"score\": \"0.62924975\",\n \"text\": \"function renameFiles(files)\\n{\\n files.forEach(function (file)\\n {\\n debug('renameFiles', 'processing', file);\\n var originalName = path.basename(file);\\n var newFileName = originalName.toLowerCase();\\n var directory = path.dirname(file);\\n if (originalName != newFileName)\\n {\\n fs.renameSync(file, directory + \\\"/\\\" + newFileName); //, function(err)\\n debug('renameFiles', 'renamed', originalName, '-->', newFileName);\\n\\n originalFiles.push(originalName);\\n renamedFiles.push(newFileName);\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d627f6b80b1d4803ee7fc9e2f07d9542\",\n \"score\": \"0.62733024\",\n \"text\": \"function getNewName() \\n{ \\n var ext, docName, newName, saveInFile, docName; \\n docName = sourceDoc.name; \\n ext = '.ai'; // new extension for AI file \\n newName = \\\"\\\"; \\n \\n for ( var i = 0 ; docName[i] != \\\".\\\" ; i++ ) \\n { \\n newName += docName[i]; \\n } \\n newName += ext; // full AI name of the file \\n \\n // Create a file object to save the ai file \\n saveInFile = new File( destFolder + '/' + newName ); \\n \\n \\n return saveInFile; \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73038d6c0592c50c4fc156bffd56e3fe\",\n \"score\": \"0.62532413\",\n \"text\": \"function renameFile(fileId, newTitle,callback) {\\n\\tvar successMessage = \\\"Rename complete.\\\";\\n\\tvar failMessage = \\\"Sorry, rename incomplete.\\\";\\n\\tvar body = {'title': newTitle};\\n\\tvar request = gapi.client.drive.files.patch({\\n\\t\\t'fileId': fileId,\\n\\t\\t'resource': body\\n\\t});\\n\\trequest.execute(function(resp) {\\n\\t\\tif (!resp.error){\\n\\t\\t\\tconsole.log(\\\"Rename fileId:{0} to {1}\\\".f(fileId,newTitle));\\n\\t\\t\\tcallback && callback(successMessage,true);\\n\\t\\t}else{\\n\\t\\t\\tcallback && callback(failMessage,false);\\n\\t\\t}\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ba7e76a81922996ccc7aa9bb8acb73f\",\n \"score\": \"0.6248389\",\n \"text\": \"async rename(fromFile, toFile, retryCount = 0) {\\n try {\\n await opfs.rename(fromFile, toFile);\\n } catch (err) {\\n if (err.code !== \\\"EPERM\\\" || retryCount >= 5) {\\n throw err;\\n }\\n await xaa.delay(50);\\n await this.rename(fromFile, toFile, retryCount + 1);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f6419d283a949b16a0f907e99f7591a\",\n \"score\": \"0.6230031\",\n \"text\": \"function renameBlurred(self) {\\n\\tif (removed) return; // because removing a node fires this again\\n\\tremoved = true;\\n\\tvar new_name = self.value;\\n\\tvar dv = document.createElement(\\\"div\\\");\\n\\tdv.innerHTML = new_name;\\n\\tself.parentNode.replaceChild(dv, self);\\n\\tdv.addEventListener(\\\"click\\\", function() {\\n\\t handleLocationClick(this, new_name);\\n\\t}); \\n\\tnavPub.publish(new ROSLIB.Message({\\n\\t\\t\\tcommand: \\\"name-location\\\",\\n\\t\\t\\tparam: new_name\\n\\t}));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c91dcdadb83c892baf08c8185e92e36\",\n \"score\": \"0.62100357\",\n \"text\": \"visitRename_object(ctx) {\\n\\t return this.visitChildren(ctx);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"978c46fde16897ea322bf5d380611b4b\",\n \"score\": \"0.6201645\",\n \"text\": \"editName(newName) {\\n // Don't do anything if name didn't actually change\\n if (newName !== this.state.folder.name) {\\n this.setState({ loading: true });\\n\\n this.linksRef.update({\\n name: newName\\n })\\n .catch((error) => {\\n console.log(error);\\n this.setState({ error: error.message });\\n })\\n .then(() => {\\n this.setState({ loading: false });\\n });\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a81d4a5e678eebeda4201e22e07119a\",\n \"score\": \"0.6173433\",\n \"text\": \"function getNewName() \\n{ \\n var ext, docName, newName, saveInFile, docName; \\n docName = sourceDoc.name; \\n ext = '.png'; // new extension for PNG \\n newName = \\\"\\\"; \\n \\n for ( var i = 0 ; docName[i] != \\\".\\\" ; i++ ) \\n { \\n newName += docName[i]; \\n } \\n newName += ext; // full name of the new file including the png extension \\n \\n // create the new file with the corrected extension \\n saveInFile = new File( destFolder + '/' + newName ); \\n \\n return saveInFile; \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"019cac62f3f4721e53e0b4e9771e1ae4\",\n \"score\": \"0.61710244\",\n \"text\": \"function renameElement() {\\n var id = $(this).parent().attr(\\\"data-id\\\");\\n var item = fileSystem.findElementById(id);\\n var editedItemName = prompt(\\\"Please enter the new name\\\", item.name);\\n if (editedItemName == undefined) {\\n return;\\n }\\n try {\\n fileSystem.renameElement(id, editedItemName);\\n } catch (err) {\\n alert(err.message);\\n }\\n updateUI();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b864fe90fef9c97d1d61e661becf0595\",\n \"score\": \"0.6167889\",\n \"text\": \"function renameIndividualFile(loopInfo, files, pp, callback, $index) {\\n if (loopInfo.error === false) {\\n var oldfilename = paths.join(__appRoot, files[$index].path),\\n // new files comes with a directory, replaced files with a filename. I think there is a better way to handle this\\n // but this works as a starting point\\n newfilename = paths.join(\\n pp.osFullDirectory,\\n pp.isDirectory ? pp.relativePath : \\\"\\\",\\n pp.isDirectory ? files[$index].originalname : pp.filename\\n ); //not sure if this is the best way to handle this or not\\n\\n fs.rename(oldfilename, newfilename, function (err) {\\n if (err) {\\n loopInfo.error = true;\\n console.log(\\\"savefiles error -> \\\", err);\\n callback(errors(err));\\n } else if ($index + 1 >= loopInfo.total) {\\n callback({\\n \\\"Path\\\": pp.relativePath,\\n \\\"Name\\\": pp.filename,\\n \\\"Error\\\": \\\"\\\",\\n \\\"Code\\\": 0\\n });//callback\\n }//if\\n });//fs.rename\\n }//if not loop error\\n }//renameIndividualFile\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83481116242ba35ea040bef6ba7c3939\",\n \"score\": \"0.616185\",\n \"text\": \"switchName() {\\n\\t\\tif (this[_nextName] !== undefined) {\\n\\t\\t\\tthis[_name] = this[_nextName];\\n\\t\\t\\tdelete this[_nextName];\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25d55cc0cfa59f73cc70f5cd72d65126\",\n \"score\": \"0.6126403\",\n \"text\": \"function moveImage(from, to, callback) {\\n fs.rename(from, to, function(error) {\\n \\tif(error) {\\n \\t\\tconsole.log('Error while moving image');\\n \\t}\\n \\tcallback(null);\\n }); \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"822085a361bf83cf4d7611604d0f7178\",\n \"score\": \"0.6124616\",\n \"text\": \"function stopRenaming() {\\n\\t\\t\\tvar new_value = $.trim(textbox.getValue()),\\n\\t\\t\\t\\told_value = $caption.text();\\n\\n\\t\\t\\tcancelRenaming();\\n\\n\\t\\t\\tif (new_value !== old_value) {\\n\\t\\t\\t\\t//Set new value\\n\\t\\t\\t\\tsetValue(new_value);\\n\\n\\t\\t\\t\\t$el.trigger('rn:rename:stop', [_self, new_value, old_value]);\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"093ec09db54df308790fdb7ea72a7fd4\",\n \"score\": \"0.6116899\",\n \"text\": \"function renameFile(files) {\\n files.forEach(file => {\\n file.name = file.name.replace(/^_/, '.').replace(/\\\\.ejs$/, '');\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"093ec09db54df308790fdb7ea72a7fd4\",\n \"score\": \"0.6116899\",\n \"text\": \"function renameFile(files) {\\n files.forEach(file => {\\n file.name = file.name.replace(/^_/, '.').replace(/\\\\.ejs$/, '');\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ee004e76f97795b46a2b425048eec50\",\n \"score\": \"0.6107928\",\n \"text\": \"addUpdatedProjectName(workspaceId, projectName, newProjectName) {\\n this.httpBackend.when('POST', '/api/ext/project/' + workspaceId + '/rename/' + projectName + '?name=' + newProjectName).respond(newProjectName);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9971838716d9321db8bfea5b80b9fb4d\",\n \"score\": \"0.6072208\",\n \"text\": \"function getNewName()\\n{\\n\\tvar ext, docName, newName, saveInFile, docName;\\n\\tdocName = sourceDoc.name;\\n\\text = '.ai'; // new extension for pdf file\\n\\tnewName = \\\"\\\";\\n\\t\\t\\n\\tfor ( var i = 0 ; docName[i] != \\\".\\\" ; i++ )\\n\\t{\\n\\t\\tnewName += docName[i];\\n\\t}\\n\\tnewName += ext; // full pdf name of the file\\n\\t\\n\\t// Create a file object to save the pdf\\n\\tsaveInFile = new File( destFolder + '/' + newName );\\n\\t\\n\\n\\treturn saveInFile;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fc650861fea33a99d5058abb3802973\",\n \"score\": \"0.6065935\",\n \"text\": \"renamePlayer(oldName, newName)\\n\\t{\\n\\t\\tlet card = this._cards.find( (card) => card.name == oldName);\\n\\t\\tif (card)\\n\\t\\t{\\n\\t\\t\\tcard.name = newName;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11f41083f99aa64389a51c11a9432427\",\n \"score\": \"0.60617375\",\n \"text\": \"_renameChunk(x, y, x1, y1) {\\n const key = `${x},${y}.dat`;\\n const newKey = `${x1},${y1}.dat`;\\n\\n const chunkPath = path.resolve(this.dataPath, key);\\n const newChunkPath = path.resolve(this.dataPath, newKey);\\n\\n if (fs.existsSync(chunkPath)) {\\n fs.renameSync(chunkPath, newChunkPath);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bffc3bf0e2ee5be2ba4dc1506a18af8\",\n \"score\": \"0.6050948\",\n \"text\": \"function __generateOriginalName(name) {\\n\\t return 'original:' + name;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3827cb2fbe6f40d1e872e445780fd287\",\n \"score\": \"0.60435426\",\n \"text\": \"function renameFile(manager, oldPath, newPath) {\\n return manager.rename(oldPath, newPath).catch(function (error) {\\n if (error.message.indexOf('409') === -1) {\\n throw error;\\n }\\n return shouldOverwrite(newPath).then(function (value) {\\n if (value) {\\n return manager.overwrite(oldPath, newPath);\\n }\\n return Promise.reject('File not renamed');\\n });\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a28f0a3bc7c23727e426e4c81c989d9\",\n \"score\": \"0.60377324\",\n \"text\": \"function jchtml5_rename_title(argument0){\\n\\tdocument.title = argument0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a28f0a3bc7c23727e426e4c81c989d9\",\n \"score\": \"0.60377324\",\n \"text\": \"function jchtml5_rename_title(argument0){\\n\\tdocument.title = argument0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b051bb18c78f2e49841aa66ed1a1f4c9\",\n \"score\": \"0.60355496\",\n \"text\": \"function renameTabConfirm(p_tab, p_name) {\\n\\n\\tp_tab.tag.tab_title_span.innerHTML=p_name;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51408ef5a8960adaad922f3c187a938f\",\n \"score\": \"0.6034114\",\n \"text\": \"function rename(obj) {\\n return rename_(function(parsedPath) {\\n return {\\n extname: obj.extname || parsedPath.extname,\\n dirname: (obj.dirnamePrefix || '') + parsedPath.dirname,\\n basename: parsedPath.basename\\n };\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04beee51e680cedeefcb701359a8309c\",\n \"score\": \"0.6033415\",\n \"text\": \"renameTempUpload(pkfp, tempName, name){\\n return new Promise((resolve, reject)=>{\\n let self = this;\\n let fPath = this.getPath(pkfp, \\\"files\\\");\\n let oldName = path.join(fPath , tempName);\\n let newName = path.join(fPath , name);\\n let maxAttempts = 4;\\n let timeout = 1000;\\n let attempted = 0;\\n\\n function renameAttempt(){\\n Logger.debug(`File exists. Renaming. Attempt: ${attempted}`, {cat: \\\"files\\\"});\\n fs.rename(oldName, newName, (err)=>{\\n if (err){\\n if ((/BSY/i.test(err.code) || /BUSY/i.test(err.code)) && attempted < maxAttempts){\\n Logger.warn(`Error renameing file: file is busy. Attempt: ${attempted}`, {cat: \\\"files\\\"})\\n attempted++;\\n setTimeout(renameAttempt, timeout);\\n }else {\\n Logger.error(\\\"Error renaming file: \\\" + err, {cat: \\\"files\\\"})\\n console.log(\\\"ERROR renaming file: \\\" + err);\\n reject(new Error(\\\"renameTempUpload error: \\\" + err));\\n }\\n } else {\\n //success\\n console.log(\\\"Renamed. Resolving...\\\")\\n resolve();\\n }\\n\\n });\\n }\\n renameAttempt();\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b19a062f018df240251363d5c12d2426\",\n \"score\": \"0.6029428\",\n \"text\": \"function FileManagerRename(node)\\r\\n{\\r\\n var parent = $(node).parents(\\\"li:eq(0)\\\").get(0);\\r\\n var parentpath = $(parent).attr('fsdata');\\r\\n var title = $(node).children(\\\"a:visible\\\").text();\\r\\n \\r\\n $.post('/Admin/FileManager/CreateFolder', {name: title, path: parentpath}, function(folderPath){\\r\\n $(node).attr('fsdata', folderPath);\\r\\n $(node).attr('id', folderPath);\\r\\n var arr = folderPath.split('/');\\r\\n $(node).children(\\\"a:visible\\\").html(arr[arr.length-1]);\\r\\n });\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d4d1f35f4caec38785b349034457088\",\n \"score\": \"0.60146534\",\n \"text\": \"renameItem(data, callback) {\\n return this.db.run(\\n `UPDATE tree SET name = ? WHERE name = ? AND parent = ?`,\\n data, \\n err => {\\n callback(err);\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"144c9691abf2e0e609a2e7f5c0ad023b\",\n \"score\": \"0.6003658\",\n \"text\": \"function renameFileEventFn(type, oldFilename, newFilename, callback) {\\n return function(err) {\\n if(!err) {\\n self.trigger(type, [oldFilename, newFilename]);\\n }\\n callback(err);\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58ff911acc2b7ec78c4dcbea3f3572c9\",\n \"score\": \"0.599823\",\n \"text\": \"function mvFileKeepTimeStamp(from,to)\\n{\\n\\tvar date = fs.statSync(from).mtime\\n\\tfs.renameSync(from, to);\\n\\tfs.open(to, (err,fd)=>{\\n\\t\\tfs.futimesSync(fd, date, date);\\n\\t})\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3596180f1e8f2631b7fded3255fb8cf0\",\n \"score\": \"0.5990751\",\n \"text\": \"function main(file, dir2) {\\n //gets file name and adds it to dir2\\n var f = path.basename(file);\\n var dest = path.resolve(dir2, f);\\n\\n fs.renameSync(file, dest);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"319c7748f17637d509ef4c8a151c9877\",\n \"score\": \"0.5989605\",\n \"text\": \"function rename_animation(animation,name)\\n{\\n /*fixes the name in the animation menu entry*/\\n for(child of animation.target.animation_selection_menu.children)\\n {\\n if(child.animationtselect == animation) child.innerHTML = \\\"<a>\\\" + name + \\\"</a>\\\";\\n }\\n /*Setting new name of the animation*/\\n animation.name = name;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3424f7579f16f8f3c142a1b5ba51ebce\",\n \"score\": \"0.5981969\",\n \"text\": \"async renameItem(id) {\\n try {\\n const res = await this.endPoint.put(`/item/rename/${id}`)\\n return res.data\\n } catch (err) {\\n throw new Error(err)\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c963b4a0366e16d6db7900dd090ec9b\",\n \"score\": \"0.5979677\",\n \"text\": \"function handleChange(newName) {\\n setName(newName);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b25c58881f9a0512658df1a1f1273226\",\n \"score\": \"0.59724563\",\n \"text\": \"function causeRenameHandler(data) {\\n var oldNode = fd.graph.getNode(data.causeId);\\n oldNode.title = data.newName;\\n var node = $('#' + data.causeId);\\n var children = node.children();\\n // Here .html is used instead of .text, as CauseRenameEvent escapes HTML\\n node.html(data.newName);\\n node.append(children);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf3a1a70b682fc57209a7fbd125077a7\",\n \"score\": \"0.59700704\",\n \"text\": \"function rename(oldPath, newPath) {\\n return fs.promises.rename(oldPath, newPath);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2001bcc93e2175abf8df189feaffc79\",\n \"score\": \"0.59680504\",\n \"text\": \"function renameFolder(folder, newName) {\\n var current = [], future = [], modify = false;\\n var title = $('.upper-title');\\n title.empty();\\n // Check the new name\\n if (newName.length == 0 || g_folders[newName] != undefined) {\\n title.append(folder.name);\\n showFolderError('The folder <b>' + newName + '</b> already exists!');\\n } else {\\n title.append(newName);\\n delete g_folders[folder.name];\\n g_folders[newName] = folder;\\n if (folder.name == g_homeFolderName) {\\n // Remember the new home name\\n Windows.Storage.ApplicationData.current.localSettings.values['home'] = newName;\\n folder.name = newName;\\n } else {\\n // Modify the path of files\\n folder.name = newName;\\n current.push(folder);\\n while (current.length > 0) {\\n current.forEach(function (c) {\\n future = future.concat(c.folders);\\n c.files.forEach(function (f) {\\n modify = true;\\n setPath(c, f);\\n });\\n });\\n current = future.slice(0);\\n future = [];\\n }\\n }\\n }\\n if (modify) {\\n uploadMetadata();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2082e6a240bad9505011feb2a4f0d59\",\n \"score\": \"0.5967815\",\n \"text\": \"function rename(obj, newNames) {\\n return _.reduce(\\n newNames,\\n (o, newKey, oldKey) => {\\n if (_.has(obj, oldKey)) {\\n o[newKey] = obj[oldKey]; // eslint-disable-line\\n } else {\\n o[newKey] = null; // eslint-disable-line\\n }\\n return o;\\n },\\n _.omit.apply(null, construct(obj, _.keys(newNames)))\\n );\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d25fa3288fd19228d11d1699f5cda8ec\",\n \"score\": \"0.59675545\",\n \"text\": \"function actionRenameTag(e) {\\n handleEventCancel(e, 'actionRenameTag');\\n if (canTakeAction('actionRenameTag()') === false) {\\n return;\\n }\\n genericModal($dlg.renameTag);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bccb5f4f60672c752a3f2f071bf76437\",\n \"score\": \"0.5960196\",\n \"text\": \"changeName(newName) {\\n this.name = newName;\\n updateTeam(this._id, \\\"name\\\", this.name);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3391a0eb26e1ef9dbe68dcf44c2ce10\",\n \"score\": \"0.5942692\",\n \"text\": \"function changeIosBundleName(projectDir, projectName,options){\\n if(!options.ios){\\n return\\n }\\n var oldPacakgeName = 'org.reactjs.native.example.'\\n var replacements = {}\\n replacements[oldPacakgeName] = options.ios + '.'\\n util.copyProjectTemplateAndReplace(projectDir+'/ios', projectDir+'/ios1', replacements )\\n util.deleteDir(projectDir+'/ios')\\n fs.renameSync(projectDir+'/ios1',projectDir+'/ios')\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b5cdd43326f0873e20ed68047d74eee\",\n \"score\": \"0.59242576\",\n \"text\": \"function changeName(username) {\\n return username = \\\"semper-ry\\\"\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dad2a5febb2ef42ff0f72c8da1d04e3\",\n \"score\": \"0.59083545\",\n \"text\": \"onRename(user, oldUserid, isJoining, isForceRenamed) {\\n\\t\\tif (!this.allowRenames || (!user.named && !isForceRenamed)) {\\n\\t\\t\\tif (!(user.userid in this.players)) {\\n\\t\\t\\t\\tuser.games.delete(this.id);\\n\\t\\t\\t\\tuser.updateSearch();\\n\\t\\t\\t}\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif (!(oldUserid in this.players)) return;\\n\\t\\tthis.renamePlayer(user, oldUserid);\\n\\t\\tif (this.childGame && this.childGame.onRename) this.childGame.onRename(user, oldUserid, isJoining, isForceRenamed);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0981f74666ab73272a2f84e276df12a1\",\n \"score\": \"0.5904401\",\n \"text\": \"static renameTask(e) {\\n if (e.key !== 'Enter') return\\n\\n const projectName = document.getElementById('project-name').textContent\\n const taskName = this.previousElementSibling.textContent\\n const newTaskName = this.value\\n\\n if (newTaskName === '') {\\n alert(\\\"Task name can't be empty\\\")\\n return\\n }\\n\\n if (Storage.getTodoList().getProject(projectName).contains(newTaskName)) {\\n this.value = ''\\n alert('Task names must be different')\\n return\\n }\\n\\n if (projectName === 'Today' || projectName === 'This week') {\\n const mainProjectName = taskName.split('(')[1].split(')')[0]\\n const mainTaskName = taskName.split(' ')[0]\\n Storage.renameTask(\\n projectName,\\n taskName,\\n `${newTaskName} (${mainProjectName})`\\n )\\n Storage.renameTask(mainProjectName, mainTaskName, newTaskName)\\n } else {\\n Storage.renameTask(projectName, taskName, newTaskName)\\n }\\n UI.clearTasks()\\n UI.loadTasks(projectName)\\n UI.closeRenameInput(this.parentNode.parentNode)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"832af32d2b6b4363f0c666c64f356af7\",\n \"score\": \"0.5898459\",\n \"text\": \"function update_file_name(name) {\\r\\n\\tparent.document.file.identifier.value = document.blosxom.plugin_blosxom_pwd.value + name;\\r\\n\\tdocument.blosxom.entry.value = name;\\r\\n\\tparent.document.file.filename.value = name;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7884419498233fcb55dbbe001dc678ea\",\n \"score\": \"0.58860093\",\n \"text\": \"function renameNextFolder() {\\n const oldPath = `./out/${oldName}`;\\n const newPath = `./out/${newName}`;\\n\\n fs.rename(oldPath, newPath, function (error) {\\n if (error) {\\n console.error(error);\\n } else {\\n console.log(`'${oldName}' folder successfully renamed to '${newName}'`);\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81d8dd64e71b7346a34f202af5097916\",\n \"score\": \"0.5885106\",\n \"text\": \"function UpdateFileName(id, sNewFileName) {\\n\\tvar aPath = sNewFileName.split('\\\\\\\\')\\n\\tvar sNewFileName = aPath[aPath.length - 1]\\n\\n\\t$('#' + id).val(sNewFileName)\\n\\t$('#' + id).trigger('validate')\\n\\t$('#name_' + id).text(sNewFileName)\\n\\treturn true\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bdd15b524eb1281cb4d150de45937c45\",\n \"score\": \"0.5885023\",\n \"text\": \"function getNewName()\\r{\\r\\tvar ext, docName, newName, saveInFile, docName;\\r\\tdocName = sourceDoc.name;\\r\\text = '_AB_nobleed_HR.pdf'; // new extension for pdf file\\r\\tnewName = \\\"\\\";\\r\\t\\t\\r\\tfor ( var i = 0 ; docName[i] != \\\".\\\" ; i++ )\\r\\t{\\r\\t\\tnewName += docName[i];\\r\\t}\\r\\tnewName += ext; // full pdf name of the file\\r\\t\\r\\t// Create a file object to save the pdf\\r\\tsaveInFile = new File( folderPDF + '/' + newName );\\r\\t\\r\\r\\treturn saveInFile;\\r}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f81522c06968764e46a63298db923164\",\n \"score\": \"0.58847314\",\n \"text\": \"newFilename() {\\n if (this.prevFilename !== this.currentFilename) {\\n // Only do that after new file created\\n this.prevFilename = this.currentFilename\\n this.deleteOldFiles()\\n }\\n return super.newFilename()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5b92da6d4b7a81f538226b70a15c38a\",\n \"score\": \"0.58809453\",\n \"text\": \"async renameFile(options){\\n // Options can be either of these:\\n // 1. old path & new path.\\n // 2. name, ext, folder & new path.\\n // 3. name, ext, folder & new name.\\n\\n // Options not allowed: old path & new name.\\n\\n const self = this;\\n const fsn = await this.getFileSchemaNameFromFH();\\n const validateConfig = await ObjectValidator.validate({ object: options, against: \\\"Func_RenameFile\\\", });\\n if(validateConfig.success){\\n let pathToFile = validateConfig.object.path ? validateConfig.object.path : (\\n validateConfig.object.name && validateConfig.object.ext && validateConfig.object.folder !== null ? `${validateConfig.object.folder}${validateConfig.object.folder === \\\"\\\" ? \\\"\\\" : \\\"/\\\"}${validateConfig.object.name}.${validateConfig.object.ext}` : null\\n );\\n\\n let newPath = validateConfig.object.newPath ? validateConfig.object.newPath : (\\n validateConfig.object.newName && validateConfig.object.ext && validateConfig.object.folder !== null ? `${validateConfig.object.folder}${validateConfig.object.folder === \\\"\\\" ? \\\"\\\" : \\\"/\\\"}${validateConfig.object.newName}.${validateConfig.object.ext}` : null\\n );\\n\\n if(pathToFile == null || newPath == null){\\n return false;\\n }\\n\\n pathToFile = await this.beautifyPath(pathToFile, true);\\n newPath = await this.beautifyPath(newPath, true);\\n\\n let response = await this.renameS3File(pathToFile, newPath);\\n if(response){ Logger.log(`${fsn} renamed`); return true; }\\n\\n Logger.log(`${fsn} renaming failed`);\\n }else{ Logger.log(`${fsn} renaming failed`); }\\n\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93701bf1857c7fff2e2d38e57eed5556\",\n \"score\": \"0.58745474\",\n \"text\": \"function cancelRenaming() {\\n\\t\\t\\tif (textbox) {\\n\\t\\t\\t\\ttextbox.destroy();\\n\\t\\t\\t\\ttextbox.remove();\\n\\t\\t\\t}\\n\\n\\t\\t\\t$caption.show();\\n\\n\\t\\t\\tdestroyCloseListLayer();\\n\\n\\t\\t\\t$el.trigger('rn:rename:cancel', [_self]);\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fd3c5317ddbd4bca108d583db7807bd\",\n \"score\": \"0.5867363\",\n \"text\": \"updateName(name) {\\n\\t\\tthis[_nextName] = name;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e441907eb9e8808f70fc15762caf613\",\n \"score\": \"0.5859029\",\n \"text\": \"set name(newName){\\n if(newName.length < 3){\\n this._name = 'Name Error: Length must be at least 3 characters';\\n } else {\\n this._name = newName;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f89a31391ec397cbd76667ba2f2540da\",\n \"score\": \"0.5858593\",\n \"text\": \"function Rename(id, name, ctx) {\\n return {\\n id: id,\\n name: name,\\n context: ctx\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9bd18c4d63dde197a9d441de713be3c2\",\n \"score\": \"0.58584386\",\n \"text\": \"function renameOld({name, type, culture: cultureId}) {\\n if (type !== \\\"Folk\\\") return name;\\n\\n const haveOrganized =\\n namedReligions.some(\\n ({type, culture, expansion}) => culture === cultureId && type === \\\"Organized\\\" && expansion === \\\"culture\\\"\\n ) ||\\n lockedReligions.some(\\n ({type, culture, expansion}) => culture === cultureId && type === \\\"Organized\\\" && expansion === \\\"culture\\\"\\n );\\n if (haveOrganized && name.slice(0, 3) !== \\\"Old\\\") return `Old ${name}`;\\n return name;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45f793a91dd909f335be70b487d03abd\",\n \"score\": \"0.585084\",\n \"text\": \"static async renameWorkspace(trace, newName, oldName) {\\n log(trace, `Renaming workspace \\\"${oldName}\\\" to \\\"${newName}\\\"`);\\n // Renaming to the same name should be a noop.\\n if (newName === oldName)\\n return Promise.resolve(newName);\\n const aws = await WorkspaceManager.getActiveWorkspace(trace);\\n const targetingActiveWorkspace = oldName === aws.name;\\n const ws = await WorkspaceManager.getWorkspace(trace, oldName);\\n const finalName = await WorkspaceManager.addWorkspace(trace, Object.assign({}, ws, { name: newName }));\\n log(trace, `Final name of rename: ${finalName}`);\\n const states = await WorkspaceManager._WS.getManyCompleteStates(ws.windows, oldName);\\n log(trace, \\\"Window states\\\", states);\\n await WorkspaceManager._WS.setManyCompleteStates(states, finalName);\\n if (targetingActiveWorkspace) {\\n const aStates = await WorkspaceManager._WS.getManyCompleteStates(aws.windows);\\n await WorkspaceManager.setActiveWorkspace(trace, finalName);\\n await WorkspaceManager._WS.setManyCompleteStates(aStates);\\n await WorkspaceManager.updateActiveWorkspace(trace, aws => {\\n return Object.assign({}, aws, { name: finalName });\\n });\\n }\\n await WorkspaceManager.removeWorkspace(trace, oldName);\\n return finalName;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a09292d04813a50e46a97c8d626fbd72\",\n \"score\": \"0.5842135\",\n \"text\": \"function rename(d){\\n if (d.key){\\n d['name']=d.key;\\n delete d.key;\\n } else {\\n lastchild = d[lastchild_I];\\n for(var key in d){delete d[key];}; //remove all object properties\\n //needed for proper rendering of data for d3 layouts\\n d['name']=lastchild;\\n };\\n if (d.values){\\n d['children'] = d.values;\\n d['children'].forEach(rename);\\n delete d.values;\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d80fbbae8cac89a6ba0f14b57a3ccf55\",\n \"score\": \"0.58348936\",\n \"text\": \"function add_new_name ( obj, name ) {\\n if ( obj.canonical_name !== undefined ) {\\n if ( obj.canonical_name > name ) {\\n add_secondary_name ( obj, obj.canonical_name );\\n obj.canonical_name = name;\\n }\\n else {\\n add_secondary_name ( obj, name );\\n }\\n }\\n else {\\n obj.canonical_name = name;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efdd5a71bc83f447f4195508512a74c6\",\n \"score\": \"0.58277303\",\n \"text\": \"renameTable(tableName, to) {\\n this.pushQuery(`rename table ${this.formatter.wrap(tableName)} to ${this.formatter.wrap(to)}`);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc1b21a711ab560e686533a28553f5e6\",\n \"score\": \"0.5826938\",\n \"text\": \"function rename(res){\\n fs.rename(saveDir + '.zip', saveDir + 'screenshots.zip', function (err) {\\n if (err){\\n console.log('Error renaming blank zip folder:');\\n console.log(err);\\n throw err;\\n } \\n console.log('Saved as ' + saveDir + 'screenshots.zip');\\n // Send the response (zip file) back\\n res.download(saveDir + 'screenshots.zip');\\n setTimeout(function(){ removeFolder(); }, 30 * 1000);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f941f066b72901a8f60d727f9ba22ebb\",\n \"score\": \"0.581719\",\n \"text\": \"renameTable(from, to) {\\n this.pushQuery(\\n `alter table ${this.formatter.wrap(from)} rename to ${this.formatter.wrap(\\n to\\n )}`\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbe018716937792fde74cfb16fb3da93\",\n \"score\": \"0.5814857\",\n \"text\": \"function emitRenameReq(){\\n var id = \\\"#cmInputRename\\\";\\n action = \\\"rename\\\";\\n\\n if (!isDriver || cmActionLocks[action] || !cmNameValidation(id)) return;\\n\\n cmActionLocks[action] = true; // lock the action\\n socket.emit('context_menu_clicked',\\n {\\n key: action,\\n relPath: cmRelPath,\\n user: username,\\n room: roomname,\\n name: $(id).val(),\\n text: editor.getSession().getValue(),\\n activePath: getActiveFolderPath()\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd64650459e94bc6191630978859de17\",\n \"score\": \"0.5808675\",\n \"text\": \"function updateExportNames() {\\n $(\\\"modelValuesTable\\\").select('.modelName').each(\\n function(ctrl) {\\n var modelId = ctrl.readAttribute('model_id');\\n var modelOrder = ctrl.readAttribute('model_order');\\n }\\n );\\n\\n if (!this.editor) { return; }\\n var oldName = this.editor.undoText;\\n var newName = this.editor.originalText;\\n\\n $A($(\\\"export_model_select\\\").options).each(function(option) {\\n if (option.innerHTML == oldName) { option.innerHTML = newName; }\\n }); \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d7f486b37f02f26b6f4692cca9f6eee\",\n \"score\": \"0.579444\",\n \"text\": \"function tryRename(p1, p2) {\\n try {\\n fs.linkSync(p1, p2);\\n } catch(e) {\\n if (e.code === \\\"EEXIST\\\") {\\n return false;\\n } else {\\n throw e;\\n }\\n }\\n fs.unlinkSync(p1);\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"179650f00fc640f747684dadf4e5ed71\",\n \"score\": \"0.5784263\",\n \"text\": \"renameChat(dialogId, newName) {\\n\\t return babelHelpers.classPrivateFieldLooseBase(this, _renameService)[_renameService].renameChat(dialogId, newName);\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f2b3ebc4b79480b5870a98f14f423a3\",\n \"score\": \"0.5776471\",\n \"text\": \"function move({ oldPath, newPath }, callback) {\\n fs.rename(oldPath, newPath, function (err) {\\n if (err) {\\n if (err.code === 'EXDEV') {\\n copy();\\n } else {\\n callback(err);\\n }\\n return;\\n }\\n callback();\\n });\\n\\n function copy() {\\n var readStream = fs.createReadStream(oldPath);\\n var writeStream = fs.createWriteStream(newPath);\\n\\n readStream.on('error', callback);\\n writeStream.on('error', callback);\\n\\n readStream.on('close', function () {\\n fs.unlink(oldPath, callback);\\n });\\n\\n readStream.pipe(writeStream);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"158fc4fd107a7a05ab21595e4828cfa5\",\n \"score\": \"0.5771346\",\n \"text\": \"function dlRenameStart(){\\n\\t\\n\\trunning_action = 'dlRename'; // @todo unify\\n\\trename_dir_running = true;\\n\\t\\n\\t$li = $('#dirlist li.active');\\n\\t\\t\\n\\tvar old_name = $li.attr('id').idToPath().filename();\\n\\n\\t$li\\n\\t\\t.addClass('in-action')\\n\\t\\t.addClass('in-action-rename')\\n\\t\\t.data('old_name', old_name)\\n\\t\\t.find('> span').hide().end()\\n\\t\\t.prepend('<input type=\\\"text\\\" class=\\\"new_name\\\" value=\\\"'+ old_name +'\\\" />')\\n\\t\\t.find('input.new_name').select();\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9475fb3e5c1378227d5d58da8f223b19\",\n \"score\": \"0.5756462\",\n \"text\": \"function updateDbEntryAndMove(sFileNameOld, sFileNameNew, fCallback) {\\n\\t// update database entry\\n\\tvar sSql = esc(\\\"UPDATE datasets SET file_name = %Q WHERE file_name = %Q;\\\",\\n\\tsFileNameNew, sFileNameOld);\\n\\t\\t\\n\\tpostgres.query(sSql, function(oErr, oResult) {\\n\\t\\tif(oErr) {fCallback(oErr);}\\n\\t\\t\\t\\n\\t\\t// move old file to the archive\\n\\t\\tfs.rename(\\n\\t\\t\\tpath.join(config.app.dataset_root_path, sFileNameOld),\\n\\t\\t\\tpath.join(config.app.dataset_root_path, \\\"A\\\", sFileNameOld),\\n\\t\\tfunction(oErr) {\\n\\t\\t\\tif(oErr) {fCalllback(oErr);}\\n\\t\\t\\tfCallback();\\n\\t\\t});\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"316cd0ca881732450200def7f26ceac7\",\n \"score\": \"0.57448095\",\n \"text\": \"async changeName(route, newName, oldName) {\\n const result = await axios.post(getRoute(\\\"changename\\\"), {\\n route: route,\\n oldName: oldName,\\n newName: newName,\\n });\\n return result.data;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6957b046e2c200febb8bd0ec46b7a956\",\n \"score\": \"0.57290727\",\n \"text\": \"function startRenaming() {\\n\\t\\t\\tvar offset = $el.offset(),\\n\\t\\t\\t\\twidth = $el.width();\\n\\t\\t\\tvar special_class_name = $caption.data('js_rename_class') || '';\\n\\n\\n\\t\\t\\tcreateCloseListLayer();\\n\\n\\t\\t\\ttextbox = $('<input type=\\\"text\\\" class=\\\"rename_component_input ' + special_class_name + '\\\" />').appendTo('body');\\n\\t\\t\\ttextbox.textbox({\\n\\t\\t\\t\\ttype : 'text', value : 0, min : 3, max : 20, template : 'internal', live : true\\n\\t\\t\\t}).focus()\\n\\t\\t\\t.on('txt:key:enter', function() {\\n\\t\\t\\t\\tstopRenaming();\\n\\t\\t\\t}).on('txt:key:esc', function() {\\n\\t\\t\\t\\tcancelRenaming();\\n\\t\\t\\t});\\n\\n\\t\\t\\ttextbox.css({left : offset.left, top : offset.top, width : width}).val(settings.text);\\n\\n\\t\\t\\t$caption.hide();\\n\\n\\t\\t\\t$el.addClass('renaming_started');\\n\\n\\t\\t\\t$el.trigger('rn:rename:start', [_self]);\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2ff5bde1cd1884af158765c1f8a22f3\",\n \"score\": \"0.5719862\",\n \"text\": \"function renameTable(tblData, tblName, newTblName, db, overwrite) {\\n if (overwrite) {\\n dropTable(tblData, newTblName, db);\\n }\\n tblData[newTblName] = tblData[tblName];\\n delete tblData[tblName];\\n executeSimpleSQL(db, \\\"ALTER TABLE \\\" + tblName +\\n \\\" RENAME TO \\\" + newTblName);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b6709a8ada99b4baab0115ab69c2a6e\",\n \"score\": \"0.56842726\",\n \"text\": \"function handleNameChange(newName, position){\\n setPlayers((oldPlayers) => oldPlayers.map(player => player.Id === position ? {...player, Name: newName} : {...player}));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fdfa2b94bdebdec30b1f6fc165a42d6f\",\n \"score\": \"0.56789297\",\n \"text\": \"function defaultFilenameModifier (fileInfo, version) {\\n if (fileInfo.dest.endsWith('index.um')) {\\n return fileInfo.clone({\\n dest: fileInfo.dest.replace('index.um', version) + '/' + 'index.um'\\n })\\n } else {\\n return fileInfo.clone({\\n dest: fileInfo.dest.replace('.um', '') + '/' + version + '.um'\\n })\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8741191b52a92128b5cbde12c9899d2\",\n \"score\": \"0.56684804\",\n \"text\": \"function renameSprites() {\\n return gulp.src([assets.components + '/*.css'])\\n .pipe(plumber())\\n .pipe(rename({\\n basename: '_sprites',\\n extname: '.scss'\\n }))\\n .pipe(gulp.dest(assets.components))\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f51457885ed1d059adb3394c5ba9ae9a\",\n \"score\": \"0.56667155\",\n \"text\": \"function fixPageName(){\\n\\tvar newPageTitle = getElementsByClassName(document, 'span', 'changePageTitle')[0]; // Find the span with the new title\\n\\tif(newPageTitle == null) return; // If not found exit\\n\\tvar oldPageTitle = getElementsByClassName(document, 'header', 'WikiaPageHeader')[0].getElementsByTagName( \\\"h1\\\" )[0]; //Find the page's title\\n\\tif(oldPageTitle == null) return; // If not found exit\\n\\toldPageTitle.innerHTML = newPageTitle.innerHTML; // Set the title\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"447a34919d95269e66b0b40be50fdd74\",\n \"score\": \"0.5656533\",\n \"text\": \"_renameStream(streamName) {\\n if (streamName.indexOf('/default/') !== -1) {\\n return streamName\\n } else {\\n let tokens = streamName.split('/')\\n return [tokens[0], 'default', tokens[2]].join('/')\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d14a2b9070fc723213164182540dd578\",\n \"score\": \"0.5655735\",\n \"text\": \"function renameComponent(content) {\\n return content.replace(/\\\\/\\\\*COMPONENT_NAME\\\\*\\\\//g, argv.name);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c95152df4c214aac85917742fb59374\",\n \"score\": \"0.56539506\",\n \"text\": \"async function rename_user(id, new_name) {\\n const number = /^[0-9]*$/g\\n const users = await db.read('./database/users.json')\\n const user = await users.find(user => user.id == id)\\n if(!id || !new_name) return console.log(`Inform the dm_id and username`)\\n if(!id.match(number) || id.length != 18) return console.log(`DM_ID is incorret`)\\n if(!user) return console.log(`User not found`)\\n\\n db.update('./database/users.json', id, new_name)\\n console.log(`${user.name}, renamed to ${new_name}`)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13dc70e721b8b452472efdb30f2b9f05\",\n \"score\": \"0.56291616\",\n \"text\": \"changeName() {\\n\\t\\tif (this.lives < 2) {\\n\\t\\t\\tthis.imgName = 'player';\\n\\t\\t} else if (this.lives == 2) {\\n\\t\\t\\tthis.imgName = 'playerUp';\\n\\t\\t} else {\\n\\t\\t\\tthis.imgName = 'playerUltimate';\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65b953bda1053b0ac406ee9cfb75da49\",\n \"score\": \"0.5626902\",\n \"text\": \"function dlRenameSend(from, to_name){\\n\\t\\n\\t$.ajax({\\n\\t\\turl: '?do=ajax/renameDir',\\n\\t\\ttype: 'post',\\n\\t\\tdata: ({from:from, to_name:to_name}),\\n\\t\\tdataType: 'json',\\n\\t\\ttimeout: 5000,\\n\\t\\tbeforeSend: function() {\\n\\t\\t\\tcontentWorkingStatusOn();\\n\\t\\t},\\n\\t\\terror: function(){\\n\\t\\t\\trenderError('Attempt to rename directory failed. Please, try again, maybe later.');\\n\\t\\t\\tcontentWorkingStatusOff();\\n\\t\\t},\\n\\t\\tsuccess: function(data) {\\n\\n\\t\\t\\tcontentWorkingStatusOff();\\n\\t\\t\\t\\n\\t\\t\\tif (data['status'] == 'error')\\n\\t\\t\\t\\trenderError(data['data']);\\n\\t\\t\\telse {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tvar new_name = data['data'];\\n\\t\\t\\t\\tvar $li = $('#dirlist li.in-action-rename');\\n\\t\\t\\t\\tvar new_id = ($li.attr('id').idToPath().dirname() + new_name).pathToId('dl');\\n\\n\\t\\t\\t\\t// hide input\\n\\t\\t\\t\\t$li\\n\\t\\t\\t\\t\\t.attr('id', new_id)\\n\\t\\t\\t\\t\\t.find('> input')\\n\\t\\t\\t\\t\\t\\t.remove().end()\\n\\t\\t\\t\\t\\t.find('> span')\\n\\t\\t\\t\\t\\t\\t.text(new_name).show().end()\\n\\t\\t\\t\\t\\t.removeClass('in-action')\\n\\t\\t\\t\\t\\t.removeClass('in-action-rename')\\n\\t\\t\\t\\t\\t.removeData('old_name');\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif ($li.find('li').length) \\n\\t\\t\\t\\t\\tdlRebuild(new_id.idToPath()); // need to re-generate childrens' ids\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tdirActivate(new_id.idToPath());\\n\\t\\t\\t\\t\\n\\n\\t\\t\\t\\tdlRenameFinally();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t} // /success\\n\\t});\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d68029dfcfa80f38c9e82bd34f7f89ba\",\n \"score\": \"0.5618406\",\n \"text\": \"renameFile(file, cb) {\\n let reader = new FileReader();\\n\\n reader.onloadend = function (event) {\\n let dataset = dicomParser.parseDicom(new Uint8Array(event.target.result));\\n let index = parseInt(dataset.string('x00200013'));\\n let offset = (file.name.indexOf('.dcm') > -1) ? 4 : 0;\\n let newName = file.name.substring(0, file.name.length - offset) + '_' + index + '.dcm';\\n cb(newName);\\n }\\n\\n reader.readAsArrayBuffer(file);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":94,"cells":{"query_id":{"kind":"string","value":"01ec85c4f909f8ceee2a72e78a412c3a"},"query":{"kind":"string","value":"parseKerning parses a string representing the additional X advance between two characters. The input string consists of one line per pair of characters. Each line starts with the two characters to adjust the spacing for. Those are followed by whitespace and a number. This is parsed into a javascript map (associative array) associating two character strings (the character pairs) with a numeric spacing."},"positive_passages":{"kind":"list like","value":[{"docid":"d38b552dd929e5eaab15a18c4815e2a3","score":"0.7181909","text":"function parseKerning(kerning) {\n var k = {};\n var re = /([-a-zA-Z0-9!@#$%^&*()_+={}|<>,./]{2}) +([0-9]+(.[0-9]*)?)/;\n var lines = kerning.split('\\n');\n for (var i = 0; i < lines.length; i++) {\n var line = lines[i];\n var m = line.match(re);\n if (m) {\n k[m[1]] = Number(m[2]);\n }\n }\n return k;\n}","title":""}],"string":"[\n {\n \"docid\": \"d38b552dd929e5eaab15a18c4815e2a3\",\n \"score\": \"0.7181909\",\n \"text\": \"function parseKerning(kerning) {\\n var k = {};\\n var re = /([-a-zA-Z0-9!@#$%^&*()_+={}|<>,./]{2}) +([0-9]+(.[0-9]*)?)/;\\n var lines = kerning.split('\\\\n');\\n for (var i = 0; i < lines.length; i++) {\\n var line = lines[i];\\n var m = line.match(re);\\n if (m) {\\n k[m[1]] = Number(m[2]);\\n }\\n }\\n return k;\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"5a3c493ccdb38366780bc881e319a712","score":"0.56152","text":"function parseKernTable(data, start) {\n var pairs = {};\n var p = new parse.Parser(data, start);\n var tableVersion = p.parseUShort();\n check.argument(tableVersion === 0, 'Unsupported kern table version.');\n // Skip nTables.\n p.skip('uShort', 1);\n var subTableVersion = p.parseUShort();\n check.argument(subTableVersion === 0, 'Unsupported kern sub-table version.');\n // Skip subTableLength, subTableCoverage\n p.skip('uShort', 2);\n var nPairs = p.parseUShort();\n // Skip searchRange, entrySelector, rangeShift.\n p.skip('uShort', 3);\n for (var i = 0; i < nPairs; i += 1) {\n var leftIndex = p.parseUShort();\n var rightIndex = p.parseUShort();\n var value = p.parseShort();\n pairs[leftIndex + ',' + rightIndex] = value;\n }\n\n return pairs;\n}","title":""},{"docid":"5a3c493ccdb38366780bc881e319a712","score":"0.56152","text":"function parseKernTable(data, start) {\n var pairs = {};\n var p = new parse.Parser(data, start);\n var tableVersion = p.parseUShort();\n check.argument(tableVersion === 0, 'Unsupported kern table version.');\n // Skip nTables.\n p.skip('uShort', 1);\n var subTableVersion = p.parseUShort();\n check.argument(subTableVersion === 0, 'Unsupported kern sub-table version.');\n // Skip subTableLength, subTableCoverage\n p.skip('uShort', 2);\n var nPairs = p.parseUShort();\n // Skip searchRange, entrySelector, rangeShift.\n p.skip('uShort', 3);\n for (var i = 0; i < nPairs; i += 1) {\n var leftIndex = p.parseUShort();\n var rightIndex = p.parseUShort();\n var value = p.parseShort();\n pairs[leftIndex + ',' + rightIndex] = value;\n }\n\n return pairs;\n}","title":""},{"docid":"89152d29d23139e7de6e94bd55fd1372","score":"0.54074496","text":"function step2() {\n const tmp = new Map();\n // iterate through all pairs, and then split. Create 2 new pairs and store in a map.\n // eg: if CB has 3 instances, then we increment CH and HB by 3\n for (let [pair, char] of rules.entries()) {\n let numOfPair = tracker.get(pair) || 0;\n\n let pairArr = pair.split(\"\");\n tmp.set(\n pairArr[0] + char,\n (tmp.get(pairArr[0] + char) || 0) + numOfPair\n );\n tmp.set(\n char + pairArr[1],\n (tmp.get(char + pairArr[1]) || 0) + numOfPair\n );\n }\n // set the tracker to our current iteration\n tracker = tmp;\n}","title":""},{"docid":"4f020a7638662a74d985b91f76ba57dc","score":"0.50971746","text":"function parseKernTable(data, start) {\n var p = new parse.Parser(data, start);\n var tableVersion = p.parseUShort();\n if (tableVersion === 0) {\n return parseWindowsKernTable(p);\n } else if (tableVersion === 1) {\n return parseMacKernTable(p);\n } else {\n throw new Error('Unsupported kern table version (' + tableVersion + ').');\n }\n}","title":""},{"docid":"4f020a7638662a74d985b91f76ba57dc","score":"0.50971746","text":"function parseKernTable(data, start) {\n var p = new parse.Parser(data, start);\n var tableVersion = p.parseUShort();\n if (tableVersion === 0) {\n return parseWindowsKernTable(p);\n } else if (tableVersion === 1) {\n return parseMacKernTable(p);\n } else {\n throw new Error('Unsupported kern table version (' + tableVersion + ').');\n }\n}","title":""},{"docid":"c496c1506dcce0141fcbc049a34fe559","score":"0.5077134","text":"function parseKernTable(data, start) {\n\t var p = new parse.Parser(data, start);\n\t var tableVersion = p.parseUShort();\n\t if (tableVersion === 0) {\n\t return parseWindowsKernTable(p);\n\t } else if (tableVersion === 1) {\n\t return parseMacKernTable(p);\n\t } else {\n\t throw new Error('Unsupported kern table version (' + tableVersion + ').');\n\t }\n\t}","title":""},{"docid":"04990018ddb86b65195b75cbce0c9424","score":"0.50674695","text":"function parseIntake(str){\n\n\t\t//var obj = new Object();\n\t\tvar intA, intB, intC, intD, intE, intF, ret;\n\n\t\t//declaring the object this way controls the order that the keys display in\n\t\tvar obj = {\n\t\t\tind: \"\",\n\t\t\talg: \"\",\n\t\t\tws: \"\",\n\t\t\tsub: \"\",\n\t\t\tqty: \"\",\n\t\t\tlen: 0,\n\t\t};\n\n\t\t//index\n\t\t//locate \"#\"\n\t\tintA = str.indexOf(\"#\") + 1;\n\t\t//if it exists, get all characters before and including it\n\t\tif(intA > 0){\n\t\t\tobj[\"ind\"] = str.substring(0, intA) + \" \";\n\t\t} else {\n\t\t\tobj[\"ind\"] = \"99# \";\n\t\t}\n\n\t\t//allergens\n\t\t//locate \"*\"\n\t\tintB = str.indexOf(\"*\");\n\t\t//if it exists, get string between it and the next \"*\"\n\t\tif(intB >= 0){\n\t\t\tintC = str.indexOf(\"*\", intB + 1) + 1;\n\t\t\tobj[\"alg\"] = str.substring(intB, intC) + \" \";\n\t\t}\n\n\t\t//whiteSpace \n\t\t//if there is an allergen, start from there\n\t\tif(intC >= 0){\n\t\t\t//strip beginning of string away from the alg\n\t\t\tstr = str.substring(intC);\n\t\t//otherwise use the index as the start of the string\n\t\t} else if(intA > 0){\n\t\t\tstr = str.substring(intA);\n\t\t}\n\t\t//with a stripped string, we can now search for the next non whitespace character\n\t\tintD = str.search(/\\S/);\n\t\tobj[\"ws\"] = str.substring(0, intD);\n\n\t\t//substance\n\t\tintE = str.indexOf(\":\") + 1;\n\t\tobj[\"sub\"] = str.substring(intD, intE) + \" \";\n\n\t\t//quantity\n\t\t//the replace() in this is equivalent to string.trim();\n\t\t//replace(/^[\\s\\uFEFF\\xA0]+|[\\s\\uFEFF\\xA0]+$/g, '')\n\t\tstr = str.substring(intE).trim(); \n\t\tif(str != \"\"){\n\t\t\tobj[\"qty\"] = str;\n\t\t}\n\n\t\tobj[\"len\"] = \tobj.ind.length + \n\t\t\t\t\t\tobj.alg.length + \n\t\t\t\t\t\tobj.sub.length;\n\n\t\treturn obj;\n\t\t}//parseIntake","title":""},{"docid":"e42d693c8149571d7d30856acc9e431e","score":"0.50226396","text":"function parserReal(str) {\n var out = {};\n var first = 0, second = 0, type = '';\n console.log(str.charAt(0));\n for (var i = 0; i < str.length; i ++) {\n if (!nums.includes(str.charAt(i))) {\n first = str.slice(0, i);\n second = str.slice(i + 1);\n type = str.charAt(i);\n //extra test for pro mode:\n if (first.length === 0) {\n first = beautify($('#result3').text());\n }\n }\n }\n out.x = first;\n out.y = second;\n out.type = type;\n return out;\n}","title":""},{"docid":"a0ea517c9456967b1c22af7bb423f607","score":"0.5002155","text":"function nsvg__parseNumber(/* const char */ s) {\n var it = \"\";\n var s_idx = 0;\n\n if (s[s_idx] === '-' || s[s_idx] === '+') {\n it += s[s_idx];\n s_idx++;\n }\n\n while (s[s_idx] && nsvg__isdigit(s[s_idx])) {\n it += s[s_idx];\n s_idx++;\n }\n\n if (s[s_idx] === '.') {\n it += s[s_idx];\n\n s_idx++;\n while (s[s_idx] && nsvg__isdigit(s[s_idx])) {\n it += s[s_idx];\n\n s_idx++;\n }\n }\n\n if (((s[s_idx]) === 'e') || ((s[s_idx]) === 'E')) {\n it += s[s_idx];\n\n s_idx++;\n if (((s[s_idx]) === '-') || ((s[s_idx]) === '+')) {\n it += s[s_idx];\n\n s_idx++;\n }\n\n while ((s[s_idx]) && nsvg__isdigit(s[s_idx])) {\n it += s[s_idx];\n\n s_idx++;\n }\n }\n\n return {s_idx : s_idx, it : it};\n}","title":""},{"docid":"6513e72a0af32aa12510782035ff4610","score":"0.497081","text":"function parseTiles(input) {\n return _.map(_.padEnd(input, 7, '.'), (tile) => {\n if (tile === '.') return 0;\n if (tile === '_') return 100;\n return tile.charCodeAt(0) - 'A'.charCodeAt(0) + 1;\n });\n}","title":""},{"docid":"02806a86b4606819018134dcf39d055a","score":"0.49621361","text":"function decoder(k, idx, string) {\r\n let tempString = ''\r\n let i = idx\r\n for (; i < string.length; i++) {\r\n const char = string[i]\r\n if (char === ']') {\r\n break\r\n } else if (char.charCodeAt() >= 48 && char.charCodeAt() <= 57) {\r\n let digit = char\r\n let j = i + 1\r\n while (string[j] !== '[') {\r\n digit += string[j]\r\n j++\r\n }\r\n digit = parseInt(digit)\r\n const recursion = decoder(digit, j + 1, string)\r\n i = recursion[0]\r\n tempString += recursion[1]\r\n } else {\r\n tempString += char\r\n }\r\n }\r\n const singleString = tempString\r\n while (k-- > 1) {\r\n tempString += singleString\r\n }\r\n return [i, tempString]\r\n}","title":""},{"docid":"b0dd33c6feb1e8615d2cad2f844a6b92","score":"0.48901242","text":"function parseWindowsKernTable(p) {\n\t var pairs = {};\n\t // Skip nTables.\n\t p.skip('uShort');\n\t var subtableVersion = p.parseUShort();\n\t check.argument(subtableVersion === 0, 'Unsupported kern sub-table version.');\n\t // Skip subtableLength, subtableCoverage\n\t p.skip('uShort', 2);\n\t var nPairs = p.parseUShort();\n\t // Skip searchRange, entrySelector, rangeShift.\n\t p.skip('uShort', 3);\n\t for (var i = 0; i < nPairs; i += 1) {\n\t var leftIndex = p.parseUShort();\n\t var rightIndex = p.parseUShort();\n\t var value = p.parseShort();\n\t pairs[leftIndex + ',' + rightIndex] = value;\n\t }\n\t return pairs;\n\t}","title":""},{"docid":"dac36a48377e647b96da7dca01575297","score":"0.48785636","text":"function spacingFromString(string) {\n if (!string || string == '')\n return null\n\n var spacing = {}\n\n var values = string.split(' ')\n\n // Check if first value is 'spacing'\n var spacingLayout = values[0]\n\n var layout = spacingLayout.slice(-1)\n if (layout == 'v' || layout == 'h') {\n // Spacing exists\n var space = spacingLayout.substring(0, spacingLayout.length - 1)\n\n log(1, 'Layout', layout)\n log(1, 'Spacing', space)\n\n if (parseFloat(space).toString() != space) {\n log(2, 'Spacing is invalid', string)\n return null\n }\n\n spacing.layout = layout\n spacing.space = space\n\n values.shift() // Remove the first element\n }\n\n var alignments = []\n var invalidAlignment = false\n values.forEach(function(value) {\n var alignment = simplifyAlignment(value)\n if (alignment) {\n alignments.push(alignment)\n } else if (value) {\n invalidAlignment = true\n return\n }\n })\n\n if (invalidAlignment) {\n log(2, 'Alignments is invalid', string)\n return null\n }\n\n if (alignments.length > 0) {\n spacing.align = alignments\n }\n\n return spacing\n}","title":""},{"docid":"4103d4c2695755c20062a26bd1c3d930","score":"0.4859974","text":"function parseWindowsKernTable(p) {\n var pairs = {};\n // Skip nTables.\n p.skip('uShort');\n var subtableVersion = p.parseUShort();\n check.argument(subtableVersion === 0, 'Unsupported kern sub-table version.');\n // Skip subtableLength, subtableCoverage\n p.skip('uShort', 2);\n var nPairs = p.parseUShort();\n // Skip searchRange, entrySelector, rangeShift.\n p.skip('uShort', 3);\n for (var i = 0; i < nPairs; i += 1) {\n var leftIndex = p.parseUShort();\n var rightIndex = p.parseUShort();\n var value = p.parseShort();\n pairs[leftIndex + ',' + rightIndex] = value;\n }\n return pairs;\n}","title":""},{"docid":"4103d4c2695755c20062a26bd1c3d930","score":"0.4859974","text":"function parseWindowsKernTable(p) {\n var pairs = {};\n // Skip nTables.\n p.skip('uShort');\n var subtableVersion = p.parseUShort();\n check.argument(subtableVersion === 0, 'Unsupported kern sub-table version.');\n // Skip subtableLength, subtableCoverage\n p.skip('uShort', 2);\n var nPairs = p.parseUShort();\n // Skip searchRange, entrySelector, rangeShift.\n p.skip('uShort', 3);\n for (var i = 0; i < nPairs; i += 1) {\n var leftIndex = p.parseUShort();\n var rightIndex = p.parseUShort();\n var value = p.parseShort();\n pairs[leftIndex + ',' + rightIndex] = value;\n }\n return pairs;\n}","title":""},{"docid":"7cfc3cdcdf1df632b10286fd79770776","score":"0.48318788","text":"function parseKVPs(data)\n{\n var result = {};\n while(true)\n {\n var kvp = data.match(/(\\w+):\\s*(\\d+)?/);\n if (!kvp)\n break;\n\n result[kvp[1].toUpperCase()] = parse(kvp[2]);\n data = data.replace(kvp[0], '');\n }\n return result;\n}","title":""},{"docid":"f019f1fb6b66627bde808650fb614a6f","score":"0.48287967","text":"drawLetterSpacing(text, x2, y2, isStroke = !1) {\n const letterSpacing = this._style.letterSpacing;\n let useExperimentalLetterSpacing = !1;\n if (TextMetrics.experimentalLetterSpacingSupported && (TextMetrics.experimentalLetterSpacing ? (this.context.letterSpacing = `${letterSpacing}px`, this.context.textLetterSpacing = `${letterSpacing}px`, useExperimentalLetterSpacing = !0) : (this.context.letterSpacing = \"0px\", this.context.textLetterSpacing = \"0px\")), letterSpacing === 0 || useExperimentalLetterSpacing) {\n isStroke ? this.context.strokeText(text, x2, y2) : this.context.fillText(text, x2, y2);\n return;\n }\n let currentPosition = x2;\n const stringArray = TextMetrics.graphemeSegmenter(text);\n let previousWidth = this.context.measureText(text).width, currentWidth = 0;\n for (let i2 = 0; i2 < stringArray.length; ++i2) {\n const currentChar = stringArray[i2];\n isStroke ? this.context.strokeText(currentChar, currentPosition, y2) : this.context.fillText(currentChar, currentPosition, y2);\n let textStr = \"\";\n for (let j2 = i2 + 1; j2 < stringArray.length; ++j2)\n textStr += stringArray[j2];\n currentWidth = this.context.measureText(textStr).width, currentPosition += previousWidth - currentWidth + letterSpacing, previousWidth = currentWidth;\n }\n }","title":""},{"docid":"4c5a942029d2e80e4160f758a0352262","score":"0.4773084","text":"function pre_spacing(letter,char){\n\t\tlet special = [];\t/// Marx [ 'p', 'g', 'y', 'f'];\t\tspace /= 4;\n\t\tlet space = spacingProp *letter.bounds.width/2;\n\n\t\t// if(special.includes(char))\t\t\tspace /= 4;\n\t\t\n\t\treturn space + spacingFixed;\n\t}","title":""},{"docid":"adf885b654a4bc9077488f8c9b88997c","score":"0.47728786","text":"characterNumberSymbol2(s) {\r\n let r = ''\r\n if (typeof s == 'string') {\r\n for (let i = 0; i < s.length; i++) {\r\n const e = s[i].toLowerCase()\r\n if (\r\n e == '0' ||\r\n e == '1' ||\r\n e == '2' ||\r\n e == '3' ||\r\n e == '4' ||\r\n e == '5' ||\r\n e == '6' ||\r\n e == '7' ||\r\n e == '8' ||\r\n e == '9' ||\r\n e == 'a' ||\r\n e == 'b' ||\r\n e == 'c' ||\r\n e == 'd' ||\r\n e == 'e' ||\r\n e == 'f' ||\r\n e == 'g' ||\r\n e == 'h' ||\r\n e == 'i' ||\r\n e == 'j' ||\r\n e == 'k' ||\r\n e == 'l' ||\r\n e == 'm' ||\r\n e == 'n' ||\r\n e == 'o' ||\r\n e == 'p' ||\r\n e == 'q' ||\r\n e == 'r' ||\r\n e == 's' ||\r\n e == 't' ||\r\n e == 'u' ||\r\n e == 'v' ||\r\n e == 'w' ||\r\n e == 'x' ||\r\n e == 'y' ||\r\n e == 'z' ||\r\n e == 'à' ||\r\n e == 'á' ||\r\n e == 'â' ||\r\n e == 'ã' ||\r\n e == 'è' ||\r\n e == 'é' ||\r\n e == 'ê' ||\r\n e == 'ì' ||\r\n e == 'í' ||\r\n e == 'î' ||\r\n e == 'ò' ||\r\n e == 'ó' ||\r\n e == 'ô' ||\r\n e == 'õ' ||\r\n e == 'ù' ||\r\n e == 'ú' ||\r\n e == 'û' ||\r\n e == 'ç' ||\r\n e == '!' ||\r\n e == '?' ||\r\n e == ',' ||\r\n e == '.' ||\r\n e == ':' ||\r\n e == ';' ||\r\n e == '@' ||\r\n e == '#' ||\r\n e == '$' ||\r\n e == '%' ||\r\n e == '&' ||\r\n e == '(' ||\r\n e == ')' ||\r\n e == '*' ||\r\n e == '-' ||\r\n e == '+' ||\r\n e == '/' ||\r\n e == '=' ||\r\n e == 'ª' ||\r\n e == 'º' ||\r\n e == '°' ||\r\n e == '¹' ||\r\n e == '²' ||\r\n e == '³' ||\r\n e == ' ' ||\r\n e == ' '\r\n ) {\r\n r += s[i]\r\n }\r\n }\r\n }\r\n return r.trim()\r\n }","title":""},{"docid":"44a7983572bf57142d0b1b0c6ab9bda5","score":"0.47478688","text":"function parseKalamineLayout(keyMap) {\n let rv = {};\n for (let xkb in keyMap) {\n rv[KEYNAMES[xkb]] = keyMap[xkb];\n }\n rv.IntlBackslash = rv.IntlBackslash || rv.Backslash;\n rv.IntlYen = rv.IntlYen || rv.Backslash;\n return rv;\n}","title":""},{"docid":"ae3c8afa9cc318f8f86b4d162d0fdd60","score":"0.47477174","text":"function parsePublicKeyComponents(text) {\n var textComponents = text.split('\\n');\n var keyComponents = {};\n // The component is the text after the identifier\n keyComponents.e = textComponents[textComponents.indexOf(\"e:\") + 1];\n keyComponents.n = textComponents[textComponents.indexOf(\"n:\") + 1];\n\n $('#rsa-decryption-key-e').val(keyComponents.e);\n $('#rsa-decryption-key-n').val(keyComponents.n);\n}","title":""},{"docid":"90c674733bd345c8125534db37041f9d","score":"0.47322538","text":"function getKerning(fntData, left, right) {\n\t var match = get$4(buildKerningHashMapKey(left, right), fntData[/* kerningMap */5]);\n\t if (match !== undefined) {\n\t return match;\n\t } else {\n\t return 0;\n\t }\n\t}","title":""},{"docid":"046f54691b0bb8290f0474a8edc9a477","score":"0.47133386","text":"function parsePublicKeyComponents(text) {\n var textComponents = text.split('\\n');\n var keyComponents = {};\n // The component is the text after the identifier\n keyComponents.e = textComponents[textComponents.indexOf(\"e:\") + 1];\n keyComponents.n = textComponents[textComponents.indexOf(\"n:\") + 1];\n\n $('#rsa-encryption-key-e').val(keyComponents.e);\n $('#rsa-encryption-key-n').val(keyComponents.n);\n}","title":""},{"docid":"70e96a19d1b80230e3c60623ba51ed81","score":"0.46978554","text":"function parse(text){\n text=text.replace(/\\uFFFC/g,'');// delete strange unicode chars //TODO would this cause a total typed char to be higher than total char?\n totalCharCount = count(text);\n totalWordCount = text.match(/\\S*/g).length/2; //TODO why need to divid by two?\n\n\n\n\n window.labels=0;\n\n // delete the regular text pragraphs but keep the example code\n text=text.replace(/\\`\\`\\r/g,'``marc');\n \n if( text.includes(\"``\")){\n\n try{\n text = text.match(/(``)([^`]+)(``)/g).join(' '); // deletes the text that is not in the actual exmaple\n text = \"``\"+text.replace(/\\`\\`/g,'')+\"``\"; // turns all examples into just one example\n }catch(e){};\n\n\n\n }else{\n \n text = '<div>'+text+'</div>';\n\n }\n\n\n\n \n original=text;\n return text;\n}","title":""},{"docid":"62b1864776467b67c0b6d1a41c59ecae","score":"0.46477008","text":"function _parseNumbers ( label )\n{\n if ( !label ) return []\n\n const nums = (\n label.split( /\\s+/ )\n .filter( function ( w ) { return w.match( /\\d/ ) } )\n .map( function ( l ) { return l.toLowerCase() } )\n )\n\n const results = []\n\n nums.forEach( function ( n ) {\n const m = n.match( /[-]?\\d+(\\.\\d+)?/ )\n if ( m && m[ 0 ] ) {} else { return }\n let num = Number( m[ 0 ] )\n\n const THOUSAND = 1000\n const MILLION = THOUSAND * THOUSAND\n\n if ( n.indexOf( 'm' ) >= 0 ) num = MILLION * num\n if ( n.indexOf( 'k' ) >= 0 ) num = THOUSAND * num\n\n results.push(num)\n } )\n\n return results\n}","title":""},{"docid":"be7c3c7441a691658ac9fe79c49d9e48","score":"0.4645228","text":"function parsePrivateKeyComponents(text) {\n var textComponents = text.split('\\n');\n var keyComponents = {};\n // The component is the text after the identifier\n keyComponents.p = textComponents[textComponents.indexOf(\"p:\") + 1];\n keyComponents.q = textComponents[textComponents.indexOf(\"q:\") + 1];\n keyComponents.d = textComponents[textComponents.indexOf(\"d:\") + 1];\n\n $('#rsa-encryption-key-p').val(keyComponents.p);\n $('#rsa-encryption-key-q').val(keyComponents.q);\n $('#rsa-encryption-key-d').val(keyComponents.d);\n}","title":""},{"docid":"0d13e93e165c07cb7166c195e7da925b","score":"0.4636611","text":"function HKern (oa) {\n\t\tthis.objtype = 'hkern';\n\n\t\tthis.leftgroup = oa.leftgroup || [];\n\t\tthis.rightgroup = oa.rightgroup || [];\n\n\t\t// Positive values reduce space between chars\n\t\tthis.value = oa.value || 0;\n\t}","title":""},{"docid":"897e6f004ce8a740796a26addc5e4db6","score":"0.46319956","text":"function pairElement(str) {\n var letters = str.split(\"\");\n var pairsArray = [];\n var pairs = {\n \"A\": \"T\",\n \"T\": \"A\",\n \"C\": \"G\",\n \"G\": \"C\"\n }\n\n for (var key of letters) {\n pairsArray.push([key, pairs[key]]);\n }\n return pairsArray;\n}","title":""},{"docid":"a2b02d3bd1a2c97f54b6bcd95524cefb","score":"0.46217036","text":"scanKings(fen) {\n this.kingPos = { w: [-1, -1], b: [-1, -1] };\n const rows = V.ParseFen(fen).position.split(\"/\");\n for (let i = 0; i < rows.length; i++) {\n let k = 0; //column index on board\n for (let j = 0; j < rows[i].length; j++) {\n const piece = rows[i].charAt(j);\n if (['j','k','l'].includes(piece.toLowerCase())) {\n const color = (piece.charCodeAt(0) <= 90 ? 'w' : 'b');\n this.kingPos[color] = [i, k];\n }\n else {\n const num = parseInt(rows[i].charAt(j), 10);\n if (!isNaN(num)) k += num - 1;\n }\n k++;\n }\n }\n }","title":""},{"docid":"fe7c3be062ed3e96441a90590c48881d","score":"0.46145907","text":"function KthSymmbolInGrammar(N, K) {\n let row = generateRow(N);\n let kthSymbol = row.charAt(K-1);\n console.log(parseInt(kthSymbol));\n return parseInt(kthSymbol);\n}","title":""},{"docid":"4398607c56d65f4188a89585cba8f070","score":"0.46121004","text":"function stringToKeyValue(it) {\n var _a = it.split(\":\"), key = _a[0], val = _a[1];\n return val ? new NgStyleKeyValue(key, val) : null;\n}","title":""},{"docid":"57d4029202cb08937645580ad6301010","score":"0.45973182","text":"function convertTxt($txt) {\n//need a loop to check surrounding characters to see what the symbol will be.\n$wordPairs = []; //list of words in the sentance\n$charPairs = []; // final product of broken char pairs\n\n$consonants = [\n\"s\",\"d\",\n\"f\",\"g\",\n\"h\",\"j\",\n\"k\",\"l\",\n\"m\",\"n\",\n\"b\",\"v\",\n\"c\",\"x\",\n\"z\",\"q\",\n\"w\",\"r\",\n\"t\",\"y\",\n\"p\"];\n\n$vowels = [\n'a',\n'i',\n'u'];\n\n$numbers = [\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"0\"];\n$numberSubmit = 0;\n$txt = $txt.toLowerCase();\n$txt = $txt.split(\" \");\n//first [] finds the word second [] is a character.\n// use for loops to then pair the chars and append them to the loop.\n//return $txt[0][0]; //loop through this split. word by word and char by char\n\n for($i = 0; $i < $txt.length;$i++){\n $wordPairs.push($txt[$i]);\n for($j = 0; $j < $wordPairs[$i].length;$j++){\n\n//if $numbers\n if ($numbers.includes($wordPairs[$i][$j])) {\n $x = $j;\n //find how many chars are numbers in this instance\n while ($numbers.includes($wordPairs[$i][$x])) {\n $x++;\n }\n //console.log($x);\n for ($h = 0; $h < $x; $h++) {\n $numberSubmit += $wordPairs[$i][$j+$h];\n }\n //!!!!!!!!!!!!!must break this found number into its smaller components !!!!!!!!!!!!!!!!!!!!!!!\n console.log(Number($numberSubmit));\n if ($numberSubmit == 0) { // if 0 return 0\n $charPairs.push(\"0\");\n } else {\n $numberSubmit = Math.round($numberSubmit);\n for ($selectNum = 624; $selectNum >= 1; $selectNum -=156) {\n if ($numberSubmit >= $selectNum) {\n $times = $numberSubmit / $selectNum; //number of times this number can fit inside the select num\n while ($times >= 1) {\n $charPairs.push(String($selectNum));\n $times --\n }\n $numberSubmit = $times * $selectNum; //whatever is left over is magnified and moved on to the next smallest number\n if ($numberSubmit >= 0.9999999999999991 && $numberSubmit < 1) { //catch stupid calculation error\n $numberSubmit = 1;\n }\n console.log(\"Large round check: \"+$numberSubmit);\n }\n }\n\n\n //groups of 144\n // no idea what the picture will be yet\n\n //groups of 12\n // numbers 12 - 144. This is because there are 3 pillars so 48*3 |||\n $numberSubmit = Math.round($numberSubmit);\n for ($selectNum = 48; $selectNum >= 1; $selectNum -=12) {\n if ($numberSubmit >= $selectNum) {\n $times = $numberSubmit / $selectNum; //number of times this number can fit inside the select num\n while ($times >= 1) {\n $charPairs.push(String($selectNum));\n $times --\n }\n $numberSubmit = $times * $selectNum; //whatever is left over is magnified and moved on to the next smallest number\n if ($numberSubmit >= 0.9 && $numberSubmit < 1) { //catch stupid calculation error\n $numberSubmit = 1;\n }\n console.log(\"Med round check: \"+ $numberSubmit);\n }\n }\n\n //individual numbers 1-11\n $numberSubmit = Math.round($numberSubmit);\n for ($selectNum = 11; $selectNum >= 1; $selectNum --) {\n if ($numberSubmit >= $selectNum) {\n $times = $numberSubmit / $selectNum; //number of times this number can fit inside the select num\n while ($times >= 1) {\n $charPairs.push(String($selectNum));\n $times --\n }\n $numberSubmit = $times * $selectNum; //whatever is left over is magnified and moved on to the next smallest number\n console.log(\"Small round check: \"+ Math.ceil($numberSubmit));\n }\n }\n }\n\n //$charPairs.push($numberSubmit);\n $j+=$x-1 //once found all numbers for this set go to the last char of this set so the loop can start at the next set\n //console.log($charPairs); //check that logs the number to convert\n }\n//find out if eth is cv or c. no need for th find or t and h yet as e is never used except for this instance.\n else if ($wordPairs[$i][$j] == \"e\" && $wordPairs[$i][$j+1] == \"t\" && $wordPairs[$i][$j+2] == \"h\"){\n if (($consonants.includes($wordPairs[$i][$j-1]) && $vowels.includes($wordPairs[$i][$j+3])) || ($wordPairs[$i][$j-1] == null && $vowels.includes($wordPairs[$i][$j+3]))) { //consonant befor or null it is cv\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2] + $wordPairs[$i][$j+3]);\n $j+=3;\n } else { //it is just a normal c\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2]);\n $j+=2;\n }\n }\n\n // ny pairs\n else if ($wordPairs[$i][$j] == \"n\" && $wordPairs[$i][$j+1] == \"y\"){ // must find out if the s could be a sh\n //if vowel before, then consonant after (anyta), write th\n if (($vowels.includes($wordPairs[$i][$j-1]) && $vowels.includes($wordPairs[$i][$j+3])) || ($consonants.includes($wordPairs[$i][$j+2])) || $wordPairs[$i][$j+2] == null ) {\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1]);\n $j++;\n }\n // if vowel after th and consonant before write tha\n else if (($vowels.includes($wordPairs[$i][$j+2]) && $consonants.includes($wordPairs[$i][$j-1])) || ($vowels.includes($wordPairs[$i][$j+2]) && $wordPairs[$i][$j-1] == null) ){\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2]);\n $j+=2;\n } else {\n $charPairs.push($wordPairs[$i][$j]);\n }\n\n }\n\n // ly pairs\n else if ($wordPairs[$i][$j] == \"l\" && $wordPairs[$i][$j+1] == \"y\"){ // must find out if the s could be a sh\n //if vowel before, then consonant after (ashta), write th\n if (($vowels.includes($wordPairs[$i][$j-1]) && $vowels.includes($wordPairs[$i][$j+3])) || ($consonants.includes($wordPairs[$i][$j+2])) || $wordPairs[$i][$j+2] == null ) {\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1]);\n $j++;\n\n }\n // if vowel after th and consonant before write tha\n else if (($vowels.includes($wordPairs[$i][$j+2]) && $consonants.includes($wordPairs[$i][$j-1])) || ($vowels.includes($wordPairs[$i][$j+2]) && $wordPairs[$i][$j-1] == null) ){\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2]);\n $j+=2;\n } else {\n $charPairs.push($wordPairs[$i][$j]);\n }\n\n }\n\n// find th pairs\n else if ($wordPairs[$i][$j] == \"t\" && $wordPairs[$i][$j+1] == \"h\"){ // must find out if the s could be a sh\n //if vowel before, then consonant after (ashta), write th\n if (($vowels.includes($wordPairs[$i][$j-1]) && $vowels.includes($wordPairs[$i][$j+3])) || ($consonants.includes($wordPairs[$i][$j+2])) || $wordPairs[$i][$j+2] == null ) {\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1]);\n $j++;\n\n }\n // if vowel after th and consonant before write tha\n else if (($vowels.includes($wordPairs[$i][$j+2]) && $consonants.includes($wordPairs[$i][$j-1])) || ($vowels.includes($wordPairs[$i][$j+2]) && $wordPairs[$i][$j-1] == null) ){\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2]);\n $j+=2;\n } else {\n $charPairs.push($wordPairs[$i][$j]);\n }\n\n }\n\n else if ($wordPairs[$i][$j] == \"s\" && $wordPairs[$i][$j+1] == \"h\"){ // must find out if the s could be a sh\n//if vowel before, then consonant after (ashta), write sh\n if (($vowels.includes($wordPairs[$i][$j-1]) && $vowels.includes($wordPairs[$i][$j+3])) || ($consonants.includes($wordPairs[$i][$j+2])) || $wordPairs[$i][$j+2] == null ) {\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1]);\n $j++;\n\n }\n// if vowel after sh and consonant before write sha\n else if (($vowels.includes($wordPairs[$i][$j+2]) && $consonants.includes($wordPairs[$i][$j-1])) || ($vowels.includes($wordPairs[$i][$j+2]) && $wordPairs[$i][$j-1] == null) ){\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2]);\n $j+=2;\n } else {\n $charPairs.push($wordPairs[$i][$j]);\n }\n\n }\n// if normal cv pair and dosn't mach above statements push it\n else if ($consonants.includes($wordPairs[$i][$j]) && $vowels.includes($wordPairs[$i][$j+1])){\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1]);\n $j+=1;\n\n// if do not match anything else it must be a singal char cv \"(c)\" cv\n } else {\n $charPairs.push($wordPairs[$i][$j]);\n }\n }\n//when a word is finished push a space\n $charPairs.push(\" \");\n }\n\n//return an array with the final pairs in order of their final sets \"shasfi\" = [sha, s, fi]\n//console.log($charPairs);\ntranslateTxt($charPairs);\n}","title":""},{"docid":"563de1d982953cf16c752c9fa85d9cdc","score":"0.4590856","text":"function entryTime(s, keypad) {\n let keys = keypad.toString().split('');\n s = s.toString();\n let map = {};\n map[keys[0]] = [0,0]\n map[keys[1]] = [0,1]\n map[keys[2]] = [0,2]\n map[keys[3]] = [1,0]\n map[keys[4]] = [1,1]\n map[keys[5]] = [1,2]\n map[keys[6]] = [2,0]\n map[keys[7]] = [2,1]\n map[keys[8]] = [2,2]\n\n\n let result = 0;\n let position = map[s[0]];\n\n for (let i = 1, len = s.toString().length; i < len; i++){\n let num = s[i]\n let newPos = map[num];\n let posXChange = Math.abs(position[0]-newPos[0]);\n let posYChange = Math.abs(position[1]-newPos[1]);\n if (posXChange === 1 && posYChange === 1) {\n result += 1;\n } else if (posXChange >= 1 && posYChange >= 1) {\n result += 2;\n }else {\n result += posXChange + posYChange;\n }\n\n position = newPos;\n }\n\n return result;\n}","title":""},{"docid":"77e970d8635b7247cdcf4ad4d9a45fe8","score":"0.45790222","text":"function processInput(str) {\n const normalized = str.normalize('NFKC');\n return separator + normalized.replace(/ /g, separator);\n} // The first tokens are reserved for unk, control symbols, and user-defined","title":""},{"docid":"5d05e29c9684ab1f3b27dfa59a1cf244","score":"0.4576289","text":"function parsePrivateKeyComponents(text) {\n var textComponents = text.split('\\n');\n var keyComponents = {};\n // The component is the text after the identifier\n keyComponents.p = textComponents[textComponents.indexOf(\"p:\") + 1];\n keyComponents.q = textComponents[textComponents.indexOf(\"q:\") + 1];\n keyComponents.d = textComponents[textComponents.indexOf(\"d:\") + 1];\n\n $('#rsa-decryption-key-p').val(keyComponents.p);\n $('#rsa-decryption-key-q').val(keyComponents.q);\n $('#rsa-decryption-key-d').val(keyComponents.d);\n}","title":""},{"docid":"d4d1726eccc390a6b1facbef353ea399","score":"0.45721382","text":"function charAtNum(str) {\n const obj = {};\n const lowerStr = str.toLowerCase().replace(/ /g, \"\");\n //console.log(lowerStr)\n for (const key of lowerStr) {\n console.log(obj[key])\n obj[key] = (obj[key])+ 1 || 1;\n // obj[key] = obj[key] >0 ? obj[key]+1: 1;\n console.log(obj[key] + \"end\")\n }\n return obj;\n}","title":""},{"docid":"d6c55d853b9a3446c9e1411cbd8d3ecb","score":"0.45553306","text":"function normalize_position(string,position){if(position===0){return position;}string=$.terminal.strip(string);var result=$.terminal.split_characters(string).reduce(function(acc,chr){if(typeof acc==='number'){return acc;}var length=acc.length+char_len(chr);if(length>=position){return acc.position+1;}return{position:acc.position+1,length:length};},{position:0,length:0});if(typeof result==='number'){return result;}else{return result.position;}}// -------------------------------------------------------------------------","title":""},{"docid":"113e895931de7d503b15facae2d9cc08","score":"0.45546922","text":"function parseKeyString(str) {\n var idx = 0;\n var keys = [];\n while (idx < str.length) {\n if (str.charAt(idx) != '<') {\n keys.push(str.charAt(idx));\n idx++;\n continue;\n }\n // Vim key notation here means desktop Vim key-notation.\n // See :help key-notation in desktop Vim.\n var vimKeyNotationStart = ++idx;\n while (str.charAt(idx++) != '>') {}\n var vimKeyNotation = str.substring(vimKeyNotationStart, idx - 1);\n var mod='';\n var match = (/^C-(.+)$/).exec(vimKeyNotation);\n if (match) {\n mod='Ctrl-';\n vimKeyNotation=match[1];\n }\n var key;\n switch (vimKeyNotation) {\n case 'BS':\n key = 'Backspace';\n break;\n case 'CR':\n key = 'Enter';\n break;\n case 'Del':\n key = 'Delete';\n break;\n default:\n key = vimKeyNotation;\n break;\n }\n keys.push(mod + key);\n }\n return keys;\n }","title":""},{"docid":"463d400d53e49abc5461ec3674a15e3a","score":"0.45489246","text":"function sol(s) {\n let odds = 0;\n let map = {};\n const res = [];\n for (let c of s) {\n map[c] = map[c] + 1 || 1;\n if (map[c] % 2 !== 0) {\n odds++;\n } else {\n odds--;\n }\n }\n\n if (odds > 1) return res;\n let temp = \"\";\n // place odd numbered char in center\n for (let c in map) {\n if (map[c] % 2 !== 0) {\n temp += c;\n map[c]--;\n break;\n }\n }\n\n helper(temp);\n return res;\n\n function helper(cur) {\n if (cur.length === s.length) {\n res.push(cur);\n return;\n }\n\n for (let c in map) {\n if (map[c] >= 2) {\n let temp = cur;\n cur = c + cur + c;\n map[c] -= 2;\n helper(cur);\n map[c] += 2;\n cur = temp;\n } else if (map[c] === 1) {\n let a = cur.substring(0, Math.floor(cur.length));\n let b = cur.substring(Math.floor(cur.length) + 1);\n map[c]--;\n helper(a + c + b);\n }\n }\n }\n\n // function helper(cur = \"\") {\n // if (cur.length === s.length) {\n // res.push(cur);\n // return;\n // }\n\n // for (let c in map) {\n // if (map[c] >= 2) {\n // let temp = cur;\n // cur = c + cur + c;\n // map[c] -= 2;\n // helper(cur);\n // map[c] += 2;\n // cur = temp;\n // } else if (map[c] === 1) {\n // let a = cur.substring(0, Math.floor(cur.length / 2));\n // let b = cur.substring(Math.floor(cur.length / 2) + 1);\n // map[c]--;\n // helper(a + c + b);\n // }\n // }\n // }\n}","title":""},{"docid":"81bea44fea1fb4ffae2a16bc41698edd","score":"0.4532225","text":"function numericals(s){\n let obj = {};\n return s.split('').map(char => obj[char] = ++obj[char] || 1).join('');\n}","title":""},{"docid":"9890dae0f4f682601b5b06e4af81c895","score":"0.4518334","text":"static CtoK(c) {\n return c + 273\n }","title":""},{"docid":"6f7c0713ac6865c0aea1aba34293d422","score":"0.44859764","text":"function pairElement(str) {\n let pairs = {\n A: 'T',\n T: 'A',\n G: 'C',\n C: 'G',\n }\n\n\n let letters = str.split('');\n console.log(letters);\n\n let result = letters.map(letter => {\n let pair = [letter, pairs[letter]];\n\n\n return pair;\n })\n\n\n return result;\n}","title":""},{"docid":"e9b34ac492e03daef8b9df6ad8f542e6","score":"0.44851574","text":"function indentation(value) {\n var index = 0;\n var indent = 0;\n var character = value.charAt(index);\n var stops = {};\n var size;\n\n while (character in characters) {\n size = characters[character];\n\n indent += size;\n\n if (size > 1) {\n indent = Math.floor(indent / size) * size;\n }\n\n stops[indent] = index;\n\n character = value.charAt(++index);\n }\n\n return {indent: indent, stops: stops};\n}","title":""},{"docid":"e9b34ac492e03daef8b9df6ad8f542e6","score":"0.44851574","text":"function indentation(value) {\n var index = 0;\n var indent = 0;\n var character = value.charAt(index);\n var stops = {};\n var size;\n\n while (character in characters) {\n size = characters[character];\n\n indent += size;\n\n if (size > 1) {\n indent = Math.floor(indent / size) * size;\n }\n\n stops[indent] = index;\n\n character = value.charAt(++index);\n }\n\n return {indent: indent, stops: stops};\n}","title":""},{"docid":"e9b34ac492e03daef8b9df6ad8f542e6","score":"0.44851574","text":"function indentation(value) {\n var index = 0;\n var indent = 0;\n var character = value.charAt(index);\n var stops = {};\n var size;\n\n while (character in characters) {\n size = characters[character];\n\n indent += size;\n\n if (size > 1) {\n indent = Math.floor(indent / size) * size;\n }\n\n stops[indent] = index;\n\n character = value.charAt(++index);\n }\n\n return {indent: indent, stops: stops};\n}","title":""},{"docid":"e9b34ac492e03daef8b9df6ad8f542e6","score":"0.44851574","text":"function indentation(value) {\n var index = 0;\n var indent = 0;\n var character = value.charAt(index);\n var stops = {};\n var size;\n\n while (character in characters) {\n size = characters[character];\n\n indent += size;\n\n if (size > 1) {\n indent = Math.floor(indent / size) * size;\n }\n\n stops[indent] = index;\n\n character = value.charAt(++index);\n }\n\n return {indent: indent, stops: stops};\n}","title":""},{"docid":"e9b34ac492e03daef8b9df6ad8f542e6","score":"0.44851574","text":"function indentation(value) {\n var index = 0;\n var indent = 0;\n var character = value.charAt(index);\n var stops = {};\n var size;\n\n while (character in characters) {\n size = characters[character];\n\n indent += size;\n\n if (size > 1) {\n indent = Math.floor(indent / size) * size;\n }\n\n stops[indent] = index;\n\n character = value.charAt(++index);\n }\n\n return {indent: indent, stops: stops};\n}","title":""},{"docid":"33b976a44e358e020f95a4771906662b","score":"0.44777694","text":"function k(t){var i,o,s,f=_,k=b;if(\"c\"===y)k=w(t)+k,t=\"\";else{\n// Perform the initial formatting.\nvar M=(t=+t)<0;\n// Break the formatted value into the integer “value” part that can be\n// grouped, and fractional or exponential “suffix” part that is not.\nif(t=isNaN(t)?l:w(Math.abs(t),m),\n// Trim insignificant zeros.\nv&&(t=\n// Trims insignificant zeros, e.g., replaces 1.2000k with 1.2k.\nfunction(t){t:for(var n,e=t.length,r=1,i=-1;r<e;++r)switch(t[r]){case\".\":i=n=r;break;case\"0\":0===i&&(i=r),n=r;break;default:if(i>0){if(!+t[r])break t;i=0}}return i>0?t.slice(0,i)+t.slice(n+1):t}(t)),\n// If a negative value rounds to zero during formatting, treat as positive.\nM&&0==+t&&(M=!1),\n// Compute the prefix and suffix.\nf=(M?\"(\"===h?h:c:\"-\"===h||\"(\"===h?\"\":h)+f,k=(\"s\"===y?we[8+le/3]:\"\")+k+(M&&\"(\"===h?\")\":\"\"),x)for(i=-1,o=t.length;++i<o;)if(48>(s=t.charCodeAt(i))||s>57){k=(46===s?a+t.slice(i+1):t.slice(i))+k,t=t.slice(0,i);break}}\n// If the fill character is not \"0\", grouping is applied before padding.\ng&&!p&&(t=r(t,1/0));\n// Compute the padding.\nvar A=f.length+t.length+k.length,z=A<d?new Array(d-A+1).join(n):\"\";\n// If the fill character is \"0\", grouping is applied after padding.\n// Reconstruct the final output based on the desired alignment.\nswitch(g&&p&&(t=r(z+t,z.length?d-k.length:1/0),z=\"\"),e){case\"<\":t=f+t+k+z;break;case\"=\":t=f+z+t+k;break;case\"^\":t=z.slice(0,A=z.length>>1)+f+t+k+z.slice(A);break;default:t=z+f+t+k}return u(t)}","title":""},{"docid":"480bf17f842bb0ca929242325fef0b5a","score":"0.44726843","text":"function extractMKSCDG(s) {\n\n var regex = /^(\\w*\\s\\s)([-+]?[0-9]*\\.*[0-9]*[eE]*[-+]*[0-9]*)/;\n return x.strToNum(regex.exec(s), 2);\n}","title":""},{"docid":"4595a6547060fb37bf83bf03e8b07fb9","score":"0.44718084","text":"function indentation(value) {\n\t var index = 0;\n\t var indent = 0;\n\t var character = value.charAt(index);\n\t var stops = {};\n\t var size;\n\t\n\t while (character in characters) {\n\t size = characters[character];\n\t\n\t indent += size;\n\t\n\t if (size > 1) {\n\t indent = Math.floor(indent / size) * size;\n\t }\n\t\n\t stops[indent] = index;\n\t\n\t character = value.charAt(++index);\n\t }\n\t\n\t return {indent: indent, stops: stops};\n\t}","title":""},{"docid":"e433fd582e97955342ca8078f39a83dc","score":"0.44603226","text":"characterNumberSymbol(s) {\r\n let r = ''\r\n if (typeof s == 'string') {\r\n for (let i = 0; i < s.length; i++) {\r\n const e = s[i].toLowerCase()\r\n if (\r\n e == '0' ||\r\n e == '1' ||\r\n e == '2' ||\r\n e == '3' ||\r\n e == '4' ||\r\n e == '5' ||\r\n e == '6' ||\r\n e == '7' ||\r\n e == '8' ||\r\n e == '9' ||\r\n e == 'a' ||\r\n e == 'b' ||\r\n e == 'c' ||\r\n e == 'd' ||\r\n e == 'e' ||\r\n e == 'f' ||\r\n e == 'g' ||\r\n e == 'h' ||\r\n e == 'i' ||\r\n e == 'j' ||\r\n e == 'k' ||\r\n e == 'l' ||\r\n e == 'm' ||\r\n e == 'n' ||\r\n e == 'o' ||\r\n e == 'p' ||\r\n e == 'q' ||\r\n e == 'r' ||\r\n e == 's' ||\r\n e == 't' ||\r\n e == 'u' ||\r\n e == 'v' ||\r\n e == 'w' ||\r\n e == 'x' ||\r\n e == 'y' ||\r\n e == 'z' ||\r\n e == 'à' ||\r\n e == 'á' ||\r\n e == 'â' ||\r\n e == 'ã' ||\r\n e == 'è' ||\r\n e == 'é' ||\r\n e == 'ê' ||\r\n e == 'ì' ||\r\n e == 'í' ||\r\n e == 'î' ||\r\n e == 'ò' ||\r\n e == 'ó' ||\r\n e == 'ô' ||\r\n e == 'õ' ||\r\n e == 'ù' ||\r\n e == 'ú' ||\r\n e == 'û' ||\r\n e == 'ç' ||\r\n e == '!' ||\r\n e == '?' ||\r\n e == ',' ||\r\n e == '.' ||\r\n e == ':' ||\r\n e == ';' ||\r\n e == '@' ||\r\n e == '#' ||\r\n e == '$' ||\r\n e == '%' ||\r\n e == '&' ||\r\n e == '(' ||\r\n e == ')' ||\r\n e == '{' ||\r\n e == '}' ||\r\n e == '[' ||\r\n e == ']' ||\r\n e == '*' ||\r\n e == '-' ||\r\n e == '+' ||\r\n e == '/' ||\r\n e == '=' ||\r\n e == '_' ||\r\n e == 'ª' ||\r\n e == 'º' ||\r\n e == '°' ||\r\n e == '¹' ||\r\n e == '²' ||\r\n e == '³' ||\r\n e == '\"' ||\r\n e == \"'\" ||\r\n e == '|' ||\r\n e == ' ' ||\r\n e == ' '\r\n ) {\r\n r += s[i]\r\n }\r\n }\r\n }\r\n return r.trim()\r\n }","title":""},{"docid":"8316b00c332b1347a943cbd75bb3dd4c","score":"0.44531065","text":"function lineParser(linedata)\n{\n var outline = '';\n \n var gcode = '';\n linedata = linedata.trim();\n if (linedata != '')\n {\n var codeLetter = linedata.substr(0,1);\n \n switch (codeLetter)\n {\n case '%':\n inHeader = false; //Exit Header\n break;\n case 'M':\n var mcode = parseInt(parseCodeValue(linedata));\n \n switch (mcode)\n {\n case (30):\n outline = '\\n( --------- PROGRAM END --------- )\\n';\n outline += lnum() + 'M5 (Spindle Stop)\\n';\n outline += lnum() + 'M9 (Coolant Off)\\n';\n outline += lnum() + 'G30 (Go Home)\\n';\n outline += lnum() + 'M30 (END)\\n';\n break;\n case (48):\n inHeader = true; //\"in header mode\"\n outline = '( --------------------------------------------------------)\\n';\n outline += '( -- EXCELLON TO GCODE CONVERTER - kdupreez@hotmail.com --)\\n';\n outline += '( --------------------------------------------------------)\\n';\n outline += lnum() + 'G90 G54 G64 G50 G17 G40 G80 G94 G91.1 G49\\n';\n outline += lnum() + 'G30\\n';\n \n console.log('\\tGenerating GCode Header...');\n\n break;\n case (71): //M71 = METRIC \n outline = lnum() + 'G21 (METRIC)\\n\\n';\n console.log('\\tSetting units to Metric (mm)...');\n break;\n case (72): //M72 = INCHES\n outline = lnum() + 'G20 (INCHES)\\n\\n';\n console.log('\\tSetting units to Inches...');\n break;\n default:\n outline = '(-- Unknown MCode: ' + linedata + ')\\n';\n }\n break;\n case 'T':\n if (!inHeader)\n {\n toolNumber = parseInt(parseCodeValue(linedata));\n outline = '\\n( --------- DRILL T' + toolNumber + ' --------- )\\n';\n outline += lnum() + 'M5 (Spindle Stop)\\n';\n outline += lnum() + 'M9 (Coolant Off)\\n';\n outline += lnum() + 'G30 (Go Home)\\n';\n outline += lnum() + 'T' + toolNumber + ' G43 H' + toolNumber + ' M6 (Tool Change)\\n'; // tool change with offset\n outline += lnum() + 'S' + spindleSpeed +' M3 (Spindle Start)\\n'; //Set Splinde Speed - Forward Rotation\n outline += lnum() + 'G54\\n'; //Work Coordinate System\n \n newDrillCycle = true;\n \n console.log('\\tConverting drill cycle for Tool ' + toolNumber);\n\n }\n else\n {\n var strTool = parseCodeValue(linedata);\n var strDiameter = parseCodeValue(linedata.substr(strTool.length+1));\n outline = '(T:' + strTool +' Diameter: ' + strDiameter + ' )\\n';\n console.log('\\tFound Tool: ' + strTool +' with diameter: ' + strDiameter);\n\n }\n break;\n case 'X':\n case 'Y':\n if (!inHeader)\n {\n var strX = parseCodeValue(linedata);\n var strY = parseCodeValue(linedata.substr(strX.length+1));\n var fX = parseInt(strX) / 100000.0;\n var fY = parseInt(strY) / 100000.0;\n \n if (newDrillCycle)\n {\n outline = lnum() + 'G0 X' + fX + ' Y' + fY + '\\n';\n outline += lnum() + 'G0 Z' + zSafeHeight +'\\n'; // Feed Height..\n outline += lnum() + 'G0 Z' + zFeedHeight +'\\n'; // Feed Height..\n //G98: Return to Initial Z plane after canned cycle\n //G81: Simple drilling cycle\n //F3.: Feed Rate\n //Canned cycle retract = 0.2\n //Canned cycle will retract to R-Plane = 0.2\n //Hole Bottom: X Y Z = Hole depth\n outline += lnum() + 'G98 G81 X' + fX + ' Y' + fY + ' Z' + zHoleBottom + ' R' + zFeedHeight + ' F' + feedRate + '.\\n'; \n newDrillCycle = false;\n }\n else\n {\n outline = lnum() + 'X' + fX + ' Y' + fY + '\\n';\n }\n }\n break;\n default:\n outline = '; Unknown Code: ' + linedata;\n break;\n }\n }\n\n return outline;\n}","title":""},{"docid":"5c8fa533cd78e0ebd1609bc7fa0e3573","score":"0.44345838","text":"function code_point_from_surrogate_pair (s) {\n var high_offset = s.charCodeAt(0) - HIGH_SURROGATE_START\n var low_offset = s.charCodeAt(1) - LOW_SURROGATE_START\n\n return (high_offset << 10) + low_offset + 0x10000\n}","title":""},{"docid":"17b60a62dcbe3770ccd33c14490558e1","score":"0.4421636","text":"function scale(strng, k, n) {\n let l;\n return (l = strng\n .split(\"\\n\")\n .map(w => w\n .split(\"\")\n .map(v => v.repeat(k))\n .join(\"\")\n )\n .map(r => r ? (r+\"\\n\").repeat(n) : \"\")\n .join(\"\")\n ).substr(0,l.length-1)\n}","title":""},{"docid":"7bd39fb9b3acd48737d18bf783911715","score":"0.44142887","text":"function parseInput(inputText) {\n let line = -1;\n return inputText\n .trim()\n .split(\"\\n\")\n .map((instruc) => {\n const obj = instruc.split(\" \");\n line += 1;\n return {\n operation: obj[0],\n argument: parseInt(obj[1].substring(1)),\n sign: obj[1].substring(0, 1),\n full: instruc,\n executed: false,\n line: line,\n };\n });\n}","title":""},{"docid":"de8feebdcfb88061574f729f1685965f","score":"0.44140798","text":"function parseInput(inputText) {\n return inputText\n .trim()\n .split('\\n')\n .map(line => {\n const [instruction, valueText] = line.split(' ');\n return {\n instruction,\n value: parseInt(valueText),\n };\n });\n}","title":""},{"docid":"68a0d559f452630bbbba2bc8313a0d95","score":"0.43995088","text":"function Init_Digit_Map() {\n\n var DigitMap = {};\n var DigitWords = [\"Zero\", \"One\", \"Two\", \n \"Three\", \"Four\", \"Five\",\n \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n\n for (i = 0; i <= 9; i++) {\n DigitMap[i] = DigitWords[i]\n }\n\n return DigitMap\n}","title":""},{"docid":"2fa19ec3ad10525aa1d1ce5560523182","score":"0.4398803","text":"function decode(s) {\n var n = s.length;\n if (n === 0 || s[0] === '0') return 0;\n var dp = new Array(n + 1);\n dp[0] = 1;\n dp[1] = 1;\n\n for (var i = 2; i < n + 1; i++) {\n var currCode = s[i - 2] + '' + s[i - 1];\n\n var twoStepsBehind = currCode <= 26 && currCode >= 10 ? dp[i - 2] : 0;\n var oneStepBehind = s[i - 1] != 0 ? dp[i - 1] : 0;\n\n dp[i] = twoStepsBehind + oneStepBehind;\n }\n\n return dp[n];\n\n // decode 11 first\n // var count = 0;\n // for (var i = 1; i < n; i++) {\n // var firstStr = s[i - 1];\n // var secondStr = s[i - 1] + '' + s[i];\n // // if () count++;\n // // if (s[i - 1] + '' + s[i] <= 26) count++;\n // }\n}","title":""},{"docid":"222dad77fad59023f9c8b706b714bbd2","score":"0.43973818","text":"function part2(input) {\n input = input.split(\"\");\n var size = 25*6;\n var layers = [];\n for(var i = 0; i < input.length / size; i++) {\n layers.push(input.slice(size * i, size * (i +1)));\n }\n var out = '';\n for (var i = 0; i < 6; i++) {\n outer: for (var j = 0; j < 25; j++) {\n for(var k = 0; k < 100; k++) {\n switch(layers[k][i*25 + j]) {\n case \"0\": out += ' '; continue outer;\n case \"1\": out += 'x'; continue outer;\n }\n }\n out += \" \";\n }\n out += \"\\n\";\n }\n console.log(out);\n}","title":""},{"docid":"d8e3724869f82184126569c034668bb9","score":"0.43954253","text":"function pairElement(str) {\n\tlet arrayOfChars = str.split(\"\");\n\tconsole.log(arrayOfChars);\n\treturn arrayOfChars.map(function(char) {\n\t\tswitch(char) {\n\t\t\tcase \"A\":\n\t\t\treturn ['A', 'T'];\n\t\t\tbreak;\n\t\t\tcase \"T\":\n\t\t\treturn ['T', 'A'];\n\t\t\tbreak;\n\t\t\tcase \"C\":\n\t\t\treturn ['C', 'G'];\n\t\t\tbreak;\n\t\t\tcase \"G\":\n\t\t\treturn ['G','C'];\n\t\t\tbreak;\n\t\t}\n\t});\n}","title":""},{"docid":"5be4b5ab69f520abd34d7041aa017871","score":"0.43841788","text":"function readFontDictData(aString, aMap) {\n var fontDictDataTokens = [];\n\n var count = aString.length;\n for (var i = 0; i < count; i) {\n var value = aString[i++] | 0;\n var token = null;\n\n if (value === 12) {\n token = aMap[value][aString[i++]];\n } else if (value === 28) {\n token = aString[i++] << 8 | aString[i++];\n } else if (value === 29) {\n token = aString[i++] << 24 |\n aString[i++] << 16 |\n aString[i++] << 8 |\n aString[i++];\n } else if (value === 30) {\n token = '';\n var parsed = false;\n while (!parsed) {\n var octet = aString[i++];\n\n var nibbles = [parseInt(octet / 16, 10), parseInt(octet % 16, 10)];\n for (var j = 0; j < nibbles.length; j++) {\n var nibble = nibbles[j];\n switch (nibble) {\n case 0xA:\n token += '.';\n break;\n case 0xB:\n token += 'E';\n break;\n case 0xC:\n token += 'E-';\n break;\n case 0xD:\n break;\n case 0xE:\n token += '-';\n break;\n case 0xF:\n parsed = true;\n break;\n default:\n token += nibble;\n break;\n }\n }\n }\n token = parseFloat(token);\n } else if (value <= 31) {\n token = aMap[value];\n } else if (value <= 246) {\n token = parseInt(value, 10) - 139;\n } else if (value <= 250) {\n token = (value - 247) * 256 + aString[i++] + 108;\n } else if (value <= 254) {\n token = -(value - 251) * 256 - aString[i++] - 108;\n } else if (value === 255) {\n throw new FormatError('255 is not a valid DICT command');\n }\n\n fontDictDataTokens.push(token);\n }\n\n return fontDictDataTokens;\n}","title":""},{"docid":"810cbfe4de5197cf3017e35c13999f21","score":"0.43829083","text":"function parseKeyValue(data) {\n const ret = {};\n\n each(data.split('\\n'), line => {\n line = trim(line);\n if (line) {\n line = line.split(' ');\n ret[line[0]] = line[1];\n }\n });\n\n return ret;\n}","title":""},{"docid":"9b15833519e10afc4a8315c8fa5df866","score":"0.43820193","text":"function AxAin(text) {\n\n\tlet regex = new RegExp('[\\(]?(([0-9]+(\\.[0-9]+)?)[-− \\u00A0]?[x\\*×][-− \\u00A0]?([0-9]+(\\.[0-9]+)?)[-− \\u00A0]?in(ch|ches|\\.)?)' + unitSuffix, 'ig');\n\n\tif (text.search(regex) !== -1) {\n\t\tlet matches;\n\n\t\twhile ((matches = regex.exec(text)) !== null) {\n\t\t\ttry {\n\n\t\t\t\tconst fullMatch = matches[1];\n\t\t\t\tif (/[0-9][Xx\\*×][ \\u00A0][0-9]/.test(fullMatch))\n\t\t\t\t\tcontinue; //it is 2x 2in something so no conversion \n\t\t\t\tif (BracketsCheck(matches[0])) continue;\n\n\t\t\t\tlet scale = 2.54;\n\t\t\t\tlet unit = spc + \"cm\";\n\t\t\t\tif (useMM === true) {\n\t\t\t\t\tscale = 25.4;\n\t\t\t\t\tunit = spc + \"mm\"\n\t\t\t\t}\n\t\t\t\tlet cm1 = replaceWithComma(roundNicely(matches[2] * scale));\n\t\t\t\tlet cm2 = replaceWithComma(roundNicely(matches[4] * scale));\n\n\t\t\t\tconst insertIndex = GetIndexPos(matches.index, fullMatch);\t\t\t\t\t\n\t\t\t\tconst metStr = prepareForOutput(cm1 + spc + \"x\" + spc + cm2, spc + unit, true); //+ behind bracket\n\n\t\t\t\t//text = text.replace(matches[0], metStr);\n text = CleanReplace(text, matches[0], metStr);\n\t\t\t} catch (err) {\n\t\t\t\t//console.log(err.message);\n\t\t\t}\n\t\t}\n\t}\n\treturn text;\n}","title":""},{"docid":"ddd57204447ed30da7c88e755c52ef39","score":"0.43759993","text":"function digitChunks(displayStr) {\n let chunkArr = [\"\"];\n let v = 0;\n for (let i = 0; i < displayStr.length; i++) {\n if (!isOperator(displayStr[i])) {\n chunkArr[v] = chunkArr[v]+displayStr[i];\n } else {\n v++;\n chunkArr[v] = \"\";\n };\n };\n chunkArr = chunkArr.filter(e => e != \"\");\n return chunkArr;\n}","title":""},{"docid":"5eef1b3bbc5c10914ac6c747aa08aab6","score":"0.43720254","text":"function monospace(text, start, end, width) {\n var glyphs = Math.min(width, end-start)\n return {\n start: start,\n end: start+glyphs\n }\n}","title":""},{"docid":"9952112f76acb07f258ee23843edc699","score":"0.43708363","text":"function parseWord(word,riklang){\n parts = word.split(\"-\"); \n //log(parts);\n var tents = [];\n var m = parts[0];\n var m_t = riklang.morphemes[m].glyph;\n for (let t in m_t){\n\t tents.push(m_t[t]);\n } \n var a = parts[1];\n var a_t = riklang.aspects[a].glyph;\n tents.push(a_t[0]);\n var r = parts[2];\n var r_t = riklang.relations[r].glyph;\n tents.push(r_t[0]);\n var c = parts[3];\n var p = '';\n if (c.length == 2){\n p = c.charAt(1);\n c = c.charAt(0);\n }\n var c_t0 = Object.assign({}, riklang.collectors[c].glyph[0]);\n if (p == 'P'){\n c_t0.y += 20;\n c_t0.y2 += 20;\n }\n if (p == 'O'){\n c_t0.y += 40;\n c_t0.y2 += 40;\n }\n tents.push(c_t0);\n\n //create splines \n var splines = [];\n for (let t in tents){\n\t var points = getPointsForTentacle(tents[t]);\n if (isRelativeAngles()){\n splines.push(splineToTentacle(points));\n } else {\n\t splines.push(points);\n }\n }\n return splines;\n \n}","title":""},{"docid":"59007ebc939e78ab72a11184790cb9ac","score":"0.4369193","text":"function playfair(str, type, key) {\r\n\tlet keyTemp = new Set(key.replace(/j/g, 'i') + alphabet.replace(/j/g, 'i'));\r\n\tkey = '';\r\n\tkeyTemp.forEach((a) => key += a);\r\n\t//key = key.replace(/j/, 'i');\r\n\tlet keyArr = [];\r\n\tlet keyObj = {};\r\n\tfor (let i = 0; i < 5; i++) {\r\n\t\tkeyArr.push([]);\r\n\t\tfor (let j = 0; j < 5; j++) {\r\n\t\t\tkeyArr[i].push(key[i * 5 + j]);\r\n\t\t\tkeyObj[key[i * 5 + j]] = [i, j];\r\n\t\t}\r\n\t}\r\n\r\n\tstr = removePunc(str.replace(/j/g, '')).split('');\r\n\tif (str[str.length - 1] === 'x') {\r\n\t\tstr = str.slice(0, -1);\r\n\t}\r\n\tlet strArr = [];\r\n\r\n\r\n\t//Inserts x's where necessary\r\n\tfor (let i = 0; i < str.length; i += 2) {\r\n\t\tif (type === 'encrypt') {\r\n\t\t\tif (!str[i + 1] && str.length % 2) {\r\n\t\t\t\tstr.push('x')\r\n\t\t\t}\r\n\t\t\tif (str[i] === str[i + 1]) {\r\n\t\t\t\tstr.splice(i + 1, 0, 'x');\r\n\t\t\t}\r\n\t\t}\r\n\t\tstrArr.push(str[i] + str[i + 1]);\r\n\t}\r\n\r\n\tlet output = '';\r\n\r\n\tif (type === 'encrypt') {\r\n\t\tfor (let i = 0; i < strArr.length; i++) {\r\n\t\t\t//Set a & b to coords of 1st & 2nd letter in plaintext pair respectively. a[0] = row num, a[1] = col num.\r\n\t\t\tlet a = keyObj[strArr[i][0]];\r\n\t\t\tlet b = keyObj[strArr[i][1]];\r\n\r\n\t\t\tif (a[0] === b[0]) output += (keyArr[a[0]][(a[1] + 1) % 5] + keyArr[b[0]][(b[1] + 1) % 5]);\r\n\t\t\telse if (a[1] === b[1]) output += (keyArr[(a[0] + 1) % 5][a[1]] + keyArr[(b[0] + 1) % 5][b[1]]);\r\n\t\t\telse output += (keyArr[a[0]][b[1]] + keyArr[b[0]][a[1]]);\r\n\t\t}\r\n\t}\r\n\telse {\r\n\t\tfor (let i = 0; i < strArr.length; i++) {\r\n\t\t\t//Set a & b to coords of 1st & 2nd letter in plaintext pair respectively. a[0] = row num, a[1] = col num.\r\n\t\t\tlet a = keyObj[strArr[i][0]];\r\n\t\t\tlet b = keyObj[strArr[i][1]];\r\n\r\n\t\t\tif (a[0] === b[0]) output += (keyArr[a[0]][(a[1] + 4) % 5] + keyArr[b[0]][(b[1] + 4) % 5]);\r\n\t\t\telse if (a[1] === b[1]) output += (keyArr[(a[0] + 4) % 5][a[1]] + keyArr[(b[0] + 4) % 5][b[1]]);\r\n\t\t\telse output += (keyArr[a[0]][b[1]] + keyArr[b[0]][a[1]]);\r\n\t\t}\r\n\t}\r\n\treturn output;\r\n}","title":""},{"docid":"578d12f4d7499d07e09af8c4e7dcd403","score":"0.43685898","text":"function parseCFFCharstring(font, glyph, code) {\n var c1x;\n var c1y;\n var c2x;\n var c2y;\n var p = new Path();\n var stack = [];\n var nStems = 0;\n var haveWidth = false;\n var open = false;\n var x = 0;\n var y = 0;\n var subrs;\n var subrsBias;\n var defaultWidthX;\n var nominalWidthX;\n if (font.isCIDFont) {\n var fdIndex = font.tables.cff.topDict._fdSelect[glyph.index];\n var fdDict = font.tables.cff.topDict._fdArray[fdIndex];\n subrs = fdDict._subrs;\n subrsBias = fdDict._subrsBias;\n defaultWidthX = fdDict._defaultWidthX;\n nominalWidthX = fdDict._nominalWidthX;\n } else {\n subrs = font.tables.cff.topDict._subrs;\n subrsBias = font.tables.cff.topDict._subrsBias;\n defaultWidthX = font.tables.cff.topDict._defaultWidthX;\n nominalWidthX = font.tables.cff.topDict._nominalWidthX;\n }\n var width = defaultWidthX;\n\n function newContour(x, y) {\n if (open) {\n p.closePath();\n }\n\n p.moveTo(x, y);\n open = true;\n }\n\n function parseStems() {\n var hasWidthArg;\n\n // The number of stem operators on the stack is always even.\n // If the value is uneven, that means a width is specified.\n hasWidthArg = stack.length % 2 !== 0;\n if (hasWidthArg && !haveWidth) {\n width = stack.shift() + nominalWidthX;\n }\n\n nStems += stack.length >> 1;\n stack.length = 0;\n haveWidth = true;\n }\n\n function parse$$1(code) {\n var b1;\n var b2;\n var b3;\n var b4;\n var codeIndex;\n var subrCode;\n var jpx;\n var jpy;\n var c3x;\n var c3y;\n var c4x;\n var c4y;\n\n var i = 0;\n while (i < code.length) {\n var v = code[i];\n i += 1;\n switch (v) {\n case 1: // hstem\n parseStems();\n break;\n case 3: // vstem\n parseStems();\n break;\n case 4: // vmoveto\n if (stack.length > 1 && !haveWidth) {\n width = stack.shift() + nominalWidthX;\n haveWidth = true;\n }\n\n y += stack.pop();\n newContour(x, y);\n break;\n case 5: // rlineto\n while (stack.length > 0) {\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 6: // hlineto\n while (stack.length > 0) {\n x += stack.shift();\n p.lineTo(x, y);\n if (stack.length === 0) {\n break;\n }\n\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 7: // vlineto\n while (stack.length > 0) {\n y += stack.shift();\n p.lineTo(x, y);\n if (stack.length === 0) {\n break;\n }\n\n x += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 8: // rrcurveto\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 10: // callsubr\n codeIndex = stack.pop() + subrsBias;\n subrCode = subrs[codeIndex];\n if (subrCode) {\n parse$$1(subrCode);\n }\n\n break;\n case 11: // return\n return;\n case 12: // flex operators\n v = code[i];\n i += 1;\n switch (v) {\n case 35: // flex\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 dx6 dy6 fd flex (12 35) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y + stack.shift(); // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = jpy + stack.shift(); // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n x = c4x + stack.shift(); // dx6\n y = c4y + stack.shift(); // dy6\n stack.shift(); // flex depth\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 34: // hflex\n // |- dx1 dx2 dy2 dx3 dx4 dx5 dx6 hflex (12 34) |-\n c1x = x + stack.shift(); // dx1\n c1y = y; // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y; // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = c2y; // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = y; // dy5\n x = c4x + stack.shift(); // dx6\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 36: // hflex1\n // |- dx1 dy1 dx2 dy2 dx3 dx4 dx5 dy5 dx6 hflex1 (12 36) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y; // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = c2y; // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n x = c4x + stack.shift(); // dx6\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 37: // flex1\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 d6 flex1 (12 37) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y + stack.shift(); // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = jpy + stack.shift(); // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n if (Math.abs(c4x - x) > Math.abs(c4y - y)) {\n x = c4x + stack.shift();\n } else {\n y = c4y + stack.shift();\n }\n\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n default:\n console.log('Glyph ' + glyph.index + ': unknown operator ' + 1200 + v);\n stack.length = 0;\n }\n break;\n case 14: // endchar\n if (stack.length > 0 && !haveWidth) {\n width = stack.shift() + nominalWidthX;\n haveWidth = true;\n }\n\n if (open) {\n p.closePath();\n open = false;\n }\n\n break;\n case 18: // hstemhm\n parseStems();\n break;\n case 19: // hintmask\n case 20: // cntrmask\n parseStems();\n i += (nStems + 7) >> 3;\n break;\n case 21: // rmoveto\n if (stack.length > 2 && !haveWidth) {\n width = stack.shift() + nominalWidthX;\n haveWidth = true;\n }\n\n y += stack.pop();\n x += stack.pop();\n newContour(x, y);\n break;\n case 22: // hmoveto\n if (stack.length > 1 && !haveWidth) {\n width = stack.shift() + nominalWidthX;\n haveWidth = true;\n }\n\n x += stack.pop();\n newContour(x, y);\n break;\n case 23: // vstemhm\n parseStems();\n break;\n case 24: // rcurveline\n while (stack.length > 2) {\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n break;\n case 25: // rlinecurve\n while (stack.length > 6) {\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n break;\n case 26: // vvcurveto\n if (stack.length % 2) {\n x += stack.shift();\n }\n\n while (stack.length > 0) {\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x;\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 27: // hhcurveto\n if (stack.length % 2) {\n y += stack.shift();\n }\n\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y;\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 28: // shortint\n b1 = code[i];\n b2 = code[i + 1];\n stack.push(((b1 << 24) | (b2 << 16)) >> 16);\n i += 2;\n break;\n case 29: // callgsubr\n codeIndex = stack.pop() + font.gsubrsBias;\n subrCode = font.gsubrs[codeIndex];\n if (subrCode) {\n parse$$1(subrCode);\n }\n\n break;\n case 30: // vhcurveto\n while (stack.length > 0) {\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n if (stack.length === 0) {\n break;\n }\n\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n y = c2y + stack.shift();\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 31: // hvcurveto\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n y = c2y + stack.shift();\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n if (stack.length === 0) {\n break;\n }\n\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n default:\n if (v < 32) {\n console.log('Glyph ' + glyph.index + ': unknown operator ' + v);\n } else if (v < 247) {\n stack.push(v - 139);\n } else if (v < 251) {\n b1 = code[i];\n i += 1;\n stack.push((v - 247) * 256 + b1 + 108);\n } else if (v < 255) {\n b1 = code[i];\n i += 1;\n stack.push(-(v - 251) * 256 - b1 - 108);\n } else {\n b1 = code[i];\n b2 = code[i + 1];\n b3 = code[i + 2];\n b4 = code[i + 3];\n i += 4;\n stack.push(((b1 << 24) | (b2 << 16) | (b3 << 8) | b4) / 65536);\n }\n }\n }\n }\n\n parse$$1(code);\n\n glyph.advanceWidth = width;\n return p;\n}","title":""},{"docid":"0427bd269491cc7fa3b4d992d2517efb","score":"0.4365029","text":"function pspc_strfobj(str) {\n var pieces = str.split(':');\n var obj = {};\n pspc_labels.forEach(function(label, i) {\n obj[label] = pieces[i]\n });\n return obj;\n}","title":""},{"docid":"87f9304ac4365d00effeb441fd1b0059","score":"0.43606052","text":"function mapChar(ch)\r\n\t{\r\n\t\tvar out = 0;\r\n\t\tch = ch.toUpperCase();\r\n\t\t\r\n\t\tswitch(ch)\r\n\t\t{\r\n\t\t\tcase \"A\":\r\n\t\t\t\tout = 1;\r\n\t\t\tbreak;\r\n\t\t\tcase \"B\":\r\n\t\t\t\tout = 2;\r\n\t\t\tbreak;\r\n\t\t\tcase \"C\":\r\n\t\t\t\tout = 3;\r\n\t\t\tbreak;\r\n\t\t\tcase \"D\":\r\n\t\t\t\tout = 4;\r\n\t\t\tbreak;\r\n\t\t\tcase \"E\":\r\n\t\t\t\tout = 5;\r\n\t\t\tbreak;\r\n\t\t\tcase \"F\":\r\n\t\t\t\tout = 6;\r\n\t\t\tbreak;\r\n\t\t\tcase \"G\":\r\n\t\t\t\tout = 7;\r\n\t\t\tbreak;\r\n\t\t\tcase \"H\":\r\n\t\t\t\tout = 8;\r\n\t\t\tbreak;\r\n\t\t\tcase \"I\":\r\n\t\t\t\tout = 9;\r\n\t\t\tbreak;\r\n\t\t\tcase \"J\":\r\n\t\t\t\tout = 10;\r\n\t\t\tbreak;\r\n\t\t\tcase \"K\":\r\n\t\t\t\tout = 11;\r\n\t\t\tbreak;\r\n\t\t\tcase \"L\":\r\n\t\t\t\tout = 12;\r\n\t\t\tbreak;\r\n\t\t\tcase \"M\":\r\n\t\t\t\tout = 13;\r\n\t\t\tbreak;\r\n\t\t\tcase \"N\":\r\n\t\t\t\tout = 14;\r\n\t\t\tbreak;\r\n\t\t\tcase \"O\":\r\n\t\t\t\tout = 15;\r\n\t\t\tbreak;\r\n\t\t\tcase \"P\":\r\n\t\t\t\tout = 16;\r\n\t\t\tbreak;\r\n\t\t\tcase \"Q\":\r\n\t\t\t\tout = 17;\r\n\t\t\tbreak;\r\n\t\t\tcase \"R\":\r\n\t\t\t\tout = 18;\r\n\t\t\tbreak;\r\n\t\t\tcase \"S\":\r\n\t\t\t\tout = 19;\r\n\t\t\tbreak;\r\n\t\t\tcase \"T\":\r\n\t\t\t\tout = 20;\r\n\t\t\tbreak;\r\n\t\t\tcase \"U\":\r\n\t\t\t\tout = 21;\r\n\t\t\tbreak;\r\n\t\t\tcase \"V\":\r\n\t\t\t\tout = 22;\r\n\t\t\tbreak;\r\n\t\t\tcase \"W\":\r\n\t\t\t\tout = 23;\r\n\t\t\tbreak;\r\n\t\t\tcase \"X\":\r\n\t\t\t\tout = 24;\r\n\t\t\tbreak;\r\n\t\t\tcase \"Y\":\r\n\t\t\t\tout = 25;\r\n\t\t\tbreak;\r\n\t\t\tcase \"Z\":\r\n\t\t\t\tout = 26;\r\n\t\t\tbreak;\r\n\t\t\tcase \" \":\r\n\t\t\t\tout = 27;\r\n\t\t\tbreak;\r\n\t\t\tcase \".\":\r\n\t\t\t\tout = 28;\r\n\t\t\tbreak;\r\n\t\t\tcase \",\":\r\n\t\t\t\tout = 29;\r\n\t\t\tbreak;\r\n\t\t\tcase \"!\":\r\n\t\t\t\tout = 30;\r\n\t\t\tbreak;\r\n\t\t\tcase \"?\":\r\n\t\t\t\tout = 31;\r\n\t\t\tbreak;\r\n\t\t\tcase \"'\":\r\n\t\t\t\tout = 32;\r\n\t\t\tbreak;\r\n\t}\r\n\t\t\r\n\t\treturn out;\r\n\t}","title":""},{"docid":"6ecd6c170caf084b288ecff1aa6eeb05","score":"0.43587753","text":"function pairElement(str) {\n // convert loca var to array\n str = str.split('');\n // for each letter in teh array\n str = str.map( x => {\n // store it in a subarray\n x = [x];\n // find its matching pair and assign it to a second var\n let y;\n\n switch(x[0]){\n case 'A':\n y = 'T';\n break;\n case 'T':\n y = 'A';\n break;\n case 'G':\n y = 'C'\n break;\n case 'C':\n y = 'G';\n break;\n }\n // push the pair into the sub array\n x.push(y);\n\n return x;\n\n });\n // return the new 2d array with pairs added\n return str;\n}","title":""},{"docid":"cb892cbb8cbd73b0a5f1238e64d0ee83","score":"0.43560347","text":"function lboz2kg(text) {\n\tlet regex = new RegExp('(([0-9]{0,3}).?(lbs?).?([0-9]+(\\.[0-9]+)?).?oz)', 'g');\n\tif (text.search(regex) !== -1) {\n\t\tlet matches;\n\n\t\twhile ((matches = regex.exec(text)) !== null) {\n\t\t\ttry {\n\t\t\t\tconst original = matches[0];\n\t\t\t\tlet lb = matches[2];\n\t\t\t\tlb = parseFloat(lb);\n\t\t\t\tlet oz = matches[4];\n\t\t\t\toz = parseFloat(oz);\n\n\t\t\t\tlet total = 0;\n\n\t\t\t\ttotal = lb * 16 + oz;\n\n\t\t\t\tlet kg = prepareForOutput(roundNicely(total * 0.0283495), spc + 'kg', true);\n\t\t\t\t//text = text.replace(matches[0], kg);\n text = CleanReplace(text, matches[0], kg);\n\t\t\t} catch (err) {\n\t\t\t\t// console.log(err.message);\n\t\t\t}\n\t\t}\n\t}\n\treturn text;\n}","title":""},{"docid":"414d8e7029f20915affd40c83031c600","score":"0.4349218","text":"function indentation(value) {\n var index = 0\n var indent = 0\n var character = value.charAt(index)\n var stops = {}\n var size\n var lastIndent = 0\n\n while (character === tab || character === space) {\n size = character === tab ? tabSize : spaceSize\n\n indent += size\n\n if (size > 1) {\n indent = Math.floor(indent / size) * size\n }\n\n while (lastIndent < indent) {\n stops[++lastIndent] = index\n }\n\n character = value.charAt(++index)\n }\n\n return {indent: indent, stops: stops}\n}","title":""},{"docid":"414d8e7029f20915affd40c83031c600","score":"0.4349218","text":"function indentation(value) {\n var index = 0\n var indent = 0\n var character = value.charAt(index)\n var stops = {}\n var size\n var lastIndent = 0\n\n while (character === tab || character === space) {\n size = character === tab ? tabSize : spaceSize\n\n indent += size\n\n if (size > 1) {\n indent = Math.floor(indent / size) * size\n }\n\n while (lastIndent < indent) {\n stops[++lastIndent] = index\n }\n\n character = value.charAt(++index)\n }\n\n return {indent: indent, stops: stops}\n}","title":""},{"docid":"c33a64fbacfed6b160155178ff60a5f0","score":"0.4346995","text":"function readPawnString(Pawnstring) {\n //obj to store all the weights in,default everything to zero in the case a character doesnt use a certain stat\n //eg Dps wont care about leech,chances are they wont be in the pawn string\n var returnObj = {\n \"PrimWeight\": 0,\n \"HasteWeight\": 0,\n \"CritWeight\": 0,\n \"ArmorWeight\": 0,\n \"LeechWeight\": 0,\n \"MasteryWeight\": 0,\n \"StaminaWeight\": 0,\n \"VersatilityWeight\": 0,\n \"WepDpsWeight\": 0\n };\n\n try {\n while (Pawnstring.includes(\":\")) {\n Pawnstring = Pawnstring.substring(Pawnstring.indexOf(\":\") + 1);\n }\n\n //now,spilt up the array on commas\n var PawnArray = Pawnstring.split(\",\");\n //check for the equal\n var PrimWeight = PawnArray.filter(s => s.includes('Strength') || s.includes('Intellect') || s.includes('Agility')); //allows me to treat all these are the same value\n if (PrimWeight && PrimWeight.length) { //make sure that there is stuff in the array\n returnObj.PrimWeight = PrimWeight[0].split(\"=\")[1]; //get the decimal value out\n }\n var CritRating = PawnArray.filter(s => s.includes('Crit'));\n if (CritRating && CritRating.length) {\n returnObj.CritWeight = CritRating[0].split(\"=\")[1];\n }\n var HasteWeight = PawnArray.filter(s => s.includes('Haste'));\n if (HasteWeight && HasteWeight.length) {\n returnObj.HasteWeight = HasteWeight[0].split(\"=\")[1];\n }\n var LeechWeight = PawnArray.filter(s => s.includes('Leech'));\n if (LeechWeight && LeechWeight.length) {\n returnObj.LeechWeight = LeechWeight[0].split(\"=\")[1];\n }\n var MasteryWeight = PawnArray.filter(s => s.includes('Mast'));\n if (MasteryWeight && MasteryWeight.length) {\n returnObj.MasteryWeight = MasteryWeight[0].split(\"=\")[1];\n }\n var StaminaWeight = PawnArray.filter(s => s.includes('Stam'));\n if (StaminaWeight && StaminaWeight.length) {\n returnObj.StaminaWeight = StaminaWeight[0].split(\"=\")[1];\n }\n var ArmorWeight = PawnArray.filter(s => s.includes('Armor'));\n if (ArmorWeight && ArmorWeight.length) {\n returnObj.ArmorWeight = ArmorWeight[0].split(\"=\")[1];\n }\n var VersatilityWeight = PawnArray.filter(s => s.includes('Vers'));\n if (VersatilityWeight && VersatilityWeight.length) {\n returnObj.VersatilityWeight = VersatilityWeight[0].split(\"=\")[1];\n }\n var WepDpsWeight = PawnArray.filter(s => s.includes('Dps'));\n if (WepDpsWeight && WepDpsWeight.length) {\n returnObj.WepDpsWeight = WepDpsWeight[0].split(\"=\")[1];\n }\n\n } catch (error) {\n console.log(error.message)\n return error;\n }\n return returnObj; //finally return the object\n}","title":""},{"docid":"f697a6aa46f3bf7c28a650b4e266eab8","score":"0.4343305","text":"function indentation(value) {\n var index = 0\n var indent = 0\n var character = value.charAt(index)\n var stops = {}\n var size\n\n while (character === tab || character === space) {\n size = character === tab ? tabSize : spaceSize\n\n indent += size\n\n if (size > 1) {\n indent = Math.floor(indent / size) * size\n }\n\n stops[indent] = index\n character = value.charAt(++index)\n }\n\n return {indent: indent, stops: stops}\n}","title":""},{"docid":"58b59efe4f607fc444c08b40e6dce201","score":"0.43410438","text":"function initializeDictionary(d){ \n data = {}\n for(var letter=97;letter<123;letter++)\n {\n var _char = String.fromCharCode(letter);\n data[_char] = []\n }\n for(var i = 0; i < d.length; i++){\n var chunkItem = d[i].split(\"\\t\");\n //console.log(chunkItem)\n let key = chunkItem[1].charAt(0).toLowerCase();\n if(!(key in data)){\n data[key] = [{\"index\": chunkItem[0], \"value\": chunkItem[1], \"occurrences\":chunkItem[3]}];\n }else{\n data[key].push({\"index\": chunkItem[0], \"value\": chunkItem[1], \"occurrences\":chunkItem[3]});\n }\n }\n}","title":""},{"docid":"267563966635a5e20d7441c3831c5d14","score":"0.4335851","text":"function encryption(string, mapping) {\n let arrayOfMapping = mapping.split(',');\n let dictionary = {};\n let ans = '';\n for (i = 0; i < arrayOfMapping.length; i++) {\n let tempArray = arrayOfMapping[i].split(':');\n dictionary[tempArray[0]] = tempArray[1];\n }\n for (i = 0; i < string.length; i++) {\n curCharacter = string[i];\n if (dictionary[curCharacter]) {\n ans += dictionary[curCharacter];\n } else ans += curCharacter;\n }\n return ans;\n}","title":""},{"docid":"ead668d833944f945295b0f3e0c820df","score":"0.43307334","text":"function parseUserInput(letter) {\n let indices = hangmanHash[letter];\n indices.forEach(idx => hangmanOutput[idx] = letter);\n}","title":""},{"docid":"f0d647a8c60d1e4dbbb4134bfb66cb56","score":"0.4323827","text":"function processInput( callback ){\n\tvar i = 3, input = [], helper;\n\n\tcallback = callback || function(){};\n\n\treadInput(function( data ){\n\t\thelper = data.split(' ');\n\t\tif ( i == 3 ){\n\t\t\tinput.push({\n\t\t\t\tN: parseInt( helper[0], 10),\n\t\t\t\tK: parseInt( helper[1], 10),\n\t\t\t\tQ: parseInt( helper[2], 10)\n\t\t\t});\n\t\t}\n\n\t\telse if ( i == 2 ){\n\t\t\tinput.push({\n\t\t\t\ta: parseInt( helper[0], 10),\n\t\t\t\tb: parseInt( helper[1], 10),\n\t\t\t\tc: parseInt( helper[2], 10),\n\t\t\t\td: parseInt( helper[3], 10),\n\t\t\t\te: parseInt( helper[4], 10),\n\t\t\t\tf: parseInt( helper[5], 10),\n\t\t\t\tr: parseInt( helper[6], 10),\n\t\t\t\ts: parseInt( helper[7], 10),\n\t\t\t\tt: parseInt( helper[8], 10),\n\t\t\t\tm: parseInt( helper[9], 10),\n\t\t\t\tA: parseInt( helper[10], 10)\n\t\t\t});\n\t\t}\n\n\t\telse if ( i == 1 ){\n\t\t\tinput.push({\n\t\t\t\tL1: parseInt( helper[0], 10),\n\t\t\t\tLa: parseInt( helper[1], 10),\n\t\t\t\tLc: parseInt( helper[2], 10),\n\t\t\t\tLm: parseInt( helper[3], 10),\n\t\t\t\tD1: parseInt( helper[4], 10),\n\t\t\t\tDa: parseInt( helper[5], 10),\n\t\t\t\tDc: parseInt( helper[6], 10),\n\t\t\t\tDm: parseInt( helper[7], 10)\n\t\t\t});\n\t\t}\n\t\ti--;\n\n\t\tif ( i == 0 ){\n\t\t\tcallback( input );\n\t\t}\n\t});\t\n}","title":""},{"docid":"88d05a294b65cb025a7d5af1ac41c859","score":"0.43201917","text":"function monospace(text, start, end, width) {\n const glyphs = Math.min(width, end - start);\n return {\n start,\n end: start + glyphs,\n };\n}","title":""},{"docid":"c5e6b57bd279575d213cec0f7792539d","score":"0.43164945","text":"function parse_RkNumber(data) {\n\t\t\tvar b = data.slice(data.l, data.l + 4);\n\t\t\tvar fX100 = b[0] & 1,\n\t\t\t fInt = b[0] & 2;\n\t\t\tdata.l += 4;\n\t\t\tb[0] &= 0xFC; // b[0] &= ~3;\n\t\t\tvar RK = fInt === 0 ? __double([0, 0, 0, 0, b[0], b[1], b[2], b[3]], 0) : __readInt32LE(b, 0) >> 2;\n\t\t\treturn fX100 ? RK / 100 : RK;\n\t\t}","title":""},{"docid":"b455b1732c7e7f4749a437a358ec949c","score":"0.43148813","text":"function pair(str) {\n //define a map object with all pair possibilities \n var map = {T:'A', A:'T', G:'C', C:'G'};\n //split str into a a char Array\n strArr = str.split('');\n //replace each Array item with a 2d Array using map\n for (var i=0;i<strArr.length;i++){\n strArr[i]=[strArr[i], map[strArr[i]]];\n }\n return strArr;\n}","title":""},{"docid":"7d3176cb597453fcf12078d7698d2cb8","score":"0.4308658","text":"function parse_RkNumber(data) {\n\tvar b = data.slice(data.l, data.l + 4);\n\tvar fX100 = (b[0] & 1), fInt = (b[0] & 2);\n\tdata.l += 4;\n\tb[0] &= 0xFC; // b[0] &= ~3;\n\tvar RK = fInt === 0 ? __double([0, 0, 0, 0, b[0], b[1], b[2], b[3]], 0) : __readInt32LE(b, 0) >> 2;\n\treturn fX100 ? (RK / 100) : RK;\n}","title":""},{"docid":"047f42f9a319f67e2e5083fe56bdb23a","score":"0.43086547","text":"static outerPair(string) {\n let openingBracket = string.indexOf('[');\n if (openingBracket === -1) {\n return false;\n }\n let i = openingBracket + 1;\n const chars = string.split('');\n let open = 1;\n while (open > 0) {\n if (chars[i] === '[') {\n ++open;\n }\n if (chars[i] === ']') {\n --open;\n }\n ++i;\n }\n return [openingBracket, i - 1];\n }","title":""},{"docid":"4ebdb99fe2056720608da2f852f8aa9f","score":"0.43058807","text":"function readPawnString(Pawnstring) {\n //obj to store all the weights in,default everything to zero in the case a character doesnt use a certain stat\n //eg Dps wont care about leech,chances are they wont be in the pawn string\n var returnObj = {\n \"PrimWeight\": 0,\n \"HasteWeight\": 0,\n \"CritWeight\": 0,\n \"ArmorWeight\": 0,\n \"LeechWeight\": 0,\n \"MasteryWeight\": 0,\n \"StaminaWeight\": 0,\n \"VersatilityWeight\": 0,\n \"WepDpsWeight\": 0\n };\n Pawnstring = Pawnstring.replace(')', '');\n try {\n while (Pawnstring.includes(\":\")) {\n Pawnstring = Pawnstring.substring(Pawnstring.indexOf(\":\") + 1);\n }\n\n //now,spilt up the array on commas\n var PawnArray = Pawnstring.split(\",\");\n //check for the equal\n var PrimWeight = PawnArray.filter(s => s.includes('Strength') || s.includes('Intellect') || s.includes('Agility')); //allows me to treat all these are the same value\n if (PrimWeight && PrimWeight.length) { //make sure that there is stuff in the array\n returnObj.PrimWeight = Number(PrimWeight[0].split(\"=\")[1]); //get the decimal value out\n }\n var CritRating = PawnArray.filter(s => s.includes('Crit'));\n if (CritRating && CritRating.length) {\n returnObj.CritWeight = Number(CritRating[0].split(\"=\")[1]);\n }\n var HasteWeight = PawnArray.filter(s => s.includes('Haste'));\n if (HasteWeight && HasteWeight.length) {\n returnObj.HasteWeight = Number(HasteWeight[0].split(\"=\")[1]);\n }\n var LeechWeight = PawnArray.filter(s => s.includes('Leech'));\n if (LeechWeight && LeechWeight.length) {\n returnObj.LeechWeight = Number(LeechWeight[0].split(\"=\")[1]);\n }\n var MasteryWeight = PawnArray.filter(s => s.includes('Mast'));\n if (MasteryWeight && MasteryWeight.length) {\n returnObj.MasteryWeight = Number(MasteryWeight[0].split(\"=\")[1]);\n }\n var StaminaWeight = PawnArray.filter(s => s.includes('Stam'));\n if (StaminaWeight && StaminaWeight.length) {\n returnObj.StaminaWeight = Number(StaminaWeight[0].split(\"=\")[1]);\n }\n var ArmorWeight = PawnArray.filter(s => s.includes('Armor'));\n if (ArmorWeight && ArmorWeight.length) {\n returnObj.ArmorWeight = Number(ArmorWeight[0].split(\"=\")[1]);\n }\n var VersatilityWeight = PawnArray.filter(s => s.includes('Vers'));\n if (VersatilityWeight && VersatilityWeight.length) {\n returnObj.VersatilityWeight = Number(VersatilityWeight[0].split(\"=\")[1]);\n }\n var WepDpsWeight = PawnArray.filter(s => s.includes('Dps'));\n if (WepDpsWeight && WepDpsWeight.length) {\n returnObj.WepDpsWeight = Number(WepDpsWeight[0].split(\"=\")[1]);\n }\n\n } catch (error) {\n console.log(error.message)\n }\n return returnObj; //finally return the object\n}","title":""},{"docid":"ac695b54150a5154675da18e226828fe","score":"0.43008116","text":"function kFormatter(num, digits) {\n var si = [\n { value: 1, symbol: \"\" },\n { value: 1e3, symbol: \"k\" },\n { value: 1e6, symbol: \"M\" },\n { value: 1e9, symbol: \"G\" },\n { value: 1e12, symbol: \"T\" },\n { value: 1e15, symbol: \"P\" },\n { value: 1e18, symbol: \"E\" },\n ];\n var rx = /\\.0+$|(\\.[0-9]*[1-9])0+$/;\n var i;\n for (i = si.length - 1; i > 0; i--) {\n if (num >= si[i].value) {\n break;\n }\n }\n return (num / si[i].value).toFixed(digits).replace(rx, \"$1\") + si[i].symbol;\n}","title":""},{"docid":"a13be66a174b3b275f1edc5078769bcb","score":"0.42941195","text":"function knightjumps(str) {\n const knight = [parseInt(str[1]), parseInt(str[3])] //get number values for knight's position\n //create a nested array of possible moves ([x, y])\n const moves = [\n [-1, 2], [1, 2],\n [-2, 1], [2, 1],\n [-2, -1], [2, -1],\n [-1, -2], [1, -2]\n ]\n //reduce moves, checking if they are valid given the knight's position\n const result = (moves.reduce((totalMoves, currMove) => {\n if (knight[0]+currMove[0] > 0 && knight[0]+currMove[0] <= 8 && knight[1]+currMove[1] > 0 && knight[1]+currMove[1] <= 8) ++totalMoves\n return totalMoves\n }, 0))\n //return the number of possible moves\n return result\n}","title":""},{"docid":"86d70e099e3f88d7ea8ec1f362051c2d","score":"0.429006","text":"function parseCFFCharstring(font, glyph, code) {\n var c1x;\n var c1y;\n var c2x;\n var c2y;\n var p = new path.Path();\n var stack = [];\n var nStems = 0;\n var haveWidth = false;\n var width = font.defaultWidthX;\n var open = false;\n var x = 0;\n var y = 0;\n\n function newContour(x, y) {\n if (open) {\n p.closePath();\n }\n\n p.moveTo(x, y);\n open = true;\n }\n\n function parseStems() {\n var hasWidthArg;\n\n // The number of stem operators on the stack is always even.\n // If the value is uneven, that means a width is specified.\n hasWidthArg = stack.length % 2 !== 0;\n if (hasWidthArg && !haveWidth) {\n width = stack.shift() + font.nominalWidthX;\n }\n\n nStems += stack.length >> 1;\n stack.length = 0;\n haveWidth = true;\n }\n\n function parse(code) {\n var b1;\n var b2;\n var b3;\n var b4;\n var codeIndex;\n var subrCode;\n var jpx;\n var jpy;\n var c3x;\n var c3y;\n var c4x;\n var c4y;\n\n var i = 0;\n while (i < code.length) {\n var v = code[i];\n i += 1;\n switch (v) {\n case 1: // hstem\n parseStems();\n break;\n case 3: // vstem\n parseStems();\n break;\n case 4: // vmoveto\n if (stack.length > 1 && !haveWidth) {\n width = stack.shift() + font.nominalWidthX;\n haveWidth = true;\n }\n\n y += stack.pop();\n newContour(x, y);\n break;\n case 5: // rlineto\n while (stack.length > 0) {\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 6: // hlineto\n while (stack.length > 0) {\n x += stack.shift();\n p.lineTo(x, y);\n if (stack.length === 0) {\n break;\n }\n\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 7: // vlineto\n while (stack.length > 0) {\n y += stack.shift();\n p.lineTo(x, y);\n if (stack.length === 0) {\n break;\n }\n\n x += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 8: // rrcurveto\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 10: // callsubr\n codeIndex = stack.pop() + font.subrsBias;\n subrCode = font.subrs[codeIndex];\n if (subrCode) {\n parse(subrCode);\n }\n\n break;\n case 11: // return\n return;\n case 12: // flex operators\n v = code[i];\n i += 1;\n switch (v) {\n case 35: // flex\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 dx6 dy6 fd flex (12 35) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y + stack.shift(); // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = jpy + stack.shift(); // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n x = c4x + stack.shift(); // dx6\n y = c4y + stack.shift(); // dy6\n stack.shift(); // flex depth\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 34: // hflex\n // |- dx1 dx2 dy2 dx3 dx4 dx5 dx6 hflex (12 34) |-\n c1x = x + stack.shift(); // dx1\n c1y = y; // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y; // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = c2y; // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = y; // dy5\n x = c4x + stack.shift(); // dx6\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 36: // hflex1\n // |- dx1 dy1 dx2 dy2 dx3 dx4 dx5 dy5 dx6 hflex1 (12 36) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y; // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = c2y; // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n x = c4x + stack.shift(); // dx6\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 37: // flex1\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 d6 flex1 (12 37) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y + stack.shift(); // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = jpy + stack.shift(); // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n if (Math.abs(c4x - x) > Math.abs(c4y - y)) {\n x = c4x + stack.shift();\n } else {\n y = c4y + stack.shift();\n }\n\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n default:\n console.log('Glyph ' + glyph.index + ': unknown operator ' + 1200 + v);\n stack.length = 0;\n }\n break;\n case 14: // endchar\n if (stack.length > 0 && !haveWidth) {\n width = stack.shift() + font.nominalWidthX;\n haveWidth = true;\n }\n\n if (open) {\n p.closePath();\n open = false;\n }\n\n break;\n case 18: // hstemhm\n parseStems();\n break;\n case 19: // hintmask\n case 20: // cntrmask\n parseStems();\n i += (nStems + 7) >> 3;\n break;\n case 21: // rmoveto\n if (stack.length > 2 && !haveWidth) {\n width = stack.shift() + font.nominalWidthX;\n haveWidth = true;\n }\n\n y += stack.pop();\n x += stack.pop();\n newContour(x, y);\n break;\n case 22: // hmoveto\n if (stack.length > 1 && !haveWidth) {\n width = stack.shift() + font.nominalWidthX;\n haveWidth = true;\n }\n\n x += stack.pop();\n newContour(x, y);\n break;\n case 23: // vstemhm\n parseStems();\n break;\n case 24: // rcurveline\n while (stack.length > 2) {\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n break;\n case 25: // rlinecurve\n while (stack.length > 6) {\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n break;\n case 26: // vvcurveto\n if (stack.length % 2) {\n x += stack.shift();\n }\n\n while (stack.length > 0) {\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x;\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 27: // hhcurveto\n if (stack.length % 2) {\n y += stack.shift();\n }\n\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y;\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 28: // shortint\n b1 = code[i];\n b2 = code[i + 1];\n stack.push(((b1 << 24) | (b2 << 16)) >> 16);\n i += 2;\n break;\n case 29: // callgsubr\n codeIndex = stack.pop() + font.gsubrsBias;\n subrCode = font.gsubrs[codeIndex];\n if (subrCode) {\n parse(subrCode);\n }\n\n break;\n case 30: // vhcurveto\n while (stack.length > 0) {\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n if (stack.length === 0) {\n break;\n }\n\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n y = c2y + stack.shift();\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 31: // hvcurveto\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n y = c2y + stack.shift();\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n if (stack.length === 0) {\n break;\n }\n\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n default:\n if (v < 32) {\n console.log('Glyph ' + glyph.index + ': unknown operator ' + v);\n } else if (v < 247) {\n stack.push(v - 139);\n } else if (v < 251) {\n b1 = code[i];\n i += 1;\n stack.push((v - 247) * 256 + b1 + 108);\n } else if (v < 255) {\n b1 = code[i];\n i += 1;\n stack.push(-(v - 251) * 256 - b1 - 108);\n } else {\n b1 = code[i];\n b2 = code[i + 1];\n b3 = code[i + 2];\n b4 = code[i + 3];\n i += 4;\n stack.push(((b1 << 24) | (b2 << 16) | (b3 << 8) | b4) / 65536);\n }\n }\n }\n }\n\n parse(code);\n\n glyph.advanceWidth = width;\n return p;\n}","title":""},{"docid":"86d70e099e3f88d7ea8ec1f362051c2d","score":"0.429006","text":"function parseCFFCharstring(font, glyph, code) {\n var c1x;\n var c1y;\n var c2x;\n var c2y;\n var p = new path.Path();\n var stack = [];\n var nStems = 0;\n var haveWidth = false;\n var width = font.defaultWidthX;\n var open = false;\n var x = 0;\n var y = 0;\n\n function newContour(x, y) {\n if (open) {\n p.closePath();\n }\n\n p.moveTo(x, y);\n open = true;\n }\n\n function parseStems() {\n var hasWidthArg;\n\n // The number of stem operators on the stack is always even.\n // If the value is uneven, that means a width is specified.\n hasWidthArg = stack.length % 2 !== 0;\n if (hasWidthArg && !haveWidth) {\n width = stack.shift() + font.nominalWidthX;\n }\n\n nStems += stack.length >> 1;\n stack.length = 0;\n haveWidth = true;\n }\n\n function parse(code) {\n var b1;\n var b2;\n var b3;\n var b4;\n var codeIndex;\n var subrCode;\n var jpx;\n var jpy;\n var c3x;\n var c3y;\n var c4x;\n var c4y;\n\n var i = 0;\n while (i < code.length) {\n var v = code[i];\n i += 1;\n switch (v) {\n case 1: // hstem\n parseStems();\n break;\n case 3: // vstem\n parseStems();\n break;\n case 4: // vmoveto\n if (stack.length > 1 && !haveWidth) {\n width = stack.shift() + font.nominalWidthX;\n haveWidth = true;\n }\n\n y += stack.pop();\n newContour(x, y);\n break;\n case 5: // rlineto\n while (stack.length > 0) {\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 6: // hlineto\n while (stack.length > 0) {\n x += stack.shift();\n p.lineTo(x, y);\n if (stack.length === 0) {\n break;\n }\n\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 7: // vlineto\n while (stack.length > 0) {\n y += stack.shift();\n p.lineTo(x, y);\n if (stack.length === 0) {\n break;\n }\n\n x += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 8: // rrcurveto\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 10: // callsubr\n codeIndex = stack.pop() + font.subrsBias;\n subrCode = font.subrs[codeIndex];\n if (subrCode) {\n parse(subrCode);\n }\n\n break;\n case 11: // return\n return;\n case 12: // flex operators\n v = code[i];\n i += 1;\n switch (v) {\n case 35: // flex\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 dx6 dy6 fd flex (12 35) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y + stack.shift(); // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = jpy + stack.shift(); // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n x = c4x + stack.shift(); // dx6\n y = c4y + stack.shift(); // dy6\n stack.shift(); // flex depth\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 34: // hflex\n // |- dx1 dx2 dy2 dx3 dx4 dx5 dx6 hflex (12 34) |-\n c1x = x + stack.shift(); // dx1\n c1y = y; // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y; // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = c2y; // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = y; // dy5\n x = c4x + stack.shift(); // dx6\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 36: // hflex1\n // |- dx1 dy1 dx2 dy2 dx3 dx4 dx5 dy5 dx6 hflex1 (12 36) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y; // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = c2y; // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n x = c4x + stack.shift(); // dx6\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 37: // flex1\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 d6 flex1 (12 37) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y + stack.shift(); // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = jpy + stack.shift(); // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n if (Math.abs(c4x - x) > Math.abs(c4y - y)) {\n x = c4x + stack.shift();\n } else {\n y = c4y + stack.shift();\n }\n\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n default:\n console.log('Glyph ' + glyph.index + ': unknown operator ' + 1200 + v);\n stack.length = 0;\n }\n break;\n case 14: // endchar\n if (stack.length > 0 && !haveWidth) {\n width = stack.shift() + font.nominalWidthX;\n haveWidth = true;\n }\n\n if (open) {\n p.closePath();\n open = false;\n }\n\n break;\n case 18: // hstemhm\n parseStems();\n break;\n case 19: // hintmask\n case 20: // cntrmask\n parseStems();\n i += (nStems + 7) >> 3;\n break;\n case 21: // rmoveto\n if (stack.length > 2 && !haveWidth) {\n width = stack.shift() + font.nominalWidthX;\n haveWidth = true;\n }\n\n y += stack.pop();\n x += stack.pop();\n newContour(x, y);\n break;\n case 22: // hmoveto\n if (stack.length > 1 && !haveWidth) {\n width = stack.shift() + font.nominalWidthX;\n haveWidth = true;\n }\n\n x += stack.pop();\n newContour(x, y);\n break;\n case 23: // vstemhm\n parseStems();\n break;\n case 24: // rcurveline\n while (stack.length > 2) {\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n break;\n case 25: // rlinecurve\n while (stack.length > 6) {\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n break;\n case 26: // vvcurveto\n if (stack.length % 2) {\n x += stack.shift();\n }\n\n while (stack.length > 0) {\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x;\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 27: // hhcurveto\n if (stack.length % 2) {\n y += stack.shift();\n }\n\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y;\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 28: // shortint\n b1 = code[i];\n b2 = code[i + 1];\n stack.push(((b1 << 24) | (b2 << 16)) >> 16);\n i += 2;\n break;\n case 29: // callgsubr\n codeIndex = stack.pop() + font.gsubrsBias;\n subrCode = font.gsubrs[codeIndex];\n if (subrCode) {\n parse(subrCode);\n }\n\n break;\n case 30: // vhcurveto\n while (stack.length > 0) {\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n if (stack.length === 0) {\n break;\n }\n\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n y = c2y + stack.shift();\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 31: // hvcurveto\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n y = c2y + stack.shift();\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n if (stack.length === 0) {\n break;\n }\n\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n default:\n if (v < 32) {\n console.log('Glyph ' + glyph.index + ': unknown operator ' + v);\n } else if (v < 247) {\n stack.push(v - 139);\n } else if (v < 251) {\n b1 = code[i];\n i += 1;\n stack.push((v - 247) * 256 + b1 + 108);\n } else if (v < 255) {\n b1 = code[i];\n i += 1;\n stack.push(-(v - 251) * 256 - b1 - 108);\n } else {\n b1 = code[i];\n b2 = code[i + 1];\n b3 = code[i + 2];\n b4 = code[i + 3];\n i += 4;\n stack.push(((b1 << 24) | (b2 << 16) | (b3 << 8) | b4) / 65536);\n }\n }\n }\n }\n\n parse(code);\n\n glyph.advanceWidth = width;\n return p;\n}","title":""},{"docid":"4fa2db7c4e2ce4dabf7f89a7389d14a4","score":"0.42895845","text":"function rewrite(strN) {\n var n = Number(strN);\n\n /* Starting with the highest-valued glyph:\n take as many bites as we can with it\n (decrementing residual value with each bite,\n and appending a corresponding glyph copy to the string)\n before moving down to the next most expensive glyph */\n\n // return Object.keys(dctGlyphs).reduce(\n // OR:\n return 'M CM D CD C XC L XL X IX V IV I'.split(' ').reduce(\n function (s, k) {\n var v = dctGlyphs[k];\n return n >= v ? (n -= v, s + k) : s;\n }, ''\n )\n\n }","title":""},{"docid":"683bd4b7e7cd7581387534e4e89782ee","score":"0.42889175","text":"setOtherVariables(fen) {\n this.kingPos = { w: [-1, -1], b: [-1, -1] };\n const fenParts = fen.split(\" \");\n const position = fenParts[0].split(\"/\");\n for (let i = 0; i < position.length; i++) {\n let k = 0;\n for (let j = 0; j < position[i].length; j++) {\n switch (position[i].charAt(j)) {\n case \"k\":\n this.kingPos[\"b\"] = [i, k];\n break;\n case \"K\":\n this.kingPos[\"w\"] = [i, k];\n break;\n default: {\n const num = parseInt(position[i].charAt(j), 10);\n if (!isNaN(num)) k += num - 1;\n }\n }\n k++;\n }\n }\n }","title":""},{"docid":"f2c7a8f38a8679a75e0c14cd4496675c","score":"0.4287234","text":"function pairElement(str) {\n let dna = [];\n let codons = str.match(/[A-Z]/g);\n codons.forEach(element => dna.push([element]));\n dna.forEach(element => {\n if (element[0] == 'C') {\n element.push('G');\n }\n if (element[0] == 'G') {\n element.push('C');\n }\n if (element[0] == 'T') {\n element.push('A');\n }\n if (element[0] == 'A') {\n element.push('T');\n }\n });\n str = dna;\n return str;\n}","title":""},{"docid":"dfb1b7863f281f7624669d245c904b35","score":"0.42835","text":"function mnemonicStrToArray(mnemonicStr) {\n const mnemonicArray = mnemonicStr.split(\" \");\n return mnemonicArray.map((word, idx) => ({index: idx + 1, word}))\n}","title":""},{"docid":"843535b68abc1d7bbf69bf62bc3a31e2","score":"0.4270495","text":"function indentation(value) {\n var index = 0;\n var indent = 0;\n var character = value.charAt(index);\n var stops = {};\n var size;\n var lastIndent = 0;\n\n while (character === tab || character === space) {\n size = character === tab ? tabSize : spaceSize;\n\n indent += size;\n\n if (size > 1) {\n indent = Math.floor(indent / size) * size;\n }\n\n while (lastIndent < indent) {\n stops[++lastIndent] = index;\n }\n\n character = value.charAt(++index);\n }\n\n return { indent: indent, stops: stops };\n}","title":""},{"docid":"c1db965cacccd10adc7bf4cd4cae4cba","score":"0.426854","text":"function parseCFFCharstring(font, glyph, code) {\n var c1x;\n var c1y;\n var c2x;\n var c2y;\n var p = new Path();\n var stack = [];\n var nStems = 0;\n var haveWidth = false;\n var open = false;\n var x = 0;\n var y = 0;\n var subrs;\n var subrsBias;\n var defaultWidthX;\n var nominalWidthX;\n if (font.isCIDFont) {\n var fdIndex = font.tables.cff.topDict._fdSelect[glyph.index];\n var fdDict = font.tables.cff.topDict._fdArray[fdIndex];\n subrs = fdDict._subrs;\n subrsBias = fdDict._subrsBias;\n defaultWidthX = fdDict._defaultWidthX;\n nominalWidthX = fdDict._nominalWidthX;\n } else {\n subrs = font.tables.cff.topDict._subrs;\n subrsBias = font.tables.cff.topDict._subrsBias;\n defaultWidthX = font.tables.cff.topDict._defaultWidthX;\n nominalWidthX = font.tables.cff.topDict._nominalWidthX;\n }\n var width = defaultWidthX;\n\n function newContour(x, y) {\n if (open) {\n p.closePath();\n }\n\n p.moveTo(x, y);\n open = true;\n }\n\n function parseStems() {\n var hasWidthArg;\n\n // The number of stem operators on the stack is always even.\n // If the value is uneven, that means a width is specified.\n hasWidthArg = stack.length % 2 !== 0;\n if (hasWidthArg && !haveWidth) {\n width = stack.shift() + nominalWidthX;\n }\n\n nStems += stack.length >> 1;\n stack.length = 0;\n haveWidth = true;\n }\n\n function parse(code) {\n var b1;\n var b2;\n var b3;\n var b4;\n var codeIndex;\n var subrCode;\n var jpx;\n var jpy;\n var c3x;\n var c3y;\n var c4x;\n var c4y;\n\n var i = 0;\n while (i < code.length) {\n var v = code[i];\n i += 1;\n switch (v) {\n case 1: // hstem\n parseStems();\n break;\n case 3: // vstem\n parseStems();\n break;\n case 4: // vmoveto\n if (stack.length > 1 && !haveWidth) {\n width = stack.shift() + nominalWidthX;\n haveWidth = true;\n }\n\n y += stack.pop();\n newContour(x, y);\n break;\n case 5: // rlineto\n while (stack.length > 0) {\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 6: // hlineto\n while (stack.length > 0) {\n x += stack.shift();\n p.lineTo(x, y);\n if (stack.length === 0) {\n break;\n }\n\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 7: // vlineto\n while (stack.length > 0) {\n y += stack.shift();\n p.lineTo(x, y);\n if (stack.length === 0) {\n break;\n }\n\n x += stack.shift();\n p.lineTo(x, y);\n }\n\n break;\n case 8: // rrcurveto\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 10: // callsubr\n codeIndex = stack.pop() + subrsBias;\n subrCode = subrs[codeIndex];\n if (subrCode) {\n parse(subrCode);\n }\n\n break;\n case 11: // return\n return;\n case 12: // flex operators\n v = code[i];\n i += 1;\n switch (v) {\n case 35: // flex\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 dx6 dy6 fd flex (12 35) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y + stack.shift(); // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = jpy + stack.shift(); // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n x = c4x + stack.shift(); // dx6\n y = c4y + stack.shift(); // dy6\n stack.shift(); // flex depth\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 34: // hflex\n // |- dx1 dx2 dy2 dx3 dx4 dx5 dx6 hflex (12 34) |-\n c1x = x + stack.shift(); // dx1\n c1y = y; // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y; // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = c2y; // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = y; // dy5\n x = c4x + stack.shift(); // dx6\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 36: // hflex1\n // |- dx1 dy1 dx2 dy2 dx3 dx4 dx5 dy5 dx6 hflex1 (12 36) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y; // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = c2y; // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n x = c4x + stack.shift(); // dx6\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n case 37: // flex1\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 d6 flex1 (12 37) |-\n c1x = x + stack.shift(); // dx1\n c1y = y + stack.shift(); // dy1\n c2x = c1x + stack.shift(); // dx2\n c2y = c1y + stack.shift(); // dy2\n jpx = c2x + stack.shift(); // dx3\n jpy = c2y + stack.shift(); // dy3\n c3x = jpx + stack.shift(); // dx4\n c3y = jpy + stack.shift(); // dy4\n c4x = c3x + stack.shift(); // dx5\n c4y = c3y + stack.shift(); // dy5\n if (Math.abs(c4x - x) > Math.abs(c4y - y)) {\n x = c4x + stack.shift();\n } else {\n y = c4y + stack.shift();\n }\n\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\n break;\n default:\n console.log('Glyph ' + glyph.index + ': unknown operator ' + 1200 + v);\n stack.length = 0;\n }\n break;\n case 14: // endchar\n if (stack.length > 0 && !haveWidth) {\n width = stack.shift() + nominalWidthX;\n haveWidth = true;\n }\n\n if (open) {\n p.closePath();\n open = false;\n }\n\n break;\n case 18: // hstemhm\n parseStems();\n break;\n case 19: // hintmask\n case 20: // cntrmask\n parseStems();\n i += (nStems + 7) >> 3;\n break;\n case 21: // rmoveto\n if (stack.length > 2 && !haveWidth) {\n width = stack.shift() + nominalWidthX;\n haveWidth = true;\n }\n\n y += stack.pop();\n x += stack.pop();\n newContour(x, y);\n break;\n case 22: // hmoveto\n if (stack.length > 1 && !haveWidth) {\n width = stack.shift() + nominalWidthX;\n haveWidth = true;\n }\n\n x += stack.pop();\n newContour(x, y);\n break;\n case 23: // vstemhm\n parseStems();\n break;\n case 24: // rcurveline\n while (stack.length > 2) {\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n break;\n case 25: // rlinecurve\n while (stack.length > 6) {\n x += stack.shift();\n y += stack.shift();\n p.lineTo(x, y);\n }\n\n c1x = x + stack.shift();\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n break;\n case 26: // vvcurveto\n if (stack.length % 2) {\n x += stack.shift();\n }\n\n while (stack.length > 0) {\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x;\n y = c2y + stack.shift();\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 27: // hhcurveto\n if (stack.length % 2) {\n y += stack.shift();\n }\n\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y;\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 28: // shortint\n b1 = code[i];\n b2 = code[i + 1];\n stack.push(((b1 << 24) | (b2 << 16)) >> 16);\n i += 2;\n break;\n case 29: // callgsubr\n codeIndex = stack.pop() + font.gsubrsBias;\n subrCode = font.gsubrs[codeIndex];\n if (subrCode) {\n parse(subrCode);\n }\n\n break;\n case 30: // vhcurveto\n while (stack.length > 0) {\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n if (stack.length === 0) {\n break;\n }\n\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n y = c2y + stack.shift();\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n case 31: // hvcurveto\n while (stack.length > 0) {\n c1x = x + stack.shift();\n c1y = y;\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n y = c2y + stack.shift();\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n if (stack.length === 0) {\n break;\n }\n\n c1x = x;\n c1y = y + stack.shift();\n c2x = c1x + stack.shift();\n c2y = c1y + stack.shift();\n x = c2x + stack.shift();\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\n }\n\n break;\n default:\n if (v < 32) {\n console.log('Glyph ' + glyph.index + ': unknown operator ' + v);\n } else if (v < 247) {\n stack.push(v - 139);\n } else if (v < 251) {\n b1 = code[i];\n i += 1;\n stack.push((v - 247) * 256 + b1 + 108);\n } else if (v < 255) {\n b1 = code[i];\n i += 1;\n stack.push(-(v - 251) * 256 - b1 - 108);\n } else {\n b1 = code[i];\n b2 = code[i + 1];\n b3 = code[i + 2];\n b4 = code[i + 3];\n i += 4;\n stack.push(((b1 << 24) | (b2 << 16) | (b3 << 8) | b4) / 65536);\n }\n }\n }\n }\n\n parse(code);\n\n glyph.advanceWidth = width;\n return p;\n}","title":""},{"docid":"a8a54ec8548629f90b3b720a92ed74e4","score":"0.42648628","text":"cfg2kv (cfg) {\n\n /* helper function for character class checking */\n const isAlpha = (ch) => {\n let cc = ch.charCodeAt(0)\n return (\n (\"A\".charCodeAt(0) <= cc && cc <= \"Z\".charCodeAt(0))\n || (\"a\".charCodeAt(0) <= cc && cc <= \"z\".charCodeAt(0))\n )\n }\n const isDigit = (ch) => {\n let cc = ch.charCodeAt(0)\n return (\"0\".charCodeAt(0) <= cc && cc <= \"9\".charCodeAt(0))\n }\n\n /* helper function for consuming and looking at next characters */\n const consume = (cfg, num) => {\n if (num > 0)\n cfg = cfg.substr(num)\n return cfg\n }\n const lookahead = (cfg) => {\n let ch = cfg.substr(0, 1)\n let la = cfg.substr(1, 1)\n return { ch, la }\n }\n\n /* iterate over the configuration file content */\n let kv = \"\"\n let ns = []\n let id = \"\"\n let expect = \"key\"\n while (cfg !== \"\") {\n /* extract first and second (look-ahead) character */\n let { ch, la } = lookahead(cfg)\n\n /* white-space */\n if (ch === \" \" || ch === \"\\t\" || ch === \"\\n\")\n cfg = consume(cfg, 1)\n\n /* end-of-line comment */\n else if (ch === \"/\" && la === \"/\") {\n while (cfg !== \"\" && ch !== \"\\n\") {\n cfg = consume(cfg, 1)\n ch = lookahead(cfg).ch\n }\n }\n\n /* section start end end */\n else if (ch === \"{\") {\n ns.push(id)\n cfg = consume(cfg, 1)\n expect = \"key\"\n }\n else if (ch === \"}\") {\n ns.pop()\n cfg = consume(cfg, 1)\n }\n\n /* key */\n else if (expect === \"key\" && isAlpha(ch)) {\n id = \"\"\n while (isAlpha(ch)) {\n id += ch\n cfg = consume(cfg, 1)\n ch = lookahead(cfg).ch\n }\n expect = \"val\"\n }\n\n /* key to value punctuation operator */\n else if (ch === \"=\") {\n cfg = consume(cfg, 1)\n }\n\n /* number value */\n else if (expect === \"val\" && isDigit(ch)) {\n let num = \"\"\n while (isDigit(ch)) {\n num += ch\n cfg = consume(cfg, 1)\n ch = lookahead(cfg).ch\n }\n kv += `${[ ...ns, id].join(\".\")} ${parseInt(num, 10)}\\n`\n expect = \"key\"\n }\n\n /* string value */\n else if (expect === \"val\" && ch === \"\\\"\") {\n let str = \"\"\n let escaped = false\n cfg = consume(cfg, 1)\n ch = lookahead(cfg).ch\n while (ch !== \"\\\"\" || escaped) {\n if (ch === \"\\\\\")\n escaped = true\n else {\n escaped = false\n str += ch\n }\n cfg = consume(cfg, 1)\n ch = lookahead(cfg).ch\n }\n cfg = consume(cfg, 1)\n ch = lookahead(cfg).ch\n kv += `${[ ...ns, id ].join(\".\")} ${str}\\n`\n expect = \"key\"\n }\n\n /* everything else leads to a parsing error */\n else {\n throw new Error(\"unexpected character: \\\"\" + ch + \"\\\" (at \\\"\" + cfg + \"\\\")\")\n }\n }\n return kv\n }","title":""},{"docid":"4fd7492a519c79194e37c4b6c49733a7","score":"0.42614576","text":"translateStalks(str) {\n\treturn str.replace(/[89]/g, '2').replace(/[45]/g, '3').match(/[23]{1,3}/g).map((x) => {\n\t switch(x) {\n\t case '222': return '6';\n\t case '322': case '232': case '223': return '7';\n\t case '233': case '323': case '332': return '8';\n\t case '333': return '9';\n\t default: return '';\n\t }\n\t}).join('');\n }","title":""},{"docid":"1c57bed85d8f1484b50e1229becee4c8","score":"0.4258944","text":"intervalFromKey(k) {\n\t\tif (k == ' ' || k == 'j') {\n\t\t\tk = this.lastKey;\n\t\t} else {\n\t\t\tthis.lastKey = k;\n\t\t}\n\t\tlet interval = null;\n\t\tswitch (k) {\n\t\t\tcase 'n':\n\t\t\t\tinterval = 1;\n\t\t\t\tbreak;\n\t\t\tcase 'h':\n\t\t\t\tinterval = -1;\n\t\t\t\tbreak;\n\t\t\tcase \"'\":\n\t\t\t\tinterval = 0;\n\t\t\t\tbreak;\n\t\t\tcase 's':\n\t\t\t\tinterval = 2;\n\t\t\t\tbreak;\n\t\t\tcase 'r':\n\t\t\t\tinterval = -3;\n\t\t\t\tbreak;\n\t\t\tcase 'i':\n\t\t\t\tinterval = 3;\n\t\t\t\tbreak;\n\t\t\tcase 'k':\n\t\t\t\tinterval = -2;\n\t\t\t\tbreak;\n\t\t\tcase 'c':\n\t\t\t\tinterval = -7;\n\t\t\t\tbreak;\n\t\t\tcase 'x':\n\t\t\t\tinterval = -14;\n\t\t\t\tbreak;\n\t\t\tcase ',':\n\t\t\t\tinterval = 7;\n\t\t\t\tbreak;\n\t\t\tcase '.':\n\t\t\t\tinterval = 14;\n\t\t\t\tbreak;\n\t\t\tcase 'p':\n\t\t\t\tinterval = -4;\n\t\t\t\tbreak;\n\t\t\tcase 'e':\n\t\t\t\tinterval = 4;\n\t\t\t\tbreak;\n\t\t\tcase 'w':\n\t\t\t\tinterval = 5;\n\t\t\t\tbreak;\n\t\t\tcase 'v':\n\t\t\t\tinterval = -6;\n\t\t\t\tbreak;\n\t\t\tcase 'm':\n\t\t\t\tinterval = 6;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tinterval = null;\n\t\t}\n\t\treturn interval;\n\t}","title":""},{"docid":"137236b29c5bb8f61e087b6ce49bb465","score":"0.42544","text":"function pairElement(str) {\n str = str.toUpperCase();\n const pairs = {\n \"A\": \"T\",\n \"T\": \"A\",\n \"C\": \"G\",\n \"G\": \"C\"\n }\n let arr = str.split(\"\");\n return arr.map(x => [x, pairs[x]]);\n}","title":""}],"string":"[\n {\n \"docid\": \"5a3c493ccdb38366780bc881e319a712\",\n \"score\": \"0.56152\",\n \"text\": \"function parseKernTable(data, start) {\\n var pairs = {};\\n var p = new parse.Parser(data, start);\\n var tableVersion = p.parseUShort();\\n check.argument(tableVersion === 0, 'Unsupported kern table version.');\\n // Skip nTables.\\n p.skip('uShort', 1);\\n var subTableVersion = p.parseUShort();\\n check.argument(subTableVersion === 0, 'Unsupported kern sub-table version.');\\n // Skip subTableLength, subTableCoverage\\n p.skip('uShort', 2);\\n var nPairs = p.parseUShort();\\n // Skip searchRange, entrySelector, rangeShift.\\n p.skip('uShort', 3);\\n for (var i = 0; i < nPairs; i += 1) {\\n var leftIndex = p.parseUShort();\\n var rightIndex = p.parseUShort();\\n var value = p.parseShort();\\n pairs[leftIndex + ',' + rightIndex] = value;\\n }\\n\\n return pairs;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a3c493ccdb38366780bc881e319a712\",\n \"score\": \"0.56152\",\n \"text\": \"function parseKernTable(data, start) {\\n var pairs = {};\\n var p = new parse.Parser(data, start);\\n var tableVersion = p.parseUShort();\\n check.argument(tableVersion === 0, 'Unsupported kern table version.');\\n // Skip nTables.\\n p.skip('uShort', 1);\\n var subTableVersion = p.parseUShort();\\n check.argument(subTableVersion === 0, 'Unsupported kern sub-table version.');\\n // Skip subTableLength, subTableCoverage\\n p.skip('uShort', 2);\\n var nPairs = p.parseUShort();\\n // Skip searchRange, entrySelector, rangeShift.\\n p.skip('uShort', 3);\\n for (var i = 0; i < nPairs; i += 1) {\\n var leftIndex = p.parseUShort();\\n var rightIndex = p.parseUShort();\\n var value = p.parseShort();\\n pairs[leftIndex + ',' + rightIndex] = value;\\n }\\n\\n return pairs;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89152d29d23139e7de6e94bd55fd1372\",\n \"score\": \"0.54074496\",\n \"text\": \"function step2() {\\n const tmp = new Map();\\n // iterate through all pairs, and then split. Create 2 new pairs and store in a map.\\n // eg: if CB has 3 instances, then we increment CH and HB by 3\\n for (let [pair, char] of rules.entries()) {\\n let numOfPair = tracker.get(pair) || 0;\\n\\n let pairArr = pair.split(\\\"\\\");\\n tmp.set(\\n pairArr[0] + char,\\n (tmp.get(pairArr[0] + char) || 0) + numOfPair\\n );\\n tmp.set(\\n char + pairArr[1],\\n (tmp.get(char + pairArr[1]) || 0) + numOfPair\\n );\\n }\\n // set the tracker to our current iteration\\n tracker = tmp;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f020a7638662a74d985b91f76ba57dc\",\n \"score\": \"0.50971746\",\n \"text\": \"function parseKernTable(data, start) {\\n var p = new parse.Parser(data, start);\\n var tableVersion = p.parseUShort();\\n if (tableVersion === 0) {\\n return parseWindowsKernTable(p);\\n } else if (tableVersion === 1) {\\n return parseMacKernTable(p);\\n } else {\\n throw new Error('Unsupported kern table version (' + tableVersion + ').');\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f020a7638662a74d985b91f76ba57dc\",\n \"score\": \"0.50971746\",\n \"text\": \"function parseKernTable(data, start) {\\n var p = new parse.Parser(data, start);\\n var tableVersion = p.parseUShort();\\n if (tableVersion === 0) {\\n return parseWindowsKernTable(p);\\n } else if (tableVersion === 1) {\\n return parseMacKernTable(p);\\n } else {\\n throw new Error('Unsupported kern table version (' + tableVersion + ').');\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c496c1506dcce0141fcbc049a34fe559\",\n \"score\": \"0.5077134\",\n \"text\": \"function parseKernTable(data, start) {\\n\\t var p = new parse.Parser(data, start);\\n\\t var tableVersion = p.parseUShort();\\n\\t if (tableVersion === 0) {\\n\\t return parseWindowsKernTable(p);\\n\\t } else if (tableVersion === 1) {\\n\\t return parseMacKernTable(p);\\n\\t } else {\\n\\t throw new Error('Unsupported kern table version (' + tableVersion + ').');\\n\\t }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04990018ddb86b65195b75cbce0c9424\",\n \"score\": \"0.50674695\",\n \"text\": \"function parseIntake(str){\\n\\n\\t\\t//var obj = new Object();\\n\\t\\tvar intA, intB, intC, intD, intE, intF, ret;\\n\\n\\t\\t//declaring the object this way controls the order that the keys display in\\n\\t\\tvar obj = {\\n\\t\\t\\tind: \\\"\\\",\\n\\t\\t\\talg: \\\"\\\",\\n\\t\\t\\tws: \\\"\\\",\\n\\t\\t\\tsub: \\\"\\\",\\n\\t\\t\\tqty: \\\"\\\",\\n\\t\\t\\tlen: 0,\\n\\t\\t};\\n\\n\\t\\t//index\\n\\t\\t//locate \\\"#\\\"\\n\\t\\tintA = str.indexOf(\\\"#\\\") + 1;\\n\\t\\t//if it exists, get all characters before and including it\\n\\t\\tif(intA > 0){\\n\\t\\t\\tobj[\\\"ind\\\"] = str.substring(0, intA) + \\\" \\\";\\n\\t\\t} else {\\n\\t\\t\\tobj[\\\"ind\\\"] = \\\"99# \\\";\\n\\t\\t}\\n\\n\\t\\t//allergens\\n\\t\\t//locate \\\"*\\\"\\n\\t\\tintB = str.indexOf(\\\"*\\\");\\n\\t\\t//if it exists, get string between it and the next \\\"*\\\"\\n\\t\\tif(intB >= 0){\\n\\t\\t\\tintC = str.indexOf(\\\"*\\\", intB + 1) + 1;\\n\\t\\t\\tobj[\\\"alg\\\"] = str.substring(intB, intC) + \\\" \\\";\\n\\t\\t}\\n\\n\\t\\t//whiteSpace \\n\\t\\t//if there is an allergen, start from there\\n\\t\\tif(intC >= 0){\\n\\t\\t\\t//strip beginning of string away from the alg\\n\\t\\t\\tstr = str.substring(intC);\\n\\t\\t//otherwise use the index as the start of the string\\n\\t\\t} else if(intA > 0){\\n\\t\\t\\tstr = str.substring(intA);\\n\\t\\t}\\n\\t\\t//with a stripped string, we can now search for the next non whitespace character\\n\\t\\tintD = str.search(/\\\\S/);\\n\\t\\tobj[\\\"ws\\\"] = str.substring(0, intD);\\n\\n\\t\\t//substance\\n\\t\\tintE = str.indexOf(\\\":\\\") + 1;\\n\\t\\tobj[\\\"sub\\\"] = str.substring(intD, intE) + \\\" \\\";\\n\\n\\t\\t//quantity\\n\\t\\t//the replace() in this is equivalent to string.trim();\\n\\t\\t//replace(/^[\\\\s\\\\uFEFF\\\\xA0]+|[\\\\s\\\\uFEFF\\\\xA0]+$/g, '')\\n\\t\\tstr = str.substring(intE).trim(); \\n\\t\\tif(str != \\\"\\\"){\\n\\t\\t\\tobj[\\\"qty\\\"] = str;\\n\\t\\t}\\n\\n\\t\\tobj[\\\"len\\\"] = \\tobj.ind.length + \\n\\t\\t\\t\\t\\t\\tobj.alg.length + \\n\\t\\t\\t\\t\\t\\tobj.sub.length;\\n\\n\\t\\treturn obj;\\n\\t\\t}//parseIntake\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e42d693c8149571d7d30856acc9e431e\",\n \"score\": \"0.50226396\",\n \"text\": \"function parserReal(str) {\\n var out = {};\\n var first = 0, second = 0, type = '';\\n console.log(str.charAt(0));\\n for (var i = 0; i < str.length; i ++) {\\n if (!nums.includes(str.charAt(i))) {\\n first = str.slice(0, i);\\n second = str.slice(i + 1);\\n type = str.charAt(i);\\n //extra test for pro mode:\\n if (first.length === 0) {\\n first = beautify($('#result3').text());\\n }\\n }\\n }\\n out.x = first;\\n out.y = second;\\n out.type = type;\\n return out;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a0ea517c9456967b1c22af7bb423f607\",\n \"score\": \"0.5002155\",\n \"text\": \"function nsvg__parseNumber(/* const char */ s) {\\n var it = \\\"\\\";\\n var s_idx = 0;\\n\\n if (s[s_idx] === '-' || s[s_idx] === '+') {\\n it += s[s_idx];\\n s_idx++;\\n }\\n\\n while (s[s_idx] && nsvg__isdigit(s[s_idx])) {\\n it += s[s_idx];\\n s_idx++;\\n }\\n\\n if (s[s_idx] === '.') {\\n it += s[s_idx];\\n\\n s_idx++;\\n while (s[s_idx] && nsvg__isdigit(s[s_idx])) {\\n it += s[s_idx];\\n\\n s_idx++;\\n }\\n }\\n\\n if (((s[s_idx]) === 'e') || ((s[s_idx]) === 'E')) {\\n it += s[s_idx];\\n\\n s_idx++;\\n if (((s[s_idx]) === '-') || ((s[s_idx]) === '+')) {\\n it += s[s_idx];\\n\\n s_idx++;\\n }\\n\\n while ((s[s_idx]) && nsvg__isdigit(s[s_idx])) {\\n it += s[s_idx];\\n\\n s_idx++;\\n }\\n }\\n\\n return {s_idx : s_idx, it : it};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6513e72a0af32aa12510782035ff4610\",\n \"score\": \"0.497081\",\n \"text\": \"function parseTiles(input) {\\n return _.map(_.padEnd(input, 7, '.'), (tile) => {\\n if (tile === '.') return 0;\\n if (tile === '_') return 100;\\n return tile.charCodeAt(0) - 'A'.charCodeAt(0) + 1;\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02806a86b4606819018134dcf39d055a\",\n \"score\": \"0.49621361\",\n \"text\": \"function decoder(k, idx, string) {\\r\\n let tempString = ''\\r\\n let i = idx\\r\\n for (; i < string.length; i++) {\\r\\n const char = string[i]\\r\\n if (char === ']') {\\r\\n break\\r\\n } else if (char.charCodeAt() >= 48 && char.charCodeAt() <= 57) {\\r\\n let digit = char\\r\\n let j = i + 1\\r\\n while (string[j] !== '[') {\\r\\n digit += string[j]\\r\\n j++\\r\\n }\\r\\n digit = parseInt(digit)\\r\\n const recursion = decoder(digit, j + 1, string)\\r\\n i = recursion[0]\\r\\n tempString += recursion[1]\\r\\n } else {\\r\\n tempString += char\\r\\n }\\r\\n }\\r\\n const singleString = tempString\\r\\n while (k-- > 1) {\\r\\n tempString += singleString\\r\\n }\\r\\n return [i, tempString]\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0dd33c6feb1e8615d2cad2f844a6b92\",\n \"score\": \"0.48901242\",\n \"text\": \"function parseWindowsKernTable(p) {\\n\\t var pairs = {};\\n\\t // Skip nTables.\\n\\t p.skip('uShort');\\n\\t var subtableVersion = p.parseUShort();\\n\\t check.argument(subtableVersion === 0, 'Unsupported kern sub-table version.');\\n\\t // Skip subtableLength, subtableCoverage\\n\\t p.skip('uShort', 2);\\n\\t var nPairs = p.parseUShort();\\n\\t // Skip searchRange, entrySelector, rangeShift.\\n\\t p.skip('uShort', 3);\\n\\t for (var i = 0; i < nPairs; i += 1) {\\n\\t var leftIndex = p.parseUShort();\\n\\t var rightIndex = p.parseUShort();\\n\\t var value = p.parseShort();\\n\\t pairs[leftIndex + ',' + rightIndex] = value;\\n\\t }\\n\\t return pairs;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dac36a48377e647b96da7dca01575297\",\n \"score\": \"0.48785636\",\n \"text\": \"function spacingFromString(string) {\\n if (!string || string == '')\\n return null\\n\\n var spacing = {}\\n\\n var values = string.split(' ')\\n\\n // Check if first value is 'spacing'\\n var spacingLayout = values[0]\\n\\n var layout = spacingLayout.slice(-1)\\n if (layout == 'v' || layout == 'h') {\\n // Spacing exists\\n var space = spacingLayout.substring(0, spacingLayout.length - 1)\\n\\n log(1, 'Layout', layout)\\n log(1, 'Spacing', space)\\n\\n if (parseFloat(space).toString() != space) {\\n log(2, 'Spacing is invalid', string)\\n return null\\n }\\n\\n spacing.layout = layout\\n spacing.space = space\\n\\n values.shift() // Remove the first element\\n }\\n\\n var alignments = []\\n var invalidAlignment = false\\n values.forEach(function(value) {\\n var alignment = simplifyAlignment(value)\\n if (alignment) {\\n alignments.push(alignment)\\n } else if (value) {\\n invalidAlignment = true\\n return\\n }\\n })\\n\\n if (invalidAlignment) {\\n log(2, 'Alignments is invalid', string)\\n return null\\n }\\n\\n if (alignments.length > 0) {\\n spacing.align = alignments\\n }\\n\\n return spacing\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4103d4c2695755c20062a26bd1c3d930\",\n \"score\": \"0.4859974\",\n \"text\": \"function parseWindowsKernTable(p) {\\n var pairs = {};\\n // Skip nTables.\\n p.skip('uShort');\\n var subtableVersion = p.parseUShort();\\n check.argument(subtableVersion === 0, 'Unsupported kern sub-table version.');\\n // Skip subtableLength, subtableCoverage\\n p.skip('uShort', 2);\\n var nPairs = p.parseUShort();\\n // Skip searchRange, entrySelector, rangeShift.\\n p.skip('uShort', 3);\\n for (var i = 0; i < nPairs; i += 1) {\\n var leftIndex = p.parseUShort();\\n var rightIndex = p.parseUShort();\\n var value = p.parseShort();\\n pairs[leftIndex + ',' + rightIndex] = value;\\n }\\n return pairs;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4103d4c2695755c20062a26bd1c3d930\",\n \"score\": \"0.4859974\",\n \"text\": \"function parseWindowsKernTable(p) {\\n var pairs = {};\\n // Skip nTables.\\n p.skip('uShort');\\n var subtableVersion = p.parseUShort();\\n check.argument(subtableVersion === 0, 'Unsupported kern sub-table version.');\\n // Skip subtableLength, subtableCoverage\\n p.skip('uShort', 2);\\n var nPairs = p.parseUShort();\\n // Skip searchRange, entrySelector, rangeShift.\\n p.skip('uShort', 3);\\n for (var i = 0; i < nPairs; i += 1) {\\n var leftIndex = p.parseUShort();\\n var rightIndex = p.parseUShort();\\n var value = p.parseShort();\\n pairs[leftIndex + ',' + rightIndex] = value;\\n }\\n return pairs;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7cfc3cdcdf1df632b10286fd79770776\",\n \"score\": \"0.48318788\",\n \"text\": \"function parseKVPs(data)\\n{\\n var result = {};\\n while(true)\\n {\\n var kvp = data.match(/(\\\\w+):\\\\s*(\\\\d+)?/);\\n if (!kvp)\\n break;\\n\\n result[kvp[1].toUpperCase()] = parse(kvp[2]);\\n data = data.replace(kvp[0], '');\\n }\\n return result;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f019f1fb6b66627bde808650fb614a6f\",\n \"score\": \"0.48287967\",\n \"text\": \"drawLetterSpacing(text, x2, y2, isStroke = !1) {\\n const letterSpacing = this._style.letterSpacing;\\n let useExperimentalLetterSpacing = !1;\\n if (TextMetrics.experimentalLetterSpacingSupported && (TextMetrics.experimentalLetterSpacing ? (this.context.letterSpacing = `${letterSpacing}px`, this.context.textLetterSpacing = `${letterSpacing}px`, useExperimentalLetterSpacing = !0) : (this.context.letterSpacing = \\\"0px\\\", this.context.textLetterSpacing = \\\"0px\\\")), letterSpacing === 0 || useExperimentalLetterSpacing) {\\n isStroke ? this.context.strokeText(text, x2, y2) : this.context.fillText(text, x2, y2);\\n return;\\n }\\n let currentPosition = x2;\\n const stringArray = TextMetrics.graphemeSegmenter(text);\\n let previousWidth = this.context.measureText(text).width, currentWidth = 0;\\n for (let i2 = 0; i2 < stringArray.length; ++i2) {\\n const currentChar = stringArray[i2];\\n isStroke ? this.context.strokeText(currentChar, currentPosition, y2) : this.context.fillText(currentChar, currentPosition, y2);\\n let textStr = \\\"\\\";\\n for (let j2 = i2 + 1; j2 < stringArray.length; ++j2)\\n textStr += stringArray[j2];\\n currentWidth = this.context.measureText(textStr).width, currentPosition += previousWidth - currentWidth + letterSpacing, previousWidth = currentWidth;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c5a942029d2e80e4160f758a0352262\",\n \"score\": \"0.4773084\",\n \"text\": \"function pre_spacing(letter,char){\\n\\t\\tlet special = [];\\t/// Marx [ 'p', 'g', 'y', 'f'];\\t\\tspace /= 4;\\n\\t\\tlet space = spacingProp *letter.bounds.width/2;\\n\\n\\t\\t// if(special.includes(char))\\t\\t\\tspace /= 4;\\n\\t\\t\\n\\t\\treturn space + spacingFixed;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"adf885b654a4bc9077488f8c9b88997c\",\n \"score\": \"0.47728786\",\n \"text\": \"characterNumberSymbol2(s) {\\r\\n let r = ''\\r\\n if (typeof s == 'string') {\\r\\n for (let i = 0; i < s.length; i++) {\\r\\n const e = s[i].toLowerCase()\\r\\n if (\\r\\n e == '0' ||\\r\\n e == '1' ||\\r\\n e == '2' ||\\r\\n e == '3' ||\\r\\n e == '4' ||\\r\\n e == '5' ||\\r\\n e == '6' ||\\r\\n e == '7' ||\\r\\n e == '8' ||\\r\\n e == '9' ||\\r\\n e == 'a' ||\\r\\n e == 'b' ||\\r\\n e == 'c' ||\\r\\n e == 'd' ||\\r\\n e == 'e' ||\\r\\n e == 'f' ||\\r\\n e == 'g' ||\\r\\n e == 'h' ||\\r\\n e == 'i' ||\\r\\n e == 'j' ||\\r\\n e == 'k' ||\\r\\n e == 'l' ||\\r\\n e == 'm' ||\\r\\n e == 'n' ||\\r\\n e == 'o' ||\\r\\n e == 'p' ||\\r\\n e == 'q' ||\\r\\n e == 'r' ||\\r\\n e == 's' ||\\r\\n e == 't' ||\\r\\n e == 'u' ||\\r\\n e == 'v' ||\\r\\n e == 'w' ||\\r\\n e == 'x' ||\\r\\n e == 'y' ||\\r\\n e == 'z' ||\\r\\n e == 'à' ||\\r\\n e == 'á' ||\\r\\n e == 'â' ||\\r\\n e == 'ã' ||\\r\\n e == 'è' ||\\r\\n e == 'é' ||\\r\\n e == 'ê' ||\\r\\n e == 'ì' ||\\r\\n e == 'í' ||\\r\\n e == 'î' ||\\r\\n e == 'ò' ||\\r\\n e == 'ó' ||\\r\\n e == 'ô' ||\\r\\n e == 'õ' ||\\r\\n e == 'ù' ||\\r\\n e == 'ú' ||\\r\\n e == 'û' ||\\r\\n e == 'ç' ||\\r\\n e == '!' ||\\r\\n e == '?' ||\\r\\n e == ',' ||\\r\\n e == '.' ||\\r\\n e == ':' ||\\r\\n e == ';' ||\\r\\n e == '@' ||\\r\\n e == '#' ||\\r\\n e == '$' ||\\r\\n e == '%' ||\\r\\n e == '&' ||\\r\\n e == '(' ||\\r\\n e == ')' ||\\r\\n e == '*' ||\\r\\n e == '-' ||\\r\\n e == '+' ||\\r\\n e == '/' ||\\r\\n e == '=' ||\\r\\n e == 'ª' ||\\r\\n e == 'º' ||\\r\\n e == '°' ||\\r\\n e == '¹' ||\\r\\n e == '²' ||\\r\\n e == '³' ||\\r\\n e == ' ' ||\\r\\n e == ' '\\r\\n ) {\\r\\n r += s[i]\\r\\n }\\r\\n }\\r\\n }\\r\\n return r.trim()\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44a7983572bf57142d0b1b0c6ab9bda5\",\n \"score\": \"0.47478688\",\n \"text\": \"function parseKalamineLayout(keyMap) {\\n let rv = {};\\n for (let xkb in keyMap) {\\n rv[KEYNAMES[xkb]] = keyMap[xkb];\\n }\\n rv.IntlBackslash = rv.IntlBackslash || rv.Backslash;\\n rv.IntlYen = rv.IntlYen || rv.Backslash;\\n return rv;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae3c8afa9cc318f8f86b4d162d0fdd60\",\n \"score\": \"0.47477174\",\n \"text\": \"function parsePublicKeyComponents(text) {\\n var textComponents = text.split('\\\\n');\\n var keyComponents = {};\\n // The component is the text after the identifier\\n keyComponents.e = textComponents[textComponents.indexOf(\\\"e:\\\") + 1];\\n keyComponents.n = textComponents[textComponents.indexOf(\\\"n:\\\") + 1];\\n\\n $('#rsa-decryption-key-e').val(keyComponents.e);\\n $('#rsa-decryption-key-n').val(keyComponents.n);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90c674733bd345c8125534db37041f9d\",\n \"score\": \"0.47322538\",\n \"text\": \"function getKerning(fntData, left, right) {\\n\\t var match = get$4(buildKerningHashMapKey(left, right), fntData[/* kerningMap */5]);\\n\\t if (match !== undefined) {\\n\\t return match;\\n\\t } else {\\n\\t return 0;\\n\\t }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"046f54691b0bb8290f0474a8edc9a477\",\n \"score\": \"0.47133386\",\n \"text\": \"function parsePublicKeyComponents(text) {\\n var textComponents = text.split('\\\\n');\\n var keyComponents = {};\\n // The component is the text after the identifier\\n keyComponents.e = textComponents[textComponents.indexOf(\\\"e:\\\") + 1];\\n keyComponents.n = textComponents[textComponents.indexOf(\\\"n:\\\") + 1];\\n\\n $('#rsa-encryption-key-e').val(keyComponents.e);\\n $('#rsa-encryption-key-n').val(keyComponents.n);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70e96a19d1b80230e3c60623ba51ed81\",\n \"score\": \"0.46978554\",\n \"text\": \"function parse(text){\\n text=text.replace(/\\\\uFFFC/g,'');// delete strange unicode chars //TODO would this cause a total typed char to be higher than total char?\\n totalCharCount = count(text);\\n totalWordCount = text.match(/\\\\S*/g).length/2; //TODO why need to divid by two?\\n\\n\\n\\n\\n window.labels=0;\\n\\n // delete the regular text pragraphs but keep the example code\\n text=text.replace(/\\\\`\\\\`\\\\r/g,'``marc');\\n \\n if( text.includes(\\\"``\\\")){\\n\\n try{\\n text = text.match(/(``)([^`]+)(``)/g).join(' '); // deletes the text that is not in the actual exmaple\\n text = \\\"``\\\"+text.replace(/\\\\`\\\\`/g,'')+\\\"``\\\"; // turns all examples into just one example\\n }catch(e){};\\n\\n\\n\\n }else{\\n \\n text = '<div>'+text+'</div>';\\n\\n }\\n\\n\\n\\n \\n original=text;\\n return text;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62b1864776467b67c0b6d1a41c59ecae\",\n \"score\": \"0.46477008\",\n \"text\": \"function _parseNumbers ( label )\\n{\\n if ( !label ) return []\\n\\n const nums = (\\n label.split( /\\\\s+/ )\\n .filter( function ( w ) { return w.match( /\\\\d/ ) } )\\n .map( function ( l ) { return l.toLowerCase() } )\\n )\\n\\n const results = []\\n\\n nums.forEach( function ( n ) {\\n const m = n.match( /[-]?\\\\d+(\\\\.\\\\d+)?/ )\\n if ( m && m[ 0 ] ) {} else { return }\\n let num = Number( m[ 0 ] )\\n\\n const THOUSAND = 1000\\n const MILLION = THOUSAND * THOUSAND\\n\\n if ( n.indexOf( 'm' ) >= 0 ) num = MILLION * num\\n if ( n.indexOf( 'k' ) >= 0 ) num = THOUSAND * num\\n\\n results.push(num)\\n } )\\n\\n return results\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be7c3c7441a691658ac9fe79c49d9e48\",\n \"score\": \"0.4645228\",\n \"text\": \"function parsePrivateKeyComponents(text) {\\n var textComponents = text.split('\\\\n');\\n var keyComponents = {};\\n // The component is the text after the identifier\\n keyComponents.p = textComponents[textComponents.indexOf(\\\"p:\\\") + 1];\\n keyComponents.q = textComponents[textComponents.indexOf(\\\"q:\\\") + 1];\\n keyComponents.d = textComponents[textComponents.indexOf(\\\"d:\\\") + 1];\\n\\n $('#rsa-encryption-key-p').val(keyComponents.p);\\n $('#rsa-encryption-key-q').val(keyComponents.q);\\n $('#rsa-encryption-key-d').val(keyComponents.d);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d13e93e165c07cb7166c195e7da925b\",\n \"score\": \"0.4636611\",\n \"text\": \"function HKern (oa) {\\n\\t\\tthis.objtype = 'hkern';\\n\\n\\t\\tthis.leftgroup = oa.leftgroup || [];\\n\\t\\tthis.rightgroup = oa.rightgroup || [];\\n\\n\\t\\t// Positive values reduce space between chars\\n\\t\\tthis.value = oa.value || 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"897e6f004ce8a740796a26addc5e4db6\",\n \"score\": \"0.46319956\",\n \"text\": \"function pairElement(str) {\\n var letters = str.split(\\\"\\\");\\n var pairsArray = [];\\n var pairs = {\\n \\\"A\\\": \\\"T\\\",\\n \\\"T\\\": \\\"A\\\",\\n \\\"C\\\": \\\"G\\\",\\n \\\"G\\\": \\\"C\\\"\\n }\\n\\n for (var key of letters) {\\n pairsArray.push([key, pairs[key]]);\\n }\\n return pairsArray;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2b02d3bd1a2c97f54b6bcd95524cefb\",\n \"score\": \"0.46217036\",\n \"text\": \"scanKings(fen) {\\n this.kingPos = { w: [-1, -1], b: [-1, -1] };\\n const rows = V.ParseFen(fen).position.split(\\\"/\\\");\\n for (let i = 0; i < rows.length; i++) {\\n let k = 0; //column index on board\\n for (let j = 0; j < rows[i].length; j++) {\\n const piece = rows[i].charAt(j);\\n if (['j','k','l'].includes(piece.toLowerCase())) {\\n const color = (piece.charCodeAt(0) <= 90 ? 'w' : 'b');\\n this.kingPos[color] = [i, k];\\n }\\n else {\\n const num = parseInt(rows[i].charAt(j), 10);\\n if (!isNaN(num)) k += num - 1;\\n }\\n k++;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe7c3be062ed3e96441a90590c48881d\",\n \"score\": \"0.46145907\",\n \"text\": \"function KthSymmbolInGrammar(N, K) {\\n let row = generateRow(N);\\n let kthSymbol = row.charAt(K-1);\\n console.log(parseInt(kthSymbol));\\n return parseInt(kthSymbol);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4398607c56d65f4188a89585cba8f070\",\n \"score\": \"0.46121004\",\n \"text\": \"function stringToKeyValue(it) {\\n var _a = it.split(\\\":\\\"), key = _a[0], val = _a[1];\\n return val ? new NgStyleKeyValue(key, val) : null;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57d4029202cb08937645580ad6301010\",\n \"score\": \"0.45973182\",\n \"text\": \"function convertTxt($txt) {\\n//need a loop to check surrounding characters to see what the symbol will be.\\n$wordPairs = []; //list of words in the sentance\\n$charPairs = []; // final product of broken char pairs\\n\\n$consonants = [\\n\\\"s\\\",\\\"d\\\",\\n\\\"f\\\",\\\"g\\\",\\n\\\"h\\\",\\\"j\\\",\\n\\\"k\\\",\\\"l\\\",\\n\\\"m\\\",\\\"n\\\",\\n\\\"b\\\",\\\"v\\\",\\n\\\"c\\\",\\\"x\\\",\\n\\\"z\\\",\\\"q\\\",\\n\\\"w\\\",\\\"r\\\",\\n\\\"t\\\",\\\"y\\\",\\n\\\"p\\\"];\\n\\n$vowels = [\\n'a',\\n'i',\\n'u'];\\n\\n$numbers = [\\\"1\\\",\\\"2\\\",\\\"3\\\",\\\"4\\\",\\\"5\\\",\\\"6\\\",\\\"7\\\",\\\"8\\\",\\\"9\\\",\\\"0\\\"];\\n$numberSubmit = 0;\\n$txt = $txt.toLowerCase();\\n$txt = $txt.split(\\\" \\\");\\n//first [] finds the word second [] is a character.\\n// use for loops to then pair the chars and append them to the loop.\\n//return $txt[0][0]; //loop through this split. word by word and char by char\\n\\n for($i = 0; $i < $txt.length;$i++){\\n $wordPairs.push($txt[$i]);\\n for($j = 0; $j < $wordPairs[$i].length;$j++){\\n\\n//if $numbers\\n if ($numbers.includes($wordPairs[$i][$j])) {\\n $x = $j;\\n //find how many chars are numbers in this instance\\n while ($numbers.includes($wordPairs[$i][$x])) {\\n $x++;\\n }\\n //console.log($x);\\n for ($h = 0; $h < $x; $h++) {\\n $numberSubmit += $wordPairs[$i][$j+$h];\\n }\\n //!!!!!!!!!!!!!must break this found number into its smaller components !!!!!!!!!!!!!!!!!!!!!!!\\n console.log(Number($numberSubmit));\\n if ($numberSubmit == 0) { // if 0 return 0\\n $charPairs.push(\\\"0\\\");\\n } else {\\n $numberSubmit = Math.round($numberSubmit);\\n for ($selectNum = 624; $selectNum >= 1; $selectNum -=156) {\\n if ($numberSubmit >= $selectNum) {\\n $times = $numberSubmit / $selectNum; //number of times this number can fit inside the select num\\n while ($times >= 1) {\\n $charPairs.push(String($selectNum));\\n $times --\\n }\\n $numberSubmit = $times * $selectNum; //whatever is left over is magnified and moved on to the next smallest number\\n if ($numberSubmit >= 0.9999999999999991 && $numberSubmit < 1) { //catch stupid calculation error\\n $numberSubmit = 1;\\n }\\n console.log(\\\"Large round check: \\\"+$numberSubmit);\\n }\\n }\\n\\n\\n //groups of 144\\n // no idea what the picture will be yet\\n\\n //groups of 12\\n // numbers 12 - 144. This is because there are 3 pillars so 48*3 |||\\n $numberSubmit = Math.round($numberSubmit);\\n for ($selectNum = 48; $selectNum >= 1; $selectNum -=12) {\\n if ($numberSubmit >= $selectNum) {\\n $times = $numberSubmit / $selectNum; //number of times this number can fit inside the select num\\n while ($times >= 1) {\\n $charPairs.push(String($selectNum));\\n $times --\\n }\\n $numberSubmit = $times * $selectNum; //whatever is left over is magnified and moved on to the next smallest number\\n if ($numberSubmit >= 0.9 && $numberSubmit < 1) { //catch stupid calculation error\\n $numberSubmit = 1;\\n }\\n console.log(\\\"Med round check: \\\"+ $numberSubmit);\\n }\\n }\\n\\n //individual numbers 1-11\\n $numberSubmit = Math.round($numberSubmit);\\n for ($selectNum = 11; $selectNum >= 1; $selectNum --) {\\n if ($numberSubmit >= $selectNum) {\\n $times = $numberSubmit / $selectNum; //number of times this number can fit inside the select num\\n while ($times >= 1) {\\n $charPairs.push(String($selectNum));\\n $times --\\n }\\n $numberSubmit = $times * $selectNum; //whatever is left over is magnified and moved on to the next smallest number\\n console.log(\\\"Small round check: \\\"+ Math.ceil($numberSubmit));\\n }\\n }\\n }\\n\\n //$charPairs.push($numberSubmit);\\n $j+=$x-1 //once found all numbers for this set go to the last char of this set so the loop can start at the next set\\n //console.log($charPairs); //check that logs the number to convert\\n }\\n//find out if eth is cv or c. no need for th find or t and h yet as e is never used except for this instance.\\n else if ($wordPairs[$i][$j] == \\\"e\\\" && $wordPairs[$i][$j+1] == \\\"t\\\" && $wordPairs[$i][$j+2] == \\\"h\\\"){\\n if (($consonants.includes($wordPairs[$i][$j-1]) && $vowels.includes($wordPairs[$i][$j+3])) || ($wordPairs[$i][$j-1] == null && $vowels.includes($wordPairs[$i][$j+3]))) { //consonant befor or null it is cv\\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2] + $wordPairs[$i][$j+3]);\\n $j+=3;\\n } else { //it is just a normal c\\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2]);\\n $j+=2;\\n }\\n }\\n\\n // ny pairs\\n else if ($wordPairs[$i][$j] == \\\"n\\\" && $wordPairs[$i][$j+1] == \\\"y\\\"){ // must find out if the s could be a sh\\n //if vowel before, then consonant after (anyta), write th\\n if (($vowels.includes($wordPairs[$i][$j-1]) && $vowels.includes($wordPairs[$i][$j+3])) || ($consonants.includes($wordPairs[$i][$j+2])) || $wordPairs[$i][$j+2] == null ) {\\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1]);\\n $j++;\\n }\\n // if vowel after th and consonant before write tha\\n else if (($vowels.includes($wordPairs[$i][$j+2]) && $consonants.includes($wordPairs[$i][$j-1])) || ($vowels.includes($wordPairs[$i][$j+2]) && $wordPairs[$i][$j-1] == null) ){\\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2]);\\n $j+=2;\\n } else {\\n $charPairs.push($wordPairs[$i][$j]);\\n }\\n\\n }\\n\\n // ly pairs\\n else if ($wordPairs[$i][$j] == \\\"l\\\" && $wordPairs[$i][$j+1] == \\\"y\\\"){ // must find out if the s could be a sh\\n //if vowel before, then consonant after (ashta), write th\\n if (($vowels.includes($wordPairs[$i][$j-1]) && $vowels.includes($wordPairs[$i][$j+3])) || ($consonants.includes($wordPairs[$i][$j+2])) || $wordPairs[$i][$j+2] == null ) {\\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1]);\\n $j++;\\n\\n }\\n // if vowel after th and consonant before write tha\\n else if (($vowels.includes($wordPairs[$i][$j+2]) && $consonants.includes($wordPairs[$i][$j-1])) || ($vowels.includes($wordPairs[$i][$j+2]) && $wordPairs[$i][$j-1] == null) ){\\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2]);\\n $j+=2;\\n } else {\\n $charPairs.push($wordPairs[$i][$j]);\\n }\\n\\n }\\n\\n// find th pairs\\n else if ($wordPairs[$i][$j] == \\\"t\\\" && $wordPairs[$i][$j+1] == \\\"h\\\"){ // must find out if the s could be a sh\\n //if vowel before, then consonant after (ashta), write th\\n if (($vowels.includes($wordPairs[$i][$j-1]) && $vowels.includes($wordPairs[$i][$j+3])) || ($consonants.includes($wordPairs[$i][$j+2])) || $wordPairs[$i][$j+2] == null ) {\\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1]);\\n $j++;\\n\\n }\\n // if vowel after th and consonant before write tha\\n else if (($vowels.includes($wordPairs[$i][$j+2]) && $consonants.includes($wordPairs[$i][$j-1])) || ($vowels.includes($wordPairs[$i][$j+2]) && $wordPairs[$i][$j-1] == null) ){\\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2]);\\n $j+=2;\\n } else {\\n $charPairs.push($wordPairs[$i][$j]);\\n }\\n\\n }\\n\\n else if ($wordPairs[$i][$j] == \\\"s\\\" && $wordPairs[$i][$j+1] == \\\"h\\\"){ // must find out if the s could be a sh\\n//if vowel before, then consonant after (ashta), write sh\\n if (($vowels.includes($wordPairs[$i][$j-1]) && $vowels.includes($wordPairs[$i][$j+3])) || ($consonants.includes($wordPairs[$i][$j+2])) || $wordPairs[$i][$j+2] == null ) {\\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1]);\\n $j++;\\n\\n }\\n// if vowel after sh and consonant before write sha\\n else if (($vowels.includes($wordPairs[$i][$j+2]) && $consonants.includes($wordPairs[$i][$j-1])) || ($vowels.includes($wordPairs[$i][$j+2]) && $wordPairs[$i][$j-1] == null) ){\\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1] + $wordPairs[$i][$j+2]);\\n $j+=2;\\n } else {\\n $charPairs.push($wordPairs[$i][$j]);\\n }\\n\\n }\\n// if normal cv pair and dosn't mach above statements push it\\n else if ($consonants.includes($wordPairs[$i][$j]) && $vowels.includes($wordPairs[$i][$j+1])){\\n $charPairs.push($wordPairs[$i][$j] + $wordPairs[$i][$j+1]);\\n $j+=1;\\n\\n// if do not match anything else it must be a singal char cv \\\"(c)\\\" cv\\n } else {\\n $charPairs.push($wordPairs[$i][$j]);\\n }\\n }\\n//when a word is finished push a space\\n $charPairs.push(\\\" \\\");\\n }\\n\\n//return an array with the final pairs in order of their final sets \\\"shasfi\\\" = [sha, s, fi]\\n//console.log($charPairs);\\ntranslateTxt($charPairs);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"563de1d982953cf16c752c9fa85d9cdc\",\n \"score\": \"0.4590856\",\n \"text\": \"function entryTime(s, keypad) {\\n let keys = keypad.toString().split('');\\n s = s.toString();\\n let map = {};\\n map[keys[0]] = [0,0]\\n map[keys[1]] = [0,1]\\n map[keys[2]] = [0,2]\\n map[keys[3]] = [1,0]\\n map[keys[4]] = [1,1]\\n map[keys[5]] = [1,2]\\n map[keys[6]] = [2,0]\\n map[keys[7]] = [2,1]\\n map[keys[8]] = [2,2]\\n\\n\\n let result = 0;\\n let position = map[s[0]];\\n\\n for (let i = 1, len = s.toString().length; i < len; i++){\\n let num = s[i]\\n let newPos = map[num];\\n let posXChange = Math.abs(position[0]-newPos[0]);\\n let posYChange = Math.abs(position[1]-newPos[1]);\\n if (posXChange === 1 && posYChange === 1) {\\n result += 1;\\n } else if (posXChange >= 1 && posYChange >= 1) {\\n result += 2;\\n }else {\\n result += posXChange + posYChange;\\n }\\n\\n position = newPos;\\n }\\n\\n return result;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77e970d8635b7247cdcf4ad4d9a45fe8\",\n \"score\": \"0.45790222\",\n \"text\": \"function processInput(str) {\\n const normalized = str.normalize('NFKC');\\n return separator + normalized.replace(/ /g, separator);\\n} // The first tokens are reserved for unk, control symbols, and user-defined\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d05e29c9684ab1f3b27dfa59a1cf244\",\n \"score\": \"0.4576289\",\n \"text\": \"function parsePrivateKeyComponents(text) {\\n var textComponents = text.split('\\\\n');\\n var keyComponents = {};\\n // The component is the text after the identifier\\n keyComponents.p = textComponents[textComponents.indexOf(\\\"p:\\\") + 1];\\n keyComponents.q = textComponents[textComponents.indexOf(\\\"q:\\\") + 1];\\n keyComponents.d = textComponents[textComponents.indexOf(\\\"d:\\\") + 1];\\n\\n $('#rsa-decryption-key-p').val(keyComponents.p);\\n $('#rsa-decryption-key-q').val(keyComponents.q);\\n $('#rsa-decryption-key-d').val(keyComponents.d);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4d1726eccc390a6b1facbef353ea399\",\n \"score\": \"0.45721382\",\n \"text\": \"function charAtNum(str) {\\n const obj = {};\\n const lowerStr = str.toLowerCase().replace(/ /g, \\\"\\\");\\n //console.log(lowerStr)\\n for (const key of lowerStr) {\\n console.log(obj[key])\\n obj[key] = (obj[key])+ 1 || 1;\\n // obj[key] = obj[key] >0 ? obj[key]+1: 1;\\n console.log(obj[key] + \\\"end\\\")\\n }\\n return obj;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6c55d853b9a3446c9e1411cbd8d3ecb\",\n \"score\": \"0.45553306\",\n \"text\": \"function normalize_position(string,position){if(position===0){return position;}string=$.terminal.strip(string);var result=$.terminal.split_characters(string).reduce(function(acc,chr){if(typeof acc==='number'){return acc;}var length=acc.length+char_len(chr);if(length>=position){return acc.position+1;}return{position:acc.position+1,length:length};},{position:0,length:0});if(typeof result==='number'){return result;}else{return result.position;}}// -------------------------------------------------------------------------\",\n \"title\": \"\"\n },\n {\n \"docid\": \"113e895931de7d503b15facae2d9cc08\",\n \"score\": \"0.45546922\",\n \"text\": \"function parseKeyString(str) {\\n var idx = 0;\\n var keys = [];\\n while (idx < str.length) {\\n if (str.charAt(idx) != '<') {\\n keys.push(str.charAt(idx));\\n idx++;\\n continue;\\n }\\n // Vim key notation here means desktop Vim key-notation.\\n // See :help key-notation in desktop Vim.\\n var vimKeyNotationStart = ++idx;\\n while (str.charAt(idx++) != '>') {}\\n var vimKeyNotation = str.substring(vimKeyNotationStart, idx - 1);\\n var mod='';\\n var match = (/^C-(.+)$/).exec(vimKeyNotation);\\n if (match) {\\n mod='Ctrl-';\\n vimKeyNotation=match[1];\\n }\\n var key;\\n switch (vimKeyNotation) {\\n case 'BS':\\n key = 'Backspace';\\n break;\\n case 'CR':\\n key = 'Enter';\\n break;\\n case 'Del':\\n key = 'Delete';\\n break;\\n default:\\n key = vimKeyNotation;\\n break;\\n }\\n keys.push(mod + key);\\n }\\n return keys;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"463d400d53e49abc5461ec3674a15e3a\",\n \"score\": \"0.45489246\",\n \"text\": \"function sol(s) {\\n let odds = 0;\\n let map = {};\\n const res = [];\\n for (let c of s) {\\n map[c] = map[c] + 1 || 1;\\n if (map[c] % 2 !== 0) {\\n odds++;\\n } else {\\n odds--;\\n }\\n }\\n\\n if (odds > 1) return res;\\n let temp = \\\"\\\";\\n // place odd numbered char in center\\n for (let c in map) {\\n if (map[c] % 2 !== 0) {\\n temp += c;\\n map[c]--;\\n break;\\n }\\n }\\n\\n helper(temp);\\n return res;\\n\\n function helper(cur) {\\n if (cur.length === s.length) {\\n res.push(cur);\\n return;\\n }\\n\\n for (let c in map) {\\n if (map[c] >= 2) {\\n let temp = cur;\\n cur = c + cur + c;\\n map[c] -= 2;\\n helper(cur);\\n map[c] += 2;\\n cur = temp;\\n } else if (map[c] === 1) {\\n let a = cur.substring(0, Math.floor(cur.length));\\n let b = cur.substring(Math.floor(cur.length) + 1);\\n map[c]--;\\n helper(a + c + b);\\n }\\n }\\n }\\n\\n // function helper(cur = \\\"\\\") {\\n // if (cur.length === s.length) {\\n // res.push(cur);\\n // return;\\n // }\\n\\n // for (let c in map) {\\n // if (map[c] >= 2) {\\n // let temp = cur;\\n // cur = c + cur + c;\\n // map[c] -= 2;\\n // helper(cur);\\n // map[c] += 2;\\n // cur = temp;\\n // } else if (map[c] === 1) {\\n // let a = cur.substring(0, Math.floor(cur.length / 2));\\n // let b = cur.substring(Math.floor(cur.length / 2) + 1);\\n // map[c]--;\\n // helper(a + c + b);\\n // }\\n // }\\n // }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81bea44fea1fb4ffae2a16bc41698edd\",\n \"score\": \"0.4532225\",\n \"text\": \"function numericals(s){\\n let obj = {};\\n return s.split('').map(char => obj[char] = ++obj[char] || 1).join('');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9890dae0f4f682601b5b06e4af81c895\",\n \"score\": \"0.4518334\",\n \"text\": \"static CtoK(c) {\\n return c + 273\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f7c0713ac6865c0aea1aba34293d422\",\n \"score\": \"0.44859764\",\n \"text\": \"function pairElement(str) {\\n let pairs = {\\n A: 'T',\\n T: 'A',\\n G: 'C',\\n C: 'G',\\n }\\n\\n\\n let letters = str.split('');\\n console.log(letters);\\n\\n let result = letters.map(letter => {\\n let pair = [letter, pairs[letter]];\\n\\n\\n return pair;\\n })\\n\\n\\n return result;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9b34ac492e03daef8b9df6ad8f542e6\",\n \"score\": \"0.44851574\",\n \"text\": \"function indentation(value) {\\n var index = 0;\\n var indent = 0;\\n var character = value.charAt(index);\\n var stops = {};\\n var size;\\n\\n while (character in characters) {\\n size = characters[character];\\n\\n indent += size;\\n\\n if (size > 1) {\\n indent = Math.floor(indent / size) * size;\\n }\\n\\n stops[indent] = index;\\n\\n character = value.charAt(++index);\\n }\\n\\n return {indent: indent, stops: stops};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9b34ac492e03daef8b9df6ad8f542e6\",\n \"score\": \"0.44851574\",\n \"text\": \"function indentation(value) {\\n var index = 0;\\n var indent = 0;\\n var character = value.charAt(index);\\n var stops = {};\\n var size;\\n\\n while (character in characters) {\\n size = characters[character];\\n\\n indent += size;\\n\\n if (size > 1) {\\n indent = Math.floor(indent / size) * size;\\n }\\n\\n stops[indent] = index;\\n\\n character = value.charAt(++index);\\n }\\n\\n return {indent: indent, stops: stops};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9b34ac492e03daef8b9df6ad8f542e6\",\n \"score\": \"0.44851574\",\n \"text\": \"function indentation(value) {\\n var index = 0;\\n var indent = 0;\\n var character = value.charAt(index);\\n var stops = {};\\n var size;\\n\\n while (character in characters) {\\n size = characters[character];\\n\\n indent += size;\\n\\n if (size > 1) {\\n indent = Math.floor(indent / size) * size;\\n }\\n\\n stops[indent] = index;\\n\\n character = value.charAt(++index);\\n }\\n\\n return {indent: indent, stops: stops};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9b34ac492e03daef8b9df6ad8f542e6\",\n \"score\": \"0.44851574\",\n \"text\": \"function indentation(value) {\\n var index = 0;\\n var indent = 0;\\n var character = value.charAt(index);\\n var stops = {};\\n var size;\\n\\n while (character in characters) {\\n size = characters[character];\\n\\n indent += size;\\n\\n if (size > 1) {\\n indent = Math.floor(indent / size) * size;\\n }\\n\\n stops[indent] = index;\\n\\n character = value.charAt(++index);\\n }\\n\\n return {indent: indent, stops: stops};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9b34ac492e03daef8b9df6ad8f542e6\",\n \"score\": \"0.44851574\",\n \"text\": \"function indentation(value) {\\n var index = 0;\\n var indent = 0;\\n var character = value.charAt(index);\\n var stops = {};\\n var size;\\n\\n while (character in characters) {\\n size = characters[character];\\n\\n indent += size;\\n\\n if (size > 1) {\\n indent = Math.floor(indent / size) * size;\\n }\\n\\n stops[indent] = index;\\n\\n character = value.charAt(++index);\\n }\\n\\n return {indent: indent, stops: stops};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33b976a44e358e020f95a4771906662b\",\n \"score\": \"0.44777694\",\n \"text\": \"function k(t){var i,o,s,f=_,k=b;if(\\\"c\\\"===y)k=w(t)+k,t=\\\"\\\";else{\\n// Perform the initial formatting.\\nvar M=(t=+t)<0;\\n// Break the formatted value into the integer “value” part that can be\\n// grouped, and fractional or exponential “suffix” part that is not.\\nif(t=isNaN(t)?l:w(Math.abs(t),m),\\n// Trim insignificant zeros.\\nv&&(t=\\n// Trims insignificant zeros, e.g., replaces 1.2000k with 1.2k.\\nfunction(t){t:for(var n,e=t.length,r=1,i=-1;r<e;++r)switch(t[r]){case\\\".\\\":i=n=r;break;case\\\"0\\\":0===i&&(i=r),n=r;break;default:if(i>0){if(!+t[r])break t;i=0}}return i>0?t.slice(0,i)+t.slice(n+1):t}(t)),\\n// If a negative value rounds to zero during formatting, treat as positive.\\nM&&0==+t&&(M=!1),\\n// Compute the prefix and suffix.\\nf=(M?\\\"(\\\"===h?h:c:\\\"-\\\"===h||\\\"(\\\"===h?\\\"\\\":h)+f,k=(\\\"s\\\"===y?we[8+le/3]:\\\"\\\")+k+(M&&\\\"(\\\"===h?\\\")\\\":\\\"\\\"),x)for(i=-1,o=t.length;++i<o;)if(48>(s=t.charCodeAt(i))||s>57){k=(46===s?a+t.slice(i+1):t.slice(i))+k,t=t.slice(0,i);break}}\\n// If the fill character is not \\\"0\\\", grouping is applied before padding.\\ng&&!p&&(t=r(t,1/0));\\n// Compute the padding.\\nvar A=f.length+t.length+k.length,z=A<d?new Array(d-A+1).join(n):\\\"\\\";\\n// If the fill character is \\\"0\\\", grouping is applied after padding.\\n// Reconstruct the final output based on the desired alignment.\\nswitch(g&&p&&(t=r(z+t,z.length?d-k.length:1/0),z=\\\"\\\"),e){case\\\"<\\\":t=f+t+k+z;break;case\\\"=\\\":t=f+z+t+k;break;case\\\"^\\\":t=z.slice(0,A=z.length>>1)+f+t+k+z.slice(A);break;default:t=z+f+t+k}return u(t)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"480bf17f842bb0ca929242325fef0b5a\",\n \"score\": \"0.44726843\",\n \"text\": \"function extractMKSCDG(s) {\\n\\n var regex = /^(\\\\w*\\\\s\\\\s)([-+]?[0-9]*\\\\.*[0-9]*[eE]*[-+]*[0-9]*)/;\\n return x.strToNum(regex.exec(s), 2);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4595a6547060fb37bf83bf03e8b07fb9\",\n \"score\": \"0.44718084\",\n \"text\": \"function indentation(value) {\\n\\t var index = 0;\\n\\t var indent = 0;\\n\\t var character = value.charAt(index);\\n\\t var stops = {};\\n\\t var size;\\n\\t\\n\\t while (character in characters) {\\n\\t size = characters[character];\\n\\t\\n\\t indent += size;\\n\\t\\n\\t if (size > 1) {\\n\\t indent = Math.floor(indent / size) * size;\\n\\t }\\n\\t\\n\\t stops[indent] = index;\\n\\t\\n\\t character = value.charAt(++index);\\n\\t }\\n\\t\\n\\t return {indent: indent, stops: stops};\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e433fd582e97955342ca8078f39a83dc\",\n \"score\": \"0.44603226\",\n \"text\": \"characterNumberSymbol(s) {\\r\\n let r = ''\\r\\n if (typeof s == 'string') {\\r\\n for (let i = 0; i < s.length; i++) {\\r\\n const e = s[i].toLowerCase()\\r\\n if (\\r\\n e == '0' ||\\r\\n e == '1' ||\\r\\n e == '2' ||\\r\\n e == '3' ||\\r\\n e == '4' ||\\r\\n e == '5' ||\\r\\n e == '6' ||\\r\\n e == '7' ||\\r\\n e == '8' ||\\r\\n e == '9' ||\\r\\n e == 'a' ||\\r\\n e == 'b' ||\\r\\n e == 'c' ||\\r\\n e == 'd' ||\\r\\n e == 'e' ||\\r\\n e == 'f' ||\\r\\n e == 'g' ||\\r\\n e == 'h' ||\\r\\n e == 'i' ||\\r\\n e == 'j' ||\\r\\n e == 'k' ||\\r\\n e == 'l' ||\\r\\n e == 'm' ||\\r\\n e == 'n' ||\\r\\n e == 'o' ||\\r\\n e == 'p' ||\\r\\n e == 'q' ||\\r\\n e == 'r' ||\\r\\n e == 's' ||\\r\\n e == 't' ||\\r\\n e == 'u' ||\\r\\n e == 'v' ||\\r\\n e == 'w' ||\\r\\n e == 'x' ||\\r\\n e == 'y' ||\\r\\n e == 'z' ||\\r\\n e == 'à' ||\\r\\n e == 'á' ||\\r\\n e == 'â' ||\\r\\n e == 'ã' ||\\r\\n e == 'è' ||\\r\\n e == 'é' ||\\r\\n e == 'ê' ||\\r\\n e == 'ì' ||\\r\\n e == 'í' ||\\r\\n e == 'î' ||\\r\\n e == 'ò' ||\\r\\n e == 'ó' ||\\r\\n e == 'ô' ||\\r\\n e == 'õ' ||\\r\\n e == 'ù' ||\\r\\n e == 'ú' ||\\r\\n e == 'û' ||\\r\\n e == 'ç' ||\\r\\n e == '!' ||\\r\\n e == '?' ||\\r\\n e == ',' ||\\r\\n e == '.' ||\\r\\n e == ':' ||\\r\\n e == ';' ||\\r\\n e == '@' ||\\r\\n e == '#' ||\\r\\n e == '$' ||\\r\\n e == '%' ||\\r\\n e == '&' ||\\r\\n e == '(' ||\\r\\n e == ')' ||\\r\\n e == '{' ||\\r\\n e == '}' ||\\r\\n e == '[' ||\\r\\n e == ']' ||\\r\\n e == '*' ||\\r\\n e == '-' ||\\r\\n e == '+' ||\\r\\n e == '/' ||\\r\\n e == '=' ||\\r\\n e == '_' ||\\r\\n e == 'ª' ||\\r\\n e == 'º' ||\\r\\n e == '°' ||\\r\\n e == '¹' ||\\r\\n e == '²' ||\\r\\n e == '³' ||\\r\\n e == '\\\"' ||\\r\\n e == \\\"'\\\" ||\\r\\n e == '|' ||\\r\\n e == ' ' ||\\r\\n e == ' '\\r\\n ) {\\r\\n r += s[i]\\r\\n }\\r\\n }\\r\\n }\\r\\n return r.trim()\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8316b00c332b1347a943cbd75bb3dd4c\",\n \"score\": \"0.44531065\",\n \"text\": \"function lineParser(linedata)\\n{\\n var outline = '';\\n \\n var gcode = '';\\n linedata = linedata.trim();\\n if (linedata != '')\\n {\\n var codeLetter = linedata.substr(0,1);\\n \\n switch (codeLetter)\\n {\\n case '%':\\n inHeader = false; //Exit Header\\n break;\\n case 'M':\\n var mcode = parseInt(parseCodeValue(linedata));\\n \\n switch (mcode)\\n {\\n case (30):\\n outline = '\\\\n( --------- PROGRAM END --------- )\\\\n';\\n outline += lnum() + 'M5 (Spindle Stop)\\\\n';\\n outline += lnum() + 'M9 (Coolant Off)\\\\n';\\n outline += lnum() + 'G30 (Go Home)\\\\n';\\n outline += lnum() + 'M30 (END)\\\\n';\\n break;\\n case (48):\\n inHeader = true; //\\\"in header mode\\\"\\n outline = '( --------------------------------------------------------)\\\\n';\\n outline += '( -- EXCELLON TO GCODE CONVERTER - kdupreez@hotmail.com --)\\\\n';\\n outline += '( --------------------------------------------------------)\\\\n';\\n outline += lnum() + 'G90 G54 G64 G50 G17 G40 G80 G94 G91.1 G49\\\\n';\\n outline += lnum() + 'G30\\\\n';\\n \\n console.log('\\\\tGenerating GCode Header...');\\n\\n break;\\n case (71): //M71 = METRIC \\n outline = lnum() + 'G21 (METRIC)\\\\n\\\\n';\\n console.log('\\\\tSetting units to Metric (mm)...');\\n break;\\n case (72): //M72 = INCHES\\n outline = lnum() + 'G20 (INCHES)\\\\n\\\\n';\\n console.log('\\\\tSetting units to Inches...');\\n break;\\n default:\\n outline = '(-- Unknown MCode: ' + linedata + ')\\\\n';\\n }\\n break;\\n case 'T':\\n if (!inHeader)\\n {\\n toolNumber = parseInt(parseCodeValue(linedata));\\n outline = '\\\\n( --------- DRILL T' + toolNumber + ' --------- )\\\\n';\\n outline += lnum() + 'M5 (Spindle Stop)\\\\n';\\n outline += lnum() + 'M9 (Coolant Off)\\\\n';\\n outline += lnum() + 'G30 (Go Home)\\\\n';\\n outline += lnum() + 'T' + toolNumber + ' G43 H' + toolNumber + ' M6 (Tool Change)\\\\n'; // tool change with offset\\n outline += lnum() + 'S' + spindleSpeed +' M3 (Spindle Start)\\\\n'; //Set Splinde Speed - Forward Rotation\\n outline += lnum() + 'G54\\\\n'; //Work Coordinate System\\n \\n newDrillCycle = true;\\n \\n console.log('\\\\tConverting drill cycle for Tool ' + toolNumber);\\n\\n }\\n else\\n {\\n var strTool = parseCodeValue(linedata);\\n var strDiameter = parseCodeValue(linedata.substr(strTool.length+1));\\n outline = '(T:' + strTool +' Diameter: ' + strDiameter + ' )\\\\n';\\n console.log('\\\\tFound Tool: ' + strTool +' with diameter: ' + strDiameter);\\n\\n }\\n break;\\n case 'X':\\n case 'Y':\\n if (!inHeader)\\n {\\n var strX = parseCodeValue(linedata);\\n var strY = parseCodeValue(linedata.substr(strX.length+1));\\n var fX = parseInt(strX) / 100000.0;\\n var fY = parseInt(strY) / 100000.0;\\n \\n if (newDrillCycle)\\n {\\n outline = lnum() + 'G0 X' + fX + ' Y' + fY + '\\\\n';\\n outline += lnum() + 'G0 Z' + zSafeHeight +'\\\\n'; // Feed Height..\\n outline += lnum() + 'G0 Z' + zFeedHeight +'\\\\n'; // Feed Height..\\n //G98: Return to Initial Z plane after canned cycle\\n //G81: Simple drilling cycle\\n //F3.: Feed Rate\\n //Canned cycle retract = 0.2\\n //Canned cycle will retract to R-Plane = 0.2\\n //Hole Bottom: X Y Z = Hole depth\\n outline += lnum() + 'G98 G81 X' + fX + ' Y' + fY + ' Z' + zHoleBottom + ' R' + zFeedHeight + ' F' + feedRate + '.\\\\n'; \\n newDrillCycle = false;\\n }\\n else\\n {\\n outline = lnum() + 'X' + fX + ' Y' + fY + '\\\\n';\\n }\\n }\\n break;\\n default:\\n outline = '; Unknown Code: ' + linedata;\\n break;\\n }\\n }\\n\\n return outline;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c8fa533cd78e0ebd1609bc7fa0e3573\",\n \"score\": \"0.44345838\",\n \"text\": \"function code_point_from_surrogate_pair (s) {\\n var high_offset = s.charCodeAt(0) - HIGH_SURROGATE_START\\n var low_offset = s.charCodeAt(1) - LOW_SURROGATE_START\\n\\n return (high_offset << 10) + low_offset + 0x10000\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17b60a62dcbe3770ccd33c14490558e1\",\n \"score\": \"0.4421636\",\n \"text\": \"function scale(strng, k, n) {\\n let l;\\n return (l = strng\\n .split(\\\"\\\\n\\\")\\n .map(w => w\\n .split(\\\"\\\")\\n .map(v => v.repeat(k))\\n .join(\\\"\\\")\\n )\\n .map(r => r ? (r+\\\"\\\\n\\\").repeat(n) : \\\"\\\")\\n .join(\\\"\\\")\\n ).substr(0,l.length-1)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bd39fb9b3acd48737d18bf783911715\",\n \"score\": \"0.44142887\",\n \"text\": \"function parseInput(inputText) {\\n let line = -1;\\n return inputText\\n .trim()\\n .split(\\\"\\\\n\\\")\\n .map((instruc) => {\\n const obj = instruc.split(\\\" \\\");\\n line += 1;\\n return {\\n operation: obj[0],\\n argument: parseInt(obj[1].substring(1)),\\n sign: obj[1].substring(0, 1),\\n full: instruc,\\n executed: false,\\n line: line,\\n };\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de8feebdcfb88061574f729f1685965f\",\n \"score\": \"0.44140798\",\n \"text\": \"function parseInput(inputText) {\\n return inputText\\n .trim()\\n .split('\\\\n')\\n .map(line => {\\n const [instruction, valueText] = line.split(' ');\\n return {\\n instruction,\\n value: parseInt(valueText),\\n };\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68a0d559f452630bbbba2bc8313a0d95\",\n \"score\": \"0.43995088\",\n \"text\": \"function Init_Digit_Map() {\\n\\n var DigitMap = {};\\n var DigitWords = [\\\"Zero\\\", \\\"One\\\", \\\"Two\\\", \\n \\\"Three\\\", \\\"Four\\\", \\\"Five\\\",\\n \\\"Six\\\", \\\"Seven\\\", \\\"Eight\\\", \\\"Nine\\\"]\\n\\n for (i = 0; i <= 9; i++) {\\n DigitMap[i] = DigitWords[i]\\n }\\n\\n return DigitMap\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fa19ec3ad10525aa1d1ce5560523182\",\n \"score\": \"0.4398803\",\n \"text\": \"function decode(s) {\\n var n = s.length;\\n if (n === 0 || s[0] === '0') return 0;\\n var dp = new Array(n + 1);\\n dp[0] = 1;\\n dp[1] = 1;\\n\\n for (var i = 2; i < n + 1; i++) {\\n var currCode = s[i - 2] + '' + s[i - 1];\\n\\n var twoStepsBehind = currCode <= 26 && currCode >= 10 ? dp[i - 2] : 0;\\n var oneStepBehind = s[i - 1] != 0 ? dp[i - 1] : 0;\\n\\n dp[i] = twoStepsBehind + oneStepBehind;\\n }\\n\\n return dp[n];\\n\\n // decode 11 first\\n // var count = 0;\\n // for (var i = 1; i < n; i++) {\\n // var firstStr = s[i - 1];\\n // var secondStr = s[i - 1] + '' + s[i];\\n // // if () count++;\\n // // if (s[i - 1] + '' + s[i] <= 26) count++;\\n // }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"222dad77fad59023f9c8b706b714bbd2\",\n \"score\": \"0.43973818\",\n \"text\": \"function part2(input) {\\n input = input.split(\\\"\\\");\\n var size = 25*6;\\n var layers = [];\\n for(var i = 0; i < input.length / size; i++) {\\n layers.push(input.slice(size * i, size * (i +1)));\\n }\\n var out = '';\\n for (var i = 0; i < 6; i++) {\\n outer: for (var j = 0; j < 25; j++) {\\n for(var k = 0; k < 100; k++) {\\n switch(layers[k][i*25 + j]) {\\n case \\\"0\\\": out += ' '; continue outer;\\n case \\\"1\\\": out += 'x'; continue outer;\\n }\\n }\\n out += \\\" \\\";\\n }\\n out += \\\"\\\\n\\\";\\n }\\n console.log(out);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8e3724869f82184126569c034668bb9\",\n \"score\": \"0.43954253\",\n \"text\": \"function pairElement(str) {\\n\\tlet arrayOfChars = str.split(\\\"\\\");\\n\\tconsole.log(arrayOfChars);\\n\\treturn arrayOfChars.map(function(char) {\\n\\t\\tswitch(char) {\\n\\t\\t\\tcase \\\"A\\\":\\n\\t\\t\\treturn ['A', 'T'];\\n\\t\\t\\tbreak;\\n\\t\\t\\tcase \\\"T\\\":\\n\\t\\t\\treturn ['T', 'A'];\\n\\t\\t\\tbreak;\\n\\t\\t\\tcase \\\"C\\\":\\n\\t\\t\\treturn ['C', 'G'];\\n\\t\\t\\tbreak;\\n\\t\\t\\tcase \\\"G\\\":\\n\\t\\t\\treturn ['G','C'];\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5be4b5ab69f520abd34d7041aa017871\",\n \"score\": \"0.43841788\",\n \"text\": \"function readFontDictData(aString, aMap) {\\n var fontDictDataTokens = [];\\n\\n var count = aString.length;\\n for (var i = 0; i < count; i) {\\n var value = aString[i++] | 0;\\n var token = null;\\n\\n if (value === 12) {\\n token = aMap[value][aString[i++]];\\n } else if (value === 28) {\\n token = aString[i++] << 8 | aString[i++];\\n } else if (value === 29) {\\n token = aString[i++] << 24 |\\n aString[i++] << 16 |\\n aString[i++] << 8 |\\n aString[i++];\\n } else if (value === 30) {\\n token = '';\\n var parsed = false;\\n while (!parsed) {\\n var octet = aString[i++];\\n\\n var nibbles = [parseInt(octet / 16, 10), parseInt(octet % 16, 10)];\\n for (var j = 0; j < nibbles.length; j++) {\\n var nibble = nibbles[j];\\n switch (nibble) {\\n case 0xA:\\n token += '.';\\n break;\\n case 0xB:\\n token += 'E';\\n break;\\n case 0xC:\\n token += 'E-';\\n break;\\n case 0xD:\\n break;\\n case 0xE:\\n token += '-';\\n break;\\n case 0xF:\\n parsed = true;\\n break;\\n default:\\n token += nibble;\\n break;\\n }\\n }\\n }\\n token = parseFloat(token);\\n } else if (value <= 31) {\\n token = aMap[value];\\n } else if (value <= 246) {\\n token = parseInt(value, 10) - 139;\\n } else if (value <= 250) {\\n token = (value - 247) * 256 + aString[i++] + 108;\\n } else if (value <= 254) {\\n token = -(value - 251) * 256 - aString[i++] - 108;\\n } else if (value === 255) {\\n throw new FormatError('255 is not a valid DICT command');\\n }\\n\\n fontDictDataTokens.push(token);\\n }\\n\\n return fontDictDataTokens;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"810cbfe4de5197cf3017e35c13999f21\",\n \"score\": \"0.43829083\",\n \"text\": \"function parseKeyValue(data) {\\n const ret = {};\\n\\n each(data.split('\\\\n'), line => {\\n line = trim(line);\\n if (line) {\\n line = line.split(' ');\\n ret[line[0]] = line[1];\\n }\\n });\\n\\n return ret;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b15833519e10afc4a8315c8fa5df866\",\n \"score\": \"0.43820193\",\n \"text\": \"function AxAin(text) {\\n\\n\\tlet regex = new RegExp('[\\\\(]?(([0-9]+(\\\\.[0-9]+)?)[-− \\\\u00A0]?[x\\\\*×][-− \\\\u00A0]?([0-9]+(\\\\.[0-9]+)?)[-− \\\\u00A0]?in(ch|ches|\\\\.)?)' + unitSuffix, 'ig');\\n\\n\\tif (text.search(regex) !== -1) {\\n\\t\\tlet matches;\\n\\n\\t\\twhile ((matches = regex.exec(text)) !== null) {\\n\\t\\t\\ttry {\\n\\n\\t\\t\\t\\tconst fullMatch = matches[1];\\n\\t\\t\\t\\tif (/[0-9][Xx\\\\*×][ \\\\u00A0][0-9]/.test(fullMatch))\\n\\t\\t\\t\\t\\tcontinue; //it is 2x 2in something so no conversion \\n\\t\\t\\t\\tif (BracketsCheck(matches[0])) continue;\\n\\n\\t\\t\\t\\tlet scale = 2.54;\\n\\t\\t\\t\\tlet unit = spc + \\\"cm\\\";\\n\\t\\t\\t\\tif (useMM === true) {\\n\\t\\t\\t\\t\\tscale = 25.4;\\n\\t\\t\\t\\t\\tunit = spc + \\\"mm\\\"\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tlet cm1 = replaceWithComma(roundNicely(matches[2] * scale));\\n\\t\\t\\t\\tlet cm2 = replaceWithComma(roundNicely(matches[4] * scale));\\n\\n\\t\\t\\t\\tconst insertIndex = GetIndexPos(matches.index, fullMatch);\\t\\t\\t\\t\\t\\n\\t\\t\\t\\tconst metStr = prepareForOutput(cm1 + spc + \\\"x\\\" + spc + cm2, spc + unit, true); //+ behind bracket\\n\\n\\t\\t\\t\\t//text = text.replace(matches[0], metStr);\\n text = CleanReplace(text, matches[0], metStr);\\n\\t\\t\\t} catch (err) {\\n\\t\\t\\t\\t//console.log(err.message);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn text;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ddd57204447ed30da7c88e755c52ef39\",\n \"score\": \"0.43759993\",\n \"text\": \"function digitChunks(displayStr) {\\n let chunkArr = [\\\"\\\"];\\n let v = 0;\\n for (let i = 0; i < displayStr.length; i++) {\\n if (!isOperator(displayStr[i])) {\\n chunkArr[v] = chunkArr[v]+displayStr[i];\\n } else {\\n v++;\\n chunkArr[v] = \\\"\\\";\\n };\\n };\\n chunkArr = chunkArr.filter(e => e != \\\"\\\");\\n return chunkArr;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5eef1b3bbc5c10914ac6c747aa08aab6\",\n \"score\": \"0.43720254\",\n \"text\": \"function monospace(text, start, end, width) {\\n var glyphs = Math.min(width, end-start)\\n return {\\n start: start,\\n end: start+glyphs\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9952112f76acb07f258ee23843edc699\",\n \"score\": \"0.43708363\",\n \"text\": \"function parseWord(word,riklang){\\n parts = word.split(\\\"-\\\"); \\n //log(parts);\\n var tents = [];\\n var m = parts[0];\\n var m_t = riklang.morphemes[m].glyph;\\n for (let t in m_t){\\n\\t tents.push(m_t[t]);\\n } \\n var a = parts[1];\\n var a_t = riklang.aspects[a].glyph;\\n tents.push(a_t[0]);\\n var r = parts[2];\\n var r_t = riklang.relations[r].glyph;\\n tents.push(r_t[0]);\\n var c = parts[3];\\n var p = '';\\n if (c.length == 2){\\n p = c.charAt(1);\\n c = c.charAt(0);\\n }\\n var c_t0 = Object.assign({}, riklang.collectors[c].glyph[0]);\\n if (p == 'P'){\\n c_t0.y += 20;\\n c_t0.y2 += 20;\\n }\\n if (p == 'O'){\\n c_t0.y += 40;\\n c_t0.y2 += 40;\\n }\\n tents.push(c_t0);\\n\\n //create splines \\n var splines = [];\\n for (let t in tents){\\n\\t var points = getPointsForTentacle(tents[t]);\\n if (isRelativeAngles()){\\n splines.push(splineToTentacle(points));\\n } else {\\n\\t splines.push(points);\\n }\\n }\\n return splines;\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59007ebc939e78ab72a11184790cb9ac\",\n \"score\": \"0.4369193\",\n \"text\": \"function playfair(str, type, key) {\\r\\n\\tlet keyTemp = new Set(key.replace(/j/g, 'i') + alphabet.replace(/j/g, 'i'));\\r\\n\\tkey = '';\\r\\n\\tkeyTemp.forEach((a) => key += a);\\r\\n\\t//key = key.replace(/j/, 'i');\\r\\n\\tlet keyArr = [];\\r\\n\\tlet keyObj = {};\\r\\n\\tfor (let i = 0; i < 5; i++) {\\r\\n\\t\\tkeyArr.push([]);\\r\\n\\t\\tfor (let j = 0; j < 5; j++) {\\r\\n\\t\\t\\tkeyArr[i].push(key[i * 5 + j]);\\r\\n\\t\\t\\tkeyObj[key[i * 5 + j]] = [i, j];\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\r\\n\\tstr = removePunc(str.replace(/j/g, '')).split('');\\r\\n\\tif (str[str.length - 1] === 'x') {\\r\\n\\t\\tstr = str.slice(0, -1);\\r\\n\\t}\\r\\n\\tlet strArr = [];\\r\\n\\r\\n\\r\\n\\t//Inserts x's where necessary\\r\\n\\tfor (let i = 0; i < str.length; i += 2) {\\r\\n\\t\\tif (type === 'encrypt') {\\r\\n\\t\\t\\tif (!str[i + 1] && str.length % 2) {\\r\\n\\t\\t\\t\\tstr.push('x')\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (str[i] === str[i + 1]) {\\r\\n\\t\\t\\t\\tstr.splice(i + 1, 0, 'x');\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tstrArr.push(str[i] + str[i + 1]);\\r\\n\\t}\\r\\n\\r\\n\\tlet output = '';\\r\\n\\r\\n\\tif (type === 'encrypt') {\\r\\n\\t\\tfor (let i = 0; i < strArr.length; i++) {\\r\\n\\t\\t\\t//Set a & b to coords of 1st & 2nd letter in plaintext pair respectively. a[0] = row num, a[1] = col num.\\r\\n\\t\\t\\tlet a = keyObj[strArr[i][0]];\\r\\n\\t\\t\\tlet b = keyObj[strArr[i][1]];\\r\\n\\r\\n\\t\\t\\tif (a[0] === b[0]) output += (keyArr[a[0]][(a[1] + 1) % 5] + keyArr[b[0]][(b[1] + 1) % 5]);\\r\\n\\t\\t\\telse if (a[1] === b[1]) output += (keyArr[(a[0] + 1) % 5][a[1]] + keyArr[(b[0] + 1) % 5][b[1]]);\\r\\n\\t\\t\\telse output += (keyArr[a[0]][b[1]] + keyArr[b[0]][a[1]]);\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\telse {\\r\\n\\t\\tfor (let i = 0; i < strArr.length; i++) {\\r\\n\\t\\t\\t//Set a & b to coords of 1st & 2nd letter in plaintext pair respectively. a[0] = row num, a[1] = col num.\\r\\n\\t\\t\\tlet a = keyObj[strArr[i][0]];\\r\\n\\t\\t\\tlet b = keyObj[strArr[i][1]];\\r\\n\\r\\n\\t\\t\\tif (a[0] === b[0]) output += (keyArr[a[0]][(a[1] + 4) % 5] + keyArr[b[0]][(b[1] + 4) % 5]);\\r\\n\\t\\t\\telse if (a[1] === b[1]) output += (keyArr[(a[0] + 4) % 5][a[1]] + keyArr[(b[0] + 4) % 5][b[1]]);\\r\\n\\t\\t\\telse output += (keyArr[a[0]][b[1]] + keyArr[b[0]][a[1]]);\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\treturn output;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"578d12f4d7499d07e09af8c4e7dcd403\",\n \"score\": \"0.43685898\",\n \"text\": \"function parseCFFCharstring(font, glyph, code) {\\n var c1x;\\n var c1y;\\n var c2x;\\n var c2y;\\n var p = new Path();\\n var stack = [];\\n var nStems = 0;\\n var haveWidth = false;\\n var open = false;\\n var x = 0;\\n var y = 0;\\n var subrs;\\n var subrsBias;\\n var defaultWidthX;\\n var nominalWidthX;\\n if (font.isCIDFont) {\\n var fdIndex = font.tables.cff.topDict._fdSelect[glyph.index];\\n var fdDict = font.tables.cff.topDict._fdArray[fdIndex];\\n subrs = fdDict._subrs;\\n subrsBias = fdDict._subrsBias;\\n defaultWidthX = fdDict._defaultWidthX;\\n nominalWidthX = fdDict._nominalWidthX;\\n } else {\\n subrs = font.tables.cff.topDict._subrs;\\n subrsBias = font.tables.cff.topDict._subrsBias;\\n defaultWidthX = font.tables.cff.topDict._defaultWidthX;\\n nominalWidthX = font.tables.cff.topDict._nominalWidthX;\\n }\\n var width = defaultWidthX;\\n\\n function newContour(x, y) {\\n if (open) {\\n p.closePath();\\n }\\n\\n p.moveTo(x, y);\\n open = true;\\n }\\n\\n function parseStems() {\\n var hasWidthArg;\\n\\n // The number of stem operators on the stack is always even.\\n // If the value is uneven, that means a width is specified.\\n hasWidthArg = stack.length % 2 !== 0;\\n if (hasWidthArg && !haveWidth) {\\n width = stack.shift() + nominalWidthX;\\n }\\n\\n nStems += stack.length >> 1;\\n stack.length = 0;\\n haveWidth = true;\\n }\\n\\n function parse$$1(code) {\\n var b1;\\n var b2;\\n var b3;\\n var b4;\\n var codeIndex;\\n var subrCode;\\n var jpx;\\n var jpy;\\n var c3x;\\n var c3y;\\n var c4x;\\n var c4y;\\n\\n var i = 0;\\n while (i < code.length) {\\n var v = code[i];\\n i += 1;\\n switch (v) {\\n case 1: // hstem\\n parseStems();\\n break;\\n case 3: // vstem\\n parseStems();\\n break;\\n case 4: // vmoveto\\n if (stack.length > 1 && !haveWidth) {\\n width = stack.shift() + nominalWidthX;\\n haveWidth = true;\\n }\\n\\n y += stack.pop();\\n newContour(x, y);\\n break;\\n case 5: // rlineto\\n while (stack.length > 0) {\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 6: // hlineto\\n while (stack.length > 0) {\\n x += stack.shift();\\n p.lineTo(x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 7: // vlineto\\n while (stack.length > 0) {\\n y += stack.shift();\\n p.lineTo(x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n x += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 8: // rrcurveto\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 10: // callsubr\\n codeIndex = stack.pop() + subrsBias;\\n subrCode = subrs[codeIndex];\\n if (subrCode) {\\n parse$$1(subrCode);\\n }\\n\\n break;\\n case 11: // return\\n return;\\n case 12: // flex operators\\n v = code[i];\\n i += 1;\\n switch (v) {\\n case 35: // flex\\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 dx6 dy6 fd flex (12 35) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y + stack.shift(); // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = jpy + stack.shift(); // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n x = c4x + stack.shift(); // dx6\\n y = c4y + stack.shift(); // dy6\\n stack.shift(); // flex depth\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 34: // hflex\\n // |- dx1 dx2 dy2 dx3 dx4 dx5 dx6 hflex (12 34) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y; // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y; // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = c2y; // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = y; // dy5\\n x = c4x + stack.shift(); // dx6\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 36: // hflex1\\n // |- dx1 dy1 dx2 dy2 dx3 dx4 dx5 dy5 dx6 hflex1 (12 36) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y; // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = c2y; // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n x = c4x + stack.shift(); // dx6\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 37: // flex1\\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 d6 flex1 (12 37) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y + stack.shift(); // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = jpy + stack.shift(); // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n if (Math.abs(c4x - x) > Math.abs(c4y - y)) {\\n x = c4x + stack.shift();\\n } else {\\n y = c4y + stack.shift();\\n }\\n\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n default:\\n console.log('Glyph ' + glyph.index + ': unknown operator ' + 1200 + v);\\n stack.length = 0;\\n }\\n break;\\n case 14: // endchar\\n if (stack.length > 0 && !haveWidth) {\\n width = stack.shift() + nominalWidthX;\\n haveWidth = true;\\n }\\n\\n if (open) {\\n p.closePath();\\n open = false;\\n }\\n\\n break;\\n case 18: // hstemhm\\n parseStems();\\n break;\\n case 19: // hintmask\\n case 20: // cntrmask\\n parseStems();\\n i += (nStems + 7) >> 3;\\n break;\\n case 21: // rmoveto\\n if (stack.length > 2 && !haveWidth) {\\n width = stack.shift() + nominalWidthX;\\n haveWidth = true;\\n }\\n\\n y += stack.pop();\\n x += stack.pop();\\n newContour(x, y);\\n break;\\n case 22: // hmoveto\\n if (stack.length > 1 && !haveWidth) {\\n width = stack.shift() + nominalWidthX;\\n haveWidth = true;\\n }\\n\\n x += stack.pop();\\n newContour(x, y);\\n break;\\n case 23: // vstemhm\\n parseStems();\\n break;\\n case 24: // rcurveline\\n while (stack.length > 2) {\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n break;\\n case 25: // rlinecurve\\n while (stack.length > 6) {\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n break;\\n case 26: // vvcurveto\\n if (stack.length % 2) {\\n x += stack.shift();\\n }\\n\\n while (stack.length > 0) {\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x;\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 27: // hhcurveto\\n if (stack.length % 2) {\\n y += stack.shift();\\n }\\n\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y;\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 28: // shortint\\n b1 = code[i];\\n b2 = code[i + 1];\\n stack.push(((b1 << 24) | (b2 << 16)) >> 16);\\n i += 2;\\n break;\\n case 29: // callgsubr\\n codeIndex = stack.pop() + font.gsubrsBias;\\n subrCode = font.gsubrs[codeIndex];\\n if (subrCode) {\\n parse$$1(subrCode);\\n }\\n\\n break;\\n case 30: // vhcurveto\\n while (stack.length > 0) {\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n y = c2y + stack.shift();\\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 31: // hvcurveto\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n y = c2y + stack.shift();\\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n default:\\n if (v < 32) {\\n console.log('Glyph ' + glyph.index + ': unknown operator ' + v);\\n } else if (v < 247) {\\n stack.push(v - 139);\\n } else if (v < 251) {\\n b1 = code[i];\\n i += 1;\\n stack.push((v - 247) * 256 + b1 + 108);\\n } else if (v < 255) {\\n b1 = code[i];\\n i += 1;\\n stack.push(-(v - 251) * 256 - b1 - 108);\\n } else {\\n b1 = code[i];\\n b2 = code[i + 1];\\n b3 = code[i + 2];\\n b4 = code[i + 3];\\n i += 4;\\n stack.push(((b1 << 24) | (b2 << 16) | (b3 << 8) | b4) / 65536);\\n }\\n }\\n }\\n }\\n\\n parse$$1(code);\\n\\n glyph.advanceWidth = width;\\n return p;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0427bd269491cc7fa3b4d992d2517efb\",\n \"score\": \"0.4365029\",\n \"text\": \"function pspc_strfobj(str) {\\n var pieces = str.split(':');\\n var obj = {};\\n pspc_labels.forEach(function(label, i) {\\n obj[label] = pieces[i]\\n });\\n return obj;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87f9304ac4365d00effeb441fd1b0059\",\n \"score\": \"0.43606052\",\n \"text\": \"function mapChar(ch)\\r\\n\\t{\\r\\n\\t\\tvar out = 0;\\r\\n\\t\\tch = ch.toUpperCase();\\r\\n\\t\\t\\r\\n\\t\\tswitch(ch)\\r\\n\\t\\t{\\r\\n\\t\\t\\tcase \\\"A\\\":\\r\\n\\t\\t\\t\\tout = 1;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"B\\\":\\r\\n\\t\\t\\t\\tout = 2;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"C\\\":\\r\\n\\t\\t\\t\\tout = 3;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"D\\\":\\r\\n\\t\\t\\t\\tout = 4;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"E\\\":\\r\\n\\t\\t\\t\\tout = 5;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"F\\\":\\r\\n\\t\\t\\t\\tout = 6;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"G\\\":\\r\\n\\t\\t\\t\\tout = 7;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"H\\\":\\r\\n\\t\\t\\t\\tout = 8;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"I\\\":\\r\\n\\t\\t\\t\\tout = 9;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"J\\\":\\r\\n\\t\\t\\t\\tout = 10;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"K\\\":\\r\\n\\t\\t\\t\\tout = 11;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"L\\\":\\r\\n\\t\\t\\t\\tout = 12;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"M\\\":\\r\\n\\t\\t\\t\\tout = 13;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"N\\\":\\r\\n\\t\\t\\t\\tout = 14;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"O\\\":\\r\\n\\t\\t\\t\\tout = 15;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"P\\\":\\r\\n\\t\\t\\t\\tout = 16;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"Q\\\":\\r\\n\\t\\t\\t\\tout = 17;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"R\\\":\\r\\n\\t\\t\\t\\tout = 18;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"S\\\":\\r\\n\\t\\t\\t\\tout = 19;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"T\\\":\\r\\n\\t\\t\\t\\tout = 20;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"U\\\":\\r\\n\\t\\t\\t\\tout = 21;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"V\\\":\\r\\n\\t\\t\\t\\tout = 22;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"W\\\":\\r\\n\\t\\t\\t\\tout = 23;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"X\\\":\\r\\n\\t\\t\\t\\tout = 24;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"Y\\\":\\r\\n\\t\\t\\t\\tout = 25;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"Z\\\":\\r\\n\\t\\t\\t\\tout = 26;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\" \\\":\\r\\n\\t\\t\\t\\tout = 27;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\".\\\":\\r\\n\\t\\t\\t\\tout = 28;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\",\\\":\\r\\n\\t\\t\\t\\tout = 29;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"!\\\":\\r\\n\\t\\t\\t\\tout = 30;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"?\\\":\\r\\n\\t\\t\\t\\tout = 31;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase \\\"'\\\":\\r\\n\\t\\t\\t\\tout = 32;\\r\\n\\t\\t\\tbreak;\\r\\n\\t}\\r\\n\\t\\t\\r\\n\\t\\treturn out;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ecd6c170caf084b288ecff1aa6eeb05\",\n \"score\": \"0.43587753\",\n \"text\": \"function pairElement(str) {\\n // convert loca var to array\\n str = str.split('');\\n // for each letter in teh array\\n str = str.map( x => {\\n // store it in a subarray\\n x = [x];\\n // find its matching pair and assign it to a second var\\n let y;\\n\\n switch(x[0]){\\n case 'A':\\n y = 'T';\\n break;\\n case 'T':\\n y = 'A';\\n break;\\n case 'G':\\n y = 'C'\\n break;\\n case 'C':\\n y = 'G';\\n break;\\n }\\n // push the pair into the sub array\\n x.push(y);\\n\\n return x;\\n\\n });\\n // return the new 2d array with pairs added\\n return str;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb892cbb8cbd73b0a5f1238e64d0ee83\",\n \"score\": \"0.43560347\",\n \"text\": \"function lboz2kg(text) {\\n\\tlet regex = new RegExp('(([0-9]{0,3}).?(lbs?).?([0-9]+(\\\\.[0-9]+)?).?oz)', 'g');\\n\\tif (text.search(regex) !== -1) {\\n\\t\\tlet matches;\\n\\n\\t\\twhile ((matches = regex.exec(text)) !== null) {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tconst original = matches[0];\\n\\t\\t\\t\\tlet lb = matches[2];\\n\\t\\t\\t\\tlb = parseFloat(lb);\\n\\t\\t\\t\\tlet oz = matches[4];\\n\\t\\t\\t\\toz = parseFloat(oz);\\n\\n\\t\\t\\t\\tlet total = 0;\\n\\n\\t\\t\\t\\ttotal = lb * 16 + oz;\\n\\n\\t\\t\\t\\tlet kg = prepareForOutput(roundNicely(total * 0.0283495), spc + 'kg', true);\\n\\t\\t\\t\\t//text = text.replace(matches[0], kg);\\n text = CleanReplace(text, matches[0], kg);\\n\\t\\t\\t} catch (err) {\\n\\t\\t\\t\\t// console.log(err.message);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn text;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"414d8e7029f20915affd40c83031c600\",\n \"score\": \"0.4349218\",\n \"text\": \"function indentation(value) {\\n var index = 0\\n var indent = 0\\n var character = value.charAt(index)\\n var stops = {}\\n var size\\n var lastIndent = 0\\n\\n while (character === tab || character === space) {\\n size = character === tab ? tabSize : spaceSize\\n\\n indent += size\\n\\n if (size > 1) {\\n indent = Math.floor(indent / size) * size\\n }\\n\\n while (lastIndent < indent) {\\n stops[++lastIndent] = index\\n }\\n\\n character = value.charAt(++index)\\n }\\n\\n return {indent: indent, stops: stops}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"414d8e7029f20915affd40c83031c600\",\n \"score\": \"0.4349218\",\n \"text\": \"function indentation(value) {\\n var index = 0\\n var indent = 0\\n var character = value.charAt(index)\\n var stops = {}\\n var size\\n var lastIndent = 0\\n\\n while (character === tab || character === space) {\\n size = character === tab ? tabSize : spaceSize\\n\\n indent += size\\n\\n if (size > 1) {\\n indent = Math.floor(indent / size) * size\\n }\\n\\n while (lastIndent < indent) {\\n stops[++lastIndent] = index\\n }\\n\\n character = value.charAt(++index)\\n }\\n\\n return {indent: indent, stops: stops}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c33a64fbacfed6b160155178ff60a5f0\",\n \"score\": \"0.4346995\",\n \"text\": \"function readPawnString(Pawnstring) {\\n //obj to store all the weights in,default everything to zero in the case a character doesnt use a certain stat\\n //eg Dps wont care about leech,chances are they wont be in the pawn string\\n var returnObj = {\\n \\\"PrimWeight\\\": 0,\\n \\\"HasteWeight\\\": 0,\\n \\\"CritWeight\\\": 0,\\n \\\"ArmorWeight\\\": 0,\\n \\\"LeechWeight\\\": 0,\\n \\\"MasteryWeight\\\": 0,\\n \\\"StaminaWeight\\\": 0,\\n \\\"VersatilityWeight\\\": 0,\\n \\\"WepDpsWeight\\\": 0\\n };\\n\\n try {\\n while (Pawnstring.includes(\\\":\\\")) {\\n Pawnstring = Pawnstring.substring(Pawnstring.indexOf(\\\":\\\") + 1);\\n }\\n\\n //now,spilt up the array on commas\\n var PawnArray = Pawnstring.split(\\\",\\\");\\n //check for the equal\\n var PrimWeight = PawnArray.filter(s => s.includes('Strength') || s.includes('Intellect') || s.includes('Agility')); //allows me to treat all these are the same value\\n if (PrimWeight && PrimWeight.length) { //make sure that there is stuff in the array\\n returnObj.PrimWeight = PrimWeight[0].split(\\\"=\\\")[1]; //get the decimal value out\\n }\\n var CritRating = PawnArray.filter(s => s.includes('Crit'));\\n if (CritRating && CritRating.length) {\\n returnObj.CritWeight = CritRating[0].split(\\\"=\\\")[1];\\n }\\n var HasteWeight = PawnArray.filter(s => s.includes('Haste'));\\n if (HasteWeight && HasteWeight.length) {\\n returnObj.HasteWeight = HasteWeight[0].split(\\\"=\\\")[1];\\n }\\n var LeechWeight = PawnArray.filter(s => s.includes('Leech'));\\n if (LeechWeight && LeechWeight.length) {\\n returnObj.LeechWeight = LeechWeight[0].split(\\\"=\\\")[1];\\n }\\n var MasteryWeight = PawnArray.filter(s => s.includes('Mast'));\\n if (MasteryWeight && MasteryWeight.length) {\\n returnObj.MasteryWeight = MasteryWeight[0].split(\\\"=\\\")[1];\\n }\\n var StaminaWeight = PawnArray.filter(s => s.includes('Stam'));\\n if (StaminaWeight && StaminaWeight.length) {\\n returnObj.StaminaWeight = StaminaWeight[0].split(\\\"=\\\")[1];\\n }\\n var ArmorWeight = PawnArray.filter(s => s.includes('Armor'));\\n if (ArmorWeight && ArmorWeight.length) {\\n returnObj.ArmorWeight = ArmorWeight[0].split(\\\"=\\\")[1];\\n }\\n var VersatilityWeight = PawnArray.filter(s => s.includes('Vers'));\\n if (VersatilityWeight && VersatilityWeight.length) {\\n returnObj.VersatilityWeight = VersatilityWeight[0].split(\\\"=\\\")[1];\\n }\\n var WepDpsWeight = PawnArray.filter(s => s.includes('Dps'));\\n if (WepDpsWeight && WepDpsWeight.length) {\\n returnObj.WepDpsWeight = WepDpsWeight[0].split(\\\"=\\\")[1];\\n }\\n\\n } catch (error) {\\n console.log(error.message)\\n return error;\\n }\\n return returnObj; //finally return the object\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f697a6aa46f3bf7c28a650b4e266eab8\",\n \"score\": \"0.4343305\",\n \"text\": \"function indentation(value) {\\n var index = 0\\n var indent = 0\\n var character = value.charAt(index)\\n var stops = {}\\n var size\\n\\n while (character === tab || character === space) {\\n size = character === tab ? tabSize : spaceSize\\n\\n indent += size\\n\\n if (size > 1) {\\n indent = Math.floor(indent / size) * size\\n }\\n\\n stops[indent] = index\\n character = value.charAt(++index)\\n }\\n\\n return {indent: indent, stops: stops}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58b59efe4f607fc444c08b40e6dce201\",\n \"score\": \"0.43410438\",\n \"text\": \"function initializeDictionary(d){ \\n data = {}\\n for(var letter=97;letter<123;letter++)\\n {\\n var _char = String.fromCharCode(letter);\\n data[_char] = []\\n }\\n for(var i = 0; i < d.length; i++){\\n var chunkItem = d[i].split(\\\"\\\\t\\\");\\n //console.log(chunkItem)\\n let key = chunkItem[1].charAt(0).toLowerCase();\\n if(!(key in data)){\\n data[key] = [{\\\"index\\\": chunkItem[0], \\\"value\\\": chunkItem[1], \\\"occurrences\\\":chunkItem[3]}];\\n }else{\\n data[key].push({\\\"index\\\": chunkItem[0], \\\"value\\\": chunkItem[1], \\\"occurrences\\\":chunkItem[3]});\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"267563966635a5e20d7441c3831c5d14\",\n \"score\": \"0.4335851\",\n \"text\": \"function encryption(string, mapping) {\\n let arrayOfMapping = mapping.split(',');\\n let dictionary = {};\\n let ans = '';\\n for (i = 0; i < arrayOfMapping.length; i++) {\\n let tempArray = arrayOfMapping[i].split(':');\\n dictionary[tempArray[0]] = tempArray[1];\\n }\\n for (i = 0; i < string.length; i++) {\\n curCharacter = string[i];\\n if (dictionary[curCharacter]) {\\n ans += dictionary[curCharacter];\\n } else ans += curCharacter;\\n }\\n return ans;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ead668d833944f945295b0f3e0c820df\",\n \"score\": \"0.43307334\",\n \"text\": \"function parseUserInput(letter) {\\n let indices = hangmanHash[letter];\\n indices.forEach(idx => hangmanOutput[idx] = letter);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0d647a8c60d1e4dbbb4134bfb66cb56\",\n \"score\": \"0.4323827\",\n \"text\": \"function processInput( callback ){\\n\\tvar i = 3, input = [], helper;\\n\\n\\tcallback = callback || function(){};\\n\\n\\treadInput(function( data ){\\n\\t\\thelper = data.split(' ');\\n\\t\\tif ( i == 3 ){\\n\\t\\t\\tinput.push({\\n\\t\\t\\t\\tN: parseInt( helper[0], 10),\\n\\t\\t\\t\\tK: parseInt( helper[1], 10),\\n\\t\\t\\t\\tQ: parseInt( helper[2], 10)\\n\\t\\t\\t});\\n\\t\\t}\\n\\n\\t\\telse if ( i == 2 ){\\n\\t\\t\\tinput.push({\\n\\t\\t\\t\\ta: parseInt( helper[0], 10),\\n\\t\\t\\t\\tb: parseInt( helper[1], 10),\\n\\t\\t\\t\\tc: parseInt( helper[2], 10),\\n\\t\\t\\t\\td: parseInt( helper[3], 10),\\n\\t\\t\\t\\te: parseInt( helper[4], 10),\\n\\t\\t\\t\\tf: parseInt( helper[5], 10),\\n\\t\\t\\t\\tr: parseInt( helper[6], 10),\\n\\t\\t\\t\\ts: parseInt( helper[7], 10),\\n\\t\\t\\t\\tt: parseInt( helper[8], 10),\\n\\t\\t\\t\\tm: parseInt( helper[9], 10),\\n\\t\\t\\t\\tA: parseInt( helper[10], 10)\\n\\t\\t\\t});\\n\\t\\t}\\n\\n\\t\\telse if ( i == 1 ){\\n\\t\\t\\tinput.push({\\n\\t\\t\\t\\tL1: parseInt( helper[0], 10),\\n\\t\\t\\t\\tLa: parseInt( helper[1], 10),\\n\\t\\t\\t\\tLc: parseInt( helper[2], 10),\\n\\t\\t\\t\\tLm: parseInt( helper[3], 10),\\n\\t\\t\\t\\tD1: parseInt( helper[4], 10),\\n\\t\\t\\t\\tDa: parseInt( helper[5], 10),\\n\\t\\t\\t\\tDc: parseInt( helper[6], 10),\\n\\t\\t\\t\\tDm: parseInt( helper[7], 10)\\n\\t\\t\\t});\\n\\t\\t}\\n\\t\\ti--;\\n\\n\\t\\tif ( i == 0 ){\\n\\t\\t\\tcallback( input );\\n\\t\\t}\\n\\t});\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88d05a294b65cb025a7d5af1ac41c859\",\n \"score\": \"0.43201917\",\n \"text\": \"function monospace(text, start, end, width) {\\n const glyphs = Math.min(width, end - start);\\n return {\\n start,\\n end: start + glyphs,\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5e6b57bd279575d213cec0f7792539d\",\n \"score\": \"0.43164945\",\n \"text\": \"function parse_RkNumber(data) {\\n\\t\\t\\tvar b = data.slice(data.l, data.l + 4);\\n\\t\\t\\tvar fX100 = b[0] & 1,\\n\\t\\t\\t fInt = b[0] & 2;\\n\\t\\t\\tdata.l += 4;\\n\\t\\t\\tb[0] &= 0xFC; // b[0] &= ~3;\\n\\t\\t\\tvar RK = fInt === 0 ? __double([0, 0, 0, 0, b[0], b[1], b[2], b[3]], 0) : __readInt32LE(b, 0) >> 2;\\n\\t\\t\\treturn fX100 ? RK / 100 : RK;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b455b1732c7e7f4749a437a358ec949c\",\n \"score\": \"0.43148813\",\n \"text\": \"function pair(str) {\\n //define a map object with all pair possibilities \\n var map = {T:'A', A:'T', G:'C', C:'G'};\\n //split str into a a char Array\\n strArr = str.split('');\\n //replace each Array item with a 2d Array using map\\n for (var i=0;i<strArr.length;i++){\\n strArr[i]=[strArr[i], map[strArr[i]]];\\n }\\n return strArr;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d3176cb597453fcf12078d7698d2cb8\",\n \"score\": \"0.4308658\",\n \"text\": \"function parse_RkNumber(data) {\\n\\tvar b = data.slice(data.l, data.l + 4);\\n\\tvar fX100 = (b[0] & 1), fInt = (b[0] & 2);\\n\\tdata.l += 4;\\n\\tb[0] &= 0xFC; // b[0] &= ~3;\\n\\tvar RK = fInt === 0 ? __double([0, 0, 0, 0, b[0], b[1], b[2], b[3]], 0) : __readInt32LE(b, 0) >> 2;\\n\\treturn fX100 ? (RK / 100) : RK;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"047f42f9a319f67e2e5083fe56bdb23a\",\n \"score\": \"0.43086547\",\n \"text\": \"static outerPair(string) {\\n let openingBracket = string.indexOf('[');\\n if (openingBracket === -1) {\\n return false;\\n }\\n let i = openingBracket + 1;\\n const chars = string.split('');\\n let open = 1;\\n while (open > 0) {\\n if (chars[i] === '[') {\\n ++open;\\n }\\n if (chars[i] === ']') {\\n --open;\\n }\\n ++i;\\n }\\n return [openingBracket, i - 1];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ebdb99fe2056720608da2f852f8aa9f\",\n \"score\": \"0.43058807\",\n \"text\": \"function readPawnString(Pawnstring) {\\n //obj to store all the weights in,default everything to zero in the case a character doesnt use a certain stat\\n //eg Dps wont care about leech,chances are they wont be in the pawn string\\n var returnObj = {\\n \\\"PrimWeight\\\": 0,\\n \\\"HasteWeight\\\": 0,\\n \\\"CritWeight\\\": 0,\\n \\\"ArmorWeight\\\": 0,\\n \\\"LeechWeight\\\": 0,\\n \\\"MasteryWeight\\\": 0,\\n \\\"StaminaWeight\\\": 0,\\n \\\"VersatilityWeight\\\": 0,\\n \\\"WepDpsWeight\\\": 0\\n };\\n Pawnstring = Pawnstring.replace(')', '');\\n try {\\n while (Pawnstring.includes(\\\":\\\")) {\\n Pawnstring = Pawnstring.substring(Pawnstring.indexOf(\\\":\\\") + 1);\\n }\\n\\n //now,spilt up the array on commas\\n var PawnArray = Pawnstring.split(\\\",\\\");\\n //check for the equal\\n var PrimWeight = PawnArray.filter(s => s.includes('Strength') || s.includes('Intellect') || s.includes('Agility')); //allows me to treat all these are the same value\\n if (PrimWeight && PrimWeight.length) { //make sure that there is stuff in the array\\n returnObj.PrimWeight = Number(PrimWeight[0].split(\\\"=\\\")[1]); //get the decimal value out\\n }\\n var CritRating = PawnArray.filter(s => s.includes('Crit'));\\n if (CritRating && CritRating.length) {\\n returnObj.CritWeight = Number(CritRating[0].split(\\\"=\\\")[1]);\\n }\\n var HasteWeight = PawnArray.filter(s => s.includes('Haste'));\\n if (HasteWeight && HasteWeight.length) {\\n returnObj.HasteWeight = Number(HasteWeight[0].split(\\\"=\\\")[1]);\\n }\\n var LeechWeight = PawnArray.filter(s => s.includes('Leech'));\\n if (LeechWeight && LeechWeight.length) {\\n returnObj.LeechWeight = Number(LeechWeight[0].split(\\\"=\\\")[1]);\\n }\\n var MasteryWeight = PawnArray.filter(s => s.includes('Mast'));\\n if (MasteryWeight && MasteryWeight.length) {\\n returnObj.MasteryWeight = Number(MasteryWeight[0].split(\\\"=\\\")[1]);\\n }\\n var StaminaWeight = PawnArray.filter(s => s.includes('Stam'));\\n if (StaminaWeight && StaminaWeight.length) {\\n returnObj.StaminaWeight = Number(StaminaWeight[0].split(\\\"=\\\")[1]);\\n }\\n var ArmorWeight = PawnArray.filter(s => s.includes('Armor'));\\n if (ArmorWeight && ArmorWeight.length) {\\n returnObj.ArmorWeight = Number(ArmorWeight[0].split(\\\"=\\\")[1]);\\n }\\n var VersatilityWeight = PawnArray.filter(s => s.includes('Vers'));\\n if (VersatilityWeight && VersatilityWeight.length) {\\n returnObj.VersatilityWeight = Number(VersatilityWeight[0].split(\\\"=\\\")[1]);\\n }\\n var WepDpsWeight = PawnArray.filter(s => s.includes('Dps'));\\n if (WepDpsWeight && WepDpsWeight.length) {\\n returnObj.WepDpsWeight = Number(WepDpsWeight[0].split(\\\"=\\\")[1]);\\n }\\n\\n } catch (error) {\\n console.log(error.message)\\n }\\n return returnObj; //finally return the object\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac695b54150a5154675da18e226828fe\",\n \"score\": \"0.43008116\",\n \"text\": \"function kFormatter(num, digits) {\\n var si = [\\n { value: 1, symbol: \\\"\\\" },\\n { value: 1e3, symbol: \\\"k\\\" },\\n { value: 1e6, symbol: \\\"M\\\" },\\n { value: 1e9, symbol: \\\"G\\\" },\\n { value: 1e12, symbol: \\\"T\\\" },\\n { value: 1e15, symbol: \\\"P\\\" },\\n { value: 1e18, symbol: \\\"E\\\" },\\n ];\\n var rx = /\\\\.0+$|(\\\\.[0-9]*[1-9])0+$/;\\n var i;\\n for (i = si.length - 1; i > 0; i--) {\\n if (num >= si[i].value) {\\n break;\\n }\\n }\\n return (num / si[i].value).toFixed(digits).replace(rx, \\\"$1\\\") + si[i].symbol;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a13be66a174b3b275f1edc5078769bcb\",\n \"score\": \"0.42941195\",\n \"text\": \"function knightjumps(str) {\\n const knight = [parseInt(str[1]), parseInt(str[3])] //get number values for knight's position\\n //create a nested array of possible moves ([x, y])\\n const moves = [\\n [-1, 2], [1, 2],\\n [-2, 1], [2, 1],\\n [-2, -1], [2, -1],\\n [-1, -2], [1, -2]\\n ]\\n //reduce moves, checking if they are valid given the knight's position\\n const result = (moves.reduce((totalMoves, currMove) => {\\n if (knight[0]+currMove[0] > 0 && knight[0]+currMove[0] <= 8 && knight[1]+currMove[1] > 0 && knight[1]+currMove[1] <= 8) ++totalMoves\\n return totalMoves\\n }, 0))\\n //return the number of possible moves\\n return result\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86d70e099e3f88d7ea8ec1f362051c2d\",\n \"score\": \"0.429006\",\n \"text\": \"function parseCFFCharstring(font, glyph, code) {\\n var c1x;\\n var c1y;\\n var c2x;\\n var c2y;\\n var p = new path.Path();\\n var stack = [];\\n var nStems = 0;\\n var haveWidth = false;\\n var width = font.defaultWidthX;\\n var open = false;\\n var x = 0;\\n var y = 0;\\n\\n function newContour(x, y) {\\n if (open) {\\n p.closePath();\\n }\\n\\n p.moveTo(x, y);\\n open = true;\\n }\\n\\n function parseStems() {\\n var hasWidthArg;\\n\\n // The number of stem operators on the stack is always even.\\n // If the value is uneven, that means a width is specified.\\n hasWidthArg = stack.length % 2 !== 0;\\n if (hasWidthArg && !haveWidth) {\\n width = stack.shift() + font.nominalWidthX;\\n }\\n\\n nStems += stack.length >> 1;\\n stack.length = 0;\\n haveWidth = true;\\n }\\n\\n function parse(code) {\\n var b1;\\n var b2;\\n var b3;\\n var b4;\\n var codeIndex;\\n var subrCode;\\n var jpx;\\n var jpy;\\n var c3x;\\n var c3y;\\n var c4x;\\n var c4y;\\n\\n var i = 0;\\n while (i < code.length) {\\n var v = code[i];\\n i += 1;\\n switch (v) {\\n case 1: // hstem\\n parseStems();\\n break;\\n case 3: // vstem\\n parseStems();\\n break;\\n case 4: // vmoveto\\n if (stack.length > 1 && !haveWidth) {\\n width = stack.shift() + font.nominalWidthX;\\n haveWidth = true;\\n }\\n\\n y += stack.pop();\\n newContour(x, y);\\n break;\\n case 5: // rlineto\\n while (stack.length > 0) {\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 6: // hlineto\\n while (stack.length > 0) {\\n x += stack.shift();\\n p.lineTo(x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 7: // vlineto\\n while (stack.length > 0) {\\n y += stack.shift();\\n p.lineTo(x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n x += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 8: // rrcurveto\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 10: // callsubr\\n codeIndex = stack.pop() + font.subrsBias;\\n subrCode = font.subrs[codeIndex];\\n if (subrCode) {\\n parse(subrCode);\\n }\\n\\n break;\\n case 11: // return\\n return;\\n case 12: // flex operators\\n v = code[i];\\n i += 1;\\n switch (v) {\\n case 35: // flex\\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 dx6 dy6 fd flex (12 35) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y + stack.shift(); // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = jpy + stack.shift(); // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n x = c4x + stack.shift(); // dx6\\n y = c4y + stack.shift(); // dy6\\n stack.shift(); // flex depth\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 34: // hflex\\n // |- dx1 dx2 dy2 dx3 dx4 dx5 dx6 hflex (12 34) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y; // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y; // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = c2y; // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = y; // dy5\\n x = c4x + stack.shift(); // dx6\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 36: // hflex1\\n // |- dx1 dy1 dx2 dy2 dx3 dx4 dx5 dy5 dx6 hflex1 (12 36) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y; // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = c2y; // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n x = c4x + stack.shift(); // dx6\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 37: // flex1\\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 d6 flex1 (12 37) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y + stack.shift(); // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = jpy + stack.shift(); // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n if (Math.abs(c4x - x) > Math.abs(c4y - y)) {\\n x = c4x + stack.shift();\\n } else {\\n y = c4y + stack.shift();\\n }\\n\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n default:\\n console.log('Glyph ' + glyph.index + ': unknown operator ' + 1200 + v);\\n stack.length = 0;\\n }\\n break;\\n case 14: // endchar\\n if (stack.length > 0 && !haveWidth) {\\n width = stack.shift() + font.nominalWidthX;\\n haveWidth = true;\\n }\\n\\n if (open) {\\n p.closePath();\\n open = false;\\n }\\n\\n break;\\n case 18: // hstemhm\\n parseStems();\\n break;\\n case 19: // hintmask\\n case 20: // cntrmask\\n parseStems();\\n i += (nStems + 7) >> 3;\\n break;\\n case 21: // rmoveto\\n if (stack.length > 2 && !haveWidth) {\\n width = stack.shift() + font.nominalWidthX;\\n haveWidth = true;\\n }\\n\\n y += stack.pop();\\n x += stack.pop();\\n newContour(x, y);\\n break;\\n case 22: // hmoveto\\n if (stack.length > 1 && !haveWidth) {\\n width = stack.shift() + font.nominalWidthX;\\n haveWidth = true;\\n }\\n\\n x += stack.pop();\\n newContour(x, y);\\n break;\\n case 23: // vstemhm\\n parseStems();\\n break;\\n case 24: // rcurveline\\n while (stack.length > 2) {\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n break;\\n case 25: // rlinecurve\\n while (stack.length > 6) {\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n break;\\n case 26: // vvcurveto\\n if (stack.length % 2) {\\n x += stack.shift();\\n }\\n\\n while (stack.length > 0) {\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x;\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 27: // hhcurveto\\n if (stack.length % 2) {\\n y += stack.shift();\\n }\\n\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y;\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 28: // shortint\\n b1 = code[i];\\n b2 = code[i + 1];\\n stack.push(((b1 << 24) | (b2 << 16)) >> 16);\\n i += 2;\\n break;\\n case 29: // callgsubr\\n codeIndex = stack.pop() + font.gsubrsBias;\\n subrCode = font.gsubrs[codeIndex];\\n if (subrCode) {\\n parse(subrCode);\\n }\\n\\n break;\\n case 30: // vhcurveto\\n while (stack.length > 0) {\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n y = c2y + stack.shift();\\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 31: // hvcurveto\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n y = c2y + stack.shift();\\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n default:\\n if (v < 32) {\\n console.log('Glyph ' + glyph.index + ': unknown operator ' + v);\\n } else if (v < 247) {\\n stack.push(v - 139);\\n } else if (v < 251) {\\n b1 = code[i];\\n i += 1;\\n stack.push((v - 247) * 256 + b1 + 108);\\n } else if (v < 255) {\\n b1 = code[i];\\n i += 1;\\n stack.push(-(v - 251) * 256 - b1 - 108);\\n } else {\\n b1 = code[i];\\n b2 = code[i + 1];\\n b3 = code[i + 2];\\n b4 = code[i + 3];\\n i += 4;\\n stack.push(((b1 << 24) | (b2 << 16) | (b3 << 8) | b4) / 65536);\\n }\\n }\\n }\\n }\\n\\n parse(code);\\n\\n glyph.advanceWidth = width;\\n return p;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86d70e099e3f88d7ea8ec1f362051c2d\",\n \"score\": \"0.429006\",\n \"text\": \"function parseCFFCharstring(font, glyph, code) {\\n var c1x;\\n var c1y;\\n var c2x;\\n var c2y;\\n var p = new path.Path();\\n var stack = [];\\n var nStems = 0;\\n var haveWidth = false;\\n var width = font.defaultWidthX;\\n var open = false;\\n var x = 0;\\n var y = 0;\\n\\n function newContour(x, y) {\\n if (open) {\\n p.closePath();\\n }\\n\\n p.moveTo(x, y);\\n open = true;\\n }\\n\\n function parseStems() {\\n var hasWidthArg;\\n\\n // The number of stem operators on the stack is always even.\\n // If the value is uneven, that means a width is specified.\\n hasWidthArg = stack.length % 2 !== 0;\\n if (hasWidthArg && !haveWidth) {\\n width = stack.shift() + font.nominalWidthX;\\n }\\n\\n nStems += stack.length >> 1;\\n stack.length = 0;\\n haveWidth = true;\\n }\\n\\n function parse(code) {\\n var b1;\\n var b2;\\n var b3;\\n var b4;\\n var codeIndex;\\n var subrCode;\\n var jpx;\\n var jpy;\\n var c3x;\\n var c3y;\\n var c4x;\\n var c4y;\\n\\n var i = 0;\\n while (i < code.length) {\\n var v = code[i];\\n i += 1;\\n switch (v) {\\n case 1: // hstem\\n parseStems();\\n break;\\n case 3: // vstem\\n parseStems();\\n break;\\n case 4: // vmoveto\\n if (stack.length > 1 && !haveWidth) {\\n width = stack.shift() + font.nominalWidthX;\\n haveWidth = true;\\n }\\n\\n y += stack.pop();\\n newContour(x, y);\\n break;\\n case 5: // rlineto\\n while (stack.length > 0) {\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 6: // hlineto\\n while (stack.length > 0) {\\n x += stack.shift();\\n p.lineTo(x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 7: // vlineto\\n while (stack.length > 0) {\\n y += stack.shift();\\n p.lineTo(x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n x += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 8: // rrcurveto\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 10: // callsubr\\n codeIndex = stack.pop() + font.subrsBias;\\n subrCode = font.subrs[codeIndex];\\n if (subrCode) {\\n parse(subrCode);\\n }\\n\\n break;\\n case 11: // return\\n return;\\n case 12: // flex operators\\n v = code[i];\\n i += 1;\\n switch (v) {\\n case 35: // flex\\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 dx6 dy6 fd flex (12 35) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y + stack.shift(); // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = jpy + stack.shift(); // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n x = c4x + stack.shift(); // dx6\\n y = c4y + stack.shift(); // dy6\\n stack.shift(); // flex depth\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 34: // hflex\\n // |- dx1 dx2 dy2 dx3 dx4 dx5 dx6 hflex (12 34) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y; // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y; // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = c2y; // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = y; // dy5\\n x = c4x + stack.shift(); // dx6\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 36: // hflex1\\n // |- dx1 dy1 dx2 dy2 dx3 dx4 dx5 dy5 dx6 hflex1 (12 36) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y; // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = c2y; // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n x = c4x + stack.shift(); // dx6\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 37: // flex1\\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 d6 flex1 (12 37) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y + stack.shift(); // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = jpy + stack.shift(); // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n if (Math.abs(c4x - x) > Math.abs(c4y - y)) {\\n x = c4x + stack.shift();\\n } else {\\n y = c4y + stack.shift();\\n }\\n\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n default:\\n console.log('Glyph ' + glyph.index + ': unknown operator ' + 1200 + v);\\n stack.length = 0;\\n }\\n break;\\n case 14: // endchar\\n if (stack.length > 0 && !haveWidth) {\\n width = stack.shift() + font.nominalWidthX;\\n haveWidth = true;\\n }\\n\\n if (open) {\\n p.closePath();\\n open = false;\\n }\\n\\n break;\\n case 18: // hstemhm\\n parseStems();\\n break;\\n case 19: // hintmask\\n case 20: // cntrmask\\n parseStems();\\n i += (nStems + 7) >> 3;\\n break;\\n case 21: // rmoveto\\n if (stack.length > 2 && !haveWidth) {\\n width = stack.shift() + font.nominalWidthX;\\n haveWidth = true;\\n }\\n\\n y += stack.pop();\\n x += stack.pop();\\n newContour(x, y);\\n break;\\n case 22: // hmoveto\\n if (stack.length > 1 && !haveWidth) {\\n width = stack.shift() + font.nominalWidthX;\\n haveWidth = true;\\n }\\n\\n x += stack.pop();\\n newContour(x, y);\\n break;\\n case 23: // vstemhm\\n parseStems();\\n break;\\n case 24: // rcurveline\\n while (stack.length > 2) {\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n break;\\n case 25: // rlinecurve\\n while (stack.length > 6) {\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n break;\\n case 26: // vvcurveto\\n if (stack.length % 2) {\\n x += stack.shift();\\n }\\n\\n while (stack.length > 0) {\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x;\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 27: // hhcurveto\\n if (stack.length % 2) {\\n y += stack.shift();\\n }\\n\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y;\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 28: // shortint\\n b1 = code[i];\\n b2 = code[i + 1];\\n stack.push(((b1 << 24) | (b2 << 16)) >> 16);\\n i += 2;\\n break;\\n case 29: // callgsubr\\n codeIndex = stack.pop() + font.gsubrsBias;\\n subrCode = font.gsubrs[codeIndex];\\n if (subrCode) {\\n parse(subrCode);\\n }\\n\\n break;\\n case 30: // vhcurveto\\n while (stack.length > 0) {\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n y = c2y + stack.shift();\\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 31: // hvcurveto\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n y = c2y + stack.shift();\\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n default:\\n if (v < 32) {\\n console.log('Glyph ' + glyph.index + ': unknown operator ' + v);\\n } else if (v < 247) {\\n stack.push(v - 139);\\n } else if (v < 251) {\\n b1 = code[i];\\n i += 1;\\n stack.push((v - 247) * 256 + b1 + 108);\\n } else if (v < 255) {\\n b1 = code[i];\\n i += 1;\\n stack.push(-(v - 251) * 256 - b1 - 108);\\n } else {\\n b1 = code[i];\\n b2 = code[i + 1];\\n b3 = code[i + 2];\\n b4 = code[i + 3];\\n i += 4;\\n stack.push(((b1 << 24) | (b2 << 16) | (b3 << 8) | b4) / 65536);\\n }\\n }\\n }\\n }\\n\\n parse(code);\\n\\n glyph.advanceWidth = width;\\n return p;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fa2db7c4e2ce4dabf7f89a7389d14a4\",\n \"score\": \"0.42895845\",\n \"text\": \"function rewrite(strN) {\\n var n = Number(strN);\\n\\n /* Starting with the highest-valued glyph:\\n take as many bites as we can with it\\n (decrementing residual value with each bite,\\n and appending a corresponding glyph copy to the string)\\n before moving down to the next most expensive glyph */\\n\\n // return Object.keys(dctGlyphs).reduce(\\n // OR:\\n return 'M CM D CD C XC L XL X IX V IV I'.split(' ').reduce(\\n function (s, k) {\\n var v = dctGlyphs[k];\\n return n >= v ? (n -= v, s + k) : s;\\n }, ''\\n )\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"683bd4b7e7cd7581387534e4e89782ee\",\n \"score\": \"0.42889175\",\n \"text\": \"setOtherVariables(fen) {\\n this.kingPos = { w: [-1, -1], b: [-1, -1] };\\n const fenParts = fen.split(\\\" \\\");\\n const position = fenParts[0].split(\\\"/\\\");\\n for (let i = 0; i < position.length; i++) {\\n let k = 0;\\n for (let j = 0; j < position[i].length; j++) {\\n switch (position[i].charAt(j)) {\\n case \\\"k\\\":\\n this.kingPos[\\\"b\\\"] = [i, k];\\n break;\\n case \\\"K\\\":\\n this.kingPos[\\\"w\\\"] = [i, k];\\n break;\\n default: {\\n const num = parseInt(position[i].charAt(j), 10);\\n if (!isNaN(num)) k += num - 1;\\n }\\n }\\n k++;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2c7a8f38a8679a75e0c14cd4496675c\",\n \"score\": \"0.4287234\",\n \"text\": \"function pairElement(str) {\\n let dna = [];\\n let codons = str.match(/[A-Z]/g);\\n codons.forEach(element => dna.push([element]));\\n dna.forEach(element => {\\n if (element[0] == 'C') {\\n element.push('G');\\n }\\n if (element[0] == 'G') {\\n element.push('C');\\n }\\n if (element[0] == 'T') {\\n element.push('A');\\n }\\n if (element[0] == 'A') {\\n element.push('T');\\n }\\n });\\n str = dna;\\n return str;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfb1b7863f281f7624669d245c904b35\",\n \"score\": \"0.42835\",\n \"text\": \"function mnemonicStrToArray(mnemonicStr) {\\n const mnemonicArray = mnemonicStr.split(\\\" \\\");\\n return mnemonicArray.map((word, idx) => ({index: idx + 1, word}))\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"843535b68abc1d7bbf69bf62bc3a31e2\",\n \"score\": \"0.4270495\",\n \"text\": \"function indentation(value) {\\n var index = 0;\\n var indent = 0;\\n var character = value.charAt(index);\\n var stops = {};\\n var size;\\n var lastIndent = 0;\\n\\n while (character === tab || character === space) {\\n size = character === tab ? tabSize : spaceSize;\\n\\n indent += size;\\n\\n if (size > 1) {\\n indent = Math.floor(indent / size) * size;\\n }\\n\\n while (lastIndent < indent) {\\n stops[++lastIndent] = index;\\n }\\n\\n character = value.charAt(++index);\\n }\\n\\n return { indent: indent, stops: stops };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1db965cacccd10adc7bf4cd4cae4cba\",\n \"score\": \"0.426854\",\n \"text\": \"function parseCFFCharstring(font, glyph, code) {\\n var c1x;\\n var c1y;\\n var c2x;\\n var c2y;\\n var p = new Path();\\n var stack = [];\\n var nStems = 0;\\n var haveWidth = false;\\n var open = false;\\n var x = 0;\\n var y = 0;\\n var subrs;\\n var subrsBias;\\n var defaultWidthX;\\n var nominalWidthX;\\n if (font.isCIDFont) {\\n var fdIndex = font.tables.cff.topDict._fdSelect[glyph.index];\\n var fdDict = font.tables.cff.topDict._fdArray[fdIndex];\\n subrs = fdDict._subrs;\\n subrsBias = fdDict._subrsBias;\\n defaultWidthX = fdDict._defaultWidthX;\\n nominalWidthX = fdDict._nominalWidthX;\\n } else {\\n subrs = font.tables.cff.topDict._subrs;\\n subrsBias = font.tables.cff.topDict._subrsBias;\\n defaultWidthX = font.tables.cff.topDict._defaultWidthX;\\n nominalWidthX = font.tables.cff.topDict._nominalWidthX;\\n }\\n var width = defaultWidthX;\\n\\n function newContour(x, y) {\\n if (open) {\\n p.closePath();\\n }\\n\\n p.moveTo(x, y);\\n open = true;\\n }\\n\\n function parseStems() {\\n var hasWidthArg;\\n\\n // The number of stem operators on the stack is always even.\\n // If the value is uneven, that means a width is specified.\\n hasWidthArg = stack.length % 2 !== 0;\\n if (hasWidthArg && !haveWidth) {\\n width = stack.shift() + nominalWidthX;\\n }\\n\\n nStems += stack.length >> 1;\\n stack.length = 0;\\n haveWidth = true;\\n }\\n\\n function parse(code) {\\n var b1;\\n var b2;\\n var b3;\\n var b4;\\n var codeIndex;\\n var subrCode;\\n var jpx;\\n var jpy;\\n var c3x;\\n var c3y;\\n var c4x;\\n var c4y;\\n\\n var i = 0;\\n while (i < code.length) {\\n var v = code[i];\\n i += 1;\\n switch (v) {\\n case 1: // hstem\\n parseStems();\\n break;\\n case 3: // vstem\\n parseStems();\\n break;\\n case 4: // vmoveto\\n if (stack.length > 1 && !haveWidth) {\\n width = stack.shift() + nominalWidthX;\\n haveWidth = true;\\n }\\n\\n y += stack.pop();\\n newContour(x, y);\\n break;\\n case 5: // rlineto\\n while (stack.length > 0) {\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 6: // hlineto\\n while (stack.length > 0) {\\n x += stack.shift();\\n p.lineTo(x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 7: // vlineto\\n while (stack.length > 0) {\\n y += stack.shift();\\n p.lineTo(x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n x += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n break;\\n case 8: // rrcurveto\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 10: // callsubr\\n codeIndex = stack.pop() + subrsBias;\\n subrCode = subrs[codeIndex];\\n if (subrCode) {\\n parse(subrCode);\\n }\\n\\n break;\\n case 11: // return\\n return;\\n case 12: // flex operators\\n v = code[i];\\n i += 1;\\n switch (v) {\\n case 35: // flex\\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 dx6 dy6 fd flex (12 35) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y + stack.shift(); // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = jpy + stack.shift(); // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n x = c4x + stack.shift(); // dx6\\n y = c4y + stack.shift(); // dy6\\n stack.shift(); // flex depth\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 34: // hflex\\n // |- dx1 dx2 dy2 dx3 dx4 dx5 dx6 hflex (12 34) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y; // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y; // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = c2y; // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = y; // dy5\\n x = c4x + stack.shift(); // dx6\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 36: // hflex1\\n // |- dx1 dy1 dx2 dy2 dx3 dx4 dx5 dy5 dx6 hflex1 (12 36) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y; // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = c2y; // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n x = c4x + stack.shift(); // dx6\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n case 37: // flex1\\n // |- dx1 dy1 dx2 dy2 dx3 dy3 dx4 dy4 dx5 dy5 d6 flex1 (12 37) |-\\n c1x = x + stack.shift(); // dx1\\n c1y = y + stack.shift(); // dy1\\n c2x = c1x + stack.shift(); // dx2\\n c2y = c1y + stack.shift(); // dy2\\n jpx = c2x + stack.shift(); // dx3\\n jpy = c2y + stack.shift(); // dy3\\n c3x = jpx + stack.shift(); // dx4\\n c3y = jpy + stack.shift(); // dy4\\n c4x = c3x + stack.shift(); // dx5\\n c4y = c3y + stack.shift(); // dy5\\n if (Math.abs(c4x - x) > Math.abs(c4y - y)) {\\n x = c4x + stack.shift();\\n } else {\\n y = c4y + stack.shift();\\n }\\n\\n p.curveTo(c1x, c1y, c2x, c2y, jpx, jpy);\\n p.curveTo(c3x, c3y, c4x, c4y, x, y);\\n break;\\n default:\\n console.log('Glyph ' + glyph.index + ': unknown operator ' + 1200 + v);\\n stack.length = 0;\\n }\\n break;\\n case 14: // endchar\\n if (stack.length > 0 && !haveWidth) {\\n width = stack.shift() + nominalWidthX;\\n haveWidth = true;\\n }\\n\\n if (open) {\\n p.closePath();\\n open = false;\\n }\\n\\n break;\\n case 18: // hstemhm\\n parseStems();\\n break;\\n case 19: // hintmask\\n case 20: // cntrmask\\n parseStems();\\n i += (nStems + 7) >> 3;\\n break;\\n case 21: // rmoveto\\n if (stack.length > 2 && !haveWidth) {\\n width = stack.shift() + nominalWidthX;\\n haveWidth = true;\\n }\\n\\n y += stack.pop();\\n x += stack.pop();\\n newContour(x, y);\\n break;\\n case 22: // hmoveto\\n if (stack.length > 1 && !haveWidth) {\\n width = stack.shift() + nominalWidthX;\\n haveWidth = true;\\n }\\n\\n x += stack.pop();\\n newContour(x, y);\\n break;\\n case 23: // vstemhm\\n parseStems();\\n break;\\n case 24: // rcurveline\\n while (stack.length > 2) {\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n break;\\n case 25: // rlinecurve\\n while (stack.length > 6) {\\n x += stack.shift();\\n y += stack.shift();\\n p.lineTo(x, y);\\n }\\n\\n c1x = x + stack.shift();\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n break;\\n case 26: // vvcurveto\\n if (stack.length % 2) {\\n x += stack.shift();\\n }\\n\\n while (stack.length > 0) {\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x;\\n y = c2y + stack.shift();\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 27: // hhcurveto\\n if (stack.length % 2) {\\n y += stack.shift();\\n }\\n\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y;\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 28: // shortint\\n b1 = code[i];\\n b2 = code[i + 1];\\n stack.push(((b1 << 24) | (b2 << 16)) >> 16);\\n i += 2;\\n break;\\n case 29: // callgsubr\\n codeIndex = stack.pop() + font.gsubrsBias;\\n subrCode = font.gsubrs[codeIndex];\\n if (subrCode) {\\n parse(subrCode);\\n }\\n\\n break;\\n case 30: // vhcurveto\\n while (stack.length > 0) {\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n y = c2y + stack.shift();\\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n case 31: // hvcurveto\\n while (stack.length > 0) {\\n c1x = x + stack.shift();\\n c1y = y;\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n y = c2y + stack.shift();\\n x = c2x + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n if (stack.length === 0) {\\n break;\\n }\\n\\n c1x = x;\\n c1y = y + stack.shift();\\n c2x = c1x + stack.shift();\\n c2y = c1y + stack.shift();\\n x = c2x + stack.shift();\\n y = c2y + (stack.length === 1 ? stack.shift() : 0);\\n p.curveTo(c1x, c1y, c2x, c2y, x, y);\\n }\\n\\n break;\\n default:\\n if (v < 32) {\\n console.log('Glyph ' + glyph.index + ': unknown operator ' + v);\\n } else if (v < 247) {\\n stack.push(v - 139);\\n } else if (v < 251) {\\n b1 = code[i];\\n i += 1;\\n stack.push((v - 247) * 256 + b1 + 108);\\n } else if (v < 255) {\\n b1 = code[i];\\n i += 1;\\n stack.push(-(v - 251) * 256 - b1 - 108);\\n } else {\\n b1 = code[i];\\n b2 = code[i + 1];\\n b3 = code[i + 2];\\n b4 = code[i + 3];\\n i += 4;\\n stack.push(((b1 << 24) | (b2 << 16) | (b3 << 8) | b4) / 65536);\\n }\\n }\\n }\\n }\\n\\n parse(code);\\n\\n glyph.advanceWidth = width;\\n return p;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8a54ec8548629f90b3b720a92ed74e4\",\n \"score\": \"0.42648628\",\n \"text\": \"cfg2kv (cfg) {\\n\\n /* helper function for character class checking */\\n const isAlpha = (ch) => {\\n let cc = ch.charCodeAt(0)\\n return (\\n (\\\"A\\\".charCodeAt(0) <= cc && cc <= \\\"Z\\\".charCodeAt(0))\\n || (\\\"a\\\".charCodeAt(0) <= cc && cc <= \\\"z\\\".charCodeAt(0))\\n )\\n }\\n const isDigit = (ch) => {\\n let cc = ch.charCodeAt(0)\\n return (\\\"0\\\".charCodeAt(0) <= cc && cc <= \\\"9\\\".charCodeAt(0))\\n }\\n\\n /* helper function for consuming and looking at next characters */\\n const consume = (cfg, num) => {\\n if (num > 0)\\n cfg = cfg.substr(num)\\n return cfg\\n }\\n const lookahead = (cfg) => {\\n let ch = cfg.substr(0, 1)\\n let la = cfg.substr(1, 1)\\n return { ch, la }\\n }\\n\\n /* iterate over the configuration file content */\\n let kv = \\\"\\\"\\n let ns = []\\n let id = \\\"\\\"\\n let expect = \\\"key\\\"\\n while (cfg !== \\\"\\\") {\\n /* extract first and second (look-ahead) character */\\n let { ch, la } = lookahead(cfg)\\n\\n /* white-space */\\n if (ch === \\\" \\\" || ch === \\\"\\\\t\\\" || ch === \\\"\\\\n\\\")\\n cfg = consume(cfg, 1)\\n\\n /* end-of-line comment */\\n else if (ch === \\\"/\\\" && la === \\\"/\\\") {\\n while (cfg !== \\\"\\\" && ch !== \\\"\\\\n\\\") {\\n cfg = consume(cfg, 1)\\n ch = lookahead(cfg).ch\\n }\\n }\\n\\n /* section start end end */\\n else if (ch === \\\"{\\\") {\\n ns.push(id)\\n cfg = consume(cfg, 1)\\n expect = \\\"key\\\"\\n }\\n else if (ch === \\\"}\\\") {\\n ns.pop()\\n cfg = consume(cfg, 1)\\n }\\n\\n /* key */\\n else if (expect === \\\"key\\\" && isAlpha(ch)) {\\n id = \\\"\\\"\\n while (isAlpha(ch)) {\\n id += ch\\n cfg = consume(cfg, 1)\\n ch = lookahead(cfg).ch\\n }\\n expect = \\\"val\\\"\\n }\\n\\n /* key to value punctuation operator */\\n else if (ch === \\\"=\\\") {\\n cfg = consume(cfg, 1)\\n }\\n\\n /* number value */\\n else if (expect === \\\"val\\\" && isDigit(ch)) {\\n let num = \\\"\\\"\\n while (isDigit(ch)) {\\n num += ch\\n cfg = consume(cfg, 1)\\n ch = lookahead(cfg).ch\\n }\\n kv += `${[ ...ns, id].join(\\\".\\\")} ${parseInt(num, 10)}\\\\n`\\n expect = \\\"key\\\"\\n }\\n\\n /* string value */\\n else if (expect === \\\"val\\\" && ch === \\\"\\\\\\\"\\\") {\\n let str = \\\"\\\"\\n let escaped = false\\n cfg = consume(cfg, 1)\\n ch = lookahead(cfg).ch\\n while (ch !== \\\"\\\\\\\"\\\" || escaped) {\\n if (ch === \\\"\\\\\\\\\\\")\\n escaped = true\\n else {\\n escaped = false\\n str += ch\\n }\\n cfg = consume(cfg, 1)\\n ch = lookahead(cfg).ch\\n }\\n cfg = consume(cfg, 1)\\n ch = lookahead(cfg).ch\\n kv += `${[ ...ns, id ].join(\\\".\\\")} ${str}\\\\n`\\n expect = \\\"key\\\"\\n }\\n\\n /* everything else leads to a parsing error */\\n else {\\n throw new Error(\\\"unexpected character: \\\\\\\"\\\" + ch + \\\"\\\\\\\" (at \\\\\\\"\\\" + cfg + \\\"\\\\\\\")\\\")\\n }\\n }\\n return kv\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fd7492a519c79194e37c4b6c49733a7\",\n \"score\": \"0.42614576\",\n \"text\": \"translateStalks(str) {\\n\\treturn str.replace(/[89]/g, '2').replace(/[45]/g, '3').match(/[23]{1,3}/g).map((x) => {\\n\\t switch(x) {\\n\\t case '222': return '6';\\n\\t case '322': case '232': case '223': return '7';\\n\\t case '233': case '323': case '332': return '8';\\n\\t case '333': return '9';\\n\\t default: return '';\\n\\t }\\n\\t}).join('');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c57bed85d8f1484b50e1229becee4c8\",\n \"score\": \"0.4258944\",\n \"text\": \"intervalFromKey(k) {\\n\\t\\tif (k == ' ' || k == 'j') {\\n\\t\\t\\tk = this.lastKey;\\n\\t\\t} else {\\n\\t\\t\\tthis.lastKey = k;\\n\\t\\t}\\n\\t\\tlet interval = null;\\n\\t\\tswitch (k) {\\n\\t\\t\\tcase 'n':\\n\\t\\t\\t\\tinterval = 1;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'h':\\n\\t\\t\\t\\tinterval = -1;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase \\\"'\\\":\\n\\t\\t\\t\\tinterval = 0;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 's':\\n\\t\\t\\t\\tinterval = 2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'r':\\n\\t\\t\\t\\tinterval = -3;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'i':\\n\\t\\t\\t\\tinterval = 3;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'k':\\n\\t\\t\\t\\tinterval = -2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'c':\\n\\t\\t\\t\\tinterval = -7;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'x':\\n\\t\\t\\t\\tinterval = -14;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase ',':\\n\\t\\t\\t\\tinterval = 7;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '.':\\n\\t\\t\\t\\tinterval = 14;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'p':\\n\\t\\t\\t\\tinterval = -4;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'e':\\n\\t\\t\\t\\tinterval = 4;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'w':\\n\\t\\t\\t\\tinterval = 5;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'v':\\n\\t\\t\\t\\tinterval = -6;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'm':\\n\\t\\t\\t\\tinterval = 6;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\tinterval = null;\\n\\t\\t}\\n\\t\\treturn interval;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"137236b29c5bb8f61e087b6ce49bb465\",\n \"score\": \"0.42544\",\n \"text\": \"function pairElement(str) {\\n str = str.toUpperCase();\\n const pairs = {\\n \\\"A\\\": \\\"T\\\",\\n \\\"T\\\": \\\"A\\\",\\n \\\"C\\\": \\\"G\\\",\\n \\\"G\\\": \\\"C\\\"\\n }\\n let arr = str.split(\\\"\\\");\\n return arr.map(x => [x, pairs[x]]);\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":95,"cells":{"query_id":{"kind":"string","value":"2bdb3980bcab3c031f24d4e9b685fa86"},"query":{"kind":"string","value":"Old versions of Chromium (below 61.0.3163.100) formats floating pointer numbers in a localedependent way, using a comma instead of a dot. If comma is not replaced with a dot, the input will be rounded down (i.e. acting as a floor function) causing unexpected behaviors"},"positive_passages":{"kind":"list like","value":[{"docid":"1b013ee53f896cd3a04fd7de1975605a","score":"0.0","text":"function toMs (s) {\n return Number(s.slice(0, -1).replace(',', '.')) * 1000\n}","title":""}],"string":"[\n {\n \"docid\": \"1b013ee53f896cd3a04fd7de1975605a\",\n \"score\": \"0.0\",\n \"text\": \"function toMs (s) {\\n return Number(s.slice(0, -1).replace(',', '.')) * 1000\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"7cd0487307e1ea18a14162b76c663248","score":"0.67688954","text":"function commaOnly(value) {\n var num = parseFloat(value);\n if ((vp.utils.isNumber(num)) && (!isNaN(num)) && (value.toString().indexOf(\"e+\") == -1)) {\n //---- add commas, as needed ----\n var parts = value.toString().split('.'); // DON'T use 'num' here: we want to preserve any trailing 0's in the mantissa of 'value' [as potentially added by comma()]\n var left = parts[0];\n var right = (parts.length > 1) ? \".\" + parts[1] : \"\";\n var len = left.length;\n if (len > 3) {\n var startLen = (len % 3) == 0 ? 3 : len % 3;\n var newLeft = left.substring(0, startLen);\n for (var i = startLen; i < len; i += 3) {\n newLeft += THOUSAND_SEPARATOR + left.substring(i, i + 3);\n }\n value = newLeft + right;\n //---- avoid \"-,\" problem ----\n if (value.startsWith(\"-,\")) {\n value = \"-\" + value.substr(2);\n }\n }\n }\n return (value.toString());\n }","title":""},{"docid":"4221fd12f668497b4fdc67753a9300f1","score":"0.6549909","text":"function number_format(number, decimals, decPoint, thousandsSep) {\n number = (number + \"\").replace(/[^0-9+\\-Ee.]/g, \"\");\n var n = !isFinite(+number) ? 0 : +number;\n var prec = !isFinite(+decimals) ? 0 : Math.abs(decimals);\n var sep = typeof thousandsSep === \"undefined\" ? \",\" : thousandsSep;\n var dec = typeof decPoint === \"undefined\" ? \".\" : decPoint;\n var s = \"\";\n\n var toFixedFix = function(n, prec) {\n var k = Math.pow(10, prec);\n return \"\" + (Math.round(n * k) / k).toFixed(prec);\n };\n\n // @todo: for IE parseFloat(0.55).toFixed(0) = 0;\n s = (prec ? toFixedFix(n, prec) : \"\" + Math.round(n)).split(\".\");\n if (s[0].length > 3) {\n s[0] = s[0].replace(/\\B(?=(?:\\d{3})+(?!\\d))/g, sep);\n }\n if ((s[1] || \"\").length < prec) {\n s[1] = s[1] || \"\";\n s[1] += new Array(prec - s[1].length + 1).join(\"0\");\n }\n\n return s.join(dec);\n}","title":""},{"docid":"06d32515e4acb17e2f106e2073f36807","score":"0.6539572","text":"function formatWithCommas(value) {\n\tvar parts = value.toString().split(\".\");\n\tparts[0] = parts[0].replace(/,/gi, \"\"); // remove existing commas\n\tparts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n\n\treturn parts.join(\".\");\n}","title":""},{"docid":"ee3a7cb755eaf7a9a231e3380bb0bdcd","score":"0.64501745","text":"function number_format(number, decimals, dec_point, thousands_sep) {\r\n\tnumber = (number + '').replace(/[^0-9+\\-Ee.]/g, '');\r\n\tvar n = !isFinite(+number) ? 0 : +number,\r\n\t\tprec = !isFinite(+decimals) ? 0 : Math.abs(decimals),\r\n\t\tsep = (typeof thousands_sep === 'undefined') ? ',' : thousands_sep,\r\n\t\tdec = (typeof dec_point === 'undefined') ? '.' : dec_point,\r\n\t\ts = '',\r\n\t\ttoFixedFix = function (n, prec) {\r\n\t\t\tvar k = Math.pow(10, prec);\r\n\t\t\treturn '' + (Math.round(n * k) / k)\r\n\t\t\t\t.toFixed(prec);\r\n\t\t};\r\n\t// Fix for IE parseFloat(0.55).toFixed(0) = 0;\r\n\ts = (prec ? toFixedFix(n, prec) : '' + Math.round(n))\r\n\t\t.split('.');\r\n\tif (s[0].length > 3) {\r\n\t\ts[0] = s[0].replace(/\\B(?=(?:\\d{3})+(?!\\d))/g, sep);\r\n\t}\r\n\tif ((s[1] || '')\r\n\t\t.length < prec) {\r\n\t\ts[1] = s[1] || '';\r\n\t\ts[1] += new Array(prec - s[1].length + 1)\r\n\t\t\t.join('0');\r\n\t}\r\n\treturn s.join(dec);\r\n}","title":""},{"docid":"7a608aefe6b336ee11402b3b2c98fd15","score":"0.64480454","text":"function util_insertComma(value) {\r\n\tif (value == '') return value;\r\n\r\n\tvalue = parseFloat(value, 10).toString()\r\n\twhile (true) {\r\n\t\r\n\t\tif (value.indexOf(',') != -1)\r\n\t\t\tidx = value.search(/[^,\\.\\-]([0-9]{3})+\\,/);\r\n\t\telse\r\n\t\t\tidx = value.search(/[^,\\.\\-]([0-9]{3})+$/);\r\n\t\tif (idx == -1) break;\r\n\t\t\tvalue = value.substring(0, idx+1) + '.' + value.substring(idx+1, value.length);\r\n\t}\r\n\treturn value;\r\n}","title":""},{"docid":"d5edc8cf44a93103be33c181bc51607b","score":"0.64430237","text":"function commafy(num) {\n\tvar str = num.toString().split('.');\n\tif (str[0].length > 3) {\n\t\tstr[0] = str[0].replace(/(\\d)(?=(\\d{3})+$)/g, '$1,');\n\t}\n\tif (str[1] && str[1].length > 3) {\n\t\tstr[1] = str[1].replace(/(\\d{3})/g, '$1,');\n\t\tif (str[1].endsWith(\",\")) str[1] = str.slice(0, -1);\n\t}\n\treturn str.join('.');\n}","title":""},{"docid":"66ac6c2e1fbf67ce2fc05267af4c61d4","score":"0.6398246","text":"function fmt_num(str) {\r\nvar value=0.0;\r\nvar x= str.lastIndexOf(\".\");\r\nvar y= str.lastIndexOf(\",\");\r\n \r\n if ( !isNum(str) )\r\n return(value);\r\n\r\n\r\n if ( x == -1 && y == -1 ){\r\n value = parseInt(str);\r\n return(value);\r\n }\r\n\r\n if ( x < y )\r\n x=y;\r\n\r\n txt1=str.substring(0,x);\r\n if (txt1 == '') txt1 = '0';\r\n txt1=replace(txt1,',',''); \r\n txt1=replace(txt1,'.',''); \r\n txt1=replace(txt1,' ',''); \r\n \r\n txt=txt1+'.'+str.substring(x+1);\r\n value = (parseInt(txt1) + parseFloat('.'+str.substring(x+1)));\r\n\r\nreturn(value);\r\n}","title":""},{"docid":"44d048819ad52701d6ca17f7280139ce","score":"0.63726974","text":"function transformaMoedaRealParaFloat(num) {\n// console.log('1>> ');\n// console.log(num);\n \n if(num.indexOf(',')) {\n num = num.replace('.', '');\n num = num.replace(',', '.');\n\n num = parseFloat(num);\n }\n \n// console.log('2>> ');\n// console.log(num);\n \n if(num % 1 === 0) {\n num = num + ',00';\n }\n \n// console.log('3>> ');\n// console.log(num);\n\n return num;\n}","title":""},{"docid":"6fb7d0c45bfd51e7bb20d9bedec59007","score":"0.6353352","text":"function formatter(val)\n\t\t\t\t{\n\t\t\t\tval = val.replace(/[^\\d,.]*([\\d,|.]*)/g,'$1');\n\t\t\t\treturn val;\n\t\t\t\t}","title":""},{"docid":"fb22f5e8f7832dbe65605a4c1afc5f0c","score":"0.62841463","text":"function numberWithCommas(x)\n{\n var parts = x.toString().split(\".\");\n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n return parts.join(\".\");\n}","title":""},{"docid":"87a129ad9b746d8d550dfc2d7d4c20f1","score":"0.6278547","text":"function numberWithCommas(x) {\n var parts = x.toString().split(\".\");\n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n return parts.join(\".\");\n }","title":""},{"docid":"8d7aad2b423ef128d972067efcc49815","score":"0.62725496","text":"function FormatNumericWithSeparate(field)\n{\n\tvar DecimalNumber = 1;\n\tvar DecimalChar = \".\";\n\tvar SeperateChar = \",\";\n\tvar ValueString = parseFloat(field.value.replace(/,/g,'')).toString();\n\t//var ValueString = field.value;\n\tvar ValueStringAfterDecimal = \"\";\n\tvar ValueStringNew = \"\";\t\n\t//if (field.value < 0)\n\tif (ValueString < 0)\n\t{\n\t\tValueString = ValueString.substring(1, ValueString.length); //Bo dau tru\t\t\t\t\n\t}\t\t\n\tif (ValueString.indexOf(DecimalChar) != -1)\n\t{\n\t\tValueStringAfterDecimal = ValueString.substring(ValueString.indexOf(DecimalChar), ValueString.indexOf(DecimalChar) + 2 + DecimalNumber) // Tinh luon dau cham\n\t\t//alert(ValueStringAfterDecimal);\n\t\tValueString = ValueString.substring(0, ValueString.indexOf(DecimalChar))\n\t}\n\n\tif (ValueStringAfterDecimal.indexOf(SeperateChar) != -1)\n\t{\n\t\tGetAlertError(iTotal,DSAlert,\"0035\");\n\t\tfield.value = \"\";\n\t\tfield.focus();\t\t\n\t\treturn;\n\t}\t\n\tValueString = ValueString.replace(/,/g,'');\n\tValueStringNew = \"\";\n\twhile (ValueString.length >3)\n\t{\n\t\tValueStringNew = SeperateChar + ValueString.substring(ValueString.length - 3, ValueString.length) + ValueStringNew;\n\t\tValueString = ValueString.substring(0, ValueString.length - 3);\n\t}\n\tif (DecimalNumber != 0)\n\t\tValueStringNew = ValueString + ValueStringNew + ValueStringAfterDecimal;\n\telse\n\t\tValueStringNew = ValueString + ValueStringNew;\t\n\t//if (field.value < 0) \n\tif (parseFloat(field.value.replace(/,/g,'')) < 0) \t\n\t\tValueStringNew = \"-\" + ValueStringNew;\n\t\n\tfield.value = ValueStringNew;\n}","title":""},{"docid":"f89412344a6853e9a1c690c3dac0cad7","score":"0.62639844","text":"function numberWithCommas(value) {\n if (formatting) {\n var parts = value.toString().split(decimalSeparator);\n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, groupSeparator);\n return parts.join(decimalSeparator);\n }\n else {\n return value;\n }\n }","title":""},{"docid":"609aa9516416f2c392e0b3b5a90f61f8","score":"0.626219","text":"function numberWithCommas(x) {\n var parts = x.toFixed(2).toString().split(\".\");\n \n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n \n return parts.join(\".\");\n }","title":""},{"docid":"a791ec7302ae7f980affdf1d03992d2d","score":"0.62604284","text":"function format(n){\r\n return n.toFixed(1).replace(/(\\d)(?=(\\d{3})+\\.)/g, \"$1,\");\r\n}","title":""},{"docid":"21d10cfa3fe7afadbe32d238f76a0645","score":"0.62476677","text":"function number_format (number, decimals, dec_point, thousands_sep) {\n // Strip all characters but numerical ones.\n number = (number + '').replace(/[^0-9+\\-Ee.]/g, '');\n var n = !isFinite(+number) ? 0 : +number,\n prec = !isFinite(+decimals) ? 0 : Math.abs(decimals),\n sep = (typeof thousands_sep === 'undefined') ? ',' : thousands_sep,\n dec = (typeof dec_point === 'undefined') ? '.' : dec_point,\n s = '',\n toFixedFix = function (n, prec) {\n var k = Math.pow(10, prec);\n return '' + Math.round(n * k) / k;\n };\n // Fix for IE parseFloat(0.55).toFixed(0) = 0;\n s = (prec ? toFixedFix(n, prec) : '' + Math.round(n)).split('.');\n if (s[0].length > 3) {\n s[0] = s[0].replace(/\\B(?=(?:\\d{3})+(?!\\d))/g, sep);\n }\n if ((s[1] || '').length < prec) {\n s[1] = s[1] || '';\n s[1] += new Array(prec - s[1].length + 1).join('0');\n }\n return s.join(dec);\n}","title":""},{"docid":"21d10cfa3fe7afadbe32d238f76a0645","score":"0.62476677","text":"function number_format (number, decimals, dec_point, thousands_sep) {\n // Strip all characters but numerical ones.\n number = (number + '').replace(/[^0-9+\\-Ee.]/g, '');\n var n = !isFinite(+number) ? 0 : +number,\n prec = !isFinite(+decimals) ? 0 : Math.abs(decimals),\n sep = (typeof thousands_sep === 'undefined') ? ',' : thousands_sep,\n dec = (typeof dec_point === 'undefined') ? '.' : dec_point,\n s = '',\n toFixedFix = function (n, prec) {\n var k = Math.pow(10, prec);\n return '' + Math.round(n * k) / k;\n };\n // Fix for IE parseFloat(0.55).toFixed(0) = 0;\n s = (prec ? toFixedFix(n, prec) : '' + Math.round(n)).split('.');\n if (s[0].length > 3) {\n s[0] = s[0].replace(/\\B(?=(?:\\d{3})+(?!\\d))/g, sep);\n }\n if ((s[1] || '').length < prec) {\n s[1] = s[1] || '';\n s[1] += new Array(prec - s[1].length + 1).join('0');\n }\n return s.join(dec);\n}","title":""},{"docid":"2d7c04ac4449f2b669b035cdedfbb121","score":"0.62447894","text":"function numberWithCommas(x) {\n var parts = x.toString().split(\".\");\n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n return parts.join(\".\");\n}","title":""},{"docid":"83cd05641a725365fc1ade3a15244797","score":"0.6244642","text":"numberWithCommas(x) {\n // Async edge case so page will not break in case of large data loads\n if (!x) {\n return 'Loading...';\n }\n\n return x.toString().replace(/\\B(?<!\\.\\d*)(?=(\\d{3})+(?!\\d))/g, ',');\n }","title":""},{"docid":"2c51f96ff3e78cb9f01ad5d9e20d29d5","score":"0.6239393","text":"function formatNumber(x) {\n var parts = x.toString().split(\".\");\n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n return parts.join(\".\");\n}","title":""},{"docid":"2c51f96ff3e78cb9f01ad5d9e20d29d5","score":"0.6239393","text":"function formatNumber(x) {\n var parts = x.toString().split(\".\");\n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n return parts.join(\".\");\n}","title":""},{"docid":"46f00961f5e10bf4405a3c9564d0c77e","score":"0.62284285","text":"function numberWithCommas(x) {\n let parts = x.toString().split(\".\");\n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n return parts.join(\".\");\n }","title":""},{"docid":"d0a6d9783c15b0ac107dc7e257751587","score":"0.6213095","text":"function numberWithCommas(x) {\n var parts = x.toString().split(\".\");\n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n return parts.join(\".\");\n }","title":""},{"docid":"1fe4198230a8cb083d59129efe449724","score":"0.62070143","text":"function number_format(val, decimals){\n //Parse the value as a float value\n val = parseFloat(val);\n //Format the value w/ the specified number\n //of decimal places and return it.\n return val.toFixed(decimals);\n}","title":""},{"docid":"ff4fccaa8020212c1f5f80f7340eb777","score":"0.61779356","text":"function decimalDeprecated() {\n return fluent_lib_1.pipe(functional_lib_1.or(functional_lib_1.string(), functional_lib_1.finiteNumber(), functional_lib_1.bigInt()), function (_name, mixed) {\n return mixed.toString();\n }, functional_lib_1.floatingPointFormatString());\n}","title":""},{"docid":"ff4fccaa8020212c1f5f80f7340eb777","score":"0.61779356","text":"function decimalDeprecated() {\n return fluent_lib_1.pipe(functional_lib_1.or(functional_lib_1.string(), functional_lib_1.finiteNumber(), functional_lib_1.bigInt()), function (_name, mixed) {\n return mixed.toString();\n }, functional_lib_1.floatingPointFormatString());\n}","title":""},{"docid":"92e90e11f7db4353033232bd34ea7f64","score":"0.6162317","text":"numberWithCommas(x) {\n if (!x) {\n return \"$0\";\n }\n x = parseFloat(x.toFixed(2));\n return \"$\" + x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n }","title":""},{"docid":"27da8dca3a230e98fe36ba2622133b84","score":"0.61612964","text":"function formatNumber(num) {\r\n if (!num || num == 'NaN') return '-';\r\n if (num == 'Infinity') return '∞';\r\n num = num.toString().replace(/\\$|\\,/g, '');\r\n if (isNaN(num))\r\n num = \"0\";\r\n sign = (num == (num = Math.abs(num)));\r\n num = Math.floor(num * 100 + 0.50000000001);\r\n cents = num % 100;\r\n num = Math.floor(num / 100).toString();\r\n if (cents < 10)\r\n cents = \"0\" + cents;\r\n for (var i = 0; i < Math.floor((num.length - (1 + i)) / 3); i++)\r\n num = num.substring(0, num.length - (4 * i + 3)) + '.' + num.substring(num.length - (4 * i + 3));\r\n return (((sign) ? '' : '-') + num + ',' + cents);\r\n}","title":""},{"docid":"dd1d84ad32458803a2abb443cdca0bd6","score":"0.615806","text":"function formatDecimal(x) {\n return Math.abs(x = Math.round(x)) >= 1e21 ? x.toLocaleString(\"en\").replace(/,/g, \"\") : x.toString(10);\n}","title":""},{"docid":"9d5388c98c5a6e453b812663d26669db","score":"0.6141273","text":"function formatNumber(number, decimals, dec_point, thousands_sep) {\n number = (number + '').replace(/[^0-9+\\-Ee.]/g, '');\n var n = !isFinite(+number) ? 0 : +number,\n prec = !isFinite(+decimals) ? 0 : Math.abs(decimals),\n sep = (typeof thousands_sep === 'undefined') ? ',' : thousands_sep,\n dec = (typeof dec_point === 'undefined') ? '.' : dec_point,\n s = '',\n toFixedFix = function (n, prec) {\n var k = Math.pow(10, prec);\n return '' + Math.round(n * k) / k;\n };\n // Fix for IE parseFloat(0.55).toFixed(0) = 0;\n s = (prec ? toFixedFix(n, prec) : '' + Math.round(n)).split('.');\n if (s[0].length > 3) {\n s[0] = s[0].replace(/\\B(?=(?:\\d{3})+(?!\\d))/g, sep);\n }\n if ((s[1] || '').length < prec) {\n s[1] = s[1] || '';\n s[1] += new Array(prec - s[1].length + 1).join('0');\n }\n return s.join(dec);\n}","title":""},{"docid":"807d471dacf04460a9ac657924d1fa7a","score":"0.61218566","text":"function pointToComma(row) {\n var patternPoint = /^[0-9]+([.][0-9]+)?%?$/;\n var newRow = [];\n for (var j = 0, lgj = row.length; j < lgj; j++) {\n if (row[j] === \"0.0\" || row[j] === \"0\" || row[j] === \"\" || row[j] === \" \" || row[j] === 0) {\n row[j] = \"\";\n } else if (patternPoint.test(row[j])) {\n row[j] = parseFloat(row[j]).toLocaleString(); // row[j].replace(/\\,/, \".\");\n } else {\n row[j] = row[j];\n }\n newRow.push(row[j]);\n }\n return newRow;\n}","title":""},{"docid":"c62f4a89083bd49b533a59b365c39488","score":"0.612076","text":"function number_format(number, decimals, decPoint, thousandsSep)\r\n{\r\n decimals = decimals || 0;\r\n number = parseFloat(number);\r\n\r\n if(!decPoint || !thousandsSep)\r\n {\r\n decPoint = \".\";\r\n thousandsSep = \",\";\r\n }\r\n\r\n var roundedNumber = Math.round( Math.abs( number ) * (\"1e\" + decimals) ) + \"\";\r\n // add zeros to decimalString if number of decimals indicates it\r\n roundedNumber = (1 > number && -1 < number && roundedNumber.length <= decimals)\r\n ? Array(decimals - roundedNumber.length + 1).join(\"0\") + roundedNumber : roundedNumber;\r\n var numbersString = decimals ? roundedNumber.slice(0, decimals * -1) : roundedNumber.slice(0);\r\n var checknull = parseInt(numbersString) || 0;\r\n\r\n // check if the value is less than one to prepend a 0\r\n numbersString = (checknull == 0) ? \"0\": numbersString;\r\n var decimalsString = decimals ? roundedNumber.slice(decimals * -1) : '';\r\n \r\n var formattedNumber = \"\";\r\n while(numbersString.length > 3)\r\n {\r\n formattedNumber = thousandsSep + numbersString.slice(-3) + formattedNumber;\r\n numbersString = numbersString.slice(0,-3);\r\n }\r\n\r\n return (number < 0 ? \"-\" : \"\") + numbersString + formattedNumber + (decimalsString ? (decPoint + decimalsString) : \"\");\r\n}","title":""},{"docid":"aed3df142b60b46e529a977e78006a6d","score":"0.6118212","text":"function formatNumber(num, precision, decpoint, thousandSep) {\n\tif (decpoint === undefined) decpoint = ',';\n\tif (thousandSep === undefined) thousandSep = '.';\n\tif (num==0) return \"0\";\n\tvar parts = num.toFixed(precision).split('.');\n\tvar s0 = parts[0];\n\tvar s = '';\n\twhile (s0.length > 3) {\n\t\ts = thousandSep + s0.substr(s0.length-3) + s;\n\t\ts0 = s0.substr(0, s0.length-3);\n\t}\n\ts = s0 + s;\n\tif (parts.length > 1) s += decpoint + parts[1];\n\treturn s;\n} // formatNumber","title":""},{"docid":"d57f55dd227bb639984b4b3ce0d412a4","score":"0.6113443","text":"function formatDecimal(x) {\n return Math.abs(x = Math.round(x)) >= 1e21\n ? x.toLocaleString(\"en\").replace(/,/g, \"\")\n : x.toString(10);\n}","title":""},{"docid":"d57f55dd227bb639984b4b3ce0d412a4","score":"0.6113443","text":"function formatDecimal(x) {\n return Math.abs(x = Math.round(x)) >= 1e21\n ? x.toLocaleString(\"en\").replace(/,/g, \"\")\n : x.toString(10);\n}","title":""},{"docid":"d57f55dd227bb639984b4b3ce0d412a4","score":"0.6113443","text":"function formatDecimal(x) {\n return Math.abs(x = Math.round(x)) >= 1e21\n ? x.toLocaleString(\"en\").replace(/,/g, \"\")\n : x.toString(10);\n}","title":""},{"docid":"204b5862f2945116aec84f106c4f5ad9","score":"0.61046433","text":"function numberWithCommas(x) {\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n // return x.toFixed(2);\n }","title":""},{"docid":"8020172b01af4431ab895272f7911b75","score":"0.6085071","text":"function numberWithCommas(x) {\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \".\");\n}","title":""},{"docid":"8020172b01af4431ab895272f7911b75","score":"0.6085071","text":"function numberWithCommas(x) {\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \".\");\n}","title":""},{"docid":"c5879b881f38c0f4a3c7d9a44d97fd58","score":"0.60817933","text":"function commafy(num) {\r\n n = num.toString();\r\n var arr = n.split(\".\");\r\n if (arr[0].length < 4) {\r\n arr[0] = arr[0];\r\n } else if (arr[0].length % 3 === 0) {\r\n var x = arr[0].match(/.{1,3}/g);\r\n arr[0] = x.join(\",\");\r\n } else if (arr[0].length %3 === 1) {\r\n var str = arr[0].substring(0, 1);\r\n var x = arr[0].replace(str, \"\").match(/.{1,3}/g);\r\n x.unshift(str);\r\n arr[0] = x.join(\",\");\r\n } else if (arr[0].length % 3 === 2) {\r\n var str = arr[0].substring(0, 2);\r\n var x = arr[0].replace(str, \"\").match(/.{1,3}/g);\r\n x.unshift(str);\r\n arr[0] = x.join(\",\");\r\n }\r\n return arr.join(\".\");\r\n}","title":""},{"docid":"540b5844f1d7f3e1963ea398bee65471","score":"0.6053397","text":"function localizeNumberFilterDecimalSeparator() {\n var stringToFloat = function (value) {\n var filterText = value || null;\n if (filterText && filterText.trim() === '') {\n filterText = null;\n }\n var newFilter;\n if (filterText !== null && filterText !== undefined) {\n filterText = filterText.replace(',', '.');\n newFilter = parseFloat(filterText);\n }\n else {\n newFilter = null;\n }\n return newFilter;\n };\n // tslint:disable-next-line:no-string-literal\n ag_grid_community_1.NumberFilter.prototype['stringToFloat'] = stringToFloat;\n}","title":""},{"docid":"b99425d1fb995bb2a7ba580cfd9d462d","score":"0.60492975","text":"function ffloat(n) {\n n = n + '';\n if (n.indexOf('.') !== -1) return n;\n if (n.indexOf('e') !== -1) return n;\n if (n.indexOf('E') !== -1) return n;\n return n + '.0';\n}","title":""},{"docid":"e23be4a11e9c0c5b787895d2baf7b999","score":"0.6041542","text":"function number_format( number, decimals, dec_point, thousands_sep ) {\n var n = number, prec = decimals;\n n = !isFinite(+n) ? 0 : +n;\n prec = !isFinite(+prec) ? 0 : Math.abs(prec);\n var sep = (typeof thousands_sep == \"undefined\") ? ',' : thousands_sep;\n var dec = (typeof dec_point == \"undefined\") ? '.' : dec_point;\n\n var s = (prec > 0) ? n.toFixed(prec) : Math.round(n).toFixed(prec); //fix for IE parseFloat(0.55).toFixed(0) = 0;\n\n var abs = Math.abs(n).toFixed(prec);\n var _, i;\n\n if (abs >= 1000) {\n _ = abs.split(/\\D/);\n i = _[0].length % 3 || 3;\n\n _[0] = s.slice(0,i + (n < 0)) +\n _[0].slice(i).replace(/(\\d{3})/g, sep+'$1');\n\n s = _.join(dec);\n } else {\n s = s.replace('.', dec);\n }\n\n return s;\n}","title":""},{"docid":"87813f6fd331d9d9447cc3832afb5163","score":"0.60400426","text":"function floatingPointFormatString() {\n return operator_1.pipe(string_1.toTrimmed(), string_1.match(FloatingPointUtil.floatingPointRegex, function (name) {\n return {\n message: name + \" must be valid floating point format string\",\n expected: \"valid floating point format string\",\n };\n }));\n}","title":""},{"docid":"a96f9de3d254ddb58264e6b9c6b6561e","score":"0.6034051","text":"function numberWithComma(number){\r\n var parts = number.toString().split(\".\");\r\n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\r\n return parts.join(\".\");\r\n}","title":""},{"docid":"f7186317061dc3bfe5a2ecf3f8925679","score":"0.60313267","text":"function qd_number_format(b,c,d,e){b=(b+\"\").replace(/[^0-9+\\-Ee.]/g,\"\");b=isFinite(+b)?+b:0;c=isFinite(+c)?Math.abs(c):0;e=\"undefined\"===typeof e?\",\":e;d=\"undefined\"===typeof d?\".\":d;var a=\"\",a=function(a,b){var c=Math.pow(10,b);return\"\"+(Math.round(a*c)/c).toFixed(b)},a=(c?a(b,c):\"\"+Math.round(b)).split(\".\");3<a[0].length&&(a[0]=a[0].replace(/\\B(?=(?:\\d{3})+(?!\\d))/g,e));(a[1]||\"\").length<c&&(a[1]=a[1]||\"\",a[1]+=Array(c-a[1].length+1).join(\"0\"));return a.join(d)}","title":""},{"docid":"f7186317061dc3bfe5a2ecf3f8925679","score":"0.60313267","text":"function qd_number_format(b,c,d,e){b=(b+\"\").replace(/[^0-9+\\-Ee.]/g,\"\");b=isFinite(+b)?+b:0;c=isFinite(+c)?Math.abs(c):0;e=\"undefined\"===typeof e?\",\":e;d=\"undefined\"===typeof d?\".\":d;var a=\"\",a=function(a,b){var c=Math.pow(10,b);return\"\"+(Math.round(a*c)/c).toFixed(b)},a=(c?a(b,c):\"\"+Math.round(b)).split(\".\");3<a[0].length&&(a[0]=a[0].replace(/\\B(?=(?:\\d{3})+(?!\\d))/g,e));(a[1]||\"\").length<c&&(a[1]=a[1]||\"\",a[1]+=Array(c-a[1].length+1).join(\"0\"));return a.join(d)}","title":""},{"docid":"f7186317061dc3bfe5a2ecf3f8925679","score":"0.60313267","text":"function qd_number_format(b,c,d,e){b=(b+\"\").replace(/[^0-9+\\-Ee.]/g,\"\");b=isFinite(+b)?+b:0;c=isFinite(+c)?Math.abs(c):0;e=\"undefined\"===typeof e?\",\":e;d=\"undefined\"===typeof d?\".\":d;var a=\"\",a=function(a,b){var c=Math.pow(10,b);return\"\"+(Math.round(a*c)/c).toFixed(b)},a=(c?a(b,c):\"\"+Math.round(b)).split(\".\");3<a[0].length&&(a[0]=a[0].replace(/\\B(?=(?:\\d{3})+(?!\\d))/g,e));(a[1]||\"\").length<c&&(a[1]=a[1]||\"\",a[1]+=Array(c-a[1].length+1).join(\"0\"));return a.join(d)}","title":""},{"docid":"f7186317061dc3bfe5a2ecf3f8925679","score":"0.60313267","text":"function qd_number_format(b,c,d,e){b=(b+\"\").replace(/[^0-9+\\-Ee.]/g,\"\");b=isFinite(+b)?+b:0;c=isFinite(+c)?Math.abs(c):0;e=\"undefined\"===typeof e?\",\":e;d=\"undefined\"===typeof d?\".\":d;var a=\"\",a=function(a,b){var c=Math.pow(10,b);return\"\"+(Math.round(a*c)/c).toFixed(b)},a=(c?a(b,c):\"\"+Math.round(b)).split(\".\");3<a[0].length&&(a[0]=a[0].replace(/\\B(?=(?:\\d{3})+(?!\\d))/g,e));(a[1]||\"\").length<c&&(a[1]=a[1]||\"\",a[1]+=Array(c-a[1].length+1).join(\"0\"));return a.join(d)}","title":""},{"docid":"c10690a9adf0738e4f0f6c0c156d38c0","score":"0.6013625","text":"function formatNumber (num) {\n \t\t\t\t\t\treturn num.toString().replace(/(\\d)(?=(\\d{3})+(?!\\d))/g, \"$1,\");\n\t\t\t\t\t\t}","title":""},{"docid":"06a0ae7c6490852fa47efdb19b008775","score":"0.60107464","text":"function numberWithCommas(x) {//thanks Elias Zamaria from SO\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/, \",\");\n}","title":""},{"docid":"50a591570a722e9a73f561dc4dd3723f","score":"0.6003555","text":"function formatNum(x) {\n x=parseFloat(x);\n x = x.toFixed(2);\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n }","title":""},{"docid":"67ecbe1fd87ac5fa29bc2756c46557e5","score":"0.6001698","text":"function formatNumber(n) {\n // only attempt conversion if n is numberic\n if (n != \"\" && !isNaN(Number(n))){\n var t = Math.abs(parseFloat(n));\n if (t == 0)\n return n;\n else if (t < 0.01)\n return t.toExponential();\n else {\n // treat pre and post differently\n var n= (Math.round(t * 100) / 100).toString().split(\".\");\n // add comma to decimal positions only\n n[0] = n[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n //Combine both sections again\n return n.join(\".\");\n }\n } else\n return n;\n}","title":""},{"docid":"6b3da03c0d65a04321d4264bf65fc2c3","score":"0.59958076","text":"stripFloat(currency) {\n let partcurr = '';\n if (currency.length >= 9) partcurr = currency.split('\\n')[0];\n else partcurr = currency;\n partcurr = partcurr.substring(1, partcurr.length);\n partcurr = partcurr.replace(',', '');\n console.log(`>${parseFloat(partcurr)}`);\n return parseFloat(partcurr);\n }","title":""},{"docid":"a21e7446ff9b31174f7e7b08b1c7d8ac","score":"0.5985976","text":"function numberWithCommas (x) {\n\t return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n\t}","title":""},{"docid":"20d74cd9196670872a546901fc591ebc","score":"0.5981189","text":"function commaIt(number, options) {\n //Set up default seperators\n addPrecision = (options && options['addPrecision'] || false);\n thousandSeperator = (options && options['thousandSeperator'] || ' ');\n decimalSeperator = (options && options['decimalSeperator'] || ',');\n var replacmentRegex = '$1' + thousandSeperator;\n\n //Conversion to string and default return managment\n number = number.toString();\n if(number.length === 0) return '0' + decimalSeperator + '00';\n\n //Actual parsing of two side of the number\n var amount = number.split(decimalSeperator)[0];\n var floats = addPrecision ? (decimalSeperator + ((number.split(decimalSeperator)[1] || '') + '00').substr(0, 2)) : '';\n var numberified = amount.split('').reverse().join('').replace(/(\\d{3}(?!$))/g, replacmentRegex).split('').reverse().join('');\n\n return numberified + floats;\n}","title":""},{"docid":"b0724962177da587873039db7c198d91","score":"0.5970678","text":"function numberWithCommas(x) {\n x = Math.round(x)\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n}","title":""},{"docid":"80e0d81135052fe1b332af69d01f4acf","score":"0.5959134","text":"function formatNumber(number) {\n var num_parts = number.toString().split(\".\");\n num_parts[0] = num_parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n return num_parts.join(\".\");\n}","title":""},{"docid":"4f807e054bae72212dd2c87b8cb7c7ca","score":"0.59509605","text":"function numberWithCommas(number) {\n var parts = number.toString().split(\".\");\n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n return parts.join(\".\");\n }","title":""},{"docid":"8c112a67f4d24222614281c556cc07e9","score":"0.59491926","text":"function addCommas(nStr) {\r\n // nStr += '';\r\n // var x = nStr.split('.');\r\n // var x1 = x[0];\r\n // var x2 = x.length > 1 ? '.' + x[1] : '';\r\n // var rgx = /(\\d+)(\\d{3})/;\r\n // while (rgx.test(x1)) {\r\n // x1 = x1.replace(rgx, \"$1\" + ',' + \"$2\");\r\n // }\r\n // return parseFloat(x1 + x2).toFixed(2);\r\n\r\n var formatted = parseFloat(nStr).toFixed(2).replace(/./g, function(c, i, a) {\r\n return i && c !== \".\" && ((a.length - i) % 3 === 0) ? ',' + c : c;\r\n });\r\n var splitval = formatted.split('.');\r\n return parseInt(splitval[1]) > 0 ? formatted : splitval[0];\r\n}","title":""},{"docid":"79cda81a5fcbbdaf0964d9079f468bc4","score":"0.59484506","text":"function formatNum(x) {\n x = x.toFixed(2);\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n }","title":""},{"docid":"051e576da3f5497db983a8cd3a2749ea","score":"0.5944434","text":"function numberWithCommas(number) {\n var parts = number.toString().split(\".\");\n parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n return parts.join(\".\");\n }","title":""},{"docid":"e4a866f44275a1033835827e72d9574f","score":"0.5943546","text":"function numberWithCommas(x) {\n return x\n .toFixed(2)\n .toString()\n .replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n}","title":""},{"docid":"ed91d3a60e0344589bc770d311cec546","score":"0.59418243","text":"function formatValue0(v){\n var a = v.toLocaleString(\"pt\", {maximumFractionDigits: 2});//this thing here do all the trick for us\n if(a == \"70.000\" || a == \"6.000\"){\n return a+\",00\";\n }else{\n var array = a.split(\",\");\n if(array[1].length < 2)\n return a+\"0\";\n else \n return a;\n }\n}","title":""},{"docid":"d1f0c12fcd48c7b219e0834d7bf232a2","score":"0.59363014","text":"function comma_formatter(value) {\n\tvar nf = new Intl.NumberFormat();\n\treturn nf.format(value);\n}","title":""},{"docid":"3974028ed92b928515c16868a06ec012","score":"0.5924648","text":"function commafy(n) {\n var n = n || 0;\n n = ('' + n).split('.').map(function(s, i) {\n return i ? s : s.replace(/(\\d)(?=(?:\\d{3})+$)/g, '$1,')\n }).join('.');\n return n;\n}","title":""},{"docid":"989ca890ecd2c4732a13a40fc115996f","score":"0.59225285","text":"function formatWithCommas(num) {\n return num.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n }","title":""},{"docid":"ddd76bc5b23ecdb8e3bd12c7e985a3ea","score":"0.5911666","text":"function util_insertComma(value) {\r\n\t\r\n\t\r\n\tif (value == '') return value;\r\n\r\n\tvalue = parseFloat(value, 10).toString()\r\n\twhile (true) {\r\n\r\n\t\tif (value.indexOf(caliberPoint) != -1)\r\n\t\t\tidx = value.search(new RegExp(\"[^,\\.\\-]([0-9]{3})+\" + caliberPoint));\r\n\t\telse\r\n\t\t\tidx = value.search(new RegExp(\"[^,\\.\\-]([0-9]{3})+$\"));\r\n\t\tif (idx == -1) break;\r\n\t\t\tvalue = value.substring(0, idx+1) + caliberSeparater + value.substring(idx+1, value.length);\r\n\t}\r\n\t\r\n\treturn value;\r\n}","title":""},{"docid":"4aa3d7ea402d40232ac846e43543a148","score":"0.5901412","text":"function fFormatMoney(dValue, ShowComma) {\r\n var ReturnValue = \"\";\r\n var TempValue = \"\";\r\n var j = 0;\r\n var AddComma = 0;\r\n\r\n if (dValue > 0) {\r\n var iRemainder = dValue - Math.floor(dValue);\r\n\r\n /* FORMAT decimals */\r\n if (iRemainder == 0)\r\n { dValue = dValue + '.00'; }\r\n else {\r\n iRemainder = (dValue * 10) - Math.floor(dValue * 10);\r\n if (iRemainder == 0)\r\n { dValue = dValue + '0'; }\r\n }\r\n\r\n /* FORMAT WITH COMMA SEPERATOR*/\r\n if (ShowComma == 1) {\r\n TempValue = dValue + '';\r\n for (var i = TempValue.length; i >= 0; i--) {\r\n if (TempValue.charAt(i) == \".\") {\r\n AddComma = 1;\r\n j = -1;\r\n }\r\n\r\n if ((j == 3) && (AddComma == 1)) {\r\n ReturnValue = \",\" + ReturnValue;\r\n j = 0;\r\n }\r\n\r\n ReturnValue = TempValue.charAt(i) + ReturnValue;\r\n j = j + 1;\r\n }\r\n }\r\n else\r\n { ReturnValue = dValue; }\r\n\r\n return ReturnValue;\r\n }\r\n else\r\n { return \"0.00\"; }\r\n}","title":""},{"docid":"dd1e776007e4bc6f5f5fdd90353eb392","score":"0.5893513","text":"function makeFloat(n) {\n n += (n.toString().indexOf('.') == -1) ? \".0\" : \"\";\n return n;\n }","title":""},{"docid":"0a2df1119beca8147142a6e2f837dd09","score":"0.58923215","text":"function formatComma(param) {\r\n var sysData = numeral(param).format(\"0,0\");\r\n return sysData;\r\n}","title":""},{"docid":"81cefaac2b20b0e0d4645fe0c06811de","score":"0.58871675","text":"function AjustaDecimal(valor) {\n return valor.replace(\",\",\".\")\n}","title":""},{"docid":"fe47229b1dfaf87e6e5ccfff2b0ec3ae","score":"0.5886468","text":"function numberWithCommas(x) {\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n }","title":""},{"docid":"8aa00f881277197622bc932711e1324f","score":"0.58856684","text":"function round2comma(calc) {\n\t\taftercom = 2;\n\t\tif (aftercom < 1 || aftercom > 14) return false;\n\t\tvar e = Math.pow(10, aftercom);\n\t\tvar k = (Math.round(calc * e) / e).toString();\n\t\tif (k.indexOf('.') == -1) k += '.';\n\t\tk += e.toString().substring(1);\n\t\treturn k.substring(0, k.indexOf('.') + aftercom + 1);\n\t}","title":""},{"docid":"20639531101687e44b1e53232bd5f798","score":"0.58824086","text":"function formatWithCommas(value) {\n const pattern = /(-?\\d+)(\\d{3})/;\n\n while (pattern.test(value)) {\n value = value.replace(pattern, '$1,$2');\n }\n\n return value;\n }","title":""},{"docid":"edd9f0f6681da90dd50802c7e47be62c","score":"0.58798987","text":"formatNumber(str) {\n var string = str.toString();\n while (string.search(\",\") >= 0) {\n string = (string + \"\").replace(\",\", \"\");\n }\n return parseFloat(string);\n }","title":""},{"docid":"85eaac5973b63363d3f8a7dd570c0ff9","score":"0.5879011","text":"function numberWithCommas(x){\r\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, ',');\r\n}","title":""},{"docid":"35b7e7ac444d5dc8e3761b1ead034944","score":"0.586843","text":"function numberWithCommas(n) {\r\n var parts = n.toString().split(\".\");\r\n return parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\") + (parts[1] ? \".\" + parts[1] : \"\");\r\n }","title":""},{"docid":"c26d47db555e148d6501294b43e5e4f5","score":"0.5863981","text":"function formatWithCommas(value) {\n const pattern = /(-?\\d+)(\\d{3})/;\n while (pattern.test(value)) {\n value = value.replace(pattern, '$1,$2');\n }\n return value;\n}","title":""},{"docid":"dff5a941f40a2915df7fc84372b0556f","score":"0.5861316","text":"function number_format(number, decimal_places, dec_seperator, thou_seperator) {\n // Init defaults.\n if (typeof decimal_places === 'undefined') decimal_places = 0;\n if (typeof dec_seperator === 'undefined') dec_seperator = '.';\n if (typeof thou_seperator === 'undefined') thou_seperator = ',';\n\n number = Math.round(number * Math.pow(10, decimal_places)) / Math.pow(10, decimal_places);\n let e = number + '';\n let f = e.split('.');\n if (!f[0]) {\n f[0] = '0';\n }\n if (!f[1]) {\n f[1] = '';\n }\n if (f[1].length < decimal_places) {\n let g = f[1];\n for (let i = f[1].length + 1; i <= decimal_places; i++) {\n g += '0';\n }\n f[1] = g;\n }\n if (thou_seperator != '' && f[0].length > 3) {\n let h = f[0];\n f[0] = '';\n for (let j = 3; j < h.length; j += 3) {\n let i = h.slice(h.length - j, h.length - j + 3);\n f[0] = thou_seperator + i + f[0] + '';\n }\n let j = h.substr(0, (h.length % 3 == 0) ? 3 : (h.length % 3));\n f[0] = j + f[0];\n }\n dec_seperator = (decimal_places <= 0) ? '' : dec_seperator;\n return f[0] + dec_seperator + f[1];\n}","title":""},{"docid":"64b2160c02c753c15dd661bba40872eb","score":"0.5860591","text":"function number_format(number, decimal_places, dec_seperator, thou_seperator) {\n // Init defaults.\n if (typeof decimal_places === 'undefined') decimal_places = 0;\n if (typeof dec_seperator === 'undefined') dec_seperator = '.';\n if (typeof thou_seperator === 'undefined') thou_seperator = ',';\n\n number = Math.round(number * Math.pow(10, decimal_places)) / Math.pow(10, decimal_places);\n let e = number + '';\n let f = e.split('.');\n if (!f[0]) {\n f[0] = '0';\n }\n if (!f[1]) {\n f[1] = '';\n }\n if (f[1].length < decimal_places) {\n let g = f[1];\n for (let i=f[1].length + 1; i <= decimal_places; i++) {\n g += '0';\n }\n f[1] = g;\n }\n if(thou_seperator != '' && f[0].length > 3) {\n let h = f[0];\n f[0] = '';\n for(let j = 3; j < h.length; j+=3) {\n let i = h.slice(h.length - j, h.length - j + 3);\n f[0] = thou_seperator + i + f[0] + '';\n }\n let j = h.substr(0, (h.length % 3 == 0) ? 3 : (h.length % 3));\n f[0] = j + f[0];\n }\n dec_seperator = (decimal_places <= 0) ? '' : dec_seperator;\n return f[0] + dec_seperator + f[1];\n}","title":""},{"docid":"e8c573289cadbc1bd7f2b566e8ced16f","score":"0.58592945","text":"function formatDec(val,sig) {\r\n var r = \"\";\r\n var pointIndex = (val+\"\").indexOf(\".\");\r\n if(pointIndex >0) {\r\n if(sig==null) {\r\n sig = 0;\r\n }\r\n r = (val+\"\").substring(0,(pointIndex-(-sig-1)));\r\n } else {\r\n r = val;\r\n }\r\n return r;\r\n}","title":""},{"docid":"9a9d1f7d45868eeb96dff3631c00dfad","score":"0.5858865","text":"function numberWithCommas(x) {\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n }","title":""},{"docid":"9a9d1f7d45868eeb96dff3631c00dfad","score":"0.5858865","text":"function numberWithCommas(x) {\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n }","title":""},{"docid":"9a9d1f7d45868eeb96dff3631c00dfad","score":"0.5858865","text":"function numberWithCommas(x) {\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n }","title":""},{"docid":"87f91f3ca0b880ac95637fb7936caf30","score":"0.58569723","text":"function numberWithCommas(x) {\r\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\r\n }","title":""},{"docid":"ef620632b55908fced52a67275c72acd","score":"0.5854867","text":"function numberWithCommas(x)\n{\n return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n}","title":""},{"docid":"774c700fcd26cbe9849c65a0aa96602f","score":"0.5850966","text":"function number_format( numero, decimal, decimal_separador, milhar_separador ){\t\n numero = (numero + '').replace(/[^0-9+\\-Ee.]/g, '');\n var n = !isFinite(+numero) ? 0 : +numero,\n prec = !isFinite(+decimal) ? 0 : Math.abs(decimal),\n sep = (typeof milhar_separador === 'undefined') ? ',' : milhar_separador,\n dec = (typeof decimal_separador === 'undefined') ? '.' : decimal_separador,\n s = '',\n toFixedFix = function (n, prec) {\n var k = Math.pow(10, prec);\n return '' + Math.round(n * k) / k;\n };\n // Fix para IE: parseFloat(0.55).toFixed(0) = 0;\n s = (prec ? toFixedFix(n, prec) : '' + Math.round(n)).split('.');\n if (s[0].length > 3) {\n s[0] = s[0].replace(/\\B(?=(?:\\d{3})+(?!\\d))/g, sep);\n }\n if ((s[1] || '').length < prec) {\n s[1] = s[1] || '';\n s[1] += new Array(prec - s[1].length + 1).join('0');\n }\n\n return s.join(dec);\n}","title":""},{"docid":"774c700fcd26cbe9849c65a0aa96602f","score":"0.5850966","text":"function number_format( numero, decimal, decimal_separador, milhar_separador ){\t\n numero = (numero + '').replace(/[^0-9+\\-Ee.]/g, '');\n var n = !isFinite(+numero) ? 0 : +numero,\n prec = !isFinite(+decimal) ? 0 : Math.abs(decimal),\n sep = (typeof milhar_separador === 'undefined') ? ',' : milhar_separador,\n dec = (typeof decimal_separador === 'undefined') ? '.' : decimal_separador,\n s = '',\n toFixedFix = function (n, prec) {\n var k = Math.pow(10, prec);\n return '' + Math.round(n * k) / k;\n };\n // Fix para IE: parseFloat(0.55).toFixed(0) = 0;\n s = (prec ? toFixedFix(n, prec) : '' + Math.round(n)).split('.');\n if (s[0].length > 3) {\n s[0] = s[0].replace(/\\B(?=(?:\\d{3})+(?!\\d))/g, sep);\n }\n if ((s[1] || '').length < prec) {\n s[1] = s[1] || '';\n s[1] += new Array(prec - s[1].length + 1).join('0');\n }\n\n return s.join(dec);\n}","title":""},{"docid":"c0cd719affda1aa509676abd2b83c916","score":"0.58465874","text":"function converteFloatMoeda(valor) {\n var inteiro = null, decimal = null, c = null, j = null;\n var aux = new Array();\n valor = \"\" + valor;\n c = valor.indexOf(\".\", 0);\n //encontrou o ponto na string\n if (c > 0) {\n //separa as partes em inteiro e decimal\n inteiro = valor.substring(0, c);\n decimal = valor.substring(c + 1, valor.length);\n } else {\n inteiro = valor;\n }\n\n //pega a parte inteiro de 3 em 3 partes\n for (j = inteiro.length, c = 0; j > 0; j -= 3, c++) {\n aux[c] = inteiro.substring(j - 3, j);\n }\n\n //percorre a string acrescentando os pontos\n inteiro = \"\";\n for (c = aux.length - 1; c >= 0; c--) {\n inteiro += aux[c] + '.';\n }\n //retirando o ultimo ponto e finalizando a parte inteiro\n\n inteiro = inteiro.substring(0, inteiro.length - 1);\n\n decimal = parseInt(decimal);\n if (isNaN(decimal)) {\n decimal = \"00\";\n } else {\n decimal = \"\" + decimal;\n if (decimal.length === 1) {\n decimal = decimal + \"0\";\n }\n }\n\n\n valor = inteiro + \",\" + decimal;\n\n\n return valor;\n\n}","title":""},{"docid":"27172293144ec1b743bbf57fd321a133","score":"0.58431214","text":"function numberWithCommas(x) {\n\t\t\t return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n\t\t\t}","title":""},{"docid":"27172293144ec1b743bbf57fd321a133","score":"0.58431214","text":"function numberWithCommas(x) {\n\t\t\t return x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n\t\t\t}","title":""},{"docid":"1551f88efce10e95b8b0171f8ca8e694","score":"0.5842524","text":"function addCommas(val) {\n return val.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n }","title":""},{"docid":"286997b52a8d0c2fe9d379de7120bb68","score":"0.5836481","text":"function formatNumber(value){ //data.cases adding format the number correctly\n return value.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\"); //Adding Commas to number\n}","title":""},{"docid":"e9b794e6ebca08aacf1b0e5ebb8280d3","score":"0.58342063","text":"function formatDecimale(value, event) {\r\n\t// Compatibilit\\u00E9 IE / Firefox\r\n\tif (!event && window.event) {\r\n\t\tevent = window.event;\r\n\t}\r\n\r\n\t// alert(event.keyCode);\r\n\r\n\tif (event.keyCode == 44) {\r\n\t\tevent.keyCode = 46;\r\n\t}\r\n\r\n\tif (event.which == 44) {\r\n\t\tevent.which = 46;\r\n\t}\r\n\r\n\t// Pour ne pas saisir le point deux fois\r\n\t// IE\r\n\tif (event.keyCode == 46) {\r\n\t\tif (value.indexOf(\".\", 0) != -1 || value.length == 0) {\r\n\t\t\tevent.returnValue = false;\r\n\t\t\tevent.cancelBubble = true;\r\n\t\t}\r\n\t} else {\r\n\r\n\t\tif ((event.keyCode < 48 || event.keyCode > 57)) {\r\n\t\t\tevent.returnValue = false;\r\n\t\t\tevent.cancelBubble = true;\r\n\t\t}\r\n\t}\r\n\r\n\t// DOM\r\n\tif (event.which == 46) {\r\n\t\tif (value.indexOf(\".\", 0) != -1 || value.length == 0) {\r\n\t\t\tevent.preventDefault();\r\n\t\t\tevent.stopPropagation();\r\n\t\t}\r\n\t} else {\r\n\t\tif ((event.which < 48 || event.which > 57)) {\r\n\t\t\tevent.preventDefault();\r\n\t\t\tevent.stopPropagation();\r\n\t\t}\r\n\t}\r\n}","title":""},{"docid":"c9fdd89b718073660ff0d3dadee69606","score":"0.5827677","text":"function numberWithCommas(x) {\r\n\treturn x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\r\n}","title":""},{"docid":"a5346282c3af90e41ec7bb51dc830f5b","score":"0.58132726","text":"function removeCommas(nStr) {\n nStr = nStr.replace(/\\,/g,'');\n console.log(nStr);\n return parseFloat(nStr);\n}","title":""},{"docid":"c0a04d11ba22d5ebf53ac888f1e5b2ed","score":"0.58132136","text":"function formatValue1(v){\n if(v[0] < 10000)\n return v[0][0]+'.'+v[0].substr(1,v[0].length)+\",\"+v[1];\n else if(v[0] < 100000)\n return v[0][0]+v[0][1]+'.'+v[0].substr(2, v[0].length)+\",\"+v[1]; \n}","title":""},{"docid":"0df344730677ea6c79e012f39fd205e7","score":"0.5810782","text":"function numberWithCommas(x)\n\t\t\t{\n\t\t\t\treturn x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, \",\");\n\t\t\t}","title":""},{"docid":"7690fdda027e8edae78ed9e98f9e3d04","score":"0.5809214","text":"function FormatNumber(arg)\n{\n\tvar retval = \"\";\n\tvar front = true;\n\tvar n = 0;\n\targ += '';\n\tfor (var i=0; i<arg.length; i++)\n\t{\n\t\tif ((arg.charAt(i)>='0' && arg.charAt(i)<='9') || arg.charAt(i)=='.')\n\t\t{\n\t\t\tif (front)\n\t\t\t{\n\t\t\t\tif (arg.charAt(i) == '0')\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\tfront = false;\n\t\t\t}\t\n\t\t\tretval += arg.charAt(i);\n\t\t}\n\t}\n\tretval = formatComma(roundToDecimal(retval,2)+'');\t\n\treturn retval;\n}","title":""},{"docid":"cc089b24920eb763208132ed856715ad","score":"0.5808715","text":"function numberWithCommas(x) {\r\n\t\treturn x.toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, ',');\r\n\t}","title":""}],"string":"[\n {\n \"docid\": \"7cd0487307e1ea18a14162b76c663248\",\n \"score\": \"0.67688954\",\n \"text\": \"function commaOnly(value) {\\n var num = parseFloat(value);\\n if ((vp.utils.isNumber(num)) && (!isNaN(num)) && (value.toString().indexOf(\\\"e+\\\") == -1)) {\\n //---- add commas, as needed ----\\n var parts = value.toString().split('.'); // DON'T use 'num' here: we want to preserve any trailing 0's in the mantissa of 'value' [as potentially added by comma()]\\n var left = parts[0];\\n var right = (parts.length > 1) ? \\\".\\\" + parts[1] : \\\"\\\";\\n var len = left.length;\\n if (len > 3) {\\n var startLen = (len % 3) == 0 ? 3 : len % 3;\\n var newLeft = left.substring(0, startLen);\\n for (var i = startLen; i < len; i += 3) {\\n newLeft += THOUSAND_SEPARATOR + left.substring(i, i + 3);\\n }\\n value = newLeft + right;\\n //---- avoid \\\"-,\\\" problem ----\\n if (value.startsWith(\\\"-,\\\")) {\\n value = \\\"-\\\" + value.substr(2);\\n }\\n }\\n }\\n return (value.toString());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4221fd12f668497b4fdc67753a9300f1\",\n \"score\": \"0.6549909\",\n \"text\": \"function number_format(number, decimals, decPoint, thousandsSep) {\\n number = (number + \\\"\\\").replace(/[^0-9+\\\\-Ee.]/g, \\\"\\\");\\n var n = !isFinite(+number) ? 0 : +number;\\n var prec = !isFinite(+decimals) ? 0 : Math.abs(decimals);\\n var sep = typeof thousandsSep === \\\"undefined\\\" ? \\\",\\\" : thousandsSep;\\n var dec = typeof decPoint === \\\"undefined\\\" ? \\\".\\\" : decPoint;\\n var s = \\\"\\\";\\n\\n var toFixedFix = function(n, prec) {\\n var k = Math.pow(10, prec);\\n return \\\"\\\" + (Math.round(n * k) / k).toFixed(prec);\\n };\\n\\n // @todo: for IE parseFloat(0.55).toFixed(0) = 0;\\n s = (prec ? toFixedFix(n, prec) : \\\"\\\" + Math.round(n)).split(\\\".\\\");\\n if (s[0].length > 3) {\\n s[0] = s[0].replace(/\\\\B(?=(?:\\\\d{3})+(?!\\\\d))/g, sep);\\n }\\n if ((s[1] || \\\"\\\").length < prec) {\\n s[1] = s[1] || \\\"\\\";\\n s[1] += new Array(prec - s[1].length + 1).join(\\\"0\\\");\\n }\\n\\n return s.join(dec);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06d32515e4acb17e2f106e2073f36807\",\n \"score\": \"0.6539572\",\n \"text\": \"function formatWithCommas(value) {\\n\\tvar parts = value.toString().split(\\\".\\\");\\n\\tparts[0] = parts[0].replace(/,/gi, \\\"\\\"); // remove existing commas\\n\\tparts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n\\n\\treturn parts.join(\\\".\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee3a7cb755eaf7a9a231e3380bb0bdcd\",\n \"score\": \"0.64501745\",\n \"text\": \"function number_format(number, decimals, dec_point, thousands_sep) {\\r\\n\\tnumber = (number + '').replace(/[^0-9+\\\\-Ee.]/g, '');\\r\\n\\tvar n = !isFinite(+number) ? 0 : +number,\\r\\n\\t\\tprec = !isFinite(+decimals) ? 0 : Math.abs(decimals),\\r\\n\\t\\tsep = (typeof thousands_sep === 'undefined') ? ',' : thousands_sep,\\r\\n\\t\\tdec = (typeof dec_point === 'undefined') ? '.' : dec_point,\\r\\n\\t\\ts = '',\\r\\n\\t\\ttoFixedFix = function (n, prec) {\\r\\n\\t\\t\\tvar k = Math.pow(10, prec);\\r\\n\\t\\t\\treturn '' + (Math.round(n * k) / k)\\r\\n\\t\\t\\t\\t.toFixed(prec);\\r\\n\\t\\t};\\r\\n\\t// Fix for IE parseFloat(0.55).toFixed(0) = 0;\\r\\n\\ts = (prec ? toFixedFix(n, prec) : '' + Math.round(n))\\r\\n\\t\\t.split('.');\\r\\n\\tif (s[0].length > 3) {\\r\\n\\t\\ts[0] = s[0].replace(/\\\\B(?=(?:\\\\d{3})+(?!\\\\d))/g, sep);\\r\\n\\t}\\r\\n\\tif ((s[1] || '')\\r\\n\\t\\t.length < prec) {\\r\\n\\t\\ts[1] = s[1] || '';\\r\\n\\t\\ts[1] += new Array(prec - s[1].length + 1)\\r\\n\\t\\t\\t.join('0');\\r\\n\\t}\\r\\n\\treturn s.join(dec);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a608aefe6b336ee11402b3b2c98fd15\",\n \"score\": \"0.64480454\",\n \"text\": \"function util_insertComma(value) {\\r\\n\\tif (value == '') return value;\\r\\n\\r\\n\\tvalue = parseFloat(value, 10).toString()\\r\\n\\twhile (true) {\\r\\n\\t\\r\\n\\t\\tif (value.indexOf(',') != -1)\\r\\n\\t\\t\\tidx = value.search(/[^,\\\\.\\\\-]([0-9]{3})+\\\\,/);\\r\\n\\t\\telse\\r\\n\\t\\t\\tidx = value.search(/[^,\\\\.\\\\-]([0-9]{3})+$/);\\r\\n\\t\\tif (idx == -1) break;\\r\\n\\t\\t\\tvalue = value.substring(0, idx+1) + '.' + value.substring(idx+1, value.length);\\r\\n\\t}\\r\\n\\treturn value;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5edc8cf44a93103be33c181bc51607b\",\n \"score\": \"0.64430237\",\n \"text\": \"function commafy(num) {\\n\\tvar str = num.toString().split('.');\\n\\tif (str[0].length > 3) {\\n\\t\\tstr[0] = str[0].replace(/(\\\\d)(?=(\\\\d{3})+$)/g, '$1,');\\n\\t}\\n\\tif (str[1] && str[1].length > 3) {\\n\\t\\tstr[1] = str[1].replace(/(\\\\d{3})/g, '$1,');\\n\\t\\tif (str[1].endsWith(\\\",\\\")) str[1] = str.slice(0, -1);\\n\\t}\\n\\treturn str.join('.');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66ac6c2e1fbf67ce2fc05267af4c61d4\",\n \"score\": \"0.6398246\",\n \"text\": \"function fmt_num(str) {\\r\\nvar value=0.0;\\r\\nvar x= str.lastIndexOf(\\\".\\\");\\r\\nvar y= str.lastIndexOf(\\\",\\\");\\r\\n \\r\\n if ( !isNum(str) )\\r\\n return(value);\\r\\n\\r\\n\\r\\n if ( x == -1 && y == -1 ){\\r\\n value = parseInt(str);\\r\\n return(value);\\r\\n }\\r\\n\\r\\n if ( x < y )\\r\\n x=y;\\r\\n\\r\\n txt1=str.substring(0,x);\\r\\n if (txt1 == '') txt1 = '0';\\r\\n txt1=replace(txt1,',',''); \\r\\n txt1=replace(txt1,'.',''); \\r\\n txt1=replace(txt1,' ',''); \\r\\n \\r\\n txt=txt1+'.'+str.substring(x+1);\\r\\n value = (parseInt(txt1) + parseFloat('.'+str.substring(x+1)));\\r\\n\\r\\nreturn(value);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44d048819ad52701d6ca17f7280139ce\",\n \"score\": \"0.63726974\",\n \"text\": \"function transformaMoedaRealParaFloat(num) {\\n// console.log('1>> ');\\n// console.log(num);\\n \\n if(num.indexOf(',')) {\\n num = num.replace('.', '');\\n num = num.replace(',', '.');\\n\\n num = parseFloat(num);\\n }\\n \\n// console.log('2>> ');\\n// console.log(num);\\n \\n if(num % 1 === 0) {\\n num = num + ',00';\\n }\\n \\n// console.log('3>> ');\\n// console.log(num);\\n\\n return num;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fb7d0c45bfd51e7bb20d9bedec59007\",\n \"score\": \"0.6353352\",\n \"text\": \"function formatter(val)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\tval = val.replace(/[^\\\\d,.]*([\\\\d,|.]*)/g,'$1');\\n\\t\\t\\t\\treturn val;\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb22f5e8f7832dbe65605a4c1afc5f0c\",\n \"score\": \"0.62841463\",\n \"text\": \"function numberWithCommas(x)\\n{\\n var parts = x.toString().split(\\\".\\\");\\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n return parts.join(\\\".\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87a129ad9b746d8d550dfc2d7d4c20f1\",\n \"score\": \"0.6278547\",\n \"text\": \"function numberWithCommas(x) {\\n var parts = x.toString().split(\\\".\\\");\\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n return parts.join(\\\".\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d7aad2b423ef128d972067efcc49815\",\n \"score\": \"0.62725496\",\n \"text\": \"function FormatNumericWithSeparate(field)\\n{\\n\\tvar DecimalNumber = 1;\\n\\tvar DecimalChar = \\\".\\\";\\n\\tvar SeperateChar = \\\",\\\";\\n\\tvar ValueString = parseFloat(field.value.replace(/,/g,'')).toString();\\n\\t//var ValueString = field.value;\\n\\tvar ValueStringAfterDecimal = \\\"\\\";\\n\\tvar ValueStringNew = \\\"\\\";\\t\\n\\t//if (field.value < 0)\\n\\tif (ValueString < 0)\\n\\t{\\n\\t\\tValueString = ValueString.substring(1, ValueString.length); //Bo dau tru\\t\\t\\t\\t\\n\\t}\\t\\t\\n\\tif (ValueString.indexOf(DecimalChar) != -1)\\n\\t{\\n\\t\\tValueStringAfterDecimal = ValueString.substring(ValueString.indexOf(DecimalChar), ValueString.indexOf(DecimalChar) + 2 + DecimalNumber) // Tinh luon dau cham\\n\\t\\t//alert(ValueStringAfterDecimal);\\n\\t\\tValueString = ValueString.substring(0, ValueString.indexOf(DecimalChar))\\n\\t}\\n\\n\\tif (ValueStringAfterDecimal.indexOf(SeperateChar) != -1)\\n\\t{\\n\\t\\tGetAlertError(iTotal,DSAlert,\\\"0035\\\");\\n\\t\\tfield.value = \\\"\\\";\\n\\t\\tfield.focus();\\t\\t\\n\\t\\treturn;\\n\\t}\\t\\n\\tValueString = ValueString.replace(/,/g,'');\\n\\tValueStringNew = \\\"\\\";\\n\\twhile (ValueString.length >3)\\n\\t{\\n\\t\\tValueStringNew = SeperateChar + ValueString.substring(ValueString.length - 3, ValueString.length) + ValueStringNew;\\n\\t\\tValueString = ValueString.substring(0, ValueString.length - 3);\\n\\t}\\n\\tif (DecimalNumber != 0)\\n\\t\\tValueStringNew = ValueString + ValueStringNew + ValueStringAfterDecimal;\\n\\telse\\n\\t\\tValueStringNew = ValueString + ValueStringNew;\\t\\n\\t//if (field.value < 0) \\n\\tif (parseFloat(field.value.replace(/,/g,'')) < 0) \\t\\n\\t\\tValueStringNew = \\\"-\\\" + ValueStringNew;\\n\\t\\n\\tfield.value = ValueStringNew;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f89412344a6853e9a1c690c3dac0cad7\",\n \"score\": \"0.62639844\",\n \"text\": \"function numberWithCommas(value) {\\n if (formatting) {\\n var parts = value.toString().split(decimalSeparator);\\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, groupSeparator);\\n return parts.join(decimalSeparator);\\n }\\n else {\\n return value;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"609aa9516416f2c392e0b3b5a90f61f8\",\n \"score\": \"0.626219\",\n \"text\": \"function numberWithCommas(x) {\\n var parts = x.toFixed(2).toString().split(\\\".\\\");\\n \\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n \\n return parts.join(\\\".\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a791ec7302ae7f980affdf1d03992d2d\",\n \"score\": \"0.62604284\",\n \"text\": \"function format(n){\\r\\n return n.toFixed(1).replace(/(\\\\d)(?=(\\\\d{3})+\\\\.)/g, \\\"$1,\\\");\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21d10cfa3fe7afadbe32d238f76a0645\",\n \"score\": \"0.62476677\",\n \"text\": \"function number_format (number, decimals, dec_point, thousands_sep) {\\n // Strip all characters but numerical ones.\\n number = (number + '').replace(/[^0-9+\\\\-Ee.]/g, '');\\n var n = !isFinite(+number) ? 0 : +number,\\n prec = !isFinite(+decimals) ? 0 : Math.abs(decimals),\\n sep = (typeof thousands_sep === 'undefined') ? ',' : thousands_sep,\\n dec = (typeof dec_point === 'undefined') ? '.' : dec_point,\\n s = '',\\n toFixedFix = function (n, prec) {\\n var k = Math.pow(10, prec);\\n return '' + Math.round(n * k) / k;\\n };\\n // Fix for IE parseFloat(0.55).toFixed(0) = 0;\\n s = (prec ? toFixedFix(n, prec) : '' + Math.round(n)).split('.');\\n if (s[0].length > 3) {\\n s[0] = s[0].replace(/\\\\B(?=(?:\\\\d{3})+(?!\\\\d))/g, sep);\\n }\\n if ((s[1] || '').length < prec) {\\n s[1] = s[1] || '';\\n s[1] += new Array(prec - s[1].length + 1).join('0');\\n }\\n return s.join(dec);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21d10cfa3fe7afadbe32d238f76a0645\",\n \"score\": \"0.62476677\",\n \"text\": \"function number_format (number, decimals, dec_point, thousands_sep) {\\n // Strip all characters but numerical ones.\\n number = (number + '').replace(/[^0-9+\\\\-Ee.]/g, '');\\n var n = !isFinite(+number) ? 0 : +number,\\n prec = !isFinite(+decimals) ? 0 : Math.abs(decimals),\\n sep = (typeof thousands_sep === 'undefined') ? ',' : thousands_sep,\\n dec = (typeof dec_point === 'undefined') ? '.' : dec_point,\\n s = '',\\n toFixedFix = function (n, prec) {\\n var k = Math.pow(10, prec);\\n return '' + Math.round(n * k) / k;\\n };\\n // Fix for IE parseFloat(0.55).toFixed(0) = 0;\\n s = (prec ? toFixedFix(n, prec) : '' + Math.round(n)).split('.');\\n if (s[0].length > 3) {\\n s[0] = s[0].replace(/\\\\B(?=(?:\\\\d{3})+(?!\\\\d))/g, sep);\\n }\\n if ((s[1] || '').length < prec) {\\n s[1] = s[1] || '';\\n s[1] += new Array(prec - s[1].length + 1).join('0');\\n }\\n return s.join(dec);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d7c04ac4449f2b669b035cdedfbb121\",\n \"score\": \"0.62447894\",\n \"text\": \"function numberWithCommas(x) {\\n var parts = x.toString().split(\\\".\\\");\\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n return parts.join(\\\".\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83cd05641a725365fc1ade3a15244797\",\n \"score\": \"0.6244642\",\n \"text\": \"numberWithCommas(x) {\\n // Async edge case so page will not break in case of large data loads\\n if (!x) {\\n return 'Loading...';\\n }\\n\\n return x.toString().replace(/\\\\B(?<!\\\\.\\\\d*)(?=(\\\\d{3})+(?!\\\\d))/g, ',');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c51f96ff3e78cb9f01ad5d9e20d29d5\",\n \"score\": \"0.6239393\",\n \"text\": \"function formatNumber(x) {\\n var parts = x.toString().split(\\\".\\\");\\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n return parts.join(\\\".\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c51f96ff3e78cb9f01ad5d9e20d29d5\",\n \"score\": \"0.6239393\",\n \"text\": \"function formatNumber(x) {\\n var parts = x.toString().split(\\\".\\\");\\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n return parts.join(\\\".\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46f00961f5e10bf4405a3c9564d0c77e\",\n \"score\": \"0.62284285\",\n \"text\": \"function numberWithCommas(x) {\\n let parts = x.toString().split(\\\".\\\");\\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n return parts.join(\\\".\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0a6d9783c15b0ac107dc7e257751587\",\n \"score\": \"0.6213095\",\n \"text\": \"function numberWithCommas(x) {\\n var parts = x.toString().split(\\\".\\\");\\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n return parts.join(\\\".\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fe4198230a8cb083d59129efe449724\",\n \"score\": \"0.62070143\",\n \"text\": \"function number_format(val, decimals){\\n //Parse the value as a float value\\n val = parseFloat(val);\\n //Format the value w/ the specified number\\n //of decimal places and return it.\\n return val.toFixed(decimals);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff4fccaa8020212c1f5f80f7340eb777\",\n \"score\": \"0.61779356\",\n \"text\": \"function decimalDeprecated() {\\n return fluent_lib_1.pipe(functional_lib_1.or(functional_lib_1.string(), functional_lib_1.finiteNumber(), functional_lib_1.bigInt()), function (_name, mixed) {\\n return mixed.toString();\\n }, functional_lib_1.floatingPointFormatString());\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff4fccaa8020212c1f5f80f7340eb777\",\n \"score\": \"0.61779356\",\n \"text\": \"function decimalDeprecated() {\\n return fluent_lib_1.pipe(functional_lib_1.or(functional_lib_1.string(), functional_lib_1.finiteNumber(), functional_lib_1.bigInt()), function (_name, mixed) {\\n return mixed.toString();\\n }, functional_lib_1.floatingPointFormatString());\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92e90e11f7db4353033232bd34ea7f64\",\n \"score\": \"0.6162317\",\n \"text\": \"numberWithCommas(x) {\\n if (!x) {\\n return \\\"$0\\\";\\n }\\n x = parseFloat(x.toFixed(2));\\n return \\\"$\\\" + x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27da8dca3a230e98fe36ba2622133b84\",\n \"score\": \"0.61612964\",\n \"text\": \"function formatNumber(num) {\\r\\n if (!num || num == 'NaN') return '-';\\r\\n if (num == 'Infinity') return '∞';\\r\\n num = num.toString().replace(/\\\\$|\\\\,/g, '');\\r\\n if (isNaN(num))\\r\\n num = \\\"0\\\";\\r\\n sign = (num == (num = Math.abs(num)));\\r\\n num = Math.floor(num * 100 + 0.50000000001);\\r\\n cents = num % 100;\\r\\n num = Math.floor(num / 100).toString();\\r\\n if (cents < 10)\\r\\n cents = \\\"0\\\" + cents;\\r\\n for (var i = 0; i < Math.floor((num.length - (1 + i)) / 3); i++)\\r\\n num = num.substring(0, num.length - (4 * i + 3)) + '.' + num.substring(num.length - (4 * i + 3));\\r\\n return (((sign) ? '' : '-') + num + ',' + cents);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd1d84ad32458803a2abb443cdca0bd6\",\n \"score\": \"0.615806\",\n \"text\": \"function formatDecimal(x) {\\n return Math.abs(x = Math.round(x)) >= 1e21 ? x.toLocaleString(\\\"en\\\").replace(/,/g, \\\"\\\") : x.toString(10);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d5388c98c5a6e453b812663d26669db\",\n \"score\": \"0.6141273\",\n \"text\": \"function formatNumber(number, decimals, dec_point, thousands_sep) {\\n number = (number + '').replace(/[^0-9+\\\\-Ee.]/g, '');\\n var n = !isFinite(+number) ? 0 : +number,\\n prec = !isFinite(+decimals) ? 0 : Math.abs(decimals),\\n sep = (typeof thousands_sep === 'undefined') ? ',' : thousands_sep,\\n dec = (typeof dec_point === 'undefined') ? '.' : dec_point,\\n s = '',\\n toFixedFix = function (n, prec) {\\n var k = Math.pow(10, prec);\\n return '' + Math.round(n * k) / k;\\n };\\n // Fix for IE parseFloat(0.55).toFixed(0) = 0;\\n s = (prec ? toFixedFix(n, prec) : '' + Math.round(n)).split('.');\\n if (s[0].length > 3) {\\n s[0] = s[0].replace(/\\\\B(?=(?:\\\\d{3})+(?!\\\\d))/g, sep);\\n }\\n if ((s[1] || '').length < prec) {\\n s[1] = s[1] || '';\\n s[1] += new Array(prec - s[1].length + 1).join('0');\\n }\\n return s.join(dec);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"807d471dacf04460a9ac657924d1fa7a\",\n \"score\": \"0.61218566\",\n \"text\": \"function pointToComma(row) {\\n var patternPoint = /^[0-9]+([.][0-9]+)?%?$/;\\n var newRow = [];\\n for (var j = 0, lgj = row.length; j < lgj; j++) {\\n if (row[j] === \\\"0.0\\\" || row[j] === \\\"0\\\" || row[j] === \\\"\\\" || row[j] === \\\" \\\" || row[j] === 0) {\\n row[j] = \\\"\\\";\\n } else if (patternPoint.test(row[j])) {\\n row[j] = parseFloat(row[j]).toLocaleString(); // row[j].replace(/\\\\,/, \\\".\\\");\\n } else {\\n row[j] = row[j];\\n }\\n newRow.push(row[j]);\\n }\\n return newRow;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c62f4a89083bd49b533a59b365c39488\",\n \"score\": \"0.612076\",\n \"text\": \"function number_format(number, decimals, decPoint, thousandsSep)\\r\\n{\\r\\n decimals = decimals || 0;\\r\\n number = parseFloat(number);\\r\\n\\r\\n if(!decPoint || !thousandsSep)\\r\\n {\\r\\n decPoint = \\\".\\\";\\r\\n thousandsSep = \\\",\\\";\\r\\n }\\r\\n\\r\\n var roundedNumber = Math.round( Math.abs( number ) * (\\\"1e\\\" + decimals) ) + \\\"\\\";\\r\\n // add zeros to decimalString if number of decimals indicates it\\r\\n roundedNumber = (1 > number && -1 < number && roundedNumber.length <= decimals)\\r\\n ? Array(decimals - roundedNumber.length + 1).join(\\\"0\\\") + roundedNumber : roundedNumber;\\r\\n var numbersString = decimals ? roundedNumber.slice(0, decimals * -1) : roundedNumber.slice(0);\\r\\n var checknull = parseInt(numbersString) || 0;\\r\\n\\r\\n // check if the value is less than one to prepend a 0\\r\\n numbersString = (checknull == 0) ? \\\"0\\\": numbersString;\\r\\n var decimalsString = decimals ? roundedNumber.slice(decimals * -1) : '';\\r\\n \\r\\n var formattedNumber = \\\"\\\";\\r\\n while(numbersString.length > 3)\\r\\n {\\r\\n formattedNumber = thousandsSep + numbersString.slice(-3) + formattedNumber;\\r\\n numbersString = numbersString.slice(0,-3);\\r\\n }\\r\\n\\r\\n return (number < 0 ? \\\"-\\\" : \\\"\\\") + numbersString + formattedNumber + (decimalsString ? (decPoint + decimalsString) : \\\"\\\");\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aed3df142b60b46e529a977e78006a6d\",\n \"score\": \"0.6118212\",\n \"text\": \"function formatNumber(num, precision, decpoint, thousandSep) {\\n\\tif (decpoint === undefined) decpoint = ',';\\n\\tif (thousandSep === undefined) thousandSep = '.';\\n\\tif (num==0) return \\\"0\\\";\\n\\tvar parts = num.toFixed(precision).split('.');\\n\\tvar s0 = parts[0];\\n\\tvar s = '';\\n\\twhile (s0.length > 3) {\\n\\t\\ts = thousandSep + s0.substr(s0.length-3) + s;\\n\\t\\ts0 = s0.substr(0, s0.length-3);\\n\\t}\\n\\ts = s0 + s;\\n\\tif (parts.length > 1) s += decpoint + parts[1];\\n\\treturn s;\\n} // formatNumber\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d57f55dd227bb639984b4b3ce0d412a4\",\n \"score\": \"0.6113443\",\n \"text\": \"function formatDecimal(x) {\\n return Math.abs(x = Math.round(x)) >= 1e21\\n ? x.toLocaleString(\\\"en\\\").replace(/,/g, \\\"\\\")\\n : x.toString(10);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d57f55dd227bb639984b4b3ce0d412a4\",\n \"score\": \"0.6113443\",\n \"text\": \"function formatDecimal(x) {\\n return Math.abs(x = Math.round(x)) >= 1e21\\n ? x.toLocaleString(\\\"en\\\").replace(/,/g, \\\"\\\")\\n : x.toString(10);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d57f55dd227bb639984b4b3ce0d412a4\",\n \"score\": \"0.6113443\",\n \"text\": \"function formatDecimal(x) {\\n return Math.abs(x = Math.round(x)) >= 1e21\\n ? x.toLocaleString(\\\"en\\\").replace(/,/g, \\\"\\\")\\n : x.toString(10);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"204b5862f2945116aec84f106c4f5ad9\",\n \"score\": \"0.61046433\",\n \"text\": \"function numberWithCommas(x) {\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n // return x.toFixed(2);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8020172b01af4431ab895272f7911b75\",\n \"score\": \"0.6085071\",\n \"text\": \"function numberWithCommas(x) {\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\".\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8020172b01af4431ab895272f7911b75\",\n \"score\": \"0.6085071\",\n \"text\": \"function numberWithCommas(x) {\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\".\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5879b881f38c0f4a3c7d9a44d97fd58\",\n \"score\": \"0.60817933\",\n \"text\": \"function commafy(num) {\\r\\n n = num.toString();\\r\\n var arr = n.split(\\\".\\\");\\r\\n if (arr[0].length < 4) {\\r\\n arr[0] = arr[0];\\r\\n } else if (arr[0].length % 3 === 0) {\\r\\n var x = arr[0].match(/.{1,3}/g);\\r\\n arr[0] = x.join(\\\",\\\");\\r\\n } else if (arr[0].length %3 === 1) {\\r\\n var str = arr[0].substring(0, 1);\\r\\n var x = arr[0].replace(str, \\\"\\\").match(/.{1,3}/g);\\r\\n x.unshift(str);\\r\\n arr[0] = x.join(\\\",\\\");\\r\\n } else if (arr[0].length % 3 === 2) {\\r\\n var str = arr[0].substring(0, 2);\\r\\n var x = arr[0].replace(str, \\\"\\\").match(/.{1,3}/g);\\r\\n x.unshift(str);\\r\\n arr[0] = x.join(\\\",\\\");\\r\\n }\\r\\n return arr.join(\\\".\\\");\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"540b5844f1d7f3e1963ea398bee65471\",\n \"score\": \"0.6053397\",\n \"text\": \"function localizeNumberFilterDecimalSeparator() {\\n var stringToFloat = function (value) {\\n var filterText = value || null;\\n if (filterText && filterText.trim() === '') {\\n filterText = null;\\n }\\n var newFilter;\\n if (filterText !== null && filterText !== undefined) {\\n filterText = filterText.replace(',', '.');\\n newFilter = parseFloat(filterText);\\n }\\n else {\\n newFilter = null;\\n }\\n return newFilter;\\n };\\n // tslint:disable-next-line:no-string-literal\\n ag_grid_community_1.NumberFilter.prototype['stringToFloat'] = stringToFloat;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b99425d1fb995bb2a7ba580cfd9d462d\",\n \"score\": \"0.60492975\",\n \"text\": \"function ffloat(n) {\\n n = n + '';\\n if (n.indexOf('.') !== -1) return n;\\n if (n.indexOf('e') !== -1) return n;\\n if (n.indexOf('E') !== -1) return n;\\n return n + '.0';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e23be4a11e9c0c5b787895d2baf7b999\",\n \"score\": \"0.6041542\",\n \"text\": \"function number_format( number, decimals, dec_point, thousands_sep ) {\\n var n = number, prec = decimals;\\n n = !isFinite(+n) ? 0 : +n;\\n prec = !isFinite(+prec) ? 0 : Math.abs(prec);\\n var sep = (typeof thousands_sep == \\\"undefined\\\") ? ',' : thousands_sep;\\n var dec = (typeof dec_point == \\\"undefined\\\") ? '.' : dec_point;\\n\\n var s = (prec > 0) ? n.toFixed(prec) : Math.round(n).toFixed(prec); //fix for IE parseFloat(0.55).toFixed(0) = 0;\\n\\n var abs = Math.abs(n).toFixed(prec);\\n var _, i;\\n\\n if (abs >= 1000) {\\n _ = abs.split(/\\\\D/);\\n i = _[0].length % 3 || 3;\\n\\n _[0] = s.slice(0,i + (n < 0)) +\\n _[0].slice(i).replace(/(\\\\d{3})/g, sep+'$1');\\n\\n s = _.join(dec);\\n } else {\\n s = s.replace('.', dec);\\n }\\n\\n return s;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87813f6fd331d9d9447cc3832afb5163\",\n \"score\": \"0.60400426\",\n \"text\": \"function floatingPointFormatString() {\\n return operator_1.pipe(string_1.toTrimmed(), string_1.match(FloatingPointUtil.floatingPointRegex, function (name) {\\n return {\\n message: name + \\\" must be valid floating point format string\\\",\\n expected: \\\"valid floating point format string\\\",\\n };\\n }));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a96f9de3d254ddb58264e6b9c6b6561e\",\n \"score\": \"0.6034051\",\n \"text\": \"function numberWithComma(number){\\r\\n var parts = number.toString().split(\\\".\\\");\\r\\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\r\\n return parts.join(\\\".\\\");\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7186317061dc3bfe5a2ecf3f8925679\",\n \"score\": \"0.60313267\",\n \"text\": \"function qd_number_format(b,c,d,e){b=(b+\\\"\\\").replace(/[^0-9+\\\\-Ee.]/g,\\\"\\\");b=isFinite(+b)?+b:0;c=isFinite(+c)?Math.abs(c):0;e=\\\"undefined\\\"===typeof e?\\\",\\\":e;d=\\\"undefined\\\"===typeof d?\\\".\\\":d;var a=\\\"\\\",a=function(a,b){var c=Math.pow(10,b);return\\\"\\\"+(Math.round(a*c)/c).toFixed(b)},a=(c?a(b,c):\\\"\\\"+Math.round(b)).split(\\\".\\\");3<a[0].length&&(a[0]=a[0].replace(/\\\\B(?=(?:\\\\d{3})+(?!\\\\d))/g,e));(a[1]||\\\"\\\").length<c&&(a[1]=a[1]||\\\"\\\",a[1]+=Array(c-a[1].length+1).join(\\\"0\\\"));return a.join(d)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7186317061dc3bfe5a2ecf3f8925679\",\n \"score\": \"0.60313267\",\n \"text\": \"function qd_number_format(b,c,d,e){b=(b+\\\"\\\").replace(/[^0-9+\\\\-Ee.]/g,\\\"\\\");b=isFinite(+b)?+b:0;c=isFinite(+c)?Math.abs(c):0;e=\\\"undefined\\\"===typeof e?\\\",\\\":e;d=\\\"undefined\\\"===typeof d?\\\".\\\":d;var a=\\\"\\\",a=function(a,b){var c=Math.pow(10,b);return\\\"\\\"+(Math.round(a*c)/c).toFixed(b)},a=(c?a(b,c):\\\"\\\"+Math.round(b)).split(\\\".\\\");3<a[0].length&&(a[0]=a[0].replace(/\\\\B(?=(?:\\\\d{3})+(?!\\\\d))/g,e));(a[1]||\\\"\\\").length<c&&(a[1]=a[1]||\\\"\\\",a[1]+=Array(c-a[1].length+1).join(\\\"0\\\"));return a.join(d)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7186317061dc3bfe5a2ecf3f8925679\",\n \"score\": \"0.60313267\",\n \"text\": \"function qd_number_format(b,c,d,e){b=(b+\\\"\\\").replace(/[^0-9+\\\\-Ee.]/g,\\\"\\\");b=isFinite(+b)?+b:0;c=isFinite(+c)?Math.abs(c):0;e=\\\"undefined\\\"===typeof e?\\\",\\\":e;d=\\\"undefined\\\"===typeof d?\\\".\\\":d;var a=\\\"\\\",a=function(a,b){var c=Math.pow(10,b);return\\\"\\\"+(Math.round(a*c)/c).toFixed(b)},a=(c?a(b,c):\\\"\\\"+Math.round(b)).split(\\\".\\\");3<a[0].length&&(a[0]=a[0].replace(/\\\\B(?=(?:\\\\d{3})+(?!\\\\d))/g,e));(a[1]||\\\"\\\").length<c&&(a[1]=a[1]||\\\"\\\",a[1]+=Array(c-a[1].length+1).join(\\\"0\\\"));return a.join(d)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7186317061dc3bfe5a2ecf3f8925679\",\n \"score\": \"0.60313267\",\n \"text\": \"function qd_number_format(b,c,d,e){b=(b+\\\"\\\").replace(/[^0-9+\\\\-Ee.]/g,\\\"\\\");b=isFinite(+b)?+b:0;c=isFinite(+c)?Math.abs(c):0;e=\\\"undefined\\\"===typeof e?\\\",\\\":e;d=\\\"undefined\\\"===typeof d?\\\".\\\":d;var a=\\\"\\\",a=function(a,b){var c=Math.pow(10,b);return\\\"\\\"+(Math.round(a*c)/c).toFixed(b)},a=(c?a(b,c):\\\"\\\"+Math.round(b)).split(\\\".\\\");3<a[0].length&&(a[0]=a[0].replace(/\\\\B(?=(?:\\\\d{3})+(?!\\\\d))/g,e));(a[1]||\\\"\\\").length<c&&(a[1]=a[1]||\\\"\\\",a[1]+=Array(c-a[1].length+1).join(\\\"0\\\"));return a.join(d)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c10690a9adf0738e4f0f6c0c156d38c0\",\n \"score\": \"0.6013625\",\n \"text\": \"function formatNumber (num) {\\n \\t\\t\\t\\t\\t\\treturn num.toString().replace(/(\\\\d)(?=(\\\\d{3})+(?!\\\\d))/g, \\\"$1,\\\");\\n\\t\\t\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06a0ae7c6490852fa47efdb19b008775\",\n \"score\": \"0.60107464\",\n \"text\": \"function numberWithCommas(x) {//thanks Elias Zamaria from SO\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/, \\\",\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50a591570a722e9a73f561dc4dd3723f\",\n \"score\": \"0.6003555\",\n \"text\": \"function formatNum(x) {\\n x=parseFloat(x);\\n x = x.toFixed(2);\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67ecbe1fd87ac5fa29bc2756c46557e5\",\n \"score\": \"0.6001698\",\n \"text\": \"function formatNumber(n) {\\n // only attempt conversion if n is numberic\\n if (n != \\\"\\\" && !isNaN(Number(n))){\\n var t = Math.abs(parseFloat(n));\\n if (t == 0)\\n return n;\\n else if (t < 0.01)\\n return t.toExponential();\\n else {\\n // treat pre and post differently\\n var n= (Math.round(t * 100) / 100).toString().split(\\\".\\\");\\n // add comma to decimal positions only\\n n[0] = n[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n //Combine both sections again\\n return n.join(\\\".\\\");\\n }\\n } else\\n return n;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b3da03c0d65a04321d4264bf65fc2c3\",\n \"score\": \"0.59958076\",\n \"text\": \"stripFloat(currency) {\\n let partcurr = '';\\n if (currency.length >= 9) partcurr = currency.split('\\\\n')[0];\\n else partcurr = currency;\\n partcurr = partcurr.substring(1, partcurr.length);\\n partcurr = partcurr.replace(',', '');\\n console.log(`>${parseFloat(partcurr)}`);\\n return parseFloat(partcurr);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a21e7446ff9b31174f7e7b08b1c7d8ac\",\n \"score\": \"0.5985976\",\n \"text\": \"function numberWithCommas (x) {\\n\\t return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20d74cd9196670872a546901fc591ebc\",\n \"score\": \"0.5981189\",\n \"text\": \"function commaIt(number, options) {\\n //Set up default seperators\\n addPrecision = (options && options['addPrecision'] || false);\\n thousandSeperator = (options && options['thousandSeperator'] || ' ');\\n decimalSeperator = (options && options['decimalSeperator'] || ',');\\n var replacmentRegex = '$1' + thousandSeperator;\\n\\n //Conversion to string and default return managment\\n number = number.toString();\\n if(number.length === 0) return '0' + decimalSeperator + '00';\\n\\n //Actual parsing of two side of the number\\n var amount = number.split(decimalSeperator)[0];\\n var floats = addPrecision ? (decimalSeperator + ((number.split(decimalSeperator)[1] || '') + '00').substr(0, 2)) : '';\\n var numberified = amount.split('').reverse().join('').replace(/(\\\\d{3}(?!$))/g, replacmentRegex).split('').reverse().join('');\\n\\n return numberified + floats;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0724962177da587873039db7c198d91\",\n \"score\": \"0.5970678\",\n \"text\": \"function numberWithCommas(x) {\\n x = Math.round(x)\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80e0d81135052fe1b332af69d01f4acf\",\n \"score\": \"0.5959134\",\n \"text\": \"function formatNumber(number) {\\n var num_parts = number.toString().split(\\\".\\\");\\n num_parts[0] = num_parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n return num_parts.join(\\\".\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f807e054bae72212dd2c87b8cb7c7ca\",\n \"score\": \"0.59509605\",\n \"text\": \"function numberWithCommas(number) {\\n var parts = number.toString().split(\\\".\\\");\\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n return parts.join(\\\".\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c112a67f4d24222614281c556cc07e9\",\n \"score\": \"0.59491926\",\n \"text\": \"function addCommas(nStr) {\\r\\n // nStr += '';\\r\\n // var x = nStr.split('.');\\r\\n // var x1 = x[0];\\r\\n // var x2 = x.length > 1 ? '.' + x[1] : '';\\r\\n // var rgx = /(\\\\d+)(\\\\d{3})/;\\r\\n // while (rgx.test(x1)) {\\r\\n // x1 = x1.replace(rgx, \\\"$1\\\" + ',' + \\\"$2\\\");\\r\\n // }\\r\\n // return parseFloat(x1 + x2).toFixed(2);\\r\\n\\r\\n var formatted = parseFloat(nStr).toFixed(2).replace(/./g, function(c, i, a) {\\r\\n return i && c !== \\\".\\\" && ((a.length - i) % 3 === 0) ? ',' + c : c;\\r\\n });\\r\\n var splitval = formatted.split('.');\\r\\n return parseInt(splitval[1]) > 0 ? formatted : splitval[0];\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79cda81a5fcbbdaf0964d9079f468bc4\",\n \"score\": \"0.59484506\",\n \"text\": \"function formatNum(x) {\\n x = x.toFixed(2);\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"051e576da3f5497db983a8cd3a2749ea\",\n \"score\": \"0.5944434\",\n \"text\": \"function numberWithCommas(number) {\\n var parts = number.toString().split(\\\".\\\");\\n parts[0] = parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n return parts.join(\\\".\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4a866f44275a1033835827e72d9574f\",\n \"score\": \"0.5943546\",\n \"text\": \"function numberWithCommas(x) {\\n return x\\n .toFixed(2)\\n .toString()\\n .replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed91d3a60e0344589bc770d311cec546\",\n \"score\": \"0.59418243\",\n \"text\": \"function formatValue0(v){\\n var a = v.toLocaleString(\\\"pt\\\", {maximumFractionDigits: 2});//this thing here do all the trick for us\\n if(a == \\\"70.000\\\" || a == \\\"6.000\\\"){\\n return a+\\\",00\\\";\\n }else{\\n var array = a.split(\\\",\\\");\\n if(array[1].length < 2)\\n return a+\\\"0\\\";\\n else \\n return a;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1f0c12fcd48c7b219e0834d7bf232a2\",\n \"score\": \"0.59363014\",\n \"text\": \"function comma_formatter(value) {\\n\\tvar nf = new Intl.NumberFormat();\\n\\treturn nf.format(value);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3974028ed92b928515c16868a06ec012\",\n \"score\": \"0.5924648\",\n \"text\": \"function commafy(n) {\\n var n = n || 0;\\n n = ('' + n).split('.').map(function(s, i) {\\n return i ? s : s.replace(/(\\\\d)(?=(?:\\\\d{3})+$)/g, '$1,')\\n }).join('.');\\n return n;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"989ca890ecd2c4732a13a40fc115996f\",\n \"score\": \"0.59225285\",\n \"text\": \"function formatWithCommas(num) {\\n return num.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ddd76bc5b23ecdb8e3bd12c7e985a3ea\",\n \"score\": \"0.5911666\",\n \"text\": \"function util_insertComma(value) {\\r\\n\\t\\r\\n\\t\\r\\n\\tif (value == '') return value;\\r\\n\\r\\n\\tvalue = parseFloat(value, 10).toString()\\r\\n\\twhile (true) {\\r\\n\\r\\n\\t\\tif (value.indexOf(caliberPoint) != -1)\\r\\n\\t\\t\\tidx = value.search(new RegExp(\\\"[^,\\\\.\\\\-]([0-9]{3})+\\\" + caliberPoint));\\r\\n\\t\\telse\\r\\n\\t\\t\\tidx = value.search(new RegExp(\\\"[^,\\\\.\\\\-]([0-9]{3})+$\\\"));\\r\\n\\t\\tif (idx == -1) break;\\r\\n\\t\\t\\tvalue = value.substring(0, idx+1) + caliberSeparater + value.substring(idx+1, value.length);\\r\\n\\t}\\r\\n\\t\\r\\n\\treturn value;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4aa3d7ea402d40232ac846e43543a148\",\n \"score\": \"0.5901412\",\n \"text\": \"function fFormatMoney(dValue, ShowComma) {\\r\\n var ReturnValue = \\\"\\\";\\r\\n var TempValue = \\\"\\\";\\r\\n var j = 0;\\r\\n var AddComma = 0;\\r\\n\\r\\n if (dValue > 0) {\\r\\n var iRemainder = dValue - Math.floor(dValue);\\r\\n\\r\\n /* FORMAT decimals */\\r\\n if (iRemainder == 0)\\r\\n { dValue = dValue + '.00'; }\\r\\n else {\\r\\n iRemainder = (dValue * 10) - Math.floor(dValue * 10);\\r\\n if (iRemainder == 0)\\r\\n { dValue = dValue + '0'; }\\r\\n }\\r\\n\\r\\n /* FORMAT WITH COMMA SEPERATOR*/\\r\\n if (ShowComma == 1) {\\r\\n TempValue = dValue + '';\\r\\n for (var i = TempValue.length; i >= 0; i--) {\\r\\n if (TempValue.charAt(i) == \\\".\\\") {\\r\\n AddComma = 1;\\r\\n j = -1;\\r\\n }\\r\\n\\r\\n if ((j == 3) && (AddComma == 1)) {\\r\\n ReturnValue = \\\",\\\" + ReturnValue;\\r\\n j = 0;\\r\\n }\\r\\n\\r\\n ReturnValue = TempValue.charAt(i) + ReturnValue;\\r\\n j = j + 1;\\r\\n }\\r\\n }\\r\\n else\\r\\n { ReturnValue = dValue; }\\r\\n\\r\\n return ReturnValue;\\r\\n }\\r\\n else\\r\\n { return \\\"0.00\\\"; }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd1e776007e4bc6f5f5fdd90353eb392\",\n \"score\": \"0.5893513\",\n \"text\": \"function makeFloat(n) {\\n n += (n.toString().indexOf('.') == -1) ? \\\".0\\\" : \\\"\\\";\\n return n;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a2df1119beca8147142a6e2f837dd09\",\n \"score\": \"0.58923215\",\n \"text\": \"function formatComma(param) {\\r\\n var sysData = numeral(param).format(\\\"0,0\\\");\\r\\n return sysData;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81cefaac2b20b0e0d4645fe0c06811de\",\n \"score\": \"0.58871675\",\n \"text\": \"function AjustaDecimal(valor) {\\n return valor.replace(\\\",\\\",\\\".\\\")\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe47229b1dfaf87e6e5ccfff2b0ec3ae\",\n \"score\": \"0.5886468\",\n \"text\": \"function numberWithCommas(x) {\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8aa00f881277197622bc932711e1324f\",\n \"score\": \"0.58856684\",\n \"text\": \"function round2comma(calc) {\\n\\t\\taftercom = 2;\\n\\t\\tif (aftercom < 1 || aftercom > 14) return false;\\n\\t\\tvar e = Math.pow(10, aftercom);\\n\\t\\tvar k = (Math.round(calc * e) / e).toString();\\n\\t\\tif (k.indexOf('.') == -1) k += '.';\\n\\t\\tk += e.toString().substring(1);\\n\\t\\treturn k.substring(0, k.indexOf('.') + aftercom + 1);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20639531101687e44b1e53232bd5f798\",\n \"score\": \"0.58824086\",\n \"text\": \"function formatWithCommas(value) {\\n const pattern = /(-?\\\\d+)(\\\\d{3})/;\\n\\n while (pattern.test(value)) {\\n value = value.replace(pattern, '$1,$2');\\n }\\n\\n return value;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"edd9f0f6681da90dd50802c7e47be62c\",\n \"score\": \"0.58798987\",\n \"text\": \"formatNumber(str) {\\n var string = str.toString();\\n while (string.search(\\\",\\\") >= 0) {\\n string = (string + \\\"\\\").replace(\\\",\\\", \\\"\\\");\\n }\\n return parseFloat(string);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85eaac5973b63363d3f8a7dd570c0ff9\",\n \"score\": \"0.5879011\",\n \"text\": \"function numberWithCommas(x){\\r\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, ',');\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35b7e7ac444d5dc8e3761b1ead034944\",\n \"score\": \"0.586843\",\n \"text\": \"function numberWithCommas(n) {\\r\\n var parts = n.toString().split(\\\".\\\");\\r\\n return parts[0].replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\") + (parts[1] ? \\\".\\\" + parts[1] : \\\"\\\");\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c26d47db555e148d6501294b43e5e4f5\",\n \"score\": \"0.5863981\",\n \"text\": \"function formatWithCommas(value) {\\n const pattern = /(-?\\\\d+)(\\\\d{3})/;\\n while (pattern.test(value)) {\\n value = value.replace(pattern, '$1,$2');\\n }\\n return value;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dff5a941f40a2915df7fc84372b0556f\",\n \"score\": \"0.5861316\",\n \"text\": \"function number_format(number, decimal_places, dec_seperator, thou_seperator) {\\n // Init defaults.\\n if (typeof decimal_places === 'undefined') decimal_places = 0;\\n if (typeof dec_seperator === 'undefined') dec_seperator = '.';\\n if (typeof thou_seperator === 'undefined') thou_seperator = ',';\\n\\n number = Math.round(number * Math.pow(10, decimal_places)) / Math.pow(10, decimal_places);\\n let e = number + '';\\n let f = e.split('.');\\n if (!f[0]) {\\n f[0] = '0';\\n }\\n if (!f[1]) {\\n f[1] = '';\\n }\\n if (f[1].length < decimal_places) {\\n let g = f[1];\\n for (let i = f[1].length + 1; i <= decimal_places; i++) {\\n g += '0';\\n }\\n f[1] = g;\\n }\\n if (thou_seperator != '' && f[0].length > 3) {\\n let h = f[0];\\n f[0] = '';\\n for (let j = 3; j < h.length; j += 3) {\\n let i = h.slice(h.length - j, h.length - j + 3);\\n f[0] = thou_seperator + i + f[0] + '';\\n }\\n let j = h.substr(0, (h.length % 3 == 0) ? 3 : (h.length % 3));\\n f[0] = j + f[0];\\n }\\n dec_seperator = (decimal_places <= 0) ? '' : dec_seperator;\\n return f[0] + dec_seperator + f[1];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64b2160c02c753c15dd661bba40872eb\",\n \"score\": \"0.5860591\",\n \"text\": \"function number_format(number, decimal_places, dec_seperator, thou_seperator) {\\n // Init defaults.\\n if (typeof decimal_places === 'undefined') decimal_places = 0;\\n if (typeof dec_seperator === 'undefined') dec_seperator = '.';\\n if (typeof thou_seperator === 'undefined') thou_seperator = ',';\\n\\n number = Math.round(number * Math.pow(10, decimal_places)) / Math.pow(10, decimal_places);\\n let e = number + '';\\n let f = e.split('.');\\n if (!f[0]) {\\n f[0] = '0';\\n }\\n if (!f[1]) {\\n f[1] = '';\\n }\\n if (f[1].length < decimal_places) {\\n let g = f[1];\\n for (let i=f[1].length + 1; i <= decimal_places; i++) {\\n g += '0';\\n }\\n f[1] = g;\\n }\\n if(thou_seperator != '' && f[0].length > 3) {\\n let h = f[0];\\n f[0] = '';\\n for(let j = 3; j < h.length; j+=3) {\\n let i = h.slice(h.length - j, h.length - j + 3);\\n f[0] = thou_seperator + i + f[0] + '';\\n }\\n let j = h.substr(0, (h.length % 3 == 0) ? 3 : (h.length % 3));\\n f[0] = j + f[0];\\n }\\n dec_seperator = (decimal_places <= 0) ? '' : dec_seperator;\\n return f[0] + dec_seperator + f[1];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8c573289cadbc1bd7f2b566e8ced16f\",\n \"score\": \"0.58592945\",\n \"text\": \"function formatDec(val,sig) {\\r\\n var r = \\\"\\\";\\r\\n var pointIndex = (val+\\\"\\\").indexOf(\\\".\\\");\\r\\n if(pointIndex >0) {\\r\\n if(sig==null) {\\r\\n sig = 0;\\r\\n }\\r\\n r = (val+\\\"\\\").substring(0,(pointIndex-(-sig-1)));\\r\\n } else {\\r\\n r = val;\\r\\n }\\r\\n return r;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a9d1f7d45868eeb96dff3631c00dfad\",\n \"score\": \"0.5858865\",\n \"text\": \"function numberWithCommas(x) {\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a9d1f7d45868eeb96dff3631c00dfad\",\n \"score\": \"0.5858865\",\n \"text\": \"function numberWithCommas(x) {\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a9d1f7d45868eeb96dff3631c00dfad\",\n \"score\": \"0.5858865\",\n \"text\": \"function numberWithCommas(x) {\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87f91f3ca0b880ac95637fb7936caf30\",\n \"score\": \"0.58569723\",\n \"text\": \"function numberWithCommas(x) {\\r\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef620632b55908fced52a67275c72acd\",\n \"score\": \"0.5854867\",\n \"text\": \"function numberWithCommas(x)\\n{\\n return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"774c700fcd26cbe9849c65a0aa96602f\",\n \"score\": \"0.5850966\",\n \"text\": \"function number_format( numero, decimal, decimal_separador, milhar_separador ){\\t\\n numero = (numero + '').replace(/[^0-9+\\\\-Ee.]/g, '');\\n var n = !isFinite(+numero) ? 0 : +numero,\\n prec = !isFinite(+decimal) ? 0 : Math.abs(decimal),\\n sep = (typeof milhar_separador === 'undefined') ? ',' : milhar_separador,\\n dec = (typeof decimal_separador === 'undefined') ? '.' : decimal_separador,\\n s = '',\\n toFixedFix = function (n, prec) {\\n var k = Math.pow(10, prec);\\n return '' + Math.round(n * k) / k;\\n };\\n // Fix para IE: parseFloat(0.55).toFixed(0) = 0;\\n s = (prec ? toFixedFix(n, prec) : '' + Math.round(n)).split('.');\\n if (s[0].length > 3) {\\n s[0] = s[0].replace(/\\\\B(?=(?:\\\\d{3})+(?!\\\\d))/g, sep);\\n }\\n if ((s[1] || '').length < prec) {\\n s[1] = s[1] || '';\\n s[1] += new Array(prec - s[1].length + 1).join('0');\\n }\\n\\n return s.join(dec);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"774c700fcd26cbe9849c65a0aa96602f\",\n \"score\": \"0.5850966\",\n \"text\": \"function number_format( numero, decimal, decimal_separador, milhar_separador ){\\t\\n numero = (numero + '').replace(/[^0-9+\\\\-Ee.]/g, '');\\n var n = !isFinite(+numero) ? 0 : +numero,\\n prec = !isFinite(+decimal) ? 0 : Math.abs(decimal),\\n sep = (typeof milhar_separador === 'undefined') ? ',' : milhar_separador,\\n dec = (typeof decimal_separador === 'undefined') ? '.' : decimal_separador,\\n s = '',\\n toFixedFix = function (n, prec) {\\n var k = Math.pow(10, prec);\\n return '' + Math.round(n * k) / k;\\n };\\n // Fix para IE: parseFloat(0.55).toFixed(0) = 0;\\n s = (prec ? toFixedFix(n, prec) : '' + Math.round(n)).split('.');\\n if (s[0].length > 3) {\\n s[0] = s[0].replace(/\\\\B(?=(?:\\\\d{3})+(?!\\\\d))/g, sep);\\n }\\n if ((s[1] || '').length < prec) {\\n s[1] = s[1] || '';\\n s[1] += new Array(prec - s[1].length + 1).join('0');\\n }\\n\\n return s.join(dec);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0cd719affda1aa509676abd2b83c916\",\n \"score\": \"0.58465874\",\n \"text\": \"function converteFloatMoeda(valor) {\\n var inteiro = null, decimal = null, c = null, j = null;\\n var aux = new Array();\\n valor = \\\"\\\" + valor;\\n c = valor.indexOf(\\\".\\\", 0);\\n //encontrou o ponto na string\\n if (c > 0) {\\n //separa as partes em inteiro e decimal\\n inteiro = valor.substring(0, c);\\n decimal = valor.substring(c + 1, valor.length);\\n } else {\\n inteiro = valor;\\n }\\n\\n //pega a parte inteiro de 3 em 3 partes\\n for (j = inteiro.length, c = 0; j > 0; j -= 3, c++) {\\n aux[c] = inteiro.substring(j - 3, j);\\n }\\n\\n //percorre a string acrescentando os pontos\\n inteiro = \\\"\\\";\\n for (c = aux.length - 1; c >= 0; c--) {\\n inteiro += aux[c] + '.';\\n }\\n //retirando o ultimo ponto e finalizando a parte inteiro\\n\\n inteiro = inteiro.substring(0, inteiro.length - 1);\\n\\n decimal = parseInt(decimal);\\n if (isNaN(decimal)) {\\n decimal = \\\"00\\\";\\n } else {\\n decimal = \\\"\\\" + decimal;\\n if (decimal.length === 1) {\\n decimal = decimal + \\\"0\\\";\\n }\\n }\\n\\n\\n valor = inteiro + \\\",\\\" + decimal;\\n\\n\\n return valor;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27172293144ec1b743bbf57fd321a133\",\n \"score\": \"0.58431214\",\n \"text\": \"function numberWithCommas(x) {\\n\\t\\t\\t return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27172293144ec1b743bbf57fd321a133\",\n \"score\": \"0.58431214\",\n \"text\": \"function numberWithCommas(x) {\\n\\t\\t\\t return x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1551f88efce10e95b8b0171f8ca8e694\",\n \"score\": \"0.5842524\",\n \"text\": \"function addCommas(val) {\\n return val.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"286997b52a8d0c2fe9d379de7120bb68\",\n \"score\": \"0.5836481\",\n \"text\": \"function formatNumber(value){ //data.cases adding format the number correctly\\n return value.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\"); //Adding Commas to number\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9b794e6ebca08aacf1b0e5ebb8280d3\",\n \"score\": \"0.58342063\",\n \"text\": \"function formatDecimale(value, event) {\\r\\n\\t// Compatibilit\\\\u00E9 IE / Firefox\\r\\n\\tif (!event && window.event) {\\r\\n\\t\\tevent = window.event;\\r\\n\\t}\\r\\n\\r\\n\\t// alert(event.keyCode);\\r\\n\\r\\n\\tif (event.keyCode == 44) {\\r\\n\\t\\tevent.keyCode = 46;\\r\\n\\t}\\r\\n\\r\\n\\tif (event.which == 44) {\\r\\n\\t\\tevent.which = 46;\\r\\n\\t}\\r\\n\\r\\n\\t// Pour ne pas saisir le point deux fois\\r\\n\\t// IE\\r\\n\\tif (event.keyCode == 46) {\\r\\n\\t\\tif (value.indexOf(\\\".\\\", 0) != -1 || value.length == 0) {\\r\\n\\t\\t\\tevent.returnValue = false;\\r\\n\\t\\t\\tevent.cancelBubble = true;\\r\\n\\t\\t}\\r\\n\\t} else {\\r\\n\\r\\n\\t\\tif ((event.keyCode < 48 || event.keyCode > 57)) {\\r\\n\\t\\t\\tevent.returnValue = false;\\r\\n\\t\\t\\tevent.cancelBubble = true;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\r\\n\\t// DOM\\r\\n\\tif (event.which == 46) {\\r\\n\\t\\tif (value.indexOf(\\\".\\\", 0) != -1 || value.length == 0) {\\r\\n\\t\\t\\tevent.preventDefault();\\r\\n\\t\\t\\tevent.stopPropagation();\\r\\n\\t\\t}\\r\\n\\t} else {\\r\\n\\t\\tif ((event.which < 48 || event.which > 57)) {\\r\\n\\t\\t\\tevent.preventDefault();\\r\\n\\t\\t\\tevent.stopPropagation();\\r\\n\\t\\t}\\r\\n\\t}\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9fdd89b718073660ff0d3dadee69606\",\n \"score\": \"0.5827677\",\n \"text\": \"function numberWithCommas(x) {\\r\\n\\treturn x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5346282c3af90e41ec7bb51dc830f5b\",\n \"score\": \"0.58132726\",\n \"text\": \"function removeCommas(nStr) {\\n nStr = nStr.replace(/\\\\,/g,'');\\n console.log(nStr);\\n return parseFloat(nStr);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0a04d11ba22d5ebf53ac888f1e5b2ed\",\n \"score\": \"0.58132136\",\n \"text\": \"function formatValue1(v){\\n if(v[0] < 10000)\\n return v[0][0]+'.'+v[0].substr(1,v[0].length)+\\\",\\\"+v[1];\\n else if(v[0] < 100000)\\n return v[0][0]+v[0][1]+'.'+v[0].substr(2, v[0].length)+\\\",\\\"+v[1]; \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0df344730677ea6c79e012f39fd205e7\",\n \"score\": \"0.5810782\",\n \"text\": \"function numberWithCommas(x)\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, \\\",\\\");\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7690fdda027e8edae78ed9e98f9e3d04\",\n \"score\": \"0.5809214\",\n \"text\": \"function FormatNumber(arg)\\n{\\n\\tvar retval = \\\"\\\";\\n\\tvar front = true;\\n\\tvar n = 0;\\n\\targ += '';\\n\\tfor (var i=0; i<arg.length; i++)\\n\\t{\\n\\t\\tif ((arg.charAt(i)>='0' && arg.charAt(i)<='9') || arg.charAt(i)=='.')\\n\\t\\t{\\n\\t\\t\\tif (front)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (arg.charAt(i) == '0')\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tfront = false;\\n\\t\\t\\t}\\t\\n\\t\\t\\tretval += arg.charAt(i);\\n\\t\\t}\\n\\t}\\n\\tretval = formatComma(roundToDecimal(retval,2)+'');\\t\\n\\treturn retval;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc089b24920eb763208132ed856715ad\",\n \"score\": \"0.5808715\",\n \"text\": \"function numberWithCommas(x) {\\r\\n\\t\\treturn x.toString().replace(/\\\\B(?=(\\\\d{3})+(?!\\\\d))/g, ',');\\r\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":96,"cells":{"query_id":{"kind":"string","value":"3d7fa02684abb84b2918625fa8e8510c"},"query":{"kind":"string","value":"PASO 4: Reemplaza ModalTypes"},"positive_passages":{"kind":"list like","value":[{"docid":"8ace6fa4eb22c736d8d39487b1d8ee9b","score":"0.0","text":"function compararValoresyReemplaza() {\n for(var i=0; i < infoSkus.length; i++) {\n for(var j=0 ;j < dataSkus.length; j++) {\n if (infoSkus[i][0] == dataSkus[j][0]) {\n infoFinal.push([dataSkus[j], infoSkus[i][1]]);\n //console.log('el arr infoFinal es ' + infoFinal);\n putModalType(infoSkus[i][0], dataSkus[j], infoSkus[i][1], i);\n }\n }\n }\n}","title":""}],"string":"[\n {\n \"docid\": \"8ace6fa4eb22c736d8d39487b1d8ee9b\",\n \"score\": \"0.0\",\n \"text\": \"function compararValoresyReemplaza() {\\n for(var i=0; i < infoSkus.length; i++) {\\n for(var j=0 ;j < dataSkus.length; j++) {\\n if (infoSkus[i][0] == dataSkus[j][0]) {\\n infoFinal.push([dataSkus[j], infoSkus[i][1]]);\\n //console.log('el arr infoFinal es ' + infoFinal);\\n putModalType(infoSkus[i][0], dataSkus[j], infoSkus[i][1], i);\\n }\\n }\\n }\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"1c573b9bf8f4eb05ce53a042f59b6b70","score":"0.66466486","text":"renderTypeAModal() {\n return (\n <Modal\n isOpen={this.state.showTypeAModal}\n onRequestClose={this.handleCloseTypeAModal}\n style={customStyles}\n >\n <h2>Type A</h2>\n {/* TODO: */}\n </Modal>\n )\n }","title":""},{"docid":"a070fdec1cab0463a44ca62ef5204612","score":"0.64522815","text":"renderTypeCModal() {\n return (\n <Modal\n isOpen={this.state.showTypeCModal}\n onRequestClose={this.handleCloseTypeCModal}\n style={customStyles}\n >\n <h2>Type C</h2>\n {/* TODO: */}\n </Modal>\n )\n }","title":""},{"docid":"2d368b1be954a065070eb122a4484ac2","score":"0.6363318","text":"function ShowAddMaintenanceTypeModal(type, indexPos) {\n jQuery.AddEquipmentNamespace.SelectedMasterDataType = type;\n BindMasterDataInfo();\n ClearMaintenanceTypeInfo(false);\n var btnAddMaintType = jQuery.AddEquipmentNamespace.MaintTypePagerData.LoadControlID.replace(\"divModelInfo\", \"btnAddMaintType\");\n jQuery(\"#\" + btnAddMaintType).text(languageResource.resMsg_Add);\n if (jQuery(\"#iconViewintTypes\").hasClass(\"fa fa-minus-circle\")) {\n jQuery(\"#iconViewintTypes\").removeClass(\"fa fa-minus-circle\");\n jQuery(\"#iconViewintTypes\").addClass(\"fa fa-plus-circle\");\n }\n var btnShowAll = \"btnShowAll\";\n jQuery(\"#\" + btnShowAll).addClass('hide');\n jQuery(\"#iconViewMaintTypes\").removeClass(\"fa fa-minus-circle\");\n jQuery(\"#iconViewMaintTypes\").addClass(\"fa fa-plus-circle\");\n jQuery(\"#divMaintTypes\").addClass(\"hide\");\n jQuery(\"#divAddMaintenanceMasterDataModal\").modal(\"show\");\n //modal focus\n var modalDivId = jQuery(\"#divAddMaintenanceMasterDataModal\")\n modalVisible(modalDivId);\n}","title":""},{"docid":"530468023fbdab9570e89e5f19704ba2","score":"0.6360183","text":"openRepoTypeModal() {\n this.$repoTypeScope = this.$scope.$new();\n this.$repoTypeScope.packageTypes = this.getPackageType();\n this.$repoTypeScope.closeModal = () => this.closeModalPackageType();\n this.$repoTypeScope.modalClose = ()=> this.modalClose();\n this.$repoTypeScope.selectRepoType = (type)=>this.selectRepoType(type);\n this.isTypeModalOpen = true;\n\n this.repoTypeModal = this.modal.launchModal('repository_type_modal', this.$repoTypeScope)\n this.repoTypeModal.result.finally(() => this.isTypeModalOpen = false);\n }","title":""},{"docid":"22d96f459bd392a457ef1d91c33e0cdc","score":"0.6234978","text":"getValuesOf(modalType) {\n const options = {\n add: {\n description: Form.descriptionField.value,\n amount: Form.amountField.value,\n date: Form.dateField.value,\n },\n edit: {\n id: Form.indexEditField.value,\n description: Form.descriptionEditField.value,\n amount: Form.amountEditField.value,\n date: Form.dateEditField.value,\n },\n filter: {\n initialDate: Form.initialDateFilter.value,\n finalDate: Form.finalDateFilter.value,\n transactionTypeFilter: Form.transactionTypeFilter.value,\n },\n };\n\n return options[modalType];\n }","title":""},{"docid":"84d8a6f337108a98ed89dc36dbf55320","score":"0.6206984","text":"function isModalTypeOf(testedType)\n{\n\tvar margeAerationPackHauteurMenuBtn = tbInfAbtCtBx['widthHeightMenuBtn'] + tbInfAbtCtBx['margnTopBotMenuBtn'] * 2;\n\tvar margeAerationPackLargeurMenuBtn = tbInfAbtCtBx['widthHeightMenuBtn'] + tbInfAbtCtBx['margnLftRgtMenuBtn'] * 2;\n\n\tvar smallHoriSuppMarge = tbInfAbtCtBx['screenWidth'] * 1.03 - tbInfAbtCtBx['screenWidth']; if(smallHoriSuppMarge > 10){smallHoriSuppMarge = 10;}\n\tvar bigHoriSuppMarge = tbInfAbtCtBx['screenWidth'] * 1.05 - tbInfAbtCtBx['screenWidth']; if(bigHoriSuppMarge > 20){bigHoriSuppMarge = 20;}\n\n\tvar margeAeration10px = 10;\n\n\tvar hauteurColInfosAbtCity, largeurColInfosAbtCity, hauteurDispo, hauteurDispoAcBtnMenu, largeurDisponible, largeurDisponibleAcBtnMenu ;\n\n\n\n\tif(testedType == \"completeLandscapeCnttBased\")\n\t{\n\t\t// si la box du lien \"Bordeaux\" n'est pas extensible en largeur, ou que le lien Bdx a dû passer sur une 2e ligne par manque de place en largeur\n\t\tif(!isBdxLinkExtensible(false) || parseInt($(\".bordeauxLink\").offset().top) > (parseInt($(\".statusFrontDev\").offset().top)+10) )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tvar neededYSpceByMenuBtn = tbInfAbtCtBx['widthHeightMenuBtn'] + tbInfAbtCtBx['margnTopBotMenuBtn'] * 2;\n\n\t\t\tvar tempDisplayProp = $(\".wrapperBoxCityMeteoInfo\").css(\"display\");\n\t\t\tvar tempOpacProp = $(\".wrapperBoxCityMeteoInfo\").css(\"opacity\");\n\t\t\t$(\".wrapperBoxCityMeteoInfo\").css({\"display\": \"block\", \"opacity\":0});\n\t\t\tvar bdxCityBoxOffsetTop = parseInt($(\".wrapperBoxCityMeteoInfo\").offset().top);\n\t\t\tvar navBdxCityBoxOffsetTop = parseInt($(\".btnNavAboutCityBox\").offset().top);\n\t\t\t$(\".wrapperBoxCityMeteoInfo\").css({\"display\": tempDisplayProp, \"opacity\": tempOpacProp});\n\n\t\t\t// S'il n'y a pas suffisament de place au-dessus des box About City pour le btn Menu, il doit y avoir assez de place sur la droite !\n\t\t\tif(bdxCityBoxOffsetTop < neededYSpceByMenuBtn)\n\t\t\t{\n\t\t\t\t// S'il n'y a pas assez de place pour le btn Menu sur la droite...\n\t\t\t\tif(!isBdxLinkExtensible(true) || navBdxCityBoxOffsetTop < 30)\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t//console.log(\"|||||||FORMAT||||||| => completeLandscapeCnttBased\");\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t//console.log(\"|||||||FORMAT||||||| => completeLandscapeCnttBased\");\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\telse if(testedType == \"completeLandscapeVwptBased\")\n\t{\n\t\t/*\n\n\t\ttbInfAbtCtBx['screenWidth'] = $(window).width();\n\ttbInfAbtCtBx['screenHeight'] = $(window).height();\n\n\ttbInfAbtCtBx['widthHeightMenuBtn'] = $(\".menuBtn\").width();\n\ttbInfAbtCtBx['margnLftRgtMenuBtn'] = parseInt($(\".menuBtn\").css(\"right\"));\n\ttbInfAbtCtBx['margnTopBotMenuBtn'] = parseInt($(\".menuBtn\").css(\"top\"));\n\n\n\n\tvar tempDisplayProp = $(\".wrapperBoxCityMeteoInfo\").css(\"display\");\n\tvar tempOpacProp = $(\".wrapperBoxCityMeteoInfo\").css(\"opacity\");\n\t$(\".wrapperBoxCityMeteoInfo\").css({\"display\": \"block\", \"opacity\":0});\n\n\ttbInfAbtCtBx['widthWrapBxCitMetInfPartSup'] = parseInt(widthCityTextBox);\n\ttbInfAbtCtBx['heightWrapBxCitMetInfPartSup'] = parseInt($(\".wrapperBoxCityMeteoInfo\").outerHeight()) + parseInt($(\".btnNavAboutCityBox\").outerHeight()) + parseInt($(\".cityTagsList\").outerHeight());\n\n\ttbInfAbtCtBx['widthWrapBxCitMetInfPartInf'] = parseInt($(\".todayCityBox\").outerWidth());\n\ttbInfAbtCtBx['heightWrapBxCitMetInfPartInf'] = parseInt($(\".bdxByTitle\").outerHeight()) + parseInt($(\".bdxByTitle\").css(\"margin-bottom\")) + ( (parseInt($(\".aboutBdxWebsite\").eq(0).outerHeight()) + parseInt($(\".aboutBdxWebsite\").eq(0).css(\"margin-bottom\"))) * 4 ) + 20; // il y a 4 liens / avec 20, une marge non récupérable défini via une propriété bottom:-xpx en CSS...\n\n\n\t\t\t*/\n\n\t\thauteurColInfosAbtCity = tbInfAbtCtBx['heightWrapBxCitMetInfPartSup'] + tbInfAbtCtBx['heightWrapBxCitMetInfPartInf'];\n\t\tlargeurColInfosAbtCity = tbInfAbtCtBx['widthWrapBxCitMetInfPartSup'];\n\t\thauteurDispo = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity - margeAeration10px * 2;\n\t\thauteurDispoAcBtnMenu = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity - margeAerationPackHauteurMenuBtn - margeAerationPackHauteurMenuBtn / 2;\n\t\tlargeurDisponible = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity * 2 - bigHoriSuppMarge * 2 - smallHoriSuppMarge;\n\t\tlargeurDisponibleAcBtnMenu = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity * 2 - margeAerationPackLargeurMenuBtn * 2 - smallHoriSuppMarge;\n\t\t/*\n\t\tconsole.log(\" /- hauteurColInfosAbtCity : \"+hauteurColInfosAbtCity);\n\t\tconsole.log(\" /- largeurColInfosAbtCity : \"+largeurColInfosAbtCity);\n\t\tconsole.log(\" /- hauteurDispo : \"+hauteurDispo);\n\t\tconsole.log(\" /- hauteurDispoAcBtnMenu : \"+hauteurDispoAcBtnMenu);\n\t\tconsole.log(\" /- largeurDisponible : \"+largeurDisponible);\n\t\tconsole.log(\" /- largeurDisponibleAcBtnMenu : \"+largeurDisponibleAcBtnMenu);*/\n\n\n\t\tif( hauteurDispo < 0 || largeurDisponible < 0 )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse if( hauteurDispoAcBtnMenu < 0 && largeurDisponibleAcBtnMenu < 0 )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t//console.log(\"|||||||FORMAT||||||| => completeLandscapeVwptBased\");\n\t\t\treturn true;\n\t\t}\n\t}\n\telse if(testedType == \"square\")\n\t{\n\t\thauteurColInfosAbtCity = tbInfAbtCtBx['heightWrapBxCitMetInfPartSup'];\n\t\tlargeurColInfosAbtCity = tbInfAbtCtBx['widthWrapBxCitMetInfPartSup'] + tbInfAbtCtBx['widthWrapBxCitMetInfPartInf'] + smallHoriSuppMarge;\n\t\thauteurDispo = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity * 2 - margeAeration10px * 2 - smallHoriSuppMarge;\n\t\thauteurDispoAcBtnMenu = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity * 2 - margeAeration10px * 2 - smallHoriSuppMarge - margeAerationPackHauteurMenuBtn - margeAerationPackHauteurMenuBtn / 2;\n\t\tlargeurDisponible = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity - bigHoriSuppMarge * 2;\n\t\tlargeurDisponibleAcBtnMenu = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity - bigHoriSuppMarge * 2 - margeAerationPackLargeurMenuBtn * 2;\n\n\t\tif( hauteurDispo < 0 || largeurDisponible < 0 )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse if( hauteurDispoAcBtnMenu < 0 && largeurDisponibleAcBtnMenu < 0 )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t//console.log(\"|||||||FORMAT||||||| => square\");\n\t\t\treturn true;\n\t\t}\n\t}\n\telse if(testedType == \"partialLandscape\")\n\t{\n\t\thauteurColInfosAbtCity = tbInfAbtCtBx['heightWrapBxCitMetInfPartSup'];\n\t\tlargeurColInfosAbtCity = tbInfAbtCtBx['widthWrapBxCitMetInfPartSup'];\n\t\thauteurDispo = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity - margeAeration10px * 2;\n\t\thauteurDispoAcBtnMenu = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity - margeAerationPackHauteurMenuBtn - margeAerationPackHauteurMenuBtn / 2;\n\t\tlargeurDisponible = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity * 2 - bigHoriSuppMarge * 2 - smallHoriSuppMarge;\n\t\tlargeurDisponibleAcBtnMenu = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity * 2 - margeAerationPackLargeurMenuBtn * 2;\n\n\t\tif( hauteurDispo < 0 || largeurDisponible < 0 )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse if( hauteurDispoAcBtnMenu < 0 && largeurDisponibleAcBtnMenu < 0 )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t//console.log(\"|||||||FORMAT||||||| => partialLandscape\");\n\t\t\treturn true;\n\t\t}\n\t}\n\t/*else if(testedType == \"completePortrait\")\n\t{\n\t}*/\n\telse if(testedType == \"partialPortrait\")\n\t{\n\t\thauteurColInfosAbtCity = tbInfAbtCtBx['heightWrapBxCitMetInfPartSup'];\n\t\tlargeurColInfosAbtCity = tbInfAbtCtBx['widthWrapBxCitMetInfPartSup'];\n\t\thauteurDispo = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity * 2 - margeAeration10px * 2 - smallHoriSuppMarge;\n\t\thauteurDispoAcBtnMenu = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity * 2 - margeAeration10px * 2 - smallHoriSuppMarge - margeAerationPackHauteurMenuBtn - margeAerationPackHauteurMenuBtn / 2;\n\t\tlargeurDisponible = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity - bigHoriSuppMarge * 2;\n\t\tlargeurDisponibleAcBtnMenu = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity - margeAerationPackLargeurMenuBtn * 2;\n\n\n\n\n\t\tif( (tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity) < 0 )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse if( (tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity*2 ) < 0 )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t//console.log(\"|||||||FORMAT||||||| => partialPortrait\");\n\t\t\treturn true;\n\t\t}\n\t}\n\telse\n\t{\n\t\t//console.log(\"|||||||FORMAT||||||| => aucun / bloquage du lien / fermeture de la modal si ouverte\");\n\t\treturn false;\n\t}\n}","title":""},{"docid":"6564c32f84f10cc792f0ef200e104685","score":"0.61743915","text":"renderTypeDModal() {\n return (\n <Modal\n isOpen={this.state.showTypeDModal}\n onRequestClose={this.handleCloseTypeDModal}\n style={customStyles}\n >\n <h2>Type D</h2>\n {/* TODO: */}\n </Modal>\n )\n }","title":""},{"docid":"af8bdef78e4e0ab3be68e31d4dfa5f02","score":"0.61217654","text":"renderTypeBModal() {\n return (\n <Modal\n isOpen={this.state.showTypeBModal}\n onRequestClose={this.handleCloseTypeBModal}\n style={customStyles}\n >\n <h2>Type B</h2>\n {/* TODO: */}\n </Modal>\n )\n }","title":""},{"docid":"8c64e67e4cebdec75ba83ac4dcb19e71","score":"0.60337996","text":"function ShowAddMaintenanceTypeModal(type, indexPos) {\n jQuery.TaskGroupInfoNameSpace.SelectedMasterDataType = type;\n BindMasterDataInfo();\n ClearMaintenanceTypeInfo();\n var btnAddMaintType = jQuery.TaskGroupInfoNameSpace.MaintTypePagerData.LoadControlID;\n jQuery(\"#\" + btnAddMaintType).text(languageResource.resMsg_Add);\n if (jQuery(\"#iconViewintTypes\").hasClass(\"fa fa-minus-circle\")) {\n jQuery(\"#iconViewintTypes\").removeClass(\"fa fa-minus-circle\");\n jQuery(\"#iconViewintTypes\").addClass(\"fa fa-plus-circle\");\n }\n var btnShowAll = \"btnShowAll\";\n jQuery(\"#\" + btnShowAll).addClass('hide');\n jQuery(\"#iconViewMaintTypes\").removeClass(\"fa fa-minus-circle\");\n jQuery(\"#iconViewMaintTypes\").addClass(\"fa fa-plus-circle\");\n jQuery(\"#divMaintTypes\").addClass(\"hide\");\n jQuery(\"#divAddMaintenanceMasterDataModal\").modal(\"show\");\n}","title":""},{"docid":"b58b0872c5fc75cdc08793a50e959aa1","score":"0.6003562","text":"function Modal(modalType, vars)\n{\n // reference\n\tthis.body,\n this.header,\n this.footer,\n this.type = modalType,\n this.vars; if(vars!=null){this.vars = JSON.parse(vars);}\n\n // templates\n this.simplicity_template = ['alert', 'alert-anonymousPrivacy', 'alert-followBadge', 'alert-goldBadge', 'alert-responseBadge', 'delete-comment', 'delete-post'],\n this.structure_template = ['{\"name\": \"alert\", \"footer\": \"<button type=\\'button\\' class=\\'btn btn-default\\' data-dismiss=\\'modal\\'>Close</button>\"}',\n '{\"name\": \"alert-anonymousPrivacy\", \"header\": \"User Privacy\", \"body\": \"This user has chosen to remain anonymous; we cannot share their profile information.\", \"footer\": \"<button type=\\'button\\' class=\\'btn btn-default\\' data-dismiss=\\'modal\\'>Close</button>\"}',\n '{\"name\": \"alert-followBadge\", \"header\": \"Badge Info\", \"body\": \"You are following this post.\", \"footer\": \"<button type=\\'button\\' class=\\'btn btn-default\\' data-dismiss=\\'modal\\'>Close</button>\"}',\n '{\"name\": \"alert-goldBadge\", \"header\": \"Badge Info\", \"body\": \"This post has been nominated for administration response.\", \"footer\": \"<button type=\\'button\\' class=\\'btn btn-default\\' data-dismiss=\\'modal\\'>Close</button>\"}',\n '{\"name\": \"alert-responseBadge\", \"header\": \"Badge Info\", \"body\": \"There has been an administration response to this post.\", \"footer\": \"<button type=\\'button\\' class=\\'btn btn-default\\' data-dismiss=\\'modal\\'>Close</button>\"}',\n '{\"name\": \"department-badge\", \"footer\": \"<button type=\\'button\\' class=\\'btn btn-default\\' data-dismiss=\\'modal\\'>Close</button>\"}',\n '{\"name\": \"delete-comment\", \"header\": \"Confirm\", \"body\": \"Are you sure you want to delete this comment?\"}',\n '{\"name\": \"delete-post\", \"header\": \"Confirm\", \"body\": \"Are you sure you want to delete this post?\"}',\n '{\"name\": \"photo-popup\", \"footer\": \"<button type=\\'button\\' class=\\'btn btn-default\\' data-dismiss=\\'modal\\'>Close</button>\"}',\n '{\"name\": \"share-popup\", \"header\": \"Share <span style=\\'0px 9px\\'>|</span> LionsMatter\", \"subheader\": \"Where would you like to share this post?\", \"footer\": \"<button type=\\'button\\' class=\\'btn btn-default\\' data-dismiss=\\'modal\\'>Close</button>\"}',\n '{\"name\": \"terms-of-service\", \"header\": \"Terms of Service <span style=\\'0px 9px\\'>|</span> LionsMatter\", \"subheader\": \"Rules for using LionsMatter\", \"footer\": \"<button type=\\'button\\' class=\\'btn btn-default\\' data-dismiss=\\'modal\\'>Close</button>\"}',\n '{\"name\": \"timeline-update\", \"header\": \"Update Timeline\"}',\n '{\"name\": \"vine-popup_display\", \"footer\": \"<button type=\\'button\\' class=\\'btn btn-default\\' data-dismiss=\\'modal\\'>Close</button>\"}',\n '{\"name\": \"vine-popup_input\", \"header\": \"Vine <span style=\\'0px 9px\\'>|</span> LionsMatter\", \"subheader\": \"Submit a Vine link with your post.\", \"body\": \"<div style=\\'text-align: center\\'><div class=\\'form-group\\' style=\\'margin-top: 10px\\'><label class=\\'control-label\\' style=\\'display: none; margin-bottom: 15px\\'>Error: Please provide a link to a valid Vine.</label><input id=\\'vineModalINPUT\\' type=\\'text\\' class=\\'form-control\\' style=\\'display: inline-block; width: 75%\\' placeholder=\\'Vine link\\'/></div><p style=\\'display: inline-block; font-size: 85%; text-align: left; width: 75%\\'><strong>Note:</strong> If you intend to post anonymously, you should know that Vine posts will display your account information by default. LionsMatter will not discriminate, however, against throwaway Vine accounts (which are anonymous).</p></div>\"}'];\n\n \n\t// settings\n this.simplicity = function(){if($.inArray(this.type, this.simplicity_template) == -1){return 'complex';} else{return 'simple';}}\n\tthis.isDisplayed = false;\n\n\t// HTML elements\n\tthis.HTML_shell = $(\"<div class='modal fade' id='modalCustom' tabindex='-1' aria-hidden='true'><div class='modal-dialog'><div class='modal-content'></div></div></div>\"),\n this.HTML_trigger = \"<a href='#modalCustom' id='modalCustomButton' data-toggle='modal'></a>\",\n this.HTML_content = function(modalTitle, modalBody, modalFooter){return \"<div class='modal-header'><button type='button' class='close' data-dismiss='modal' aria-hidden='true'>×</button>\"+ modalTitle +\"</div><div class='modal-body'>\"+ modalBody +\" </div><div class='modal-footer'>\"+ modalFooter +\"</div>\";},\n this.HTML_header = function(modalHeader){return \"<h4 class='modal-title'>\"+ modalHeader +\"</h4>\";},\n this.HTML_subheader = function(modalSubheader){return \"<h5 class='text-muted' style='margin-top: 0px; margin-bottom: 0px'>\"+ modalSubheader +\"</h5>\"};\n\n // simple functions\n this.construct = function()\n {\n var template = this.findTemplate();\n\n if(this.simplicity()=='complex'){$(this.HTML_shell).addClass('lionsmatter');}\n if(template.subheader != null){this.header = this.HTML_header(template.header) + ' ' + this.HTML_subheader(template.subheader);}else if(template.header != null){this.header = this.HTML_header(template.header);}else{this.customHeader();}\n if(template.body != null){this.body = template.body;}else{this.customBody();}\n if(template.footer != null){this.footer = template.footer;}else{this.customFooter();}\n\n $(this.HTML_shell).find('.modal-content').html(this.HTML_content(this.header, this.body, this.footer)).append(this.HTML_trigger);\n $(this.HTML_shell).on('hidden.bs.modal', function()\n {\n this.remove();\n modal.isDisplayed = false;\n\n if(modal.hasOwnProperty('redirect')&& modal.vars['redirect']!=null){window.location = modal.vars['redirect'];}\n });\n }\n this.findTemplate = function()\n {\n for(x = 0; x < this.structure_template.length; x++){if(JSON.parse(this.structure_template[x]).name==this.type){return JSON.parse(this.structure_template[x]);}}return 'failure';\n }\n}// modal methods","title":""},{"docid":"5ae52f5fa55531ebdbc75c1de5f12291","score":"0.5980192","text":"function LauchModal(tModal){\n switch (tModal) {\n case \"registro\":\n modal.style.display = \"block\";\n break;\n \n case \"ig\":\n moig.style.display = \"block\";\n break;\n\n default:\n break;\n }\n}","title":""},{"docid":"0a17437829d88b6f53b21c72e1e45a2e","score":"0.59617615","text":"handleOpenTypeCModal() {\n this.setState({ showTypeCModal: !this.state.showTypeCModal });\n }","title":""},{"docid":"5b776cd721342439661e82e557ddb234","score":"0.5906419","text":"function viewAdvancedModal(modalType) {\n if (modalType == \"warning-modal\") {\n $('#advanced-modal').removeClass(\"success-modal\");\n $('#advanced-modal').removeClass(\"danger-modal\");\n $('#advanced-modal').addClass(\"warning-modal\");\n\n $(\"#advanced-modal .modal-icon span\").removeAttr(\"class\");\n $(\"#advanced-modal .modal-icon span\").addClass(\"fa fa-exclamation\");\n\n }\n else if (modalType == \"danger-modal\") {\n $('#advanced-modal').removeClass(\"success-modal\");\n $('#advanced-modal').removeClass(\"warning-modal\");\n $('#advanced-modal').addClass(\"danger-modal\");\n\n $(\"#advanced-modal .modal-icon span\").removeAttr(\"class\");\n $(\"#advanced-modal .modal-icon span\").addClass(\"fa fa-times\");\n }\n else if (modalType == \"success-modal\") {\n $('#advanced-modal').removeClass(\"danger-modal\");\n $('#advanced-modal').removeClass(\"warning-modal\");\n $('#advanced-modal').addClass(\"success-modal\");\n\n $(\"#advanced-modal .modal-icon span\").removeAttr(\"class\");\n $(\"#advanced-modal .modal-icon span\").addClass(\"fa fa-check\"); \n }\n\n $('#advanced-modal').modal({\n show: true,\n keyboard: false,\n backdrop: 'static'\n });\n }","title":""},{"docid":"f36ab3e99dfc7df8889a4c8b0beedcdb","score":"0.5892532","text":"function modalMessages(title, body, type)\n {\n \tif (type !== undefined){\n \t\t$(\".modal\").removeClass(\"modal-success\").addClass('modal-'+type);\n \t} \n \t\n $(\".modal-title\").html(title);\n $(\".modal-body\").html(body);\n }","title":""},{"docid":"1a765081b4220aa9f3793a71474fe007","score":"0.57874775","text":"function viewModal(modalType,modalSize) {\n if (modalType == \"add-modal\") {\n $('#form-modal').removeClass(\"warning-modal\");\n $('#form-modal').removeClass(\"danger-modal\");\n $('#form-modal').addClass(\"success-modal\");\n }\n else if (modalType == \"edit-modal\") {\n $('#form-modal').removeClass(\"success-modal\");\n $('#form-modal').removeClass(\"danger-modal\");\n $('#form-modal').addClass(\"warning-modal\");\n }\n else if (modalType == \"delete-modal\") {\n $('#form-modal').removeClass(\"success-modal\");\n $('#form-modal').removeClass(\"warning-modal\");\n $('#form-modal').addClass(\"danger-modal\");\n }\n else if (modalType == \"details-modal\") {\n $('#form-modal').removeClass(\"success-modal\");\n $('#form-modal').removeClass(\"warning-modal\");\n $('#form-modal').removeClass(\"danger-modal\");\n }\n else {\n alert(\"modal Type Undefined !!\");\n }\n\n if(modalSize ==\"xl\"){\n $('#form-modal').children(\".modal-dialog\").removeClass(\"modal-lg\");\n $('#form-modal').children(\".modal-dialog\").removeClass(\"modal-sm\");\n $('#form-modal').children(\".modal-dialog\").addClass(\"modal-xl\");\n }\n if(modalSize ==\"lg\"){\n $('#form-modal').children(\".modal-dialog\").removeClass(\"modal-xl\");\n $('#form-modal').children(\".modal-dialog\").removeClass(\"modal-sm\");\n $('#form-modal').children(\".modal-dialog\").addClass(\"modal-lg\");\n }\n if(modalSize ==\"md\"){\n $('#form-modal').children(\".modal-dialog\").removeClass(\"modal-xl\");\n $('#form-modal').children(\".modal-dialog\").removeClass(\"modal-lg\");\n $('#form-modal').children(\".modal-dialog\").removeClass(\"modal-sm\");\n }\n if(modalSize ==\"sm\"){\n $('#form-modal').children(\".modal-dialog\").removeClass(\"modal-xl\");\n $('#form-modal').children(\".modal-dialog\").removeClass(\"modal-lg\");\n $('#form-modal').children(\".modal-dialog\").addClass(\"modal-sm\");\n }\n\n $('#form-modal').modal({\n show: true,\n keyboard: false,\n backdrop: 'static'\n });\n }","title":""},{"docid":"1c1bd7e11e4d7d4ffcb5b9ee0632dd56","score":"0.5762506","text":"resetModalInputs_() {\n super.resetModalInputs_();\n this.firstTypeInput_.selected = true;\n }","title":""},{"docid":"c38e7b8fb4eab1c2b41d5a304628ec35","score":"0.5754257","text":"function modalReducer(state = initialModal, { type, payload }) {\n switch (type) {\n case SELECT_POKEMON:\n return {\n mode: payload.mode,\n isOpen: payload.isOpen,\n activePokemon: payload.activePokemon\n };\n default:\n return state;\n }\n}","title":""},{"docid":"36fa0973d19412e81f2f059360a5e4c3","score":"0.57212174","text":"handleOpenTypeDModal() {\n this.setState({ showTypeDModal: !this.state.showTypeDModal });\n }","title":""},{"docid":"0de01f81ec68f06a109cc98950e4e8b7","score":"0.56534976","text":"function openModal(modalType){\r\n\tif (modalType == null){\r\n\t modalError(); //need to write a full function\r\n\t}\r\n\telse {\r\n\t //console.log('the modal opened');\r\n\t $(\"#blanket\").addClass(\"live-blanket\");\r\n\t $(\"#modal\").show().addClass(\"live-modal\");\r\n\t $(\"#modal-content\").addClass(\"live-modal-content\");\r\n\t $(\"#modal-left-pane\").html(modalCloseButton);\r\n\t modalType();\r\n\t}\r\n }","title":""},{"docid":"d695f1ff107894832a857de3a598fd1a","score":"0.56129766","text":"handleCloseTypeCModal() {\n this.setState({ showTypeCModal: !this.state.showTypeCModal });\n }","title":""},{"docid":"9d90f0ae143ddae4c5e08bcca0f5a44a","score":"0.5578669","text":"function cleanItemModal(type) {\n\t\t$('form')[0].reset();\n\t\t$('.alert').css('display', 'none');\n\t\t$('div.form-group').removeClass('has-error');\n\t\t$('#type').val(type);\n\n\t\tif(type == 'bed') {\n\t\t\tvar wards = '';\n\t\t\tfor (var i = 0; i < php.wards.length; i++) {\n\t\t\t\tif(Number(php.wards[i].capacity) > php.wards[i].beds.length)\n\t\t\t\t\twards += '<option value=\"' +php.wards[i].id+ '\">'+ php.wards[i].identification+ '</option>';\n\t\t\t};\n\t\t\t$('#ward_id').html('<option val=\"\">None</option>' + wards);\t\t\t\n\t\t}\n\n\t\tif(type == 'ward' && $('#wardField').css('display') == 'none') {\n\t\t\t$('#wardField').css('display', 'block').find('input').prop('disabled', false);\n\t\t\t$('#bedField').css('display', 'none').find('select').prop('disabled', true);\n\t\t} else if(type == 'bed' && $('#bedField').css('display') == 'none') {\n\t\t\t$('#bedField').css('display', 'block').find('select').prop('disabled', false);\n\t\t\t$('#wardField').css('display', 'none').find('input').prop('disabled', true);\t\t\t\n\t\t}\n\t}","title":""},{"docid":"b8c97132f7b46a806936ea18baa833b0","score":"0.55732274","text":"handleOpenTypeBModal() {\n this.setState({ showTypeBModal: !this.state.showTypeBModal });\n }","title":""},{"docid":"6cdd688562b6bf02cb349fa706ad80bb","score":"0.55468035","text":"function ModalCerrarCondicion() {\n if (modalA === 1) {\n $('#contratoDetallesmodalE').modal('show');\n } else {\n if (modalA === 2) {\n $('#contratoDetallesmodalEN').modal('show');\n } else {\n $('#NuevoContratoDetallesmodalE').modal('show');\n }\n }\n}","title":""},{"docid":"194f27c2b9297fcc835cfabef625b1f7","score":"0.5536226","text":"render (props) {\n let title = this.props.title;\n let type = this.props.type;\n let modalClass = this.state.modalClass + (type.indexOf('delete') >= 0 ? ' delete-modal' : (type.indexOf('memberInfo') >= 0 ? ' mem-info-modal' : ''));\n let modalBackClass = this.state.modalBackClass;\n let left = this.state.left;\n let typeId = this.state.typeId;\n return(\n <div>\n <div className={modalClass} style={{left:left}}>\n <div className=\"modal-head\">\n <span className=\"modal-title\"><b>{title}</b></span><i className=\"modal-close jstfont\" onClick={this.closeModal}></i>\n </div>\n {type == 'password' && <PasswordModal ref=\"changePassword\" dataChange={this.dataChange}/>}\n {type == '/employees' && <EmployeeModal ref=\"newModal\" typeId={typeId} type={type} dataChange={this.dataChange}/>}\n {type.indexOf('delete') > 0 && <DeleteModal ref=\"newModal\" typeId={typeId} type={type} dataChange={this.dataChange}/>}\n {type == '/members' && <MemberModal ref=\"newModal\" typeId={typeId} type={type} dataChange={this.dataChange}/>}\n {type == '/products' && <ProductModal ref=\"newModal\" typeId={typeId} type={type} dataChange={this.dataChange}/>}\n {type == '/orders' && <OrderModal dataChange={this.dataChange}/>}\n {type == '/charge' && <RechargeModal typeId={typeId} dataChange={this.dataChange}/>}\n {type == '/export' && <ExportModal typeId={typeId} dataChange={this.dataChange}/>}\n {type == 'memberInfo' && <MemberInfoModal typeId={typeId}/>}\n <div className=\"modal-footer\">\n <input type=\"button\" className=\"btn cancel\" value=\"取消\" onClick={this.closeModal}/>\n {(type != 'memberInfo' && type.indexOf('delete')<0) && <input type=\"button\" className=\"btn\" value={type =='/export'?'导出':'保存'} onClick={this.handleClick}/>}\n {type.indexOf('delete') > 0 && <input type=\"button\" className=\"btn\" value=\"确定\" onClick={this.handleClick}/>}\n </div>\n </div>\n <div className={modalBackClass}></div>\n </div>\n );\n }","title":""},{"docid":"780acea7aa4101149ae29e53b6c3e20b","score":"0.54911774","text":"modal (name, data = {}) {\n switch (name) {\n default:\n return undefined\n }\n }","title":""},{"docid":"a5d0f926f4229e8a1798fe3cac6ae427","score":"0.5469759","text":"addModal (p) {\n p.type = MODAL\n const config = this.buildConfig(p)\n return this.buildDialog(config)\n }","title":""},{"docid":"43dabed9c12f092be68fe0c8835d21c4","score":"0.5451498","text":"function mostrarModal(tipo, mensaje) {\n let alert=$('#modal .alert');\n alert.removeClass(\"alert-primary alert-secondary alert-success alert-danger alert-warning alert-info alert-light alert-dark\");\n switch(tipo) {\n case \"secondary\":\n alert.addClass(\"alert-secondary\");\n break;\n case \"success\":\n alert.addClass(\"alert-success\");\n break;\n case \"danger\":\n alert.addClass(\"alert-danger\");\n break;\n case \"warning\":\n alert.addClass(\"alert-warning\");\n break;\n case \"info\":\n alert.addClass(\"alert-info\");\n break;\n case \"light\":\n alert.addClass(\"alert-light\");\n break;\n case \"dark\":\n alert.addClass(\"alert-dark\");\n break;\n default:\n alert.addClass(\"alert-primary\");\n }\n alert.empty();\n alert.append(mensaje);\n $('#modal').modal('show');\n}","title":""},{"docid":"68b8e90579321637e7ab8c8931b0ab50","score":"0.5451242","text":"handleCloseTypeDModal() {\n this.setState({ showTypeDModal: !this.state.showTypeDModal });\n }","title":""},{"docid":"0900e54d25e6250771651ace84f84f5f","score":"0.5446287","text":"getTypeDialogue(){\n\t\tvar type = this.eventPage.page[this.eventPage.id].type;\n\t\tvar idType = this.eventPage.page[this.eventPage.id].idType -1;\n\t\t\n\t\tif(type == \"dialogue\"){\n\t\t\t// do dialogue things ...\n\t\t\tvar typeDialogue = this.scene.sys.cache.json.get('NPCdial_'+type)[idType];\n\t\t\tthis.eventPage.id ++;\n\t\t\tthis.eventPage.dialogue = true;\n\t\t\ttypeDialogue.type = type;\n\t\t\treturn typeDialogue ;\n\t\t}else if(type ==\"choice\"){\n\t\t\tvar typeDialogue = this.scene.sys.cache.json.get('NPCdial_'+type)[idType];\n\t\t\tthis.eventPage.id ++;\n\t\t\tthis.eventPage.choice = true;\n\t\t\ttypeDialogue.type = type;\n\t\t\treturn typeDialogue ;\n\t\t\t// do choice things ...\n\t\t}else if(type ==\"shop\"){\n\t\t\tvar typeDialogue = this.scene.sys.cache.json.get('NPCdial_'+type)[idType];\n\t\t\tthis.eventPage.id ++;\n\t\t\tthis.eventPage.shop = true;\n\t\t\ttypeDialogue.type = type;\n\t\t\treturn typeDialogue ;\n\t\t\t// do shop things...\n\t\t\t\n\t\t}else if(type==\"goto\"){\n\t\t\tthis.eventPage.id = idType;\n\t\t\t//var typeDialogue = this.scene.sys.cache.json.get('NPCdial_'+type)[idType];\n\t\t\t//this.eventPage.id = typeDialogue.idType;\n\t\t\treturn this.getTypeDialogue();\n\t\t\t// do goto things..\n\t\t}else if(type==\"end\"){\n\n\t\t\tvar i = this.eventPage.id;\n\t\t\tthis.eventPage.id = 0;\n\t\t\treturn this.eventPage.page[i];\n\t\t\t//do end things...\n\t\t}else{\n\t\t\treturn;\n\t\t}\n\t\t\n\n\t}","title":""},{"docid":"9eedc724ca6fbf987fc7a7de201f11e6","score":"0.544345","text":"function ModalAbiertoCondicion() {\n if ($('#contratoDetallesmodalE').is(':visible')) {\n $('#contratoDetallesmodalE').modal('hide');\n modalA = 1;\n } else {\n if ($('#contratoDetallesmodalEN').is(':visible')) {\n $('#contratoDetallesmodalEN').modal('hide');\n modalA = 2;\n } else {\n $('#NuevoContratoDetallesmodalE').modal('hide');\n modalA = 3;\n }\n }\n\n}","title":""},{"docid":"f79276afece59febe26421b41c493dde","score":"0.54180837","text":"openRepoTypeModal() {\n let addTextBelowIcon = ['Bower', 'Chef', 'CocoaPods', 'Conan', 'Pypi', 'Puppet', 'Opkg', 'Composer', 'SBT', 'Gradle', 'Gems', 'NuGet', 'GitLfs','Generic','P2','VCS','CRAN'];\n this.$repoTypeScope = this.$scope.$new();\n this.$repoTypeScope.packageTypes = this.getPackageType();\n this.$repoTypeScope.highlightCheck = (typeFilter,type) => {\n if (typeFilter) {\n let string = type.text.toLowerCase(),\n searchstring = typeFilter.toLowerCase().replace(/ /g,'');\n\n\n if (string.substr(0, searchstring.length) == searchstring) {\n type.highlighted = true;\n return true;\n } else {\n type.highlighted = false;\n return false;\n };\n }\n };\n this.$repoTypeScope.checkNoResults = (typeFilter) => {\n if (typeFilter && typeFilter.length > 0 && _.filter(this.packageType,(type)=>type.highlighted).length == 0) {\n return true;\n }\n };\n this.$repoTypeScope.isSelected = () => {\n let HighlightedListItems = _.filter(this.packageType,(type)=>type.highlighted);\n if (HighlightedListItems.length == 1) {\n return true;\n }\n };\n this.$repoTypeScope.selectPackage = () => {\n let selectedItem = _.filter(this.packageType,(type)=>type.highlighted);\n if (selectedItem.length == 1) {\n this.selectRepoType(selectedItem[0])\n }\n };\n\n _.map(this.$repoTypeScope.packageTypes,(type)=>{\n if (_.includes(addTextBelowIcon, type.serverEnumName)) type.helpText = true;\n });\n\n if (this.features.isNonCommercial()) {\n _.forEach(this.$repoTypeScope.packageTypes, item => {\n if (!this.features.isEnabled(item.value)) item.disabled = true;\n });\n\n let activeItems = [];\n if (this.features.isConanCE()) {\n activeItems = _.remove(this.$repoTypeScope.packageTypes, item => item.serverEnumName === \"Conan\" || item.serverEnumName === \"Generic\");\n }\n else if (this.features.isJCR()) {\n activeItems = _.remove(this.$repoTypeScope.packageTypes, item => item.serverEnumName === \"Docker\" || item.serverEnumName === \"Helm\" || item.serverEnumName === \"Generic\");\n }\n\n this.$repoTypeScope.packageTypes = [...activeItems, ...this.$repoTypeScope.packageTypes];\n }\n this.$repoTypeScope.closeModal = () => this.closeModalPackageType();\n this.$repoTypeScope.modalClose = ()=> this.modalClose();\n this.$repoTypeScope.selectRepoType = (type)=>this.selectRepoType(type);\n this.isTypeModalOpen = true;\n\n this.repoTypeModal = this.modal.launchModal('repository_type_modal', this.$repoTypeScope, 1000);\n this.repoTypeModal.result.finally(() => {\n this.repositoriesForm.repoKey.$validate();\n this.isTypeModalOpen = false;\n if (this.repoInfo.isType('debian')) {\n this.onFormatSelectionChange();\n }\n\n });\n }","title":""},{"docid":"55ec34e9860385b5fe3df79087372a13","score":"0.5417084","text":"handleClickGamesModal(e) {\n const { modalShow } = this.state;\n if (modalShow === false) {\n this.setState({\n type: e.target.innerText,\n modalShow: true\n })\n } else {\n this.setState({\n modalShow: false\n })\n }\n }","title":""},{"docid":"0266d69621b9938c9cec410f9d114964","score":"0.5400444","text":"function recaudadorModal(e, limpiar){\r\n\r\n var defaultOption = e.parents('.account_group').find('.cpl_modal .modal_recaudador .custom_select ul li.default').html();\r\n var select_recaudador = e.parents('.account_group').find('.cpl_modal .modal_recaudador');\r\n\r\n// limpio el campo del fondo recaudador \r\nvar campoFondoRecaudador = e.parents('.account_group').find('.cpl_modal .modal_recaudador .inputSelect');\r\nif (limpiar == true){\r\ncampoFondoRecaudador.val('');\r\nselect_recaudador.find('.selected').html(defaultOption);\r\n}\r\n fondosSeleccionados = FondosSeleccionadosModal(e);\r\n// alert('fondos en el modal: '+fondosSeleccionados);\r\n console.log(fondosSeleccionados);\r\n if(fondosSeleccionados.length == 2){\r\n select_recaudador.show(200);\r\n }else{\r\n select_recaudador.hide();\r\n }\r\n\r\n console.log('fondos seleccionados en el modal'+ fondosSeleccionados);\r\n}","title":""},{"docid":"c06db1d1a5cbd9438374d5b3fa8d4db3","score":"0.5399589","text":"function openModal(params) {\n if (!params || !params.type) {\n throw new Error('Missing modal type');\n }\n var modalInstance = $modal.open({\n templateUrl: 'modal/templates/modalcontainer.html',\n controller: 'ModalController',\n scope: $scope,\n size: params.size,\n resolve: {\n // The return value is passed to ModalController as 'locals'\n locals: function () {\n return {\n type: params.type,\n wallet: $rootScope.wallets.current,\n userAction: BG_DEV.MODAL_USER_ACTIONS.sendFunds\n };\n }\n }\n });\n return modalInstance.result;\n }","title":""},{"docid":"c8f062acc1d8cc361382d53fd040e696","score":"0.53938","text":"onOpenModalDelete(payload){\n if(payload.type == 'img')\n {\n this.idItemImgDelete = payload.id;\n this.typeItemDelete = 'img';\n }\n else if(payload.type==\"video\"){\n this.idItemVideoDelete = payload.id;\n this.typeItemDelete = 'video';\n }\n this.modalIsOpenDelete = true;\n }","title":""},{"docid":"245edf12bfe285acb3d9ed7858d67a92","score":"0.5384235","text":"modalPackage(state){\n return state.setToModal\n }","title":""},{"docid":"b20a8f177abbcf02c8bf02ae31c0eff8","score":"0.53747857","text":"function closeModal(tModal) {\n switch (tModal) {\n case \"registro\":\n modal.style.display = \"none\";\n break;\n \n case \"ig\":\n moig.style.display = \"none\";\n break;\n\n default:\n break;\n }\n \n}","title":""},{"docid":"c6c0690abc4922f18199532556983a9e","score":"0.5374741","text":"showAssignModal(type, id) {\n console.log(type);\n assignModal.id = id;\n $('#assign-modal').modal('show');\n }","title":""},{"docid":"bf2a6792b4905cb01c86e9cd6cd8ed43","score":"0.53740275","text":"handleCloseTypeBModal() {\n this.setState({ showTypeBModal: !this.state.showTypeBModal });\n }","title":""},{"docid":"3b9093571079c32a9a5d5da728317d28","score":"0.5372368","text":"function getModalidad() {\n console.log(\"Ya seleccione\");\n console.log(vm.selectedModalidad);\n vm.Modalidad=vm.selectedModalidad\n }","title":""},{"docid":"93fd85acba5e8d8d37b2a9133498c5c5","score":"0.5366218","text":"showModal(selectedUser) {\n \t//switch based on \"type\" sent into component\n \t//this is a temporary work around as we transition into non-team supplier contacts\n \tvar type = this.props.type;\n \tif(type==\"team\"||(selectedUser&&selectedUser.collectionName==\"Team\")) {\n\t Modal.show({\n\t content:<TeamCard \n\t \titem={selectedUser} \n\t \tteam={this.data.team}\n\t \trole={this.data.role}\n\t \tgroup={this.data.group}/>\n\t })\n \t}\n \telse {\n\t Modal.show({\n\t content:<UserCard \n\t \titem={selectedUser} \n\t \tteam={this.data.team}\n\t \trole={this.data.role}\n\t \tgroup={this.data.group}/>\n\t })\n\t }\n }","title":""},{"docid":"686871639dfb9a6e33d181a75ab7d390","score":"0.5359939","text":"function cambiaHeadModal(titulo,opc1){\r\n alert ('hola');\r\n debugger;\r\n switch(opc1)\r\n {\r\n case '1':\r\n $(\"#TituloModal\").removeClass('alert-success').removeClass('alert-danger').html(titulo);\r\n break;\r\n case '2':\r\n $(\"#TituloModal2\").removeClass('alert-success').removeClass('alert-danger').html(titulo);\r\n break;\r\n }\r\n debugger; \r\n\r\n }","title":""},{"docid":"af996931b2648af27026cf32724dedf1","score":"0.53595763","text":"static get types() {\n return {\n 'treble': {\n code: 'gClef',\n line: 3,\n },\n 'bass': {\n code: 'fClef',\n line: 1,\n },\n 'alto': {\n code: 'cClef',\n line: 2,\n },\n 'tenor': {\n code: 'cClef',\n line: 1,\n },\n 'percussion': {\n code: 'restMaxima',\n line: 2,\n },\n 'soprano': {\n code: 'cClef',\n line: 4,\n },\n 'mezzo-soprano': {\n code: 'cClef',\n line: 3,\n },\n 'baritone-c': {\n code: 'cClef',\n line: 0,\n },\n 'baritone-f': {\n code: 'fClef',\n line: 2,\n },\n 'subbass': {\n code: 'fClef',\n line: 0,\n },\n 'french': {\n code: 'gClef',\n line: 4,\n },\n 'tab': {\n code: '6stringTabClef',\n },\n };\n }","title":""},{"docid":"cc20245c237960ce1b0a0c12427da0c7","score":"0.535138","text":"function edit_open_modal(ip_value, typeoftable) {\n console.log(typeoftable);\n modal.style.display = \"block\";\n document.querySelector(\"#edit_id\").value = document.getElementById('id_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_id\").disabled = true\n document.querySelector(\"#edit_ip\").value = document.getElementById('ip_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_all_brand\").value = document.getElementById('brand_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_model\").value = document.getElementById('model_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_camera_name\").value = document.getElementById('camera_name_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_user\").value = document.getElementById('user_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_password\").value = document.getElementById('password_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_all_Auth_type\").select = document.getElementById('auth_type_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_stream_url\").value = document.getElementById('stream_url_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_location_name\").value = document.getElementById('location_name_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_latitude\").value = document.getElementById('latitude_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_longitude\").value = document.getElementById('longitude_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_all_organization\").value = document.getElementById('organization_rows' + ip_value).innerHTML;\n document.querySelector(\"#edit_cam_type\").value = document.getElementById('cam_type_rows' + ip_value).innerHTML;\n}","title":""},{"docid":"b3ddfb7db2e601f9b313f22bdd5bc527","score":"0.5346572","text":"render() {\n return (\n <div className=\"container\">\n <Button\n bsStyle=\"primary\"\n bsSize=\"small\"\n onClick={this.open}\n className=\"float-right-margin\"\n >\n Add {this.props.type === 'StudentAtCampus' ? 'Student': this.props.type}\n </Button>\n <Modal show={this.state.showModal} onHide={this.close}>\n <Modal.Header closeButton>\n <Modal.Title>Add {this.props.type}</Modal.Title>\n </Modal.Header>\n <Modal.Body>\n {this.renderTypeForm()}\n </Modal.Body>\n <Modal.Footer>\n <Button onClick={this.close}>Close</Button>\n </Modal.Footer>\n </Modal>\n </div>\n );\n }","title":""},{"docid":"0c5baac018c1774924e49d7cf50ae4c2","score":"0.53448564","text":"function ModalAbiertoCondicionReg() {\n if ($('#contratoDetallesmodal').is(':visible')) {\n $('#contratoDetallesmodal').modal('hide');\n modalReg = 1;\n } else {\n $('#detallesContratomodal').modal('hide');\n modalReg = 2;\n }\n\n}","title":""},{"docid":"2079a8830c397a395fcdb9d648a39506","score":"0.53278744","text":"changeWalletType(type) {\n // Set wallet typeModalOpen\n this._selectedType = this.walletTypes[type - 1];\n }","title":""},{"docid":"9feab82f035ddab5105fe23d8d053d75","score":"0.53081703","text":"function setAmenityType(row){\n\tvar selectedRows = View.panels.get('abRplmAddEditClausesAmntType').getSelectedRows();\n\tpanel = rplmClauseController.formClause;\n\tfor (i = 0; i<selectedRows.length; i++){\n\t\t\n\t\tvar comments = (selectedRows[i]['bl_amenity.comments'])?\" - Comments: \"+selectedRows[i]['bl_amenity.comments']:\"\";\n\t\t\n\t\tpanel.setFieldValue('ls_resp.description' , panel.getFieldValue('ls_resp.description')+ \" Amenity Type: \"+ selectedRows[i]['bl_amenity.amenity_type']+comments +\". \");\t\n\t}\n\tView.panels.get('abRplmAddEditClausesAmntType').closeWindow();\n}","title":""},{"docid":"0e19e0232559661b15d1cd8ee45b7648","score":"0.5303632","text":"function showTypeTransaction() {\n var tmpArray1 = (gUserInfo.lang == 'EN') ? CONST_ACCOUNT_QUERY_TYPE_TRANSACTION_EN :\n CONST_ACCOUNT_QUERY_TYPE_TRANSACTION_VN;\n var tmpArray2 = CONST_ACCOUNT_QUERY_TYPE_TRANSACTION_VAL;\n\n var handleInputTypeTransaction = function(e) {\n document.removeEventListener(\"evtSelectionDialog\", handleInputTypeTransaction, false);\n var acctype = document.getElementById('idTypeTransaction');\n if ((e.selectedValue1 != undefined) && (e.selectedValue1 != null)) {\n if (acctype.nodeName == \"INPUT\") {\n acctype.value = e.selectedValue1;\n transaction = getValueTransaction(e);\n }\n\n } else {\n acctype.innerHTML = e.selectedValue1;\n transaction = getValueTransaction(e);\n }\n\n if ((e.selectedValue2 != undefined) && (e.selectedValue2 != null)) {\n typeTransaction = e.selectedValue2;\n }\n }\n\n var handleInputTypeTransactionClose = function() {\n document.removeEventListener(\"evtSelectionDialogClose\", handleInputTypeTransactionClose, false);\n document.removeEventListener(\"evtSelectionDialog\", handleInputTypeTransaction, false);\n }\n\n document.addEventListener(\"evtSelectionDialog\", handleInputTypeTransaction, false);\n document.addEventListener(\"evtSelectionDialogClose\", handleInputTypeTransactionClose, false);\n showDialogList(CONST_STR.get(\"COM_CHOOSEN_TYPE_TRANS\"), tmpArray1, tmpArray2, false);\n}","title":""},{"docid":"f05b54b68dbfb270d118c08a4dadc87f","score":"0.5302202","text":"function showAddServiceModal(type, objectList, category) {\n if(type == 1) {\n $('#title-icon').hide();\n $('#title-name').html('Category');\n $('#title-category').html('');\n } else {\n $('#title-icon').show();\n $('#title-name').html('Service');\n $('#title-category').html(category);\n }\n if(objectList.constructor === Array) {\n var html = '';\n objectList.forEach(function(element) {\n html += '<li class=\"nn-item\">' +\n '<span class=\"nn-num\">'+ element.id +'</span>' +\n '<span class=\"nn-name\">'+ element.name +'</span>' +\n '<span class=\"nn-price font-weight-bold\">'+ element.price +'</span>' +\n '<span class=\"nn-tick icon wb-check d-none\"></span>' +\n '</li>'\n });\n\n $('#list-order').html(html);\n }\n\n if(!($(\"#addServiceModal\").data('bs.modal') || {isShown: false}).isShown) $('#addServiceModal').modal('show');\n}","title":""},{"docid":"6a10c63eed5b99776d6a6b84fe5f7c3e","score":"0.5292278","text":"handleOpenTypeAModal() {\n this.setState({ showTypeAModal: !this.state.showTypeAModal });\n }","title":""},{"docid":"a5f32c212e87d289bcf2ce06431bcdd5","score":"0.529095","text":"function close_modal(type)\n{\n var menu = document.getElementById(type);\n menu.style.display = \"none\";\n}","title":""},{"docid":"53f6ea7975f7ae5d4290f4244e6835f1","score":"0.5280262","text":"function showModalCreatePaciente() {\n $('#modalCreatePrimerApellido').val($('#PrimerApellido').val());\n $('#modalCreatePrimerNombre').val($('#PrimerNombre').val());\n $('#modalCreateSexoId').val($('#Sexo').val());\n $('#modalCreateSexoNombre').val($('#Sexo option:selected').text());\n $('#modalCreateTipoDocumentoId').val($('#TipoDocumentoId').val());\n $('#modalCreateTipoDocumentoNombre').val($(\"#TipoDocumentoId option:selected\").text());\n $('#modalCreateNroDocumento').val($('#NroDocumento').val());\n $('#modalCreateFechaNacimiento').val($('#FechaNacimiento').val());\n $('#modalCreateEmail').val('');\n\n $('#modalCreatePaciente').modal('show');\n}","title":""},{"docid":"1473642cbb7a8683297078e026965b09","score":"0.5277371","text":"getModalFromAction() {\n switch(this.state.actionId) {\n case 2:\n return (<IngestTelemetryModalForm parent={ this }/>);\n\n case 3:\n return (<TransferResponsibilityModalForm parent={ this }/>);\n\n default:\n break;\n }\n return(<h1>Modal</h1>)\n }","title":""},{"docid":"e6caabc12cf6d53f358d6947e528e8f2","score":"0.52767384","text":"function showTrainingType(){\n $scope.trainingTypeModalTitle = '选择培训类别';\n $scope.trainingTypeModal = $modal({scope: $scope, templateUrl: 'partials/hr/training/modal.trainingType.html', show: true });\n //$scope.modalTrainingypes = angular.copy($scope.trainingTypes);\n }","title":""},{"docid":"1ce0af627ea8f70d048c27bcc4fd6a58","score":"0.5274318","text":"function apriModaleSoggetto() {\n $(\"#codiceSoggetto_modale\").val($(\"#codiceSoggettoSoggetto\").val());\n $(\"#modaleGuidaSoggetto\").modal(\"show\");\n }","title":""},{"docid":"01b77f78b74affe00fa498bd9593791f","score":"0.5266534","text":"setType () {\n}","title":""},{"docid":"aae03214fc35a5360ad66168a921af50","score":"0.52660805","text":"MODAL_OPEN({ commit }, data) {\t\t\n\t\tcommit(\"SET_MODAL_OPEN\", data);\n\t}","title":""},{"docid":"d8b8698d5f10ef3f349ee302c56a444a","score":"0.52648365","text":"modalFilled (modal) {\n let cr = document.getElementById('create-room')\n if(!cr) document.querySelector('.tingle-modal-box__footer').style.display='flex';\n let type = modal.__type;\n setTimeout(function(){ modal.checkOverflow() }, 300);\n var letsgo = document.querySelectorAll('.letsgo');\n if(!letsgo.length){\n\n modal.addFooterBtn(\"Let's Go ! <i class='fas fa-chevron-right'></i>\", 'tingle-btn tingle-btn--primary letsgo tingle-btn--pull-right', function(e){\n try { med.mutedStream = med.h.getMutedStream(); } catch(err){ console.warn(\"error in getting mutedstream\",err); }\n self.handleOk({type,modal,e});\n\n });\n }\n }","title":""},{"docid":"0d73d6a2e973f9382159a42a6542afab","score":"0.5261974","text":"function showStatusALERT(id) {\r\n $(\"#trasanoModalHeader\").empty();\r\n $(\"#trasanoModalBody\").empty();\r\n $(\"#trasanoModalFooter\").empty();\r\n $(\"#trasanoModalHeader\").append(\"<h4>Estado del servicio...</h4>\");\r\n\r\n $(\"#trasanoModalBody\").append(\r\n \"<div class='form-group'>\" + \r\n \"<label for='message-text' class='control-label'>Seleccione el estado:</label>\" + \r\n \"<select class='form-control' id='statusSelected'>\" + \r\n \"<option value='2' selected>Recogido</option>\" +\r\n \"<option value='3'>Entregado</option>\" + \r\n \"</select>\" +\r\n '</div>');\r\n\r\n\r\n $(\"#trasanoModalFooter\").append(\r\n \"<button type='button' class='btn btn-default' data-dismiss='modal'>CANCELAR</button>\" + \r\n \"<a class='btn btn btn-primary' href='javascript:executeStatus(\" + id + \");' role='button'>ACEPTAR</a>\");\r\n $('#trasanoMODAL').modal('show'); \r\n}","title":""},{"docid":"5d40ec6ccf4e5f3557eba4d2fc6ea417","score":"0.5257272","text":"function abrir_modal(el){\n for (let i = 0; i < diapo.length; i++) {\n if(diapo[i].tema == el){\n sw = true;\n dia_tema = diapo[i];\n diapos = dia_tema.diapositivas;\n break;\n }\n }\n if(!sw){\n abrir_modal_error('Importante...!!!', 'Las diapositivas aun no estan listas para este tema, por favor espera a que se habiliten.<br><br> Muchas gracias :)')\n }else{\n modal.style.display = 'grid';\n validar_contenido(diapos[j]);\n }\n}","title":""},{"docid":"ed121c3a38ab4d0a9f28d6f8ced7d046","score":"0.5257223","text":"function setObjectiveModalContent(id, title, text, date, status, type){\n if (type == 2){\n $('#proposedTo').html(proposedToHTML());\n \t//Get email list and initialise tags input\n tags(\"proposed-obj-to\", emails);\n keypress('objective-modal');\n }else{\n $('#proposedTo').html(\"\");\n }\n\t$('#obj-modal-title-type').text(modalStatusList[type]);\n\t$(\"#objective-id\").val(id);\n\t$(\"#objective-title\").val(title);\n\t$(\"#objective-text\").val(text);\n\t$(\"#objective-date\").val(date);\n\t$(\"#objective-status\").val(status);\n\t$('#submit-obj').prop(\"disabled\", enableSubmit(type));\n}","title":""},{"docid":"bc9f093e44b430288dd474d4e555160f","score":"0.52565295","text":"createVariableTypeContainer_(types) {\n const selectDiv = document.createElement('select');\n for (let i = 0; i < types.length; i++) {\n const type = types[i];\n const displayName = type[0];\n const typeName = type[1];\n const option = document.createElement('option');\n option.classList.add('input-modal-type');\n option.value = typeName;\n option.innerText = displayName;\n selectDiv.appendChild(option);\n }\n this.firstTypeInput_ = selectDiv.querySelector('.input-modal-type');\n return selectDiv;\n }","title":""},{"docid":"a0708c2afbaa053e9f2510d33d96e00e","score":"0.52534235","text":"function montaModal_listaAtividade(){\n\t$('.modal-trigger').leanModal();\n}","title":""},{"docid":"3b45bcb6a6c183db9444309ac476f062","score":"0.5242974","text":"function showModalDelete() {\n if (registros.status == '1') {\n var status = '0';\n $(\"#Modal-eliminaRegistro-Titulo\").text('Eliminar registro');\n $(\"#Modal-eliminaRegistro-Color\").removeClass(\"w3-blue\").addClass(\"w3-red\");\n } else {\n $(\"#Modal-eliminaRegistro-Color\").removeClass(\"w3-red\").addClass(\"w3-green\");\n $(\"#Modal-eliminaRegistro-Titulo\").text('Activar registro');\n var status = '1';\n }\n $(\"#eliminaID\").val(registros.id);\n $(\"#eliminaStatus\").val(status);\n $(\"#eliminaRegistro\").attr('action', idTablaLista.toLowerCase() + '/elimina');\n $(\"#Modal-eliminaRegistro-Contenido\").text('Clave = ' + registros.id + ' Nombre = ' + registros.nombre);\n $(\"#Modal-eliminaRegistro\").modal(\"show\");\n }","title":""},{"docid":"13ec3106a469c525bd2b20b9a9072726","score":"0.5242618","text":"function modalPoem() {\n // first, we grab the poem and place it in the modal\n getPoem(true, false);\n}","title":""},{"docid":"78c4bde7b4f3fe0cf4dd9e128a7dfd38","score":"0.52400917","text":"function setResponseType() {\r\n let $activeItem = $(\".active\").text()\r\n $activeItem = $activeItem.toLowerCase();\r\n let array = responseTypes[$activeItem];\r\n return array;\r\n}","title":""},{"docid":"1a3ef0a25345732831ca94196cf87a95","score":"0.5235743","text":"function ModalCerrarCondicionReg() {\n if (modalReg === 1) {\n $('#contratoDetallesmodal').modal('show');\n } else {\n $('#detallesContratomodal').modal('show');\n }\n}","title":""},{"docid":"301b3e16b9cb23ffda4c55a3ae1099b7","score":"0.5234133","text":"function makePopUp(type, name) {\n\t$('#add-or-edit-container').html('');\n\t$('.obscure').fadeIn(300);\n\t$('.obscure').css('display', 'block');\n\tif (type == 'manageFilters') {\n\t\tmanageFilters();\n\t} else if (type == 'help') {\n\t\tdisplayHelp();\n\t} else if (type == 'reset') {\n\t\tresetData();\n\t} else if (type == 'add') {\n\t\taddingItem(name);\n\t} else {\n\t\taddNewMenu(type);\n\t}\n}","title":""},{"docid":"f08f2c550697424a8b0cf64e9850036c","score":"0.5215823","text":"function abrir_modal_apuestapuestocompra(id) {\n var metodo = \"modal_clientes_apuestapuestocompra\";\n var montoval = DN($('#idmontolista').val());\n var mtoval = parseFloat(montoval);\n $('#botonera').html(\"\");\n if (mtoval == '' || mtoval == ',') {\n $(\"#botonera\").html(\"<div id='botcan' class='modalb' onclick='ocultarmodal(\" + \"'\" + metodo + \"');'>Cancelar</div>\");\n $(\"#mycontenido\").html('El monto es requerido!!11');\n $('#modal_clientes_apuestapuestocompra').show();\n return false;\n }\n\n if ((mtoval <= 0) || ($('#idmontolista').val() == \"\")) {\n $(\"#botonera\").html(\"<div id='botcan' class='modalb' onclick='ocultarmodal(\" + \"'\" + metodo + \"');'>Cancelar</div>\");\n $(\"#mycontenido\").html('El monto es requerido!!');\n $('#modal_clientes_apuestapuestocompra').show();\n return false;\n }\n\n if ((mtoval <= 0)) {\n $(\"#botonera\").html(\"<div id='botcan' class='modalb' onclick='ocultarmodal(\" + \"'\" + metodo + \"');'>Cancelar</div>\");\n $(\"#mycontenido\").html('El monto debe ser mayor que 0!!');\n $('#modal_clientes_apuestapuestocompra').show();\n return false;\n }\n\n if (solounacoma($('#idmontolista').val()) > 1 || $('#idmontolista').val() == \"'\") {\n $(\"#botonera\").html(\"<div id='botcan' class='modalb' onclick='ocultarmodal(\" + \"'\" + metodo + \"');'>Cancelar</div>\");\n $(\"#mycontenido\").html('El formato del monto es inavlido!!');\n $('#modal_clientes_apuestapuestocompra').show();\n return false;\n }\n // alert($('#idafavor').val());\n var base = $('#idproporcionapuesta').val();\n var myArray = base.split('#');\n var pagopan = myArray[1];\n var ganopan = myArray[2];\n if ($('#idafavor').val() == 'C') {\n pagopan = myArray[2];\n ganopan = myArray[1];\n }\n var megan0 = (mtoval * ganopan) / pagopan;\n var comi = (megan0 * $('#idcomision').val()) / 100;\n megan0 = megan0 - (megan0 * $('#idcomision').val()) / 100;\n $(\"#mycontenido\").html('Apuesto BS: ' + $('#idmontolista').val() + ' Para Ganar BS: ' + FN(megan0));\n $(\"#botonera\").html(`\n <div style=\"float: right;\">\n <div id='botok' class='modalb' onclick='comprar_puestolista(` + $('#idevento0').val() + `);'>Confirmar Apuesta</div>\n <div id='botcan' class='modalb' onclick='ocultarmodal(` + `'` + metodo + `');'>Cancelar</div>\n </div>`);\n\n try {\n bonsal = $('#idsaldobono1 span').html().replace('.', \"\");\n bonsal = bonsal.replace(',', \".\");\n if (bonsal > 0) {\n $(\"#botonera\").prepend(`\n <div style=\"float: left; padding: 3px;\">\n <input type=\"checkbox\" value='false' id=\"cbox2\" style=\"cursor: initial; display: inline-block;\"><label for=\"cbox2\">Utilizar Bono</label>\n </div>\n `);\n }\n } catch (error) { console.log('e') }\n\n $('#modal_clientes_apuestapuestocompra').show();\n}","title":""},{"docid":"8ab58173bd2f4c029587de8c69362394","score":"0.52128595","text":"function dialogSelect(e) {\n var value1 = e.selectedValue1;\n var value2 = e.selectedValue2;\n switch (gTrans.authorize.selectionType) {\n case 1: // Loai giao dich\n var element = document.getElementById(\"id.trans-type\");\n element.value = value1;\n gTrans.authorize.transType = value2;\n break;\n case 2: // Nguoi lap\n var element = document.getElementById(\"id.maker\");\n element.value = value1;\n gTrans.authorize.makerId = value1;\n break;\n case 3: // Trang thai\n var element = document.getElementById(\"id.status\");\n element.value = value1;\n gTrans.authorize.transStatus = value2;\n break;\n default:\n break;\n }\n}","title":""},{"docid":"245cc752eb876215c7c72907ec0d6716","score":"0.5210999","text":"get modalClass() {\n return `slds-modal ${this.isModalOpen ? \"slds-fade-in-open\" : \"\"}`;\n }","title":""},{"docid":"e5518c53cc4bf316656d33fd4a76b1dc","score":"0.52100825","text":"saveModal()\n {\n this.columns=this.selectedFields;\n this.values=this.defaultValues;\n this.isModalOpen=false;\n }","title":""},{"docid":"9be2b0928bbc44ad8ca9202fb792caa8","score":"0.52092606","text":"function modalChangeElement(modalVar, buttonVar, spanVar, pVar) { //funzione che prende in pasto 4 variabili:\n //modalVar= id del modal che si dovrà aprire\n //buttonVar= id del pulsante che aprirà il modal\n //spanVar= classe dello span contenente la X per la chiusura del modal\n //pVar= la classe del p da selezionare\n buttonVar.onclick = function() { // Quando l'utente clicca sul pulsante\n modalVar.style.display = \"block\"; // si apre il modal\n }\n spanVar.onclick = function() { // Quando l'utente clicca sulla X\n modalVar.style.display = \"none\"; // si chiude il modal\n }\n window.onclick = function(event) { //OPZIONALE: Quando l'utente clicca su qualsiasi punto al di fuori del modal\n if (event.target == modalVar) { //Il modal si chiude\n modalVar.style.display = \"none\";\n }\n }\n $(pVar).on('click', function(){ //Quando l'utente clicca su un p all'interno del modal\n var current = $(this).text(); //prendo il contenuto del p cliccato\n $(buttonVar).text(current); // lo vado a sostituire nella navbar\n modalVar.style.display = \"none\"; // si chiude il modal\n });\n}","title":""},{"docid":"1af7acf12dce7567101521ce31282818","score":"0.5179819","text":"static getItemTypes() {\n\n if (_itemTypes == null) {\n _itemTypes = {\n\n // Action types.\n Shortcut: actions.Shortcut.action,\n InsertText: actions.InsertText.action,\n Command: actions.Command.action,\n Uri: actions.Uri.action,\n File: actions.File.action,\n DBusSignal: actions.DBusSignal.action,\n\n // Menu types.\n CustomMenu: menus.CustomMenu.menu,\n Devices: menus.Devices.menu,\n Bookmarks: menus.Bookmarks.menu,\n System: menus.System.menu,\n Favorites: menus.Favorites.menu,\n FrequentlyUsed: menus.FrequentlyUsed.menu,\n RecentFiles: menus.RecentFiles.menu,\n RunningApps: menus.RunningApps.menu,\n };\n\n // This is only possible if the GMenu typelib is installed on the system.\n if (GMenu) {\n _itemTypes.MainMenu = menus.MainMenu.menu;\n }\n }\n\n return _itemTypes;\n }","title":""},{"docid":"670d439889a6bdabd7197858c0002aaf","score":"0.51734054","text":"function viewMsgModal(modalType,Msg,confirm,cancel,functionName) {\n\n if (modalType == \"warning-modal\") {\n $('#msg-modal').removeClass(\"success-modal\");\n $('#msg-modal').removeClass(\"danger-modal\");\n $('#msg-modal').addClass(\"warning-modal\");\n\n $(\"#msg-modal .modal-icon span\").removeAttr(\"class\");\n $(\"#msg-modal .modal-icon span\").addClass(\"fa fa-exclamation\");\n\n }\n else if (modalType == \"danger-modal\") {\n $('#msg-modal').removeClass(\"success-modal\");\n $('#msg-modal').removeClass(\"warning-modal\");\n $('#msg-modal').addClass(\"danger-modal\");\n\n $(\"#msg-modal .modal-icon span\").removeAttr(\"class\");\n $(\"#msg-modal .modal-icon span\").addClass(\"fa fa-times\");\n }\n else if (modalType == \"success-modal\") {\n $('#msg-modal').removeClass(\"danger-modal\");\n $('#msg-modal').removeClass(\"warning-modal\");\n $('#msg-modal').addClass(\"success-modal\");\n\n $(\"#msg-modal .modal-icon span\").removeAttr(\"class\");\n $(\"#msg-modal .modal-icon span\").addClass(\"fa fa-check\"); \n }\n\n $(\"#msg-modal .msg h5\").empty();\n $(\"#msg-modal .msg h5\").html(Msg);\n\n if (confirm == 'true') {\n $(\"#ConfirmationBtn\").css(\"display\", \"block\");\n }\n if (cancel == 'true') {\n $(\"#CancelBtn\").css(\"display\", \"block\");\n }\n $(\"#msg-modal .closeBtn\").attr(\"onclick\", functionName);\n $('#msg-modal').modal({\n show: true,\n keyboard: false,\n backdrop: 'static'\n });\n }","title":""},{"docid":"bd06d19eeb3d0b3bfffd9bcde0fb07f1","score":"0.51640826","text":"function exibir(tipo, dados) {\n switch (tipo) {\n case 'cliente':\n $('#input-nome-modal').val(dados.razao_social).toUpperCase();\n $('#input-sigla-modal').val(dados.sigla).toUpperCase();\n dados.status === 's' ? $('#input-active-modal').click() : $('#input-inactive-modal').click();\n break;\n\n case 'tema':\n $('#input-tema-modal').val(dados.tema);\n dados.status === 's' ? $('#input-active-modal').click() : $('#input-inactive-modal').click();\n break;\n\n case 'planta':\n $('#input-planta-modal').val(dados.planta);\n dados.status === 's' ? $('#input-active-modal').click() : $('#input-inactive-modal').click();\n break; \n\n case 'email':\n $('#input-server').val(dados.servidor);\n $('#input-port').val(dados.porta);\n dados.ssl == 's' ? $('#input-ssl').attr('checked', true) : $('#input-ssl').attr('checked', false);\n $('#input-user-smtp').val(dados.usuario_smpp);\n break;\n\n case 'departamento':\n $('#departamento-nome').val(dados.nome);\n dados.status === 's' ? $('#input-active-modal').click() : $('#input-inactive-modal').click();\n dados.pergunta_aprovacao === 's' ? $('#pergunta-aprovacao').attr('checked', true) : $('#pergunta-aprovacao').attr('checked', false);\n break;\n\n case 'usuario':\n listarMenu(dados);\n listarDepartamentos();\n listarAcesso();\n break;\n default:\n break;\n }\n}","title":""},{"docid":"cc0d25569a56661a1e3ef9e4564c003c","score":"0.5162959","text":"function chooseTransType() {\n gTrans.authorize.selectionType = 1;\n var typeValues = (gUserInfo.lang == 'EN') ? CONST_TRANS_BATCH_TRANS_TYPE_EN :\n CONST_TRANS_BATCH_TRANS_TYPE_VN;\n var typeKeys = CONST_TRANS_BATCH_TRANS_TYPE;\n dialogInit();\n showDialogList(CONST_STR.get('COM_CHOOSEN_TYPE_TRANS'), typeValues, typeKeys, false);\n}","title":""},{"docid":"5551f2163dc93c519ac4b6d113b9ad5d","score":"0.51542616","text":"function promptMSG(type, messages, title, btn_type, set_delay, addClassOpen, callBackYes) {\n var prompt_delay = (set_delay === true ? true : false);\n var addClassModalOpen = ((addClassOpen === true || addClassOpen === null) ? true : false);\n var msg, titleh = '';\n var modal_type = \"mif-modal-warning\";\n var result;\n var button_type = function (btn_type) {\n if (btn_type == 'yn') {\n return '<button type=\"button\" class=\"btn btn-sm btn-danger btn-yes\" >Yes</button> <button type=\"button\" class=\"btn btn-sm btn-primary\" data-dismiss=\"modal\">No</button>';\n } else {\n return '<button type=\"button\" class=\"btn btn-xs btn-danger\" data-dismiss=\"modal\">Close</button>';\n }\n };\n\n if (type == \"warning\") {\n msg = \"<strong>Warning!</strong> \" + messages;\n titleh = \"<i class='fa fa-warning'></i>\";\n }\n if (type == \"danger\") {\n msg = \"<strong>Authentication failed!</strong></br>Please Reload or Relogin your account.\";\n titleh = \"<i class='glyphicon glyphicon-fire'></i>\";\n modal_type = \"mif-modal-danger\";\n }\n if (type == \"success-add\") {\n msg = messages + \" Has Been Successfuly Added.\";\n titleh = \"<i class='glyphicon glyphicon-check'></i>\";\n modal_type = \"mif-modal-success\";\n }\n if (type == \"success-retrieve\") {\n msg = messages + \" Has Been Successfully Moved to </br><strong>Current page</strong>.\";\n titleh = \"<i class='glyphicon glyphicon-check'></i>\";\n modal_type = \"mif-modal-success\";\n }\n if (type == \"success-update\") {\n msg = messages + \" Has Been Successfuly Updated.\";\n titleh = \"<i class='glyphicon glyphicon-check'></i>\";\n modal_type = \"mif-modal-success\";\n }\n if (type == \"remove\") {\n msg = messages + \" Has Been Moved to <strong>Archive page</strong>.\";\n titleh = \"<i class='glyphicon glyphicon-fire'></i>\";\n modal_type = \"mif-modal-danger\";\n }\n if (type == \"success-custom\") {\n msg = messages;\n titleh = \"<i class='glyphicon glyphicon-check'></i>\";\n modal_type = \"mif-modal-success\";\n }\n if (type == \"custom\") {\n msg = messages;\n titleh = title;\n }\n\n var template = '<div class=\"modal fade mif-modalPromptMSG ' + modal_type + '\" id=\"modalPromptMSG\" data-backdrop=\"static\" data-keyboard=\"true\" tabindex=\"-1\" role=\"dialog\" aria-labelledby=\"modaPromptMSG\">' +\n '<div class=\"modal-dialog\" role=\"document\"> ' +\n '<div class=\"modal-content\">' +\n '<div class=\"modal-header\">' +\n '<button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">×</span></button>' +\n '<div class=\"modal-title\" id=\"modaPromptMSG\">' + titleh + '</div>' +\n '</div>' +\n '<div class=\"modal-body text-center\">' + msg +\n '</div>' +\n '<div class=\"modal-footer text-center\">' + button_type(btn_type) +\n '</div>' +\n '</div>' +\n '</div>' +\n '</div>';\n\n $(\".displayPromptMSG\").html(template);\n\n var delayPrompt = (function () {\n var timer = 0;\n return function () {\n window.clearTimeout(timer);\n timer = window.setTimeout(function () { $(\"#modalPromptMSG\").modal('hide'); }, 5000);\n };\n })();\n\n if ($(\".displayPromptMSG\").children() != '') {\n $(\"#modalPromptMSG\").modal('show');\n\n if (prompt_delay === true) {\n delayPrompt();\n }\n if (addClassModalOpen === true) {\n $(\"#modalPromptMSG\").on('hidden.bs.modal', function () { // For tuning, must check if the last modal active.\n $(\"body\").addClass('modal-open');\n });\n }\n\n }\n //Callback function if Yes button is clicked.\n if (btn_type == 'yn' && btn_type != undefined && btn_type != null && btn_type != '') {\n $(\".btn-yes\").click(function (e) {\n e.preventDefault();\n callBackYes();\n });\n }\n\n return $(template);\n}","title":""},{"docid":"d743d3b00728368c81728500203be775","score":"0.5147503","text":"function getipo(tipo){\n\t//console.log(tipo);\n\treloadtable(tipo);//reload na tabela com as mensagens da nova linguagem pedida\n}","title":""},{"docid":"ba19c6f440e1b7922b074d0089a317f6","score":"0.51473045","text":"function abrir_modal_apuestaproposimple(idevento, idelementoa, idelementob, vidclase, comision, descriplugar) {\n\n var metodo = \"modal_comprarpropuesta_simple\";\n\n if ($('#iddoy').val() == '') {\n // $(\"#botonera\").html(\"<div id='botcan' class='modalb' onclick='ocultarmodal(\" + \"'\" + metodo + \"');'>Cancelar</div>\");\n // $(\"#mycontenido\").html('Debe asignar la cantidad de puntos que da!!');\n // $('#modal_comprarpropuesta_simple').show();\n // return false;\n $('#iddoy').val(0);\n }\n\n if ($('#iddoy').val() == ',' || $('#iddoy').val() == \"'\") {\n $(\"#botonera\").html(\"<div id='botcan' class='modalb' onclick='ocultarmodal(\" + \"'\" + metodo + \"');'>Cancelar</div>\");\n $(\"#mycontenido\").html('La formato de los puntos dados es inavlido!!');\n $('#modal_comprarpropuesta_simple').show();\n return false;\n }\n\n if ($('#idmonto').val() == '' || $('#idmonto').val() == ',') {\n $(\"#botonera\").html(\"<div id='botcan' class='modalb' onclick='ocultarmodal(\" + \"'\" + metodo + \"');'>Cancelar</div>\");\n $(\"#mycontenido\").html('El monto es requerido!!');\n $('#modal_comprarpropuesta_simple').show();\n return false;\n }\n\n if (solounacoma($('#idmonto').val()) > 1 || $('#idmonto').val() == \"'\") {\n $(\"#botonera\").html(\"<div id='botcan' class='modalb' onclick='ocultarmodal(\" + \"'\" + metodo + \"');'>Cancelar</div>\");\n $(\"#mycontenido\").html('El formato del monto es inavlido!!');\n $('#modal_comprarpropuesta_simple').show();\n return false;\n }\n\n if (DN($(\"#idmonto\").val()) == 0) {\n $(\"#botonera\").html(\"<div id='botcan' class='modalb' onclick='ocultarmodal(\" + \"'\" + metodo + \"');'>Cancelar</div>\");\n $(\"#mycontenido\").html('El monto Apostar es requerido!!');\n $('#modal_comprarpropuesta_simple').show();\n return false;\n }\n\n var x = DN($(\"#idmonto\").val());\n // var vganar = DN($(\"#idmonto\").val()) - ((DN($(\"#idmonto\").val()) * comision) / 100);\n //----------------\n var base = $('#proporcion').val();\n var myArray = base.split('#');\n var pagopan = myArray[0];\n var ganopan = myArray[1];\n var megan0 = (DN($(\"#idmonto\").val()) * ganopan) / pagopan;\n\n var comi = (megan0 * comision) / 100;\n megan0 = megan0 - (megan0 * comision) / 100;\n //------------\n var vganar = megan0;\n $('#botonera').html(\"\");\n $(\"#botonera\").html(\"<div id='botok' class='modalb' onclick='ir_compraproposicionsimple(\" + idevento + \",\" + idelementoa + \",\" + idelementob + \",\" + vidclase + \");'>Confirmar Apuesta</div><div id='botcan' class='modalb' onclick='ocultarmodal(\" + \"'\" + metodo + \"');'>Cancelar</div>\");\n\n try {\n bonsal = $('#idsaldobono1 span').html().replace('.', \"\");\n bonsal = bonsal.replace(',', \".\");\n if (bonsal > 0) {\n $(\"#botonera\").prepend(`\n <div style=\"float: left; padding: 3px;\">\n <input type=\"checkbox\" value='false' id=\"cbox2\" style=\"cursor: initial; display: inline-block;\"><label for=\"cbox2\">Utilizar Bono</label>\n </div>\n `);\n }\n } catch (error) { console.log('e') }\n\n $(\"#mycontenido\").html('<p>Su apuesta es de Bs: ' + $(\"#idmonto\").val() + \" Para Ganar Bs: \" + FN(vganar) + '<p>');\n $('#modal_comprarpropuesta_simple').show();\n}","title":""},{"docid":"b12edf63595d072b33300639626ca741","score":"0.5129792","text":"function openModal() {\n\t//inicializar el modal que sea nuevo rol\n\tdocument.querySelector('#idRol').value = '';//limpiar el value del input hiden del modal\n\tdocument.querySelector('#titleModal').innerHTML = 'Nuevo Rol';\n\tdocument.querySelector('.modal-header').classList.replace('headerUpdate', 'headerRegistrer');\n\tdocument.querySelector('#btnActionForm').classList.replace('btn-info', 'btn-primary');\n\tdocument.querySelector('#btnText').innerHTML = 'Guardar';\n\tdocument.querySelector('#formRol').reset();\n\t$(\"#modalRol\").modal(\"show\");\n}","title":""},{"docid":"78f38a44728174716a7d526709fa320e","score":"0.5124426","text":"function OpenModal() {\n\n limpiar();\n cambiar_color_obtener();\n $(\".modal-title\").text(\"Registrar Categoria\");\n $('#modal-categoria').modal('show');\n}","title":""},{"docid":"f713e8d82a954d5924a5352fa6866099","score":"0.5124421","text":"onConfirmModal(registro) {\n if (!registro) {\n return;\n }\n this.onChange({\n target: {\n value: registro[this.props.chave],\n },\n });\n }","title":""},{"docid":"92c19f434f9885d16b8d874fe79ad267","score":"0.512287","text":"presentProfSearchModal(select) {\n return Object(tslib__WEBPACK_IMPORTED_MODULE_0__[\"__awaiter\"])(this, void 0, void 0, function* () {\n const modal = yield this.modalController.create({\n component: src_app_pages_components_search_modal_search_modal_component__WEBPACK_IMPORTED_MODULE_6__[\"SearchModalComponent\"],\n componentProps: {\n options: this.getProfs().map((prof) => {\n return {\n label: prof.label,\n value: prof.valore\n };\n }),\n title: 'Seleziona'\n },\n cssClass: 'app-modal'\n });\n modal.onWillDismiss().then((modal) => {\n if (modal.data) {\n const value = modal.data;\n const index = this.getProfs().findIndex((prof) => prof.valore === value);\n select.value = {\n index: index,\n value: value\n };\n }\n });\n yield modal.present();\n });\n }","title":""},{"docid":"070ceebc9bd012a9e239cb1dfb915fbc","score":"0.51167715","text":"changeStatus () {\n Actions.selectStatus()\n this.toggleModal()\n }","title":""},{"docid":"bce60ffe29872a4e1f30cb35a237e0e9","score":"0.5115488","text":"function click(d) {\n\n if (curModal == \"echo\") {\n var modal = document.getElementById(\"myModalECHO\");\n modal.style.display = \"block\"; //change display to block so that it appears\n\n var span = document.getElementById(\"closeECHO\");\n span.onclick = function() {\n var modal = document.getElementById(\"myModalECHO\");\n modal.style.display = \"none\"; //change display to none when X is clicked\n }\n }\n\n if (curModal == \"bulb\") {\n var modal = document.getElementById(\"myModalBULB\");\n modal.style.display = \"block\"; //change display to block so that it appears\n\n var span = document.getElementById(\"closeBULB\");\n span.onclick = function() {\n var modal = document.getElementById(\"myModalBULB\");\n modal.style.display = \"none\"; //change display to none when X is clicked\n }\n }\n\n if (curModal == \"roomba\") {\n var modal = document.getElementById(\"myModalROOMBA\");\n modal.style.display = \"block\"; //change display to block so that it appears\n\n var span = document.getElementById(\"closeROOMBA\");\n span.onclick = function() {\n var modal = document.getElementById(\"myModalROOMBA\");\n modal.style.display = \"none\"; //change display to none when X is clicked\n }\n }\n\n if (curModal == \"nest\") {\n var modal = document.getElementById(\"myModalNEST\");\n modal.style.display = \"block\"; //change display to block so that it appears\n\n var span = document.getElementById(\"closeNEST\");\n span.onclick = function() {\n var modal = document.getElementById(\"myModalNEST\");\n modal.style.display = \"none\"; //change display to none when X is clicked\n }\n }\n\n if (curModal == \"security\") {\n var modal = document.getElementById(\"myModalSECURITY\");\n modal.style.display = \"block\"; //change display to block so that it appears\n\n var span = document.getElementById(\"closeSECURITY\");\n span.onclick = function() {\n var modal = document.getElementById(\"myModalSECURITY\");\n modal.style.display = \"none\"; //change display to none when X is clicked\n }\n }\n}","title":""},{"docid":"f83288113b042bf7d71897b5e57f9ad0","score":"0.51129085","text":"tipoMapa(){\n\t\treturn(\n\t\t\t<View style={CreatePlanStyle.tipoPlan}>\n\t\t\t\t<TouchableOpacity onPress={() => this.setState({tipoPlan:false, publico:true})} style={CreatePlanStyle.btnModal}> \n\t \t\t\t<Text style={CreatePlanStyle.textModal}>CREAR PLAN PÚBLICO</Text>\n\t\t\t\t</TouchableOpacity>\t\n\t\t\t\t<TouchableOpacity onPress={() => this.setState({tipoPlan:false, publico:false})} style={CreatePlanStyle.btnModal}> \n\t \t\t\t<Text style={CreatePlanStyle.textModal}>CREAR PLAN PRIVADO</Text>\n\t\t\t\t</TouchableOpacity>\t\n\t\t\t</View>\n\t\t)\n\t}","title":""},{"docid":"e29ca9241783b7aff911583004a835e2","score":"0.51097465","text":"function SetMovmentType(type : int)\n{\n\tmovmentType = type;\n}","title":""},{"docid":"8405d38cc5aef5822a84913174de7c1a","score":"0.509172","text":"static get CONT_TYPES() {\n return {\n JSON : \"application/json\",\n FORM_DATA : \"multipart/form-data\",\n OCT_STREAM : \"application/octet-stream\"\n }\n }","title":""},{"docid":"a34eb0acaea084785146f96fbdd5302f","score":"0.5089995","text":"closeModal()\n {\n this.edit=false;\n this.isModalOpen=false;\n this.isMore=false;\n this.newRecord=false;\n }","title":""},{"docid":"8acdd39c694670cf794f8791c4324df1","score":"0.50889885","text":"function hideLyricsOrVideoModal(type) {\n if (type === 'lyrics') {\n var className = 'lyrics';\n } else {\n var className = 'player';\n }\n\n document.querySelector('.'+className+'-container .modal-inner-container').classList.remove('out');\n\n setTimeout(function() {\n document.querySelector('.'+className+'-container').classList.add('hidden');\n }, 150);\n }","title":""},{"docid":"457c9bafaae7fed57b7ed864d7fba226","score":"0.5078138","text":"function MasInformacionProveedor(idconsecutivo,posicion) {\n\n document.getElementById('DetalleModalProveedortitle').innerHTML = 'Contacto de la Orden ' + datosordenproveedor[posicion].Codigo_Solicitud_Ciklos + ' - ' + idconsecutivo;\n\n document.getElementById('lblpacientePro').innerHTML = datosordenproveedor[posicion].Id_Afiliado;\n document.getElementById('lblpacientenombre').innerHTML = datosordenproveedor[posicion].NombreCompleto;\n document.getElementById('lblcontacto').innerHTML = datosordenproveedor[posicion].Contacto;\n document.getElementById('lblestado').innerHTML = datosordenproveedor[posicion].EstadoProveedor;\n document.getElementById('lblobgene').innerHTML = datosordenproveedor[posicion].ObservacionesGen;\n document.getElementById('lblfechaciklos').innerHTML = datosordenproveedor[posicion].Fecha_Registro_Solicitud\n document.getElementById('lblprofesionalsol').innerHTML = datosordenproveedor[posicion].ProfesionalSolicita;\n document.getElementById('lbldetalleciklos').innerHTML = datosordenproveedor[posicion].Descripcion;\n //document.getElementById('lblobaud').innerHTML = datosordenproveedor[posicion].ObservacionesAud; \n\n $(\"#DetalleModalProveedor\").modal();\n }","title":""},{"docid":"316113f21ad55326a66e263c3b511d7f","score":"0.507803","text":"selectIcon(type){\n const inputs = this.state.inputs;\n this.setState({ inputs: { ...inputs, icon: type } });\n this.closeModal();\n }","title":""},{"docid":"0c49fcad2eef8ce1895b71b46e523050","score":"0.5076032","text":"function levantaPopup(){\n\n\tvar option = { \n\t\t\t\t\ttitle:\"Comprobación de Aprobación\",\n\t\t\t\t\tallowMaximize:false,\n\t\t\t\t\tshowMaximized:false,\n\t\t\t\t\tshowClose:false,\n\t\t\t\t\t//autoSize:true,\n\t\t\t\t\t//width:515,\n\t\t\t\t\twidth:500,\n\t\t\t\t\theight:160,\n\t\t\t\t\tscroll:0,\n\t\t\t\t\targs: {\t\n\t\t\t\t\t\t\testado:'VI'\t\n\t\t\t\t\t\t },\n\n\t\t\t\t\t//center:1,resizable:1,scroll:0,status:0,maximize:1,minimize:1,\n\t\t\t\t\tdialogReturnValueCallback: callbackMethod,\n\t\t\t\t\turl:urlPantallaComprobacion+'?ID='+iniciativaID\n\t\t\t\t};\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tSP.UI.ModalDialog.showModalDialog(option);\n}","title":""},{"docid":"83a90e4c42631c4f6de471f35f573418","score":"0.5074421","text":"function goUpdateFindTypeMenuItems() {\n goUpdateCommand(\"cmd_findTypeText\");\n goUpdateCommand(\"cmd_findTypeLinks\");\n}","title":""},{"docid":"2c4698a671f2baa0b74d38c74ca0dbf4","score":"0.5072567","text":"function afterClickReturnSelectBox(){\r\n var typeName = document.getElementById(\"returnType\").value;\r\n if(typeName==\"void\" || typeName==\"Double\" || typeName==\"Byte\" || typeName==\"Float\" || typeName==\"Boolean\" || typeName==\"Character\" || typeName==\"Integer\" || typeName==\"Short\" || typeName==\"Long\" || typeName==\"String\" || typeName==\"double\" || typeName==\"byte\" || typeName==\"float\" || typeName==\"boolean\" || typeName==\"char\" || typeName==\"int\" || typeName==\"short\" || typeName==\"long\"){\r\n return;\r\n }else if(typeName==\"list\"){ \r\n showWin();\r\n }else if(typeName==\"map\"){\r\n showWinMAP();\r\n }else if(typeName==\"stack\"){\r\n showWinStack();\r\n }else if(typeName==\"array\"){\r\n showWinArray();\r\n }\r\n}","title":""},{"docid":"d9605689b30fbc9fcd514304313b7740","score":"0.5072523","text":"openCloseModal() {\n if (this.carrello.length < 1 && !this.toggleModal) {\n alert('Attenzione! Carrello vuoto!')\n\n } else {\n this.toggleModal = !this.toggleModal\n }\n\n }","title":""},{"docid":"638298edacd8b054325e3daeb36d18f0","score":"0.5072007","text":"function open_asset(type)\n{\n hide_assets_menu();\n show('assets_modal_back');\n var asset_input = document.getElementsByClassName(type);\n for (var i = 0; i < asset_input.length; i++)\n {\n asset_input[i].style.display = \"block\";\n }\n return;\n}","title":""},{"docid":"ee5a27c0c3a0b70a3e9df6f04b7c84aa","score":"0.5071376","text":"function sendMails( type )\n\t\t{\n\t\t\tvar modalInstance = $uibModal.open( {\n\t\t\t\ttemplateUrl: '/modules/auction/client/views/mail.client.modal.html'\n\t\t\t\t,controller: 'SendEmailsClientController'\n\t\t\t\t,controllerAs: 'vm'\n\t\t\t\t,resolve: {\n\t\t\t\t\tmailObj: function(){\n\t\t\t\t\t\tvar obj = {\n\t\t\t\t\t\t\tproject_id: vm.auction.project_id\n\t\t\t\t\t\t\t,message: ''\n\t\t\t\t\t\t\t,subject: ''\n\t\t\t\t\t\t\t,dialogTitle: 'Send emails'\n\t\t\t\t\t\t};\n\t\t\t\t\t\tswitch( type ){\n\t\t\t\t\t\t\tcase 2:\n\t\t\t\t\t\t\t\tobj.dialogTitle = 'Pause of Auction Emails';\n\t\t\t\t\t\t\t\tobj.subject = 'Pausing auction';\n\t\t\t\t\t\t\t\tobj.message = 'Auction of ' + vm.auction.project.project_name + ' was paused';\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 3:\n\t\t\t\t\t\t\t\tobj.dialogTitle = 'Resume of Auction Emails';\n\t\t\t\t\t\t\t\tobj.subject = 'Resuming auction';\n\t\t\t\t\t\t\t\tobj.message = 'Auction of ' + vm.auction.project.project_name + ' was resumed';\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 4:\n\t\t\t\t\t\t\t\tobj.dialogTitle = 'Auction Cancel Emails';\n\t\t\t\t\t\t\t\tobj.subject = 'Cancelling auction';\n\t\t\t\t\t\t\t\tobj.message = 'Auction of ' + vm.auction.project.project_name + ' was cancelled!';\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn obj;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} );\n\t\t}","title":""},{"docid":"3e379bdfeae6668a239ce6b2f4861aa8","score":"0.5069784","text":"function generateSuccessModal(modalId, footerType, modalButtonId, modalMessage, modalButtonNoId) {\n $('.modal_success_template').attr('id', modalId);\n $('.modal_success_template .modal-content .modal-body p').html(modalMessage);\n\n if (footerType === 1) {\n $('.modal_success_template .modal-content .modal-footer').html('<button type=\"button\" id=\"' + modalButtonId + '\" class=\"btn btn-outline pull-right\" data-dismiss=\"modal\">Yes</button><button type=\"button\" id=\"' + modalButtonNoId + '\" class=\"btn btn-outline pull-right\" data-dismiss=\"modal\"> No</button>');\n $('#' + modalId).modal();\n\n } else if (footerType === 2) {\n $('.modal_success_template .modal-content .modal-footer').html('<button type=\"button\" id=\"\" class=\"btn btn-outline pull-right\" data-dismiss=\"modal\">Ok</button>');\n $('#' + modalId).modal();\n\n }\n}","title":""}],"string":"[\n {\n \"docid\": \"1c573b9bf8f4eb05ce53a042f59b6b70\",\n \"score\": \"0.66466486\",\n \"text\": \"renderTypeAModal() {\\n return (\\n <Modal\\n isOpen={this.state.showTypeAModal}\\n onRequestClose={this.handleCloseTypeAModal}\\n style={customStyles}\\n >\\n <h2>Type A</h2>\\n {/* TODO: */}\\n </Modal>\\n )\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a070fdec1cab0463a44ca62ef5204612\",\n \"score\": \"0.64522815\",\n \"text\": \"renderTypeCModal() {\\n return (\\n <Modal\\n isOpen={this.state.showTypeCModal}\\n onRequestClose={this.handleCloseTypeCModal}\\n style={customStyles}\\n >\\n <h2>Type C</h2>\\n {/* TODO: */}\\n </Modal>\\n )\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d368b1be954a065070eb122a4484ac2\",\n \"score\": \"0.6363318\",\n \"text\": \"function ShowAddMaintenanceTypeModal(type, indexPos) {\\n jQuery.AddEquipmentNamespace.SelectedMasterDataType = type;\\n BindMasterDataInfo();\\n ClearMaintenanceTypeInfo(false);\\n var btnAddMaintType = jQuery.AddEquipmentNamespace.MaintTypePagerData.LoadControlID.replace(\\\"divModelInfo\\\", \\\"btnAddMaintType\\\");\\n jQuery(\\\"#\\\" + btnAddMaintType).text(languageResource.resMsg_Add);\\n if (jQuery(\\\"#iconViewintTypes\\\").hasClass(\\\"fa fa-minus-circle\\\")) {\\n jQuery(\\\"#iconViewintTypes\\\").removeClass(\\\"fa fa-minus-circle\\\");\\n jQuery(\\\"#iconViewintTypes\\\").addClass(\\\"fa fa-plus-circle\\\");\\n }\\n var btnShowAll = \\\"btnShowAll\\\";\\n jQuery(\\\"#\\\" + btnShowAll).addClass('hide');\\n jQuery(\\\"#iconViewMaintTypes\\\").removeClass(\\\"fa fa-minus-circle\\\");\\n jQuery(\\\"#iconViewMaintTypes\\\").addClass(\\\"fa fa-plus-circle\\\");\\n jQuery(\\\"#divMaintTypes\\\").addClass(\\\"hide\\\");\\n jQuery(\\\"#divAddMaintenanceMasterDataModal\\\").modal(\\\"show\\\");\\n //modal focus\\n var modalDivId = jQuery(\\\"#divAddMaintenanceMasterDataModal\\\")\\n modalVisible(modalDivId);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"530468023fbdab9570e89e5f19704ba2\",\n \"score\": \"0.6360183\",\n \"text\": \"openRepoTypeModal() {\\n this.$repoTypeScope = this.$scope.$new();\\n this.$repoTypeScope.packageTypes = this.getPackageType();\\n this.$repoTypeScope.closeModal = () => this.closeModalPackageType();\\n this.$repoTypeScope.modalClose = ()=> this.modalClose();\\n this.$repoTypeScope.selectRepoType = (type)=>this.selectRepoType(type);\\n this.isTypeModalOpen = true;\\n\\n this.repoTypeModal = this.modal.launchModal('repository_type_modal', this.$repoTypeScope)\\n this.repoTypeModal.result.finally(() => this.isTypeModalOpen = false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22d96f459bd392a457ef1d91c33e0cdc\",\n \"score\": \"0.6234978\",\n \"text\": \"getValuesOf(modalType) {\\n const options = {\\n add: {\\n description: Form.descriptionField.value,\\n amount: Form.amountField.value,\\n date: Form.dateField.value,\\n },\\n edit: {\\n id: Form.indexEditField.value,\\n description: Form.descriptionEditField.value,\\n amount: Form.amountEditField.value,\\n date: Form.dateEditField.value,\\n },\\n filter: {\\n initialDate: Form.initialDateFilter.value,\\n finalDate: Form.finalDateFilter.value,\\n transactionTypeFilter: Form.transactionTypeFilter.value,\\n },\\n };\\n\\n return options[modalType];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84d8a6f337108a98ed89dc36dbf55320\",\n \"score\": \"0.6206984\",\n \"text\": \"function isModalTypeOf(testedType)\\n{\\n\\tvar margeAerationPackHauteurMenuBtn = tbInfAbtCtBx['widthHeightMenuBtn'] + tbInfAbtCtBx['margnTopBotMenuBtn'] * 2;\\n\\tvar margeAerationPackLargeurMenuBtn = tbInfAbtCtBx['widthHeightMenuBtn'] + tbInfAbtCtBx['margnLftRgtMenuBtn'] * 2;\\n\\n\\tvar smallHoriSuppMarge = tbInfAbtCtBx['screenWidth'] * 1.03 - tbInfAbtCtBx['screenWidth']; if(smallHoriSuppMarge > 10){smallHoriSuppMarge = 10;}\\n\\tvar bigHoriSuppMarge = tbInfAbtCtBx['screenWidth'] * 1.05 - tbInfAbtCtBx['screenWidth']; if(bigHoriSuppMarge > 20){bigHoriSuppMarge = 20;}\\n\\n\\tvar margeAeration10px = 10;\\n\\n\\tvar hauteurColInfosAbtCity, largeurColInfosAbtCity, hauteurDispo, hauteurDispoAcBtnMenu, largeurDisponible, largeurDisponibleAcBtnMenu ;\\n\\n\\n\\n\\tif(testedType == \\\"completeLandscapeCnttBased\\\")\\n\\t{\\n\\t\\t// si la box du lien \\\"Bordeaux\\\" n'est pas extensible en largeur, ou que le lien Bdx a dû passer sur une 2e ligne par manque de place en largeur\\n\\t\\tif(!isBdxLinkExtensible(false) || parseInt($(\\\".bordeauxLink\\\").offset().top) > (parseInt($(\\\".statusFrontDev\\\").offset().top)+10) )\\n\\t\\t{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tvar neededYSpceByMenuBtn = tbInfAbtCtBx['widthHeightMenuBtn'] + tbInfAbtCtBx['margnTopBotMenuBtn'] * 2;\\n\\n\\t\\t\\tvar tempDisplayProp = $(\\\".wrapperBoxCityMeteoInfo\\\").css(\\\"display\\\");\\n\\t\\t\\tvar tempOpacProp = $(\\\".wrapperBoxCityMeteoInfo\\\").css(\\\"opacity\\\");\\n\\t\\t\\t$(\\\".wrapperBoxCityMeteoInfo\\\").css({\\\"display\\\": \\\"block\\\", \\\"opacity\\\":0});\\n\\t\\t\\tvar bdxCityBoxOffsetTop = parseInt($(\\\".wrapperBoxCityMeteoInfo\\\").offset().top);\\n\\t\\t\\tvar navBdxCityBoxOffsetTop = parseInt($(\\\".btnNavAboutCityBox\\\").offset().top);\\n\\t\\t\\t$(\\\".wrapperBoxCityMeteoInfo\\\").css({\\\"display\\\": tempDisplayProp, \\\"opacity\\\": tempOpacProp});\\n\\n\\t\\t\\t// S'il n'y a pas suffisament de place au-dessus des box About City pour le btn Menu, il doit y avoir assez de place sur la droite !\\n\\t\\t\\tif(bdxCityBoxOffsetTop < neededYSpceByMenuBtn)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// S'il n'y a pas assez de place pour le btn Menu sur la droite...\\n\\t\\t\\t\\tif(!isBdxLinkExtensible(true) || navBdxCityBoxOffsetTop < 30)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//console.log(\\\"|||||||FORMAT||||||| => completeLandscapeCnttBased\\\");\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\t//console.log(\\\"|||||||FORMAT||||||| => completeLandscapeCnttBased\\\");\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\telse if(testedType == \\\"completeLandscapeVwptBased\\\")\\n\\t{\\n\\t\\t/*\\n\\n\\t\\ttbInfAbtCtBx['screenWidth'] = $(window).width();\\n\\ttbInfAbtCtBx['screenHeight'] = $(window).height();\\n\\n\\ttbInfAbtCtBx['widthHeightMenuBtn'] = $(\\\".menuBtn\\\").width();\\n\\ttbInfAbtCtBx['margnLftRgtMenuBtn'] = parseInt($(\\\".menuBtn\\\").css(\\\"right\\\"));\\n\\ttbInfAbtCtBx['margnTopBotMenuBtn'] = parseInt($(\\\".menuBtn\\\").css(\\\"top\\\"));\\n\\n\\n\\n\\tvar tempDisplayProp = $(\\\".wrapperBoxCityMeteoInfo\\\").css(\\\"display\\\");\\n\\tvar tempOpacProp = $(\\\".wrapperBoxCityMeteoInfo\\\").css(\\\"opacity\\\");\\n\\t$(\\\".wrapperBoxCityMeteoInfo\\\").css({\\\"display\\\": \\\"block\\\", \\\"opacity\\\":0});\\n\\n\\ttbInfAbtCtBx['widthWrapBxCitMetInfPartSup'] = parseInt(widthCityTextBox);\\n\\ttbInfAbtCtBx['heightWrapBxCitMetInfPartSup'] = parseInt($(\\\".wrapperBoxCityMeteoInfo\\\").outerHeight()) + parseInt($(\\\".btnNavAboutCityBox\\\").outerHeight()) + parseInt($(\\\".cityTagsList\\\").outerHeight());\\n\\n\\ttbInfAbtCtBx['widthWrapBxCitMetInfPartInf'] = parseInt($(\\\".todayCityBox\\\").outerWidth());\\n\\ttbInfAbtCtBx['heightWrapBxCitMetInfPartInf'] = parseInt($(\\\".bdxByTitle\\\").outerHeight()) + parseInt($(\\\".bdxByTitle\\\").css(\\\"margin-bottom\\\")) + ( (parseInt($(\\\".aboutBdxWebsite\\\").eq(0).outerHeight()) + parseInt($(\\\".aboutBdxWebsite\\\").eq(0).css(\\\"margin-bottom\\\"))) * 4 ) + 20; // il y a 4 liens / avec 20, une marge non récupérable défini via une propriété bottom:-xpx en CSS...\\n\\n\\n\\t\\t\\t*/\\n\\n\\t\\thauteurColInfosAbtCity = tbInfAbtCtBx['heightWrapBxCitMetInfPartSup'] + tbInfAbtCtBx['heightWrapBxCitMetInfPartInf'];\\n\\t\\tlargeurColInfosAbtCity = tbInfAbtCtBx['widthWrapBxCitMetInfPartSup'];\\n\\t\\thauteurDispo = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity - margeAeration10px * 2;\\n\\t\\thauteurDispoAcBtnMenu = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity - margeAerationPackHauteurMenuBtn - margeAerationPackHauteurMenuBtn / 2;\\n\\t\\tlargeurDisponible = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity * 2 - bigHoriSuppMarge * 2 - smallHoriSuppMarge;\\n\\t\\tlargeurDisponibleAcBtnMenu = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity * 2 - margeAerationPackLargeurMenuBtn * 2 - smallHoriSuppMarge;\\n\\t\\t/*\\n\\t\\tconsole.log(\\\" /- hauteurColInfosAbtCity : \\\"+hauteurColInfosAbtCity);\\n\\t\\tconsole.log(\\\" /- largeurColInfosAbtCity : \\\"+largeurColInfosAbtCity);\\n\\t\\tconsole.log(\\\" /- hauteurDispo : \\\"+hauteurDispo);\\n\\t\\tconsole.log(\\\" /- hauteurDispoAcBtnMenu : \\\"+hauteurDispoAcBtnMenu);\\n\\t\\tconsole.log(\\\" /- largeurDisponible : \\\"+largeurDisponible);\\n\\t\\tconsole.log(\\\" /- largeurDisponibleAcBtnMenu : \\\"+largeurDisponibleAcBtnMenu);*/\\n\\n\\n\\t\\tif( hauteurDispo < 0 || largeurDisponible < 0 )\\n\\t\\t{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse if( hauteurDispoAcBtnMenu < 0 && largeurDisponibleAcBtnMenu < 0 )\\n\\t\\t{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\t//console.log(\\\"|||||||FORMAT||||||| => completeLandscapeVwptBased\\\");\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\telse if(testedType == \\\"square\\\")\\n\\t{\\n\\t\\thauteurColInfosAbtCity = tbInfAbtCtBx['heightWrapBxCitMetInfPartSup'];\\n\\t\\tlargeurColInfosAbtCity = tbInfAbtCtBx['widthWrapBxCitMetInfPartSup'] + tbInfAbtCtBx['widthWrapBxCitMetInfPartInf'] + smallHoriSuppMarge;\\n\\t\\thauteurDispo = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity * 2 - margeAeration10px * 2 - smallHoriSuppMarge;\\n\\t\\thauteurDispoAcBtnMenu = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity * 2 - margeAeration10px * 2 - smallHoriSuppMarge - margeAerationPackHauteurMenuBtn - margeAerationPackHauteurMenuBtn / 2;\\n\\t\\tlargeurDisponible = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity - bigHoriSuppMarge * 2;\\n\\t\\tlargeurDisponibleAcBtnMenu = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity - bigHoriSuppMarge * 2 - margeAerationPackLargeurMenuBtn * 2;\\n\\n\\t\\tif( hauteurDispo < 0 || largeurDisponible < 0 )\\n\\t\\t{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse if( hauteurDispoAcBtnMenu < 0 && largeurDisponibleAcBtnMenu < 0 )\\n\\t\\t{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\t//console.log(\\\"|||||||FORMAT||||||| => square\\\");\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\telse if(testedType == \\\"partialLandscape\\\")\\n\\t{\\n\\t\\thauteurColInfosAbtCity = tbInfAbtCtBx['heightWrapBxCitMetInfPartSup'];\\n\\t\\tlargeurColInfosAbtCity = tbInfAbtCtBx['widthWrapBxCitMetInfPartSup'];\\n\\t\\thauteurDispo = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity - margeAeration10px * 2;\\n\\t\\thauteurDispoAcBtnMenu = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity - margeAerationPackHauteurMenuBtn - margeAerationPackHauteurMenuBtn / 2;\\n\\t\\tlargeurDisponible = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity * 2 - bigHoriSuppMarge * 2 - smallHoriSuppMarge;\\n\\t\\tlargeurDisponibleAcBtnMenu = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity * 2 - margeAerationPackLargeurMenuBtn * 2;\\n\\n\\t\\tif( hauteurDispo < 0 || largeurDisponible < 0 )\\n\\t\\t{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse if( hauteurDispoAcBtnMenu < 0 && largeurDisponibleAcBtnMenu < 0 )\\n\\t\\t{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\t//console.log(\\\"|||||||FORMAT||||||| => partialLandscape\\\");\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\t/*else if(testedType == \\\"completePortrait\\\")\\n\\t{\\n\\t}*/\\n\\telse if(testedType == \\\"partialPortrait\\\")\\n\\t{\\n\\t\\thauteurColInfosAbtCity = tbInfAbtCtBx['heightWrapBxCitMetInfPartSup'];\\n\\t\\tlargeurColInfosAbtCity = tbInfAbtCtBx['widthWrapBxCitMetInfPartSup'];\\n\\t\\thauteurDispo = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity * 2 - margeAeration10px * 2 - smallHoriSuppMarge;\\n\\t\\thauteurDispoAcBtnMenu = tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity * 2 - margeAeration10px * 2 - smallHoriSuppMarge - margeAerationPackHauteurMenuBtn - margeAerationPackHauteurMenuBtn / 2;\\n\\t\\tlargeurDisponible = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity - bigHoriSuppMarge * 2;\\n\\t\\tlargeurDisponibleAcBtnMenu = tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity - margeAerationPackLargeurMenuBtn * 2;\\n\\n\\n\\n\\n\\t\\tif( (tbInfAbtCtBx['screenWidth'] - largeurColInfosAbtCity) < 0 )\\n\\t\\t{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse if( (tbInfAbtCtBx['screenHeight'] - hauteurColInfosAbtCity*2 ) < 0 )\\n\\t\\t{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\t//console.log(\\\"|||||||FORMAT||||||| => partialPortrait\\\");\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\telse\\n\\t{\\n\\t\\t//console.log(\\\"|||||||FORMAT||||||| => aucun / bloquage du lien / fermeture de la modal si ouverte\\\");\\n\\t\\treturn false;\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6564c32f84f10cc792f0ef200e104685\",\n \"score\": \"0.61743915\",\n \"text\": \"renderTypeDModal() {\\n return (\\n <Modal\\n isOpen={this.state.showTypeDModal}\\n onRequestClose={this.handleCloseTypeDModal}\\n style={customStyles}\\n >\\n <h2>Type D</h2>\\n {/* TODO: */}\\n </Modal>\\n )\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af8bdef78e4e0ab3be68e31d4dfa5f02\",\n \"score\": \"0.61217654\",\n \"text\": \"renderTypeBModal() {\\n return (\\n <Modal\\n isOpen={this.state.showTypeBModal}\\n onRequestClose={this.handleCloseTypeBModal}\\n style={customStyles}\\n >\\n <h2>Type B</h2>\\n {/* TODO: */}\\n </Modal>\\n )\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c64e67e4cebdec75ba83ac4dcb19e71\",\n \"score\": \"0.60337996\",\n \"text\": \"function ShowAddMaintenanceTypeModal(type, indexPos) {\\n jQuery.TaskGroupInfoNameSpace.SelectedMasterDataType = type;\\n BindMasterDataInfo();\\n ClearMaintenanceTypeInfo();\\n var btnAddMaintType = jQuery.TaskGroupInfoNameSpace.MaintTypePagerData.LoadControlID;\\n jQuery(\\\"#\\\" + btnAddMaintType).text(languageResource.resMsg_Add);\\n if (jQuery(\\\"#iconViewintTypes\\\").hasClass(\\\"fa fa-minus-circle\\\")) {\\n jQuery(\\\"#iconViewintTypes\\\").removeClass(\\\"fa fa-minus-circle\\\");\\n jQuery(\\\"#iconViewintTypes\\\").addClass(\\\"fa fa-plus-circle\\\");\\n }\\n var btnShowAll = \\\"btnShowAll\\\";\\n jQuery(\\\"#\\\" + btnShowAll).addClass('hide');\\n jQuery(\\\"#iconViewMaintTypes\\\").removeClass(\\\"fa fa-minus-circle\\\");\\n jQuery(\\\"#iconViewMaintTypes\\\").addClass(\\\"fa fa-plus-circle\\\");\\n jQuery(\\\"#divMaintTypes\\\").addClass(\\\"hide\\\");\\n jQuery(\\\"#divAddMaintenanceMasterDataModal\\\").modal(\\\"show\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b58b0872c5fc75cdc08793a50e959aa1\",\n \"score\": \"0.6003562\",\n \"text\": \"function Modal(modalType, vars)\\n{\\n // reference\\n\\tthis.body,\\n this.header,\\n this.footer,\\n this.type = modalType,\\n this.vars; if(vars!=null){this.vars = JSON.parse(vars);}\\n\\n // templates\\n this.simplicity_template = ['alert', 'alert-anonymousPrivacy', 'alert-followBadge', 'alert-goldBadge', 'alert-responseBadge', 'delete-comment', 'delete-post'],\\n this.structure_template = ['{\\\"name\\\": \\\"alert\\\", \\\"footer\\\": \\\"<button type=\\\\'button\\\\' class=\\\\'btn btn-default\\\\' data-dismiss=\\\\'modal\\\\'>Close</button>\\\"}',\\n '{\\\"name\\\": \\\"alert-anonymousPrivacy\\\", \\\"header\\\": \\\"User Privacy\\\", \\\"body\\\": \\\"This user has chosen to remain anonymous; we cannot share their profile information.\\\", \\\"footer\\\": \\\"<button type=\\\\'button\\\\' class=\\\\'btn btn-default\\\\' data-dismiss=\\\\'modal\\\\'>Close</button>\\\"}',\\n '{\\\"name\\\": \\\"alert-followBadge\\\", \\\"header\\\": \\\"Badge Info\\\", \\\"body\\\": \\\"You are following this post.\\\", \\\"footer\\\": \\\"<button type=\\\\'button\\\\' class=\\\\'btn btn-default\\\\' data-dismiss=\\\\'modal\\\\'>Close</button>\\\"}',\\n '{\\\"name\\\": \\\"alert-goldBadge\\\", \\\"header\\\": \\\"Badge Info\\\", \\\"body\\\": \\\"This post has been nominated for administration response.\\\", \\\"footer\\\": \\\"<button type=\\\\'button\\\\' class=\\\\'btn btn-default\\\\' data-dismiss=\\\\'modal\\\\'>Close</button>\\\"}',\\n '{\\\"name\\\": \\\"alert-responseBadge\\\", \\\"header\\\": \\\"Badge Info\\\", \\\"body\\\": \\\"There has been an administration response to this post.\\\", \\\"footer\\\": \\\"<button type=\\\\'button\\\\' class=\\\\'btn btn-default\\\\' data-dismiss=\\\\'modal\\\\'>Close</button>\\\"}',\\n '{\\\"name\\\": \\\"department-badge\\\", \\\"footer\\\": \\\"<button type=\\\\'button\\\\' class=\\\\'btn btn-default\\\\' data-dismiss=\\\\'modal\\\\'>Close</button>\\\"}',\\n '{\\\"name\\\": \\\"delete-comment\\\", \\\"header\\\": \\\"Confirm\\\", \\\"body\\\": \\\"Are you sure you want to delete this comment?\\\"}',\\n '{\\\"name\\\": \\\"delete-post\\\", \\\"header\\\": \\\"Confirm\\\", \\\"body\\\": \\\"Are you sure you want to delete this post?\\\"}',\\n '{\\\"name\\\": \\\"photo-popup\\\", \\\"footer\\\": \\\"<button type=\\\\'button\\\\' class=\\\\'btn btn-default\\\\' data-dismiss=\\\\'modal\\\\'>Close</button>\\\"}',\\n '{\\\"name\\\": \\\"share-popup\\\", \\\"header\\\": \\\"Share <span style=\\\\'0px 9px\\\\'>|</span> LionsMatter\\\", \\\"subheader\\\": \\\"Where would you like to share this post?\\\", \\\"footer\\\": \\\"<button type=\\\\'button\\\\' class=\\\\'btn btn-default\\\\' data-dismiss=\\\\'modal\\\\'>Close</button>\\\"}',\\n '{\\\"name\\\": \\\"terms-of-service\\\", \\\"header\\\": \\\"Terms of Service <span style=\\\\'0px 9px\\\\'>|</span> LionsMatter\\\", \\\"subheader\\\": \\\"Rules for using LionsMatter\\\", \\\"footer\\\": \\\"<button type=\\\\'button\\\\' class=\\\\'btn btn-default\\\\' data-dismiss=\\\\'modal\\\\'>Close</button>\\\"}',\\n '{\\\"name\\\": \\\"timeline-update\\\", \\\"header\\\": \\\"Update Timeline\\\"}',\\n '{\\\"name\\\": \\\"vine-popup_display\\\", \\\"footer\\\": \\\"<button type=\\\\'button\\\\' class=\\\\'btn btn-default\\\\' data-dismiss=\\\\'modal\\\\'>Close</button>\\\"}',\\n '{\\\"name\\\": \\\"vine-popup_input\\\", \\\"header\\\": \\\"Vine <span style=\\\\'0px 9px\\\\'>|</span> LionsMatter\\\", \\\"subheader\\\": \\\"Submit a Vine link with your post.\\\", \\\"body\\\": \\\"<div style=\\\\'text-align: center\\\\'><div class=\\\\'form-group\\\\' style=\\\\'margin-top: 10px\\\\'><label class=\\\\'control-label\\\\' style=\\\\'display: none; margin-bottom: 15px\\\\'>Error: Please provide a link to a valid Vine.</label><input id=\\\\'vineModalINPUT\\\\' type=\\\\'text\\\\' class=\\\\'form-control\\\\' style=\\\\'display: inline-block; width: 75%\\\\' placeholder=\\\\'Vine link\\\\'/></div><p style=\\\\'display: inline-block; font-size: 85%; text-align: left; width: 75%\\\\'><strong>Note:</strong> If you intend to post anonymously, you should know that Vine posts will display your account information by default. LionsMatter will not discriminate, however, against throwaway Vine accounts (which are anonymous).</p></div>\\\"}'];\\n\\n \\n\\t// settings\\n this.simplicity = function(){if($.inArray(this.type, this.simplicity_template) == -1){return 'complex';} else{return 'simple';}}\\n\\tthis.isDisplayed = false;\\n\\n\\t// HTML elements\\n\\tthis.HTML_shell = $(\\\"<div class='modal fade' id='modalCustom' tabindex='-1' aria-hidden='true'><div class='modal-dialog'><div class='modal-content'></div></div></div>\\\"),\\n this.HTML_trigger = \\\"<a href='#modalCustom' id='modalCustomButton' data-toggle='modal'></a>\\\",\\n this.HTML_content = function(modalTitle, modalBody, modalFooter){return \\\"<div class='modal-header'><button type='button' class='close' data-dismiss='modal' aria-hidden='true'>×</button>\\\"+ modalTitle +\\\"</div><div class='modal-body'>\\\"+ modalBody +\\\" </div><div class='modal-footer'>\\\"+ modalFooter +\\\"</div>\\\";},\\n this.HTML_header = function(modalHeader){return \\\"<h4 class='modal-title'>\\\"+ modalHeader +\\\"</h4>\\\";},\\n this.HTML_subheader = function(modalSubheader){return \\\"<h5 class='text-muted' style='margin-top: 0px; margin-bottom: 0px'>\\\"+ modalSubheader +\\\"</h5>\\\"};\\n\\n // simple functions\\n this.construct = function()\\n {\\n var template = this.findTemplate();\\n\\n if(this.simplicity()=='complex'){$(this.HTML_shell).addClass('lionsmatter');}\\n if(template.subheader != null){this.header = this.HTML_header(template.header) + ' ' + this.HTML_subheader(template.subheader);}else if(template.header != null){this.header = this.HTML_header(template.header);}else{this.customHeader();}\\n if(template.body != null){this.body = template.body;}else{this.customBody();}\\n if(template.footer != null){this.footer = template.footer;}else{this.customFooter();}\\n\\n $(this.HTML_shell).find('.modal-content').html(this.HTML_content(this.header, this.body, this.footer)).append(this.HTML_trigger);\\n $(this.HTML_shell).on('hidden.bs.modal', function()\\n {\\n this.remove();\\n modal.isDisplayed = false;\\n\\n if(modal.hasOwnProperty('redirect')&& modal.vars['redirect']!=null){window.location = modal.vars['redirect'];}\\n });\\n }\\n this.findTemplate = function()\\n {\\n for(x = 0; x < this.structure_template.length; x++){if(JSON.parse(this.structure_template[x]).name==this.type){return JSON.parse(this.structure_template[x]);}}return 'failure';\\n }\\n}// modal methods\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ae52f5fa55531ebdbc75c1de5f12291\",\n \"score\": \"0.5980192\",\n \"text\": \"function LauchModal(tModal){\\n switch (tModal) {\\n case \\\"registro\\\":\\n modal.style.display = \\\"block\\\";\\n break;\\n \\n case \\\"ig\\\":\\n moig.style.display = \\\"block\\\";\\n break;\\n\\n default:\\n break;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a17437829d88b6f53b21c72e1e45a2e\",\n \"score\": \"0.59617615\",\n \"text\": \"handleOpenTypeCModal() {\\n this.setState({ showTypeCModal: !this.state.showTypeCModal });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b776cd721342439661e82e557ddb234\",\n \"score\": \"0.5906419\",\n \"text\": \"function viewAdvancedModal(modalType) {\\n if (modalType == \\\"warning-modal\\\") {\\n $('#advanced-modal').removeClass(\\\"success-modal\\\");\\n $('#advanced-modal').removeClass(\\\"danger-modal\\\");\\n $('#advanced-modal').addClass(\\\"warning-modal\\\");\\n\\n $(\\\"#advanced-modal .modal-icon span\\\").removeAttr(\\\"class\\\");\\n $(\\\"#advanced-modal .modal-icon span\\\").addClass(\\\"fa fa-exclamation\\\");\\n\\n }\\n else if (modalType == \\\"danger-modal\\\") {\\n $('#advanced-modal').removeClass(\\\"success-modal\\\");\\n $('#advanced-modal').removeClass(\\\"warning-modal\\\");\\n $('#advanced-modal').addClass(\\\"danger-modal\\\");\\n\\n $(\\\"#advanced-modal .modal-icon span\\\").removeAttr(\\\"class\\\");\\n $(\\\"#advanced-modal .modal-icon span\\\").addClass(\\\"fa fa-times\\\");\\n }\\n else if (modalType == \\\"success-modal\\\") {\\n $('#advanced-modal').removeClass(\\\"danger-modal\\\");\\n $('#advanced-modal').removeClass(\\\"warning-modal\\\");\\n $('#advanced-modal').addClass(\\\"success-modal\\\");\\n\\n $(\\\"#advanced-modal .modal-icon span\\\").removeAttr(\\\"class\\\");\\n $(\\\"#advanced-modal .modal-icon span\\\").addClass(\\\"fa fa-check\\\"); \\n }\\n\\n $('#advanced-modal').modal({\\n show: true,\\n keyboard: false,\\n backdrop: 'static'\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f36ab3e99dfc7df8889a4c8b0beedcdb\",\n \"score\": \"0.5892532\",\n \"text\": \"function modalMessages(title, body, type)\\n {\\n \\tif (type !== undefined){\\n \\t\\t$(\\\".modal\\\").removeClass(\\\"modal-success\\\").addClass('modal-'+type);\\n \\t} \\n \\t\\n $(\\\".modal-title\\\").html(title);\\n $(\\\".modal-body\\\").html(body);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a765081b4220aa9f3793a71474fe007\",\n \"score\": \"0.57874775\",\n \"text\": \"function viewModal(modalType,modalSize) {\\n if (modalType == \\\"add-modal\\\") {\\n $('#form-modal').removeClass(\\\"warning-modal\\\");\\n $('#form-modal').removeClass(\\\"danger-modal\\\");\\n $('#form-modal').addClass(\\\"success-modal\\\");\\n }\\n else if (modalType == \\\"edit-modal\\\") {\\n $('#form-modal').removeClass(\\\"success-modal\\\");\\n $('#form-modal').removeClass(\\\"danger-modal\\\");\\n $('#form-modal').addClass(\\\"warning-modal\\\");\\n }\\n else if (modalType == \\\"delete-modal\\\") {\\n $('#form-modal').removeClass(\\\"success-modal\\\");\\n $('#form-modal').removeClass(\\\"warning-modal\\\");\\n $('#form-modal').addClass(\\\"danger-modal\\\");\\n }\\n else if (modalType == \\\"details-modal\\\") {\\n $('#form-modal').removeClass(\\\"success-modal\\\");\\n $('#form-modal').removeClass(\\\"warning-modal\\\");\\n $('#form-modal').removeClass(\\\"danger-modal\\\");\\n }\\n else {\\n alert(\\\"modal Type Undefined !!\\\");\\n }\\n\\n if(modalSize ==\\\"xl\\\"){\\n $('#form-modal').children(\\\".modal-dialog\\\").removeClass(\\\"modal-lg\\\");\\n $('#form-modal').children(\\\".modal-dialog\\\").removeClass(\\\"modal-sm\\\");\\n $('#form-modal').children(\\\".modal-dialog\\\").addClass(\\\"modal-xl\\\");\\n }\\n if(modalSize ==\\\"lg\\\"){\\n $('#form-modal').children(\\\".modal-dialog\\\").removeClass(\\\"modal-xl\\\");\\n $('#form-modal').children(\\\".modal-dialog\\\").removeClass(\\\"modal-sm\\\");\\n $('#form-modal').children(\\\".modal-dialog\\\").addClass(\\\"modal-lg\\\");\\n }\\n if(modalSize ==\\\"md\\\"){\\n $('#form-modal').children(\\\".modal-dialog\\\").removeClass(\\\"modal-xl\\\");\\n $('#form-modal').children(\\\".modal-dialog\\\").removeClass(\\\"modal-lg\\\");\\n $('#form-modal').children(\\\".modal-dialog\\\").removeClass(\\\"modal-sm\\\");\\n }\\n if(modalSize ==\\\"sm\\\"){\\n $('#form-modal').children(\\\".modal-dialog\\\").removeClass(\\\"modal-xl\\\");\\n $('#form-modal').children(\\\".modal-dialog\\\").removeClass(\\\"modal-lg\\\");\\n $('#form-modal').children(\\\".modal-dialog\\\").addClass(\\\"modal-sm\\\");\\n }\\n\\n $('#form-modal').modal({\\n show: true,\\n keyboard: false,\\n backdrop: 'static'\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c1bd7e11e4d7d4ffcb5b9ee0632dd56\",\n \"score\": \"0.5762506\",\n \"text\": \"resetModalInputs_() {\\n super.resetModalInputs_();\\n this.firstTypeInput_.selected = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c38e7b8fb4eab1c2b41d5a304628ec35\",\n \"score\": \"0.5754257\",\n \"text\": \"function modalReducer(state = initialModal, { type, payload }) {\\n switch (type) {\\n case SELECT_POKEMON:\\n return {\\n mode: payload.mode,\\n isOpen: payload.isOpen,\\n activePokemon: payload.activePokemon\\n };\\n default:\\n return state;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36fa0973d19412e81f2f059360a5e4c3\",\n \"score\": \"0.57212174\",\n \"text\": \"handleOpenTypeDModal() {\\n this.setState({ showTypeDModal: !this.state.showTypeDModal });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0de01f81ec68f06a109cc98950e4e8b7\",\n \"score\": \"0.56534976\",\n \"text\": \"function openModal(modalType){\\r\\n\\tif (modalType == null){\\r\\n\\t modalError(); //need to write a full function\\r\\n\\t}\\r\\n\\telse {\\r\\n\\t //console.log('the modal opened');\\r\\n\\t $(\\\"#blanket\\\").addClass(\\\"live-blanket\\\");\\r\\n\\t $(\\\"#modal\\\").show().addClass(\\\"live-modal\\\");\\r\\n\\t $(\\\"#modal-content\\\").addClass(\\\"live-modal-content\\\");\\r\\n\\t $(\\\"#modal-left-pane\\\").html(modalCloseButton);\\r\\n\\t modalType();\\r\\n\\t}\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d695f1ff107894832a857de3a598fd1a\",\n \"score\": \"0.56129766\",\n \"text\": \"handleCloseTypeCModal() {\\n this.setState({ showTypeCModal: !this.state.showTypeCModal });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d90f0ae143ddae4c5e08bcca0f5a44a\",\n \"score\": \"0.5578669\",\n \"text\": \"function cleanItemModal(type) {\\n\\t\\t$('form')[0].reset();\\n\\t\\t$('.alert').css('display', 'none');\\n\\t\\t$('div.form-group').removeClass('has-error');\\n\\t\\t$('#type').val(type);\\n\\n\\t\\tif(type == 'bed') {\\n\\t\\t\\tvar wards = '';\\n\\t\\t\\tfor (var i = 0; i < php.wards.length; i++) {\\n\\t\\t\\t\\tif(Number(php.wards[i].capacity) > php.wards[i].beds.length)\\n\\t\\t\\t\\t\\twards += '<option value=\\\"' +php.wards[i].id+ '\\\">'+ php.wards[i].identification+ '</option>';\\n\\t\\t\\t};\\n\\t\\t\\t$('#ward_id').html('<option val=\\\"\\\">None</option>' + wards);\\t\\t\\t\\n\\t\\t}\\n\\n\\t\\tif(type == 'ward' && $('#wardField').css('display') == 'none') {\\n\\t\\t\\t$('#wardField').css('display', 'block').find('input').prop('disabled', false);\\n\\t\\t\\t$('#bedField').css('display', 'none').find('select').prop('disabled', true);\\n\\t\\t} else if(type == 'bed' && $('#bedField').css('display') == 'none') {\\n\\t\\t\\t$('#bedField').css('display', 'block').find('select').prop('disabled', false);\\n\\t\\t\\t$('#wardField').css('display', 'none').find('input').prop('disabled', true);\\t\\t\\t\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8c97132f7b46a806936ea18baa833b0\",\n \"score\": \"0.55732274\",\n \"text\": \"handleOpenTypeBModal() {\\n this.setState({ showTypeBModal: !this.state.showTypeBModal });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6cdd688562b6bf02cb349fa706ad80bb\",\n \"score\": \"0.55468035\",\n \"text\": \"function ModalCerrarCondicion() {\\n if (modalA === 1) {\\n $('#contratoDetallesmodalE').modal('show');\\n } else {\\n if (modalA === 2) {\\n $('#contratoDetallesmodalEN').modal('show');\\n } else {\\n $('#NuevoContratoDetallesmodalE').modal('show');\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"194f27c2b9297fcc835cfabef625b1f7\",\n \"score\": \"0.5536226\",\n \"text\": \"render (props) {\\n let title = this.props.title;\\n let type = this.props.type;\\n let modalClass = this.state.modalClass + (type.indexOf('delete') >= 0 ? ' delete-modal' : (type.indexOf('memberInfo') >= 0 ? ' mem-info-modal' : ''));\\n let modalBackClass = this.state.modalBackClass;\\n let left = this.state.left;\\n let typeId = this.state.typeId;\\n return(\\n <div>\\n <div className={modalClass} style={{left:left}}>\\n <div className=\\\"modal-head\\\">\\n <span className=\\\"modal-title\\\"><b>{title}</b></span><i className=\\\"modal-close jstfont\\\" onClick={this.closeModal}></i>\\n </div>\\n {type == 'password' && <PasswordModal ref=\\\"changePassword\\\" dataChange={this.dataChange}/>}\\n {type == '/employees' && <EmployeeModal ref=\\\"newModal\\\" typeId={typeId} type={type} dataChange={this.dataChange}/>}\\n {type.indexOf('delete') > 0 && <DeleteModal ref=\\\"newModal\\\" typeId={typeId} type={type} dataChange={this.dataChange}/>}\\n {type == '/members' && <MemberModal ref=\\\"newModal\\\" typeId={typeId} type={type} dataChange={this.dataChange}/>}\\n {type == '/products' && <ProductModal ref=\\\"newModal\\\" typeId={typeId} type={type} dataChange={this.dataChange}/>}\\n {type == '/orders' && <OrderModal dataChange={this.dataChange}/>}\\n {type == '/charge' && <RechargeModal typeId={typeId} dataChange={this.dataChange}/>}\\n {type == '/export' && <ExportModal typeId={typeId} dataChange={this.dataChange}/>}\\n {type == 'memberInfo' && <MemberInfoModal typeId={typeId}/>}\\n <div className=\\\"modal-footer\\\">\\n <input type=\\\"button\\\" className=\\\"btn cancel\\\" value=\\\"取消\\\" onClick={this.closeModal}/>\\n {(type != 'memberInfo' && type.indexOf('delete')<0) && <input type=\\\"button\\\" className=\\\"btn\\\" value={type =='/export'?'导出':'保存'} onClick={this.handleClick}/>}\\n {type.indexOf('delete') > 0 && <input type=\\\"button\\\" className=\\\"btn\\\" value=\\\"确定\\\" onClick={this.handleClick}/>}\\n </div>\\n </div>\\n <div className={modalBackClass}></div>\\n </div>\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"780acea7aa4101149ae29e53b6c3e20b\",\n \"score\": \"0.54911774\",\n \"text\": \"modal (name, data = {}) {\\n switch (name) {\\n default:\\n return undefined\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5d0f926f4229e8a1798fe3cac6ae427\",\n \"score\": \"0.5469759\",\n \"text\": \"addModal (p) {\\n p.type = MODAL\\n const config = this.buildConfig(p)\\n return this.buildDialog(config)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43dabed9c12f092be68fe0c8835d21c4\",\n \"score\": \"0.5451498\",\n \"text\": \"function mostrarModal(tipo, mensaje) {\\n let alert=$('#modal .alert');\\n alert.removeClass(\\\"alert-primary alert-secondary alert-success alert-danger alert-warning alert-info alert-light alert-dark\\\");\\n switch(tipo) {\\n case \\\"secondary\\\":\\n alert.addClass(\\\"alert-secondary\\\");\\n break;\\n case \\\"success\\\":\\n alert.addClass(\\\"alert-success\\\");\\n break;\\n case \\\"danger\\\":\\n alert.addClass(\\\"alert-danger\\\");\\n break;\\n case \\\"warning\\\":\\n alert.addClass(\\\"alert-warning\\\");\\n break;\\n case \\\"info\\\":\\n alert.addClass(\\\"alert-info\\\");\\n break;\\n case \\\"light\\\":\\n alert.addClass(\\\"alert-light\\\");\\n break;\\n case \\\"dark\\\":\\n alert.addClass(\\\"alert-dark\\\");\\n break;\\n default:\\n alert.addClass(\\\"alert-primary\\\");\\n }\\n alert.empty();\\n alert.append(mensaje);\\n $('#modal').modal('show');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68b8e90579321637e7ab8c8931b0ab50\",\n \"score\": \"0.5451242\",\n \"text\": \"handleCloseTypeDModal() {\\n this.setState({ showTypeDModal: !this.state.showTypeDModal });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0900e54d25e6250771651ace84f84f5f\",\n \"score\": \"0.5446287\",\n \"text\": \"getTypeDialogue(){\\n\\t\\tvar type = this.eventPage.page[this.eventPage.id].type;\\n\\t\\tvar idType = this.eventPage.page[this.eventPage.id].idType -1;\\n\\t\\t\\n\\t\\tif(type == \\\"dialogue\\\"){\\n\\t\\t\\t// do dialogue things ...\\n\\t\\t\\tvar typeDialogue = this.scene.sys.cache.json.get('NPCdial_'+type)[idType];\\n\\t\\t\\tthis.eventPage.id ++;\\n\\t\\t\\tthis.eventPage.dialogue = true;\\n\\t\\t\\ttypeDialogue.type = type;\\n\\t\\t\\treturn typeDialogue ;\\n\\t\\t}else if(type ==\\\"choice\\\"){\\n\\t\\t\\tvar typeDialogue = this.scene.sys.cache.json.get('NPCdial_'+type)[idType];\\n\\t\\t\\tthis.eventPage.id ++;\\n\\t\\t\\tthis.eventPage.choice = true;\\n\\t\\t\\ttypeDialogue.type = type;\\n\\t\\t\\treturn typeDialogue ;\\n\\t\\t\\t// do choice things ...\\n\\t\\t}else if(type ==\\\"shop\\\"){\\n\\t\\t\\tvar typeDialogue = this.scene.sys.cache.json.get('NPCdial_'+type)[idType];\\n\\t\\t\\tthis.eventPage.id ++;\\n\\t\\t\\tthis.eventPage.shop = true;\\n\\t\\t\\ttypeDialogue.type = type;\\n\\t\\t\\treturn typeDialogue ;\\n\\t\\t\\t// do shop things...\\n\\t\\t\\t\\n\\t\\t}else if(type==\\\"goto\\\"){\\n\\t\\t\\tthis.eventPage.id = idType;\\n\\t\\t\\t//var typeDialogue = this.scene.sys.cache.json.get('NPCdial_'+type)[idType];\\n\\t\\t\\t//this.eventPage.id = typeDialogue.idType;\\n\\t\\t\\treturn this.getTypeDialogue();\\n\\t\\t\\t// do goto things..\\n\\t\\t}else if(type==\\\"end\\\"){\\n\\n\\t\\t\\tvar i = this.eventPage.id;\\n\\t\\t\\tthis.eventPage.id = 0;\\n\\t\\t\\treturn this.eventPage.page[i];\\n\\t\\t\\t//do end things...\\n\\t\\t}else{\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eedc724ca6fbf987fc7a7de201f11e6\",\n \"score\": \"0.544345\",\n \"text\": \"function ModalAbiertoCondicion() {\\n if ($('#contratoDetallesmodalE').is(':visible')) {\\n $('#contratoDetallesmodalE').modal('hide');\\n modalA = 1;\\n } else {\\n if ($('#contratoDetallesmodalEN').is(':visible')) {\\n $('#contratoDetallesmodalEN').modal('hide');\\n modalA = 2;\\n } else {\\n $('#NuevoContratoDetallesmodalE').modal('hide');\\n modalA = 3;\\n }\\n }\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f79276afece59febe26421b41c493dde\",\n \"score\": \"0.54180837\",\n \"text\": \"openRepoTypeModal() {\\n let addTextBelowIcon = ['Bower', 'Chef', 'CocoaPods', 'Conan', 'Pypi', 'Puppet', 'Opkg', 'Composer', 'SBT', 'Gradle', 'Gems', 'NuGet', 'GitLfs','Generic','P2','VCS','CRAN'];\\n this.$repoTypeScope = this.$scope.$new();\\n this.$repoTypeScope.packageTypes = this.getPackageType();\\n this.$repoTypeScope.highlightCheck = (typeFilter,type) => {\\n if (typeFilter) {\\n let string = type.text.toLowerCase(),\\n searchstring = typeFilter.toLowerCase().replace(/ /g,'');\\n\\n\\n if (string.substr(0, searchstring.length) == searchstring) {\\n type.highlighted = true;\\n return true;\\n } else {\\n type.highlighted = false;\\n return false;\\n };\\n }\\n };\\n this.$repoTypeScope.checkNoResults = (typeFilter) => {\\n if (typeFilter && typeFilter.length > 0 && _.filter(this.packageType,(type)=>type.highlighted).length == 0) {\\n return true;\\n }\\n };\\n this.$repoTypeScope.isSelected = () => {\\n let HighlightedListItems = _.filter(this.packageType,(type)=>type.highlighted);\\n if (HighlightedListItems.length == 1) {\\n return true;\\n }\\n };\\n this.$repoTypeScope.selectPackage = () => {\\n let selectedItem = _.filter(this.packageType,(type)=>type.highlighted);\\n if (selectedItem.length == 1) {\\n this.selectRepoType(selectedItem[0])\\n }\\n };\\n\\n _.map(this.$repoTypeScope.packageTypes,(type)=>{\\n if (_.includes(addTextBelowIcon, type.serverEnumName)) type.helpText = true;\\n });\\n\\n if (this.features.isNonCommercial()) {\\n _.forEach(this.$repoTypeScope.packageTypes, item => {\\n if (!this.features.isEnabled(item.value)) item.disabled = true;\\n });\\n\\n let activeItems = [];\\n if (this.features.isConanCE()) {\\n activeItems = _.remove(this.$repoTypeScope.packageTypes, item => item.serverEnumName === \\\"Conan\\\" || item.serverEnumName === \\\"Generic\\\");\\n }\\n else if (this.features.isJCR()) {\\n activeItems = _.remove(this.$repoTypeScope.packageTypes, item => item.serverEnumName === \\\"Docker\\\" || item.serverEnumName === \\\"Helm\\\" || item.serverEnumName === \\\"Generic\\\");\\n }\\n\\n this.$repoTypeScope.packageTypes = [...activeItems, ...this.$repoTypeScope.packageTypes];\\n }\\n this.$repoTypeScope.closeModal = () => this.closeModalPackageType();\\n this.$repoTypeScope.modalClose = ()=> this.modalClose();\\n this.$repoTypeScope.selectRepoType = (type)=>this.selectRepoType(type);\\n this.isTypeModalOpen = true;\\n\\n this.repoTypeModal = this.modal.launchModal('repository_type_modal', this.$repoTypeScope, 1000);\\n this.repoTypeModal.result.finally(() => {\\n this.repositoriesForm.repoKey.$validate();\\n this.isTypeModalOpen = false;\\n if (this.repoInfo.isType('debian')) {\\n this.onFormatSelectionChange();\\n }\\n\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55ec34e9860385b5fe3df79087372a13\",\n \"score\": \"0.5417084\",\n \"text\": \"handleClickGamesModal(e) {\\n const { modalShow } = this.state;\\n if (modalShow === false) {\\n this.setState({\\n type: e.target.innerText,\\n modalShow: true\\n })\\n } else {\\n this.setState({\\n modalShow: false\\n })\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0266d69621b9938c9cec410f9d114964\",\n \"score\": \"0.5400444\",\n \"text\": \"function recaudadorModal(e, limpiar){\\r\\n\\r\\n var defaultOption = e.parents('.account_group').find('.cpl_modal .modal_recaudador .custom_select ul li.default').html();\\r\\n var select_recaudador = e.parents('.account_group').find('.cpl_modal .modal_recaudador');\\r\\n\\r\\n// limpio el campo del fondo recaudador \\r\\nvar campoFondoRecaudador = e.parents('.account_group').find('.cpl_modal .modal_recaudador .inputSelect');\\r\\nif (limpiar == true){\\r\\ncampoFondoRecaudador.val('');\\r\\nselect_recaudador.find('.selected').html(defaultOption);\\r\\n}\\r\\n fondosSeleccionados = FondosSeleccionadosModal(e);\\r\\n// alert('fondos en el modal: '+fondosSeleccionados);\\r\\n console.log(fondosSeleccionados);\\r\\n if(fondosSeleccionados.length == 2){\\r\\n select_recaudador.show(200);\\r\\n }else{\\r\\n select_recaudador.hide();\\r\\n }\\r\\n\\r\\n console.log('fondos seleccionados en el modal'+ fondosSeleccionados);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c06db1d1a5cbd9438374d5b3fa8d4db3\",\n \"score\": \"0.5399589\",\n \"text\": \"function openModal(params) {\\n if (!params || !params.type) {\\n throw new Error('Missing modal type');\\n }\\n var modalInstance = $modal.open({\\n templateUrl: 'modal/templates/modalcontainer.html',\\n controller: 'ModalController',\\n scope: $scope,\\n size: params.size,\\n resolve: {\\n // The return value is passed to ModalController as 'locals'\\n locals: function () {\\n return {\\n type: params.type,\\n wallet: $rootScope.wallets.current,\\n userAction: BG_DEV.MODAL_USER_ACTIONS.sendFunds\\n };\\n }\\n }\\n });\\n return modalInstance.result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8f062acc1d8cc361382d53fd040e696\",\n \"score\": \"0.53938\",\n \"text\": \"onOpenModalDelete(payload){\\n if(payload.type == 'img')\\n {\\n this.idItemImgDelete = payload.id;\\n this.typeItemDelete = 'img';\\n }\\n else if(payload.type==\\\"video\\\"){\\n this.idItemVideoDelete = payload.id;\\n this.typeItemDelete = 'video';\\n }\\n this.modalIsOpenDelete = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"245edf12bfe285acb3d9ed7858d67a92\",\n \"score\": \"0.5384235\",\n \"text\": \"modalPackage(state){\\n return state.setToModal\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b20a8f177abbcf02c8bf02ae31c0eff8\",\n \"score\": \"0.53747857\",\n \"text\": \"function closeModal(tModal) {\\n switch (tModal) {\\n case \\\"registro\\\":\\n modal.style.display = \\\"none\\\";\\n break;\\n \\n case \\\"ig\\\":\\n moig.style.display = \\\"none\\\";\\n break;\\n\\n default:\\n break;\\n }\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6c0690abc4922f18199532556983a9e\",\n \"score\": \"0.5374741\",\n \"text\": \"showAssignModal(type, id) {\\n console.log(type);\\n assignModal.id = id;\\n $('#assign-modal').modal('show');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf2a6792b4905cb01c86e9cd6cd8ed43\",\n \"score\": \"0.53740275\",\n \"text\": \"handleCloseTypeBModal() {\\n this.setState({ showTypeBModal: !this.state.showTypeBModal });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b9093571079c32a9a5d5da728317d28\",\n \"score\": \"0.5372368\",\n \"text\": \"function getModalidad() {\\n console.log(\\\"Ya seleccione\\\");\\n console.log(vm.selectedModalidad);\\n vm.Modalidad=vm.selectedModalidad\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93fd85acba5e8d8d37b2a9133498c5c5\",\n \"score\": \"0.5366218\",\n \"text\": \"showModal(selectedUser) {\\n \\t//switch based on \\\"type\\\" sent into component\\n \\t//this is a temporary work around as we transition into non-team supplier contacts\\n \\tvar type = this.props.type;\\n \\tif(type==\\\"team\\\"||(selectedUser&&selectedUser.collectionName==\\\"Team\\\")) {\\n\\t Modal.show({\\n\\t content:<TeamCard \\n\\t \\titem={selectedUser} \\n\\t \\tteam={this.data.team}\\n\\t \\trole={this.data.role}\\n\\t \\tgroup={this.data.group}/>\\n\\t })\\n \\t}\\n \\telse {\\n\\t Modal.show({\\n\\t content:<UserCard \\n\\t \\titem={selectedUser} \\n\\t \\tteam={this.data.team}\\n\\t \\trole={this.data.role}\\n\\t \\tgroup={this.data.group}/>\\n\\t })\\n\\t }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"686871639dfb9a6e33d181a75ab7d390\",\n \"score\": \"0.5359939\",\n \"text\": \"function cambiaHeadModal(titulo,opc1){\\r\\n alert ('hola');\\r\\n debugger;\\r\\n switch(opc1)\\r\\n {\\r\\n case '1':\\r\\n $(\\\"#TituloModal\\\").removeClass('alert-success').removeClass('alert-danger').html(titulo);\\r\\n break;\\r\\n case '2':\\r\\n $(\\\"#TituloModal2\\\").removeClass('alert-success').removeClass('alert-danger').html(titulo);\\r\\n break;\\r\\n }\\r\\n debugger; \\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af996931b2648af27026cf32724dedf1\",\n \"score\": \"0.53595763\",\n \"text\": \"static get types() {\\n return {\\n 'treble': {\\n code: 'gClef',\\n line: 3,\\n },\\n 'bass': {\\n code: 'fClef',\\n line: 1,\\n },\\n 'alto': {\\n code: 'cClef',\\n line: 2,\\n },\\n 'tenor': {\\n code: 'cClef',\\n line: 1,\\n },\\n 'percussion': {\\n code: 'restMaxima',\\n line: 2,\\n },\\n 'soprano': {\\n code: 'cClef',\\n line: 4,\\n },\\n 'mezzo-soprano': {\\n code: 'cClef',\\n line: 3,\\n },\\n 'baritone-c': {\\n code: 'cClef',\\n line: 0,\\n },\\n 'baritone-f': {\\n code: 'fClef',\\n line: 2,\\n },\\n 'subbass': {\\n code: 'fClef',\\n line: 0,\\n },\\n 'french': {\\n code: 'gClef',\\n line: 4,\\n },\\n 'tab': {\\n code: '6stringTabClef',\\n },\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc20245c237960ce1b0a0c12427da0c7\",\n \"score\": \"0.535138\",\n \"text\": \"function edit_open_modal(ip_value, typeoftable) {\\n console.log(typeoftable);\\n modal.style.display = \\\"block\\\";\\n document.querySelector(\\\"#edit_id\\\").value = document.getElementById('id_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_id\\\").disabled = true\\n document.querySelector(\\\"#edit_ip\\\").value = document.getElementById('ip_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_all_brand\\\").value = document.getElementById('brand_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_model\\\").value = document.getElementById('model_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_camera_name\\\").value = document.getElementById('camera_name_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_user\\\").value = document.getElementById('user_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_password\\\").value = document.getElementById('password_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_all_Auth_type\\\").select = document.getElementById('auth_type_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_stream_url\\\").value = document.getElementById('stream_url_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_location_name\\\").value = document.getElementById('location_name_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_latitude\\\").value = document.getElementById('latitude_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_longitude\\\").value = document.getElementById('longitude_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_all_organization\\\").value = document.getElementById('organization_rows' + ip_value).innerHTML;\\n document.querySelector(\\\"#edit_cam_type\\\").value = document.getElementById('cam_type_rows' + ip_value).innerHTML;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3ddfb7db2e601f9b313f22bdd5bc527\",\n \"score\": \"0.5346572\",\n \"text\": \"render() {\\n return (\\n <div className=\\\"container\\\">\\n <Button\\n bsStyle=\\\"primary\\\"\\n bsSize=\\\"small\\\"\\n onClick={this.open}\\n className=\\\"float-right-margin\\\"\\n >\\n Add {this.props.type === 'StudentAtCampus' ? 'Student': this.props.type}\\n </Button>\\n <Modal show={this.state.showModal} onHide={this.close}>\\n <Modal.Header closeButton>\\n <Modal.Title>Add {this.props.type}</Modal.Title>\\n </Modal.Header>\\n <Modal.Body>\\n {this.renderTypeForm()}\\n </Modal.Body>\\n <Modal.Footer>\\n <Button onClick={this.close}>Close</Button>\\n </Modal.Footer>\\n </Modal>\\n </div>\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c5baac018c1774924e49d7cf50ae4c2\",\n \"score\": \"0.53448564\",\n \"text\": \"function ModalAbiertoCondicionReg() {\\n if ($('#contratoDetallesmodal').is(':visible')) {\\n $('#contratoDetallesmodal').modal('hide');\\n modalReg = 1;\\n } else {\\n $('#detallesContratomodal').modal('hide');\\n modalReg = 2;\\n }\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2079a8830c397a395fcdb9d648a39506\",\n \"score\": \"0.53278744\",\n \"text\": \"changeWalletType(type) {\\n // Set wallet typeModalOpen\\n this._selectedType = this.walletTypes[type - 1];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9feab82f035ddab5105fe23d8d053d75\",\n \"score\": \"0.53081703\",\n \"text\": \"function setAmenityType(row){\\n\\tvar selectedRows = View.panels.get('abRplmAddEditClausesAmntType').getSelectedRows();\\n\\tpanel = rplmClauseController.formClause;\\n\\tfor (i = 0; i<selectedRows.length; i++){\\n\\t\\t\\n\\t\\tvar comments = (selectedRows[i]['bl_amenity.comments'])?\\\" - Comments: \\\"+selectedRows[i]['bl_amenity.comments']:\\\"\\\";\\n\\t\\t\\n\\t\\tpanel.setFieldValue('ls_resp.description' , panel.getFieldValue('ls_resp.description')+ \\\" Amenity Type: \\\"+ selectedRows[i]['bl_amenity.amenity_type']+comments +\\\". \\\");\\t\\n\\t}\\n\\tView.panels.get('abRplmAddEditClausesAmntType').closeWindow();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e19e0232559661b15d1cd8ee45b7648\",\n \"score\": \"0.5303632\",\n \"text\": \"function showTypeTransaction() {\\n var tmpArray1 = (gUserInfo.lang == 'EN') ? CONST_ACCOUNT_QUERY_TYPE_TRANSACTION_EN :\\n CONST_ACCOUNT_QUERY_TYPE_TRANSACTION_VN;\\n var tmpArray2 = CONST_ACCOUNT_QUERY_TYPE_TRANSACTION_VAL;\\n\\n var handleInputTypeTransaction = function(e) {\\n document.removeEventListener(\\\"evtSelectionDialog\\\", handleInputTypeTransaction, false);\\n var acctype = document.getElementById('idTypeTransaction');\\n if ((e.selectedValue1 != undefined) && (e.selectedValue1 != null)) {\\n if (acctype.nodeName == \\\"INPUT\\\") {\\n acctype.value = e.selectedValue1;\\n transaction = getValueTransaction(e);\\n }\\n\\n } else {\\n acctype.innerHTML = e.selectedValue1;\\n transaction = getValueTransaction(e);\\n }\\n\\n if ((e.selectedValue2 != undefined) && (e.selectedValue2 != null)) {\\n typeTransaction = e.selectedValue2;\\n }\\n }\\n\\n var handleInputTypeTransactionClose = function() {\\n document.removeEventListener(\\\"evtSelectionDialogClose\\\", handleInputTypeTransactionClose, false);\\n document.removeEventListener(\\\"evtSelectionDialog\\\", handleInputTypeTransaction, false);\\n }\\n\\n document.addEventListener(\\\"evtSelectionDialog\\\", handleInputTypeTransaction, false);\\n document.addEventListener(\\\"evtSelectionDialogClose\\\", handleInputTypeTransactionClose, false);\\n showDialogList(CONST_STR.get(\\\"COM_CHOOSEN_TYPE_TRANS\\\"), tmpArray1, tmpArray2, false);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f05b54b68dbfb270d118c08a4dadc87f\",\n \"score\": \"0.5302202\",\n \"text\": \"function showAddServiceModal(type, objectList, category) {\\n if(type == 1) {\\n $('#title-icon').hide();\\n $('#title-name').html('Category');\\n $('#title-category').html('');\\n } else {\\n $('#title-icon').show();\\n $('#title-name').html('Service');\\n $('#title-category').html(category);\\n }\\n if(objectList.constructor === Array) {\\n var html = '';\\n objectList.forEach(function(element) {\\n html += '<li class=\\\"nn-item\\\">' +\\n '<span class=\\\"nn-num\\\">'+ element.id +'</span>' +\\n '<span class=\\\"nn-name\\\">'+ element.name +'</span>' +\\n '<span class=\\\"nn-price font-weight-bold\\\">'+ element.price +'</span>' +\\n '<span class=\\\"nn-tick icon wb-check d-none\\\"></span>' +\\n '</li>'\\n });\\n\\n $('#list-order').html(html);\\n }\\n\\n if(!($(\\\"#addServiceModal\\\").data('bs.modal') || {isShown: false}).isShown) $('#addServiceModal').modal('show');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a10c63eed5b99776d6a6b84fe5f7c3e\",\n \"score\": \"0.5292278\",\n \"text\": \"handleOpenTypeAModal() {\\n this.setState({ showTypeAModal: !this.state.showTypeAModal });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5f32c212e87d289bcf2ce06431bcdd5\",\n \"score\": \"0.529095\",\n \"text\": \"function close_modal(type)\\n{\\n var menu = document.getElementById(type);\\n menu.style.display = \\\"none\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53f6ea7975f7ae5d4290f4244e6835f1\",\n \"score\": \"0.5280262\",\n \"text\": \"function showModalCreatePaciente() {\\n $('#modalCreatePrimerApellido').val($('#PrimerApellido').val());\\n $('#modalCreatePrimerNombre').val($('#PrimerNombre').val());\\n $('#modalCreateSexoId').val($('#Sexo').val());\\n $('#modalCreateSexoNombre').val($('#Sexo option:selected').text());\\n $('#modalCreateTipoDocumentoId').val($('#TipoDocumentoId').val());\\n $('#modalCreateTipoDocumentoNombre').val($(\\\"#TipoDocumentoId option:selected\\\").text());\\n $('#modalCreateNroDocumento').val($('#NroDocumento').val());\\n $('#modalCreateFechaNacimiento').val($('#FechaNacimiento').val());\\n $('#modalCreateEmail').val('');\\n\\n $('#modalCreatePaciente').modal('show');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1473642cbb7a8683297078e026965b09\",\n \"score\": \"0.5277371\",\n \"text\": \"getModalFromAction() {\\n switch(this.state.actionId) {\\n case 2:\\n return (<IngestTelemetryModalForm parent={ this }/>);\\n\\n case 3:\\n return (<TransferResponsibilityModalForm parent={ this }/>);\\n\\n default:\\n break;\\n }\\n return(<h1>Modal</h1>)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6caabc12cf6d53f358d6947e528e8f2\",\n \"score\": \"0.52767384\",\n \"text\": \"function showTrainingType(){\\n $scope.trainingTypeModalTitle = '选择培训类别';\\n $scope.trainingTypeModal = $modal({scope: $scope, templateUrl: 'partials/hr/training/modal.trainingType.html', show: true });\\n //$scope.modalTrainingypes = angular.copy($scope.trainingTypes);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ce0af627ea8f70d048c27bcc4fd6a58\",\n \"score\": \"0.5274318\",\n \"text\": \"function apriModaleSoggetto() {\\n $(\\\"#codiceSoggetto_modale\\\").val($(\\\"#codiceSoggettoSoggetto\\\").val());\\n $(\\\"#modaleGuidaSoggetto\\\").modal(\\\"show\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01b77f78b74affe00fa498bd9593791f\",\n \"score\": \"0.5266534\",\n \"text\": \"setType () {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aae03214fc35a5360ad66168a921af50\",\n \"score\": \"0.52660805\",\n \"text\": \"MODAL_OPEN({ commit }, data) {\\t\\t\\n\\t\\tcommit(\\\"SET_MODAL_OPEN\\\", data);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8b8698d5f10ef3f349ee302c56a444a\",\n \"score\": \"0.52648365\",\n \"text\": \"modalFilled (modal) {\\n let cr = document.getElementById('create-room')\\n if(!cr) document.querySelector('.tingle-modal-box__footer').style.display='flex';\\n let type = modal.__type;\\n setTimeout(function(){ modal.checkOverflow() }, 300);\\n var letsgo = document.querySelectorAll('.letsgo');\\n if(!letsgo.length){\\n\\n modal.addFooterBtn(\\\"Let's Go ! <i class='fas fa-chevron-right'></i>\\\", 'tingle-btn tingle-btn--primary letsgo tingle-btn--pull-right', function(e){\\n try { med.mutedStream = med.h.getMutedStream(); } catch(err){ console.warn(\\\"error in getting mutedstream\\\",err); }\\n self.handleOk({type,modal,e});\\n\\n });\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d73d6a2e973f9382159a42a6542afab\",\n \"score\": \"0.5261974\",\n \"text\": \"function showStatusALERT(id) {\\r\\n $(\\\"#trasanoModalHeader\\\").empty();\\r\\n $(\\\"#trasanoModalBody\\\").empty();\\r\\n $(\\\"#trasanoModalFooter\\\").empty();\\r\\n $(\\\"#trasanoModalHeader\\\").append(\\\"<h4>Estado del servicio...</h4>\\\");\\r\\n\\r\\n $(\\\"#trasanoModalBody\\\").append(\\r\\n \\\"<div class='form-group'>\\\" + \\r\\n \\\"<label for='message-text' class='control-label'>Seleccione el estado:</label>\\\" + \\r\\n \\\"<select class='form-control' id='statusSelected'>\\\" + \\r\\n \\\"<option value='2' selected>Recogido</option>\\\" +\\r\\n \\\"<option value='3'>Entregado</option>\\\" + \\r\\n \\\"</select>\\\" +\\r\\n '</div>');\\r\\n\\r\\n\\r\\n $(\\\"#trasanoModalFooter\\\").append(\\r\\n \\\"<button type='button' class='btn btn-default' data-dismiss='modal'>CANCELAR</button>\\\" + \\r\\n \\\"<a class='btn btn btn-primary' href='javascript:executeStatus(\\\" + id + \\\");' role='button'>ACEPTAR</a>\\\");\\r\\n $('#trasanoMODAL').modal('show'); \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d40ec6ccf4e5f3557eba4d2fc6ea417\",\n \"score\": \"0.5257272\",\n \"text\": \"function abrir_modal(el){\\n for (let i = 0; i < diapo.length; i++) {\\n if(diapo[i].tema == el){\\n sw = true;\\n dia_tema = diapo[i];\\n diapos = dia_tema.diapositivas;\\n break;\\n }\\n }\\n if(!sw){\\n abrir_modal_error('Importante...!!!', 'Las diapositivas aun no estan listas para este tema, por favor espera a que se habiliten.<br><br> Muchas gracias :)')\\n }else{\\n modal.style.display = 'grid';\\n validar_contenido(diapos[j]);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed121c3a38ab4d0a9f28d6f8ced7d046\",\n \"score\": \"0.5257223\",\n \"text\": \"function setObjectiveModalContent(id, title, text, date, status, type){\\n if (type == 2){\\n $('#proposedTo').html(proposedToHTML());\\n \\t//Get email list and initialise tags input\\n tags(\\\"proposed-obj-to\\\", emails);\\n keypress('objective-modal');\\n }else{\\n $('#proposedTo').html(\\\"\\\");\\n }\\n\\t$('#obj-modal-title-type').text(modalStatusList[type]);\\n\\t$(\\\"#objective-id\\\").val(id);\\n\\t$(\\\"#objective-title\\\").val(title);\\n\\t$(\\\"#objective-text\\\").val(text);\\n\\t$(\\\"#objective-date\\\").val(date);\\n\\t$(\\\"#objective-status\\\").val(status);\\n\\t$('#submit-obj').prop(\\\"disabled\\\", enableSubmit(type));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc9f093e44b430288dd474d4e555160f\",\n \"score\": \"0.52565295\",\n \"text\": \"createVariableTypeContainer_(types) {\\n const selectDiv = document.createElement('select');\\n for (let i = 0; i < types.length; i++) {\\n const type = types[i];\\n const displayName = type[0];\\n const typeName = type[1];\\n const option = document.createElement('option');\\n option.classList.add('input-modal-type');\\n option.value = typeName;\\n option.innerText = displayName;\\n selectDiv.appendChild(option);\\n }\\n this.firstTypeInput_ = selectDiv.querySelector('.input-modal-type');\\n return selectDiv;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a0708c2afbaa053e9f2510d33d96e00e\",\n \"score\": \"0.52534235\",\n \"text\": \"function montaModal_listaAtividade(){\\n\\t$('.modal-trigger').leanModal();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b45bcb6a6c183db9444309ac476f062\",\n \"score\": \"0.5242974\",\n \"text\": \"function showModalDelete() {\\n if (registros.status == '1') {\\n var status = '0';\\n $(\\\"#Modal-eliminaRegistro-Titulo\\\").text('Eliminar registro');\\n $(\\\"#Modal-eliminaRegistro-Color\\\").removeClass(\\\"w3-blue\\\").addClass(\\\"w3-red\\\");\\n } else {\\n $(\\\"#Modal-eliminaRegistro-Color\\\").removeClass(\\\"w3-red\\\").addClass(\\\"w3-green\\\");\\n $(\\\"#Modal-eliminaRegistro-Titulo\\\").text('Activar registro');\\n var status = '1';\\n }\\n $(\\\"#eliminaID\\\").val(registros.id);\\n $(\\\"#eliminaStatus\\\").val(status);\\n $(\\\"#eliminaRegistro\\\").attr('action', idTablaLista.toLowerCase() + '/elimina');\\n $(\\\"#Modal-eliminaRegistro-Contenido\\\").text('Clave = ' + registros.id + ' Nombre = ' + registros.nombre);\\n $(\\\"#Modal-eliminaRegistro\\\").modal(\\\"show\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13ec3106a469c525bd2b20b9a9072726\",\n \"score\": \"0.5242618\",\n \"text\": \"function modalPoem() {\\n // first, we grab the poem and place it in the modal\\n getPoem(true, false);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78c4bde7b4f3fe0cf4dd9e128a7dfd38\",\n \"score\": \"0.52400917\",\n \"text\": \"function setResponseType() {\\r\\n let $activeItem = $(\\\".active\\\").text()\\r\\n $activeItem = $activeItem.toLowerCase();\\r\\n let array = responseTypes[$activeItem];\\r\\n return array;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a3ef0a25345732831ca94196cf87a95\",\n \"score\": \"0.5235743\",\n \"text\": \"function ModalCerrarCondicionReg() {\\n if (modalReg === 1) {\\n $('#contratoDetallesmodal').modal('show');\\n } else {\\n $('#detallesContratomodal').modal('show');\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"301b3e16b9cb23ffda4c55a3ae1099b7\",\n \"score\": \"0.5234133\",\n \"text\": \"function makePopUp(type, name) {\\n\\t$('#add-or-edit-container').html('');\\n\\t$('.obscure').fadeIn(300);\\n\\t$('.obscure').css('display', 'block');\\n\\tif (type == 'manageFilters') {\\n\\t\\tmanageFilters();\\n\\t} else if (type == 'help') {\\n\\t\\tdisplayHelp();\\n\\t} else if (type == 'reset') {\\n\\t\\tresetData();\\n\\t} else if (type == 'add') {\\n\\t\\taddingItem(name);\\n\\t} else {\\n\\t\\taddNewMenu(type);\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f08f2c550697424a8b0cf64e9850036c\",\n \"score\": \"0.5215823\",\n \"text\": \"function abrir_modal_apuestapuestocompra(id) {\\n var metodo = \\\"modal_clientes_apuestapuestocompra\\\";\\n var montoval = DN($('#idmontolista').val());\\n var mtoval = parseFloat(montoval);\\n $('#botonera').html(\\\"\\\");\\n if (mtoval == '' || mtoval == ',') {\\n $(\\\"#botonera\\\").html(\\\"<div id='botcan' class='modalb' onclick='ocultarmodal(\\\" + \\\"'\\\" + metodo + \\\"');'>Cancelar</div>\\\");\\n $(\\\"#mycontenido\\\").html('El monto es requerido!!11');\\n $('#modal_clientes_apuestapuestocompra').show();\\n return false;\\n }\\n\\n if ((mtoval <= 0) || ($('#idmontolista').val() == \\\"\\\")) {\\n $(\\\"#botonera\\\").html(\\\"<div id='botcan' class='modalb' onclick='ocultarmodal(\\\" + \\\"'\\\" + metodo + \\\"');'>Cancelar</div>\\\");\\n $(\\\"#mycontenido\\\").html('El monto es requerido!!');\\n $('#modal_clientes_apuestapuestocompra').show();\\n return false;\\n }\\n\\n if ((mtoval <= 0)) {\\n $(\\\"#botonera\\\").html(\\\"<div id='botcan' class='modalb' onclick='ocultarmodal(\\\" + \\\"'\\\" + metodo + \\\"');'>Cancelar</div>\\\");\\n $(\\\"#mycontenido\\\").html('El monto debe ser mayor que 0!!');\\n $('#modal_clientes_apuestapuestocompra').show();\\n return false;\\n }\\n\\n if (solounacoma($('#idmontolista').val()) > 1 || $('#idmontolista').val() == \\\"'\\\") {\\n $(\\\"#botonera\\\").html(\\\"<div id='botcan' class='modalb' onclick='ocultarmodal(\\\" + \\\"'\\\" + metodo + \\\"');'>Cancelar</div>\\\");\\n $(\\\"#mycontenido\\\").html('El formato del monto es inavlido!!');\\n $('#modal_clientes_apuestapuestocompra').show();\\n return false;\\n }\\n // alert($('#idafavor').val());\\n var base = $('#idproporcionapuesta').val();\\n var myArray = base.split('#');\\n var pagopan = myArray[1];\\n var ganopan = myArray[2];\\n if ($('#idafavor').val() == 'C') {\\n pagopan = myArray[2];\\n ganopan = myArray[1];\\n }\\n var megan0 = (mtoval * ganopan) / pagopan;\\n var comi = (megan0 * $('#idcomision').val()) / 100;\\n megan0 = megan0 - (megan0 * $('#idcomision').val()) / 100;\\n $(\\\"#mycontenido\\\").html('Apuesto BS: ' + $('#idmontolista').val() + ' Para Ganar BS: ' + FN(megan0));\\n $(\\\"#botonera\\\").html(`\\n <div style=\\\"float: right;\\\">\\n <div id='botok' class='modalb' onclick='comprar_puestolista(` + $('#idevento0').val() + `);'>Confirmar Apuesta</div>\\n <div id='botcan' class='modalb' onclick='ocultarmodal(` + `'` + metodo + `');'>Cancelar</div>\\n </div>`);\\n\\n try {\\n bonsal = $('#idsaldobono1 span').html().replace('.', \\\"\\\");\\n bonsal = bonsal.replace(',', \\\".\\\");\\n if (bonsal > 0) {\\n $(\\\"#botonera\\\").prepend(`\\n <div style=\\\"float: left; padding: 3px;\\\">\\n <input type=\\\"checkbox\\\" value='false' id=\\\"cbox2\\\" style=\\\"cursor: initial; display: inline-block;\\\"><label for=\\\"cbox2\\\">Utilizar Bono</label>\\n </div>\\n `);\\n }\\n } catch (error) { console.log('e') }\\n\\n $('#modal_clientes_apuestapuestocompra').show();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ab58173bd2f4c029587de8c69362394\",\n \"score\": \"0.52128595\",\n \"text\": \"function dialogSelect(e) {\\n var value1 = e.selectedValue1;\\n var value2 = e.selectedValue2;\\n switch (gTrans.authorize.selectionType) {\\n case 1: // Loai giao dich\\n var element = document.getElementById(\\\"id.trans-type\\\");\\n element.value = value1;\\n gTrans.authorize.transType = value2;\\n break;\\n case 2: // Nguoi lap\\n var element = document.getElementById(\\\"id.maker\\\");\\n element.value = value1;\\n gTrans.authorize.makerId = value1;\\n break;\\n case 3: // Trang thai\\n var element = document.getElementById(\\\"id.status\\\");\\n element.value = value1;\\n gTrans.authorize.transStatus = value2;\\n break;\\n default:\\n break;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"245cc752eb876215c7c72907ec0d6716\",\n \"score\": \"0.5210999\",\n \"text\": \"get modalClass() {\\n return `slds-modal ${this.isModalOpen ? \\\"slds-fade-in-open\\\" : \\\"\\\"}`;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5518c53cc4bf316656d33fd4a76b1dc\",\n \"score\": \"0.52100825\",\n \"text\": \"saveModal()\\n {\\n this.columns=this.selectedFields;\\n this.values=this.defaultValues;\\n this.isModalOpen=false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9be2b0928bbc44ad8ca9202fb792caa8\",\n \"score\": \"0.52092606\",\n \"text\": \"function modalChangeElement(modalVar, buttonVar, spanVar, pVar) { //funzione che prende in pasto 4 variabili:\\n //modalVar= id del modal che si dovrà aprire\\n //buttonVar= id del pulsante che aprirà il modal\\n //spanVar= classe dello span contenente la X per la chiusura del modal\\n //pVar= la classe del p da selezionare\\n buttonVar.onclick = function() { // Quando l'utente clicca sul pulsante\\n modalVar.style.display = \\\"block\\\"; // si apre il modal\\n }\\n spanVar.onclick = function() { // Quando l'utente clicca sulla X\\n modalVar.style.display = \\\"none\\\"; // si chiude il modal\\n }\\n window.onclick = function(event) { //OPZIONALE: Quando l'utente clicca su qualsiasi punto al di fuori del modal\\n if (event.target == modalVar) { //Il modal si chiude\\n modalVar.style.display = \\\"none\\\";\\n }\\n }\\n $(pVar).on('click', function(){ //Quando l'utente clicca su un p all'interno del modal\\n var current = $(this).text(); //prendo il contenuto del p cliccato\\n $(buttonVar).text(current); // lo vado a sostituire nella navbar\\n modalVar.style.display = \\\"none\\\"; // si chiude il modal\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1af7acf12dce7567101521ce31282818\",\n \"score\": \"0.5179819\",\n \"text\": \"static getItemTypes() {\\n\\n if (_itemTypes == null) {\\n _itemTypes = {\\n\\n // Action types.\\n Shortcut: actions.Shortcut.action,\\n InsertText: actions.InsertText.action,\\n Command: actions.Command.action,\\n Uri: actions.Uri.action,\\n File: actions.File.action,\\n DBusSignal: actions.DBusSignal.action,\\n\\n // Menu types.\\n CustomMenu: menus.CustomMenu.menu,\\n Devices: menus.Devices.menu,\\n Bookmarks: menus.Bookmarks.menu,\\n System: menus.System.menu,\\n Favorites: menus.Favorites.menu,\\n FrequentlyUsed: menus.FrequentlyUsed.menu,\\n RecentFiles: menus.RecentFiles.menu,\\n RunningApps: menus.RunningApps.menu,\\n };\\n\\n // This is only possible if the GMenu typelib is installed on the system.\\n if (GMenu) {\\n _itemTypes.MainMenu = menus.MainMenu.menu;\\n }\\n }\\n\\n return _itemTypes;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"670d439889a6bdabd7197858c0002aaf\",\n \"score\": \"0.51734054\",\n \"text\": \"function viewMsgModal(modalType,Msg,confirm,cancel,functionName) {\\n\\n if (modalType == \\\"warning-modal\\\") {\\n $('#msg-modal').removeClass(\\\"success-modal\\\");\\n $('#msg-modal').removeClass(\\\"danger-modal\\\");\\n $('#msg-modal').addClass(\\\"warning-modal\\\");\\n\\n $(\\\"#msg-modal .modal-icon span\\\").removeAttr(\\\"class\\\");\\n $(\\\"#msg-modal .modal-icon span\\\").addClass(\\\"fa fa-exclamation\\\");\\n\\n }\\n else if (modalType == \\\"danger-modal\\\") {\\n $('#msg-modal').removeClass(\\\"success-modal\\\");\\n $('#msg-modal').removeClass(\\\"warning-modal\\\");\\n $('#msg-modal').addClass(\\\"danger-modal\\\");\\n\\n $(\\\"#msg-modal .modal-icon span\\\").removeAttr(\\\"class\\\");\\n $(\\\"#msg-modal .modal-icon span\\\").addClass(\\\"fa fa-times\\\");\\n }\\n else if (modalType == \\\"success-modal\\\") {\\n $('#msg-modal').removeClass(\\\"danger-modal\\\");\\n $('#msg-modal').removeClass(\\\"warning-modal\\\");\\n $('#msg-modal').addClass(\\\"success-modal\\\");\\n\\n $(\\\"#msg-modal .modal-icon span\\\").removeAttr(\\\"class\\\");\\n $(\\\"#msg-modal .modal-icon span\\\").addClass(\\\"fa fa-check\\\"); \\n }\\n\\n $(\\\"#msg-modal .msg h5\\\").empty();\\n $(\\\"#msg-modal .msg h5\\\").html(Msg);\\n\\n if (confirm == 'true') {\\n $(\\\"#ConfirmationBtn\\\").css(\\\"display\\\", \\\"block\\\");\\n }\\n if (cancel == 'true') {\\n $(\\\"#CancelBtn\\\").css(\\\"display\\\", \\\"block\\\");\\n }\\n $(\\\"#msg-modal .closeBtn\\\").attr(\\\"onclick\\\", functionName);\\n $('#msg-modal').modal({\\n show: true,\\n keyboard: false,\\n backdrop: 'static'\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd06d19eeb3d0b3bfffd9bcde0fb07f1\",\n \"score\": \"0.51640826\",\n \"text\": \"function exibir(tipo, dados) {\\n switch (tipo) {\\n case 'cliente':\\n $('#input-nome-modal').val(dados.razao_social).toUpperCase();\\n $('#input-sigla-modal').val(dados.sigla).toUpperCase();\\n dados.status === 's' ? $('#input-active-modal').click() : $('#input-inactive-modal').click();\\n break;\\n\\n case 'tema':\\n $('#input-tema-modal').val(dados.tema);\\n dados.status === 's' ? $('#input-active-modal').click() : $('#input-inactive-modal').click();\\n break;\\n\\n case 'planta':\\n $('#input-planta-modal').val(dados.planta);\\n dados.status === 's' ? $('#input-active-modal').click() : $('#input-inactive-modal').click();\\n break; \\n\\n case 'email':\\n $('#input-server').val(dados.servidor);\\n $('#input-port').val(dados.porta);\\n dados.ssl == 's' ? $('#input-ssl').attr('checked', true) : $('#input-ssl').attr('checked', false);\\n $('#input-user-smtp').val(dados.usuario_smpp);\\n break;\\n\\n case 'departamento':\\n $('#departamento-nome').val(dados.nome);\\n dados.status === 's' ? $('#input-active-modal').click() : $('#input-inactive-modal').click();\\n dados.pergunta_aprovacao === 's' ? $('#pergunta-aprovacao').attr('checked', true) : $('#pergunta-aprovacao').attr('checked', false);\\n break;\\n\\n case 'usuario':\\n listarMenu(dados);\\n listarDepartamentos();\\n listarAcesso();\\n break;\\n default:\\n break;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc0d25569a56661a1e3ef9e4564c003c\",\n \"score\": \"0.5162959\",\n \"text\": \"function chooseTransType() {\\n gTrans.authorize.selectionType = 1;\\n var typeValues = (gUserInfo.lang == 'EN') ? CONST_TRANS_BATCH_TRANS_TYPE_EN :\\n CONST_TRANS_BATCH_TRANS_TYPE_VN;\\n var typeKeys = CONST_TRANS_BATCH_TRANS_TYPE;\\n dialogInit();\\n showDialogList(CONST_STR.get('COM_CHOOSEN_TYPE_TRANS'), typeValues, typeKeys, false);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5551f2163dc93c519ac4b6d113b9ad5d\",\n \"score\": \"0.51542616\",\n \"text\": \"function promptMSG(type, messages, title, btn_type, set_delay, addClassOpen, callBackYes) {\\n var prompt_delay = (set_delay === true ? true : false);\\n var addClassModalOpen = ((addClassOpen === true || addClassOpen === null) ? true : false);\\n var msg, titleh = '';\\n var modal_type = \\\"mif-modal-warning\\\";\\n var result;\\n var button_type = function (btn_type) {\\n if (btn_type == 'yn') {\\n return '<button type=\\\"button\\\" class=\\\"btn btn-sm btn-danger btn-yes\\\" >Yes</button> <button type=\\\"button\\\" class=\\\"btn btn-sm btn-primary\\\" data-dismiss=\\\"modal\\\">No</button>';\\n } else {\\n return '<button type=\\\"button\\\" class=\\\"btn btn-xs btn-danger\\\" data-dismiss=\\\"modal\\\">Close</button>';\\n }\\n };\\n\\n if (type == \\\"warning\\\") {\\n msg = \\\"<strong>Warning!</strong> \\\" + messages;\\n titleh = \\\"<i class='fa fa-warning'></i>\\\";\\n }\\n if (type == \\\"danger\\\") {\\n msg = \\\"<strong>Authentication failed!</strong></br>Please Reload or Relogin your account.\\\";\\n titleh = \\\"<i class='glyphicon glyphicon-fire'></i>\\\";\\n modal_type = \\\"mif-modal-danger\\\";\\n }\\n if (type == \\\"success-add\\\") {\\n msg = messages + \\\" Has Been Successfuly Added.\\\";\\n titleh = \\\"<i class='glyphicon glyphicon-check'></i>\\\";\\n modal_type = \\\"mif-modal-success\\\";\\n }\\n if (type == \\\"success-retrieve\\\") {\\n msg = messages + \\\" Has Been Successfully Moved to </br><strong>Current page</strong>.\\\";\\n titleh = \\\"<i class='glyphicon glyphicon-check'></i>\\\";\\n modal_type = \\\"mif-modal-success\\\";\\n }\\n if (type == \\\"success-update\\\") {\\n msg = messages + \\\" Has Been Successfuly Updated.\\\";\\n titleh = \\\"<i class='glyphicon glyphicon-check'></i>\\\";\\n modal_type = \\\"mif-modal-success\\\";\\n }\\n if (type == \\\"remove\\\") {\\n msg = messages + \\\" Has Been Moved to <strong>Archive page</strong>.\\\";\\n titleh = \\\"<i class='glyphicon glyphicon-fire'></i>\\\";\\n modal_type = \\\"mif-modal-danger\\\";\\n }\\n if (type == \\\"success-custom\\\") {\\n msg = messages;\\n titleh = \\\"<i class='glyphicon glyphicon-check'></i>\\\";\\n modal_type = \\\"mif-modal-success\\\";\\n }\\n if (type == \\\"custom\\\") {\\n msg = messages;\\n titleh = title;\\n }\\n\\n var template = '<div class=\\\"modal fade mif-modalPromptMSG ' + modal_type + '\\\" id=\\\"modalPromptMSG\\\" data-backdrop=\\\"static\\\" data-keyboard=\\\"true\\\" tabindex=\\\"-1\\\" role=\\\"dialog\\\" aria-labelledby=\\\"modaPromptMSG\\\">' +\\n '<div class=\\\"modal-dialog\\\" role=\\\"document\\\"> ' +\\n '<div class=\\\"modal-content\\\">' +\\n '<div class=\\\"modal-header\\\">' +\\n '<button type=\\\"button\\\" class=\\\"close\\\" data-dismiss=\\\"modal\\\" aria-label=\\\"Close\\\"><span aria-hidden=\\\"true\\\">×</span></button>' +\\n '<div class=\\\"modal-title\\\" id=\\\"modaPromptMSG\\\">' + titleh + '</div>' +\\n '</div>' +\\n '<div class=\\\"modal-body text-center\\\">' + msg +\\n '</div>' +\\n '<div class=\\\"modal-footer text-center\\\">' + button_type(btn_type) +\\n '</div>' +\\n '</div>' +\\n '</div>' +\\n '</div>';\\n\\n $(\\\".displayPromptMSG\\\").html(template);\\n\\n var delayPrompt = (function () {\\n var timer = 0;\\n return function () {\\n window.clearTimeout(timer);\\n timer = window.setTimeout(function () { $(\\\"#modalPromptMSG\\\").modal('hide'); }, 5000);\\n };\\n })();\\n\\n if ($(\\\".displayPromptMSG\\\").children() != '') {\\n $(\\\"#modalPromptMSG\\\").modal('show');\\n\\n if (prompt_delay === true) {\\n delayPrompt();\\n }\\n if (addClassModalOpen === true) {\\n $(\\\"#modalPromptMSG\\\").on('hidden.bs.modal', function () { // For tuning, must check if the last modal active.\\n $(\\\"body\\\").addClass('modal-open');\\n });\\n }\\n\\n }\\n //Callback function if Yes button is clicked.\\n if (btn_type == 'yn' && btn_type != undefined && btn_type != null && btn_type != '') {\\n $(\\\".btn-yes\\\").click(function (e) {\\n e.preventDefault();\\n callBackYes();\\n });\\n }\\n\\n return $(template);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d743d3b00728368c81728500203be775\",\n \"score\": \"0.5147503\",\n \"text\": \"function getipo(tipo){\\n\\t//console.log(tipo);\\n\\treloadtable(tipo);//reload na tabela com as mensagens da nova linguagem pedida\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba19c6f440e1b7922b074d0089a317f6\",\n \"score\": \"0.51473045\",\n \"text\": \"function abrir_modal_apuestaproposimple(idevento, idelementoa, idelementob, vidclase, comision, descriplugar) {\\n\\n var metodo = \\\"modal_comprarpropuesta_simple\\\";\\n\\n if ($('#iddoy').val() == '') {\\n // $(\\\"#botonera\\\").html(\\\"<div id='botcan' class='modalb' onclick='ocultarmodal(\\\" + \\\"'\\\" + metodo + \\\"');'>Cancelar</div>\\\");\\n // $(\\\"#mycontenido\\\").html('Debe asignar la cantidad de puntos que da!!');\\n // $('#modal_comprarpropuesta_simple').show();\\n // return false;\\n $('#iddoy').val(0);\\n }\\n\\n if ($('#iddoy').val() == ',' || $('#iddoy').val() == \\\"'\\\") {\\n $(\\\"#botonera\\\").html(\\\"<div id='botcan' class='modalb' onclick='ocultarmodal(\\\" + \\\"'\\\" + metodo + \\\"');'>Cancelar</div>\\\");\\n $(\\\"#mycontenido\\\").html('La formato de los puntos dados es inavlido!!');\\n $('#modal_comprarpropuesta_simple').show();\\n return false;\\n }\\n\\n if ($('#idmonto').val() == '' || $('#idmonto').val() == ',') {\\n $(\\\"#botonera\\\").html(\\\"<div id='botcan' class='modalb' onclick='ocultarmodal(\\\" + \\\"'\\\" + metodo + \\\"');'>Cancelar</div>\\\");\\n $(\\\"#mycontenido\\\").html('El monto es requerido!!');\\n $('#modal_comprarpropuesta_simple').show();\\n return false;\\n }\\n\\n if (solounacoma($('#idmonto').val()) > 1 || $('#idmonto').val() == \\\"'\\\") {\\n $(\\\"#botonera\\\").html(\\\"<div id='botcan' class='modalb' onclick='ocultarmodal(\\\" + \\\"'\\\" + metodo + \\\"');'>Cancelar</div>\\\");\\n $(\\\"#mycontenido\\\").html('El formato del monto es inavlido!!');\\n $('#modal_comprarpropuesta_simple').show();\\n return false;\\n }\\n\\n if (DN($(\\\"#idmonto\\\").val()) == 0) {\\n $(\\\"#botonera\\\").html(\\\"<div id='botcan' class='modalb' onclick='ocultarmodal(\\\" + \\\"'\\\" + metodo + \\\"');'>Cancelar</div>\\\");\\n $(\\\"#mycontenido\\\").html('El monto Apostar es requerido!!');\\n $('#modal_comprarpropuesta_simple').show();\\n return false;\\n }\\n\\n var x = DN($(\\\"#idmonto\\\").val());\\n // var vganar = DN($(\\\"#idmonto\\\").val()) - ((DN($(\\\"#idmonto\\\").val()) * comision) / 100);\\n //----------------\\n var base = $('#proporcion').val();\\n var myArray = base.split('#');\\n var pagopan = myArray[0];\\n var ganopan = myArray[1];\\n var megan0 = (DN($(\\\"#idmonto\\\").val()) * ganopan) / pagopan;\\n\\n var comi = (megan0 * comision) / 100;\\n megan0 = megan0 - (megan0 * comision) / 100;\\n //------------\\n var vganar = megan0;\\n $('#botonera').html(\\\"\\\");\\n $(\\\"#botonera\\\").html(\\\"<div id='botok' class='modalb' onclick='ir_compraproposicionsimple(\\\" + idevento + \\\",\\\" + idelementoa + \\\",\\\" + idelementob + \\\",\\\" + vidclase + \\\");'>Confirmar Apuesta</div><div id='botcan' class='modalb' onclick='ocultarmodal(\\\" + \\\"'\\\" + metodo + \\\"');'>Cancelar</div>\\\");\\n\\n try {\\n bonsal = $('#idsaldobono1 span').html().replace('.', \\\"\\\");\\n bonsal = bonsal.replace(',', \\\".\\\");\\n if (bonsal > 0) {\\n $(\\\"#botonera\\\").prepend(`\\n <div style=\\\"float: left; padding: 3px;\\\">\\n <input type=\\\"checkbox\\\" value='false' id=\\\"cbox2\\\" style=\\\"cursor: initial; display: inline-block;\\\"><label for=\\\"cbox2\\\">Utilizar Bono</label>\\n </div>\\n `);\\n }\\n } catch (error) { console.log('e') }\\n\\n $(\\\"#mycontenido\\\").html('<p>Su apuesta es de Bs: ' + $(\\\"#idmonto\\\").val() + \\\" Para Ganar Bs: \\\" + FN(vganar) + '<p>');\\n $('#modal_comprarpropuesta_simple').show();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b12edf63595d072b33300639626ca741\",\n \"score\": \"0.5129792\",\n \"text\": \"function openModal() {\\n\\t//inicializar el modal que sea nuevo rol\\n\\tdocument.querySelector('#idRol').value = '';//limpiar el value del input hiden del modal\\n\\tdocument.querySelector('#titleModal').innerHTML = 'Nuevo Rol';\\n\\tdocument.querySelector('.modal-header').classList.replace('headerUpdate', 'headerRegistrer');\\n\\tdocument.querySelector('#btnActionForm').classList.replace('btn-info', 'btn-primary');\\n\\tdocument.querySelector('#btnText').innerHTML = 'Guardar';\\n\\tdocument.querySelector('#formRol').reset();\\n\\t$(\\\"#modalRol\\\").modal(\\\"show\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78f38a44728174716a7d526709fa320e\",\n \"score\": \"0.5124426\",\n \"text\": \"function OpenModal() {\\n\\n limpiar();\\n cambiar_color_obtener();\\n $(\\\".modal-title\\\").text(\\\"Registrar Categoria\\\");\\n $('#modal-categoria').modal('show');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f713e8d82a954d5924a5352fa6866099\",\n \"score\": \"0.5124421\",\n \"text\": \"onConfirmModal(registro) {\\n if (!registro) {\\n return;\\n }\\n this.onChange({\\n target: {\\n value: registro[this.props.chave],\\n },\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92c19f434f9885d16b8d874fe79ad267\",\n \"score\": \"0.512287\",\n \"text\": \"presentProfSearchModal(select) {\\n return Object(tslib__WEBPACK_IMPORTED_MODULE_0__[\\\"__awaiter\\\"])(this, void 0, void 0, function* () {\\n const modal = yield this.modalController.create({\\n component: src_app_pages_components_search_modal_search_modal_component__WEBPACK_IMPORTED_MODULE_6__[\\\"SearchModalComponent\\\"],\\n componentProps: {\\n options: this.getProfs().map((prof) => {\\n return {\\n label: prof.label,\\n value: prof.valore\\n };\\n }),\\n title: 'Seleziona'\\n },\\n cssClass: 'app-modal'\\n });\\n modal.onWillDismiss().then((modal) => {\\n if (modal.data) {\\n const value = modal.data;\\n const index = this.getProfs().findIndex((prof) => prof.valore === value);\\n select.value = {\\n index: index,\\n value: value\\n };\\n }\\n });\\n yield modal.present();\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"070ceebc9bd012a9e239cb1dfb915fbc\",\n \"score\": \"0.51167715\",\n \"text\": \"changeStatus () {\\n Actions.selectStatus()\\n this.toggleModal()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bce60ffe29872a4e1f30cb35a237e0e9\",\n \"score\": \"0.5115488\",\n \"text\": \"function click(d) {\\n\\n if (curModal == \\\"echo\\\") {\\n var modal = document.getElementById(\\\"myModalECHO\\\");\\n modal.style.display = \\\"block\\\"; //change display to block so that it appears\\n\\n var span = document.getElementById(\\\"closeECHO\\\");\\n span.onclick = function() {\\n var modal = document.getElementById(\\\"myModalECHO\\\");\\n modal.style.display = \\\"none\\\"; //change display to none when X is clicked\\n }\\n }\\n\\n if (curModal == \\\"bulb\\\") {\\n var modal = document.getElementById(\\\"myModalBULB\\\");\\n modal.style.display = \\\"block\\\"; //change display to block so that it appears\\n\\n var span = document.getElementById(\\\"closeBULB\\\");\\n span.onclick = function() {\\n var modal = document.getElementById(\\\"myModalBULB\\\");\\n modal.style.display = \\\"none\\\"; //change display to none when X is clicked\\n }\\n }\\n\\n if (curModal == \\\"roomba\\\") {\\n var modal = document.getElementById(\\\"myModalROOMBA\\\");\\n modal.style.display = \\\"block\\\"; //change display to block so that it appears\\n\\n var span = document.getElementById(\\\"closeROOMBA\\\");\\n span.onclick = function() {\\n var modal = document.getElementById(\\\"myModalROOMBA\\\");\\n modal.style.display = \\\"none\\\"; //change display to none when X is clicked\\n }\\n }\\n\\n if (curModal == \\\"nest\\\") {\\n var modal = document.getElementById(\\\"myModalNEST\\\");\\n modal.style.display = \\\"block\\\"; //change display to block so that it appears\\n\\n var span = document.getElementById(\\\"closeNEST\\\");\\n span.onclick = function() {\\n var modal = document.getElementById(\\\"myModalNEST\\\");\\n modal.style.display = \\\"none\\\"; //change display to none when X is clicked\\n }\\n }\\n\\n if (curModal == \\\"security\\\") {\\n var modal = document.getElementById(\\\"myModalSECURITY\\\");\\n modal.style.display = \\\"block\\\"; //change display to block so that it appears\\n\\n var span = document.getElementById(\\\"closeSECURITY\\\");\\n span.onclick = function() {\\n var modal = document.getElementById(\\\"myModalSECURITY\\\");\\n modal.style.display = \\\"none\\\"; //change display to none when X is clicked\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f83288113b042bf7d71897b5e57f9ad0\",\n \"score\": \"0.51129085\",\n \"text\": \"tipoMapa(){\\n\\t\\treturn(\\n\\t\\t\\t<View style={CreatePlanStyle.tipoPlan}>\\n\\t\\t\\t\\t<TouchableOpacity onPress={() => this.setState({tipoPlan:false, publico:true})} style={CreatePlanStyle.btnModal}> \\n\\t \\t\\t\\t<Text style={CreatePlanStyle.textModal}>CREAR PLAN PÚBLICO</Text>\\n\\t\\t\\t\\t</TouchableOpacity>\\t\\n\\t\\t\\t\\t<TouchableOpacity onPress={() => this.setState({tipoPlan:false, publico:false})} style={CreatePlanStyle.btnModal}> \\n\\t \\t\\t\\t<Text style={CreatePlanStyle.textModal}>CREAR PLAN PRIVADO</Text>\\n\\t\\t\\t\\t</TouchableOpacity>\\t\\n\\t\\t\\t</View>\\n\\t\\t)\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e29ca9241783b7aff911583004a835e2\",\n \"score\": \"0.51097465\",\n \"text\": \"function SetMovmentType(type : int)\\n{\\n\\tmovmentType = type;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8405d38cc5aef5822a84913174de7c1a\",\n \"score\": \"0.509172\",\n \"text\": \"static get CONT_TYPES() {\\n return {\\n JSON : \\\"application/json\\\",\\n FORM_DATA : \\\"multipart/form-data\\\",\\n OCT_STREAM : \\\"application/octet-stream\\\"\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a34eb0acaea084785146f96fbdd5302f\",\n \"score\": \"0.5089995\",\n \"text\": \"closeModal()\\n {\\n this.edit=false;\\n this.isModalOpen=false;\\n this.isMore=false;\\n this.newRecord=false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8acdd39c694670cf794f8791c4324df1\",\n \"score\": \"0.50889885\",\n \"text\": \"function hideLyricsOrVideoModal(type) {\\n if (type === 'lyrics') {\\n var className = 'lyrics';\\n } else {\\n var className = 'player';\\n }\\n\\n document.querySelector('.'+className+'-container .modal-inner-container').classList.remove('out');\\n\\n setTimeout(function() {\\n document.querySelector('.'+className+'-container').classList.add('hidden');\\n }, 150);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"457c9bafaae7fed57b7ed864d7fba226\",\n \"score\": \"0.5078138\",\n \"text\": \"function MasInformacionProveedor(idconsecutivo,posicion) {\\n\\n document.getElementById('DetalleModalProveedortitle').innerHTML = 'Contacto de la Orden ' + datosordenproveedor[posicion].Codigo_Solicitud_Ciklos + ' - ' + idconsecutivo;\\n\\n document.getElementById('lblpacientePro').innerHTML = datosordenproveedor[posicion].Id_Afiliado;\\n document.getElementById('lblpacientenombre').innerHTML = datosordenproveedor[posicion].NombreCompleto;\\n document.getElementById('lblcontacto').innerHTML = datosordenproveedor[posicion].Contacto;\\n document.getElementById('lblestado').innerHTML = datosordenproveedor[posicion].EstadoProveedor;\\n document.getElementById('lblobgene').innerHTML = datosordenproveedor[posicion].ObservacionesGen;\\n document.getElementById('lblfechaciklos').innerHTML = datosordenproveedor[posicion].Fecha_Registro_Solicitud\\n document.getElementById('lblprofesionalsol').innerHTML = datosordenproveedor[posicion].ProfesionalSolicita;\\n document.getElementById('lbldetalleciklos').innerHTML = datosordenproveedor[posicion].Descripcion;\\n //document.getElementById('lblobaud').innerHTML = datosordenproveedor[posicion].ObservacionesAud; \\n\\n $(\\\"#DetalleModalProveedor\\\").modal();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"316113f21ad55326a66e263c3b511d7f\",\n \"score\": \"0.507803\",\n \"text\": \"selectIcon(type){\\n const inputs = this.state.inputs;\\n this.setState({ inputs: { ...inputs, icon: type } });\\n this.closeModal();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c49fcad2eef8ce1895b71b46e523050\",\n \"score\": \"0.5076032\",\n \"text\": \"function levantaPopup(){\\n\\n\\tvar option = { \\n\\t\\t\\t\\t\\ttitle:\\\"Comprobación de Aprobación\\\",\\n\\t\\t\\t\\t\\tallowMaximize:false,\\n\\t\\t\\t\\t\\tshowMaximized:false,\\n\\t\\t\\t\\t\\tshowClose:false,\\n\\t\\t\\t\\t\\t//autoSize:true,\\n\\t\\t\\t\\t\\t//width:515,\\n\\t\\t\\t\\t\\twidth:500,\\n\\t\\t\\t\\t\\theight:160,\\n\\t\\t\\t\\t\\tscroll:0,\\n\\t\\t\\t\\t\\targs: {\\t\\n\\t\\t\\t\\t\\t\\t\\testado:'VI'\\t\\n\\t\\t\\t\\t\\t\\t },\\n\\n\\t\\t\\t\\t\\t//center:1,resizable:1,scroll:0,status:0,maximize:1,minimize:1,\\n\\t\\t\\t\\t\\tdialogReturnValueCallback: callbackMethod,\\n\\t\\t\\t\\t\\turl:urlPantallaComprobacion+'?ID='+iniciativaID\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tSP.UI.ModalDialog.showModalDialog(option);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83a90e4c42631c4f6de471f35f573418\",\n \"score\": \"0.5074421\",\n \"text\": \"function goUpdateFindTypeMenuItems() {\\n goUpdateCommand(\\\"cmd_findTypeText\\\");\\n goUpdateCommand(\\\"cmd_findTypeLinks\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c4698a671f2baa0b74d38c74ca0dbf4\",\n \"score\": \"0.5072567\",\n \"text\": \"function afterClickReturnSelectBox(){\\r\\n var typeName = document.getElementById(\\\"returnType\\\").value;\\r\\n if(typeName==\\\"void\\\" || typeName==\\\"Double\\\" || typeName==\\\"Byte\\\" || typeName==\\\"Float\\\" || typeName==\\\"Boolean\\\" || typeName==\\\"Character\\\" || typeName==\\\"Integer\\\" || typeName==\\\"Short\\\" || typeName==\\\"Long\\\" || typeName==\\\"String\\\" || typeName==\\\"double\\\" || typeName==\\\"byte\\\" || typeName==\\\"float\\\" || typeName==\\\"boolean\\\" || typeName==\\\"char\\\" || typeName==\\\"int\\\" || typeName==\\\"short\\\" || typeName==\\\"long\\\"){\\r\\n return;\\r\\n }else if(typeName==\\\"list\\\"){ \\r\\n showWin();\\r\\n }else if(typeName==\\\"map\\\"){\\r\\n showWinMAP();\\r\\n }else if(typeName==\\\"stack\\\"){\\r\\n showWinStack();\\r\\n }else if(typeName==\\\"array\\\"){\\r\\n showWinArray();\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9605689b30fbc9fcd514304313b7740\",\n \"score\": \"0.5072523\",\n \"text\": \"openCloseModal() {\\n if (this.carrello.length < 1 && !this.toggleModal) {\\n alert('Attenzione! Carrello vuoto!')\\n\\n } else {\\n this.toggleModal = !this.toggleModal\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"638298edacd8b054325e3daeb36d18f0\",\n \"score\": \"0.5072007\",\n \"text\": \"function open_asset(type)\\n{\\n hide_assets_menu();\\n show('assets_modal_back');\\n var asset_input = document.getElementsByClassName(type);\\n for (var i = 0; i < asset_input.length; i++)\\n {\\n asset_input[i].style.display = \\\"block\\\";\\n }\\n return;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee5a27c0c3a0b70a3e9df6f04b7c84aa\",\n \"score\": \"0.5071376\",\n \"text\": \"function sendMails( type )\\n\\t\\t{\\n\\t\\t\\tvar modalInstance = $uibModal.open( {\\n\\t\\t\\t\\ttemplateUrl: '/modules/auction/client/views/mail.client.modal.html'\\n\\t\\t\\t\\t,controller: 'SendEmailsClientController'\\n\\t\\t\\t\\t,controllerAs: 'vm'\\n\\t\\t\\t\\t,resolve: {\\n\\t\\t\\t\\t\\tmailObj: function(){\\n\\t\\t\\t\\t\\t\\tvar obj = {\\n\\t\\t\\t\\t\\t\\t\\tproject_id: vm.auction.project_id\\n\\t\\t\\t\\t\\t\\t\\t,message: ''\\n\\t\\t\\t\\t\\t\\t\\t,subject: ''\\n\\t\\t\\t\\t\\t\\t\\t,dialogTitle: 'Send emails'\\n\\t\\t\\t\\t\\t\\t};\\n\\t\\t\\t\\t\\t\\tswitch( type ){\\n\\t\\t\\t\\t\\t\\t\\tcase 2:\\n\\t\\t\\t\\t\\t\\t\\t\\tobj.dialogTitle = 'Pause of Auction Emails';\\n\\t\\t\\t\\t\\t\\t\\t\\tobj.subject = 'Pausing auction';\\n\\t\\t\\t\\t\\t\\t\\t\\tobj.message = 'Auction of ' + vm.auction.project.project_name + ' was paused';\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\tcase 3:\\n\\t\\t\\t\\t\\t\\t\\t\\tobj.dialogTitle = 'Resume of Auction Emails';\\n\\t\\t\\t\\t\\t\\t\\t\\tobj.subject = 'Resuming auction';\\n\\t\\t\\t\\t\\t\\t\\t\\tobj.message = 'Auction of ' + vm.auction.project.project_name + ' was resumed';\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\tcase 4:\\n\\t\\t\\t\\t\\t\\t\\t\\tobj.dialogTitle = 'Auction Cancel Emails';\\n\\t\\t\\t\\t\\t\\t\\t\\tobj.subject = 'Cancelling auction';\\n\\t\\t\\t\\t\\t\\t\\t\\tobj.message = 'Auction of ' + vm.auction.project.project_name + ' was cancelled!';\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\treturn obj;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} );\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e379bdfeae6668a239ce6b2f4861aa8\",\n \"score\": \"0.5069784\",\n \"text\": \"function generateSuccessModal(modalId, footerType, modalButtonId, modalMessage, modalButtonNoId) {\\n $('.modal_success_template').attr('id', modalId);\\n $('.modal_success_template .modal-content .modal-body p').html(modalMessage);\\n\\n if (footerType === 1) {\\n $('.modal_success_template .modal-content .modal-footer').html('<button type=\\\"button\\\" id=\\\"' + modalButtonId + '\\\" class=\\\"btn btn-outline pull-right\\\" data-dismiss=\\\"modal\\\">Yes</button><button type=\\\"button\\\" id=\\\"' + modalButtonNoId + '\\\" class=\\\"btn btn-outline pull-right\\\" data-dismiss=\\\"modal\\\"> No</button>');\\n $('#' + modalId).modal();\\n\\n } else if (footerType === 2) {\\n $('.modal_success_template .modal-content .modal-footer').html('<button type=\\\"button\\\" id=\\\"\\\" class=\\\"btn btn-outline pull-right\\\" data-dismiss=\\\"modal\\\">Ok</button>');\\n $('#' + modalId).modal();\\n\\n }\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":97,"cells":{"query_id":{"kind":"string","value":"e648e577c4f5dcfb9b76e91c18e53098"},"query":{"kind":"string","value":"override to do stuff right before we fetch"},"positive_passages":{"kind":"list like","value":[{"docid":"6af8e2fc8bb5a39f1999d239baefb4a3","score":"0.70543426","text":"async preFetchHook () {\n\t}","title":""}],"string":"[\n {\n \"docid\": \"6af8e2fc8bb5a39f1999d239baefb4a3\",\n \"score\": \"0.70543426\",\n \"text\": \"async preFetchHook () {\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"33cb2aca61a6c44fda9d829b9eac6fea","score":"0.6104147","text":"function potentiallyCORSEnabledFetch(urlObj) {\n // TO BE IMPLEMENTED\n establishTheConnection();\n }","title":""},{"docid":"a2c4bc696750a483a43e06a886a5902b","score":"0.60896736","text":"function fetchDataIfNeeded() {\n if (needed) {\n typeaheadData.get(scope.url, scope.parserName, function(items) {\n scope.items = items;\n needed = false;\n });\n }\n }","title":""},{"docid":"1a758fd44d328bb1909d813e84a54d0a","score":"0.60774547","text":"async postFetchHook () {\n\t}","title":""},{"docid":"9cabb13f34c680b3677af4ac4244d37d","score":"0.606378","text":"function fetch(){\n engine.common.tell('fetching',log);\n build();\n}","title":""},{"docid":"5bb4c74b509824d75eb9f7740a99fbac","score":"0.6038766","text":"loadInitialData() {\n dispatch(me())\n dispatch(fetchCategories())\n dispatch(fetchProducts())\n dispatch(fetchCart())\n dispatch(fetchOrders())\n dispatch(fetchReviews())\n }","title":""},{"docid":"556e6da7717154a167149a9b35f5ae6f","score":"0.6004092","text":"fetch(callback) {\n var storageKey = '/backend/alignments';\n var maybeCachedResponse = JSON.parse(localStorage.getItem(storageKey));\n\n // cached data available, use\n if (maybeCachedResponse) {\n this.attributes = maybeCachedResponse;\n callback(null, maybeCachedResponse);\n // not in cache, fetch and set for next time\n } else {\n super.fetch((err, resp) => {\n callback(err, resp);\n localStorage.setItem(storageKey, JSON.stringify(resp));\n });\n }\n }","title":""},{"docid":"e65f4f41723b115d727f56ddb1d09488","score":"0.5987267","text":"preExecute() {\n\t\t// Overwrite this...\n\t}","title":""},{"docid":"5ae8a0f740e07032717dccd45d35f75c","score":"0.5942823","text":"fetchData() {\n this.makeRequest(this.endpoint, this.credentials).then(this.processData);\n }","title":""},{"docid":"bf33011e285f1deb4db285837c6f5f60","score":"0.59405506","text":"shouldFetch(/* state, args */) { return true; }","title":""},{"docid":"49b30f3d582a1bc12dea44e5ec2f94d0","score":"0.5933542","text":"_wrapFetch() {\n if (!utils.supportsNativeFetch()) {\n return;\n }\n\n utils.addInstrumentationHandler('fetch', (handlerData) => {\n const { response, args } = handlerData;\n const [requestInfo, requestInit] = args ;\n\n if (!response) {\n return;\n }\n\n this._fetchResponseHandler(requestInfo, response, requestInit);\n });\n }","title":""},{"docid":"eea2afd031bc5d8cb6fbcaa76f28de9a","score":"0.59234715","text":"init() {\n\t\tthis.replaceData(\n\t\t\tthis.manager.get(\"noReq\"),\n\t\t\tthis.endpoints.get,\n\t\t\tthis.data.get\n\t\t);\n\t}","title":""},{"docid":"41e486b665b5ecf162c540ef5d5b1949","score":"0.586008","text":"shouldFetch(state) {\n return true\n }","title":""},{"docid":"1af8f26d0989b9b97e4ed94e8daf5ca2","score":"0.5812639","text":"beforeHandling() {\n\t\t//\n\t}","title":""},{"docid":"f90ce6e503164669d5db2f74fd2877a7","score":"0.58025205","text":"preFetch() {\n this.busy = true;\n this.refresh_btn_text = 'Refreshing';\n }","title":""},{"docid":"062f9442f02e979f8a1b4d5596e5d551","score":"0.579772","text":"UNSAFE_componentWillMount() {\n this.doFetching(this.props);\n }","title":""},{"docid":"b5ee922455fff2a71e91bae50cf2b0d0","score":"0.57655114","text":"before (callback) {\n\t\tBoundAsync.series(this, [\n\t\t\tsuper.before,\t// do the usual test prep\n\t\t\tthis.updateStream,\t// perform the actual join\n\t\t\tthis.setFetchPath\n\t\t], callback);\n\t}","title":""},{"docid":"81e318233f53f45951c83b3dfb57508f","score":"0.5721051","text":"doFetch() {\n const cache = this.atlasOptions.cache;\n\n // if state is crystalline then first request\n if (!this.state.data && !this.state.error && !this.state.loading) {\n this.setState({ loading: true });\n return new Promise(resolve => {\n const unsubscribe = this.fetchHandler.subscribe(atlasResponse => {\n if (atlasResponse.ok) {\n this.setState({ data: atlasResponse.data });\n } else {\n this.setState({ error: atlasResponse.error });\n }\n unsubscribe();\n resolve(atlasResponse);\n });\n });\n }\n\n // batching\n if (this.state.loading) {\n return new Promise(resolve => this.fetchHandler.subscribe(resolve));\n }\n\n // caching\n if (cache) {\n return Promise.resolve(this.fetchHandler.lastResponse);\n }\n\n // no caching\n return this.refetch();\n }","title":""},{"docid":"2d24f3be85f3031275dece389ee293b4","score":"0.5718629","text":"petFetch(){\t\n\t\tlet self = this\n\t\t// get the data from the services\n\t\tpetService.fetch()\n\t\t.then( (response)=> {\n\t\t\t// send data to be manipulated before store in the state\n\t\t\tself.handleData(response)\n\t\t})\n\t\t.catch(function(error) {\n\t\t\t// the services have some issues in the moment to retrive data\n\t\t\t// if this happens the sistem will call the service again \n\t\t\tself.componentWillMount()\n\t\t\tconsole.log('Looks like there was a problem: \\n', error);\n\t\t})\n\t}","title":""},{"docid":"1e1baa2e65836c1d0ca7fcb3fbeaa8d8","score":"0.5711178","text":"function maybeFetch() {\n\t\t\tif ( context.data.$textbox.val() !== context.data.prevText ) {\n\t\t\t\tcontext.data.prevText = context.data.$textbox.val();\n\t\t\t\tif ( typeof context.config.fetch == 'function' ) {\n\t\t\t\t\tcontext.config.fetch.call( context.data.$textbox, context.data.$textbox.val() );\n\t\t\t\t}\n\t\t\t}\n\t\t}","title":""},{"docid":"2a855fd9427094a79a0ba4b5be4f54e2","score":"0.56440806","text":"checkParamsAndFetch() {\n // Fetch param values if present\n let id = this.getURLParamsByName('id', window.location.href);\n let url = this.getURLParamsByName('url', window.location.href);\n\n // Do not fetch a random song if an id was already provided\n if (id) // id takes takes precedence\n this.streamSong(id);\n else if (url)\n this.curPlayer.load(url); // Load the song by url (Widget API takes care of the rest)\n else\n this.fetchNext();\n }","title":""},{"docid":"36ecaead9f75cd2f5b06ab0e5295a9cb","score":"0.5607061","text":"fill() {\n\t\tthis.lazyInit();\n\t\twhile (this.fetch(1000) === 1000) {\n\t\t\tcontinue;\n\t\t}\n\t}","title":""},{"docid":"dea2cb2ca375f795d69c1f74e91421ed","score":"0.55793244","text":"componentDidMount() {\n // if loaded flag is already true we don't need to query the API again\n if (!this.props.loaded) {\n this.props.handleLoad();\n }\n }","title":""},{"docid":"33f0868a29be4576bc8fb57d41d91a81","score":"0.55770785","text":"beforeLazyload () {}","title":""},{"docid":"9a0082e0111c0a44d7ed1e3af2a994dc","score":"0.55691063","text":"async fetch () {\n\t\tconst { func, query, queryOptions, fetchNothing } = this.queryAndOptions;\n\t\tif (fetchNothing) {\n\t\t\t// the derived class might \"know\" that we're not going to fetch anything, so\n\t\t\t// don't bother running a query\n\t\t\tthis.models = [];\n\t\t\treturn;\n\t\t}\n\t\t// run the query and get our models\n\t\tthis.models = await this.data[this.module.collectionName][func](query, queryOptions);\n\t}","title":""},{"docid":"879484f136339ab4cd0404901ece9b7f","score":"0.5557063","text":"async preQueryHook () {\t\t\n\t}","title":""},{"docid":"0799aa9a61361c7e64545ac0fc7f2514","score":"0.55556136","text":"prepareBaseData() { super.prepareBaseData(); }","title":""},{"docid":"07046364572d06f5e6ad7917a5ad8b6b","score":"0.5551321","text":"markFetched(follow) {\n if (follow.response) {\n this.fetched[follow.id] = Object.assign(follow.response,\n {at: new Date(), delay: 0.5 + (Math.random() * 0.5)})\n this.localSet('fraidycat', {fetched: this.fetched})\n delete follow.response\n }\n }","title":""},{"docid":"06167f5f8ca06442860f5ab559fa36b5","score":"0.55498314","text":"shouldFetch(state) {\n return true\n }","title":""},{"docid":"784f2de3d982217a3c4216a2c48daea6","score":"0.5535287","text":"function fetch_and_update() {\n fetch_items()\n .then(process_items)\n .then(update_display);\n }","title":""},{"docid":"bd7827d2f92b42a3c632b56db4e725f5","score":"0.5512985","text":"componentDidMount() {\r\n this.fetchData(null)\r\n }","title":""},{"docid":"e28ee2110e5f324ad6797592686d4955","score":"0.5511311","text":"function itShouldConditionalFetch() {\n console.log('> itShouldConditionalFetch');\n conditionalFetch();\n}","title":""},{"docid":"db287d9f8779f9a8a5f17ffd75304515","score":"0.5505485","text":"function _triggerFetchData() {\n if ($scope.currentPage === 1) {\n _fetchData();\n } else {\n $scope.currentPage = 1;\n }\n }","title":""},{"docid":"74198cafa834759a0b383270a4372c23","score":"0.5489967","text":"canFetch() {\n \treturn this.fetchUrl && !this.disabled && !this.has_fetched;\n }","title":""},{"docid":"82f04ed2006ee0c59271b664165b6d47","score":"0.5473279","text":"loadIfNotAlready()\n\t{\n\n\t\tif((this.state.isLoaded === false || this.state.paging === true) && this.state.isError === false)\n\t\t{\n\n if(this.loadData === undefined)\n {\n\n throw new Error(\"Load data must be defined by child component\")\n\n }\n\n\t\t\tthis.sendRequest();\n\n\t\t}\n\n\n\t}","title":""},{"docid":"5604429e5f6021e385e01ebeed9eb45b","score":"0.54730123","text":"reInitDataFetch() {\n this._objectid = (this.modeladapter.value ? this.modeladapter.value[this.modeladapter.STORE_ITEM_INDEX_PROP] : null);\n if (this._objectid)\n this.setAttribute(\"objectid\", this._objectid)\n else\n this.removeAttribute(\"objectid\");\n if (store.connected) this.connected(); else this.disconnected();\n }","title":""},{"docid":"bb6a9d153b83e5af61ec7aed4bc61da4","score":"0.54540366","text":"async fetch_data_src() {\n if (this.data_src === null) {\n console.error(\"data_src is not set\");\n return;\n }\n if (this.data !== null) {\n // i.e. we should assume it has been already fetched\n return;\n }\n let data = await this.data_src;\n this.data = data;\n return;\n }","title":""},{"docid":"f827e4ec6732eaacbcf555314df0a50e","score":"0.54380316","text":"function __setFetch(fetch) {\n nodeFetch = fetch;\n}","title":""},{"docid":"cef5e2b23e80873b68eee453ba6bbcdc","score":"0.5427756","text":"async fetch() {\n }","title":""},{"docid":"29e6195ecec42437e3c1e52403aec11b","score":"0.54258335","text":"function controlFetch() {\n fetch(`https://api.openweathermap.org/data/2.5/weather?q=${location}&units=imperial&appid=59001e1f469d421690b543e76dbf29d3`\n )\n .then((response)=>{\n // console.log(response.json());\n return response.json();\n })\n .then((json) =>{\n setFahrenheit(json.main.temp)\n setCoordLat(json.coord.lat)\n setCoordLong(json.coord.lon)\n \n // setCelsius((fahrenheit - 32) * .5556)\n \n })\n\n // fetch(tmUrl)\n // .then((response) => {\n // return response.json();\n // })\n // .then((json) => {\n // return cityEvents = json._embedded.events;\n // // cityEvents.forEach(vents => setEvents(<p>{vents.name}</p>));\n // // cityEvents.map((vents) => {\n // // setEvents(<p>{vents.name}</p>)\n // // })\n // })\n }","title":""},{"docid":"44f20d6f9639d926c0ead5468c69ca2f","score":"0.5418391","text":"function fetchItem(self) {\n self.initializing = true;\n axios.get(URL_BASE + \"/catalogo/item/\", {\n params: {\n id: window.itemInfo.id,\n type: window.itemInfo.type,\n version: window.itemInfo.version\n }\n })\n .then(function (res) {\n self.initializing = false;\n var images = JSON.parse(res.data.images);\n var item = JSON.parse(res.data.item);\n if (item.length === 0) {\n return\n }\n\n\n var data = item[0];\n self.disableApproval = data.fields.author === self.userId;\n self.item.name = data.fields.name;\n self.item.description = data.fields.description;\n self.item.thumbnail = data.fields.thumbnail;\n self.item.author = data.fields.author;\n\n self.item.images = images.map(function (img) {\n img.src = utils.getImageUrl(window.CLOUDINARY_NAME, img.remoteId);\n return img;\n });\n\n\n cargarInfo(self, res, data);\n\n })\n\n\n}","title":""},{"docid":"6d8e1ce6cb6d67c4ccfe61c93b6a43c0","score":"0.54008","text":"@autobind\n fetchEssentialData(firstFetch = false) {\n this.props\n .fetchMarket()\n .then(() => {\n if (this.props.defaultAccount) {\n this.props.fetchMarketTrades(this.props.market)\n this.props.fetchMarketShares(this.props.defaultAccount)\n }\n if (firstFetch) {\n const availableView = this.getAvailableView()\n if (availableView) {\n this.props.changeUrl(`/markets/${this.props.params.id}/${availableView}`)\n }\n }\n })\n .catch((err) => {\n console.error(e)\n this.setState({\n marketFetchError: err,\n })\n })\n\n if (this.props.hasWallet) {\n this.props.requestGasCost(GAS_COST.BUY_SHARES)\n this.props.requestGasCost(GAS_COST.SELL_SHARES)\n }\n\n if (this.props.defaultAccount && this.props.params.id) {\n this.props.fetchMarketParticipantTrades(this.props.params.id, this.props.defaultAccount)\n }\n }","title":""},{"docid":"43e669ee5f4df7397e7716e590659f00","score":"0.5400027","text":"componentWillMount () {\n this._fetchData()\n }","title":""},{"docid":"89f4885c0d6adc47285c1ff5b01e2196","score":"0.5398872","text":"loadData(){\n \n fetch(\"http://localhost:8088/people\")\n .then(r => r.json())\n .then(people => {\n this.setState({\n people: people\n })\n \n return fetch(\"http://localhost:8088/vehicles\")\n })\n .then(r => r.json())\n .then(vehicles => {\n this.setState({\n vehicles: vehicles\n })\n \n return fetch(\"http://localhost:8088/pets\")\n })\n .then(r => r.json())\n .then(pets => {\n this.setState({\n pets: pets\n })\n \n //view all collections in state\n console.log(this.state)\n })\n \n }","title":""},{"docid":"1748d01bc7ac8d61775b7600843b76c4","score":"0.53987783","text":"insertStoredContent() {\n this.fetch();\n }","title":""},{"docid":"359d9a890b16e0cee2113c44c60b0c20","score":"0.5385426","text":"static async fetch() {\n try {\n await this.git(['fetch', '--unshallow']);\n } catch (error) {\n core.warning(`Fetch --unshallow caught: ${error}`);\n await this.git(['fetch']);\n }\n }","title":""},{"docid":"31515f2fec4243fd12cb547aa960cba3","score":"0.5371918","text":"componentWillMount() { this.fetchDefaultData(this.props); }","title":""},{"docid":"1cd894d5e99ac5ed11a67e2874101ccd","score":"0.5369963","text":"function handleFetch(){\n // const handleFetch = async() = {\n //const res = await fetch(`https://api.nasa.gov/mars-photos/api/v1/rovers/curiosity/photos?sol=${sol}&api_key=NWH7j4t1TW48KAGZChs8NMz7OrkWHIIUdfmBhFFk`)\n //const nextData = await res.json()\n //setData(nextData)\n }","title":""},{"docid":"c9425cd052b9e65ad1ad1843d1dc05e9","score":"0.5368988","text":"init () {\n this.replaceData(this.manager.get(\"hostReq\"), this.endpoints.get, this.data.get);\n }","title":""},{"docid":"a3cc7c5e70da4671a3a904ef120d54a1","score":"0.5367302","text":"prepare() {}","title":""},{"docid":"135d281504f4d16774b704bdd76244a6","score":"0.5365857","text":"async init() {\n\t\tconsole.log(\"processor init\")\n\n\n\n\n\t\ttry {\n\n\t\t\tconsole.log(\"database:\" + this.store.state.database);\n\t\t\tvar xhr = new XMLHttpRequest();\n\t\t\tvar obj = this;\n\t\t\txhr.onload =\n\t\t\t\tawait\n\n\t\t\tfunction () {\n\t\t\t\tconsole.log(xhr.responseText);\n\t\t\t\tobj.fce = new Function('data', 'tf', xhr.responseText);\n\t\t\t}\n\t\t\txhr.open(\"GET\", this.url);\n\t\t\txhr.send();\n\t\t} catch (error) {\n\t\t\tconsole.log(error)\n\t\t}\n\t}","title":""},{"docid":"794e3e1d8675f8d61a10f15d5a7987ae","score":"0.53611976","text":"async function fetchData () {\n model.remoteData = \"Fetching remote data now...\"\n return continueFetchData\n}","title":""},{"docid":"7984ee5b6af48cbc97b44acce5ad52d0","score":"0.53147465","text":"_innerFetch(...params) {\n\t\treturn fetch(...params)\n\t}","title":""},{"docid":"574ae2fad9fa178f4cc50c55dccab74b","score":"0.5310971","text":"checkData() {\n const { needLoadData, setNeedLoadData, importData } = this.props;\n if (needLoadData) {\n setNeedLoadData(false);\n fetch(\"/nba.csv\")\n .then(response => {\n return response.ok ? response.text() : Promise.reject(response);\n })\n .then(rawData => {\n importData(rawData);\n })\n .catch(response => {\n console.error(response);\n });\n }\n }","title":""},{"docid":"2e848e91409529d8bc485aa46f775457","score":"0.5310706","text":"async componentDidMount() {\n /* Using try lots of thing can go wrong here. */\n try {\n /* Set loading true, and fetch error null */\n this.setState({isLoading: true, fetchError: null});\n\n\n const response = await fetch(this.props.api);\n if (!response.ok) {\n throw new Error(\"This did not work, following message was given to you: \" + response.status.toString())\n }\n\n /* Load JSON */\n const data = await response.json();\n\n /* Analysing the data */\n console.log(data);\n if (data === null) {\n throw new Error(\"Well, this can happen. It seems that there are now forms in the archive. \");\n }\n\n /* Clean up Loading done */\n this.setState({isLoading: false, data: data});\n\n } catch (error) {\n this.setState({fetchError: error.toString(), isLoading: false});\n }\n }","title":""},{"docid":"cd3f82a96351abc6f5309f05c3f4b078","score":"0.53067625","text":"fetchInitialData() {\n request.get('get-initial-data/')\n .end((err, data) => {\n AppDispatcher.dispatch({\n actionType: ProductConstants.SET_INITIAL_DATA,\n data: JSON.parse(data.text),\n });\n });\n }","title":""},{"docid":"65019be114fe8586718482e9a328c38d","score":"0.53058505","text":"componentDidMount() {\n //only fetches if there is an warehouseId, otherwise use the items passed through param\n if(this.props.warehouseId){\n fetch(`${serverURL}${warehousesEP}${this.props.warehouseId}`)\n .then(res=>{ \n if(res.status===200){\n this.setState({fetched:true});\n }else{\n this.setState({fetched:false});\n }\n return res.json()}) // javascript ternary operator '<question> ? <item1>:<item2>' that sets state to empty array in 404 response\n .then(data=> this.setState({warehouseInv:(data.items? data.items:[])}))\n //ternary that sets state.address.street to unknown if data.address comes back undefined(in a 404 response for example),address:(data.address? data.address:{street:'Unknown Warehouse', city:\"\"}),name:(data.name? data.name:\"\")}))\n .catch(err=>console.log(err))\n }\n }","title":""},{"docid":"cd83ab189c3f7dbe7a2be5bf56646d76","score":"0.5298928","text":"function _init() {\n\t\t\t// do the pre-work in here\n\t\t\t\n\t\t}","title":""},{"docid":"04a6a0a3572896ab611b76ebaacf35c4","score":"0.5294756","text":"loadData(){\n const queryString = \"https://fakerestapi.azurewebsites.net/api/Books\";\n if (queryString === this.lastQuery) {\n this.setState({ loading: false });\n return;\n }\n\n fetch(queryString)\n .then(response => response.json())\n .then(data => this.setState({\n books: data\n }))\n .catch(() => this.setState({ loading: false }));\n this.lastQuery = queryString;\n }","title":""},{"docid":"ca38d5bda7a6841198968f1a37984771","score":"0.529411","text":"async function initLoadIlliterateDonut() {\n let jsonData = new Object();\n jsonData.affectedUsers = \"Illiterate\";\n let jsonResponse = await loadDataByFetchApi(url, jsonData);\n setIlliterateDonut(jsonResponse.Total, jsonResponse.Affected);\n}","title":""},{"docid":"7457b1b43a9f405a5d4086cf0af5a58f","score":"0.5291592","text":"async function fetchPresets() {\n let res = await fetch(url);\n const data = await res.json();\n setPresetData(data.data);\n }","title":""},{"docid":"d7943d288f50838e97f69970ccbf41c4","score":"0.5286124","text":"async componentDidMount(){\n //must use try/catch for async calls\n try{\n //await the response (aka resolve) from checkFetch\n await this.context.checkFetch();\n //Finally can pass the context to the function\n let newSetup = logic.setupAlgo(this.context.employeeData, this.context.positionData, this.context.dayData);\n this.setState({\n setup: newSetup\n });\n } catch (err){\n // Error Occurred\n }\n }","title":""},{"docid":"7ee8d6714e89b50899df1b1f9db55886","score":"0.5285267","text":"async function initLoadDeafDonut() {\n let jsonData = new Object();\n jsonData.affectedUsers = \"Deaf\";\n let jsonResponse = await loadDataByFetchApi(url, jsonData);\n // console.log(jsonResponse);\n setDeafDonut(jsonResponse.Total, jsonResponse.Affected);\n}","title":""},{"docid":"d1f8995c068bdf780edc324ec30b7fbe","score":"0.5281335","text":"prefetch() {\n if (!this.p || true) return; // Prefetch the JSON page if asked (only in the client)\n\n var href = this.getHref();\n\n _router.default.prefetch(href);\n\n prefetched[href] = true;\n }","title":""},{"docid":"8acff6015228e2a0695c5c371a64a42a","score":"0.52797824","text":"function makeFetch() {\r\n if (offset == 1) {\r\n fetch(url + `?offset=${offset}&limit=${limit}`)\r\n .then(res => {\r\n if (res.ok) {\r\n return res.json();\r\n }\r\n })\r\n .then(data => {\r\n restCards.innerHTML = \"\"; //delete preloaders\r\n for (let i = 0; i < data.items.length; i++) {\r\n restInfo.push(data.items[i]);\r\n }\r\n offset += data.items.length;\r\n limit += data.items.length;\r\n total = data.total;\r\n if (offset >= data.total) {\r\n btnLoadCards.remove();\r\n }\r\n addRestCards();\r\n })\r\n .catch(err => console.log(err));\r\n } else {\r\n //create preloaders\r\n for (let i = 0; i < total - offset; i++) {\r\n restCards.insertAdjacentHTML(\"beforeend\", getPreloader());\r\n }\r\n fetch(url + `?offset=${offset}&limit=${limit}`)\r\n .then(res => {\r\n if (res.ok) {\r\n return res.json();\r\n }\r\n })\r\n .then(data => {\r\n let loadImgages = document.querySelectorAll(\".loaderImg\");\r\n loadImgages.forEach(img => {\r\n img.remove();\r\n });\r\n for (let i = 0; i < data.items.length; i++) {\r\n restInfo.push(data.items[i]);\r\n }\r\n offset += data.items.length;\r\n limit += data.items.length;\r\n if (offset >= data.total) {\r\n btnLoadCards.remove();\r\n }\r\n addRestCards();\r\n })\r\n .catch(err => console.log(err));\r\n }\r\n} //end function makeFetch","title":""},{"docid":"c1985d3d4b13e3eecdabf09b5b5ea098","score":"0.5279046","text":"constructor(fetch) {\n this.fetch = fetch;\n }","title":""},{"docid":"4f68531ba3f2217cc39419f913ab7729","score":"0.527635","text":"function initLoader() {\r\n loadPopular = loadPopular();\r\n loadNew = loadNew();\r\n query = query();\r\n suggestion = suggestion();\r\n}","title":""},{"docid":"b78ec5719d6f2351651d9e15bce7a26a","score":"0.52746075","text":"fetch({dispatch, state}) {\n if(state.fetcher.fetched) {\n return;\n }\n\n dispatch('more');\n }","title":""},{"docid":"cc322164dfcbaebefc84aede8bf0e8ea","score":"0.5272341","text":"function firstXHR_startReqRenderAndProceed(url_f){\n //console.log('dom_targetIds_arr: ', dom_targetIds_arr);\n //console.log('finalHTMLContent_arr inside firstXHR: ', finalHTMLContent_arr);\n if(useRawXHR === true){\n console.log('running useRawXHR.get');\n nonPromiseXHR.get(url_f, XHR_useFirstData);\n }\n\n if(usejQuery === true){\n //console.log('define nonPromise xhr method');\n console.log('running jQuery_Ajax');\n jQuery_Ajax.get(url_f, XHR_useFirstData);\n }\n\n if(usePromises=== true){\n promiseXHRfirst_start(url);\n }\n }","title":""},{"docid":"53339e0c54dcff933e4584a11963c3da","score":"0.5271339","text":"before(callback) {\n\t\tsuper.before(error => {\n\t\t\tif (error) { return callback(error); }\n\t\t\tthis.data.userId = ObjectId(); // substitute an ID for a non-existent user\n\t\t\tcallback();\n\t\t});\n\t}","title":""},{"docid":"e490586f308a599192a5661ba082ad9d","score":"0.5267576","text":"handlegetRequests() {\n getRequests({\n recordId: this.recordId\n })\n .then((results) => {\n this.requests = results;\n this.requestCount = results.length;\n this.isLoaded = true;\n this.rowsChecks = false;\n this.errors = undefined;\n })\n .catch((error) => {\n console.error('error handlegetRequests > ' + JSON.stringify(error));\n this.errors = JSON.stringify(error);\n });\n }","title":""},{"docid":"eb7037532f955366401630f136970ef7","score":"0.5266683","text":"loadingData() {}","title":""},{"docid":"eb7037532f955366401630f136970ef7","score":"0.5266683","text":"loadingData() {}","title":""},{"docid":"a0140a20c3b4926c7e49aa64f3679f72","score":"0.52635497","text":"getCommits() {\n this.setState({loading:true});\n let commit_url = this.props.commit_url;\n\n //Cut unnecessary part from URL\n commit_url = commit_url.substring(0, commit_url.length - 6)\n\n fetch(commit_url)\n .then(this.checkStatus)\n .then(this.parseJSON)\n \n //Successful fetch\n .then(function(data) {\n this.setState({\n commitResults: data,\n error: \"\",\n loading:false\n })\n }.bind(this))\n\n //Error handling\n .catch(function(error) {\n //console.log('request failed', error)\n this.setState({error: \"Not found\"})\n this.setState({commitResults: [] })\n }.bind(this))\n \n }","title":""},{"docid":"de750c7fb58bb3c5ec4024ffd654effd","score":"0.5256811","text":"@action fetch(options = {}) {\n // Merge in the any options with the default\n options = Object.assign({ \n url: this.url(),\n params: {},\n add: true, \n merge: true, \n remove: true \n }, options );\n\n this.setRequestLabel('fetching', true);\n\n return new Promise((resolve, reject) => {\n // Optionally the request above could also be done as\n request.get(options.url, {\n params: options.params\n })\n .then((response) => {\n this.set(response.data, { add: options.add, merge: options.merge, remove: options.remove });\n this.setRequestLabel('fetching', false);\n resolve(this, response);\n })\n .catch((error) => {\n this.setRequestLabel('fetching', false);\n reject(error);\n });\n });\n }","title":""},{"docid":"f1771e140ad8ee575a5c3ad9709ad507","score":"0.525156","text":"async firstUpdated() {\n const res = await api.get(endPoints.ARTICLES_ROUTE);\n\n this.isLoading = false;\n this.articles = res.data.articles;\n }","title":""},{"docid":"cb30540c1e60fba2b4b2420f7fc27dc9","score":"0.5246571","text":"_executeRequest(request){/**\n * dispatches fatal-error\n * @param detail\n */let fatal=detail=>{this.dispatchEvent(new CustomEvent(\"fatal-error\",{detail:detail,bubbles:!0,composed:!0}))};/**\n * Default API fetch\n * https://developer.mozilla.org/en-US/docs/Web/API/Fetch_API\n */this.isLoading=!0;this.dispatchEvent(new CustomEvent(\"request-started\",{detail:request,bubbles:!0,composed:!0}));fetch(request).then(response=>{this._reworkRequest(response)}).catch(err=>{if(\"AbortError\"===err.name){this.dispatchEvent(new CustomEvent(\"request-aborted\",{detail:request,bubbles:!0,composed:!0}));console.error(\"RequestService fetch aborted: \",err)}fatal(request)})}","title":""},{"docid":"a270bdb14300605f01f05a232fdc17b7","score":"0.52427554","text":"fetchData() {\n // gets data using predefined url above -> converts to json -> updates the state\n fetch(URL)\n .then( res => res.json())\n .then( data => {\n console.log(data);\n this.setState({\n dataSource: this.state.dataSource.cloneWithRows(data.movies),\n loaded: true,\n })\n })\n .done()\n }","title":""},{"docid":"f7a5387df0bb4c280f369831e2c3012b","score":"0.52425206","text":"async fetchData() {\n try {\n this.setState({\n responseLoaded: false\n })\n const response = await Axios.get(poloniexUrl)\n const data = response.data\n this.setState({poloniexResponse: data, responseLoaded: true})\n this.updateResults()\n } catch (error) {\n alert(\"Error in retrieving Poloniex data: \" + error)\n }\n }","title":""},{"docid":"26054ffbedd6a5ef694d6d4a89493fd8","score":"0.52385","text":"async fetchData(pathname, id, withKeys) {\n let options = {};\n if(withKeys) {\n options = {\n\n };\n }\n\n // Set loading flag\n this.loading = true;\n\n // Make a fetch request\n let { data } = await request.get(`${pathname}`, options);\n\n // data contains a results array\n try{\n data = data.results;\n } catch(err){\n console.log(err);\n }\n\n try{\n if(data){\n data.results && data.results.length > 0\n ? this.setData(data)\n : this.setSingle(data);\n }\n } catch(err){\n console.log(err);\n }\n\n // Switch loading flag\n this.loading = false;\n }","title":""},{"docid":"58c8484637c4eebdbb5a6a1854b728be","score":"0.5237585","text":"componentDidMount() { \n var self = this; \n // check if pk checked and populate update details \n if(pk){\n if(this.props.student.first_name === undefined){\n // FETCH from api \n api.retrieve(updateUrl)\n .then(data => self.props.saveStudent(data))\n .then(()=>self.fetchStudent())\n \n api.retrieve(updateUrl)\n .then(data => self.props.fetchParents(data)) \n .catch(function (error) {\n return error \n }); \n }else{self.fetchStudent()}\n }else{\n self.fetchStudent()\n }\n \n }","title":""},{"docid":"a9f517147f32259c7fe0e7e21c2872ba","score":"0.52323747","text":"_fetch(url, data) {\n if (data === undefined) {\n data = {};\n }\n\n if (!data.hasOwnProperty('headers')) {\n data.headers = {};\n }\n\n data.headers['X-API-Key'] = this.apiKey;\n\n return fetch(url, data);\n }","title":""},{"docid":"5bc75da803304da0b4ce52685b05a394","score":"0.52292013","text":"function preloadDataFetchingRecord(map, key, fetcher) {\n let record = map.get(key);\n if (!record) {\n const thenable = fetcher();\n record = createRecordFromThenable(thenable);\n map.set(key, record);\n }\n return record;\n}","title":""},{"docid":"40e29f9d3ae377a21761dfb5f518cedf","score":"0.52285737","text":"fetchData(state, { url, success, reject, silent, raise404 }) {\n if (!silent) {\n state.isRequesting = true;\n }\n\n return fetch(url)\n .then(response => {\n if (!response.ok) {\n state.notFound = true;\n\n if (raise404) {\n raise404();\n }\n return false;\n } else {\n return response.json();\n }\n })\n .then(data => {\n if (data) {\n state.notFound = false;\n\n success(data.consultant);\n\n if (!silent) {\n state.isRequesting = false;\n }\n }\n })\n .catch(error => {\n if (reject) reject(error);\n else console.log(\"error\", error);\n });\n }","title":""},{"docid":"bd896dc88453b8882f6e03d2c43d2efb","score":"0.5224186","text":"load_base_data() {\n if (this._data.ds !== null) {\n this._load_base_data(this._data.l_object);\n } else {\n this._data.object.then(this._load_base_data);\n }\n }","title":""},{"docid":"01af755bc3bd78bad6016d88fef1ddc6","score":"0.52231395","text":"componentWillMount(){\n\n //Perform API request, obtaining \"events\"\n this.retrieveData();\n\n }","title":""},{"docid":"717f9c9525fd694679c8396588a0c1fb","score":"0.5215315","text":"async function fetchData() {\n loadArtByCreation();\n loadArtBySell();\n // if (!cancel) {\n // console.log('Home data');\n // }\n }","title":""},{"docid":"2e771eb9ba8f2682b2a01b1e64d47c0e","score":"0.52128124","text":"componentDidUpdate() {\n // if loaded flag is already true we don't need to query the API again\n if (!this.props.loaded) {\n this.props.handleLoad();\n }\n }","title":""},{"docid":"37dae3913642194d28b4ca14cb2aa04c","score":"0.52077353","text":"function dummyLoad() {\n var deferred = $.Deferred();\n deferred.resolve();\n return deferred.promise();\n }","title":""},{"docid":"fa43311d7e78fb64a47684d35036a078","score":"0.520096","text":"fetchData () {\n return fetch('<URL HERE>' + this.state.itemName.toLowerCase() + '/' + this.state.pageNum)\n .then( (response) => response.json() )\n .then ( (responseJson) => {\n if(responseJson.status != \"failure\") {\n this.setState({\n isLoading: false,\n dataSource: responseJson.items\n })\n } else {\n this.setState({\n isLoading: false,\n visible: true,\n message: \"Can't find item\"\n })\n }\n })\n\n .catch((error)=> {\n console.log(error);\n });\n\n\n }","title":""},{"docid":"e453a963e18a0b6ed54f455764f7bd97","score":"0.51980245","text":"fetchData() {\n const { filter, fetchTodos } = this.props\n fetchTodos(filter).then(() => console.log('Yeah these are loaded!')) // eslint-disable-line no-console\n }","title":""},{"docid":"9eb30e724b603171f7ddbed90e6c8078","score":"0.5197588","text":"getData(source, name) {\n if(source===\"\") {this.mapData([], name);}\n fetch(source)\n .then(response => response.json())\n .then(function(json) {\n var arr = [];\n json.forEach(item => {\n arr.push(item);\n });\n this.mapData(arr, name);\n }.bind(this))\n .catch(err => console.log(err));\n }","title":""},{"docid":"3246340b97899d7b4d8747ba961c0bd5","score":"0.5196799","text":"componentWillMount() {\n this.fetchDataFromAPI(); \n }","title":""},{"docid":"01890e05c04df7edd0c0c101d2e3b6b0","score":"0.51963276","text":"function fetchData() {\n\tvar req = xhttpRequest();\n\tif (''+window.location.hostname == '') xhttpRequestFetch(req, 'xml/buddies.xml', parseData);\n\telse xhttpRequestFetch(req, 'animedb.pl?show=xml&t=buddies', parseData);\n}","title":""},{"docid":"858329bbb563e75ba41ad1648d9e7339","score":"0.5195552","text":"setStart() {\n request\n .get(`article/get/${this.state.id}`, {\n headers: {\n \"auth-token\": localStorage.getItem(\"accessToken\"),\n },\n })\n .then((response) => response.data)\n .then((data) => {\n console.log(data)\n if (data.success) {\n this.editorComponent &&\n this.editorComponent.setContent(data.returnValuesForArticle.content)\n this.updateContent(data.returnValuesForArticle.content)\n this.setState({\n loaded: true,\n title: data.returnValuesForArticle.title,\n })\n if (data.returnValuesForArticle.is_pending) {\n this.setState({\n hasPending: true,\n buttonText: \"Pending article exists\",\n })\n }\n console.log(data)\n return data\n }\n this.editorComponent && this.editorComponent.setContent(\"\")\n this.updateContent(\"\")\n this.setState({ loaded: true })\n })\n .catch((err) => {\n this.setState({ loaded: true })\n console.log(err)\n })\n }","title":""},{"docid":"97bafb290602ba163e7e693d59f17296","score":"0.5194944","text":"getData() {\n fetch(this.api)\n .then((response) => {\n let data = response.json();\n return data;\n })\n .then((data) => {\n // console.log(data)\n this.data = data;\n this.states = data.statewise.slice();\n\n // remove loader\n var preloader = document.getElementById(\"loader\");\n preloader.style.display = \"none\";\n\n // set to default sort\n this.sortRow(this.sortField, true);\n });\n }","title":""},{"docid":"80854da8f3a941f959d117bd59a115fe","score":"0.5194554","text":"getData() {\n if (this.url)\n {\n let url = `${this.url}?relativePath=${this.state.relativePath}&skipCount=${this.state.skipCount}&maxItems=${this.state.maxItems}${this.state.orderBy ? `&orderBy=${this.state.orderBy} ${this.state.orderDirection} ` : \"\"}${this.include}${this.relations}${this.includeSource}`;\n xhr.get(url)\n .then(response => {\n this.setState({\n list: response.data.list,\n relations: response.data.relations || {}\n });\n });\n }\n }","title":""},{"docid":"4b476dbf08739f939478b89930d3a480","score":"0.5193665","text":"async implementFetch (request) {\n throw (new Error('implementFetch not implemented, store is not functional'))\n }","title":""},{"docid":"c691b6dfc4f81bb468c0d2fa54852e46","score":"0.5192371","text":"function fetchPokemonData() {\r\n let name = this.id;\r\n let url = \r\n URL + \"pokedex.php?pokemon=\" + \r\n name;\r\n fetch(url, {mode: \"cors\"})\r\n .then(checkStatus)\r\n .then(JSON.parse)\r\n .then(pokemonInformation)\r\n .catch(console.log);\r\n }","title":""},{"docid":"96d2bb300d478b319027502229b1ea8d","score":"0.5190288","text":"componentWillMount() {\n\t\tthis.fetchRequestedItems()\n\t}","title":""},{"docid":"c5f551333774717a7ca77a2735f6a80b","score":"0.51846856","text":"async GetInitialLoadTransactionData() {\n const response = await fetch('Home/GetInitialLoadTransactionData');\n const data = await response.json();\n this.setState({ TransactionData: data, loading: false });\n }","title":""}],"string":"[\n {\n \"docid\": \"33cb2aca61a6c44fda9d829b9eac6fea\",\n \"score\": \"0.6104147\",\n \"text\": \"function potentiallyCORSEnabledFetch(urlObj) {\\n // TO BE IMPLEMENTED\\n establishTheConnection();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2c4bc696750a483a43e06a886a5902b\",\n \"score\": \"0.60896736\",\n \"text\": \"function fetchDataIfNeeded() {\\n if (needed) {\\n typeaheadData.get(scope.url, scope.parserName, function(items) {\\n scope.items = items;\\n needed = false;\\n });\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a758fd44d328bb1909d813e84a54d0a\",\n \"score\": \"0.60774547\",\n \"text\": \"async postFetchHook () {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9cabb13f34c680b3677af4ac4244d37d\",\n \"score\": \"0.606378\",\n \"text\": \"function fetch(){\\n engine.common.tell('fetching',log);\\n build();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bb4c74b509824d75eb9f7740a99fbac\",\n \"score\": \"0.6038766\",\n \"text\": \"loadInitialData() {\\n dispatch(me())\\n dispatch(fetchCategories())\\n dispatch(fetchProducts())\\n dispatch(fetchCart())\\n dispatch(fetchOrders())\\n dispatch(fetchReviews())\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"556e6da7717154a167149a9b35f5ae6f\",\n \"score\": \"0.6004092\",\n \"text\": \"fetch(callback) {\\n var storageKey = '/backend/alignments';\\n var maybeCachedResponse = JSON.parse(localStorage.getItem(storageKey));\\n\\n // cached data available, use\\n if (maybeCachedResponse) {\\n this.attributes = maybeCachedResponse;\\n callback(null, maybeCachedResponse);\\n // not in cache, fetch and set for next time\\n } else {\\n super.fetch((err, resp) => {\\n callback(err, resp);\\n localStorage.setItem(storageKey, JSON.stringify(resp));\\n });\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e65f4f41723b115d727f56ddb1d09488\",\n \"score\": \"0.5987267\",\n \"text\": \"preExecute() {\\n\\t\\t// Overwrite this...\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ae8a0f740e07032717dccd45d35f75c\",\n \"score\": \"0.5942823\",\n \"text\": \"fetchData() {\\n this.makeRequest(this.endpoint, this.credentials).then(this.processData);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf33011e285f1deb4db285837c6f5f60\",\n \"score\": \"0.59405506\",\n \"text\": \"shouldFetch(/* state, args */) { return true; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49b30f3d582a1bc12dea44e5ec2f94d0\",\n \"score\": \"0.5933542\",\n \"text\": \"_wrapFetch() {\\n if (!utils.supportsNativeFetch()) {\\n return;\\n }\\n\\n utils.addInstrumentationHandler('fetch', (handlerData) => {\\n const { response, args } = handlerData;\\n const [requestInfo, requestInit] = args ;\\n\\n if (!response) {\\n return;\\n }\\n\\n this._fetchResponseHandler(requestInfo, response, requestInit);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eea2afd031bc5d8cb6fbcaa76f28de9a\",\n \"score\": \"0.59234715\",\n \"text\": \"init() {\\n\\t\\tthis.replaceData(\\n\\t\\t\\tthis.manager.get(\\\"noReq\\\"),\\n\\t\\t\\tthis.endpoints.get,\\n\\t\\t\\tthis.data.get\\n\\t\\t);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41e486b665b5ecf162c540ef5d5b1949\",\n \"score\": \"0.586008\",\n \"text\": \"shouldFetch(state) {\\n return true\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1af8f26d0989b9b97e4ed94e8daf5ca2\",\n \"score\": \"0.5812639\",\n \"text\": \"beforeHandling() {\\n\\t\\t//\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f90ce6e503164669d5db2f74fd2877a7\",\n \"score\": \"0.58025205\",\n \"text\": \"preFetch() {\\n this.busy = true;\\n this.refresh_btn_text = 'Refreshing';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"062f9442f02e979f8a1b4d5596e5d551\",\n \"score\": \"0.579772\",\n \"text\": \"UNSAFE_componentWillMount() {\\n this.doFetching(this.props);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5ee922455fff2a71e91bae50cf2b0d0\",\n \"score\": \"0.57655114\",\n \"text\": \"before (callback) {\\n\\t\\tBoundAsync.series(this, [\\n\\t\\t\\tsuper.before,\\t// do the usual test prep\\n\\t\\t\\tthis.updateStream,\\t// perform the actual join\\n\\t\\t\\tthis.setFetchPath\\n\\t\\t], callback);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81e318233f53f45951c83b3dfb57508f\",\n \"score\": \"0.5721051\",\n \"text\": \"doFetch() {\\n const cache = this.atlasOptions.cache;\\n\\n // if state is crystalline then first request\\n if (!this.state.data && !this.state.error && !this.state.loading) {\\n this.setState({ loading: true });\\n return new Promise(resolve => {\\n const unsubscribe = this.fetchHandler.subscribe(atlasResponse => {\\n if (atlasResponse.ok) {\\n this.setState({ data: atlasResponse.data });\\n } else {\\n this.setState({ error: atlasResponse.error });\\n }\\n unsubscribe();\\n resolve(atlasResponse);\\n });\\n });\\n }\\n\\n // batching\\n if (this.state.loading) {\\n return new Promise(resolve => this.fetchHandler.subscribe(resolve));\\n }\\n\\n // caching\\n if (cache) {\\n return Promise.resolve(this.fetchHandler.lastResponse);\\n }\\n\\n // no caching\\n return this.refetch();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d24f3be85f3031275dece389ee293b4\",\n \"score\": \"0.5718629\",\n \"text\": \"petFetch(){\\t\\n\\t\\tlet self = this\\n\\t\\t// get the data from the services\\n\\t\\tpetService.fetch()\\n\\t\\t.then( (response)=> {\\n\\t\\t\\t// send data to be manipulated before store in the state\\n\\t\\t\\tself.handleData(response)\\n\\t\\t})\\n\\t\\t.catch(function(error) {\\n\\t\\t\\t// the services have some issues in the moment to retrive data\\n\\t\\t\\t// if this happens the sistem will call the service again \\n\\t\\t\\tself.componentWillMount()\\n\\t\\t\\tconsole.log('Looks like there was a problem: \\\\n', error);\\n\\t\\t})\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e1baa2e65836c1d0ca7fcb3fbeaa8d8\",\n \"score\": \"0.5711178\",\n \"text\": \"function maybeFetch() {\\n\\t\\t\\tif ( context.data.$textbox.val() !== context.data.prevText ) {\\n\\t\\t\\t\\tcontext.data.prevText = context.data.$textbox.val();\\n\\t\\t\\t\\tif ( typeof context.config.fetch == 'function' ) {\\n\\t\\t\\t\\t\\tcontext.config.fetch.call( context.data.$textbox, context.data.$textbox.val() );\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a855fd9427094a79a0ba4b5be4f54e2\",\n \"score\": \"0.56440806\",\n \"text\": \"checkParamsAndFetch() {\\n // Fetch param values if present\\n let id = this.getURLParamsByName('id', window.location.href);\\n let url = this.getURLParamsByName('url', window.location.href);\\n\\n // Do not fetch a random song if an id was already provided\\n if (id) // id takes takes precedence\\n this.streamSong(id);\\n else if (url)\\n this.curPlayer.load(url); // Load the song by url (Widget API takes care of the rest)\\n else\\n this.fetchNext();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36ecaead9f75cd2f5b06ab0e5295a9cb\",\n \"score\": \"0.5607061\",\n \"text\": \"fill() {\\n\\t\\tthis.lazyInit();\\n\\t\\twhile (this.fetch(1000) === 1000) {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dea2cb2ca375f795d69c1f74e91421ed\",\n \"score\": \"0.55793244\",\n \"text\": \"componentDidMount() {\\n // if loaded flag is already true we don't need to query the API again\\n if (!this.props.loaded) {\\n this.props.handleLoad();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33f0868a29be4576bc8fb57d41d91a81\",\n \"score\": \"0.55770785\",\n \"text\": \"beforeLazyload () {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a0082e0111c0a44d7ed1e3af2a994dc\",\n \"score\": \"0.55691063\",\n \"text\": \"async fetch () {\\n\\t\\tconst { func, query, queryOptions, fetchNothing } = this.queryAndOptions;\\n\\t\\tif (fetchNothing) {\\n\\t\\t\\t// the derived class might \\\"know\\\" that we're not going to fetch anything, so\\n\\t\\t\\t// don't bother running a query\\n\\t\\t\\tthis.models = [];\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t// run the query and get our models\\n\\t\\tthis.models = await this.data[this.module.collectionName][func](query, queryOptions);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"879484f136339ab4cd0404901ece9b7f\",\n \"score\": \"0.5557063\",\n \"text\": \"async preQueryHook () {\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0799aa9a61361c7e64545ac0fc7f2514\",\n \"score\": \"0.55556136\",\n \"text\": \"prepareBaseData() { super.prepareBaseData(); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07046364572d06f5e6ad7917a5ad8b6b\",\n \"score\": \"0.5551321\",\n \"text\": \"markFetched(follow) {\\n if (follow.response) {\\n this.fetched[follow.id] = Object.assign(follow.response,\\n {at: new Date(), delay: 0.5 + (Math.random() * 0.5)})\\n this.localSet('fraidycat', {fetched: this.fetched})\\n delete follow.response\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06167f5f8ca06442860f5ab559fa36b5\",\n \"score\": \"0.55498314\",\n \"text\": \"shouldFetch(state) {\\n return true\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"784f2de3d982217a3c4216a2c48daea6\",\n \"score\": \"0.5535287\",\n \"text\": \"function fetch_and_update() {\\n fetch_items()\\n .then(process_items)\\n .then(update_display);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd7827d2f92b42a3c632b56db4e725f5\",\n \"score\": \"0.5512985\",\n \"text\": \"componentDidMount() {\\r\\n this.fetchData(null)\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e28ee2110e5f324ad6797592686d4955\",\n \"score\": \"0.5511311\",\n \"text\": \"function itShouldConditionalFetch() {\\n console.log('> itShouldConditionalFetch');\\n conditionalFetch();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db287d9f8779f9a8a5f17ffd75304515\",\n \"score\": \"0.5505485\",\n \"text\": \"function _triggerFetchData() {\\n if ($scope.currentPage === 1) {\\n _fetchData();\\n } else {\\n $scope.currentPage = 1;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74198cafa834759a0b383270a4372c23\",\n \"score\": \"0.5489967\",\n \"text\": \"canFetch() {\\n \\treturn this.fetchUrl && !this.disabled && !this.has_fetched;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82f04ed2006ee0c59271b664165b6d47\",\n \"score\": \"0.5473279\",\n \"text\": \"loadIfNotAlready()\\n\\t{\\n\\n\\t\\tif((this.state.isLoaded === false || this.state.paging === true) && this.state.isError === false)\\n\\t\\t{\\n\\n if(this.loadData === undefined)\\n {\\n\\n throw new Error(\\\"Load data must be defined by child component\\\")\\n\\n }\\n\\n\\t\\t\\tthis.sendRequest();\\n\\n\\t\\t}\\n\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5604429e5f6021e385e01ebeed9eb45b\",\n \"score\": \"0.54730123\",\n \"text\": \"reInitDataFetch() {\\n this._objectid = (this.modeladapter.value ? this.modeladapter.value[this.modeladapter.STORE_ITEM_INDEX_PROP] : null);\\n if (this._objectid)\\n this.setAttribute(\\\"objectid\\\", this._objectid)\\n else\\n this.removeAttribute(\\\"objectid\\\");\\n if (store.connected) this.connected(); else this.disconnected();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb6a9d153b83e5af61ec7aed4bc61da4\",\n \"score\": \"0.54540366\",\n \"text\": \"async fetch_data_src() {\\n if (this.data_src === null) {\\n console.error(\\\"data_src is not set\\\");\\n return;\\n }\\n if (this.data !== null) {\\n // i.e. we should assume it has been already fetched\\n return;\\n }\\n let data = await this.data_src;\\n this.data = data;\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f827e4ec6732eaacbcf555314df0a50e\",\n \"score\": \"0.54380316\",\n \"text\": \"function __setFetch(fetch) {\\n nodeFetch = fetch;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cef5e2b23e80873b68eee453ba6bbcdc\",\n \"score\": \"0.5427756\",\n \"text\": \"async fetch() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29e6195ecec42437e3c1e52403aec11b\",\n \"score\": \"0.54258335\",\n \"text\": \"function controlFetch() {\\n fetch(`https://api.openweathermap.org/data/2.5/weather?q=${location}&units=imperial&appid=59001e1f469d421690b543e76dbf29d3`\\n )\\n .then((response)=>{\\n // console.log(response.json());\\n return response.json();\\n })\\n .then((json) =>{\\n setFahrenheit(json.main.temp)\\n setCoordLat(json.coord.lat)\\n setCoordLong(json.coord.lon)\\n \\n // setCelsius((fahrenheit - 32) * .5556)\\n \\n })\\n\\n // fetch(tmUrl)\\n // .then((response) => {\\n // return response.json();\\n // })\\n // .then((json) => {\\n // return cityEvents = json._embedded.events;\\n // // cityEvents.forEach(vents => setEvents(<p>{vents.name}</p>));\\n // // cityEvents.map((vents) => {\\n // // setEvents(<p>{vents.name}</p>)\\n // // })\\n // })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44f20d6f9639d926c0ead5468c69ca2f\",\n \"score\": \"0.5418391\",\n \"text\": \"function fetchItem(self) {\\n self.initializing = true;\\n axios.get(URL_BASE + \\\"/catalogo/item/\\\", {\\n params: {\\n id: window.itemInfo.id,\\n type: window.itemInfo.type,\\n version: window.itemInfo.version\\n }\\n })\\n .then(function (res) {\\n self.initializing = false;\\n var images = JSON.parse(res.data.images);\\n var item = JSON.parse(res.data.item);\\n if (item.length === 0) {\\n return\\n }\\n\\n\\n var data = item[0];\\n self.disableApproval = data.fields.author === self.userId;\\n self.item.name = data.fields.name;\\n self.item.description = data.fields.description;\\n self.item.thumbnail = data.fields.thumbnail;\\n self.item.author = data.fields.author;\\n\\n self.item.images = images.map(function (img) {\\n img.src = utils.getImageUrl(window.CLOUDINARY_NAME, img.remoteId);\\n return img;\\n });\\n\\n\\n cargarInfo(self, res, data);\\n\\n })\\n\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d8e1ce6cb6d67c4ccfe61c93b6a43c0\",\n \"score\": \"0.54008\",\n \"text\": \"@autobind\\n fetchEssentialData(firstFetch = false) {\\n this.props\\n .fetchMarket()\\n .then(() => {\\n if (this.props.defaultAccount) {\\n this.props.fetchMarketTrades(this.props.market)\\n this.props.fetchMarketShares(this.props.defaultAccount)\\n }\\n if (firstFetch) {\\n const availableView = this.getAvailableView()\\n if (availableView) {\\n this.props.changeUrl(`/markets/${this.props.params.id}/${availableView}`)\\n }\\n }\\n })\\n .catch((err) => {\\n console.error(e)\\n this.setState({\\n marketFetchError: err,\\n })\\n })\\n\\n if (this.props.hasWallet) {\\n this.props.requestGasCost(GAS_COST.BUY_SHARES)\\n this.props.requestGasCost(GAS_COST.SELL_SHARES)\\n }\\n\\n if (this.props.defaultAccount && this.props.params.id) {\\n this.props.fetchMarketParticipantTrades(this.props.params.id, this.props.defaultAccount)\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43e669ee5f4df7397e7716e590659f00\",\n \"score\": \"0.5400027\",\n \"text\": \"componentWillMount () {\\n this._fetchData()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89f4885c0d6adc47285c1ff5b01e2196\",\n \"score\": \"0.5398872\",\n \"text\": \"loadData(){\\n \\n fetch(\\\"http://localhost:8088/people\\\")\\n .then(r => r.json())\\n .then(people => {\\n this.setState({\\n people: people\\n })\\n \\n return fetch(\\\"http://localhost:8088/vehicles\\\")\\n })\\n .then(r => r.json())\\n .then(vehicles => {\\n this.setState({\\n vehicles: vehicles\\n })\\n \\n return fetch(\\\"http://localhost:8088/pets\\\")\\n })\\n .then(r => r.json())\\n .then(pets => {\\n this.setState({\\n pets: pets\\n })\\n \\n //view all collections in state\\n console.log(this.state)\\n })\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1748d01bc7ac8d61775b7600843b76c4\",\n \"score\": \"0.53987783\",\n \"text\": \"insertStoredContent() {\\n this.fetch();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"359d9a890b16e0cee2113c44c60b0c20\",\n \"score\": \"0.5385426\",\n \"text\": \"static async fetch() {\\n try {\\n await this.git(['fetch', '--unshallow']);\\n } catch (error) {\\n core.warning(`Fetch --unshallow caught: ${error}`);\\n await this.git(['fetch']);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31515f2fec4243fd12cb547aa960cba3\",\n \"score\": \"0.5371918\",\n \"text\": \"componentWillMount() { this.fetchDefaultData(this.props); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cd894d5e99ac5ed11a67e2874101ccd\",\n \"score\": \"0.5369963\",\n \"text\": \"function handleFetch(){\\n // const handleFetch = async() = {\\n //const res = await fetch(`https://api.nasa.gov/mars-photos/api/v1/rovers/curiosity/photos?sol=${sol}&api_key=NWH7j4t1TW48KAGZChs8NMz7OrkWHIIUdfmBhFFk`)\\n //const nextData = await res.json()\\n //setData(nextData)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9425cd052b9e65ad1ad1843d1dc05e9\",\n \"score\": \"0.5368988\",\n \"text\": \"init () {\\n this.replaceData(this.manager.get(\\\"hostReq\\\"), this.endpoints.get, this.data.get);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3cc7c5e70da4671a3a904ef120d54a1\",\n \"score\": \"0.5367302\",\n \"text\": \"prepare() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"135d281504f4d16774b704bdd76244a6\",\n \"score\": \"0.5365857\",\n \"text\": \"async init() {\\n\\t\\tconsole.log(\\\"processor init\\\")\\n\\n\\n\\n\\n\\t\\ttry {\\n\\n\\t\\t\\tconsole.log(\\\"database:\\\" + this.store.state.database);\\n\\t\\t\\tvar xhr = new XMLHttpRequest();\\n\\t\\t\\tvar obj = this;\\n\\t\\t\\txhr.onload =\\n\\t\\t\\t\\tawait\\n\\n\\t\\t\\tfunction () {\\n\\t\\t\\t\\tconsole.log(xhr.responseText);\\n\\t\\t\\t\\tobj.fce = new Function('data', 'tf', xhr.responseText);\\n\\t\\t\\t}\\n\\t\\t\\txhr.open(\\\"GET\\\", this.url);\\n\\t\\t\\txhr.send();\\n\\t\\t} catch (error) {\\n\\t\\t\\tconsole.log(error)\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"794e3e1d8675f8d61a10f15d5a7987ae\",\n \"score\": \"0.53611976\",\n \"text\": \"async function fetchData () {\\n model.remoteData = \\\"Fetching remote data now...\\\"\\n return continueFetchData\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7984ee5b6af48cbc97b44acce5ad52d0\",\n \"score\": \"0.53147465\",\n \"text\": \"_innerFetch(...params) {\\n\\t\\treturn fetch(...params)\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"574ae2fad9fa178f4cc50c55dccab74b\",\n \"score\": \"0.5310971\",\n \"text\": \"checkData() {\\n const { needLoadData, setNeedLoadData, importData } = this.props;\\n if (needLoadData) {\\n setNeedLoadData(false);\\n fetch(\\\"/nba.csv\\\")\\n .then(response => {\\n return response.ok ? response.text() : Promise.reject(response);\\n })\\n .then(rawData => {\\n importData(rawData);\\n })\\n .catch(response => {\\n console.error(response);\\n });\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e848e91409529d8bc485aa46f775457\",\n \"score\": \"0.5310706\",\n \"text\": \"async componentDidMount() {\\n /* Using try lots of thing can go wrong here. */\\n try {\\n /* Set loading true, and fetch error null */\\n this.setState({isLoading: true, fetchError: null});\\n\\n\\n const response = await fetch(this.props.api);\\n if (!response.ok) {\\n throw new Error(\\\"This did not work, following message was given to you: \\\" + response.status.toString())\\n }\\n\\n /* Load JSON */\\n const data = await response.json();\\n\\n /* Analysing the data */\\n console.log(data);\\n if (data === null) {\\n throw new Error(\\\"Well, this can happen. It seems that there are now forms in the archive. \\\");\\n }\\n\\n /* Clean up Loading done */\\n this.setState({isLoading: false, data: data});\\n\\n } catch (error) {\\n this.setState({fetchError: error.toString(), isLoading: false});\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd3f82a96351abc6f5309f05c3f4b078\",\n \"score\": \"0.53067625\",\n \"text\": \"fetchInitialData() {\\n request.get('get-initial-data/')\\n .end((err, data) => {\\n AppDispatcher.dispatch({\\n actionType: ProductConstants.SET_INITIAL_DATA,\\n data: JSON.parse(data.text),\\n });\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65019be114fe8586718482e9a328c38d\",\n \"score\": \"0.53058505\",\n \"text\": \"componentDidMount() {\\n //only fetches if there is an warehouseId, otherwise use the items passed through param\\n if(this.props.warehouseId){\\n fetch(`${serverURL}${warehousesEP}${this.props.warehouseId}`)\\n .then(res=>{ \\n if(res.status===200){\\n this.setState({fetched:true});\\n }else{\\n this.setState({fetched:false});\\n }\\n return res.json()}) // javascript ternary operator '<question> ? <item1>:<item2>' that sets state to empty array in 404 response\\n .then(data=> this.setState({warehouseInv:(data.items? data.items:[])}))\\n //ternary that sets state.address.street to unknown if data.address comes back undefined(in a 404 response for example),address:(data.address? data.address:{street:'Unknown Warehouse', city:\\\"\\\"}),name:(data.name? data.name:\\\"\\\")}))\\n .catch(err=>console.log(err))\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd83ab189c3f7dbe7a2be5bf56646d76\",\n \"score\": \"0.5298928\",\n \"text\": \"function _init() {\\n\\t\\t\\t// do the pre-work in here\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04a6a0a3572896ab611b76ebaacf35c4\",\n \"score\": \"0.5294756\",\n \"text\": \"loadData(){\\n const queryString = \\\"https://fakerestapi.azurewebsites.net/api/Books\\\";\\n if (queryString === this.lastQuery) {\\n this.setState({ loading: false });\\n return;\\n }\\n\\n fetch(queryString)\\n .then(response => response.json())\\n .then(data => this.setState({\\n books: data\\n }))\\n .catch(() => this.setState({ loading: false }));\\n this.lastQuery = queryString;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca38d5bda7a6841198968f1a37984771\",\n \"score\": \"0.529411\",\n \"text\": \"async function initLoadIlliterateDonut() {\\n let jsonData = new Object();\\n jsonData.affectedUsers = \\\"Illiterate\\\";\\n let jsonResponse = await loadDataByFetchApi(url, jsonData);\\n setIlliterateDonut(jsonResponse.Total, jsonResponse.Affected);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7457b1b43a9f405a5d4086cf0af5a58f\",\n \"score\": \"0.5291592\",\n \"text\": \"async function fetchPresets() {\\n let res = await fetch(url);\\n const data = await res.json();\\n setPresetData(data.data);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7943d288f50838e97f69970ccbf41c4\",\n \"score\": \"0.5286124\",\n \"text\": \"async componentDidMount(){\\n //must use try/catch for async calls\\n try{\\n //await the response (aka resolve) from checkFetch\\n await this.context.checkFetch();\\n //Finally can pass the context to the function\\n let newSetup = logic.setupAlgo(this.context.employeeData, this.context.positionData, this.context.dayData);\\n this.setState({\\n setup: newSetup\\n });\\n } catch (err){\\n // Error Occurred\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ee8d6714e89b50899df1b1f9db55886\",\n \"score\": \"0.5285267\",\n \"text\": \"async function initLoadDeafDonut() {\\n let jsonData = new Object();\\n jsonData.affectedUsers = \\\"Deaf\\\";\\n let jsonResponse = await loadDataByFetchApi(url, jsonData);\\n // console.log(jsonResponse);\\n setDeafDonut(jsonResponse.Total, jsonResponse.Affected);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1f8995c068bdf780edc324ec30b7fbe\",\n \"score\": \"0.5281335\",\n \"text\": \"prefetch() {\\n if (!this.p || true) return; // Prefetch the JSON page if asked (only in the client)\\n\\n var href = this.getHref();\\n\\n _router.default.prefetch(href);\\n\\n prefetched[href] = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8acff6015228e2a0695c5c371a64a42a\",\n \"score\": \"0.52797824\",\n \"text\": \"function makeFetch() {\\r\\n if (offset == 1) {\\r\\n fetch(url + `?offset=${offset}&limit=${limit}`)\\r\\n .then(res => {\\r\\n if (res.ok) {\\r\\n return res.json();\\r\\n }\\r\\n })\\r\\n .then(data => {\\r\\n restCards.innerHTML = \\\"\\\"; //delete preloaders\\r\\n for (let i = 0; i < data.items.length; i++) {\\r\\n restInfo.push(data.items[i]);\\r\\n }\\r\\n offset += data.items.length;\\r\\n limit += data.items.length;\\r\\n total = data.total;\\r\\n if (offset >= data.total) {\\r\\n btnLoadCards.remove();\\r\\n }\\r\\n addRestCards();\\r\\n })\\r\\n .catch(err => console.log(err));\\r\\n } else {\\r\\n //create preloaders\\r\\n for (let i = 0; i < total - offset; i++) {\\r\\n restCards.insertAdjacentHTML(\\\"beforeend\\\", getPreloader());\\r\\n }\\r\\n fetch(url + `?offset=${offset}&limit=${limit}`)\\r\\n .then(res => {\\r\\n if (res.ok) {\\r\\n return res.json();\\r\\n }\\r\\n })\\r\\n .then(data => {\\r\\n let loadImgages = document.querySelectorAll(\\\".loaderImg\\\");\\r\\n loadImgages.forEach(img => {\\r\\n img.remove();\\r\\n });\\r\\n for (let i = 0; i < data.items.length; i++) {\\r\\n restInfo.push(data.items[i]);\\r\\n }\\r\\n offset += data.items.length;\\r\\n limit += data.items.length;\\r\\n if (offset >= data.total) {\\r\\n btnLoadCards.remove();\\r\\n }\\r\\n addRestCards();\\r\\n })\\r\\n .catch(err => console.log(err));\\r\\n }\\r\\n} //end function makeFetch\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1985d3d4b13e3eecdabf09b5b5ea098\",\n \"score\": \"0.5279046\",\n \"text\": \"constructor(fetch) {\\n this.fetch = fetch;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f68531ba3f2217cc39419f913ab7729\",\n \"score\": \"0.527635\",\n \"text\": \"function initLoader() {\\r\\n loadPopular = loadPopular();\\r\\n loadNew = loadNew();\\r\\n query = query();\\r\\n suggestion = suggestion();\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b78ec5719d6f2351651d9e15bce7a26a\",\n \"score\": \"0.52746075\",\n \"text\": \"fetch({dispatch, state}) {\\n if(state.fetcher.fetched) {\\n return;\\n }\\n\\n dispatch('more');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc322164dfcbaebefc84aede8bf0e8ea\",\n \"score\": \"0.5272341\",\n \"text\": \"function firstXHR_startReqRenderAndProceed(url_f){\\n //console.log('dom_targetIds_arr: ', dom_targetIds_arr);\\n //console.log('finalHTMLContent_arr inside firstXHR: ', finalHTMLContent_arr);\\n if(useRawXHR === true){\\n console.log('running useRawXHR.get');\\n nonPromiseXHR.get(url_f, XHR_useFirstData);\\n }\\n\\n if(usejQuery === true){\\n //console.log('define nonPromise xhr method');\\n console.log('running jQuery_Ajax');\\n jQuery_Ajax.get(url_f, XHR_useFirstData);\\n }\\n\\n if(usePromises=== true){\\n promiseXHRfirst_start(url);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53339e0c54dcff933e4584a11963c3da\",\n \"score\": \"0.5271339\",\n \"text\": \"before(callback) {\\n\\t\\tsuper.before(error => {\\n\\t\\t\\tif (error) { return callback(error); }\\n\\t\\t\\tthis.data.userId = ObjectId(); // substitute an ID for a non-existent user\\n\\t\\t\\tcallback();\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e490586f308a599192a5661ba082ad9d\",\n \"score\": \"0.5267576\",\n \"text\": \"handlegetRequests() {\\n getRequests({\\n recordId: this.recordId\\n })\\n .then((results) => {\\n this.requests = results;\\n this.requestCount = results.length;\\n this.isLoaded = true;\\n this.rowsChecks = false;\\n this.errors = undefined;\\n })\\n .catch((error) => {\\n console.error('error handlegetRequests > ' + JSON.stringify(error));\\n this.errors = JSON.stringify(error);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb7037532f955366401630f136970ef7\",\n \"score\": \"0.5266683\",\n \"text\": \"loadingData() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb7037532f955366401630f136970ef7\",\n \"score\": \"0.5266683\",\n \"text\": \"loadingData() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a0140a20c3b4926c7e49aa64f3679f72\",\n \"score\": \"0.52635497\",\n \"text\": \"getCommits() {\\n this.setState({loading:true});\\n let commit_url = this.props.commit_url;\\n\\n //Cut unnecessary part from URL\\n commit_url = commit_url.substring(0, commit_url.length - 6)\\n\\n fetch(commit_url)\\n .then(this.checkStatus)\\n .then(this.parseJSON)\\n \\n //Successful fetch\\n .then(function(data) {\\n this.setState({\\n commitResults: data,\\n error: \\\"\\\",\\n loading:false\\n })\\n }.bind(this))\\n\\n //Error handling\\n .catch(function(error) {\\n //console.log('request failed', error)\\n this.setState({error: \\\"Not found\\\"})\\n this.setState({commitResults: [] })\\n }.bind(this))\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de750c7fb58bb3c5ec4024ffd654effd\",\n \"score\": \"0.5256811\",\n \"text\": \"@action fetch(options = {}) {\\n // Merge in the any options with the default\\n options = Object.assign({ \\n url: this.url(),\\n params: {},\\n add: true, \\n merge: true, \\n remove: true \\n }, options );\\n\\n this.setRequestLabel('fetching', true);\\n\\n return new Promise((resolve, reject) => {\\n // Optionally the request above could also be done as\\n request.get(options.url, {\\n params: options.params\\n })\\n .then((response) => {\\n this.set(response.data, { add: options.add, merge: options.merge, remove: options.remove });\\n this.setRequestLabel('fetching', false);\\n resolve(this, response);\\n })\\n .catch((error) => {\\n this.setRequestLabel('fetching', false);\\n reject(error);\\n });\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f1771e140ad8ee575a5c3ad9709ad507\",\n \"score\": \"0.525156\",\n \"text\": \"async firstUpdated() {\\n const res = await api.get(endPoints.ARTICLES_ROUTE);\\n\\n this.isLoading = false;\\n this.articles = res.data.articles;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb30540c1e60fba2b4b2420f7fc27dc9\",\n \"score\": \"0.5246571\",\n \"text\": \"_executeRequest(request){/**\\n * dispatches fatal-error\\n * @param detail\\n */let fatal=detail=>{this.dispatchEvent(new CustomEvent(\\\"fatal-error\\\",{detail:detail,bubbles:!0,composed:!0}))};/**\\n * Default API fetch\\n * https://developer.mozilla.org/en-US/docs/Web/API/Fetch_API\\n */this.isLoading=!0;this.dispatchEvent(new CustomEvent(\\\"request-started\\\",{detail:request,bubbles:!0,composed:!0}));fetch(request).then(response=>{this._reworkRequest(response)}).catch(err=>{if(\\\"AbortError\\\"===err.name){this.dispatchEvent(new CustomEvent(\\\"request-aborted\\\",{detail:request,bubbles:!0,composed:!0}));console.error(\\\"RequestService fetch aborted: \\\",err)}fatal(request)})}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a270bdb14300605f01f05a232fdc17b7\",\n \"score\": \"0.52427554\",\n \"text\": \"fetchData() {\\n // gets data using predefined url above -> converts to json -> updates the state\\n fetch(URL)\\n .then( res => res.json())\\n .then( data => {\\n console.log(data);\\n this.setState({\\n dataSource: this.state.dataSource.cloneWithRows(data.movies),\\n loaded: true,\\n })\\n })\\n .done()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7a5387df0bb4c280f369831e2c3012b\",\n \"score\": \"0.52425206\",\n \"text\": \"async fetchData() {\\n try {\\n this.setState({\\n responseLoaded: false\\n })\\n const response = await Axios.get(poloniexUrl)\\n const data = response.data\\n this.setState({poloniexResponse: data, responseLoaded: true})\\n this.updateResults()\\n } catch (error) {\\n alert(\\\"Error in retrieving Poloniex data: \\\" + error)\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26054ffbedd6a5ef694d6d4a89493fd8\",\n \"score\": \"0.52385\",\n \"text\": \"async fetchData(pathname, id, withKeys) {\\n let options = {};\\n if(withKeys) {\\n options = {\\n\\n };\\n }\\n\\n // Set loading flag\\n this.loading = true;\\n\\n // Make a fetch request\\n let { data } = await request.get(`${pathname}`, options);\\n\\n // data contains a results array\\n try{\\n data = data.results;\\n } catch(err){\\n console.log(err);\\n }\\n\\n try{\\n if(data){\\n data.results && data.results.length > 0\\n ? this.setData(data)\\n : this.setSingle(data);\\n }\\n } catch(err){\\n console.log(err);\\n }\\n\\n // Switch loading flag\\n this.loading = false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58c8484637c4eebdbb5a6a1854b728be\",\n \"score\": \"0.5237585\",\n \"text\": \"componentDidMount() { \\n var self = this; \\n // check if pk checked and populate update details \\n if(pk){\\n if(this.props.student.first_name === undefined){\\n // FETCH from api \\n api.retrieve(updateUrl)\\n .then(data => self.props.saveStudent(data))\\n .then(()=>self.fetchStudent())\\n \\n api.retrieve(updateUrl)\\n .then(data => self.props.fetchParents(data)) \\n .catch(function (error) {\\n return error \\n }); \\n }else{self.fetchStudent()}\\n }else{\\n self.fetchStudent()\\n }\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9f517147f32259c7fe0e7e21c2872ba\",\n \"score\": \"0.52323747\",\n \"text\": \"_fetch(url, data) {\\n if (data === undefined) {\\n data = {};\\n }\\n\\n if (!data.hasOwnProperty('headers')) {\\n data.headers = {};\\n }\\n\\n data.headers['X-API-Key'] = this.apiKey;\\n\\n return fetch(url, data);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bc75da803304da0b4ce52685b05a394\",\n \"score\": \"0.52292013\",\n \"text\": \"function preloadDataFetchingRecord(map, key, fetcher) {\\n let record = map.get(key);\\n if (!record) {\\n const thenable = fetcher();\\n record = createRecordFromThenable(thenable);\\n map.set(key, record);\\n }\\n return record;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40e29f9d3ae377a21761dfb5f518cedf\",\n \"score\": \"0.52285737\",\n \"text\": \"fetchData(state, { url, success, reject, silent, raise404 }) {\\n if (!silent) {\\n state.isRequesting = true;\\n }\\n\\n return fetch(url)\\n .then(response => {\\n if (!response.ok) {\\n state.notFound = true;\\n\\n if (raise404) {\\n raise404();\\n }\\n return false;\\n } else {\\n return response.json();\\n }\\n })\\n .then(data => {\\n if (data) {\\n state.notFound = false;\\n\\n success(data.consultant);\\n\\n if (!silent) {\\n state.isRequesting = false;\\n }\\n }\\n })\\n .catch(error => {\\n if (reject) reject(error);\\n else console.log(\\\"error\\\", error);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd896dc88453b8882f6e03d2c43d2efb\",\n \"score\": \"0.5224186\",\n \"text\": \"load_base_data() {\\n if (this._data.ds !== null) {\\n this._load_base_data(this._data.l_object);\\n } else {\\n this._data.object.then(this._load_base_data);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01af755bc3bd78bad6016d88fef1ddc6\",\n \"score\": \"0.52231395\",\n \"text\": \"componentWillMount(){\\n\\n //Perform API request, obtaining \\\"events\\\"\\n this.retrieveData();\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"717f9c9525fd694679c8396588a0c1fb\",\n \"score\": \"0.5215315\",\n \"text\": \"async function fetchData() {\\n loadArtByCreation();\\n loadArtBySell();\\n // if (!cancel) {\\n // console.log('Home data');\\n // }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e771eb9ba8f2682b2a01b1e64d47c0e\",\n \"score\": \"0.52128124\",\n \"text\": \"componentDidUpdate() {\\n // if loaded flag is already true we don't need to query the API again\\n if (!this.props.loaded) {\\n this.props.handleLoad();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37dae3913642194d28b4ca14cb2aa04c\",\n \"score\": \"0.52077353\",\n \"text\": \"function dummyLoad() {\\n var deferred = $.Deferred();\\n deferred.resolve();\\n return deferred.promise();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa43311d7e78fb64a47684d35036a078\",\n \"score\": \"0.520096\",\n \"text\": \"fetchData () {\\n return fetch('<URL HERE>' + this.state.itemName.toLowerCase() + '/' + this.state.pageNum)\\n .then( (response) => response.json() )\\n .then ( (responseJson) => {\\n if(responseJson.status != \\\"failure\\\") {\\n this.setState({\\n isLoading: false,\\n dataSource: responseJson.items\\n })\\n } else {\\n this.setState({\\n isLoading: false,\\n visible: true,\\n message: \\\"Can't find item\\\"\\n })\\n }\\n })\\n\\n .catch((error)=> {\\n console.log(error);\\n });\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e453a963e18a0b6ed54f455764f7bd97\",\n \"score\": \"0.51980245\",\n \"text\": \"fetchData() {\\n const { filter, fetchTodos } = this.props\\n fetchTodos(filter).then(() => console.log('Yeah these are loaded!')) // eslint-disable-line no-console\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eb30e724b603171f7ddbed90e6c8078\",\n \"score\": \"0.5197588\",\n \"text\": \"getData(source, name) {\\n if(source===\\\"\\\") {this.mapData([], name);}\\n fetch(source)\\n .then(response => response.json())\\n .then(function(json) {\\n var arr = [];\\n json.forEach(item => {\\n arr.push(item);\\n });\\n this.mapData(arr, name);\\n }.bind(this))\\n .catch(err => console.log(err));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3246340b97899d7b4d8747ba961c0bd5\",\n \"score\": \"0.5196799\",\n \"text\": \"componentWillMount() {\\n this.fetchDataFromAPI(); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01890e05c04df7edd0c0c101d2e3b6b0\",\n \"score\": \"0.51963276\",\n \"text\": \"function fetchData() {\\n\\tvar req = xhttpRequest();\\n\\tif (''+window.location.hostname == '') xhttpRequestFetch(req, 'xml/buddies.xml', parseData);\\n\\telse xhttpRequestFetch(req, 'animedb.pl?show=xml&t=buddies', parseData);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"858329bbb563e75ba41ad1648d9e7339\",\n \"score\": \"0.5195552\",\n \"text\": \"setStart() {\\n request\\n .get(`article/get/${this.state.id}`, {\\n headers: {\\n \\\"auth-token\\\": localStorage.getItem(\\\"accessToken\\\"),\\n },\\n })\\n .then((response) => response.data)\\n .then((data) => {\\n console.log(data)\\n if (data.success) {\\n this.editorComponent &&\\n this.editorComponent.setContent(data.returnValuesForArticle.content)\\n this.updateContent(data.returnValuesForArticle.content)\\n this.setState({\\n loaded: true,\\n title: data.returnValuesForArticle.title,\\n })\\n if (data.returnValuesForArticle.is_pending) {\\n this.setState({\\n hasPending: true,\\n buttonText: \\\"Pending article exists\\\",\\n })\\n }\\n console.log(data)\\n return data\\n }\\n this.editorComponent && this.editorComponent.setContent(\\\"\\\")\\n this.updateContent(\\\"\\\")\\n this.setState({ loaded: true })\\n })\\n .catch((err) => {\\n this.setState({ loaded: true })\\n console.log(err)\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97bafb290602ba163e7e693d59f17296\",\n \"score\": \"0.5194944\",\n \"text\": \"getData() {\\n fetch(this.api)\\n .then((response) => {\\n let data = response.json();\\n return data;\\n })\\n .then((data) => {\\n // console.log(data)\\n this.data = data;\\n this.states = data.statewise.slice();\\n\\n // remove loader\\n var preloader = document.getElementById(\\\"loader\\\");\\n preloader.style.display = \\\"none\\\";\\n\\n // set to default sort\\n this.sortRow(this.sortField, true);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80854da8f3a941f959d117bd59a115fe\",\n \"score\": \"0.5194554\",\n \"text\": \"getData() {\\n if (this.url)\\n {\\n let url = `${this.url}?relativePath=${this.state.relativePath}&skipCount=${this.state.skipCount}&maxItems=${this.state.maxItems}${this.state.orderBy ? `&orderBy=${this.state.orderBy} ${this.state.orderDirection} ` : \\\"\\\"}${this.include}${this.relations}${this.includeSource}`;\\n xhr.get(url)\\n .then(response => {\\n this.setState({\\n list: response.data.list,\\n relations: response.data.relations || {}\\n });\\n });\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b476dbf08739f939478b89930d3a480\",\n \"score\": \"0.5193665\",\n \"text\": \"async implementFetch (request) {\\n throw (new Error('implementFetch not implemented, store is not functional'))\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c691b6dfc4f81bb468c0d2fa54852e46\",\n \"score\": \"0.5192371\",\n \"text\": \"function fetchPokemonData() {\\r\\n let name = this.id;\\r\\n let url = \\r\\n URL + \\\"pokedex.php?pokemon=\\\" + \\r\\n name;\\r\\n fetch(url, {mode: \\\"cors\\\"})\\r\\n .then(checkStatus)\\r\\n .then(JSON.parse)\\r\\n .then(pokemonInformation)\\r\\n .catch(console.log);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96d2bb300d478b319027502229b1ea8d\",\n \"score\": \"0.5190288\",\n \"text\": \"componentWillMount() {\\n\\t\\tthis.fetchRequestedItems()\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5f551333774717a7ca77a2735f6a80b\",\n \"score\": \"0.51846856\",\n \"text\": \"async GetInitialLoadTransactionData() {\\n const response = await fetch('Home/GetInitialLoadTransactionData');\\n const data = await response.json();\\n this.setState({ TransactionData: data, loading: false });\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":98,"cells":{"query_id":{"kind":"string","value":"253f1369fefa79254de01a870ad18d7e"},"query":{"kind":"string","value":"Sets or gets the language. Used in conjunction with the property messages. Property type: boolean"},"positive_passages":{"kind":"list like","value":[{"docid":"d151f6715b11feaf888aebdf8404c29c","score":"0.0","text":"get keyboardNavigation() {\n\t\treturn this.nativeElement ? this.nativeElement.keyboardNavigation : undefined;\n\t}","title":""}],"string":"[\n {\n \"docid\": \"d151f6715b11feaf888aebdf8404c29c\",\n \"score\": \"0.0\",\n \"text\": \"get keyboardNavigation() {\\n\\t\\treturn this.nativeElement ? this.nativeElement.keyboardNavigation : undefined;\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"93e76965300e68e7a5fedb37f5b09110","score":"0.6746043","text":"get language () {\r\n\t\treturn this._language;\r\n\t}","title":""},{"docid":"2cf89c464e4f1893ee19c5074956fce1","score":"0.6512211","text":"get language() {\n\t\treturn this.__language;\n\t}","title":""},{"docid":"2cf89c464e4f1893ee19c5074956fce1","score":"0.6512211","text":"get language() {\n\t\treturn this.__language;\n\t}","title":""},{"docid":"568a68457a8cb8527f6564cd1f7e9ac3","score":"0.639221","text":"get language() {\n return this._data.language;\n }","title":""},{"docid":"0902bb0de7b35d166f1880fccdd85c95","score":"0.63437986","text":"setLanguage(language) {\n //Check if exists a translation for the current language or if the default\n //should be used\n var bestLanguage = this._getBestMatchingLanguage(language, this._props);\n var defaultLanguage = Object.keys(this._props)[0];\n this._language = bestLanguage;\n //Associate the language object to the this object\n if (this._props[bestLanguage]) {\n //delete default propery values to identify missing translations\n for (key of this._defaultLanguageFirstLevelKeys){\n delete this[key];\n }\n var localizedStrings = Object.assign({}, this._props[this._language]);\n for (var key in localizedStrings) {\n if (localizedStrings.hasOwnProperty(key)) {\n this[key] = localizedStrings[key];\n }\n }\n //Now add any string missing from the translation but existing in the default language\n if (defaultLanguage !== this._language) {\n localizedStrings = this._props[defaultLanguage];\n this._fallbackValues(localizedStrings, this);\n }\n }\n }","title":""},{"docid":"4b0fccfcc2f9d7ac93a0884a4280b5ae","score":"0.6326306","text":"static setLanguage(name) {\n novelData.novel.settings.language = name;\n return UI.updateUILanguage();\n }","title":""},{"docid":"4b0fccfcc2f9d7ac93a0884a4280b5ae","score":"0.6326306","text":"static setLanguage(name) {\n novelData.novel.settings.language = name;\n return UI.updateUILanguage();\n }","title":""},{"docid":"d36d491aef67e48ed5f777495f83bdac","score":"0.62979853","text":"set language(lang) {\n // If lang matches current language, return\n if (lang === this.lang) return\n\n lang = this.getLanguageKey(lang)\n this.lang = lang\n window.localStorage.setItem(Translator.LOCAL_STORAGE_KEY, lang)\n this.translations = this.languages[lang]\n this.locale = this.translations.locale\n\n this.setDocumentLanguage()\n this.translate()\n }","title":""},{"docid":"d4a95f111e1525820e45c83fde852814","score":"0.6192467","text":"get lang() {\n return this._lang;\n }","title":""},{"docid":"948798c5f65311ac7d19c24d3541b2a8","score":"0.61483705","text":"function setCanAddLanguage()\n{\n var langs = getLangLocsInEntry();\n\n if (langs.length == g_termbaseLanguages.length)\n {\n g_canAddLanguage = false;\n }\n else\n {\n g_canAddLanguage = true;\n }\n}","title":""},{"docid":"67d3d2a0773a8720efcf9bb13437b433","score":"0.61354566","text":"detectLanguage() {\n let lang\n\n // if language is defined in querystring, use that one\n const qs = window.location.search.substring(1)\n const m = /lang=([A-z]+)/i.exec(qs)\n if (m && m.length > 1) {\n lang = m[1]\n\n // otherwise, check local storage\n } else {\n lang = window.localStorage.getItem(Translator.LOCAL_STORAGE_KEY)\n }\n\n // If the language is not set as a query parameter\n // and\n // language is not set in localStore\n // prompt for choice\n if (!lang) this.prompt = true\n\n // this will validate the language in the setter before saving\n this.language = lang\n }","title":""},{"docid":"4e9cf3e7c6b20397455b2359ee0fd047","score":"0.60581994","text":"get language() {\n return this._data.broadcaster_language;\n }","title":""},{"docid":"56b10b56eb22cad0306c76ed8a994dbe","score":"0.60372955","text":"setLanguages(languages) {\n // to be overloaded by subclasses\n }","title":""},{"docid":"bf3965c938befab823928aca9cb4e204","score":"0.59776616","text":"isSavedLang () {\n return this.$config.storage().has('locale')\n ? JSON.parse(JSON.stringify(this.$config.storage().get('locale')))\n : false\n }","title":""},{"docid":"d8b9b8b1948efc389489dafbc86f2605","score":"0.5975117","text":"function setLanguage(newLang){\r\n\tswitch (newLang) {\r\n\t\t// German - DE - by Stevieoo\r\n\t\tcase \"de\": \taLang = [\"Aktivieren\", \"Angriffs-Email\", \"Angriffs-Alarm\", \"Spionage-Alarm\", \"Nachrichten-Alarm\", \"Auto-Login\", \"Du musst Deine eMail Adresse am Anfang des Codes einfügen, wenn Du eine eMail bekommen möchtest, wenn Du angegriffen wirst.\", \"Es muss eine funktionierende Email Adresse definiert werden, damit Du bei einem Angriff benachrichtigt wirst.\", \"Angriff in \", \"Unbekannte Angriffs-Zeit\", \"Du wirst angegriffen, aber die Flottendetails nicht nicht verfügbar.\", \"Ankunfts-Zeit\", \"Schiffe\", \"Von\", \"Nach\", \"Angriff\", \"OGame Angriff\", \"Autologin kann in Chrome nicht abgeschaltet werden. Bitte deaktiviere das Addon zum ausschalten des Autologin.\", \"OGame@Alarme.Queijo\", \"Das ist eine Testmail\", \"Das ist ein OGame@Alarm.Cheese Test\", \"OGame Alarm w/ Cheese\", \"Email für eingehene Alarme\", \"Test\", \"Ogame Alarm with Cheese - Optionen\", \"Minimale Reload-Zeit\", \"Maximale Reload-Zeit\", \"Prüfe auf alarme alle\", \"Speichern & Schließen\", \"Reload Typ Auswahl\", \"Sekunden\", \"Sprache\", \"Spenden!\", \"[OGAwC] Löschen aller cookies\", \"Bist Du sicher das Du alle OGAWC Cookies löschen möchtest? Hiermit werden deine Logindaten gelöscht und alle Einstellungen auf standard zurück gesetzt.\", \"Reset alles\", \"AutoLogin Konten\", \"Server\", \"Spieler\", \"Passwort\", \"AutoLogin\", \"Es gibts keine AutoLogin informationen. Bitte ausloggen und neu einloggen zum speichern der informationen.\", \"Ungültige Email! Beispiel: someone@somewhere.abc\", \"Eine Test Email wurde versendet! Wenn Sie kein Firefox verwenden könnte es nicht funktionieren. Denken Sie daran, das Sie etwas Spenden!\", \"Ungültige Einstellungen! Das minimum darf nicht kleiner als 100 Sekunden sein. Das Maximum darf nicht kleiner als 200 sein. Prüfen auf Angriffe darf nicht kleiner als 60 sein. Die Email Adresse muss ein @ und einen . und keine Leerzeichen enthalten.\\n'Alarm repeat' must be less than 'Check for Alarms'.\", \"Übersicht\", \"Löschen\", \"Repeat last audio alarm\", \"After\", \"(Less than 10 = OFF)\"];\r\n\t\t\t\t\taLangIndex = 1;\r\n\t\t\t\t\tbreak;\r\n\t\t// Danish - DK - by Kin0x\r\n\t\tcase \"dk\": \taLang = [\"Aktiver\", \"Angrebs email\", \"Angrebs Alarm\", \"Spionage Alarm\", \"Besked Alarm\", \"Auto Login\", \"Mangler emailURL!\", \"Du skal have en email indtastet i bunden for at kunne modtage beskeder omkring flåde angreb pr. mail.\", \"Indkommende angreb om \", \"Ukendt angrebs tid\", \"Du er under angreb, men der er ingen flåde detajler\", \"Ankommer kl.\", \"Skibe\", \"Fra\", \"Til\", \"Angreb\", \"OGame indkommende angreb\", \"AutoLogin kan ikke blive slået fra i Chrome!\", \"OGame@Alarm.Ost\", \"Dette er en test email!\", \"En test email så du kan se dit script virker!\", \"OGame Alarm med Ost\", \"Email for at modtage mails med angreb\", \"Send en test\", \"OGame Alarm Indstillinger\", \"Minimum opdateringstid (sek)\", \"Maksimum opdateringstid (sek)\", \"Check for alarms every\", \"Gem Indstillinger\", \"Select Reload Type\", \"sekund\", \"Sprog\", \"Donate!\", \"[OGAwC] Delete all cookies\", \"Are you sure you want to delete all OGAwC cookies?\\n\\nThis will delete your email and autologin information as well as reset all options to default.\", \"Reset All\", \"AutoLogin Accounts\", \"Server\", \"Player\", \"Password\", \"AutoLogin\", \"No AutoLogin account information. Please log out and log back in to save account information for AutoLogin.\", \"Improper Email. Please use the form: someone@somewhere.abc\", \"Test Email sent!\\n\\nThis may not work in non-FireFox browsers.\\n\\Remember this is not free, you should donate!\", \"Improper settings!\\n\\nMinimum cannot be set lower than 100 seconds.\\nMaximum cannot be set lower than 200 seconds.\\nCheck for Attacks cannot be set lower than 60.\\nThe email address must contain @ and . and no spaces.\\n'Alarm repeat' must be less than 'Check for Alarms'.\", \"Overview\", \"Delete\", \"Repeat last audio alarm\", \"After\", \"(Less than 10 = OFF)\"];\r\n\t\t\t\t\taLangIndex = 2;\r\n \t\t\t\t\tbreak;\r\n\t\t// Portuguese - PL - by GL_notmypresident\r\n\t\tcase \"pt\": \taLang = [\"Recarregar\", \"Email de ataque\", \"Alarme de ataque\", \"Alarme de espião\", \"Alarme mensagem\", \"Login automático\", \"Tens que preencher a variável EmailURL no topo do código. Para usar a opção de Email de ataque.\", \"Tens que inserir o teu email no fim da página do OGame para usar a opção de Email de ataque.\", \"Ataque em \", \"Tempo para o ataque desconhecido\", \"Estás a ser atacado, mas os detalhes da frota atacante são desconhecidos.\", \"Tempo de chegada\", \"Naves\", \"De\", \"Para\", \"Ataque\", \"Ataque no OGame\", \"Não é possível desactivar o Login Automático no Chrome. Tens que ir à página das extensões e desactivar o script para desactivar o Login automático.\", \"OGame@Alarme.Queijo\", \"Email de teste\", \"Um teste com queijo\", \"Alarme do OGame com queijo\", \"Email para receberes notificações de ataque\", \"Teste\", \"Ogame Alarm with Cheese Options\", \"Minimum reload time\", \"Maximum reload time\", \"Check for alarms every\", \"Salvar e Saída\", \"Select Reload Type\", \"segundo\", \"Linguagem\", \"Donate!\", \"[OGAwC] Delete all cookies\", \"Are you sure you want to delete all OGAwC cookies?\\n\\nThis will delete your email and autologin information as well as reset all options to default.\", \"Reset All\", \"AutoLogin Accounts\", \"Server\", \"Player\", \"Password\", \"AutoLogin\", \"No AutoLogin account information. Please log out and log back in to save account information for AutoLogin.\", \"Improper Email. Please use the form: someone@somewhere.abc\", \"Test Email sent!\\n\\nThis may not work in non-FireFox browsers.\\n\\Remember this is not free, you should donate!\", \"Improper settings!\\n\\nMinimum cannot be set lower than 100 seconds.\\nMaximum cannot be set lower than 200 seconds.\\nCheck for Attacks cannot be set lower than 60.\\nThe email address must contain @ and . and no spaces.\\n'Alarm repeat' must be less than 'Check for Alarms'.\", \"Overview\", \"Delete\", \"Repeat last audio alarm\", \"After\", \"(Less than 10 = OFF)\"];\r\n\t\t\t\t\taLangIndex = 3;\r\n \t\t\t\t\tbreak;\r\n\t\t// Spanish - ES - by mohace\r\n\t\tcase \"es\":\taLang = [\"Activar\", \"Ataque Emailer\", \"Ataque Alarm\", \"Espionaje Alarm\", \"Mensaje Alarm\", \"Auto Login\", \"Es necesario configurar la EmailURL en la parte superior del script para usar la alrarma de ataque entrante.\", \"Es necesario configurar la una direccion de email en la pantalla de opciones para las alertas de ataques entrantes.\", \"Ataque entrante en \", \"Hora de ataque desconocida\", \"Hay un ataque entrante, pero los detalles de la flota se desconocen\", \"Hora de llegada\", \"Naves\", \"Desde\", \"a\", \"Ataque\", \"OGame Ataque entrante\", \"No se puede desactivar AutoLogin en Chrome. Debe desactivar el script para deshabilitar el AutoLogin.\", \"OGame@Alarm.Queso\", \"Email de prueba\", \"Una prueba de este sabroso queso\", \"OGame Alarm c/ Queso\", \"Direccion Email para enviar alertas de ataque\", \"Prueba\", \"Opciones de Ogame Alarm con Queso\", \"Tiempo minimo de recarga\", \"Tiempo maximo de recarga\", \"Chequear alarmas cada\", \"Salvar & Cerrar\", \"Seleccionar el tipo de recarga\", \"segundos\", \"Lenguaje\", \"Donate!\", \"[OGAwC] Borrar todas las cookies\", \"Esta seguro de que quiere borrar todas las cookies de OGAwC?\\n\\nEsto borrará su configuracion de email (y la informacion de autologin en GreaseMonkey). Todas las opciones seran las predeterminadas.\", \"Resetear todo\", \"AutoLogin cuentas\", \"Servidor\", \"Jugador\", \"Password\", \"AutoLogin\", \"No hay informacion de AutoLogin. Por favor salga de ogame y vuelva a loguear para guardar la informacion para AutoLogin.\", \"Email incorrecto. Use el modelo: someone@somewhere.abc\", \"Email de prueba enviado!\\n\\nEsto puede no funcionar en navegadores diferentes a FireFox.\\n\\Recuerde que esto no es gratis. Haga una donacion!\", \"Configuracion incorrecta!\\n\\nEl minimo no puede ser menor a 120 seconds.\\nEl maximo no puede ser menor que 240 seconds.\\nEl tiempo de control por ataques no puede ser menor a 90 segundos..\\nLa direccion email debe contener @ and . y sin espacios.\\n'Alarm repeat' must be less than 'Check for Alarms'.\", \"Vision general\", \"Borrar\", \"Repeat last audio alarm\", \"After\", \"(Less than 10 = OFF)\"];\r\n\t\t\t\t\taLangIndex = 4;\r\n\t\t\t\t\tbreak;\r\n\t\t// Dutch - NL - by Timmy M.\r\n\t\tcase \"nl\":\taLang = [\"Activeer\", \"Val Emailer aan\", \"Aanval Alarm\", \"Spionage Alarm\", \"Berichtalarm\", \"Auto Login\", \"U moet de EmailURL bovenaan de code plaatsen om het Inkomend Aanval Email Alarm te gebruiken.\", \"U moet een geldig email adres gebruiken in het Opties scherm voor Inkomende Aanval Alarmeringen.\", \"Inkomende Aanval in \", \"Ongekende Aanvalstijd\", \"U wordt aangevallen maar de vloot details zijn niet beschikbaar.\", \"Aankomsttijd\", \"Schepen\", \"Van\", \"Naar\", \"Aanvallen\", \"OGame Inkomende Aanval\", \"Kan AutoLogin niet uitschakelen in Chrome. U zal het AutoLogin script moeten uitschakelen in je extensies.\", \"OGame@Alarm.Cheese\", \"Dit is een test email\", \"Een Kazige Test\", \"OGame Alarm met Kaas\" , \"Email adres om Aanvalsalarmen naar te sturen\", \"Test\", \"OGame Alarm met Kaas Opties\" , \"Minimum herlaadtijd\", \"Maximum herlaadtijd\", \"Alarm controleren iedere\", \"Opslaan & Afsluiten\", \"Selecteer Herlaad Type\", \"seconden\", \"Taal\", \"Doneren!\", \"[OGAmK] Alle cookies verwijderen\", \"Ben je zeker dat je alle OGAmK cookies wil verwijderen?\\n\\nDit zal je mail (en autologin informatie in GreaseMonkey) alsook alle instellingen en opties naar hun standaard terugstellen.\", \"Alles Resetten\", \"AutoLogin Profielen\", \"Server\", \"Speler\", \"Paswoord\", \"AutoLogin\", \"Geen AutoLogin profiel informatie. Gelieve uit - en terug in te loggen om profiel informatie voor AutoLogin te bewaren.\", \"Ongeldig Email Adres. Gelieve dit formaat te gebruiken: iemand@ergens.abc\", \"Test Email verzonden!\\n\\nDit kan mogelijk niet werken in niet-FireFox browsers.\\nWees indachtig dat dit niet gratis is, gelieve te doneren!\", \"Ongeldige Instellingen!\\n\\nMinimum kan niet lager dan 120 seconden zijn.\\nMaximum kan niet lager dan 240 seconden zijn.\\nAanvallen Controleren kan niet lager dan 90 zijn.\\nHet email adres moet @ en . bevatten maar geen spaties.\", \"Overzicht\", \"Verwijderen\", \"Repeat last audio alarm\", \"After\", \"(Less than 10 = OFF)\"];\r\n\t\t\t\t\taLangIndex = 5;\r\n\t\t\t\t\tbreak;\r\n\t\t// English (Default) - ORG - by Pimp Trizkit\r\n\t\tcase \"org\": // 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49\r\n\t\tdefault:\taLang = [\"Activate\", \"Attack Emailer\", \"Attack Alarm\", \"Espionage Alarm\", \"Message Alarm\", \"Auto Login\", \"You need to set the EmailURL at the top of the code. To use the Incoming Attack Email Alarm.\", \"You need to set a proper email address in the options screen for the Incoming Attack alerts.\", \"Incoming Attack in \", \"Unknown Attack Time\", \"You have an Incoming attack, but the fleet details are not available\", \"Arrival Time\", \"Ships\", \"From\", \"To\", \"Attack\", \"OGame Incoming Attack\", \"Can not turn off AutoLogin in Chrome. You will have to goto your extensions and disable the script to disable AutoLogin.\", \"OGame@Alarm.Cheese\", \"This is a test email\", \"One Cheesy Test\", \"OGame Alarm w/ Cheese\", \"Email address to send Incoming Attack alerts\", \"Test\", \"Ogame Alarm with Cheese Options\", \"Minimum reload time\", \"Maximum reload time\", \"Check for alarms every\", \"Save & Close\", \"Select Reload Type\", \"seconds\", \"Language\", \"Donate!\", \"[OGAwC] Delete all cookies\", \"Are you sure you want to delete all OGAwC cookies?\\n\\nThis will delete your email (and autologin information in GreaseMonkey) as well as reset all settings and options to default.\", \"Reset All\", \"AutoLogin Accounts\", \"Server\", \"Player\", \"Password\", \"AutoLogin\", \"No AutoLogin account information. Please log out and log back in to save account information for AutoLogin.\", \"Improper Email. Please use the form: someone@somewhere.abc\", \"Test Email sent!\\n\\nThis may not work in non-FireFox browsers.\\n\\Remember this is not free, you should donate!\", \"Improper settings!\\n\\nMinimum cannot be set lower than 100 seconds.\\nMaximum cannot be set lower than 200 seconds.\\nCheck for Attacks cannot be set lower than 60.\\nThe email address must contain @ and . and no spaces.\\n'Alarm repeat' must be less than 'Check for Alarms'.\", \"Overview\", \"Delete\", \"Repeat last audio alarm\", \"After\", \"(Less than 10 = OFF)\"];\r\n\t\t\t\t\taLangIndex = 0;\r\n\t\t\t\t\tbreak;\r\n\t}\r\n}","title":""},{"docid":"05c577b3b43a262ccfed0214a8a6f50d","score":"0.5967764","text":"toggleLanguage(){\n\t\tconst langs = this.app.getService(\"locale\"); //get Local service\n\t\t\n\t\t/*\n\t\t Use this.getRoot() to get to the top Webix widget inside a JetView\n\t\t Here it is Toolbar\n\t\t*/\n\t\tconst value = this.getRoot().queryView(\"segmented\").getValue(); //get Segmented value\n\t\tlangs.setLang(value); //set Local value\n\t}","title":""},{"docid":"d0410a280799243eeaad3967d29e256e","score":"0.59435046","text":"get language() {\n return {\n // get|set the document language (ISO-639-1)\n get code() { return gLanguage; },\n set code(lang) { loadLocale(lang, translateFragment); },\n\n // get the direction (ltr|rtl) of the current language\n get direction() {\n // http://www.w3.org/International/questions/qa-scripts\n // Arabic, Hebrew, Farsi, Pashto, Urdu\n var rtlList = ['ar', 'he', 'fa', 'ps', 'ur'];\n return (rtlList.indexOf(gLanguage) >= 0) ? 'rtl' : 'ltr';\n }\n };\n }","title":""},{"docid":"d0410a280799243eeaad3967d29e256e","score":"0.59435046","text":"get language() {\n return {\n // get|set the document language (ISO-639-1)\n get code() { return gLanguage; },\n set code(lang) { loadLocale(lang, translateFragment); },\n\n // get the direction (ltr|rtl) of the current language\n get direction() {\n // http://www.w3.org/International/questions/qa-scripts\n // Arabic, Hebrew, Farsi, Pashto, Urdu\n var rtlList = ['ar', 'he', 'fa', 'ps', 'ur'];\n return (rtlList.indexOf(gLanguage) >= 0) ? 'rtl' : 'ltr';\n }\n };\n }","title":""},{"docid":"92e226b3272ae807208ca02a8c6a54e2","score":"0.5874252","text":"function SetLanguage(checkbox)\n{\n // toggle the check state of the checkbox that was clicked\n devlangsMenu.ToggleCheckState(checkbox.id);\n \n // update the label of the dropdown menu\n SetDropdownMenuLabel(devlangsMenu, devlangsDropdown);\n\t\n // update the display of the document's items that are dependent on the devlang setting\n\tcodeBlockHandler();\n\tstyleSheetHandler(\"\");\n}","title":""},{"docid":"3dabb95d7248bd47f2207ae776c996c9","score":"0.58683884","text":"function set_lang_value(lang_)\n\t\t\t{\n\t\t\t\tLangValue = lang_;\n\t\t\t\tconsole.log('set lang:'+lang_);\n\t\t\t}","title":""},{"docid":"1fae86968add60470cc200c999969b93","score":"0.5865645","text":"language(languageFile){\n this._BotParameters.languageFile = languageFile;\n }","title":""},{"docid":"e0a8d9f89fb22ecf7f886f188e5505c1","score":"0.5860658","text":"function SetLanguage(checkbox)\n{\n // toggle the check state of the checkbox that was clicked\n devlangsMenu.ToggleCheckState(checkbox.id);\n \n // update the label of the dropdown menu\n SetDropdownMenuLabel(devlangsMenu, devlangsDropdown);\n\t\n // update the display of the document's items that are dependent on the devlang setting\n\tcodeBlockHandler();\n\tstyleSheetHandler(\"\");\n\t\n}","title":""},{"docid":"83187cdb2902ab18dce27b840ca70f12","score":"0.5846678","text":"setLanguage(languageCode) {\n const flags = {};\n switch (languageCode) {\n case \"apex\":\n case \"javascript\":\n case \"typescript\":\n flags.delimter = \"//\";\n flags.blockCommentStart = this.escapeRegExp(\"/*\");\n flags.blockCommentEnd = this.escapeRegExp(\"*/\");\n flags.highlightJSDoc = true;\n break;\n case \"c\":\n case \"cpp\":\n case \"csharp\":\n case \"go\":\n case \"java\":\n case \"less\":\n case \"php\":\n case \"rust\":\n case \"scala\":\n case \"scss\":\n case \"vue\":\n flags.delimter = \"//\";\n flags.blockCommentStart = this.escapeRegExp(\"/*\");\n flags.blockCommentEnd = this.escapeRegExp(\"*/\");\n break;\n case \"sql\":\n flags.delimter = \"--\";\n break;\n case \"coffeescript\":\n case \"dockerfile\":\n case \"r\":\n case \"ruby\":\n case \"shellscript\":\n case \"yaml\":\n case \"python\":\n flags.delimter = \"#\";\n break;\n default:\n flags.supportedLanguage = false;\n break;\n }\n Object.assign(this.languageFlags, flags);\n }","title":""},{"docid":"6825950f347a4b9e3094f038be9893ca","score":"0.58306074","text":"get audioLanguage() {\n return this._audioLanguage;\n }","title":""},{"docid":"b2646da31e9a7106538713de1d15748b","score":"0.5828526","text":"set_language(){\n /* the data coming from the post change the source of the dashboard at the index of this specific widget*/\n if (this.parentSource) {\n this.post(\n this.root + 'actions/define_path_lang', {\n id_option: this.source.id,\n language: this.source.language,\n id_project: this.id_project\n }, (d) => {\n if ( d.success ){\n delete d.success;\n delete d.time;\n this.$nextTick( () => {\n this.source.data_widget = d.data_widget;\n this.remake_cache();\n appui.success(bbn._('Source language set'));\n this.$forceUpdate();\n });\n }\n }\n );\n }\n }","title":""},{"docid":"e58c8abe1f6393e340b05f05c44ce815","score":"0.5809924","text":"function setLanguage() {\n try {\n var grailsLocale = GLOBAL_LOCALE_CONF.locale;\n var language = localStorage.getItem('language');\n\n // In case this is the first time setting system wide lang\n if(!language) {\n language = grailsLocale;\n }\n\n // If language on url then we do nothing\n // Using .indexOf() instead of .includes() because we need to support IE11\n if(window.location.search.indexOf('lang=') === -1) {\n // If local storage lang is the same as session then all is well in the world\n if(language !== grailsLocale) {\n window.location.search += '&lang=' + language; // Reload the page\n }\n } else {\n localStorage.setItem('language', grailsLocale);\n }\n } catch(e) {\n // localStorage not available\n }\n}","title":""},{"docid":"8bf5359006572985946238aaf4822ea0","score":"0.5797543","text":"function changeLanguage() {\n $i18next.options.lng = $scope.user.language;\n }","title":""},{"docid":"659338154b848229176c96441d6cb6f1","score":"0.5772976","text":"async function setLanguage() {\n language = $(\"select.language-picker\").val();\n localStorage.language = language;\n editor.session.setMode(\"ace/mode/\" + languages[language].aceName);\n if (localStorage[language + \"-\" + thisProblem] == undefined) {\n localStorage[language + \"-\" + thisProblem] = await getLanguageDefault(language);\n editor.setValue(localStorage[language + \"-\" + thisProblem]);\n } else {\n editor.setValue(localStorage[language + \"-\" + thisProblem]);\n }\n }","title":""},{"docid":"cac77a321fa2c707e9a6f7d19107fd47","score":"0.5769764","text":"function setLanguage(language, avoidPersisting) {\n if (avoidPersisting === void 0) { avoidPersisting = false; }\n var doc = Object(__WEBPACK_IMPORTED_MODULE_0__dom_getDocument__[\"a\" /* getDocument */])();\n if (doc) {\n doc.documentElement.setAttribute('lang', language);\n }\n if (!avoidPersisting) {\n Object(__WEBPACK_IMPORTED_MODULE_1__localStorage__[\"b\" /* setItem */])('language', language);\n }\n _language = language;\n}","title":""},{"docid":"cac77a321fa2c707e9a6f7d19107fd47","score":"0.5769764","text":"function setLanguage(language, avoidPersisting) {\n if (avoidPersisting === void 0) { avoidPersisting = false; }\n var doc = Object(__WEBPACK_IMPORTED_MODULE_0__dom_getDocument__[\"a\" /* getDocument */])();\n if (doc) {\n doc.documentElement.setAttribute('lang', language);\n }\n if (!avoidPersisting) {\n Object(__WEBPACK_IMPORTED_MODULE_1__localStorage__[\"b\" /* setItem */])('language', language);\n }\n _language = language;\n}","title":""},{"docid":"2e04280911da6af2c60a8da66f3d6953","score":"0.5762271","text":"function changeLanguage() {\n\tif (L10N.getLanguageDisplayName() == \"English\") {\n\t\t// Change language\n\t\tL10N.setPreferredLanguage(\"mn\");\n\t\t\n\t\t// Show dialog\n Ti.UI.createAlertDialog({\n title:\"New Language Selected\",\n message:\"Mongolian is now the selected language. Please restart the app to complete the change.\"\n }).show();\t\t\n\t} else {\n\t\t// Change language\n\t\tL10N.setPreferredLanguage(\"en\");\n\t\t\n\t\t// Show dialog\n Ti.UI.createAlertDialog({\n title:\"New Language Selected\",\n message:\"English is now the selected language. Please restart the app to complete the change.\"\n }).show();\t\t\n\t}\n}","title":""},{"docid":"10851bc27650b692ccf259cbee36e931","score":"0.5761928","text":"function changeLang(language) {\n\n if(langExists(language)){\t\n\n pageLang = language;\n\n setSessionLang(pageLang);\n\n $.each($(\".translatable\"),function(index,field) {\n\t\t\n changeFieldText(field , pageLang);\n\n \t});\n\n }else{\n console.warn(\"Trying to go to unexisting language [\" + language + \"]\");\n } \n\t\n}","title":""},{"docid":"5d2306c4e44cc34f52d12b50d94c9caf","score":"0.5721908","text":"function Language () {\n this._languages = {};\n this._name = '';\n this._cache = false;\n this._undefinedTextMessage = '';\n this._domAttributeName = 'data-langTextName';\n this._domAttributeTarget = 'data-langTextTarget';\n this._cookieName = 'language';\n this._saveCookie = false;\n this._cookieLifeTime = 3600 * 24 * 365 * 1000;\n \n this.onLoadComplete = null;\n this.onLoadError = null;\n}","title":""},{"docid":"07046b555e7c724e1ebc5bafbbcf0390","score":"0.5710792","text":"function setLanguage(language, avoidPersisting) {\r\n if (avoidPersisting === void 0) { avoidPersisting = false; }\r\n var doc = dom_1.getDocument();\r\n if (doc) {\r\n doc.documentElement.setAttribute('lang', language);\r\n }\r\n if (!avoidPersisting) {\r\n localStorage_1.setItem('language', language);\r\n }\r\n _language = language;\r\n}","title":""},{"docid":"b0f712ec62ca58ddb574923898faf9fe","score":"0.5702015","text":"setPageLanguage() {\n document.documentElement.lang = getLanguage();\n }","title":""},{"docid":"b82eeb560670720661be9b561ad87ee4","score":"0.56976074","text":"function setLanguage(language, avoidPersisting) {\n if (avoidPersisting === void 0) { avoidPersisting = false; }\n var doc = dom_1.getDocument();\n if (doc) {\n doc.documentElement.setAttribute('lang', language);\n }\n if (!avoidPersisting) {\n localStorage_1.setItem('language', language);\n }\n _language = language;\n}","title":""},{"docid":"b82eeb560670720661be9b561ad87ee4","score":"0.56976074","text":"function setLanguage(language, avoidPersisting) {\n if (avoidPersisting === void 0) { avoidPersisting = false; }\n var doc = dom_1.getDocument();\n if (doc) {\n doc.documentElement.setAttribute('lang', language);\n }\n if (!avoidPersisting) {\n localStorage_1.setItem('language', language);\n }\n _language = language;\n}","title":""},{"docid":"b82eeb560670720661be9b561ad87ee4","score":"0.56976074","text":"function setLanguage(language, avoidPersisting) {\n if (avoidPersisting === void 0) { avoidPersisting = false; }\n var doc = dom_1.getDocument();\n if (doc) {\n doc.documentElement.setAttribute('lang', language);\n }\n if (!avoidPersisting) {\n localStorage_1.setItem('language', language);\n }\n _language = language;\n}","title":""},{"docid":"9d9443b2debdd5353a20c28c58dee75e","score":"0.5684075","text":"getLanguage() {\n return this._language;\n }","title":""},{"docid":"44422fe0b8f78e93485809fc8b4c8306","score":"0.56649977","text":"function setLang(lang) {\n console.log(\"Setting active language to \" + lang);\n\n // set a cookie\n document.cookie = \"lang=\" + lang;\n\n i18nTexts.forEach(function(i18nText) {\n i18nText.reRender(lang);\n });\n}","title":""},{"docid":"e3fe1f2dda13bfdea8b23273ea3516fe","score":"0.5656847","text":"function validateLocaleAndSetLanguage(locale, sys, errors) {\n var matchResult = /^([a-z]+)([_\\-]([a-z]+))?$/.exec(locale.toLowerCase());\n if (!matchResult) {\n if (errors) {\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Locale_must_be_of_the_form_language_or_language_territory_For_example_0_or_1, \"en\", \"ja-jp\"));\n }\n return;\n }\n var language = matchResult[1];\n var territory = matchResult[3];\n // First try the entire locale, then fall back to just language if that's all we have.\n // Either ways do not fail, and fallback to the English diagnostic strings.\n if (!trySetLanguageAndTerritory(language, territory, errors)) {\n trySetLanguageAndTerritory(language, /*territory*/undefined, errors);\n }\n // Set the UI locale for string collation\n ts.setUILocale(locale);\n function trySetLanguageAndTerritory(language, territory, errors) {\n var compilerFilePath = ts.normalizePath(sys.getExecutingFilePath());\n var containingDirectoryPath = ts.getDirectoryPath(compilerFilePath);\n var filePath = ts.combinePaths(containingDirectoryPath, language);\n if (territory) {\n filePath = filePath + \"-\" + territory;\n }\n filePath = sys.resolvePath(ts.combinePaths(filePath, \"diagnosticMessages.generated.json\"));\n if (!sys.fileExists(filePath)) {\n return false;\n }\n // TODO: Add codePage support for readFile?\n var fileContents = \"\";\n try {\n fileContents = sys.readFile(filePath);\n } catch (e) {\n if (errors) {\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Unable_to_open_file_0, filePath));\n }\n return false;\n }\n try {\n ts.localizedDiagnosticMessages = JSON.parse(fileContents);\n } catch (e) {\n if (errors) {\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Corrupted_locale_file_0, filePath));\n }\n return false;\n }\n return true;\n }\n }","title":""},{"docid":"73b0a7918d93cdf0aed2e0680a3d4769","score":"0.56447124","text":"function validateLocaleAndSetLanguage(locale, sys, errors) {\n var matchResult = /^([a-z]+)([_\\-]([a-z]+))?$/.exec(locale.toLowerCase());\n if (!matchResult) {\n if (errors) {\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Locale_must_be_of_the_form_language_or_language_territory_For_example_0_or_1, \"en\", \"ja-jp\"));\n }\n return;\n }\n var language = matchResult[1];\n var territory = matchResult[3];\n // First try the entire locale, then fall back to just language if that's all we have.\n // Either ways do not fail, and fallback to the English diagnostic strings.\n if (!trySetLanguageAndTerritory(language, territory, errors)) {\n trySetLanguageAndTerritory(language, /*territory*/ undefined, errors);\n }\n // Set the UI locale for string collation\n ts.setUILocale(locale);\n function trySetLanguageAndTerritory(language, territory, errors) {\n var compilerFilePath = ts.normalizePath(sys.getExecutingFilePath());\n var containingDirectoryPath = ts.getDirectoryPath(compilerFilePath);\n var filePath = ts.combinePaths(containingDirectoryPath, language);\n if (territory) {\n filePath = filePath + \"-\" + territory;\n }\n filePath = sys.resolvePath(ts.combinePaths(filePath, \"diagnosticMessages.generated.json\"));\n if (!sys.fileExists(filePath)) {\n return false;\n }\n // TODO: Add codePage support for readFile?\n var fileContents = \"\";\n try {\n fileContents = sys.readFile(filePath);\n }\n catch (e) {\n if (errors) {\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Unable_to_open_file_0, filePath));\n }\n return false;\n }\n try {\n ts.localizedDiagnosticMessages = JSON.parse(fileContents);\n }\n catch (e) {\n if (errors) {\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Corrupted_locale_file_0, filePath));\n }\n return false;\n }\n return true;\n }\n }","title":""},{"docid":"673c21a11606f314785f602ed779ea2c","score":"0.5642612","text":"function setLanguage(language) {\r\n\t\tif (mui && language && mui.language === language)\r\n\t\t\treturn;\r\n\r\n\t\tmui = new TeraToolboxMUI(language);\r\n\t\t$(\"*\").each(function () {\r\n\t\t\tconst str = $(this).attr(\"mui\");\r\n\t\t\tif (str) {\r\n\t\t\t\t$(this).text(mui.get(str));\r\n\t\t\t} else {\r\n\t\t\t\tconst str_html = $(this).attr(\"mui-html\");\r\n\t\t\t\tif (str_html)\r\n\t\t\t\t\t$(this).html(mui.get(str_html));\r\n\t\t\t}\r\n\t\t});\r\n\t}","title":""},{"docid":"beabb354ff16865afbe0dcdab3b3d0e8","score":"0.56196475","text":"get contentLanguage() {\n return this.getStringAttribute('content_language');\n }","title":""},{"docid":"eae81c305eb9ba01f8df5a275bee50c2","score":"0.56182826","text":"function validateLocaleAndSetLanguage(locale, sys, errors) {\n var matchResult = /^([a-z]+)([_\\-]([a-z]+))?$/.exec(locale.toLowerCase());\n if (!matchResult) {\n if (errors) {\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Locale_must_be_of_the_form_language_or_language_territory_For_example_0_or_1, \"en\", \"ja-jp\"));\n }\n return;\n }\n var language = matchResult[1];\n var territory = matchResult[3];\n // First try the entire locale, then fall back to just language if that's all we have.\n // Either ways do not fail, and fallback to the English diagnostic strings.\n if (!trySetLanguageAndTerritory(language, territory, errors)) {\n trySetLanguageAndTerritory(language, /*territory*/undefined, errors);\n }\n function trySetLanguageAndTerritory(language, territory, errors) {\n var compilerFilePath = ts.normalizePath(sys.getExecutingFilePath());\n var containingDirectoryPath = ts.getDirectoryPath(compilerFilePath);\n var filePath = ts.combinePaths(containingDirectoryPath, language);\n if (territory) {\n filePath = filePath + \"-\" + territory;\n }\n filePath = sys.resolvePath(ts.combinePaths(filePath, \"diagnosticMessages.generated.json\"));\n if (!sys.fileExists(filePath)) {\n return false;\n }\n // TODO: Add codePage support for readFile?\n var fileContents = \"\";\n try {\n fileContents = sys.readFile(filePath);\n } catch (e) {\n if (errors) {\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Unable_to_open_file_0, filePath));\n }\n return false;\n }\n try {\n ts.localizedDiagnosticMessages = JSON.parse(fileContents);\n } catch (e) {\n if (errors) {\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Corrupted_locale_file_0, filePath));\n }\n return false;\n }\n return true;\n }\n }","title":""},{"docid":"11f5256a4b611f2b662bdabd621019a4","score":"0.56101966","text":"function getLanguage() {\n\t return 'en-us';\n\t}","title":""},{"docid":"11f5256a4b611f2b662bdabd621019a4","score":"0.56101966","text":"function getLanguage() {\n\t return 'en-us';\n\t}","title":""},{"docid":"6da05fa6de9f400e61012250f8f6c7bc","score":"0.5607824","text":"setDocumentLanguage() {\n document.documentElement.lang = this.locale\n gtag('event', 'language_change', {\n 'event_category': 'language',\n 'event_label': this.language\n })\n }","title":""},{"docid":"fc058d61584f0a8c71e4ffe925aebcc6","score":"0.5602593","text":"function setLocalization(locale) {\r\n\r\n if(locale != \"en\")\r\n locale = \"cn\";\r\n\r\n try {\r\n jQuery.i18n.properties( {\r\n name:'Messages',\r\n path:'properties/',\r\n mode:'map',\r\n language:locale,\r\n callback: function() {\r\n }\r\n });\r\n } catch(err) {\r\n var fileref=document.createElement('script');\r\n fileref.setAttribute(\"type\",\"text/javascript\");\r\n fileref.setAttribute(\"src\", 'js/jquery/jquery.i18n.properties-1.0.4.js');\r\n document.getElementsByTagName(\"head\")[0].appendChild(fileref);\r\n setLocalization(locale);\r\n }\r\n}","title":""},{"docid":"31e830bbb47a3273a18015e4253f5b8d","score":"0.5596705","text":"useLanguage(lg) {\n let cityValue = this.cityForm.controls[\"dropdownCity\"].value; // obtain de select Value\n this.translate.use(lg); // Change the language\n if (lg == 'es') {\n this.spanish = true;\n }\n else {\n this.spanish = false;\n }\n if (cityValue != \"\" && cityValue != undefined && cityValue != null) {\n this.fillWeather(cityValue, lg);\n }\n }","title":""},{"docid":"85c31dc17798af7f0ac69aa1ec8258b2","score":"0.55913544","text":"setLanguage(language) {\n this.keywords = this.rules.getKeywords();\n if (!this.keywords) {\n throw new Error(\"Language not supported yet: \" + language || \"\");\n }\n this.keywordEntries = Object.entries(this.keywords);\n this.$rules = this.getRules();\n this.normalizeRules();\n // this.embedRules(DocCommentHighlightRules, \"doc-\", [ DocCommentHighlightRules.getEndRule(\"start\") ]);\n }","title":""},{"docid":"820de3ed71f93a91b41d8f85fed406b6","score":"0.555966","text":"_embelishI18n(message) {\r\n if (this.layer.config.i18n && this.layer.config.i18n.enabled === true) {\r\n message.language = this.layer.config.i18n.language;\r\n message.locale = this.layer.config.i18n.locale;\r\n }\r\n }","title":""},{"docid":"63d1aa0e84d513108f27064da1ee5502","score":"0.55547494","text":"function setLanguage (lang) {\n\ti18n.global.locale.value = lang;\n\tdocument.querySelector('html').setAttribute('lang', lang);\n\tlocalStorage.setItem('VueAppLanguage', lang);\n\treturn lang;\n}","title":""},{"docid":"3e7f555358b0bbbfd9d1ed877746c7c5","score":"0.55451983","text":"get code() { return gLanguage; }","title":""},{"docid":"3e7f555358b0bbbfd9d1ed877746c7c5","score":"0.55451983","text":"get code() { return gLanguage; }","title":""},{"docid":"92007475fe23825850e4676ab8411fda","score":"0.5545031","text":"set languagesList(value) {\n this._languagesList = value;\n }","title":""},{"docid":"345f16856ffb22da9f6d83fac120023e","score":"0.55402017","text":"get isSupportedLanguage() {\n return this.SUPPORTED_LANGUAGES.indexOf(this.translateService.currentLang) > -1;\n }","title":""},{"docid":"e07cf191092ceed43cb628156b1eec45","score":"0.5529569","text":"function setupLanguage() {\n\t\t\tfunction validateLanguage( sl ) {\n\t\t\t\treturn sl == undefined || _language.supportedLanguages.indexOf( sl ) == -1;\n\t\t\t}\n\t\t\tvar selectedLanguage = Tools.getURLParams( 'lang' );\n\t\t\tif ( validateLanguage( selectedLanguage ) ) selectedLanguage = _cookies.readCookie( 'language' );\n\t\t\tif ( validateLanguage( selectedLanguage ) ) selectedLanguage = _language.selectedLanguage;\n\t\t\t_language.set( \"selectedLanguage\", selectedLanguage );\n\n\t\t\t_cookies.createCookie( 'language', _language.selectedLanguage );\n\t\t}","title":""},{"docid":"b52a83f8fbd555f73c6948eb64841c0d","score":"0.5518118","text":"function onChangeLanguage(e) {\n $('#languageBtn').html(_helper.toggleLanguage());\n }","title":""},{"docid":"c2b67ed106cff88a7957a2f7631f6c00","score":"0.55118823","text":"changeLanguage({ commit }, language) {\n commit('SET_LANGUAGE', language);\n localStorage.save('locale', language, true);\n }","title":""},{"docid":"e7963a2423e8618ceb00f2c3bedaa9e5","score":"0.55079484","text":"updateLanguage(newLanguage){\n this.webRtc.sendToAll('switchLanguage',\n {\n 'language': newLanguage\n })\n this.setState({'currentLanguage': newLanguage});\n }","title":""},{"docid":"d8844ef3f8bb21071da8169d1963fdbd","score":"0.55040264","text":"function setDocumentLanguage() {\n // set document language\n document.documentElement.setAttribute('lang', window.blog.language);\n}","title":""},{"docid":"42a63f7f55cfe4d1340e5f55d6704863","score":"0.54831517","text":"setLanguage (event) {\n\t\t this.setState({language: event.target.value});\n\t}","title":""},{"docid":"24a0bd7b49f53bc4b0e2eb084c39b694","score":"0.5479585","text":"function setFormLanguage() {\n \t$(\"#languageID\").val(formLanguage);\t\n\tconsole.log(\"lang:\" + $(\"#languageID\").val());\n}","title":""},{"docid":"c1d842c31af0885cddd53645d647e7b6","score":"0.5468689","text":"function translate()\n{\n switch (language)\n {\n case 'de':\n setTranslationVars('Verlauf des Risikos', 'jmd. zu Bashen', 'Risiko jmd. zu Bashen', 'Angriff', 'Angriffe');\n break;\n case 'en':\n setTranslationVars('Way of risk', 'to bash', 'Risk to bash', 'attack', 'attacks');\n confirmResetData = 'You are really sure to reset all the data?';\n settingsDialogCaption = 'Settings';\n break;\n case 'fr':\n setTranslationVars('Pas de risque', 'de bash', 'Risque de bash', 'attaque', 'attaques');\n break;\n default:\n setTranslationVars('Way of risk', 'to bash', 'Risk to bash', 'attack', 'attacks');\n break;\n }\n}","title":""},{"docid":"f8ea03c36bdc479683d0ee0ae7b302c4","score":"0.5461879","text":"function setLang(lang) {\n window.localStorage.setItem(key, lang);\n}","title":""},{"docid":"42a439d62170d0ee16fa1c3475eca37e","score":"0.5459523","text":"localStorageLang() {\n return window.localStorage.getItem(TranslateService_1.SAVE_LANGUAGE_KEY);\n }","title":""},{"docid":"551322cc696fce1e06d24a96469759a6","score":"0.544803","text":"function langSwitch(lang){\n\t\tlanguage = lang;\n\t\t\n\t\tif(lang==\"en\"){\n\t\t\tdocument.getElementById(\"en\").setAttribute(\"disabled\", true);\n\t\t\tdocument.getElementById(\"fr\").removeAttribute(\"disabled\");\n\t\t}else{\n\t\t\tdocument.getElementById(\"fr\").setAttribute(\"disabled\", true);\n\t\t\tdocument.getElementById(\"en\").removeAttribute(\"disabled\");\n\t\t}\n\t\tchangeTextMenu(lang);\n\t\tchangeText() ;\n\t}","title":""},{"docid":"081aa78271190776a79af66e6d36cf29","score":"0.54364496","text":"function getFormLanguage() {\n \treturn formLanguage;\t\n}","title":""},{"docid":"af18d3e485ebaca7d522335f3fd80d4d","score":"0.54288447","text":"function setI18nLanguage (lang) {\n i18n.locale = lang;\n sessionStorage.setItem('lang', lang);\n document.querySelector('html').setAttribute('lang', lang);\n return lang;\n}","title":""},{"docid":"3b65e81c4a0ea8286b79d6ae69322a36","score":"0.5411171","text":"get languages() {\n return this[internalDefinition].languages || {}\n }","title":""},{"docid":"600ee32f0b98d33d4addc0f0662160a5","score":"0.5383336","text":"static set locale(value) { _locale = value; }","title":""},{"docid":"b67cb8631af617a45df2176c75116b58","score":"0.5369444","text":"function updateLanguage() {\n recognition.lang = languageSelector.selectedOptions[0].value;\n recognition.stop();\n console.log('>> BaBL: Language changed to', languageSelector.selectedOptions[0].text);\n for (var user in dataChannels) {\n if (dataChannels[user].isLocalUserRequestingTranslatedSubtitles) {\n socket.emit('subtitles request', 'start', user, languageSelector.selectedOptions[0].value);\n }\n }\n}","title":""},{"docid":"6e1e8637dbc5e86515d43970f6c1a7ca","score":"0.5362371","text":"changeLanguageStrings () {\r\n\t\tthis.sendMessageModalMarkup = \t\tthis.sendMessageModalMarkup.replace(\"REPLACE_modal_header_text\", this.labels.modal_header_text);\r\n\t\tthis.sendMessageModalMarkup = \t\tthis.sendMessageModalMarkup.replace(\"REPLACE_btn_cancel_text\", this.labels.btn_cancel_text);\r\n\t\tthis.sendMessageModalMarkup = \t\tthis.sendMessageModalMarkup.replace(\"REPLACE_btn_send_text\", this.labels.btn_send_text);\r\n\t\t\r\n\t\tBDfunctionsDevilBro.translateMessage(this.getName());\r\n\t}","title":""},{"docid":"f9fb091ec1d2cb83fa2935ce937c7845","score":"0.5360584","text":"_setLocale () {\n let now_locale = '';\n switch (formatMessage.setup().locale){\n case 'en':\n now_locale='en';\n break;\n case 'zh-tw':\n now_locale= 'zh-tw';\n break;\n default:\n now_locale='en';\n break;\n }\n return now_locale;\n }","title":""},{"docid":"d5d1fad6dffc3ec2e231497ba9b821f6","score":"0.53585804","text":"__initGlobalLanguageVariables() {\n const defaultLanguage = UdeS.Language.defaultLanguage;\n const supportedLanguages = UdeS.Language.supportedLanguages;\n\n // Retrieve the navigator language\n // @see http://gu.illau.me/posts/the-problem-of-user-language-lists-in-javascript/\n // @see https://developer.mozilla.org/en-US/docs/Web/API/NavigatorLanguage/language\n const navigatorLanguage = navigator.language ||\n navigator.userLanguage ||\n navigator.browserLanguage ||\n navigator.systemLanguage ||\n defaultLanguage;\n\n // Retrieve the navigator languages\n // (with a fallback if the navigator.languages is not defined)\n // @see https://developer.mozilla.org/fr/docs/Web/API/NavigatorLanguage/languages\n let navigatorLanguages = [navigatorLanguage];\n if (navigator.languages && navigator.languages.length) {\n navigatorLanguages = navigator.languages;\n }\n\n // Compute the global variables\n const globalLanguages = this.__computeGlobalLanguageVariables(\n defaultLanguage, supportedLanguages,\n navigatorLanguage, navigatorLanguages\n );\n\n // Update the global variables\n UdeS.Language.lang = UdeS.Language.lang || globalLanguages.language;\n UdeS.Language.navigatorLanguage = globalLanguages.navigatorLanguage;\n UdeS.Language.navigatorLanguages = globalLanguages.navigatorLanguages;\n\n // Set or update the lang attribute of the html element\n this._updateLangAttributeOfHtml(UdeS.Language.lang);\n }","title":""},{"docid":"8db7470ac612ecdfad3a82926dffdae3","score":"0.5350331","text":"function checkLang() {\n var user_language;\n user_language = user_language || locale.language\n \n console.log(user_language.slice(0, 2))\n var lang = user_language.slice(0, 2)\n console.log(lang)\n switch(lang) {\n case \"en\":\n message = \"To continue using K·pay test product please visit kzl.io/code and enter this code: \";\n inPurchase = \"Please complete the purchase process on kzl.io/code to unlock K·pay test product \";\n popUp = \"This is a paid app. After a 1 hour free trial, it requires a one-time payment of $1.00 to keep using it. \"; \n alreadyPaid = \"When the app asks for payment again, use the 'Already purchased' button at the bottom of purchase page to unlock for free.\"\n alreadyPaidButton = \"Already Paid\"\n break;\n case 'de':\n message = \"Um das K · pay-Testprodukt weiterhin zu verwenden, besuchen Sie kzl.io/code und geben Sie diesen Code ein: \";\n inPurchase = \"Bitte schließen Sie den Kaufvorgang auf kzl.io/code ab, um das K · pay-Testprodukt freizuschalten\";\n popUp = \"Dies ist eine kostenpflichtige App. Nach einer 1-stündigen kostenlosen Testversion ist eine einmalige Zahlung von 1,00 US-Dollar erforderlich, um sie weiterhin verwenden zu können.\"\n alreadyPaid = \"Wenn die App erneut zur Zahlung auffordert, können Sie sie über die Schaltfläche Bereits gekauft am unteren Rand der Kaufseite kostenlos entsperren.\"\n alreadyPaidButton = \"Bereits bezahlt\"\n console.log(\"German\")\n case 'fr':\n inPurchase = \"Veuillez compléter le processus d'achat sur kzl.io/code pour déverrouiller le produit de test K · pay\";\n message = \"Pour continuer à utiliser le produit de test K · pay, visitez le site kzl.io/code et entrez le code suivant: \";\n popUp = \"Ceci est une application payante. Après une heure d'essai gratuite, un paiement unique de 1,00 USD est nécessaire pour continuer à l'utiliser.\";\n alreadyPaid = \"Lorsque l'application demande à nouveau de payer, utilisez le bouton Déjà acheté en bas de la page d'achat pour le déverrouiller gratuitement.\"\n alreadyPaidButton = \"Déjà payé\"\n break;\n case 'es':\n message = \"Para continuar usando el producto de prueba K · pay, visite kzl.io/code e ingrese este código:\";\n inPurchase = \"Complete el proceso de compra en kzl.io/code para desbloquear el producto de prueba K · pay\";\n popUp = \"Esta es una aplicación de pago. Después de una prueba gratuita de 1 hora, se requiere un pago único de $ 1.00 para seguir usándolo.\";\n alreadyPaid = \"Cuando la aplicación solicite el pago nuevamente, use el botón Ya comprado en la parte inferior de la página de compra para desbloquear de forma gratuita.\"\n alreadyPaidButton = \"Ya Pagado\"\n break;\n case 'it':\n message = \"Per continuare a utilizzare il prodotto K · pay test, visitare kzl.io/code e inserire questo codice: \";\n inPurchase = \"Si prega di completare il processo di acquisto su kzl.io/code per sbloccare il prodotto di prova di pagamento K · Pay \";\n popUp = \"Questa è un'app a pagamento. Dopo 1 ora di prova gratuita, è necessario un pagamento una tantum di $ 1,00 per continuare a utilizzarlo.\";\n alreadyPaid = \"Quando l'app richiede nuovamente il pagamento, utilizza il pulsante Già acquistato nella parte inferiore della pagina di acquisto per sbloccarlo gratuitamente.\"\n alreadyPaidButton = \"Già pagato\"\n break;\n case 'ja':\n message = \"K・ペイテスト製品を引き続き使用するには、kzl.io/codeにアクセスして以下のコードを入力してください：\";\n inPurchase = \"K・ペイテスト製品のロックを解除するには、kzl.io/codeの購入手続きを完了してください\";\n popUp = \"これは有料アプリです。 1時間の無料試用期間を経た後も、それを使用し続けるには1回限りの$ 1.00の支払いが必要です。\"\n alreadyPaid = \"アプリがもう一度支払いを要求すると、購入ページの下部にある[購入済]ボタンを使用して無料でロックを解除します。\"\n alreadyPaidButton = \"既に支払いました\" \n break;\n default:\n message = \"To continue using K·pay test product please visit kzl.io/code and enter this code: \";\n inPurchase = \"Please complete the purchase process on kzl.io/code to unlock K·pay test product \";\n popUp = \"This is a paid app. After a 1 hour free trial, it requires a one-time payment of $1.00 to keep using it.\"; \n alreadyPaid = \"When the app asks for payment again, use the 'Already purchased' button at the bottom of purchase page to unlock for free.\"\n alreadyPaidButton = \"Already Paid\"\n break;\n }\n}","title":""},{"docid":"b43a7387fd9e72c88a7b5ccaecdfc973","score":"0.53395987","text":"function set_language(language) {\n\n\tif ( GLOBALS.AvailableLiterals.hasOwnProperty(language.value) )\t \n\t\t\t{ console.log('DEBUG : setting language: ' + language.value + '\\n');\t }\n\telse \t{\n\t \t\tconsole.log('DEBUG : LANGUAGE NOT FOUND IN DICTIONARY: ' + language.value +' \\n');\t \t\n\t \t\tconsole.log('DEBUG : USING DEFAULT LANGUAGE AS ENGLISH\\n');\n\t \t\tlanguage.value = \"English\" ;\n\t }\n\t\t\n\tGLOBALS.Literals = GLOBALS.AvailableLiterals[language.value].value;\n\t\t \n\tdocument.getElementById('step1_label_1').innerHTML=GLOBALS.Literals.step1_label_1;\n\tdocument.getElementById('step1_label_3').innerHTML=GLOBALS.Literals.step1_label_3;\n\tdocument.getElementById('step1_label_4').innerHTML=GLOBALS.Literals.step1_label_4;\n\tdocument.getElementById('step1_label_5').innerHTML=GLOBALS.Literals.step1_label_5;\n\tdocument.getElementById('step1_label_6').innerHTML=GLOBALS.Literals.step1_label_6;\n\tdocument.getElementById('step1_label_8').innerHTML=GLOBALS.Literals.step1_label_8;\n\tdocument.getElementById('step1_label_9').innerHTML=GLOBALS.Literals.step1_label_9;\n\tdocument.getElementById('step1_label_10').innerHTML=GLOBALS.Literals.step1_label_10;\t\n\t$('#label_choose_size').html(GLOBALS.Literals.label_choose_size);\n\t$('#label_sculpture_material').html(GLOBALS.Literals.label_sculpture_material);\n\t$('#sculpture_material_1').html(GLOBALS.Literals.sculpture_material_1);\n\t$('#sculpture_material_2').html(GLOBALS.Literals.sculpture_material_2);\n\t$('#sculpture_material_3').html(GLOBALS.Literals.sculpture_material_3);\n\t$('#price_label').html(GLOBALS.Literals.price_label);\n\t$('#label_number_copies').html(GLOBALS.Literals.label_number_copies);\n\t$('#label_Resume_Options').html(GLOBALS.Literals.label_Resume_Options);\n\t$('#label_About_Make_it').html(GLOBALS.Literals.label_About_Make_it);\n\t$('#label_Close_application').html(GLOBALS.Literals.label_Close_application);\n\t$('#menu_about').html(GLOBALS.Literals.menu_about);\n\t$('#menu_sculpture_settings').html( GLOBALS.Literals.menu_sculpture_settings);\n\t$('#menu_gallery').html(GLOBALS.Literals.menu_gallery);\t\n\t$('#label_change_language').html(GLOBALS.Literals.label_change_language);\n\t$('#menu_change_language').html(GLOBALS.Literals.label_change_language);\t\n\t$('#label_choose_Settings').html(GLOBALS.Literals.label_choose_Settings);\n\t$('#label_Sculpture_Settings').html(GLOBALS.Literals.label_Sculpture_Settings); \t\n\t$('#boton_paypal').attr(\"src\", GLOBALS.Literals.paypal_button);\t\n\t$('#label_accept_terms').html(GLOBALS.Literals.label_accept_terms); \t\t\n\t$('#now_conecting_Paypal').html(GLOBALS.Literals.now_conecting_Paypal);\n\t$('#now_file_uploading').html(GLOBALS.Literals.now_file_uploading);\t\n\t$('#now_file_uploaded').html(GLOBALS.Literals.now_file_uploaded);\n\t$('#now_file_uploaded_thank_text').html(GLOBALS.Literals.now_file_uploaded_thank_text );\t\n\t$('#label_noArtistAvailable').html(GLOBALS.Literals.label_noArtistAvailable);\t\n \t$('#label_your_artist').html(GLOBALS.Literals.label_your_artist);\n\t$('#label_your_artist').html(GLOBALS.Literals.label_your_artist); \n\t$('#website').html(GLOBALS.Literals.artist_website);\t\n\tdocument.getElementById('tutorial_1').innerHTML=GLOBALS.Literals.tutorial_1;\n\tdocument.getElementById('tutorial_2').innerHTML=GLOBALS.Literals.tutorial_2;\n\tdocument.getElementById('tutorial_3').innerHTML=GLOBALS.Literals.tutorial_3;\n\tdocument.getElementById('tutorial_4').innerHTML=GLOBALS.Literals.tutorial_4;\n\tdocument.getElementById('tutorial_5').innerHTML=GLOBALS.Literals.tutorial_5;\n\tdocument.getElementById('tutorial_6').innerHTML=GLOBALS.Literals.tutorial_6;\n\tdocument.getElementById('tutorial_7').innerHTML=GLOBALS.Literals.tutorial_7;\t\n\tdocument.getElementById('label_number_figures').innerHTML=GLOBALS.Literals.label_number_figures;\n\tdocument.getElementById('label_option_number_figures_1_or_2').innerHTML=GLOBALS.Literals.label_option_number_figures_1_or_2;\n\tdocument.getElementById('label_option_number_figures_group').innerHTML=GLOBALS.Literals.label_option_number_figures_group;\t\n\t\n}","title":""},{"docid":"051fceb31e9a627e6033111aa9a20745","score":"0.53385735","text":"constructor() {\n super();\n this.language = '';\n }","title":""},{"docid":"bf31c0378ea48f5df160a119a453b5ac","score":"0.5332507","text":"wait_for_language_known() {\n\t\treturn this.language_known;\n\t}","title":""},{"docid":"f54319f5fd1f6a9a8bac0af06d660153","score":"0.5328609","text":"get currentLang() {\n return this.latestLang;\n }","title":""},{"docid":"d005583cea2b4ba426e45e620bf2c2a9","score":"0.5317119","text":"function setTopLanguage(langName){\n progLang.innerText = langName\n }","title":""},{"docid":"908620c4e5a57eb573f6ba15e4f540e7","score":"0.53119516","text":"function change_lang(val)\n{\n\tlang \t\t = val;\n\tchange_lang_ = true;\n\tdisplay();\n\tchange_lang_ = false;\n}","title":""},{"docid":"8c16ebdf4c38fca67f4b2ec8fd015527","score":"0.53087085","text":"function choixLangue() {\nif (boutonlangue.selection.index == 0)\n{\nDutranslator.setLanguage('en');\napp.settings.saveSetting('duik','lang','en');\n}\nfor (var i = 0 ; i < Dutranslator.languages.length ; i++)\n{\nif (Dutranslator.languages[i][1] == boutonlangue.selection.text)\n{\nDutranslator.setLanguage(Dutranslator.languages[i][0]);\napp.settings.saveSetting('duik','lang',Dutranslator.languages[i][0]);\nbreak;\n}\n}\n}","title":""},{"docid":"8b80cfe7f312d5dec2039540b70bda3e","score":"0.5274639","text":"function UpdateLanguage(event) {\n update_language(event.target.value);\n i18n.changeLanguage(event.target.value);\n //Locale is retrieved from the i18n translations therefore dispatch the update after changing the language\n update_locale(t(`common:locale`));\n update_region(t(`common:region`));\n }","title":""},{"docid":"c42c99beb56e07af14516261830b634e","score":"0.526506","text":"set locale(_locale) {\n let message = null;\n try {\n if (!Object.keys(this[localeList]).includes(_locale)) {\n throw new Error(ERROR.NO_LOCALE);\n }\n this[locale] = _locale;\n this[set](_locale);\n message = 'OK';\n } catch (e) {\n ({ message } = e);\n }\n return message;\n }","title":""},{"docid":"576f7d9e93a6b087be1bc0c8fb6a69ce","score":"0.5263912","text":"function setLanguages() {\n\n switch (setLanguage) {\n case Languages.ENGLISH:\n daytime_night = en_daytime_night;\n daytime_morning = en_daytime_morning;\n daytime_noon = en_daytime_noon;\n daytime_afternoon = en_daytime_afternoon;\n daytime_evening = en_daytime_evening;\n\n greeting_night = en_greeting_night;\n greeting_morning = en_greeting_morning;\n greeting_noon = en_greeting_noon;\n greeting_afternoon = en_greeting_afternoon;\n greeting_evening = en_greeting_evening;\n\n sunday = en_sunday;\n monday = en_monday;\n tuesday = en_tuesday;\n wednesday = en_wednesday;\n thursday = en_thursday;\n friday = en_friday;\n saturday = en_saturday;\n\n abbreviation_sunday = en_abbreviation_sunday;\n abbreviation_monday = en_abbreviation_monday;\n abbreviation_tuesday = en_abbreviation_tuesday;\n abbreviation_wednesday = en_abbreviation_wednesday;\n abbreviation_thursday = en_abbreviation_thursday;\n abbreviation_friday = en_abbreviation_friday;\n abbreviation_saturday = en_abbreviation_saturday;\n\n january = en_january;\n february = en_february;\n march = en_march;\n apil = en_april;\n may = en_may;\n june = en_june;\n july = en_july;\n august = en_august;\n september = en_september;\n october = en_october;\n november = en_november;\n december = en_december;\n\n greeting_startup = en_greeting_startup;\n\n date_pattern = en_date_pattern;\n upcoming_events_soon_pattern = en_upcoming_events_soon_pattern;\n\n app_search = en_app_search;\n app_email = en_app_email;\n app_youtube = en_app_youtube;\n app_calendar = en_app_calendar;\n app_news = en_app_news;\n\n google_account = en_google_account;\n settings = en_settings;\n back = en_back;\n only_mirror = en_only_mirror;\n\n settings_title = en_settings_title;\n calendar_title = en_calendar_title;\n email_title = en_email_title;\n news_title = en_news_title;\n google_account_title = en_google_account_title;\n\n google_account_function_heading_signed_in = en_google_account_function_heading_signed_in;\n google_account_function_heading_permissions = en_google_account_function_heading_permissions;\n google_account_function_permission_calendar = en_google_account_function_permission_calendar;\n google_account_function_permission_gmail = en_google_account_function_permission_gmail;\n google_account_function_permission_profile = en_google_account_function_permission_profile;\n google_account_function_heading_signed_out = en_google_account_function_heading_signed_out;\n google_account_function_heading_features = en_google_account_function_heading_features;\n google_account_function_feature_gmail = en_google_account_function_feature_gmail;\n google_account_function_feature_profile = en_google_account_function_feature_profile;\n google_account_function_feature_calendar = en_google_account_function_feature_calendar;\n\n settings_system_title = en_settings_system_title;\n settings_calendar_title = en_settings_calendar_title;\n settings_weather_title = en_settings_weather_title;\n\n settings_languages_subtitle = en_settings_languages_subtitle;\n settings_temperature_unit_subtitle = en_settings_temperature_unit_subtitle;\n settings_only_mirror_subtitle = en_settings_only_mirror_subtitle;\n settings_sources_subtitle = en_settings_sources_subtitle;\n settings_location_subtitle = en_settings_location_subtitle;\n\n settings_english_label = en_settings_english_label;\n settings_german_label = en_settings_german_label;\n settings_celsius_label = en_settings_celsius_label;\n settings_farenheit_label = en_settings_farenheit_label;\n settings_show_nothing_label = en_settings_show_nothing_label;\n settings_show_quote_label = en_settings_show_quote_label;\n settings_normal_entries_label = en_settings_normal_entries_label;\n settings_birthdays_label = en_settings_birthdays_label;\n settings_holidays_label = en_settings_holidays_label;\n\n settings_location_placeholder = en_settings_location_placeholder;\n break;\n case Languages.GERMAN:\n daytime_night = de_daytime_night;\n daytime_morning = de_daytime_morning;\n daytime_noon = de_daytime_noon;\n daytime_afternoon = de_daytime_afternoon;\n daytime_evening = de_daytime_evening;\n\n greeting_night = de_greeting_night;\n greeting_morning = de_greeting_morning;\n greeting_noon = de_greeting_noon;\n greeting_afternoon = de_greeting_afternoon;\n greeting_evening = de_greeting_evening;\n\n sunday = de_sunday;\n monday = de_monday;\n tuesday = de_tuesday;\n wednesday = de_wednesday;\n thursday = de_thursday;\n friday = de_friday;\n saturday = de_saturday;\n\n abbreviation_sunday = de_abbreviation_sunday;\n abbreviation_monday = de_abbreviation_monday;\n abbreviation_tuesday = de_abbreviation_tuesday;\n abbreviation_wednesday = de_abbreviation_wednesday;\n abbreviation_thursday = de_abbreviation_thursday;\n abbreviation_friday = de_abbreviation_friday;\n abbreviation_saturday = de_abbreviation_saturday;\n\n january = de_january;\n february = de_february;\n march = de_march;\n apil = de_april;\n may = de_may;\n june = de_june;\n july = de_july;\n august = de_august;\n september = de_september;\n october = de_october;\n november = de_november;\n december = de_december;\n\n greeting_startup = de_greeting_startup;\n\n date_pattern = de_date_pattern;\n upcoming_events_soon_pattern = de_upcoming_events_soon_pattern;\n\n app_search = de_app_search;\n app_email = de_app_email;\n app_youtube = de_app_youtube;\n app_calendar = de_app_calendar;\n app_news = de_app_news;\n\n google_account = de_google_account;\n settings = de_settings;\n back = de_back;\n only_mirror = de_only_mirror;\n\n settings_title = de_settings_title;\n calendar_title = de_calendar_title;\n email_title = de_email_title;\n news_title = de_news_title;\n google_account_title_base = de_google_account_title;\n\n google_account_function_heading_signed_in = de_google_account_function_heading_signed_in;\n google_account_function_heading_permissions = de_google_account_function_heading_permissions;\n google_account_function_permission_calendar = de_google_account_function_permission_calendar;\n google_account_function_permission_gmail = de_google_account_function_permission_gmail;\n google_account_function_permission_profile = de_google_account_function_permission_profile;\n google_account_function_heading_signed_out = de_google_account_function_heading_signed_out;\n google_account_function_heading_features = de_google_account_function_heading_features;\n google_account_function_feature_gmail = de_google_account_function_feature_gmail;\n google_account_function_feature_profile = de_google_account_function_feature_profile;\n google_account_function_feature_calendar = de_google_account_function_feature_calendar;\n\n settings_system_title = de_settings_system_title;\n settings_calendar_title = de_settings_calendar_title;\n settings_weather_title = de_settings_weather_title;\n\n settings_languages_subtitle = de_settings_languages_subtitle;\n settings_temperature_unit_subtitle = de_settings_temperature_unit_subtitle;\n settings_only_mirror_subtitle = de_settings_only_mirror_subtitle;\n settings_sources_subtitle = de_settings_sources_subtitle;\n settings_location_subtitle = de_settings_location_subtitle;\n\n settings_english_label = de_settings_english_label;\n settings_german_label = de_settings_german_label;\n settings_celsius_label = de_settings_celsius_label;\n settings_farenheit_label = de_settings_farenheit_label;\n settings_show_nothing_label = de_settings_show_nothing_label;\n settings_show_quote_label = de_settings_show_quote_label;\n settings_normal_entries_label = de_settings_normal_entries_label;\n settings_birthdays_label = de_settings_birthdays_label;\n settings_holidays_label = de_settings_holidays_label;\n\n settings_location_placeholder = de_settings_location_placeholder;\n break;\n }\n\n weatherFunction();\n timerFunction();\n if(signedIn){\n refreshCalendarEntryData();\n }\n}","title":""},{"docid":"d90a3bcf3c34dc00d5f254a27233c391","score":"0.52633184","text":"function set_editor_language(editor,language_code){\n\tget_editor_ime_selector(editor).selectLanguage(language_code);\n\t//Setup the default input method as configured\n\tif(TranslatorsDeskGlobals.default_input_methods(language_code)){\n\t\tset_editor_input_method(editor, TranslatorsDeskGlobals.default_input_methods(language_code))\n\t}\n}","title":""},{"docid":"22322c543db7f2fe376b3af1f1a2e4d0","score":"0.5260216","text":"function getLanguage() {\n \"use strict\";\n return AquaThiefGame.language;\n}","title":""},{"docid":"fbeb46171147d17590ede866e91a7027","score":"0.5259237","text":"function changeLanguage(languageCode) {\n recognition.lang = languageCode;\n}","title":""},{"docid":"842bbc7083600fa5cd1ca3ef9b7259a2","score":"0.5243472","text":"function MapLanguageToFlag(lang) {\n switch (lang) {\n case \"V\":\n lang = \"vn\";\n break;\n case \"I\":\n lang = \"id\";\n break;\n case \"E\":\n lang = \"gb\";\n break;\n case \"M\":\n lang = \"mm\";\n break;\n case \"T\":\n lang = \"et\";\n break;\n case \"K\":\n lang = \"ko\";\n break;\n default:\n lang = \"df\";\n }\n\n return lang;\n}","title":""},{"docid":"e0bae13b495f802beeb484e1641298f0","score":"0.52418673","text":"function setI18nLanguage (lang) {\n i18n.locale = lang;\n axios.defaults.headers.common['Accept-Language'] = lang;\n document.querySelector('html').setAttribute('lang', lang);\n return lang;\n}","title":""},{"docid":"2b37f5f0974994199ae7e709c15d9287","score":"0.52351516","text":"function setLanguageConfig(inStr) {\n if (typeof(Storage) !== \"undefined\") {\n // Web storage is supported\n\t\ttry {\n\t\t\tlocalStorage.setItem('TPBankUserLang', inStr);\n\t\t}\n\t\tcatch(err) {\n\t\t\tlogInfo('Browser not support local store');\n\t\t}\n }\n else {\n // Web storage is NOT supported\n logInfo('Browser not support local store');\n }\n}","title":""},{"docid":"433cb76b53d90642115311030bb40586","score":"0.5229038","text":"function LoginLibV18__setLanguageCode(languageCode) {\n return new Promise(function(resolve, reject) {\n // Block#: qR6iUAA45gzy77nbO/:I\n _that.LoginLibV18_currentLanguage = (com.fc.JavaScriptDistLib.TextLib.convertToText(languageCode));\n // Block#: gn,E,Emb!afJ|(k^T=Pl\n com.fc.JavaScriptDistLib.Storage.add('language', com.fc.JavaScriptDistLib.TextLib.convertToText(languageCode))\n });\n }","title":""},{"docid":"37bb88e8823d59352965825bc1de4c5d","score":"0.5217528","text":"function setModelLanguage(model, language) {\n StaticServices.modelService.get().setMode(model, StaticServices.modeService.get().getOrCreateMode(language));\n}","title":""},{"docid":"22e14ddacc62a2ddc0d555708920e627","score":"0.52147967","text":"getAvailableLanguages() {\n if (!this._availableLanguages) {\n this._availableLanguages = [];\n for (let language in this._props) {\n this._availableLanguages.push(language);\n }\n }\n return this._availableLanguages;\n }","title":""},{"docid":"9eab5be5397515cfa0fe28651eaab305","score":"0.5213731","text":"function changeLanguage(language)\n{\n\tvar createUser = false;\n\tvar resetPass= false;\n\n\tif(document.body.contains(document.getElementById(\"createUserDiv\"))) createUser = true;\n\tif(document.body.contains(document.getElementById(\"passwordResetDiv\"))) resetPass = true;\n\n\t/* Load the home page with the correct language */\n\tif(language == \"en\")\n\t{\n\t\twindow.location.href = 'index_en.html';\n\t}\n\telse\n\t{\n\t\twindow.location.href = 'index.html';\n\t}\n\n\t// DOES NOT WORK\n\n\t/* Inject in the page the code for the section the user was before of the language change. */\n\tif(createUser == true)\n\t{\n\t\tinjectCreateUser();\n\t}\n\telse if(resetPass == true)\n\t{\n\t\tinjectPasswordReset();\n\t}\n}","title":""},{"docid":"d5883eee979948d120f7413a02f6fb2d","score":"0.5212459","text":"function isSupportedByLangService(language) {\n switch (language) {\n case 'css':\n case 'scss':\n case 'less':\n return true;\n default:\n return false;\n }\n}","title":""},{"docid":"9cac597fb4db9c7697c9c58717b03134","score":"0.5200944","text":"onClickSwitchLanguage() {\n this.model.switchLanguage();\n this.render();\n }","title":""},{"docid":"e0bbaebe3a8b5f3b2d025059ad391591","score":"0.5199857","text":"function changeLanguage(lang)\r\n\t\t\t\t{\r\n\t\t\t\t\tvar langResources = getLanguageResources()[lang];\r\n\t\t\t\t\t\r\n\t\t\t\t\t//localStorage.setItem(\"uravupaalamLanguage\",JSON.stringify(lang));\r\n\t\t\t\t\t\r\n\t\t\t\t\t$(\"span[name='label']\").each(function(i, elt)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\t$(elt).text(langResources[$(elt).attr(\"caption\")]);\r\n\t\t\t\t\t});\r\n\r\n\t\t\t\t\t$(\"div[name='label']\").each(function(i, elt)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\t$(elt).text(langResources[$(elt).attr(\"caption\")]);\r\n\t\t\t\t\t});\r\n\t\t\t\t\t\r\n\t\t\t\t\t$(\"a[name='label']\").each(function(i, elt)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\t$(elt).text(langResources[$(elt).attr(\"caption\")]);\r\n\t\t\t\t\t});\r\n\t\t\t\t\t\r\n\t\t\t\t\t$(\"option[name='label']\").each(function(i, elt)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\t$(elt).text(langResources[$(elt).attr(\"caption\")]);\r\n\t\t\t\t\t});\r\n\t\t\t\t\t\r\n\t\t\t\t\tlocalStorage.setItem(\"uravupaalamLanguage\",JSON.stringify(lang));\r\n\t\t\t\t\t\r\n\t\t\t\t}","title":""},{"docid":"521e9dc87029f26e68859e5c8a948363","score":"0.518947","text":"function changeLanguage(lang){\n language = languages[lang];\n $(\"#current_language\").html(lang);\n editor.getSession().setMode(\"ace/mode/\"+language);\n if(isDriver){\n socket.emit(\"lang_change\", {language: lang});\n }\n}","title":""}],"string":"[\n {\n \"docid\": \"93e76965300e68e7a5fedb37f5b09110\",\n \"score\": \"0.6746043\",\n \"text\": \"get language () {\\r\\n\\t\\treturn this._language;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cf89c464e4f1893ee19c5074956fce1\",\n \"score\": \"0.6512211\",\n \"text\": \"get language() {\\n\\t\\treturn this.__language;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cf89c464e4f1893ee19c5074956fce1\",\n \"score\": \"0.6512211\",\n \"text\": \"get language() {\\n\\t\\treturn this.__language;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"568a68457a8cb8527f6564cd1f7e9ac3\",\n \"score\": \"0.639221\",\n \"text\": \"get language() {\\n return this._data.language;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0902bb0de7b35d166f1880fccdd85c95\",\n \"score\": \"0.63437986\",\n \"text\": \"setLanguage(language) {\\n //Check if exists a translation for the current language or if the default\\n //should be used\\n var bestLanguage = this._getBestMatchingLanguage(language, this._props);\\n var defaultLanguage = Object.keys(this._props)[0];\\n this._language = bestLanguage;\\n //Associate the language object to the this object\\n if (this._props[bestLanguage]) {\\n //delete default propery values to identify missing translations\\n for (key of this._defaultLanguageFirstLevelKeys){\\n delete this[key];\\n }\\n var localizedStrings = Object.assign({}, this._props[this._language]);\\n for (var key in localizedStrings) {\\n if (localizedStrings.hasOwnProperty(key)) {\\n this[key] = localizedStrings[key];\\n }\\n }\\n //Now add any string missing from the translation but existing in the default language\\n if (defaultLanguage !== this._language) {\\n localizedStrings = this._props[defaultLanguage];\\n this._fallbackValues(localizedStrings, this);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b0fccfcc2f9d7ac93a0884a4280b5ae\",\n \"score\": \"0.6326306\",\n \"text\": \"static setLanguage(name) {\\n novelData.novel.settings.language = name;\\n return UI.updateUILanguage();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b0fccfcc2f9d7ac93a0884a4280b5ae\",\n \"score\": \"0.6326306\",\n \"text\": \"static setLanguage(name) {\\n novelData.novel.settings.language = name;\\n return UI.updateUILanguage();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d36d491aef67e48ed5f777495f83bdac\",\n \"score\": \"0.62979853\",\n \"text\": \"set language(lang) {\\n // If lang matches current language, return\\n if (lang === this.lang) return\\n\\n lang = this.getLanguageKey(lang)\\n this.lang = lang\\n window.localStorage.setItem(Translator.LOCAL_STORAGE_KEY, lang)\\n this.translations = this.languages[lang]\\n this.locale = this.translations.locale\\n\\n this.setDocumentLanguage()\\n this.translate()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4a95f111e1525820e45c83fde852814\",\n \"score\": \"0.6192467\",\n \"text\": \"get lang() {\\n return this._lang;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"948798c5f65311ac7d19c24d3541b2a8\",\n \"score\": \"0.61483705\",\n \"text\": \"function setCanAddLanguage()\\n{\\n var langs = getLangLocsInEntry();\\n\\n if (langs.length == g_termbaseLanguages.length)\\n {\\n g_canAddLanguage = false;\\n }\\n else\\n {\\n g_canAddLanguage = true;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67d3d2a0773a8720efcf9bb13437b433\",\n \"score\": \"0.61354566\",\n \"text\": \"detectLanguage() {\\n let lang\\n\\n // if language is defined in querystring, use that one\\n const qs = window.location.search.substring(1)\\n const m = /lang=([A-z]+)/i.exec(qs)\\n if (m && m.length > 1) {\\n lang = m[1]\\n\\n // otherwise, check local storage\\n } else {\\n lang = window.localStorage.getItem(Translator.LOCAL_STORAGE_KEY)\\n }\\n\\n // If the language is not set as a query parameter\\n // and\\n // language is not set in localStore\\n // prompt for choice\\n if (!lang) this.prompt = true\\n\\n // this will validate the language in the setter before saving\\n this.language = lang\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e9cf3e7c6b20397455b2359ee0fd047\",\n \"score\": \"0.60581994\",\n \"text\": \"get language() {\\n return this._data.broadcaster_language;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56b10b56eb22cad0306c76ed8a994dbe\",\n \"score\": \"0.60372955\",\n \"text\": \"setLanguages(languages) {\\n // to be overloaded by subclasses\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf3965c938befab823928aca9cb4e204\",\n \"score\": \"0.59776616\",\n \"text\": \"isSavedLang () {\\n return this.$config.storage().has('locale')\\n ? JSON.parse(JSON.stringify(this.$config.storage().get('locale')))\\n : false\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8b9b8b1948efc389489dafbc86f2605\",\n \"score\": \"0.5975117\",\n \"text\": \"function setLanguage(newLang){\\r\\n\\tswitch (newLang) {\\r\\n\\t\\t// German - DE - by Stevieoo\\r\\n\\t\\tcase \\\"de\\\": \\taLang = [\\\"Aktivieren\\\", \\\"Angriffs-Email\\\", \\\"Angriffs-Alarm\\\", \\\"Spionage-Alarm\\\", \\\"Nachrichten-Alarm\\\", \\\"Auto-Login\\\", \\\"Du musst Deine eMail Adresse am Anfang des Codes einfügen, wenn Du eine eMail bekommen möchtest, wenn Du angegriffen wirst.\\\", \\\"Es muss eine funktionierende Email Adresse definiert werden, damit Du bei einem Angriff benachrichtigt wirst.\\\", \\\"Angriff in \\\", \\\"Unbekannte Angriffs-Zeit\\\", \\\"Du wirst angegriffen, aber die Flottendetails nicht nicht verfügbar.\\\", \\\"Ankunfts-Zeit\\\", \\\"Schiffe\\\", \\\"Von\\\", \\\"Nach\\\", \\\"Angriff\\\", \\\"OGame Angriff\\\", \\\"Autologin kann in Chrome nicht abgeschaltet werden. Bitte deaktiviere das Addon zum ausschalten des Autologin.\\\", \\\"OGame@Alarme.Queijo\\\", \\\"Das ist eine Testmail\\\", \\\"Das ist ein OGame@Alarm.Cheese Test\\\", \\\"OGame Alarm w/ Cheese\\\", \\\"Email für eingehene Alarme\\\", \\\"Test\\\", \\\"Ogame Alarm with Cheese - Optionen\\\", \\\"Minimale Reload-Zeit\\\", \\\"Maximale Reload-Zeit\\\", \\\"Prüfe auf alarme alle\\\", \\\"Speichern & Schließen\\\", \\\"Reload Typ Auswahl\\\", \\\"Sekunden\\\", \\\"Sprache\\\", \\\"Spenden!\\\", \\\"[OGAwC] Löschen aller cookies\\\", \\\"Bist Du sicher das Du alle OGAWC Cookies löschen möchtest? Hiermit werden deine Logindaten gelöscht und alle Einstellungen auf standard zurück gesetzt.\\\", \\\"Reset alles\\\", \\\"AutoLogin Konten\\\", \\\"Server\\\", \\\"Spieler\\\", \\\"Passwort\\\", \\\"AutoLogin\\\", \\\"Es gibts keine AutoLogin informationen. Bitte ausloggen und neu einloggen zum speichern der informationen.\\\", \\\"Ungültige Email! Beispiel: someone@somewhere.abc\\\", \\\"Eine Test Email wurde versendet! Wenn Sie kein Firefox verwenden könnte es nicht funktionieren. Denken Sie daran, das Sie etwas Spenden!\\\", \\\"Ungültige Einstellungen! Das minimum darf nicht kleiner als 100 Sekunden sein. Das Maximum darf nicht kleiner als 200 sein. Prüfen auf Angriffe darf nicht kleiner als 60 sein. Die Email Adresse muss ein @ und einen . und keine Leerzeichen enthalten.\\\\n'Alarm repeat' must be less than 'Check for Alarms'.\\\", \\\"Übersicht\\\", \\\"Löschen\\\", \\\"Repeat last audio alarm\\\", \\\"After\\\", \\\"(Less than 10 = OFF)\\\"];\\r\\n\\t\\t\\t\\t\\taLangIndex = 1;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t// Danish - DK - by Kin0x\\r\\n\\t\\tcase \\\"dk\\\": \\taLang = [\\\"Aktiver\\\", \\\"Angrebs email\\\", \\\"Angrebs Alarm\\\", \\\"Spionage Alarm\\\", \\\"Besked Alarm\\\", \\\"Auto Login\\\", \\\"Mangler emailURL!\\\", \\\"Du skal have en email indtastet i bunden for at kunne modtage beskeder omkring flåde angreb pr. mail.\\\", \\\"Indkommende angreb om \\\", \\\"Ukendt angrebs tid\\\", \\\"Du er under angreb, men der er ingen flåde detajler\\\", \\\"Ankommer kl.\\\", \\\"Skibe\\\", \\\"Fra\\\", \\\"Til\\\", \\\"Angreb\\\", \\\"OGame indkommende angreb\\\", \\\"AutoLogin kan ikke blive slået fra i Chrome!\\\", \\\"OGame@Alarm.Ost\\\", \\\"Dette er en test email!\\\", \\\"En test email så du kan se dit script virker!\\\", \\\"OGame Alarm med Ost\\\", \\\"Email for at modtage mails med angreb\\\", \\\"Send en test\\\", \\\"OGame Alarm Indstillinger\\\", \\\"Minimum opdateringstid (sek)\\\", \\\"Maksimum opdateringstid (sek)\\\", \\\"Check for alarms every\\\", \\\"Gem Indstillinger\\\", \\\"Select Reload Type\\\", \\\"sekund\\\", \\\"Sprog\\\", \\\"Donate!\\\", \\\"[OGAwC] Delete all cookies\\\", \\\"Are you sure you want to delete all OGAwC cookies?\\\\n\\\\nThis will delete your email and autologin information as well as reset all options to default.\\\", \\\"Reset All\\\", \\\"AutoLogin Accounts\\\", \\\"Server\\\", \\\"Player\\\", \\\"Password\\\", \\\"AutoLogin\\\", \\\"No AutoLogin account information. Please log out and log back in to save account information for AutoLogin.\\\", \\\"Improper Email. Please use the form: someone@somewhere.abc\\\", \\\"Test Email sent!\\\\n\\\\nThis may not work in non-FireFox browsers.\\\\n\\\\Remember this is not free, you should donate!\\\", \\\"Improper settings!\\\\n\\\\nMinimum cannot be set lower than 100 seconds.\\\\nMaximum cannot be set lower than 200 seconds.\\\\nCheck for Attacks cannot be set lower than 60.\\\\nThe email address must contain @ and . and no spaces.\\\\n'Alarm repeat' must be less than 'Check for Alarms'.\\\", \\\"Overview\\\", \\\"Delete\\\", \\\"Repeat last audio alarm\\\", \\\"After\\\", \\\"(Less than 10 = OFF)\\\"];\\r\\n\\t\\t\\t\\t\\taLangIndex = 2;\\r\\n \\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t// Portuguese - PL - by GL_notmypresident\\r\\n\\t\\tcase \\\"pt\\\": \\taLang = [\\\"Recarregar\\\", \\\"Email de ataque\\\", \\\"Alarme de ataque\\\", \\\"Alarme de espião\\\", \\\"Alarme mensagem\\\", \\\"Login automático\\\", \\\"Tens que preencher a variável EmailURL no topo do código. Para usar a opção de Email de ataque.\\\", \\\"Tens que inserir o teu email no fim da página do OGame para usar a opção de Email de ataque.\\\", \\\"Ataque em \\\", \\\"Tempo para o ataque desconhecido\\\", \\\"Estás a ser atacado, mas os detalhes da frota atacante são desconhecidos.\\\", \\\"Tempo de chegada\\\", \\\"Naves\\\", \\\"De\\\", \\\"Para\\\", \\\"Ataque\\\", \\\"Ataque no OGame\\\", \\\"Não é possível desactivar o Login Automático no Chrome. Tens que ir à página das extensões e desactivar o script para desactivar o Login automático.\\\", \\\"OGame@Alarme.Queijo\\\", \\\"Email de teste\\\", \\\"Um teste com queijo\\\", \\\"Alarme do OGame com queijo\\\", \\\"Email para receberes notificações de ataque\\\", \\\"Teste\\\", \\\"Ogame Alarm with Cheese Options\\\", \\\"Minimum reload time\\\", \\\"Maximum reload time\\\", \\\"Check for alarms every\\\", \\\"Salvar e Saída\\\", \\\"Select Reload Type\\\", \\\"segundo\\\", \\\"Linguagem\\\", \\\"Donate!\\\", \\\"[OGAwC] Delete all cookies\\\", \\\"Are you sure you want to delete all OGAwC cookies?\\\\n\\\\nThis will delete your email and autologin information as well as reset all options to default.\\\", \\\"Reset All\\\", \\\"AutoLogin Accounts\\\", \\\"Server\\\", \\\"Player\\\", \\\"Password\\\", \\\"AutoLogin\\\", \\\"No AutoLogin account information. Please log out and log back in to save account information for AutoLogin.\\\", \\\"Improper Email. Please use the form: someone@somewhere.abc\\\", \\\"Test Email sent!\\\\n\\\\nThis may not work in non-FireFox browsers.\\\\n\\\\Remember this is not free, you should donate!\\\", \\\"Improper settings!\\\\n\\\\nMinimum cannot be set lower than 100 seconds.\\\\nMaximum cannot be set lower than 200 seconds.\\\\nCheck for Attacks cannot be set lower than 60.\\\\nThe email address must contain @ and . and no spaces.\\\\n'Alarm repeat' must be less than 'Check for Alarms'.\\\", \\\"Overview\\\", \\\"Delete\\\", \\\"Repeat last audio alarm\\\", \\\"After\\\", \\\"(Less than 10 = OFF)\\\"];\\r\\n\\t\\t\\t\\t\\taLangIndex = 3;\\r\\n \\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t// Spanish - ES - by mohace\\r\\n\\t\\tcase \\\"es\\\":\\taLang = [\\\"Activar\\\", \\\"Ataque Emailer\\\", \\\"Ataque Alarm\\\", \\\"Espionaje Alarm\\\", \\\"Mensaje Alarm\\\", \\\"Auto Login\\\", \\\"Es necesario configurar la EmailURL en la parte superior del script para usar la alrarma de ataque entrante.\\\", \\\"Es necesario configurar la una direccion de email en la pantalla de opciones para las alertas de ataques entrantes.\\\", \\\"Ataque entrante en \\\", \\\"Hora de ataque desconocida\\\", \\\"Hay un ataque entrante, pero los detalles de la flota se desconocen\\\", \\\"Hora de llegada\\\", \\\"Naves\\\", \\\"Desde\\\", \\\"a\\\", \\\"Ataque\\\", \\\"OGame Ataque entrante\\\", \\\"No se puede desactivar AutoLogin en Chrome. Debe desactivar el script para deshabilitar el AutoLogin.\\\", \\\"OGame@Alarm.Queso\\\", \\\"Email de prueba\\\", \\\"Una prueba de este sabroso queso\\\", \\\"OGame Alarm c/ Queso\\\", \\\"Direccion Email para enviar alertas de ataque\\\", \\\"Prueba\\\", \\\"Opciones de Ogame Alarm con Queso\\\", \\\"Tiempo minimo de recarga\\\", \\\"Tiempo maximo de recarga\\\", \\\"Chequear alarmas cada\\\", \\\"Salvar & Cerrar\\\", \\\"Seleccionar el tipo de recarga\\\", \\\"segundos\\\", \\\"Lenguaje\\\", \\\"Donate!\\\", \\\"[OGAwC] Borrar todas las cookies\\\", \\\"Esta seguro de que quiere borrar todas las cookies de OGAwC?\\\\n\\\\nEsto borrará su configuracion de email (y la informacion de autologin en GreaseMonkey). Todas las opciones seran las predeterminadas.\\\", \\\"Resetear todo\\\", \\\"AutoLogin cuentas\\\", \\\"Servidor\\\", \\\"Jugador\\\", \\\"Password\\\", \\\"AutoLogin\\\", \\\"No hay informacion de AutoLogin. Por favor salga de ogame y vuelva a loguear para guardar la informacion para AutoLogin.\\\", \\\"Email incorrecto. Use el modelo: someone@somewhere.abc\\\", \\\"Email de prueba enviado!\\\\n\\\\nEsto puede no funcionar en navegadores diferentes a FireFox.\\\\n\\\\Recuerde que esto no es gratis. Haga una donacion!\\\", \\\"Configuracion incorrecta!\\\\n\\\\nEl minimo no puede ser menor a 120 seconds.\\\\nEl maximo no puede ser menor que 240 seconds.\\\\nEl tiempo de control por ataques no puede ser menor a 90 segundos..\\\\nLa direccion email debe contener @ and . y sin espacios.\\\\n'Alarm repeat' must be less than 'Check for Alarms'.\\\", \\\"Vision general\\\", \\\"Borrar\\\", \\\"Repeat last audio alarm\\\", \\\"After\\\", \\\"(Less than 10 = OFF)\\\"];\\r\\n\\t\\t\\t\\t\\taLangIndex = 4;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t// Dutch - NL - by Timmy M.\\r\\n\\t\\tcase \\\"nl\\\":\\taLang = [\\\"Activeer\\\", \\\"Val Emailer aan\\\", \\\"Aanval Alarm\\\", \\\"Spionage Alarm\\\", \\\"Berichtalarm\\\", \\\"Auto Login\\\", \\\"U moet de EmailURL bovenaan de code plaatsen om het Inkomend Aanval Email Alarm te gebruiken.\\\", \\\"U moet een geldig email adres gebruiken in het Opties scherm voor Inkomende Aanval Alarmeringen.\\\", \\\"Inkomende Aanval in \\\", \\\"Ongekende Aanvalstijd\\\", \\\"U wordt aangevallen maar de vloot details zijn niet beschikbaar.\\\", \\\"Aankomsttijd\\\", \\\"Schepen\\\", \\\"Van\\\", \\\"Naar\\\", \\\"Aanvallen\\\", \\\"OGame Inkomende Aanval\\\", \\\"Kan AutoLogin niet uitschakelen in Chrome. U zal het AutoLogin script moeten uitschakelen in je extensies.\\\", \\\"OGame@Alarm.Cheese\\\", \\\"Dit is een test email\\\", \\\"Een Kazige Test\\\", \\\"OGame Alarm met Kaas\\\" , \\\"Email adres om Aanvalsalarmen naar te sturen\\\", \\\"Test\\\", \\\"OGame Alarm met Kaas Opties\\\" , \\\"Minimum herlaadtijd\\\", \\\"Maximum herlaadtijd\\\", \\\"Alarm controleren iedere\\\", \\\"Opslaan & Afsluiten\\\", \\\"Selecteer Herlaad Type\\\", \\\"seconden\\\", \\\"Taal\\\", \\\"Doneren!\\\", \\\"[OGAmK] Alle cookies verwijderen\\\", \\\"Ben je zeker dat je alle OGAmK cookies wil verwijderen?\\\\n\\\\nDit zal je mail (en autologin informatie in GreaseMonkey) alsook alle instellingen en opties naar hun standaard terugstellen.\\\", \\\"Alles Resetten\\\", \\\"AutoLogin Profielen\\\", \\\"Server\\\", \\\"Speler\\\", \\\"Paswoord\\\", \\\"AutoLogin\\\", \\\"Geen AutoLogin profiel informatie. Gelieve uit - en terug in te loggen om profiel informatie voor AutoLogin te bewaren.\\\", \\\"Ongeldig Email Adres. Gelieve dit formaat te gebruiken: iemand@ergens.abc\\\", \\\"Test Email verzonden!\\\\n\\\\nDit kan mogelijk niet werken in niet-FireFox browsers.\\\\nWees indachtig dat dit niet gratis is, gelieve te doneren!\\\", \\\"Ongeldige Instellingen!\\\\n\\\\nMinimum kan niet lager dan 120 seconden zijn.\\\\nMaximum kan niet lager dan 240 seconden zijn.\\\\nAanvallen Controleren kan niet lager dan 90 zijn.\\\\nHet email adres moet @ en . bevatten maar geen spaties.\\\", \\\"Overzicht\\\", \\\"Verwijderen\\\", \\\"Repeat last audio alarm\\\", \\\"After\\\", \\\"(Less than 10 = OFF)\\\"];\\r\\n\\t\\t\\t\\t\\taLangIndex = 5;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t// English (Default) - ORG - by Pimp Trizkit\\r\\n\\t\\tcase \\\"org\\\": // 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49\\r\\n\\t\\tdefault:\\taLang = [\\\"Activate\\\", \\\"Attack Emailer\\\", \\\"Attack Alarm\\\", \\\"Espionage Alarm\\\", \\\"Message Alarm\\\", \\\"Auto Login\\\", \\\"You need to set the EmailURL at the top of the code. To use the Incoming Attack Email Alarm.\\\", \\\"You need to set a proper email address in the options screen for the Incoming Attack alerts.\\\", \\\"Incoming Attack in \\\", \\\"Unknown Attack Time\\\", \\\"You have an Incoming attack, but the fleet details are not available\\\", \\\"Arrival Time\\\", \\\"Ships\\\", \\\"From\\\", \\\"To\\\", \\\"Attack\\\", \\\"OGame Incoming Attack\\\", \\\"Can not turn off AutoLogin in Chrome. You will have to goto your extensions and disable the script to disable AutoLogin.\\\", \\\"OGame@Alarm.Cheese\\\", \\\"This is a test email\\\", \\\"One Cheesy Test\\\", \\\"OGame Alarm w/ Cheese\\\", \\\"Email address to send Incoming Attack alerts\\\", \\\"Test\\\", \\\"Ogame Alarm with Cheese Options\\\", \\\"Minimum reload time\\\", \\\"Maximum reload time\\\", \\\"Check for alarms every\\\", \\\"Save & Close\\\", \\\"Select Reload Type\\\", \\\"seconds\\\", \\\"Language\\\", \\\"Donate!\\\", \\\"[OGAwC] Delete all cookies\\\", \\\"Are you sure you want to delete all OGAwC cookies?\\\\n\\\\nThis will delete your email (and autologin information in GreaseMonkey) as well as reset all settings and options to default.\\\", \\\"Reset All\\\", \\\"AutoLogin Accounts\\\", \\\"Server\\\", \\\"Player\\\", \\\"Password\\\", \\\"AutoLogin\\\", \\\"No AutoLogin account information. Please log out and log back in to save account information for AutoLogin.\\\", \\\"Improper Email. Please use the form: someone@somewhere.abc\\\", \\\"Test Email sent!\\\\n\\\\nThis may not work in non-FireFox browsers.\\\\n\\\\Remember this is not free, you should donate!\\\", \\\"Improper settings!\\\\n\\\\nMinimum cannot be set lower than 100 seconds.\\\\nMaximum cannot be set lower than 200 seconds.\\\\nCheck for Attacks cannot be set lower than 60.\\\\nThe email address must contain @ and . and no spaces.\\\\n'Alarm repeat' must be less than 'Check for Alarms'.\\\", \\\"Overview\\\", \\\"Delete\\\", \\\"Repeat last audio alarm\\\", \\\"After\\\", \\\"(Less than 10 = OFF)\\\"];\\r\\n\\t\\t\\t\\t\\taLangIndex = 0;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t}\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05c577b3b43a262ccfed0214a8a6f50d\",\n \"score\": \"0.5967764\",\n \"text\": \"toggleLanguage(){\\n\\t\\tconst langs = this.app.getService(\\\"locale\\\"); //get Local service\\n\\t\\t\\n\\t\\t/*\\n\\t\\t Use this.getRoot() to get to the top Webix widget inside a JetView\\n\\t\\t Here it is Toolbar\\n\\t\\t*/\\n\\t\\tconst value = this.getRoot().queryView(\\\"segmented\\\").getValue(); //get Segmented value\\n\\t\\tlangs.setLang(value); //set Local value\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0410a280799243eeaad3967d29e256e\",\n \"score\": \"0.59435046\",\n \"text\": \"get language() {\\n return {\\n // get|set the document language (ISO-639-1)\\n get code() { return gLanguage; },\\n set code(lang) { loadLocale(lang, translateFragment); },\\n\\n // get the direction (ltr|rtl) of the current language\\n get direction() {\\n // http://www.w3.org/International/questions/qa-scripts\\n // Arabic, Hebrew, Farsi, Pashto, Urdu\\n var rtlList = ['ar', 'he', 'fa', 'ps', 'ur'];\\n return (rtlList.indexOf(gLanguage) >= 0) ? 'rtl' : 'ltr';\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0410a280799243eeaad3967d29e256e\",\n \"score\": \"0.59435046\",\n \"text\": \"get language() {\\n return {\\n // get|set the document language (ISO-639-1)\\n get code() { return gLanguage; },\\n set code(lang) { loadLocale(lang, translateFragment); },\\n\\n // get the direction (ltr|rtl) of the current language\\n get direction() {\\n // http://www.w3.org/International/questions/qa-scripts\\n // Arabic, Hebrew, Farsi, Pashto, Urdu\\n var rtlList = ['ar', 'he', 'fa', 'ps', 'ur'];\\n return (rtlList.indexOf(gLanguage) >= 0) ? 'rtl' : 'ltr';\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92e226b3272ae807208ca02a8c6a54e2\",\n \"score\": \"0.5874252\",\n \"text\": \"function SetLanguage(checkbox)\\n{\\n // toggle the check state of the checkbox that was clicked\\n devlangsMenu.ToggleCheckState(checkbox.id);\\n \\n // update the label of the dropdown menu\\n SetDropdownMenuLabel(devlangsMenu, devlangsDropdown);\\n\\t\\n // update the display of the document's items that are dependent on the devlang setting\\n\\tcodeBlockHandler();\\n\\tstyleSheetHandler(\\\"\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3dabb95d7248bd47f2207ae776c996c9\",\n \"score\": \"0.58683884\",\n \"text\": \"function set_lang_value(lang_)\\n\\t\\t\\t{\\n\\t\\t\\t\\tLangValue = lang_;\\n\\t\\t\\t\\tconsole.log('set lang:'+lang_);\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fae86968add60470cc200c999969b93\",\n \"score\": \"0.5865645\",\n \"text\": \"language(languageFile){\\n this._BotParameters.languageFile = languageFile;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0a8d9f89fb22ecf7f886f188e5505c1\",\n \"score\": \"0.5860658\",\n \"text\": \"function SetLanguage(checkbox)\\n{\\n // toggle the check state of the checkbox that was clicked\\n devlangsMenu.ToggleCheckState(checkbox.id);\\n \\n // update the label of the dropdown menu\\n SetDropdownMenuLabel(devlangsMenu, devlangsDropdown);\\n\\t\\n // update the display of the document's items that are dependent on the devlang setting\\n\\tcodeBlockHandler();\\n\\tstyleSheetHandler(\\\"\\\");\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83187cdb2902ab18dce27b840ca70f12\",\n \"score\": \"0.5846678\",\n \"text\": \"setLanguage(languageCode) {\\n const flags = {};\\n switch (languageCode) {\\n case \\\"apex\\\":\\n case \\\"javascript\\\":\\n case \\\"typescript\\\":\\n flags.delimter = \\\"//\\\";\\n flags.blockCommentStart = this.escapeRegExp(\\\"/*\\\");\\n flags.blockCommentEnd = this.escapeRegExp(\\\"*/\\\");\\n flags.highlightJSDoc = true;\\n break;\\n case \\\"c\\\":\\n case \\\"cpp\\\":\\n case \\\"csharp\\\":\\n case \\\"go\\\":\\n case \\\"java\\\":\\n case \\\"less\\\":\\n case \\\"php\\\":\\n case \\\"rust\\\":\\n case \\\"scala\\\":\\n case \\\"scss\\\":\\n case \\\"vue\\\":\\n flags.delimter = \\\"//\\\";\\n flags.blockCommentStart = this.escapeRegExp(\\\"/*\\\");\\n flags.blockCommentEnd = this.escapeRegExp(\\\"*/\\\");\\n break;\\n case \\\"sql\\\":\\n flags.delimter = \\\"--\\\";\\n break;\\n case \\\"coffeescript\\\":\\n case \\\"dockerfile\\\":\\n case \\\"r\\\":\\n case \\\"ruby\\\":\\n case \\\"shellscript\\\":\\n case \\\"yaml\\\":\\n case \\\"python\\\":\\n flags.delimter = \\\"#\\\";\\n break;\\n default:\\n flags.supportedLanguage = false;\\n break;\\n }\\n Object.assign(this.languageFlags, flags);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6825950f347a4b9e3094f038be9893ca\",\n \"score\": \"0.58306074\",\n \"text\": \"get audioLanguage() {\\n return this._audioLanguage;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2646da31e9a7106538713de1d15748b\",\n \"score\": \"0.5828526\",\n \"text\": \"set_language(){\\n /* the data coming from the post change the source of the dashboard at the index of this specific widget*/\\n if (this.parentSource) {\\n this.post(\\n this.root + 'actions/define_path_lang', {\\n id_option: this.source.id,\\n language: this.source.language,\\n id_project: this.id_project\\n }, (d) => {\\n if ( d.success ){\\n delete d.success;\\n delete d.time;\\n this.$nextTick( () => {\\n this.source.data_widget = d.data_widget;\\n this.remake_cache();\\n appui.success(bbn._('Source language set'));\\n this.$forceUpdate();\\n });\\n }\\n }\\n );\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e58c8abe1f6393e340b05f05c44ce815\",\n \"score\": \"0.5809924\",\n \"text\": \"function setLanguage() {\\n try {\\n var grailsLocale = GLOBAL_LOCALE_CONF.locale;\\n var language = localStorage.getItem('language');\\n\\n // In case this is the first time setting system wide lang\\n if(!language) {\\n language = grailsLocale;\\n }\\n\\n // If language on url then we do nothing\\n // Using .indexOf() instead of .includes() because we need to support IE11\\n if(window.location.search.indexOf('lang=') === -1) {\\n // If local storage lang is the same as session then all is well in the world\\n if(language !== grailsLocale) {\\n window.location.search += '&lang=' + language; // Reload the page\\n }\\n } else {\\n localStorage.setItem('language', grailsLocale);\\n }\\n } catch(e) {\\n // localStorage not available\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bf5359006572985946238aaf4822ea0\",\n \"score\": \"0.5797543\",\n \"text\": \"function changeLanguage() {\\n $i18next.options.lng = $scope.user.language;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"659338154b848229176c96441d6cb6f1\",\n \"score\": \"0.5772976\",\n \"text\": \"async function setLanguage() {\\n language = $(\\\"select.language-picker\\\").val();\\n localStorage.language = language;\\n editor.session.setMode(\\\"ace/mode/\\\" + languages[language].aceName);\\n if (localStorage[language + \\\"-\\\" + thisProblem] == undefined) {\\n localStorage[language + \\\"-\\\" + thisProblem] = await getLanguageDefault(language);\\n editor.setValue(localStorage[language + \\\"-\\\" + thisProblem]);\\n } else {\\n editor.setValue(localStorage[language + \\\"-\\\" + thisProblem]);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cac77a321fa2c707e9a6f7d19107fd47\",\n \"score\": \"0.5769764\",\n \"text\": \"function setLanguage(language, avoidPersisting) {\\n if (avoidPersisting === void 0) { avoidPersisting = false; }\\n var doc = Object(__WEBPACK_IMPORTED_MODULE_0__dom_getDocument__[\\\"a\\\" /* getDocument */])();\\n if (doc) {\\n doc.documentElement.setAttribute('lang', language);\\n }\\n if (!avoidPersisting) {\\n Object(__WEBPACK_IMPORTED_MODULE_1__localStorage__[\\\"b\\\" /* setItem */])('language', language);\\n }\\n _language = language;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cac77a321fa2c707e9a6f7d19107fd47\",\n \"score\": \"0.5769764\",\n \"text\": \"function setLanguage(language, avoidPersisting) {\\n if (avoidPersisting === void 0) { avoidPersisting = false; }\\n var doc = Object(__WEBPACK_IMPORTED_MODULE_0__dom_getDocument__[\\\"a\\\" /* getDocument */])();\\n if (doc) {\\n doc.documentElement.setAttribute('lang', language);\\n }\\n if (!avoidPersisting) {\\n Object(__WEBPACK_IMPORTED_MODULE_1__localStorage__[\\\"b\\\" /* setItem */])('language', language);\\n }\\n _language = language;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e04280911da6af2c60a8da66f3d6953\",\n \"score\": \"0.5762271\",\n \"text\": \"function changeLanguage() {\\n\\tif (L10N.getLanguageDisplayName() == \\\"English\\\") {\\n\\t\\t// Change language\\n\\t\\tL10N.setPreferredLanguage(\\\"mn\\\");\\n\\t\\t\\n\\t\\t// Show dialog\\n Ti.UI.createAlertDialog({\\n title:\\\"New Language Selected\\\",\\n message:\\\"Mongolian is now the selected language. Please restart the app to complete the change.\\\"\\n }).show();\\t\\t\\n\\t} else {\\n\\t\\t// Change language\\n\\t\\tL10N.setPreferredLanguage(\\\"en\\\");\\n\\t\\t\\n\\t\\t// Show dialog\\n Ti.UI.createAlertDialog({\\n title:\\\"New Language Selected\\\",\\n message:\\\"English is now the selected language. Please restart the app to complete the change.\\\"\\n }).show();\\t\\t\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10851bc27650b692ccf259cbee36e931\",\n \"score\": \"0.5761928\",\n \"text\": \"function changeLang(language) {\\n\\n if(langExists(language)){\\t\\n\\n pageLang = language;\\n\\n setSessionLang(pageLang);\\n\\n $.each($(\\\".translatable\\\"),function(index,field) {\\n\\t\\t\\n changeFieldText(field , pageLang);\\n\\n \\t});\\n\\n }else{\\n console.warn(\\\"Trying to go to unexisting language [\\\" + language + \\\"]\\\");\\n } \\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d2306c4e44cc34f52d12b50d94c9caf\",\n \"score\": \"0.5721908\",\n \"text\": \"function Language () {\\n this._languages = {};\\n this._name = '';\\n this._cache = false;\\n this._undefinedTextMessage = '';\\n this._domAttributeName = 'data-langTextName';\\n this._domAttributeTarget = 'data-langTextTarget';\\n this._cookieName = 'language';\\n this._saveCookie = false;\\n this._cookieLifeTime = 3600 * 24 * 365 * 1000;\\n \\n this.onLoadComplete = null;\\n this.onLoadError = null;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07046b555e7c724e1ebc5bafbbcf0390\",\n \"score\": \"0.5710792\",\n \"text\": \"function setLanguage(language, avoidPersisting) {\\r\\n if (avoidPersisting === void 0) { avoidPersisting = false; }\\r\\n var doc = dom_1.getDocument();\\r\\n if (doc) {\\r\\n doc.documentElement.setAttribute('lang', language);\\r\\n }\\r\\n if (!avoidPersisting) {\\r\\n localStorage_1.setItem('language', language);\\r\\n }\\r\\n _language = language;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0f712ec62ca58ddb574923898faf9fe\",\n \"score\": \"0.5702015\",\n \"text\": \"setPageLanguage() {\\n document.documentElement.lang = getLanguage();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b82eeb560670720661be9b561ad87ee4\",\n \"score\": \"0.56976074\",\n \"text\": \"function setLanguage(language, avoidPersisting) {\\n if (avoidPersisting === void 0) { avoidPersisting = false; }\\n var doc = dom_1.getDocument();\\n if (doc) {\\n doc.documentElement.setAttribute('lang', language);\\n }\\n if (!avoidPersisting) {\\n localStorage_1.setItem('language', language);\\n }\\n _language = language;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b82eeb560670720661be9b561ad87ee4\",\n \"score\": \"0.56976074\",\n \"text\": \"function setLanguage(language, avoidPersisting) {\\n if (avoidPersisting === void 0) { avoidPersisting = false; }\\n var doc = dom_1.getDocument();\\n if (doc) {\\n doc.documentElement.setAttribute('lang', language);\\n }\\n if (!avoidPersisting) {\\n localStorage_1.setItem('language', language);\\n }\\n _language = language;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b82eeb560670720661be9b561ad87ee4\",\n \"score\": \"0.56976074\",\n \"text\": \"function setLanguage(language, avoidPersisting) {\\n if (avoidPersisting === void 0) { avoidPersisting = false; }\\n var doc = dom_1.getDocument();\\n if (doc) {\\n doc.documentElement.setAttribute('lang', language);\\n }\\n if (!avoidPersisting) {\\n localStorage_1.setItem('language', language);\\n }\\n _language = language;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d9443b2debdd5353a20c28c58dee75e\",\n \"score\": \"0.5684075\",\n \"text\": \"getLanguage() {\\n return this._language;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44422fe0b8f78e93485809fc8b4c8306\",\n \"score\": \"0.56649977\",\n \"text\": \"function setLang(lang) {\\n console.log(\\\"Setting active language to \\\" + lang);\\n\\n // set a cookie\\n document.cookie = \\\"lang=\\\" + lang;\\n\\n i18nTexts.forEach(function(i18nText) {\\n i18nText.reRender(lang);\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3fe1f2dda13bfdea8b23273ea3516fe\",\n \"score\": \"0.5656847\",\n \"text\": \"function validateLocaleAndSetLanguage(locale, sys, errors) {\\n var matchResult = /^([a-z]+)([_\\\\-]([a-z]+))?$/.exec(locale.toLowerCase());\\n if (!matchResult) {\\n if (errors) {\\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Locale_must_be_of_the_form_language_or_language_territory_For_example_0_or_1, \\\"en\\\", \\\"ja-jp\\\"));\\n }\\n return;\\n }\\n var language = matchResult[1];\\n var territory = matchResult[3];\\n // First try the entire locale, then fall back to just language if that's all we have.\\n // Either ways do not fail, and fallback to the English diagnostic strings.\\n if (!trySetLanguageAndTerritory(language, territory, errors)) {\\n trySetLanguageAndTerritory(language, /*territory*/undefined, errors);\\n }\\n // Set the UI locale for string collation\\n ts.setUILocale(locale);\\n function trySetLanguageAndTerritory(language, territory, errors) {\\n var compilerFilePath = ts.normalizePath(sys.getExecutingFilePath());\\n var containingDirectoryPath = ts.getDirectoryPath(compilerFilePath);\\n var filePath = ts.combinePaths(containingDirectoryPath, language);\\n if (territory) {\\n filePath = filePath + \\\"-\\\" + territory;\\n }\\n filePath = sys.resolvePath(ts.combinePaths(filePath, \\\"diagnosticMessages.generated.json\\\"));\\n if (!sys.fileExists(filePath)) {\\n return false;\\n }\\n // TODO: Add codePage support for readFile?\\n var fileContents = \\\"\\\";\\n try {\\n fileContents = sys.readFile(filePath);\\n } catch (e) {\\n if (errors) {\\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Unable_to_open_file_0, filePath));\\n }\\n return false;\\n }\\n try {\\n ts.localizedDiagnosticMessages = JSON.parse(fileContents);\\n } catch (e) {\\n if (errors) {\\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Corrupted_locale_file_0, filePath));\\n }\\n return false;\\n }\\n return true;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73b0a7918d93cdf0aed2e0680a3d4769\",\n \"score\": \"0.56447124\",\n \"text\": \"function validateLocaleAndSetLanguage(locale, sys, errors) {\\n var matchResult = /^([a-z]+)([_\\\\-]([a-z]+))?$/.exec(locale.toLowerCase());\\n if (!matchResult) {\\n if (errors) {\\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Locale_must_be_of_the_form_language_or_language_territory_For_example_0_or_1, \\\"en\\\", \\\"ja-jp\\\"));\\n }\\n return;\\n }\\n var language = matchResult[1];\\n var territory = matchResult[3];\\n // First try the entire locale, then fall back to just language if that's all we have.\\n // Either ways do not fail, and fallback to the English diagnostic strings.\\n if (!trySetLanguageAndTerritory(language, territory, errors)) {\\n trySetLanguageAndTerritory(language, /*territory*/ undefined, errors);\\n }\\n // Set the UI locale for string collation\\n ts.setUILocale(locale);\\n function trySetLanguageAndTerritory(language, territory, errors) {\\n var compilerFilePath = ts.normalizePath(sys.getExecutingFilePath());\\n var containingDirectoryPath = ts.getDirectoryPath(compilerFilePath);\\n var filePath = ts.combinePaths(containingDirectoryPath, language);\\n if (territory) {\\n filePath = filePath + \\\"-\\\" + territory;\\n }\\n filePath = sys.resolvePath(ts.combinePaths(filePath, \\\"diagnosticMessages.generated.json\\\"));\\n if (!sys.fileExists(filePath)) {\\n return false;\\n }\\n // TODO: Add codePage support for readFile?\\n var fileContents = \\\"\\\";\\n try {\\n fileContents = sys.readFile(filePath);\\n }\\n catch (e) {\\n if (errors) {\\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Unable_to_open_file_0, filePath));\\n }\\n return false;\\n }\\n try {\\n ts.localizedDiagnosticMessages = JSON.parse(fileContents);\\n }\\n catch (e) {\\n if (errors) {\\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Corrupted_locale_file_0, filePath));\\n }\\n return false;\\n }\\n return true;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"673c21a11606f314785f602ed779ea2c\",\n \"score\": \"0.5642612\",\n \"text\": \"function setLanguage(language) {\\r\\n\\t\\tif (mui && language && mui.language === language)\\r\\n\\t\\t\\treturn;\\r\\n\\r\\n\\t\\tmui = new TeraToolboxMUI(language);\\r\\n\\t\\t$(\\\"*\\\").each(function () {\\r\\n\\t\\t\\tconst str = $(this).attr(\\\"mui\\\");\\r\\n\\t\\t\\tif (str) {\\r\\n\\t\\t\\t\\t$(this).text(mui.get(str));\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tconst str_html = $(this).attr(\\\"mui-html\\\");\\r\\n\\t\\t\\t\\tif (str_html)\\r\\n\\t\\t\\t\\t\\t$(this).html(mui.get(str_html));\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"beabb354ff16865afbe0dcdab3b3d0e8\",\n \"score\": \"0.56196475\",\n \"text\": \"get contentLanguage() {\\n return this.getStringAttribute('content_language');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eae81c305eb9ba01f8df5a275bee50c2\",\n \"score\": \"0.56182826\",\n \"text\": \"function validateLocaleAndSetLanguage(locale, sys, errors) {\\n var matchResult = /^([a-z]+)([_\\\\-]([a-z]+))?$/.exec(locale.toLowerCase());\\n if (!matchResult) {\\n if (errors) {\\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Locale_must_be_of_the_form_language_or_language_territory_For_example_0_or_1, \\\"en\\\", \\\"ja-jp\\\"));\\n }\\n return;\\n }\\n var language = matchResult[1];\\n var territory = matchResult[3];\\n // First try the entire locale, then fall back to just language if that's all we have.\\n // Either ways do not fail, and fallback to the English diagnostic strings.\\n if (!trySetLanguageAndTerritory(language, territory, errors)) {\\n trySetLanguageAndTerritory(language, /*territory*/undefined, errors);\\n }\\n function trySetLanguageAndTerritory(language, territory, errors) {\\n var compilerFilePath = ts.normalizePath(sys.getExecutingFilePath());\\n var containingDirectoryPath = ts.getDirectoryPath(compilerFilePath);\\n var filePath = ts.combinePaths(containingDirectoryPath, language);\\n if (territory) {\\n filePath = filePath + \\\"-\\\" + territory;\\n }\\n filePath = sys.resolvePath(ts.combinePaths(filePath, \\\"diagnosticMessages.generated.json\\\"));\\n if (!sys.fileExists(filePath)) {\\n return false;\\n }\\n // TODO: Add codePage support for readFile?\\n var fileContents = \\\"\\\";\\n try {\\n fileContents = sys.readFile(filePath);\\n } catch (e) {\\n if (errors) {\\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Unable_to_open_file_0, filePath));\\n }\\n return false;\\n }\\n try {\\n ts.localizedDiagnosticMessages = JSON.parse(fileContents);\\n } catch (e) {\\n if (errors) {\\n errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Corrupted_locale_file_0, filePath));\\n }\\n return false;\\n }\\n return true;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11f5256a4b611f2b662bdabd621019a4\",\n \"score\": \"0.56101966\",\n \"text\": \"function getLanguage() {\\n\\t return 'en-us';\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11f5256a4b611f2b662bdabd621019a4\",\n \"score\": \"0.56101966\",\n \"text\": \"function getLanguage() {\\n\\t return 'en-us';\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6da05fa6de9f400e61012250f8f6c7bc\",\n \"score\": \"0.5607824\",\n \"text\": \"setDocumentLanguage() {\\n document.documentElement.lang = this.locale\\n gtag('event', 'language_change', {\\n 'event_category': 'language',\\n 'event_label': this.language\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc058d61584f0a8c71e4ffe925aebcc6\",\n \"score\": \"0.5602593\",\n \"text\": \"function setLocalization(locale) {\\r\\n\\r\\n if(locale != \\\"en\\\")\\r\\n locale = \\\"cn\\\";\\r\\n\\r\\n try {\\r\\n jQuery.i18n.properties( {\\r\\n name:'Messages',\\r\\n path:'properties/',\\r\\n mode:'map',\\r\\n language:locale,\\r\\n callback: function() {\\r\\n }\\r\\n });\\r\\n } catch(err) {\\r\\n var fileref=document.createElement('script');\\r\\n fileref.setAttribute(\\\"type\\\",\\\"text/javascript\\\");\\r\\n fileref.setAttribute(\\\"src\\\", 'js/jquery/jquery.i18n.properties-1.0.4.js');\\r\\n document.getElementsByTagName(\\\"head\\\")[0].appendChild(fileref);\\r\\n setLocalization(locale);\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31e830bbb47a3273a18015e4253f5b8d\",\n \"score\": \"0.5596705\",\n \"text\": \"useLanguage(lg) {\\n let cityValue = this.cityForm.controls[\\\"dropdownCity\\\"].value; // obtain de select Value\\n this.translate.use(lg); // Change the language\\n if (lg == 'es') {\\n this.spanish = true;\\n }\\n else {\\n this.spanish = false;\\n }\\n if (cityValue != \\\"\\\" && cityValue != undefined && cityValue != null) {\\n this.fillWeather(cityValue, lg);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85c31dc17798af7f0ac69aa1ec8258b2\",\n \"score\": \"0.55913544\",\n \"text\": \"setLanguage(language) {\\n this.keywords = this.rules.getKeywords();\\n if (!this.keywords) {\\n throw new Error(\\\"Language not supported yet: \\\" + language || \\\"\\\");\\n }\\n this.keywordEntries = Object.entries(this.keywords);\\n this.$rules = this.getRules();\\n this.normalizeRules();\\n // this.embedRules(DocCommentHighlightRules, \\\"doc-\\\", [ DocCommentHighlightRules.getEndRule(\\\"start\\\") ]);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"820de3ed71f93a91b41d8f85fed406b6\",\n \"score\": \"0.555966\",\n \"text\": \"_embelishI18n(message) {\\r\\n if (this.layer.config.i18n && this.layer.config.i18n.enabled === true) {\\r\\n message.language = this.layer.config.i18n.language;\\r\\n message.locale = this.layer.config.i18n.locale;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63d1aa0e84d513108f27064da1ee5502\",\n \"score\": \"0.55547494\",\n \"text\": \"function setLanguage (lang) {\\n\\ti18n.global.locale.value = lang;\\n\\tdocument.querySelector('html').setAttribute('lang', lang);\\n\\tlocalStorage.setItem('VueAppLanguage', lang);\\n\\treturn lang;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e7f555358b0bbbfd9d1ed877746c7c5\",\n \"score\": \"0.55451983\",\n \"text\": \"get code() { return gLanguage; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e7f555358b0bbbfd9d1ed877746c7c5\",\n \"score\": \"0.55451983\",\n \"text\": \"get code() { return gLanguage; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92007475fe23825850e4676ab8411fda\",\n \"score\": \"0.5545031\",\n \"text\": \"set languagesList(value) {\\n this._languagesList = value;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"345f16856ffb22da9f6d83fac120023e\",\n \"score\": \"0.55402017\",\n \"text\": \"get isSupportedLanguage() {\\n return this.SUPPORTED_LANGUAGES.indexOf(this.translateService.currentLang) > -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e07cf191092ceed43cb628156b1eec45\",\n \"score\": \"0.5529569\",\n \"text\": \"function setupLanguage() {\\n\\t\\t\\tfunction validateLanguage( sl ) {\\n\\t\\t\\t\\treturn sl == undefined || _language.supportedLanguages.indexOf( sl ) == -1;\\n\\t\\t\\t}\\n\\t\\t\\tvar selectedLanguage = Tools.getURLParams( 'lang' );\\n\\t\\t\\tif ( validateLanguage( selectedLanguage ) ) selectedLanguage = _cookies.readCookie( 'language' );\\n\\t\\t\\tif ( validateLanguage( selectedLanguage ) ) selectedLanguage = _language.selectedLanguage;\\n\\t\\t\\t_language.set( \\\"selectedLanguage\\\", selectedLanguage );\\n\\n\\t\\t\\t_cookies.createCookie( 'language', _language.selectedLanguage );\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b52a83f8fbd555f73c6948eb64841c0d\",\n \"score\": \"0.5518118\",\n \"text\": \"function onChangeLanguage(e) {\\n $('#languageBtn').html(_helper.toggleLanguage());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2b67ed106cff88a7957a2f7631f6c00\",\n \"score\": \"0.55118823\",\n \"text\": \"changeLanguage({ commit }, language) {\\n commit('SET_LANGUAGE', language);\\n localStorage.save('locale', language, true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e7963a2423e8618ceb00f2c3bedaa9e5\",\n \"score\": \"0.55079484\",\n \"text\": \"updateLanguage(newLanguage){\\n this.webRtc.sendToAll('switchLanguage',\\n {\\n 'language': newLanguage\\n })\\n this.setState({'currentLanguage': newLanguage});\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8844ef3f8bb21071da8169d1963fdbd\",\n \"score\": \"0.55040264\",\n \"text\": \"function setDocumentLanguage() {\\n // set document language\\n document.documentElement.setAttribute('lang', window.blog.language);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42a63f7f55cfe4d1340e5f55d6704863\",\n \"score\": \"0.54831517\",\n \"text\": \"setLanguage (event) {\\n\\t\\t this.setState({language: event.target.value});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24a0bd7b49f53bc4b0e2eb084c39b694\",\n \"score\": \"0.5479585\",\n \"text\": \"function setFormLanguage() {\\n \\t$(\\\"#languageID\\\").val(formLanguage);\\t\\n\\tconsole.log(\\\"lang:\\\" + $(\\\"#languageID\\\").val());\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1d842c31af0885cddd53645d647e7b6\",\n \"score\": \"0.5468689\",\n \"text\": \"function translate()\\n{\\n switch (language)\\n {\\n case 'de':\\n setTranslationVars('Verlauf des Risikos', 'jmd. zu Bashen', 'Risiko jmd. zu Bashen', 'Angriff', 'Angriffe');\\n break;\\n case 'en':\\n setTranslationVars('Way of risk', 'to bash', 'Risk to bash', 'attack', 'attacks');\\n confirmResetData = 'You are really sure to reset all the data?';\\n settingsDialogCaption = 'Settings';\\n break;\\n case 'fr':\\n setTranslationVars('Pas de risque', 'de bash', 'Risque de bash', 'attaque', 'attaques');\\n break;\\n default:\\n setTranslationVars('Way of risk', 'to bash', 'Risk to bash', 'attack', 'attacks');\\n break;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8ea03c36bdc479683d0ee0ae7b302c4\",\n \"score\": \"0.5461879\",\n \"text\": \"function setLang(lang) {\\n window.localStorage.setItem(key, lang);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42a439d62170d0ee16fa1c3475eca37e\",\n \"score\": \"0.5459523\",\n \"text\": \"localStorageLang() {\\n return window.localStorage.getItem(TranslateService_1.SAVE_LANGUAGE_KEY);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"551322cc696fce1e06d24a96469759a6\",\n \"score\": \"0.544803\",\n \"text\": \"function langSwitch(lang){\\n\\t\\tlanguage = lang;\\n\\t\\t\\n\\t\\tif(lang==\\\"en\\\"){\\n\\t\\t\\tdocument.getElementById(\\\"en\\\").setAttribute(\\\"disabled\\\", true);\\n\\t\\t\\tdocument.getElementById(\\\"fr\\\").removeAttribute(\\\"disabled\\\");\\n\\t\\t}else{\\n\\t\\t\\tdocument.getElementById(\\\"fr\\\").setAttribute(\\\"disabled\\\", true);\\n\\t\\t\\tdocument.getElementById(\\\"en\\\").removeAttribute(\\\"disabled\\\");\\n\\t\\t}\\n\\t\\tchangeTextMenu(lang);\\n\\t\\tchangeText() ;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"081aa78271190776a79af66e6d36cf29\",\n \"score\": \"0.54364496\",\n \"text\": \"function getFormLanguage() {\\n \\treturn formLanguage;\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af18d3e485ebaca7d522335f3fd80d4d\",\n \"score\": \"0.54288447\",\n \"text\": \"function setI18nLanguage (lang) {\\n i18n.locale = lang;\\n sessionStorage.setItem('lang', lang);\\n document.querySelector('html').setAttribute('lang', lang);\\n return lang;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b65e81c4a0ea8286b79d6ae69322a36\",\n \"score\": \"0.5411171\",\n \"text\": \"get languages() {\\n return this[internalDefinition].languages || {}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"600ee32f0b98d33d4addc0f0662160a5\",\n \"score\": \"0.5383336\",\n \"text\": \"static set locale(value) { _locale = value; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b67cb8631af617a45df2176c75116b58\",\n \"score\": \"0.5369444\",\n \"text\": \"function updateLanguage() {\\n recognition.lang = languageSelector.selectedOptions[0].value;\\n recognition.stop();\\n console.log('>> BaBL: Language changed to', languageSelector.selectedOptions[0].text);\\n for (var user in dataChannels) {\\n if (dataChannels[user].isLocalUserRequestingTranslatedSubtitles) {\\n socket.emit('subtitles request', 'start', user, languageSelector.selectedOptions[0].value);\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e1e8637dbc5e86515d43970f6c1a7ca\",\n \"score\": \"0.5362371\",\n \"text\": \"changeLanguageStrings () {\\r\\n\\t\\tthis.sendMessageModalMarkup = \\t\\tthis.sendMessageModalMarkup.replace(\\\"REPLACE_modal_header_text\\\", this.labels.modal_header_text);\\r\\n\\t\\tthis.sendMessageModalMarkup = \\t\\tthis.sendMessageModalMarkup.replace(\\\"REPLACE_btn_cancel_text\\\", this.labels.btn_cancel_text);\\r\\n\\t\\tthis.sendMessageModalMarkup = \\t\\tthis.sendMessageModalMarkup.replace(\\\"REPLACE_btn_send_text\\\", this.labels.btn_send_text);\\r\\n\\t\\t\\r\\n\\t\\tBDfunctionsDevilBro.translateMessage(this.getName());\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9fb091ec1d2cb83fa2935ce937c7845\",\n \"score\": \"0.5360584\",\n \"text\": \"_setLocale () {\\n let now_locale = '';\\n switch (formatMessage.setup().locale){\\n case 'en':\\n now_locale='en';\\n break;\\n case 'zh-tw':\\n now_locale= 'zh-tw';\\n break;\\n default:\\n now_locale='en';\\n break;\\n }\\n return now_locale;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5d1fad6dffc3ec2e231497ba9b821f6\",\n \"score\": \"0.53585804\",\n \"text\": \"__initGlobalLanguageVariables() {\\n const defaultLanguage = UdeS.Language.defaultLanguage;\\n const supportedLanguages = UdeS.Language.supportedLanguages;\\n\\n // Retrieve the navigator language\\n // @see http://gu.illau.me/posts/the-problem-of-user-language-lists-in-javascript/\\n // @see https://developer.mozilla.org/en-US/docs/Web/API/NavigatorLanguage/language\\n const navigatorLanguage = navigator.language ||\\n navigator.userLanguage ||\\n navigator.browserLanguage ||\\n navigator.systemLanguage ||\\n defaultLanguage;\\n\\n // Retrieve the navigator languages\\n // (with a fallback if the navigator.languages is not defined)\\n // @see https://developer.mozilla.org/fr/docs/Web/API/NavigatorLanguage/languages\\n let navigatorLanguages = [navigatorLanguage];\\n if (navigator.languages && navigator.languages.length) {\\n navigatorLanguages = navigator.languages;\\n }\\n\\n // Compute the global variables\\n const globalLanguages = this.__computeGlobalLanguageVariables(\\n defaultLanguage, supportedLanguages,\\n navigatorLanguage, navigatorLanguages\\n );\\n\\n // Update the global variables\\n UdeS.Language.lang = UdeS.Language.lang || globalLanguages.language;\\n UdeS.Language.navigatorLanguage = globalLanguages.navigatorLanguage;\\n UdeS.Language.navigatorLanguages = globalLanguages.navigatorLanguages;\\n\\n // Set or update the lang attribute of the html element\\n this._updateLangAttributeOfHtml(UdeS.Language.lang);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8db7470ac612ecdfad3a82926dffdae3\",\n \"score\": \"0.5350331\",\n \"text\": \"function checkLang() {\\n var user_language;\\n user_language = user_language || locale.language\\n \\n console.log(user_language.slice(0, 2))\\n var lang = user_language.slice(0, 2)\\n console.log(lang)\\n switch(lang) {\\n case \\\"en\\\":\\n message = \\\"To continue using K·pay test product please visit kzl.io/code and enter this code: \\\";\\n inPurchase = \\\"Please complete the purchase process on kzl.io/code to unlock K·pay test product \\\";\\n popUp = \\\"This is a paid app. After a 1 hour free trial, it requires a one-time payment of $1.00 to keep using it. \\\"; \\n alreadyPaid = \\\"When the app asks for payment again, use the 'Already purchased' button at the bottom of purchase page to unlock for free.\\\"\\n alreadyPaidButton = \\\"Already Paid\\\"\\n break;\\n case 'de':\\n message = \\\"Um das K · pay-Testprodukt weiterhin zu verwenden, besuchen Sie kzl.io/code und geben Sie diesen Code ein: \\\";\\n inPurchase = \\\"Bitte schließen Sie den Kaufvorgang auf kzl.io/code ab, um das K · pay-Testprodukt freizuschalten\\\";\\n popUp = \\\"Dies ist eine kostenpflichtige App. Nach einer 1-stündigen kostenlosen Testversion ist eine einmalige Zahlung von 1,00 US-Dollar erforderlich, um sie weiterhin verwenden zu können.\\\"\\n alreadyPaid = \\\"Wenn die App erneut zur Zahlung auffordert, können Sie sie über die Schaltfläche Bereits gekauft am unteren Rand der Kaufseite kostenlos entsperren.\\\"\\n alreadyPaidButton = \\\"Bereits bezahlt\\\"\\n console.log(\\\"German\\\")\\n case 'fr':\\n inPurchase = \\\"Veuillez compléter le processus d'achat sur kzl.io/code pour déverrouiller le produit de test K · pay\\\";\\n message = \\\"Pour continuer à utiliser le produit de test K · pay, visitez le site kzl.io/code et entrez le code suivant: \\\";\\n popUp = \\\"Ceci est une application payante. Après une heure d'essai gratuite, un paiement unique de 1,00 USD est nécessaire pour continuer à l'utiliser.\\\";\\n alreadyPaid = \\\"Lorsque l'application demande à nouveau de payer, utilisez le bouton Déjà acheté en bas de la page d'achat pour le déverrouiller gratuitement.\\\"\\n alreadyPaidButton = \\\"Déjà payé\\\"\\n break;\\n case 'es':\\n message = \\\"Para continuar usando el producto de prueba K · pay, visite kzl.io/code e ingrese este código:\\\";\\n inPurchase = \\\"Complete el proceso de compra en kzl.io/code para desbloquear el producto de prueba K · pay\\\";\\n popUp = \\\"Esta es una aplicación de pago. Después de una prueba gratuita de 1 hora, se requiere un pago único de $ 1.00 para seguir usándolo.\\\";\\n alreadyPaid = \\\"Cuando la aplicación solicite el pago nuevamente, use el botón Ya comprado en la parte inferior de la página de compra para desbloquear de forma gratuita.\\\"\\n alreadyPaidButton = \\\"Ya Pagado\\\"\\n break;\\n case 'it':\\n message = \\\"Per continuare a utilizzare il prodotto K · pay test, visitare kzl.io/code e inserire questo codice: \\\";\\n inPurchase = \\\"Si prega di completare il processo di acquisto su kzl.io/code per sbloccare il prodotto di prova di pagamento K · Pay \\\";\\n popUp = \\\"Questa è un'app a pagamento. Dopo 1 ora di prova gratuita, è necessario un pagamento una tantum di $ 1,00 per continuare a utilizzarlo.\\\";\\n alreadyPaid = \\\"Quando l'app richiede nuovamente il pagamento, utilizza il pulsante Già acquistato nella parte inferiore della pagina di acquisto per sbloccarlo gratuitamente.\\\"\\n alreadyPaidButton = \\\"Già pagato\\\"\\n break;\\n case 'ja':\\n message = \\\"K・ペイテスト製品を引き続き使用するには、kzl.io/codeにアクセスして以下のコードを入力してください：\\\";\\n inPurchase = \\\"K・ペイテスト製品のロックを解除するには、kzl.io/codeの購入手続きを完了してください\\\";\\n popUp = \\\"これは有料アプリです。 1時間の無料試用期間を経た後も、それを使用し続けるには1回限りの$ 1.00の支払いが必要です。\\\"\\n alreadyPaid = \\\"アプリがもう一度支払いを要求すると、購入ページの下部にある[購入済]ボタンを使用して無料でロックを解除します。\\\"\\n alreadyPaidButton = \\\"既に支払いました\\\" \\n break;\\n default:\\n message = \\\"To continue using K·pay test product please visit kzl.io/code and enter this code: \\\";\\n inPurchase = \\\"Please complete the purchase process on kzl.io/code to unlock K·pay test product \\\";\\n popUp = \\\"This is a paid app. After a 1 hour free trial, it requires a one-time payment of $1.00 to keep using it.\\\"; \\n alreadyPaid = \\\"When the app asks for payment again, use the 'Already purchased' button at the bottom of purchase page to unlock for free.\\\"\\n alreadyPaidButton = \\\"Already Paid\\\"\\n break;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b43a7387fd9e72c88a7b5ccaecdfc973\",\n \"score\": \"0.53395987\",\n \"text\": \"function set_language(language) {\\n\\n\\tif ( GLOBALS.AvailableLiterals.hasOwnProperty(language.value) )\\t \\n\\t\\t\\t{ console.log('DEBUG : setting language: ' + language.value + '\\\\n');\\t }\\n\\telse \\t{\\n\\t \\t\\tconsole.log('DEBUG : LANGUAGE NOT FOUND IN DICTIONARY: ' + language.value +' \\\\n');\\t \\t\\n\\t \\t\\tconsole.log('DEBUG : USING DEFAULT LANGUAGE AS ENGLISH\\\\n');\\n\\t \\t\\tlanguage.value = \\\"English\\\" ;\\n\\t }\\n\\t\\t\\n\\tGLOBALS.Literals = GLOBALS.AvailableLiterals[language.value].value;\\n\\t\\t \\n\\tdocument.getElementById('step1_label_1').innerHTML=GLOBALS.Literals.step1_label_1;\\n\\tdocument.getElementById('step1_label_3').innerHTML=GLOBALS.Literals.step1_label_3;\\n\\tdocument.getElementById('step1_label_4').innerHTML=GLOBALS.Literals.step1_label_4;\\n\\tdocument.getElementById('step1_label_5').innerHTML=GLOBALS.Literals.step1_label_5;\\n\\tdocument.getElementById('step1_label_6').innerHTML=GLOBALS.Literals.step1_label_6;\\n\\tdocument.getElementById('step1_label_8').innerHTML=GLOBALS.Literals.step1_label_8;\\n\\tdocument.getElementById('step1_label_9').innerHTML=GLOBALS.Literals.step1_label_9;\\n\\tdocument.getElementById('step1_label_10').innerHTML=GLOBALS.Literals.step1_label_10;\\t\\n\\t$('#label_choose_size').html(GLOBALS.Literals.label_choose_size);\\n\\t$('#label_sculpture_material').html(GLOBALS.Literals.label_sculpture_material);\\n\\t$('#sculpture_material_1').html(GLOBALS.Literals.sculpture_material_1);\\n\\t$('#sculpture_material_2').html(GLOBALS.Literals.sculpture_material_2);\\n\\t$('#sculpture_material_3').html(GLOBALS.Literals.sculpture_material_3);\\n\\t$('#price_label').html(GLOBALS.Literals.price_label);\\n\\t$('#label_number_copies').html(GLOBALS.Literals.label_number_copies);\\n\\t$('#label_Resume_Options').html(GLOBALS.Literals.label_Resume_Options);\\n\\t$('#label_About_Make_it').html(GLOBALS.Literals.label_About_Make_it);\\n\\t$('#label_Close_application').html(GLOBALS.Literals.label_Close_application);\\n\\t$('#menu_about').html(GLOBALS.Literals.menu_about);\\n\\t$('#menu_sculpture_settings').html( GLOBALS.Literals.menu_sculpture_settings);\\n\\t$('#menu_gallery').html(GLOBALS.Literals.menu_gallery);\\t\\n\\t$('#label_change_language').html(GLOBALS.Literals.label_change_language);\\n\\t$('#menu_change_language').html(GLOBALS.Literals.label_change_language);\\t\\n\\t$('#label_choose_Settings').html(GLOBALS.Literals.label_choose_Settings);\\n\\t$('#label_Sculpture_Settings').html(GLOBALS.Literals.label_Sculpture_Settings); \\t\\n\\t$('#boton_paypal').attr(\\\"src\\\", GLOBALS.Literals.paypal_button);\\t\\n\\t$('#label_accept_terms').html(GLOBALS.Literals.label_accept_terms); \\t\\t\\n\\t$('#now_conecting_Paypal').html(GLOBALS.Literals.now_conecting_Paypal);\\n\\t$('#now_file_uploading').html(GLOBALS.Literals.now_file_uploading);\\t\\n\\t$('#now_file_uploaded').html(GLOBALS.Literals.now_file_uploaded);\\n\\t$('#now_file_uploaded_thank_text').html(GLOBALS.Literals.now_file_uploaded_thank_text );\\t\\n\\t$('#label_noArtistAvailable').html(GLOBALS.Literals.label_noArtistAvailable);\\t\\n \\t$('#label_your_artist').html(GLOBALS.Literals.label_your_artist);\\n\\t$('#label_your_artist').html(GLOBALS.Literals.label_your_artist); \\n\\t$('#website').html(GLOBALS.Literals.artist_website);\\t\\n\\tdocument.getElementById('tutorial_1').innerHTML=GLOBALS.Literals.tutorial_1;\\n\\tdocument.getElementById('tutorial_2').innerHTML=GLOBALS.Literals.tutorial_2;\\n\\tdocument.getElementById('tutorial_3').innerHTML=GLOBALS.Literals.tutorial_3;\\n\\tdocument.getElementById('tutorial_4').innerHTML=GLOBALS.Literals.tutorial_4;\\n\\tdocument.getElementById('tutorial_5').innerHTML=GLOBALS.Literals.tutorial_5;\\n\\tdocument.getElementById('tutorial_6').innerHTML=GLOBALS.Literals.tutorial_6;\\n\\tdocument.getElementById('tutorial_7').innerHTML=GLOBALS.Literals.tutorial_7;\\t\\n\\tdocument.getElementById('label_number_figures').innerHTML=GLOBALS.Literals.label_number_figures;\\n\\tdocument.getElementById('label_option_number_figures_1_or_2').innerHTML=GLOBALS.Literals.label_option_number_figures_1_or_2;\\n\\tdocument.getElementById('label_option_number_figures_group').innerHTML=GLOBALS.Literals.label_option_number_figures_group;\\t\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"051fceb31e9a627e6033111aa9a20745\",\n \"score\": \"0.53385735\",\n \"text\": \"constructor() {\\n super();\\n this.language = '';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf31c0378ea48f5df160a119a453b5ac\",\n \"score\": \"0.5332507\",\n \"text\": \"wait_for_language_known() {\\n\\t\\treturn this.language_known;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f54319f5fd1f6a9a8bac0af06d660153\",\n \"score\": \"0.5328609\",\n \"text\": \"get currentLang() {\\n return this.latestLang;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d005583cea2b4ba426e45e620bf2c2a9\",\n \"score\": \"0.5317119\",\n \"text\": \"function setTopLanguage(langName){\\n progLang.innerText = langName\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"908620c4e5a57eb573f6ba15e4f540e7\",\n \"score\": \"0.53119516\",\n \"text\": \"function change_lang(val)\\n{\\n\\tlang \\t\\t = val;\\n\\tchange_lang_ = true;\\n\\tdisplay();\\n\\tchange_lang_ = false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c16ebdf4c38fca67f4b2ec8fd015527\",\n \"score\": \"0.53087085\",\n \"text\": \"function choixLangue() {\\nif (boutonlangue.selection.index == 0)\\n{\\nDutranslator.setLanguage('en');\\napp.settings.saveSetting('duik','lang','en');\\n}\\nfor (var i = 0 ; i < Dutranslator.languages.length ; i++)\\n{\\nif (Dutranslator.languages[i][1] == boutonlangue.selection.text)\\n{\\nDutranslator.setLanguage(Dutranslator.languages[i][0]);\\napp.settings.saveSetting('duik','lang',Dutranslator.languages[i][0]);\\nbreak;\\n}\\n}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b80cfe7f312d5dec2039540b70bda3e\",\n \"score\": \"0.5274639\",\n \"text\": \"function UpdateLanguage(event) {\\n update_language(event.target.value);\\n i18n.changeLanguage(event.target.value);\\n //Locale is retrieved from the i18n translations therefore dispatch the update after changing the language\\n update_locale(t(`common:locale`));\\n update_region(t(`common:region`));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c42c99beb56e07af14516261830b634e\",\n \"score\": \"0.526506\",\n \"text\": \"set locale(_locale) {\\n let message = null;\\n try {\\n if (!Object.keys(this[localeList]).includes(_locale)) {\\n throw new Error(ERROR.NO_LOCALE);\\n }\\n this[locale] = _locale;\\n this[set](_locale);\\n message = 'OK';\\n } catch (e) {\\n ({ message } = e);\\n }\\n return message;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"576f7d9e93a6b087be1bc0c8fb6a69ce\",\n \"score\": \"0.5263912\",\n \"text\": \"function setLanguages() {\\n\\n switch (setLanguage) {\\n case Languages.ENGLISH:\\n daytime_night = en_daytime_night;\\n daytime_morning = en_daytime_morning;\\n daytime_noon = en_daytime_noon;\\n daytime_afternoon = en_daytime_afternoon;\\n daytime_evening = en_daytime_evening;\\n\\n greeting_night = en_greeting_night;\\n greeting_morning = en_greeting_morning;\\n greeting_noon = en_greeting_noon;\\n greeting_afternoon = en_greeting_afternoon;\\n greeting_evening = en_greeting_evening;\\n\\n sunday = en_sunday;\\n monday = en_monday;\\n tuesday = en_tuesday;\\n wednesday = en_wednesday;\\n thursday = en_thursday;\\n friday = en_friday;\\n saturday = en_saturday;\\n\\n abbreviation_sunday = en_abbreviation_sunday;\\n abbreviation_monday = en_abbreviation_monday;\\n abbreviation_tuesday = en_abbreviation_tuesday;\\n abbreviation_wednesday = en_abbreviation_wednesday;\\n abbreviation_thursday = en_abbreviation_thursday;\\n abbreviation_friday = en_abbreviation_friday;\\n abbreviation_saturday = en_abbreviation_saturday;\\n\\n january = en_january;\\n february = en_february;\\n march = en_march;\\n apil = en_april;\\n may = en_may;\\n june = en_june;\\n july = en_july;\\n august = en_august;\\n september = en_september;\\n october = en_october;\\n november = en_november;\\n december = en_december;\\n\\n greeting_startup = en_greeting_startup;\\n\\n date_pattern = en_date_pattern;\\n upcoming_events_soon_pattern = en_upcoming_events_soon_pattern;\\n\\n app_search = en_app_search;\\n app_email = en_app_email;\\n app_youtube = en_app_youtube;\\n app_calendar = en_app_calendar;\\n app_news = en_app_news;\\n\\n google_account = en_google_account;\\n settings = en_settings;\\n back = en_back;\\n only_mirror = en_only_mirror;\\n\\n settings_title = en_settings_title;\\n calendar_title = en_calendar_title;\\n email_title = en_email_title;\\n news_title = en_news_title;\\n google_account_title = en_google_account_title;\\n\\n google_account_function_heading_signed_in = en_google_account_function_heading_signed_in;\\n google_account_function_heading_permissions = en_google_account_function_heading_permissions;\\n google_account_function_permission_calendar = en_google_account_function_permission_calendar;\\n google_account_function_permission_gmail = en_google_account_function_permission_gmail;\\n google_account_function_permission_profile = en_google_account_function_permission_profile;\\n google_account_function_heading_signed_out = en_google_account_function_heading_signed_out;\\n google_account_function_heading_features = en_google_account_function_heading_features;\\n google_account_function_feature_gmail = en_google_account_function_feature_gmail;\\n google_account_function_feature_profile = en_google_account_function_feature_profile;\\n google_account_function_feature_calendar = en_google_account_function_feature_calendar;\\n\\n settings_system_title = en_settings_system_title;\\n settings_calendar_title = en_settings_calendar_title;\\n settings_weather_title = en_settings_weather_title;\\n\\n settings_languages_subtitle = en_settings_languages_subtitle;\\n settings_temperature_unit_subtitle = en_settings_temperature_unit_subtitle;\\n settings_only_mirror_subtitle = en_settings_only_mirror_subtitle;\\n settings_sources_subtitle = en_settings_sources_subtitle;\\n settings_location_subtitle = en_settings_location_subtitle;\\n\\n settings_english_label = en_settings_english_label;\\n settings_german_label = en_settings_german_label;\\n settings_celsius_label = en_settings_celsius_label;\\n settings_farenheit_label = en_settings_farenheit_label;\\n settings_show_nothing_label = en_settings_show_nothing_label;\\n settings_show_quote_label = en_settings_show_quote_label;\\n settings_normal_entries_label = en_settings_normal_entries_label;\\n settings_birthdays_label = en_settings_birthdays_label;\\n settings_holidays_label = en_settings_holidays_label;\\n\\n settings_location_placeholder = en_settings_location_placeholder;\\n break;\\n case Languages.GERMAN:\\n daytime_night = de_daytime_night;\\n daytime_morning = de_daytime_morning;\\n daytime_noon = de_daytime_noon;\\n daytime_afternoon = de_daytime_afternoon;\\n daytime_evening = de_daytime_evening;\\n\\n greeting_night = de_greeting_night;\\n greeting_morning = de_greeting_morning;\\n greeting_noon = de_greeting_noon;\\n greeting_afternoon = de_greeting_afternoon;\\n greeting_evening = de_greeting_evening;\\n\\n sunday = de_sunday;\\n monday = de_monday;\\n tuesday = de_tuesday;\\n wednesday = de_wednesday;\\n thursday = de_thursday;\\n friday = de_friday;\\n saturday = de_saturday;\\n\\n abbreviation_sunday = de_abbreviation_sunday;\\n abbreviation_monday = de_abbreviation_monday;\\n abbreviation_tuesday = de_abbreviation_tuesday;\\n abbreviation_wednesday = de_abbreviation_wednesday;\\n abbreviation_thursday = de_abbreviation_thursday;\\n abbreviation_friday = de_abbreviation_friday;\\n abbreviation_saturday = de_abbreviation_saturday;\\n\\n january = de_january;\\n february = de_february;\\n march = de_march;\\n apil = de_april;\\n may = de_may;\\n june = de_june;\\n july = de_july;\\n august = de_august;\\n september = de_september;\\n october = de_october;\\n november = de_november;\\n december = de_december;\\n\\n greeting_startup = de_greeting_startup;\\n\\n date_pattern = de_date_pattern;\\n upcoming_events_soon_pattern = de_upcoming_events_soon_pattern;\\n\\n app_search = de_app_search;\\n app_email = de_app_email;\\n app_youtube = de_app_youtube;\\n app_calendar = de_app_calendar;\\n app_news = de_app_news;\\n\\n google_account = de_google_account;\\n settings = de_settings;\\n back = de_back;\\n only_mirror = de_only_mirror;\\n\\n settings_title = de_settings_title;\\n calendar_title = de_calendar_title;\\n email_title = de_email_title;\\n news_title = de_news_title;\\n google_account_title_base = de_google_account_title;\\n\\n google_account_function_heading_signed_in = de_google_account_function_heading_signed_in;\\n google_account_function_heading_permissions = de_google_account_function_heading_permissions;\\n google_account_function_permission_calendar = de_google_account_function_permission_calendar;\\n google_account_function_permission_gmail = de_google_account_function_permission_gmail;\\n google_account_function_permission_profile = de_google_account_function_permission_profile;\\n google_account_function_heading_signed_out = de_google_account_function_heading_signed_out;\\n google_account_function_heading_features = de_google_account_function_heading_features;\\n google_account_function_feature_gmail = de_google_account_function_feature_gmail;\\n google_account_function_feature_profile = de_google_account_function_feature_profile;\\n google_account_function_feature_calendar = de_google_account_function_feature_calendar;\\n\\n settings_system_title = de_settings_system_title;\\n settings_calendar_title = de_settings_calendar_title;\\n settings_weather_title = de_settings_weather_title;\\n\\n settings_languages_subtitle = de_settings_languages_subtitle;\\n settings_temperature_unit_subtitle = de_settings_temperature_unit_subtitle;\\n settings_only_mirror_subtitle = de_settings_only_mirror_subtitle;\\n settings_sources_subtitle = de_settings_sources_subtitle;\\n settings_location_subtitle = de_settings_location_subtitle;\\n\\n settings_english_label = de_settings_english_label;\\n settings_german_label = de_settings_german_label;\\n settings_celsius_label = de_settings_celsius_label;\\n settings_farenheit_label = de_settings_farenheit_label;\\n settings_show_nothing_label = de_settings_show_nothing_label;\\n settings_show_quote_label = de_settings_show_quote_label;\\n settings_normal_entries_label = de_settings_normal_entries_label;\\n settings_birthdays_label = de_settings_birthdays_label;\\n settings_holidays_label = de_settings_holidays_label;\\n\\n settings_location_placeholder = de_settings_location_placeholder;\\n break;\\n }\\n\\n weatherFunction();\\n timerFunction();\\n if(signedIn){\\n refreshCalendarEntryData();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d90a3bcf3c34dc00d5f254a27233c391\",\n \"score\": \"0.52633184\",\n \"text\": \"function set_editor_language(editor,language_code){\\n\\tget_editor_ime_selector(editor).selectLanguage(language_code);\\n\\t//Setup the default input method as configured\\n\\tif(TranslatorsDeskGlobals.default_input_methods(language_code)){\\n\\t\\tset_editor_input_method(editor, TranslatorsDeskGlobals.default_input_methods(language_code))\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22322c543db7f2fe376b3af1f1a2e4d0\",\n \"score\": \"0.5260216\",\n \"text\": \"function getLanguage() {\\n \\\"use strict\\\";\\n return AquaThiefGame.language;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbeb46171147d17590ede866e91a7027\",\n \"score\": \"0.5259237\",\n \"text\": \"function changeLanguage(languageCode) {\\n recognition.lang = languageCode;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"842bbc7083600fa5cd1ca3ef9b7259a2\",\n \"score\": \"0.5243472\",\n \"text\": \"function MapLanguageToFlag(lang) {\\n switch (lang) {\\n case \\\"V\\\":\\n lang = \\\"vn\\\";\\n break;\\n case \\\"I\\\":\\n lang = \\\"id\\\";\\n break;\\n case \\\"E\\\":\\n lang = \\\"gb\\\";\\n break;\\n case \\\"M\\\":\\n lang = \\\"mm\\\";\\n break;\\n case \\\"T\\\":\\n lang = \\\"et\\\";\\n break;\\n case \\\"K\\\":\\n lang = \\\"ko\\\";\\n break;\\n default:\\n lang = \\\"df\\\";\\n }\\n\\n return lang;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0bae13b495f802beeb484e1641298f0\",\n \"score\": \"0.52418673\",\n \"text\": \"function setI18nLanguage (lang) {\\n i18n.locale = lang;\\n axios.defaults.headers.common['Accept-Language'] = lang;\\n document.querySelector('html').setAttribute('lang', lang);\\n return lang;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b37f5f0974994199ae7e709c15d9287\",\n \"score\": \"0.52351516\",\n \"text\": \"function setLanguageConfig(inStr) {\\n if (typeof(Storage) !== \\\"undefined\\\") {\\n // Web storage is supported\\n\\t\\ttry {\\n\\t\\t\\tlocalStorage.setItem('TPBankUserLang', inStr);\\n\\t\\t}\\n\\t\\tcatch(err) {\\n\\t\\t\\tlogInfo('Browser not support local store');\\n\\t\\t}\\n }\\n else {\\n // Web storage is NOT supported\\n logInfo('Browser not support local store');\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"433cb76b53d90642115311030bb40586\",\n \"score\": \"0.5229038\",\n \"text\": \"function LoginLibV18__setLanguageCode(languageCode) {\\n return new Promise(function(resolve, reject) {\\n // Block#: qR6iUAA45gzy77nbO/:I\\n _that.LoginLibV18_currentLanguage = (com.fc.JavaScriptDistLib.TextLib.convertToText(languageCode));\\n // Block#: gn,E,Emb!afJ|(k^T=Pl\\n com.fc.JavaScriptDistLib.Storage.add('language', com.fc.JavaScriptDistLib.TextLib.convertToText(languageCode))\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37bb88e8823d59352965825bc1de4c5d\",\n \"score\": \"0.5217528\",\n \"text\": \"function setModelLanguage(model, language) {\\n StaticServices.modelService.get().setMode(model, StaticServices.modeService.get().getOrCreateMode(language));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22e14ddacc62a2ddc0d555708920e627\",\n \"score\": \"0.52147967\",\n \"text\": \"getAvailableLanguages() {\\n if (!this._availableLanguages) {\\n this._availableLanguages = [];\\n for (let language in this._props) {\\n this._availableLanguages.push(language);\\n }\\n }\\n return this._availableLanguages;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eab5be5397515cfa0fe28651eaab305\",\n \"score\": \"0.5213731\",\n \"text\": \"function changeLanguage(language)\\n{\\n\\tvar createUser = false;\\n\\tvar resetPass= false;\\n\\n\\tif(document.body.contains(document.getElementById(\\\"createUserDiv\\\"))) createUser = true;\\n\\tif(document.body.contains(document.getElementById(\\\"passwordResetDiv\\\"))) resetPass = true;\\n\\n\\t/* Load the home page with the correct language */\\n\\tif(language == \\\"en\\\")\\n\\t{\\n\\t\\twindow.location.href = 'index_en.html';\\n\\t}\\n\\telse\\n\\t{\\n\\t\\twindow.location.href = 'index.html';\\n\\t}\\n\\n\\t// DOES NOT WORK\\n\\n\\t/* Inject in the page the code for the section the user was before of the language change. */\\n\\tif(createUser == true)\\n\\t{\\n\\t\\tinjectCreateUser();\\n\\t}\\n\\telse if(resetPass == true)\\n\\t{\\n\\t\\tinjectPasswordReset();\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5883eee979948d120f7413a02f6fb2d\",\n \"score\": \"0.5212459\",\n \"text\": \"function isSupportedByLangService(language) {\\n switch (language) {\\n case 'css':\\n case 'scss':\\n case 'less':\\n return true;\\n default:\\n return false;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9cac597fb4db9c7697c9c58717b03134\",\n \"score\": \"0.5200944\",\n \"text\": \"onClickSwitchLanguage() {\\n this.model.switchLanguage();\\n this.render();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0bbaebe3a8b5f3b2d025059ad391591\",\n \"score\": \"0.5199857\",\n \"text\": \"function changeLanguage(lang)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tvar langResources = getLanguageResources()[lang];\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//localStorage.setItem(\\\"uravupaalamLanguage\\\",JSON.stringify(lang));\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t$(\\\"span[name='label']\\\").each(function(i, elt)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t$(elt).text(langResources[$(elt).attr(\\\"caption\\\")]);\\r\\n\\t\\t\\t\\t\\t});\\r\\n\\r\\n\\t\\t\\t\\t\\t$(\\\"div[name='label']\\\").each(function(i, elt)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t$(elt).text(langResources[$(elt).attr(\\\"caption\\\")]);\\r\\n\\t\\t\\t\\t\\t});\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t$(\\\"a[name='label']\\\").each(function(i, elt)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t$(elt).text(langResources[$(elt).attr(\\\"caption\\\")]);\\r\\n\\t\\t\\t\\t\\t});\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t$(\\\"option[name='label']\\\").each(function(i, elt)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t$(elt).text(langResources[$(elt).attr(\\\"caption\\\")]);\\r\\n\\t\\t\\t\\t\\t});\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tlocalStorage.setItem(\\\"uravupaalamLanguage\\\",JSON.stringify(lang));\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"521e9dc87029f26e68859e5c8a948363\",\n \"score\": \"0.518947\",\n \"text\": \"function changeLanguage(lang){\\n language = languages[lang];\\n $(\\\"#current_language\\\").html(lang);\\n editor.getSession().setMode(\\\"ace/mode/\\\"+language);\\n if(isDriver){\\n socket.emit(\\\"lang_change\\\", {language: lang});\\n }\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":99,"cells":{"query_id":{"kind":"string","value":"ad0312c104298bff802a307bf383f0a3"},"query":{"kind":"string","value":"hide mute toggle if the current tech doesn't support volume control"},"positive_passages":{"kind":"list like","value":[{"docid":"9ad99f9c63ac07118f29a88d11dbbe42","score":"0.7128578","text":"function updateVisibility() {\n if (player.tech_ && player.tech_['featuresVolumeControl'] === false) {\n this.addClass('vjs-hidden');\n } else {\n this.removeClass('vjs-hidden');\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"9ad99f9c63ac07118f29a88d11dbbe42\",\n \"score\": \"0.7128578\",\n \"text\": \"function updateVisibility() {\\n if (player.tech_ && player.tech_['featuresVolumeControl'] === false) {\\n this.addClass('vjs-hidden');\\n } else {\\n this.removeClass('vjs-hidden');\\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"cb3750a2191ee5bc9ab7cff154935e7a","score":"0.7850713","text":"toggleVolume() {\n if (this.isMuted) {\n this.unmute();\n } else {\n this.mute();\n }\n }","title":""},{"docid":"eaf4d1254784c86d03067fad24dc525f","score":"0.7658586","text":"function toggleMute() {\n video.muted = !video.muted;\n \n if (video.muted) {\n volume.setAttribute('data-volume', volume.value);\n volume.value = 0;\n } else {\n volume.value = volume.dataset.volume;\n }\n }","title":""},{"docid":"6a99a5826343dbfe53776dabd188ac71","score":"0.7603418","text":"function muteVideo() {\n\tvideo.muted = !video.muted;\n\tif (video.muted) {\n\t\t$('#volumeOn').css('display', 'none');\n\t\t$('#volumeOff').css('display', 'inline-block');\n\t}\n\telse {\n\t\t$('#volumeOff').css('display', 'none');\n\t\t$('#volumeOn').css('display', 'inline-block');\n\t}\n}","title":""},{"docid":"abfe782d35836fe7f3a7fecc648e629e","score":"0.7545891","text":"function setMute() {\n if($('#muteButton').hasClass('btn-info')) {\n\t\t$('#muteButton').removeClass('btn-info').addClass('btn-danger');\n\t\t$('#mute').removeClass('icon-volume-up').addClass('icon-volume-off');\n\t\t//vwfMedia.setMute( true );\n \n vwf_view.kernel.callMethod( vwf_view.kernel.application(), \"setLocalMute\", { \"moniker\": vwf_view.kernel.moniker() , \"value\": true } );\n }\n else {\n\t\t$('#muteButton').removeClass('btn-danger').addClass('btn-info');\n\t\t$('#mute').removeClass('icon-volume-off').addClass('icon-volume-up');\n\t\t//vwfMedia.setMute( false );\n\n vwf_view.kernel.callMethod( vwf_view.kernel.application(), \"setLocalMute\", { \"moniker\": vwf_view.kernel.moniker() , \"value\": false } );\n }\n}","title":""},{"docid":"bde4d44f6a6b3c17af7fc51b951ea089","score":"0.7533629","text":"toggleVolume () {\n\t\tconst volumeButton = this.wrapperPlayer.querySelector('.v-volume')\n\n\t\tif (volumeButton.classList.contains('v-muted')) {\n\t\t\tthis.unMute()\n\t\t} else {\n\t\t\tthis.mute()\n\t\t}\n\t}","title":""},{"docid":"0a918f54dd7fcdab645d0561e331834c","score":"0.75190085","text":"function mute() {\n track.enabled = false;\n }","title":""},{"docid":"104e9165d0c0e19317c472baa2232546","score":"0.7410205","text":"function setMuteStop() {\r\n setMuteOn = false;\r\n }","title":""},{"docid":"0f6cb156d42e5bf4bb68bef4d2fce579","score":"0.73923516","text":"function toggleMute() {\n \n const volume = document.getElementById('volume');\n const video = document.getElementById('video');\n video.muted = !video.muted;\n if (video.muted) {\n volume.setAttribute('data-volume', volume.value);\n volume.value = 0;\n } else {\n volume.value = volume.dataset.volume;\n }\n}","title":""},{"docid":"c246c3aa18ab89e5e08f443e13678239","score":"0.7343077","text":"function toggleMute(){\n if(is_muted){\n unmute();\n }else{\n mute();\n }\n}","title":""},{"docid":"90e0e29faf26384973ff38ba408db613","score":"0.7340744","text":"function mute(){\n localStream.getAudioTracks()[0].enabled = !(localStream.getAudioTracks()[0].enabled);\n console.log('muted');\n $('.btn-secondary span').toggleClass('fa-microphone fa-microphone-slash');\n \n}","title":""},{"docid":"0cda3fa06756dbf88786bc17744de8a5","score":"0.7312455","text":"function audioMute() {\n if (soundMute === false) {\n soundMute = true;\n lastVolume = volumeSlider.value;\n volumeSlider.value = 0;\n } else if (soundMute === true) {\n soundMute = false;\n volumeSlider.value = lastVolume;\n }\n}","title":""},{"docid":"ec0fcc0ab53c46621a89b8d871c9f70f","score":"0.73106456","text":"function d(){c.tech_&&c.tech_.featuresVolumeControl===!1?this.addClass(\"vjs-hidden\"):this.removeClass(\"vjs-hidden\")}","title":""},{"docid":"dc005425b57a827dfb1cdf3c0edde320","score":"0.7309473","text":"function toggleMute() {\n if (videoPlayer.muted) {\n // Change the cutton to be a mute button\n changeButtonIcon(muteIcon, 'glyphicon-headphones', 'glyphicon-volume-off');\n // Unmute the media player\n videoPlayer.muted = false;\n } else {\n // Change the button to be an unmute button\n changeButtonIcon(muteIcon, 'glyphicon-volume-off', 'glyphicon-headphones');\n // Mute the media player\n videoPlayer.muted = true;\n }\n}","title":""},{"docid":"ef5f88ecc73d94d44660ae2a47533b20","score":"0.73035014","text":"function toggleMute() {\n mute = !mute;\n if (mute) {\n $(\"#mute\").html(\"Unmute\");\n } else {\n $(\"#mute\").html(\"Mute\");\n }\n}","title":""},{"docid":"49460a42b5626a3aa9589fabd918556f","score":"0.7275607","text":"function toggleMute() {\n\tif (videoScreen.muted) {\n\t\t// Change the cutton to be a mute button\n\t\tchangeButtonType(muteBtn, 'mute');\n\t\t// Unmute the media player\n\t\tvideoScreen.muted = false;\n\t\tvideoWebcam.muted = false;\n\t}\n\telse {\n\t\t// Change the button to be an unmute button\n\t\tchangeButtonType(muteBtn, 'unmute');\n\t\t// Mute the media player\n\t\tvideoScreen.muted = true;\n\t\tvideoWebcam.muted = true;\n\t}\n}","title":""},{"docid":"e412a68d636768e2944b2709a3a989ce","score":"0.72693056","text":"function vidmute() {\n if (vid.muted) {\n vid.muted = false;\n muteBtn.innerHTML = \"<i class='fa fa-volume-up'></i>\";\n } else {\n vid.muted = true;\n muteBtn.innerHTML = \"<i class='fa fa-volume-off'></i>\";\n }\n}","title":""},{"docid":"24c581c0d5abb2f7ec2b58876f9962e2","score":"0.7248474","text":"function unMute() { \n if (cpCmndMute == true) { \n cpCmndMute = false; \n }\n }","title":""},{"docid":"bdfc0785d16cebbffe2885162ca2c0da","score":"0.724575","text":"function toggleMute() {\n\t\t\t\tvideo.muted = !video.muted;\n\t\t\t}","title":""},{"docid":"22187a2b6f3570c8adba546389a430e7","score":"0.7229033","text":"function muteUnmute(){\n if(music.volume > 0){\n currentVolume = music.volume;\n music.volume = 0;\n updateVolumeBar();\n } else {\n music.volume = currentVolume;\n updateVolumeBar();\n }\n}","title":""},{"docid":"de92f6db8558f22151a6c8cfdbdd9101","score":"0.72060823","text":"function muteWebCam() {\n if (localStream.getAudioTracks()[0].enabled) {\n localStream.getAudioTracks()[0].enabled = false;\n // $('#mute').val('Unmute');\n $('.wrtc-button-mute').html('<i class=\"fa fa-microphone-slash fa-2x\"></i>');\n }\n else {\n localStream.getAudioTracks()[0].enabled = true;\n // $('#mute').val('Mute');\n $('.wrtc-button-mute').html('<i class=\"fa fa-microphone fa-2x\"></i>');\n }\n }","title":""},{"docid":"4ea1c38bd6d1c2a0b5f7888bade4c5c8","score":"0.71677655","text":"function mutedControl(){\n video.muted = !video.muted;\n updateVolBtn();\n}","title":""},{"docid":"4d92679a0e6d4919725a6196decae657","score":"0.7160139","text":"function vidMute() {\n\tif (video.muted) {\n\t\tvolumeRange.value = lastVal;\n\t\tvideo.muted = false;\n\t\tmuteBtn.classList.remove('glyphicon-volume-off');\n\t\tmuteBtn.classList.add('glyphicon-volume-up');\n\t\tvolumeRange.value = volumeRange.value / 100;\n\t\tvolumeRange.value = lastVal;\n\t} else {\n\t\tvideo.muted = true;\n\t\tvolumeRange.value = 0;\n\t\tmuteBtn.classList.remove('glyphicon-volume-up');\n\t\tmuteBtn.classList.add('glyphicon-volume-off');\n\t}\n}","title":""},{"docid":"80b1f412f2a5a668d38ac09f03449780","score":"0.7121079","text":"toggleVolumeOnAndOff() {\n const {\n volume,\n handleVolumeChange,\n } = this.props;\n\n if (volume === 0) {\n handleVolumeChange(65);\n } else {\n handleVolumeChange(0);\n }\n }","title":""},{"docid":"f9da2e7e10bb4b7bb9db4f347a60ac01","score":"0.7100318","text":"function muteUnmuted(){\t\t\t\n\t\t\tif(audioPlayer.muted){\n\t\t\t\taudioPlayer.muted=false;\n\t\t\t\t$(\"#sound_button #button #reverseIcon\").css({\"display\":\"none\"});\n\t\t\t\t$(\"#sound_button #button #icon\").css({\"display\":\"block\"});\n\t\t\t\t$(\"#soundBar #slideBar\").slider(\"enable\")\n\t\t\t\t.animate({\"opacity\":1},500);\n\t\t\t}else{\n\t\t\t\taudioPlayer.muted=true;\n\t\t\t\t$(\"#sound_button #button #reverseIcon\").css({\"display\":\"block\"});\n\t\t\t\t$(\"#sound_button #button #icon\").css({\"display\":\"none\"});\t\n\t\t\t\t$(\"#soundBar #slideBar\").slider(\"disable\")\t\n\t\t\t\t.animate({\"opacity\":0.5},500);\t\t\n\t\t\t}\n\t\t}","title":""},{"docid":"a275fa3e03aa542585cec160cdfe9170","score":"0.70760435","text":"function updateVisibility() {\n if (player.tech_ && player.tech_.featuresVolumeControl === false) {\n this.addClass('vjs-hidden');\n } else {\n this.removeClass('vjs-hidden');\n }\n }","title":""},{"docid":"a275fa3e03aa542585cec160cdfe9170","score":"0.70760435","text":"function updateVisibility() {\n if (player.tech_ && player.tech_.featuresVolumeControl === false) {\n this.addClass('vjs-hidden');\n } else {\n this.removeClass('vjs-hidden');\n }\n }","title":""},{"docid":"a275fa3e03aa542585cec160cdfe9170","score":"0.70760435","text":"function updateVisibility() {\n if (player.tech_ && player.tech_.featuresVolumeControl === false) {\n this.addClass('vjs-hidden');\n } else {\n this.removeClass('vjs-hidden');\n }\n }","title":""},{"docid":"a275fa3e03aa542585cec160cdfe9170","score":"0.70760435","text":"function updateVisibility() {\n if (player.tech_ && player.tech_.featuresVolumeControl === false) {\n this.addClass('vjs-hidden');\n } else {\n this.removeClass('vjs-hidden');\n }\n }","title":""},{"docid":"a275fa3e03aa542585cec160cdfe9170","score":"0.70760435","text":"function updateVisibility() {\n if (player.tech_ && player.tech_.featuresVolumeControl === false) {\n this.addClass('vjs-hidden');\n } else {\n this.removeClass('vjs-hidden');\n }\n }","title":""},{"docid":"127afe6b5ca05a349378b7f447a43d56","score":"0.70530707","text":"function toggleMute() {\r\n var myVideo = document.getElementById(\"myVideo\");\r\n var mute = document.getElementById(\"mute\");\r\n if (myVideo.muted) {\r\n mute.innerHTML = \"Mute\";\r\n myVideo.muted = false;\r\n } else {\r\n mute.innerHTML = \"Unmute\";\r\n myVideo.muted = true;\r\n }\r\n}","title":""},{"docid":"df80d17206283762f6f9c223fedb81fb","score":"0.7052991","text":"function muteUnmute() {\n if (userStream.getAudioTracks()[0].enabled) {\n userStream.getAudioTracks()[0].enabled = false;\n micButton.style.backgroundImage = 'url(\"/images/mic_off.png\")';\n } else {\n userStream.getAudioTracks()[0].enabled = true;\n micButton.style.backgroundImage = 'url(\"/images/mic.png\")';\n }\n}","title":""},{"docid":"0ecb08a85493a1a1f5340f40f2e9e7f2","score":"0.701421","text":"mute() {\r\n this.setMuted(true);\r\n }","title":""},{"docid":"01414068142f4556734ee3a83b785f1e","score":"0.6998182","text":"function updateVisibility() {\n\t if (player.tech_ && player.tech_['featuresVolumeControl'] === false) {\n\t this.addClass('vjs-hidden');\n\t } else {\n\t this.removeClass('vjs-hidden');\n\t }\n\t }","title":""},{"docid":"5b441721251a90019c2b59ff79f9341f","score":"0.69890803","text":"muteMic() { \n if (this.localStream) {\n this.muted = true\n this.localStream.getAudioTracks()[0].enabled = false\n }\n }","title":""},{"docid":"51164f2612e4f34d934c8d4123b6335d","score":"0.6987345","text":"function toggleMuteAudio(){\n $(\"#mainTheme\").prop(\"muted\",!$(\"#mainTheme\").prop(\"muted\"));\n}","title":""},{"docid":"cc6bd3eb46b35452327e62adca4e0326","score":"0.6971425","text":"isMuted() { return; }","title":""},{"docid":"2811e32d2668648fe28e5b7c28f3ec04","score":"0.6958224","text":"mute () {\n\t\tthis.methodMute()\n\t\tthis.wrapperPlayer.querySelector('.v-volume').classList.add('v-muted')\n\t}","title":""},{"docid":"35f897dee3b60ad2b2794242cb499f19","score":"0.6951555","text":"function toggleVolume() { // Run On Click On Icon Volume For Mute Volume\n 'use strict';\n buttonVolume.classList.toggle('fa-volume-up');\n buttonVolume.classList.toggle('fa-volume-off');\n if (buttonVolume.classList.contains('fa-volume-off')) {\n video.muted = true;\n rangeVolume.value = 0;\n iconCloseVolume.style.display = \"block\";\n } else {\n video.muted = false;\n rangeVolume.value = volumeVal;\n iconCloseVolume.style.display = \"none\";\n if (rangeVolume.value === 0) {\n video.volume = 0.2;\n rangeVolume.value = 0.2;\n iconCloseVolume.style.display = 'none';\n rangeVolume.onchange = function () { video.muted = false; video.volume = this.value; };\n rangeVolume.onmousemove = function () { video.muted = false; video.volume = this.value; };\n }\n }\n}","title":""},{"docid":"24c27687968ceacad916e335f7810f5c","score":"0.6949374","text":"unmuteMic() {\n if (this.localStream) {\n this.muted = false\n this.localStream.getAudioTracks()[0].enabled = true\n }\n }","title":""},{"docid":"484f47a3cd7ed1aded0419780a97e61d","score":"0.69370115","text":"function volumen() {\n\n\t\t\t\tsoundtrack.volume = (volumeAudio.value) * 0.01;\n\t\t\t\taudioUpdate =soundtrack.volume\n\t\t\t\trangeUpdate = volumeAudio.value\n\t\t\t\tif (soundtrack.volume > 0) {\n\t\t\t\t\tvolumeOff.style.display = 'none'\n\t\t\t\t\tvolumeOn.style.display = 'block'\n\t\t\t\t} else {\n\t\t\t\t\tvolumeOn.style.display = 'none'\n\t\t\t\t\tvolumeOff.style.display = 'block'\n\t\t\t\t}\n\t\t\t}","title":""},{"docid":"fead27db4149a853c626d8b6da69c94a","score":"0.6933194","text":"unMute () {\n\t\tthis.methodUnMute()\n\t\tthis.wrapperPlayer.querySelector('.v-volume').classList.remove('v-muted')\n\t}","title":""},{"docid":"52357bfcc6fa8daa92b91cb388abd359","score":"0.6917357","text":"function toggleMute(con){\n\tcreatejs.Sound.setMute(con);\t\n}","title":""},{"docid":"52357bfcc6fa8daa92b91cb388abd359","score":"0.6917357","text":"function toggleMute(con){\n\tcreatejs.Sound.setMute(con);\t\n}","title":""},{"docid":"6a240d04905b1a7f80df8b0a9f346725","score":"0.6916589","text":"_onVolumeClick() {\n const {\n muteVideoRequest,\n userDid,\n muteNowPlaying,\n mutePreview,\n } = this.props;\n muteVideoRequest({\n muteNowPlaying: userDid && muteNowPlaying ? muteNowPlaying : mutePreview,\n mutePreview: !mutePreview,\n userDid: !!(userDid && muteNowPlaying),\n });\n }","title":""},{"docid":"68d986ed0e32079ae014f2b0eaa53bed","score":"0.69037527","text":"function updateVolumeIcon() {\n volumeIcons.forEach(icon => {\n icon.classList.add('hidden');\n });\n \n volumeButton.setAttribute('data-title', 'Mute (m)')\n \n if (video.muted || video.volume === 0) {\n volumeMute.classList.remove('hidden');\n volumeButton.setAttribute('data-title', 'Unmute (m)')\n } else if (video.volume > 0 && video.volume <= 0.5) {\n volumeLow.classList.remove('hidden');\n } else {\n volumeHigh.classList.remove('hidden');\n }\n }","title":""},{"docid":"fae1031091188cba04010175fe05c171","score":"0.69024146","text":"function unmute() {\n track.enabled = true;\n }","title":""},{"docid":"da73e5e681578f728e8bbb50eb6f3427","score":"0.688267","text":"function mute() {\n sendCmd(\"mute\");\n }","title":""},{"docid":"8de8d0da736b845cc59e4ddcfa557c6f","score":"0.68742377","text":"function muteSong() {\r\n if (mute == false) {\r\n soundIcon.classList.remove(\"fa-volume-up\");\r\n soundIcon.classList.add(\"fa-volume-mute\");\r\n track.volume = 0;\r\n mute = true;\r\n }\r\n else {\r\n soundIcon.classList.remove(\"fa-volume-mute\");\r\n soundIcon.classList.add(\"fa-volume-up\");\r\n track.volume = 1;\r\n mute = false;\r\n }\r\n}","title":""},{"docid":"ce5497e7062991af6155efcce2c9ad43","score":"0.68420976","text":"unmute() {\r\n this.setMuted(false);\r\n }","title":""},{"docid":"f8d2c8d2d93f5ed81c1c7e3e2f269aab","score":"0.681876","text":"toggleMuted() {\r\n this.setMuted(!this._muted);\r\n }","title":""},{"docid":"6666901a5abb12e3e6b623fa173a9cbc","score":"0.68060845","text":"function onVolumeControlClick(){\n\tif(_CONFIG.mute){\n\t\t_CONFIG.mute = false;\n\t\t_CONFIG.theme.volume = 1;\n\t\tdocument.getElementById(\"volumeControl\").src = \"./assets/volume_on.png\";\n\t}else{\n\t\t_CONFIG.mute = true;\n\t\t_CONFIG.theme.volume = 0;\n\t\tdocument.getElementById(\"volumeControl\").src = \"./assets/volume_off.png\";\n\n\t\t// Update Achievement\n\t\tincrementAchievementProgress(6, 1);\n\t}\n}","title":""},{"docid":"76cfa9383fe35f83435d74f6dbe56577","score":"0.68007445","text":"toggleVolume() {\n this.volumeOn = !this.volumeOn;\n this.setProgress(this.getProgressPlayed());\n if (this.isPlaying()) {\n this.play();\n }\n }","title":""},{"docid":"144d212516a70dd4df70315168df6cd6","score":"0.679783","text":"function handleVolumeClick() {\n if (videoPlayer.muted) {\n videoPlayer.muted = false;\n volumeBtn.innerHTML = '<i class=\"fas fa-volume-up\"></i>'\n volumeRange.value = videoPlayer.volume //unmute하면 원래 음량range로\n } else {\n videoPlayer.muted = true;\n volumeBtn.innerHTML = '<i class=\"fas fa-volume-mute\"></i>';\n volumeRange.value = 0; //mute되면 range value값이 0이 되도록.\n }\n}","title":""},{"docid":"406c449cea047d20d67903d430680c22","score":"0.67764485","text":"getMuted() {\r\n return this.volume === 0 ? true : this._muted;\r\n }","title":""},{"docid":"99f43935b1822f2286cad960ff45da3e","score":"0.6757708","text":"function offVolume(){\n\t\t\t\t/*if (Audio === undefined) {\n\t\t\t\t\tAudio = document.getElementById($scope.objectPlayList[0])\n\t\t\t\t}*/\n\t\t\t\tsoundtrack.volume = 0\n\t\t\t\tvolumeAudio.value = 0\n\n\t\t\t\tvolumeOn.style.display = 'none'\n\t\t\t\tvolumeOff.style.display = 'block'\n\t\t\t}","title":""},{"docid":"ed9a1115965f122e42022f6ae5984d3e","score":"0.67544746","text":"isMuted() {\n const track = this.localAudioTrack || this.localVideoTrack;\n if (!track) {\n return false;\n }\n return !track.enabled;\n }","title":""},{"docid":"5208f6bcf44cb78318407186043150d3","score":"0.67411274","text":"function processMute (data) {\n controls.setMute(data)\n}","title":""},{"docid":"87636e942e654c4349623974f2bac332","score":"0.6736174","text":"function muteSound(){\n if (muted) {\n muted = false;\n document.getElementById(\"mute\").innerHTML = \"Mute Sound\";\n } else {\n muted = true;\n document.getElementById(\"mute\").innerHTML = \"Unmute Sound\";\n }\n}","title":""},{"docid":"19a692d3761df11ef87e1cfa1b3f9a2b","score":"0.6714285","text":"function mute(music) {\n if (sound === true) {\n sound = false;\n music.volume = 0;\n\n\n } else {\n sound = true;\n\n }\n playSound(music);\n}","title":""},{"docid":"fd3772d86a64c9b6856bb576a98ba4fb","score":"0.6702017","text":"function muteMic() { // stream is your local WebRTC stream\n\t\t\t\tconsole.log(\"mic muted\");\n \t\t\t\t var audioTracks = mystream.getAudioTracks();\n \t\t\t\tfor (var i = 0, l = audioTracks.length; i < l; i++) {\n \t\t\t\t audioTracks[i].enabled = false;//!audioTracks[i].enabled;\n \t\t\t\t }\n\t\t\t}","title":""},{"docid":"171f60390108e7c1f8198790d8e92afd","score":"0.6682819","text":"function muteUnmuteHandler0(e) {\n console.log(' call muter');\n clearInterval(creative.myTimer_endVideoShort);\n \n // moveVideoControls();\n creative.myVideo.vidPauseBtn.style.visibility = 'visible';\n\n if (creative.myVideo.vid.volume == 0.0) {\n // Enabler.counter(\"Unmute video 0\", true);\n creative.myVideo.vid.volume = 1.0;\n creative.myVideo.vidMuteBtn.style.visibility = 'visible';\n creative.myVideo.vidUnmuteBtn.style.visibility = 'hidden';\n } else {\n // Enabler.counter(\"Mute video 0\", true);\n creative.myVideo.vid.volume = 0.0;\n creative.myVideo.vidMuteBtn.style.visibility = 'hidden';\n creative.myVideo.vidUnmuteBtn.style.visibility = 'visible';\n }\n}","title":""},{"docid":"9bb9e98f0491b7a7af8bf190a63c3053","score":"0.66749763","text":"function musicController() {\n if (audio.isMusicMuted === true) {\n audio.isMusicMuted = false;\n audio.musicBtn.innerHTML = \"On\";\n playMusic();\n } else if (audio.isMusicMuted === false) {\n audio.isMusicMuted = true;\n audio.musicBtn.innerHTML = \"Off\";\n stopMusic();\n }\n}","title":""},{"docid":"a1786e04499f97bbf6b93a8e3364cad0","score":"0.66748315","text":"set muted(value) {\n this.media.muted = value;\n // if(value === true){\n // this.media.muted = true\n // }else{\n // this.media.muted = false\n // }\n }","title":""},{"docid":"4bcd84e402ea9ffb1526470d4e2bc799","score":"0.6669756","text":"function mute(){\n if (video.muted){\n video.muted = false;\n }else {\n video.muted = true;\n }\n}","title":""},{"docid":"48b735b351c4815e90725466294b877c","score":"0.6668874","text":"onAudioMute (id, isMuted) {\n if (APP.conference.isLocalId(id)) {\n localVideoThumbnail.showAudioIndicator(isMuted);\n } else {\n let remoteVideo = remoteVideos[id];\n if (!remoteVideo)\n return;\n\n remoteVideo.showAudioIndicator(isMuted);\n if (APP.conference.isModerator) {\n remoteVideo.updateRemoteVideoMenu(isMuted);\n }\n }\n }","title":""},{"docid":"ae6d0bd7cb821838635eb087b1c6f464","score":"0.666219","text":"function soundEffectController() {\n if (audio.isSoundMuted === true) {\n audio.isSoundMuted = false;\n audio.soundEffectBtn.innerHTML = \"On\";\n } else if (audio.isSoundMuted === false) {\n audio.isSoundMuted = true;\n audio.soundEffectBtn.innerHTML = \"Off\";\n }\n}","title":""},{"docid":"de1078568747dcdf7421c0bc0f35a7d6","score":"0.6649464","text":"function _videoVolume(event) {\n var element = event.target;\n var delayer = muteDelays[element.id];\n\n if (delayer) {\n clearTimeout(delayer);\n }\n\n if (element.muted || element.volume === 0) {\n muteDelays[element.id] = setTimeout(function () {\n console.log('videoMuted', event);\n sendEvent('mute');\n }, 100);\n } else {\n muteDelays[element.id] = setTimeout(function () {\n console.log('videoUnMuted', event);\n sendEvent('unmute');\n }, 100);\n }\n }","title":""},{"docid":"d155b0e8ac5e231626cba479365a6e14","score":"0.6643933","text":"function muteMe(elem, muteToggle) {\n\telem.muted = muteToggle;\n}","title":""},{"docid":"5b686d559ee600c2a93356c9db7adffb","score":"0.6642016","text":"unmute() {\n this.media.muted = false;\n }","title":""},{"docid":"4dfd08c90b95a85227e6c49e70931dd4","score":"0.66417575","text":"get isMuted() {\n\t\treturn this._refs.video.muted;\n\t}","title":""},{"docid":"af1460179231bf961fb7af05e88eb83e","score":"0.66266423","text":"function toggleMusic(musicElm, maxVolLvl, minVolLvl, zeroVolLvl){\n\t\tif (musicElm.volume >= minVolLvl)\n\t\t{\n\t\t\tmusicElm.volume = zeroVolLvl;\t\n\t\t} else\n\t\t{\n\t\t\tmusicElm.volume = maxVolLvl;\n\t\t}\t\t\t\t\n\t}","title":""},{"docid":"80108c3a3a7cc93beeb0d10af4ad2b4b","score":"0.6614683","text":"function showMuteButton(call) {\r\n var peerconnection = call.getPeerConnection();\r\n if (peerconnection == null) {\r\n // For certain rehydration case, peerconnection maybe null, we also need to show buttons.\r\n muteButton(call, true);\r\n return;\r\n }\r\n peerconnection.getLocalStreams().map(function(stream) {\r\n stream.getAudioTracks().map(function(audioTrack) {\r\n muteButton(call, audioTrack.enabled);\r\n });\r\n });\r\n }","title":""},{"docid":"d3277291a286472e8d3b31ba973329a9","score":"0.6596109","text":"function toggleMuteAudio(){ \n $(\"audio\").prop(\"muted\",!$(\"audio\").prop(\"muted\")); //prop is for property\n}","title":""},{"docid":"34317466ba4b5c1eb2b3a1a4a2925b0e","score":"0.6574878","text":"mute () {\n this._muted = true;\n }","title":""},{"docid":"4ac577e719a3de89b232b08cf0857aee","score":"0.6573261","text":"function UnMuteThisVideo(){\n\t\tytp.unMute();\n\t\tTweenLite.set('#muteOff', {alpha: 1, y: 0});\n\t\tTweenLite.set('#muteOn', {alpha: 0, y: -40});\n\t\tEnabler.counter('YTVideo UnMute');\n}","title":""},{"docid":"222adbea14746fa8309bb8638ba75085","score":"0.6572383","text":"function muteRemote() {\n var inverse = remoteVid.muted ? false : true\n remoteVid.muted = inverse;\n if (inverse) {\n remotemutebtn.className = \"btn btn-primary float-left w-100\"\n remotemutebtn.innerHTML = \"Unmute\"\n }\n else {\n remotemutebtn.className = \"btn float-left w-100 btn-outline-primary\"\n remotemutebtn.innerHTML = \"Mute\"\n }\n}","title":""},{"docid":"e6c3c4238d81088e1e6059411419d5ec","score":"0.6569686","text":"isMuted () {\n return this.tag ? this.tag.muted : null\n }","title":""},{"docid":"99b4a90f8f5af8b66fa37b0e02f6caaa","score":"0.65680826","text":"methodMute () {\n\t\tthis.player.muted = true\n\t\tthis.player.setAttribute('muted', '')\n\t}","title":""},{"docid":"98331a16274cd155c4c81b4b585fb365","score":"0.65459365","text":"function updateVolumeIcon() {\n \n const volumeIcons = document.querySelectorAll('.volume-button g');\n const volumeButton = document.getElementById('volume-button');\n\n const video = document.getElementById('video');\n\n const volumeLow = document.querySelector(\"#volume-low\");\n const volumeHigh = document.querySelector(\"#volume-high\");\n\n volumeIcons.forEach((icon) => {\n icon.setAttribute('visibility', 'hidden');\n });\n\n volumeButton.setAttribute('data-title', 'Mute (m)');\n\n const volumeMute = document.querySelector(\"#volume-mute\");\n if (video.muted || video.volume === 0) {\n volumeMute.setAttribute('visibility',\"visible\"); //.classList.remove('hidden');\n \n volumeButton.setAttribute('data-title', 'Unmute (m)');\n\n } else if (video.volume > 0 && video.volume <= 0.5) {\n volumeLow.setAttribute('visibility',\"visible\"); //.classList.remove('hidden');\n } else {\n volumeHigh.setAttribute('visibility',\"visible\"); //.classList.remove('hidden');\n }\n}","title":""},{"docid":"641b68f830696d7ca8157dfd9ac7d609","score":"0.654446","text":"mute() {\n this._muted = true;\n }","title":""},{"docid":"9186a042b0b1efd6eec63d28f31e3cd0","score":"0.65440273","text":"function mute(){\n\t var song = document.querySelector('audio');\n\t if(song.muted)\n\t {\n\t song.muted=false;\n\t }\n else\n\t {\n\t\t song.muted = true;\n\n\t\t }\n }","title":""},{"docid":"d7424bc1817d4e2691889cfdb2df3dd0","score":"0.65425825","text":"_onTrackMuteChanged(jitsiTrack) {\n if (jitsiTrack.isLocal()) {\n return;\n }\n const participant = jitsiTrack.getParticipantId();\n const isMuted = jitsiTrack.isMuted();\n\n this.debug(\"Mute changed to\", isMuted, \"for\", jitsiTrack.getType(), \"for participant\", participant);\n\n if (jitsiTrack.getType() === \"video\") {\n this._render();\n }\n }","title":""},{"docid":"6056999d6732bd1a5e39ef266263f13b","score":"0.6529063","text":"mute() {\n this.media.muted = true;\n }","title":""},{"docid":"2d7a8b56eeaf2f96f080e79c7f23ee73","score":"0.6523607","text":"mute() {\n this.media.muted = true;\n }","title":""},{"docid":"cab012e360d7668c7236c39a9cb21463","score":"0.6518662","text":"function muteLocalAudio() {\n logger(\"Local Function: <b style='color:darkBlue'>muteLocalAudio()</b>\");\n if ($(\"#btn_mute_local_audio\").html() == \"Mute Audio\") {\n logger(\"Agora Function: <b style='color:indigo'>local_stream.disableAudio()</b>\");\n local_stream.disableAudio();\n } else {\n logger(\"Agora Function: <b style='color:indigo'>local_stream.enableAudio()</b>\");\n local_stream.enableAudio();\n }\n }","title":""},{"docid":"a8729e2df9e2b41439c4359fec73c7d3","score":"0.6512634","text":"function muteAudio() {\n let player = document.getElementById('animationAudio')\n let muteButtonText = document.getElementById('muteButton')\n console.log(player.muted)\n if (player.muted === false) {\n muteButtonText.innerHTML = \"Unmute audio\"\n return player.muted = true\n } else if (player.muted === true) {\n muteButtonText.innerHTML = \"Mute audio\"\n return player.muted = false\n }\n }","title":""},{"docid":"c9fbdcc6629554c03e18e34435c78f02","score":"0.64974964","text":"function myAudio(){\n const enabled = myVideoStream.getAudioTracks()[0].enabled;\n if (enabled) { // if I am already unmuted\n myVideoStream.getAudioTracks()[0].enabled = false;\n unmuteMe();\n } else {\n muteMe();\n myVideoStream.getAudioTracks()[0].enabled = true;\n }\n}","title":""},{"docid":"1f92bba48aabe1c295dd0ace582d902c","score":"0.6492599","text":"switchPower(event){\n var powerChoice = document.getElementById('mute');\n (powerChoice.checked)? ( this.setMute(false)) : ( this.setMute(true)) ;\n }","title":""},{"docid":"96ce434b945e987ca0d92764c72585ac","score":"0.6489471","text":"function disableMute(e) { \n e.preventDefault()\n if (mute === true) {\n setMute(false)}\n else{\n setMute(true)\n }\n }","title":""},{"docid":"d55f46d09cb45974779eb9d9a414e425","score":"0.64793074","text":"setMuted(isMute) {\r\n if (isMute)\r\n this.audio.volume = 0;\r\n else\r\n this.audio.volume = this._volume;\r\n this._muted = isMute;\r\n this.emit(PlayerEvent.VolumeChange, this.audio.volume);\r\n }","title":""},{"docid":"ee67c149748042c7b8fe513e882ede13","score":"0.64585894","text":"function changeVolume(value, isMuted, directUpdate){ \n proxyVolume = value;\n if(directUpdate) volumeSlider.value = proxyVolume;\n var imageToTake;\n if (isMuted){\n imageToTake = \"speaker_none.png\";\n }else{\n if (value < 33){\n imageToTake = \"speaker_low.png\";\n }\n else if (value < 66){\n imageToTake = \"speaker_medium.png\";\n }else{\n imageToTake = \"speaker_full.png\";\n }\n }\n muteButton.src = imageToTake;\n}","title":""},{"docid":"6f66c2a0b4a375b087c312766fcdb40c","score":"0.64536345","text":"volumeHack_() {\n const self = this;\n if (!self.hasInteractedWithMedia_) {\n const volume = self.getVolume_();\n\n // Pick a new volume that is slightly different than the current\n // volume, making sure to not go out of the allowed bounds.\n let newVolume = volume + 0.1;\n if (newVolume > 1.0) {\n newVolume = volume - 0.1;\n }\n\n self.tileRenderer_.setVolume(newVolume);\n self.tileRenderer_.setVolume(volume);\n self.hasInteractedWithMedia_ = true;\n }\n }","title":""},{"docid":"496588642620ae3e3ae0fcb0577093f4","score":"0.6446005","text":"function updateVolume() {\n if (video.muted) {\n video.muted = false;\n }\n video.volume = volume.value;\n}","title":""},{"docid":"0a5a9bed4c780dff0615fb06377de793","score":"0.644458","text":"function muteMe(elem) {\n elem.muted = true;\n }","title":""},{"docid":"687628de9db8b24062181337d71c2800","score":"0.6431044","text":"muteVideo() {\n if (this.localStream) {\n this.videoMuted = true\n this.localStream.getVideoTracks()[0].enabled = false\n }\n }","title":""},{"docid":"40e2f5ff0bc903bae0891e4d88cb869f","score":"0.6427835","text":"function toggleMuteSound(elem) {\n\tif(elem.muted == false) {\n\t\telem.muted = true;\n\t\telem.pause();\n\t} else {\n\t\telem.muted = false;\n\t\tif(elem.loop) {\n\t\t\telem.play();\n\t\t}\n\t}\n}","title":""},{"docid":"916f8563adf1d6fbe39b85b878eb1693","score":"0.6426823","text":"function musikOnOff(type) {\r\n\tif(type == \"off\") {\r\n\t\tplayMusik[played].pause();\r\n\t\tmusikPlay = false;;\r\n\t}else {\r\n\t\tplayMusik[played].play();\r\n\t\tmusikPlay = true;\r\n\t}\r\n}","title":""}],"string":"[\n {\n \"docid\": \"cb3750a2191ee5bc9ab7cff154935e7a\",\n \"score\": \"0.7850713\",\n \"text\": \"toggleVolume() {\\n if (this.isMuted) {\\n this.unmute();\\n } else {\\n this.mute();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaf4d1254784c86d03067fad24dc525f\",\n \"score\": \"0.7658586\",\n \"text\": \"function toggleMute() {\\n video.muted = !video.muted;\\n \\n if (video.muted) {\\n volume.setAttribute('data-volume', volume.value);\\n volume.value = 0;\\n } else {\\n volume.value = volume.dataset.volume;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a99a5826343dbfe53776dabd188ac71\",\n \"score\": \"0.7603418\",\n \"text\": \"function muteVideo() {\\n\\tvideo.muted = !video.muted;\\n\\tif (video.muted) {\\n\\t\\t$('#volumeOn').css('display', 'none');\\n\\t\\t$('#volumeOff').css('display', 'inline-block');\\n\\t}\\n\\telse {\\n\\t\\t$('#volumeOff').css('display', 'none');\\n\\t\\t$('#volumeOn').css('display', 'inline-block');\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abfe782d35836fe7f3a7fecc648e629e\",\n \"score\": \"0.7545891\",\n \"text\": \"function setMute() {\\n if($('#muteButton').hasClass('btn-info')) {\\n\\t\\t$('#muteButton').removeClass('btn-info').addClass('btn-danger');\\n\\t\\t$('#mute').removeClass('icon-volume-up').addClass('icon-volume-off');\\n\\t\\t//vwfMedia.setMute( true );\\n \\n vwf_view.kernel.callMethod( vwf_view.kernel.application(), \\\"setLocalMute\\\", { \\\"moniker\\\": vwf_view.kernel.moniker() , \\\"value\\\": true } );\\n }\\n else {\\n\\t\\t$('#muteButton').removeClass('btn-danger').addClass('btn-info');\\n\\t\\t$('#mute').removeClass('icon-volume-off').addClass('icon-volume-up');\\n\\t\\t//vwfMedia.setMute( false );\\n\\n vwf_view.kernel.callMethod( vwf_view.kernel.application(), \\\"setLocalMute\\\", { \\\"moniker\\\": vwf_view.kernel.moniker() , \\\"value\\\": false } );\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bde4d44f6a6b3c17af7fc51b951ea089\",\n \"score\": \"0.7533629\",\n \"text\": \"toggleVolume () {\\n\\t\\tconst volumeButton = this.wrapperPlayer.querySelector('.v-volume')\\n\\n\\t\\tif (volumeButton.classList.contains('v-muted')) {\\n\\t\\t\\tthis.unMute()\\n\\t\\t} else {\\n\\t\\t\\tthis.mute()\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a918f54dd7fcdab645d0561e331834c\",\n \"score\": \"0.75190085\",\n \"text\": \"function mute() {\\n track.enabled = false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"104e9165d0c0e19317c472baa2232546\",\n \"score\": \"0.7410205\",\n \"text\": \"function setMuteStop() {\\r\\n setMuteOn = false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f6cb156d42e5bf4bb68bef4d2fce579\",\n \"score\": \"0.73923516\",\n \"text\": \"function toggleMute() {\\n \\n const volume = document.getElementById('volume');\\n const video = document.getElementById('video');\\n video.muted = !video.muted;\\n if (video.muted) {\\n volume.setAttribute('data-volume', volume.value);\\n volume.value = 0;\\n } else {\\n volume.value = volume.dataset.volume;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c246c3aa18ab89e5e08f443e13678239\",\n \"score\": \"0.7343077\",\n \"text\": \"function toggleMute(){\\n if(is_muted){\\n unmute();\\n }else{\\n mute();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90e0e29faf26384973ff38ba408db613\",\n \"score\": \"0.7340744\",\n \"text\": \"function mute(){\\n localStream.getAudioTracks()[0].enabled = !(localStream.getAudioTracks()[0].enabled);\\n console.log('muted');\\n $('.btn-secondary span').toggleClass('fa-microphone fa-microphone-slash');\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cda3fa06756dbf88786bc17744de8a5\",\n \"score\": \"0.7312455\",\n \"text\": \"function audioMute() {\\n if (soundMute === false) {\\n soundMute = true;\\n lastVolume = volumeSlider.value;\\n volumeSlider.value = 0;\\n } else if (soundMute === true) {\\n soundMute = false;\\n volumeSlider.value = lastVolume;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec0fcc0ab53c46621a89b8d871c9f70f\",\n \"score\": \"0.73106456\",\n \"text\": \"function d(){c.tech_&&c.tech_.featuresVolumeControl===!1?this.addClass(\\\"vjs-hidden\\\"):this.removeClass(\\\"vjs-hidden\\\")}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc005425b57a827dfb1cdf3c0edde320\",\n \"score\": \"0.7309473\",\n \"text\": \"function toggleMute() {\\n if (videoPlayer.muted) {\\n // Change the cutton to be a mute button\\n changeButtonIcon(muteIcon, 'glyphicon-headphones', 'glyphicon-volume-off');\\n // Unmute the media player\\n videoPlayer.muted = false;\\n } else {\\n // Change the button to be an unmute button\\n changeButtonIcon(muteIcon, 'glyphicon-volume-off', 'glyphicon-headphones');\\n // Mute the media player\\n videoPlayer.muted = true;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef5f88ecc73d94d44660ae2a47533b20\",\n \"score\": \"0.73035014\",\n \"text\": \"function toggleMute() {\\n mute = !mute;\\n if (mute) {\\n $(\\\"#mute\\\").html(\\\"Unmute\\\");\\n } else {\\n $(\\\"#mute\\\").html(\\\"Mute\\\");\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49460a42b5626a3aa9589fabd918556f\",\n \"score\": \"0.7275607\",\n \"text\": \"function toggleMute() {\\n\\tif (videoScreen.muted) {\\n\\t\\t// Change the cutton to be a mute button\\n\\t\\tchangeButtonType(muteBtn, 'mute');\\n\\t\\t// Unmute the media player\\n\\t\\tvideoScreen.muted = false;\\n\\t\\tvideoWebcam.muted = false;\\n\\t}\\n\\telse {\\n\\t\\t// Change the button to be an unmute button\\n\\t\\tchangeButtonType(muteBtn, 'unmute');\\n\\t\\t// Mute the media player\\n\\t\\tvideoScreen.muted = true;\\n\\t\\tvideoWebcam.muted = true;\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e412a68d636768e2944b2709a3a989ce\",\n \"score\": \"0.72693056\",\n \"text\": \"function vidmute() {\\n if (vid.muted) {\\n vid.muted = false;\\n muteBtn.innerHTML = \\\"<i class='fa fa-volume-up'></i>\\\";\\n } else {\\n vid.muted = true;\\n muteBtn.innerHTML = \\\"<i class='fa fa-volume-off'></i>\\\";\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24c581c0d5abb2f7ec2b58876f9962e2\",\n \"score\": \"0.7248474\",\n \"text\": \"function unMute() { \\n if (cpCmndMute == true) { \\n cpCmndMute = false; \\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bdfc0785d16cebbffe2885162ca2c0da\",\n \"score\": \"0.724575\",\n \"text\": \"function toggleMute() {\\n\\t\\t\\t\\tvideo.muted = !video.muted;\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22187a2b6f3570c8adba546389a430e7\",\n \"score\": \"0.7229033\",\n \"text\": \"function muteUnmute(){\\n if(music.volume > 0){\\n currentVolume = music.volume;\\n music.volume = 0;\\n updateVolumeBar();\\n } else {\\n music.volume = currentVolume;\\n updateVolumeBar();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de92f6db8558f22151a6c8cfdbdd9101\",\n \"score\": \"0.72060823\",\n \"text\": \"function muteWebCam() {\\n if (localStream.getAudioTracks()[0].enabled) {\\n localStream.getAudioTracks()[0].enabled = false;\\n // $('#mute').val('Unmute');\\n $('.wrtc-button-mute').html('<i class=\\\"fa fa-microphone-slash fa-2x\\\"></i>');\\n }\\n else {\\n localStream.getAudioTracks()[0].enabled = true;\\n // $('#mute').val('Mute');\\n $('.wrtc-button-mute').html('<i class=\\\"fa fa-microphone fa-2x\\\"></i>');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ea1c38bd6d1c2a0b5f7888bade4c5c8\",\n \"score\": \"0.71677655\",\n \"text\": \"function mutedControl(){\\n video.muted = !video.muted;\\n updateVolBtn();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d92679a0e6d4919725a6196decae657\",\n \"score\": \"0.7160139\",\n \"text\": \"function vidMute() {\\n\\tif (video.muted) {\\n\\t\\tvolumeRange.value = lastVal;\\n\\t\\tvideo.muted = false;\\n\\t\\tmuteBtn.classList.remove('glyphicon-volume-off');\\n\\t\\tmuteBtn.classList.add('glyphicon-volume-up');\\n\\t\\tvolumeRange.value = volumeRange.value / 100;\\n\\t\\tvolumeRange.value = lastVal;\\n\\t} else {\\n\\t\\tvideo.muted = true;\\n\\t\\tvolumeRange.value = 0;\\n\\t\\tmuteBtn.classList.remove('glyphicon-volume-up');\\n\\t\\tmuteBtn.classList.add('glyphicon-volume-off');\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80b1f412f2a5a668d38ac09f03449780\",\n \"score\": \"0.7121079\",\n \"text\": \"toggleVolumeOnAndOff() {\\n const {\\n volume,\\n handleVolumeChange,\\n } = this.props;\\n\\n if (volume === 0) {\\n handleVolumeChange(65);\\n } else {\\n handleVolumeChange(0);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9da2e7e10bb4b7bb9db4f347a60ac01\",\n \"score\": \"0.7100318\",\n \"text\": \"function muteUnmuted(){\\t\\t\\t\\n\\t\\t\\tif(audioPlayer.muted){\\n\\t\\t\\t\\taudioPlayer.muted=false;\\n\\t\\t\\t\\t$(\\\"#sound_button #button #reverseIcon\\\").css({\\\"display\\\":\\\"none\\\"});\\n\\t\\t\\t\\t$(\\\"#sound_button #button #icon\\\").css({\\\"display\\\":\\\"block\\\"});\\n\\t\\t\\t\\t$(\\\"#soundBar #slideBar\\\").slider(\\\"enable\\\")\\n\\t\\t\\t\\t.animate({\\\"opacity\\\":1},500);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\taudioPlayer.muted=true;\\n\\t\\t\\t\\t$(\\\"#sound_button #button #reverseIcon\\\").css({\\\"display\\\":\\\"block\\\"});\\n\\t\\t\\t\\t$(\\\"#sound_button #button #icon\\\").css({\\\"display\\\":\\\"none\\\"});\\t\\n\\t\\t\\t\\t$(\\\"#soundBar #slideBar\\\").slider(\\\"disable\\\")\\t\\n\\t\\t\\t\\t.animate({\\\"opacity\\\":0.5},500);\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a275fa3e03aa542585cec160cdfe9170\",\n \"score\": \"0.70760435\",\n \"text\": \"function updateVisibility() {\\n if (player.tech_ && player.tech_.featuresVolumeControl === false) {\\n this.addClass('vjs-hidden');\\n } else {\\n this.removeClass('vjs-hidden');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a275fa3e03aa542585cec160cdfe9170\",\n \"score\": \"0.70760435\",\n \"text\": \"function updateVisibility() {\\n if (player.tech_ && player.tech_.featuresVolumeControl === false) {\\n this.addClass('vjs-hidden');\\n } else {\\n this.removeClass('vjs-hidden');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a275fa3e03aa542585cec160cdfe9170\",\n \"score\": \"0.70760435\",\n \"text\": \"function updateVisibility() {\\n if (player.tech_ && player.tech_.featuresVolumeControl === false) {\\n this.addClass('vjs-hidden');\\n } else {\\n this.removeClass('vjs-hidden');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a275fa3e03aa542585cec160cdfe9170\",\n \"score\": \"0.70760435\",\n \"text\": \"function updateVisibility() {\\n if (player.tech_ && player.tech_.featuresVolumeControl === false) {\\n this.addClass('vjs-hidden');\\n } else {\\n this.removeClass('vjs-hidden');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a275fa3e03aa542585cec160cdfe9170\",\n \"score\": \"0.70760435\",\n \"text\": \"function updateVisibility() {\\n if (player.tech_ && player.tech_.featuresVolumeControl === false) {\\n this.addClass('vjs-hidden');\\n } else {\\n this.removeClass('vjs-hidden');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"127afe6b5ca05a349378b7f447a43d56\",\n \"score\": \"0.70530707\",\n \"text\": \"function toggleMute() {\\r\\n var myVideo = document.getElementById(\\\"myVideo\\\");\\r\\n var mute = document.getElementById(\\\"mute\\\");\\r\\n if (myVideo.muted) {\\r\\n mute.innerHTML = \\\"Mute\\\";\\r\\n myVideo.muted = false;\\r\\n } else {\\r\\n mute.innerHTML = \\\"Unmute\\\";\\r\\n myVideo.muted = true;\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df80d17206283762f6f9c223fedb81fb\",\n \"score\": \"0.7052991\",\n \"text\": \"function muteUnmute() {\\n if (userStream.getAudioTracks()[0].enabled) {\\n userStream.getAudioTracks()[0].enabled = false;\\n micButton.style.backgroundImage = 'url(\\\"/images/mic_off.png\\\")';\\n } else {\\n userStream.getAudioTracks()[0].enabled = true;\\n micButton.style.backgroundImage = 'url(\\\"/images/mic.png\\\")';\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ecb08a85493a1a1f5340f40f2e9e7f2\",\n \"score\": \"0.701421\",\n \"text\": \"mute() {\\r\\n this.setMuted(true);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01414068142f4556734ee3a83b785f1e\",\n \"score\": \"0.6998182\",\n \"text\": \"function updateVisibility() {\\n\\t if (player.tech_ && player.tech_['featuresVolumeControl'] === false) {\\n\\t this.addClass('vjs-hidden');\\n\\t } else {\\n\\t this.removeClass('vjs-hidden');\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b441721251a90019c2b59ff79f9341f\",\n \"score\": \"0.69890803\",\n \"text\": \"muteMic() { \\n if (this.localStream) {\\n this.muted = true\\n this.localStream.getAudioTracks()[0].enabled = false\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51164f2612e4f34d934c8d4123b6335d\",\n \"score\": \"0.6987345\",\n \"text\": \"function toggleMuteAudio(){\\n $(\\\"#mainTheme\\\").prop(\\\"muted\\\",!$(\\\"#mainTheme\\\").prop(\\\"muted\\\"));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc6bd3eb46b35452327e62adca4e0326\",\n \"score\": \"0.6971425\",\n \"text\": \"isMuted() { return; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2811e32d2668648fe28e5b7c28f3ec04\",\n \"score\": \"0.6958224\",\n \"text\": \"mute () {\\n\\t\\tthis.methodMute()\\n\\t\\tthis.wrapperPlayer.querySelector('.v-volume').classList.add('v-muted')\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35f897dee3b60ad2b2794242cb499f19\",\n \"score\": \"0.6951555\",\n \"text\": \"function toggleVolume() { // Run On Click On Icon Volume For Mute Volume\\n 'use strict';\\n buttonVolume.classList.toggle('fa-volume-up');\\n buttonVolume.classList.toggle('fa-volume-off');\\n if (buttonVolume.classList.contains('fa-volume-off')) {\\n video.muted = true;\\n rangeVolume.value = 0;\\n iconCloseVolume.style.display = \\\"block\\\";\\n } else {\\n video.muted = false;\\n rangeVolume.value = volumeVal;\\n iconCloseVolume.style.display = \\\"none\\\";\\n if (rangeVolume.value === 0) {\\n video.volume = 0.2;\\n rangeVolume.value = 0.2;\\n iconCloseVolume.style.display = 'none';\\n rangeVolume.onchange = function () { video.muted = false; video.volume = this.value; };\\n rangeVolume.onmousemove = function () { video.muted = false; video.volume = this.value; };\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24c27687968ceacad916e335f7810f5c\",\n \"score\": \"0.6949374\",\n \"text\": \"unmuteMic() {\\n if (this.localStream) {\\n this.muted = false\\n this.localStream.getAudioTracks()[0].enabled = true\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"484f47a3cd7ed1aded0419780a97e61d\",\n \"score\": \"0.69370115\",\n \"text\": \"function volumen() {\\n\\n\\t\\t\\t\\tsoundtrack.volume = (volumeAudio.value) * 0.01;\\n\\t\\t\\t\\taudioUpdate =soundtrack.volume\\n\\t\\t\\t\\trangeUpdate = volumeAudio.value\\n\\t\\t\\t\\tif (soundtrack.volume > 0) {\\n\\t\\t\\t\\t\\tvolumeOff.style.display = 'none'\\n\\t\\t\\t\\t\\tvolumeOn.style.display = 'block'\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tvolumeOn.style.display = 'none'\\n\\t\\t\\t\\t\\tvolumeOff.style.display = 'block'\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fead27db4149a853c626d8b6da69c94a\",\n \"score\": \"0.6933194\",\n \"text\": \"unMute () {\\n\\t\\tthis.methodUnMute()\\n\\t\\tthis.wrapperPlayer.querySelector('.v-volume').classList.remove('v-muted')\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52357bfcc6fa8daa92b91cb388abd359\",\n \"score\": \"0.6917357\",\n \"text\": \"function toggleMute(con){\\n\\tcreatejs.Sound.setMute(con);\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52357bfcc6fa8daa92b91cb388abd359\",\n \"score\": \"0.6917357\",\n \"text\": \"function toggleMute(con){\\n\\tcreatejs.Sound.setMute(con);\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a240d04905b1a7f80df8b0a9f346725\",\n \"score\": \"0.6916589\",\n \"text\": \"_onVolumeClick() {\\n const {\\n muteVideoRequest,\\n userDid,\\n muteNowPlaying,\\n mutePreview,\\n } = this.props;\\n muteVideoRequest({\\n muteNowPlaying: userDid && muteNowPlaying ? muteNowPlaying : mutePreview,\\n mutePreview: !mutePreview,\\n userDid: !!(userDid && muteNowPlaying),\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68d986ed0e32079ae014f2b0eaa53bed\",\n \"score\": \"0.69037527\",\n \"text\": \"function updateVolumeIcon() {\\n volumeIcons.forEach(icon => {\\n icon.classList.add('hidden');\\n });\\n \\n volumeButton.setAttribute('data-title', 'Mute (m)')\\n \\n if (video.muted || video.volume === 0) {\\n volumeMute.classList.remove('hidden');\\n volumeButton.setAttribute('data-title', 'Unmute (m)')\\n } else if (video.volume > 0 && video.volume <= 0.5) {\\n volumeLow.classList.remove('hidden');\\n } else {\\n volumeHigh.classList.remove('hidden');\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fae1031091188cba04010175fe05c171\",\n \"score\": \"0.69024146\",\n \"text\": \"function unmute() {\\n track.enabled = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da73e5e681578f728e8bbb50eb6f3427\",\n \"score\": \"0.688267\",\n \"text\": \"function mute() {\\n sendCmd(\\\"mute\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8de8d0da736b845cc59e4ddcfa557c6f\",\n \"score\": \"0.68742377\",\n \"text\": \"function muteSong() {\\r\\n if (mute == false) {\\r\\n soundIcon.classList.remove(\\\"fa-volume-up\\\");\\r\\n soundIcon.classList.add(\\\"fa-volume-mute\\\");\\r\\n track.volume = 0;\\r\\n mute = true;\\r\\n }\\r\\n else {\\r\\n soundIcon.classList.remove(\\\"fa-volume-mute\\\");\\r\\n soundIcon.classList.add(\\\"fa-volume-up\\\");\\r\\n track.volume = 1;\\r\\n mute = false;\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce5497e7062991af6155efcce2c9ad43\",\n \"score\": \"0.68420976\",\n \"text\": \"unmute() {\\r\\n this.setMuted(false);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8d2c8d2d93f5ed81c1c7e3e2f269aab\",\n \"score\": \"0.681876\",\n \"text\": \"toggleMuted() {\\r\\n this.setMuted(!this._muted);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6666901a5abb12e3e6b623fa173a9cbc\",\n \"score\": \"0.68060845\",\n \"text\": \"function onVolumeControlClick(){\\n\\tif(_CONFIG.mute){\\n\\t\\t_CONFIG.mute = false;\\n\\t\\t_CONFIG.theme.volume = 1;\\n\\t\\tdocument.getElementById(\\\"volumeControl\\\").src = \\\"./assets/volume_on.png\\\";\\n\\t}else{\\n\\t\\t_CONFIG.mute = true;\\n\\t\\t_CONFIG.theme.volume = 0;\\n\\t\\tdocument.getElementById(\\\"volumeControl\\\").src = \\\"./assets/volume_off.png\\\";\\n\\n\\t\\t// Update Achievement\\n\\t\\tincrementAchievementProgress(6, 1);\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"76cfa9383fe35f83435d74f6dbe56577\",\n \"score\": \"0.68007445\",\n \"text\": \"toggleVolume() {\\n this.volumeOn = !this.volumeOn;\\n this.setProgress(this.getProgressPlayed());\\n if (this.isPlaying()) {\\n this.play();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"144d212516a70dd4df70315168df6cd6\",\n \"score\": \"0.679783\",\n \"text\": \"function handleVolumeClick() {\\n if (videoPlayer.muted) {\\n videoPlayer.muted = false;\\n volumeBtn.innerHTML = '<i class=\\\"fas fa-volume-up\\\"></i>'\\n volumeRange.value = videoPlayer.volume //unmute하면 원래 음량range로\\n } else {\\n videoPlayer.muted = true;\\n volumeBtn.innerHTML = '<i class=\\\"fas fa-volume-mute\\\"></i>';\\n volumeRange.value = 0; //mute되면 range value값이 0이 되도록.\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"406c449cea047d20d67903d430680c22\",\n \"score\": \"0.67764485\",\n \"text\": \"getMuted() {\\r\\n return this.volume === 0 ? true : this._muted;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99f43935b1822f2286cad960ff45da3e\",\n \"score\": \"0.6757708\",\n \"text\": \"function offVolume(){\\n\\t\\t\\t\\t/*if (Audio === undefined) {\\n\\t\\t\\t\\t\\tAudio = document.getElementById($scope.objectPlayList[0])\\n\\t\\t\\t\\t}*/\\n\\t\\t\\t\\tsoundtrack.volume = 0\\n\\t\\t\\t\\tvolumeAudio.value = 0\\n\\n\\t\\t\\t\\tvolumeOn.style.display = 'none'\\n\\t\\t\\t\\tvolumeOff.style.display = 'block'\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed9a1115965f122e42022f6ae5984d3e\",\n \"score\": \"0.67544746\",\n \"text\": \"isMuted() {\\n const track = this.localAudioTrack || this.localVideoTrack;\\n if (!track) {\\n return false;\\n }\\n return !track.enabled;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5208f6bcf44cb78318407186043150d3\",\n \"score\": \"0.67411274\",\n \"text\": \"function processMute (data) {\\n controls.setMute(data)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87636e942e654c4349623974f2bac332\",\n \"score\": \"0.6736174\",\n \"text\": \"function muteSound(){\\n if (muted) {\\n muted = false;\\n document.getElementById(\\\"mute\\\").innerHTML = \\\"Mute Sound\\\";\\n } else {\\n muted = true;\\n document.getElementById(\\\"mute\\\").innerHTML = \\\"Unmute Sound\\\";\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19a692d3761df11ef87e1cfa1b3f9a2b\",\n \"score\": \"0.6714285\",\n \"text\": \"function mute(music) {\\n if (sound === true) {\\n sound = false;\\n music.volume = 0;\\n\\n\\n } else {\\n sound = true;\\n\\n }\\n playSound(music);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd3772d86a64c9b6856bb576a98ba4fb\",\n \"score\": \"0.6702017\",\n \"text\": \"function muteMic() { // stream is your local WebRTC stream\\n\\t\\t\\t\\tconsole.log(\\\"mic muted\\\");\\n \\t\\t\\t\\t var audioTracks = mystream.getAudioTracks();\\n \\t\\t\\t\\tfor (var i = 0, l = audioTracks.length; i < l; i++) {\\n \\t\\t\\t\\t audioTracks[i].enabled = false;//!audioTracks[i].enabled;\\n \\t\\t\\t\\t }\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"171f60390108e7c1f8198790d8e92afd\",\n \"score\": \"0.6682819\",\n \"text\": \"function muteUnmuteHandler0(e) {\\n console.log(' call muter');\\n clearInterval(creative.myTimer_endVideoShort);\\n \\n // moveVideoControls();\\n creative.myVideo.vidPauseBtn.style.visibility = 'visible';\\n\\n if (creative.myVideo.vid.volume == 0.0) {\\n // Enabler.counter(\\\"Unmute video 0\\\", true);\\n creative.myVideo.vid.volume = 1.0;\\n creative.myVideo.vidMuteBtn.style.visibility = 'visible';\\n creative.myVideo.vidUnmuteBtn.style.visibility = 'hidden';\\n } else {\\n // Enabler.counter(\\\"Mute video 0\\\", true);\\n creative.myVideo.vid.volume = 0.0;\\n creative.myVideo.vidMuteBtn.style.visibility = 'hidden';\\n creative.myVideo.vidUnmuteBtn.style.visibility = 'visible';\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9bb9e98f0491b7a7af8bf190a63c3053\",\n \"score\": \"0.66749763\",\n \"text\": \"function musicController() {\\n if (audio.isMusicMuted === true) {\\n audio.isMusicMuted = false;\\n audio.musicBtn.innerHTML = \\\"On\\\";\\n playMusic();\\n } else if (audio.isMusicMuted === false) {\\n audio.isMusicMuted = true;\\n audio.musicBtn.innerHTML = \\\"Off\\\";\\n stopMusic();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1786e04499f97bbf6b93a8e3364cad0\",\n \"score\": \"0.66748315\",\n \"text\": \"set muted(value) {\\n this.media.muted = value;\\n // if(value === true){\\n // this.media.muted = true\\n // }else{\\n // this.media.muted = false\\n // }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4bcd84e402ea9ffb1526470d4e2bc799\",\n \"score\": \"0.6669756\",\n \"text\": \"function mute(){\\n if (video.muted){\\n video.muted = false;\\n }else {\\n video.muted = true;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48b735b351c4815e90725466294b877c\",\n \"score\": \"0.6668874\",\n \"text\": \"onAudioMute (id, isMuted) {\\n if (APP.conference.isLocalId(id)) {\\n localVideoThumbnail.showAudioIndicator(isMuted);\\n } else {\\n let remoteVideo = remoteVideos[id];\\n if (!remoteVideo)\\n return;\\n\\n remoteVideo.showAudioIndicator(isMuted);\\n if (APP.conference.isModerator) {\\n remoteVideo.updateRemoteVideoMenu(isMuted);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae6d0bd7cb821838635eb087b1c6f464\",\n \"score\": \"0.666219\",\n \"text\": \"function soundEffectController() {\\n if (audio.isSoundMuted === true) {\\n audio.isSoundMuted = false;\\n audio.soundEffectBtn.innerHTML = \\\"On\\\";\\n } else if (audio.isSoundMuted === false) {\\n audio.isSoundMuted = true;\\n audio.soundEffectBtn.innerHTML = \\\"Off\\\";\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de1078568747dcdf7421c0bc0f35a7d6\",\n \"score\": \"0.6649464\",\n \"text\": \"function _videoVolume(event) {\\n var element = event.target;\\n var delayer = muteDelays[element.id];\\n\\n if (delayer) {\\n clearTimeout(delayer);\\n }\\n\\n if (element.muted || element.volume === 0) {\\n muteDelays[element.id] = setTimeout(function () {\\n console.log('videoMuted', event);\\n sendEvent('mute');\\n }, 100);\\n } else {\\n muteDelays[element.id] = setTimeout(function () {\\n console.log('videoUnMuted', event);\\n sendEvent('unmute');\\n }, 100);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d155b0e8ac5e231626cba479365a6e14\",\n \"score\": \"0.6643933\",\n \"text\": \"function muteMe(elem, muteToggle) {\\n\\telem.muted = muteToggle;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b686d559ee600c2a93356c9db7adffb\",\n \"score\": \"0.6642016\",\n \"text\": \"unmute() {\\n this.media.muted = false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4dfd08c90b95a85227e6c49e70931dd4\",\n \"score\": \"0.66417575\",\n \"text\": \"get isMuted() {\\n\\t\\treturn this._refs.video.muted;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af1460179231bf961fb7af05e88eb83e\",\n \"score\": \"0.66266423\",\n \"text\": \"function toggleMusic(musicElm, maxVolLvl, minVolLvl, zeroVolLvl){\\n\\t\\tif (musicElm.volume >= minVolLvl)\\n\\t\\t{\\n\\t\\t\\tmusicElm.volume = zeroVolLvl;\\t\\n\\t\\t} else\\n\\t\\t{\\n\\t\\t\\tmusicElm.volume = maxVolLvl;\\n\\t\\t}\\t\\t\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80108c3a3a7cc93beeb0d10af4ad2b4b\",\n \"score\": \"0.6614683\",\n \"text\": \"function showMuteButton(call) {\\r\\n var peerconnection = call.getPeerConnection();\\r\\n if (peerconnection == null) {\\r\\n // For certain rehydration case, peerconnection maybe null, we also need to show buttons.\\r\\n muteButton(call, true);\\r\\n return;\\r\\n }\\r\\n peerconnection.getLocalStreams().map(function(stream) {\\r\\n stream.getAudioTracks().map(function(audioTrack) {\\r\\n muteButton(call, audioTrack.enabled);\\r\\n });\\r\\n });\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3277291a286472e8d3b31ba973329a9\",\n \"score\": \"0.6596109\",\n \"text\": \"function toggleMuteAudio(){ \\n $(\\\"audio\\\").prop(\\\"muted\\\",!$(\\\"audio\\\").prop(\\\"muted\\\")); //prop is for property\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34317466ba4b5c1eb2b3a1a4a2925b0e\",\n \"score\": \"0.6574878\",\n \"text\": \"mute () {\\n this._muted = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ac577e719a3de89b232b08cf0857aee\",\n \"score\": \"0.6573261\",\n \"text\": \"function UnMuteThisVideo(){\\n\\t\\tytp.unMute();\\n\\t\\tTweenLite.set('#muteOff', {alpha: 1, y: 0});\\n\\t\\tTweenLite.set('#muteOn', {alpha: 0, y: -40});\\n\\t\\tEnabler.counter('YTVideo UnMute');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"222adbea14746fa8309bb8638ba75085\",\n \"score\": \"0.6572383\",\n \"text\": \"function muteRemote() {\\n var inverse = remoteVid.muted ? false : true\\n remoteVid.muted = inverse;\\n if (inverse) {\\n remotemutebtn.className = \\\"btn btn-primary float-left w-100\\\"\\n remotemutebtn.innerHTML = \\\"Unmute\\\"\\n }\\n else {\\n remotemutebtn.className = \\\"btn float-left w-100 btn-outline-primary\\\"\\n remotemutebtn.innerHTML = \\\"Mute\\\"\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6c3c4238d81088e1e6059411419d5ec\",\n \"score\": \"0.6569686\",\n \"text\": \"isMuted () {\\n return this.tag ? this.tag.muted : null\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99b4a90f8f5af8b66fa37b0e02f6caaa\",\n \"score\": \"0.65680826\",\n \"text\": \"methodMute () {\\n\\t\\tthis.player.muted = true\\n\\t\\tthis.player.setAttribute('muted', '')\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98331a16274cd155c4c81b4b585fb365\",\n \"score\": \"0.65459365\",\n \"text\": \"function updateVolumeIcon() {\\n \\n const volumeIcons = document.querySelectorAll('.volume-button g');\\n const volumeButton = document.getElementById('volume-button');\\n\\n const video = document.getElementById('video');\\n\\n const volumeLow = document.querySelector(\\\"#volume-low\\\");\\n const volumeHigh = document.querySelector(\\\"#volume-high\\\");\\n\\n volumeIcons.forEach((icon) => {\\n icon.setAttribute('visibility', 'hidden');\\n });\\n\\n volumeButton.setAttribute('data-title', 'Mute (m)');\\n\\n const volumeMute = document.querySelector(\\\"#volume-mute\\\");\\n if (video.muted || video.volume === 0) {\\n volumeMute.setAttribute('visibility',\\\"visible\\\"); //.classList.remove('hidden');\\n \\n volumeButton.setAttribute('data-title', 'Unmute (m)');\\n\\n } else if (video.volume > 0 && video.volume <= 0.5) {\\n volumeLow.setAttribute('visibility',\\\"visible\\\"); //.classList.remove('hidden');\\n } else {\\n volumeHigh.setAttribute('visibility',\\\"visible\\\"); //.classList.remove('hidden');\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"641b68f830696d7ca8157dfd9ac7d609\",\n \"score\": \"0.654446\",\n \"text\": \"mute() {\\n this._muted = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9186a042b0b1efd6eec63d28f31e3cd0\",\n \"score\": \"0.65440273\",\n \"text\": \"function mute(){\\n\\t var song = document.querySelector('audio');\\n\\t if(song.muted)\\n\\t {\\n\\t song.muted=false;\\n\\t }\\n else\\n\\t {\\n\\t\\t song.muted = true;\\n\\n\\t\\t }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7424bc1817d4e2691889cfdb2df3dd0\",\n \"score\": \"0.65425825\",\n \"text\": \"_onTrackMuteChanged(jitsiTrack) {\\n if (jitsiTrack.isLocal()) {\\n return;\\n }\\n const participant = jitsiTrack.getParticipantId();\\n const isMuted = jitsiTrack.isMuted();\\n\\n this.debug(\\\"Mute changed to\\\", isMuted, \\\"for\\\", jitsiTrack.getType(), \\\"for participant\\\", participant);\\n\\n if (jitsiTrack.getType() === \\\"video\\\") {\\n this._render();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6056999d6732bd1a5e39ef266263f13b\",\n \"score\": \"0.6529063\",\n \"text\": \"mute() {\\n this.media.muted = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d7a8b56eeaf2f96f080e79c7f23ee73\",\n \"score\": \"0.6523607\",\n \"text\": \"mute() {\\n this.media.muted = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cab012e360d7668c7236c39a9cb21463\",\n \"score\": \"0.6518662\",\n \"text\": \"function muteLocalAudio() {\\n logger(\\\"Local Function: <b style='color:darkBlue'>muteLocalAudio()</b>\\\");\\n if ($(\\\"#btn_mute_local_audio\\\").html() == \\\"Mute Audio\\\") {\\n logger(\\\"Agora Function: <b style='color:indigo'>local_stream.disableAudio()</b>\\\");\\n local_stream.disableAudio();\\n } else {\\n logger(\\\"Agora Function: <b style='color:indigo'>local_stream.enableAudio()</b>\\\");\\n local_stream.enableAudio();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8729e2df9e2b41439c4359fec73c7d3\",\n \"score\": \"0.6512634\",\n \"text\": \"function muteAudio() {\\n let player = document.getElementById('animationAudio')\\n let muteButtonText = document.getElementById('muteButton')\\n console.log(player.muted)\\n if (player.muted === false) {\\n muteButtonText.innerHTML = \\\"Unmute audio\\\"\\n return player.muted = true\\n } else if (player.muted === true) {\\n muteButtonText.innerHTML = \\\"Mute audio\\\"\\n return player.muted = false\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9fbdcc6629554c03e18e34435c78f02\",\n \"score\": \"0.64974964\",\n \"text\": \"function myAudio(){\\n const enabled = myVideoStream.getAudioTracks()[0].enabled;\\n if (enabled) { // if I am already unmuted\\n myVideoStream.getAudioTracks()[0].enabled = false;\\n unmuteMe();\\n } else {\\n muteMe();\\n myVideoStream.getAudioTracks()[0].enabled = true;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f92bba48aabe1c295dd0ace582d902c\",\n \"score\": \"0.6492599\",\n \"text\": \"switchPower(event){\\n var powerChoice = document.getElementById('mute');\\n (powerChoice.checked)? ( this.setMute(false)) : ( this.setMute(true)) ;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96ce434b945e987ca0d92764c72585ac\",\n \"score\": \"0.6489471\",\n \"text\": \"function disableMute(e) { \\n e.preventDefault()\\n if (mute === true) {\\n setMute(false)}\\n else{\\n setMute(true)\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d55f46d09cb45974779eb9d9a414e425\",\n \"score\": \"0.64793074\",\n \"text\": \"setMuted(isMute) {\\r\\n if (isMute)\\r\\n this.audio.volume = 0;\\r\\n else\\r\\n this.audio.volume = this._volume;\\r\\n this._muted = isMute;\\r\\n this.emit(PlayerEvent.VolumeChange, this.audio.volume);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee67c149748042c7b8fe513e882ede13\",\n \"score\": \"0.64585894\",\n \"text\": \"function changeVolume(value, isMuted, directUpdate){ \\n proxyVolume = value;\\n if(directUpdate) volumeSlider.value = proxyVolume;\\n var imageToTake;\\n if (isMuted){\\n imageToTake = \\\"speaker_none.png\\\";\\n }else{\\n if (value < 33){\\n imageToTake = \\\"speaker_low.png\\\";\\n }\\n else if (value < 66){\\n imageToTake = \\\"speaker_medium.png\\\";\\n }else{\\n imageToTake = \\\"speaker_full.png\\\";\\n }\\n }\\n muteButton.src = imageToTake;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f66c2a0b4a375b087c312766fcdb40c\",\n \"score\": \"0.64536345\",\n \"text\": \"volumeHack_() {\\n const self = this;\\n if (!self.hasInteractedWithMedia_) {\\n const volume = self.getVolume_();\\n\\n // Pick a new volume that is slightly different than the current\\n // volume, making sure to not go out of the allowed bounds.\\n let newVolume = volume + 0.1;\\n if (newVolume > 1.0) {\\n newVolume = volume - 0.1;\\n }\\n\\n self.tileRenderer_.setVolume(newVolume);\\n self.tileRenderer_.setVolume(volume);\\n self.hasInteractedWithMedia_ = true;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"496588642620ae3e3ae0fcb0577093f4\",\n \"score\": \"0.6446005\",\n \"text\": \"function updateVolume() {\\n if (video.muted) {\\n video.muted = false;\\n }\\n video.volume = volume.value;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a5a9bed4c780dff0615fb06377de793\",\n \"score\": \"0.644458\",\n \"text\": \"function muteMe(elem) {\\n elem.muted = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"687628de9db8b24062181337d71c2800\",\n \"score\": \"0.6431044\",\n \"text\": \"muteVideo() {\\n if (this.localStream) {\\n this.videoMuted = true\\n this.localStream.getVideoTracks()[0].enabled = false\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40e2f5ff0bc903bae0891e4d88cb869f\",\n \"score\": \"0.6427835\",\n \"text\": \"function toggleMuteSound(elem) {\\n\\tif(elem.muted == false) {\\n\\t\\telem.muted = true;\\n\\t\\telem.pause();\\n\\t} else {\\n\\t\\telem.muted = false;\\n\\t\\tif(elem.loop) {\\n\\t\\t\\telem.play();\\n\\t\\t}\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"916f8563adf1d6fbe39b85b878eb1693\",\n \"score\": \"0.6426823\",\n \"text\": \"function musikOnOff(type) {\\r\\n\\tif(type == \\\"off\\\") {\\r\\n\\t\\tplayMusik[played].pause();\\r\\n\\t\\tmusikPlay = false;;\\r\\n\\t}else {\\r\\n\\t\\tplayMusik[played].play();\\r\\n\\t\\tmusikPlay = true;\\r\\n\\t}\\r\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":0,"numItemsPerPage":100,"numTotalItems":952436,"offset":0,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4NTg2NzU0MCwianRpIjoiMjRkNjk1ZTgtMzQ3NC00ZGI0LWIzZmYtMWY1ZDdmY2ZhYjE0Iiwic3ViIjoiL2RhdGFzZXRzL250aGFrdXIvY29ybnN0YWNrLWphdmFzY3JpcHQtdjEtdGV2YXRyb24tMU0iLCJleHAiOjE3ODU4NzExNDAsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.mc3lRZqsuBqy1daUz38uy5lJ0aR8zoRBJEExIlxO8kP9BruOErlb0wAQNyAHYGFvyaFQ6p_8Z2Or0v2S-InpCw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":952436,"numBytesParquet":23765831875}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query_id stringlengths 32 32 | query stringlengths 7 29.6k | positive_passages listlengths 1 1 | negative_passages listlengths 88 101 |
|---|---|---|---|
3ab212d67275632838c26facaff8cace | Removes all keyvalue entries from the map. | [
{
"docid": "a1c16153d9285b507b13d1c4bf2b381b",
"score": "0.0",
"text": "function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n}",
"title": ""
}
] | [
{
"docid": "4f4725c7fa4ecb066ed06f33df6b540b",
"score": "0.7590112",
"text": "clear() {\n var map = this._map;\n var keys = Object.keys(map);\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n map[key].clear();\n }\n }",
"title": ""
},
{
"docid": "e286e... |
2b364528760b6b02795ae8488b953db7 | Computes a final transform result after the transform has been acknowledged by the server, potentially using the serverprovided transformResult. | [
{
"docid": "39d273d9de14d4aaa836412f3fbccc55",
"score": "0.0",
"text": "function Ne(t, e, n) {\n // The server just sends null as the transform result for array operations,\n // so we have to calculate a result the same as we do for local\n // applications.\n return t instanceof $e ? Oe(t, e) : t in... | [
{
"docid": "d00a3645bf880b15f565f347b6d6ea3f",
"score": "0.6185749",
"text": "withResultTransform(transform) {\n _classPrivateFieldBase(this, _transformResult)[_transformResult] = transform;\n return this;\n }",
"title": ""
},
{
"docid": "cdb928f02f006f0e6ec56f50d3e24df2",
"... |
6467bb0e57befdc97181dbfaf13206af | ECMA262 11.6 Identifier Names and Identifiers | [
{
"docid": "c150c4c503cb1894c5969bf6c03d54da",
"score": "0.0",
"text": "function fromCodePoint(cp) {\n return (cp < 0x10000) ? String.fromCharCode(cp) :\n String.fromCharCode(0xD800 + ((cp - 0x10000) >> 10)) +\n String.fromCharCode(0xDC00 + ((cp - 0x10000) & 1023));\n }",... | [
{
"docid": "4d09fbf5711d1cf6902b391c7abd83e9",
"score": "0.7452734",
"text": "function parseIdentifier() {\n _index3.next.call(void 0, );\n _base.state.tokens[_base.state.tokens.length - 1].type = _types3.TokenType.name;\n}",
"title": ""
},
{
"docid": "a5df2d236cafda4c0e68bc09c7b5dd0f",
... |
f20ee5d811c6a51169f57e637a91a7c3 | particular li clicked function | [
{
"docid": "d61f5c6e8aedd3b1ccb81eeab7720372",
"score": "0.708135",
"text": "function clicked(element){\r\n let getLiIndex = element.getAttribute(\"li-index\");\r\n musicIndex = getLiIndex; //updating current song index with clicked li index\r\n loadMusic(musicIndex);\r\n playMusic();\r\n playingSo... | [
{
"docid": "7af1f16b8d36a848676f274ee501fa0f",
"score": "0.7080392",
"text": "function clicked(element){\n let getLiIndex = element.getAttribute(\"li-index\");\n musicIndex = getLiIndex; //updating current song index with clicked li index\n loadMusic(musicIndex);\n playMusic();\n playingSong();\n}"... |
16d6f1f625330dd4b9fff5a8b9a97150 | Get the latest Data published by CDC regarding the current ILI activity at state level. | [
{
"docid": "d62f95b4f1ab2b19f7c35de3a6370259",
"score": "0.0",
"text": "function populateStateData() {\n var data = {};\n\n // craft the URL\n var url = window.location.origin + '/flutracker/guest/api/getLatestActualData/CDC/stateActivity/';\n\n\n // Do a synchronous get request\n $.ajax(... | [
{
"docid": "55b8bc741e523b1cb0170b6a9a162ddb",
"score": "0.5644796",
"text": "getCurrentActivity() {\n debug('retrieve current activity');\n const payload = {\n hubId: this.remoteId,\n timeout: 30,\n hbus: {\n cmd: 'vnd.logitech.harmony/vnd.l... |
e65a3dd774fe200864e4667c11f326e0 | Determines whether to skip/remove the backtick or not. | [
{
"docid": "92b18e94c5b5c634bb91281f5dce171d",
"score": "0.7530884",
"text": "function shouldSkipOrRemoveBacktick(Editor) {\n var Components = Editor.Components;\n\n var _Components$Selection = Components.Selection.get(),\n start = _Components$Selection.start;\n\n var info = Components.Code.line... | [
{
"docid": "eb25f751389ee30df69fcb6904781929",
"score": "0.624169",
"text": "function shouldCloseBacktick(Editor) {\n var Components = Editor.Components;\n var Input = Components.Input;\n var prevInfo = Input.info;\n\n if (prevInfo && prevInfo.category === CATEGORY_STRING) {\n return false;\n }\... |
bada1bc5036dbfa5fd64ee3d73b7e34e | Enable the wikipathwayspvjs custom element | [
{
"docid": "7a559b3a872f8737062fcf7601cc8601",
"score": "0.68406606",
"text": "function registerWikiPathwaysPvjsElement(Pvjs) {\n 'use strict';\n\n var DivPrototype = Object.create(window.HTMLDivElement.prototype);\n\n DivPrototype.attributeChangedCallback = function(\n attrName, oldValu... | [
{
"docid": "5d24f9d7ce6aca35ce243056a6a88da8",
"score": "0.6006504",
"text": "enable() {\n this.enabled_ = true;\n this.removeClass('vjs-disabled');\n\n this.menuButton_.enable();\n }",
"title": ""
},
{
"docid": "1688515638984721de45c82adb35dbc1",
"score": "0.59339607",
"te... |
8b3caffe3ba3bbebcd5405d0a3184d76 | translate page to SVG coordinate | [
{
"docid": "6ad05fed4c7f094a5486e9251cd70d1b",
"score": "0.6320841",
"text": "function svgPoint(element, x, y) {\n const svg = document.querySelector(\"svg\");\n const pt = svg.createSVGPoint();\n\n pt.x = x;\n pt.y = y;\n\n return pt.matrixTransform(element.getScreenCTM().inverse());\n}"... | [
{
"docid": "203e02400d95f5c9d75a3b9cf5c0ccd5",
"score": "0.78892404",
"text": "function convertToSVGCoordinateSpace(svgPage,x,y)\n{\n\tvar svgPointForConversion = svgPage.createSVGPoint();\n\tsvgPointForConversion.x = x;\n\tsvgPointForConversion.y = y;\n\tvar transformed = svgPointForConversion.matrixTr... |
6eceb702974f794b154cc3205b341c4f | Function: Mounts the controller's request handler. | [
{
"docid": "c1702092c2e47e60427d62336564e1d0",
"score": "0.0",
"text": "mount() {\r\n return null;\r\n }",
"title": ""
}
] | [
{
"docid": "196b32b737d29f6c37c22b961345a329",
"score": "0.7365978",
"text": "_mount() {\n\t\tthis._mergeMiddleware(this._parent);\n\n\t\tthis._requestHandler = new RequestHandler(this);\n\t\tthis._parent._router[this._method](this._path, util.WrapAsyncFunction((req, res) => this._requestHandler.handle(... |
c14645e21c7e33e7cca0a522300f2f47 | LOGIC TO CHECK THE PASSWORD AND REPASSWORD ARE THE SAME (newuserpage) $() | [
{
"docid": "72e14841c1bda4445d6c6f362f97a1b9",
"score": "0.0",
"text": "function initialize() {\n var mapOptions = {\n zoom: 11\n };\n map = new google.maps.Map(document.getElementById('map-canvas'),\n mapOptions);\n\n \n // Try HTML5 geolocation\n if(navigator.geolocation) ... | [
{
"docid": "885767be4d5fd355ed06290c5298608c",
"score": "0.7766336",
"text": "checkPwd() {\n if (document.getElementById('newPwd').value !== document.getElementById('repeatPwd').value) {\n alert(getLang('SAME_PWD'));\n return false;\n }\n }",
"title": ""
},
{
"docid": "437fc... |
70f4d53f29d928f126e36beb04394182 | init(); Generate the random number | [
{
"docid": "29ce52b44c915dd26132dfe7c2e2ead6",
"score": "0.0",
"text": "function btnClick() {\n console.log('Function called.');\n //Do something here!!\n\n //1. Random number\n var dice = Math.floor((Math.random() * 6) + 1);\n console.log(dice);\n //Display\n var diceDOM = document.q... | [
{
"docid": "791b3a86f88300db918cfe43a330c036",
"score": "0.7871363",
"text": "function init() {\n self.randomNumber = 0;\n // WHAT IF this.randomNumber\n }",
"title": ""
},
{
"docid": "9bfce9a693573704cef52f64299b1e2e",
"score": "0.75061613",
"text": "fun... |
64ec7b2e9a81a2d98ad3a9f6728a4aa2 | What is a jQuery but a misunderstood object? > What Is A JQuery But A Misunderstood Object? | [
{
"docid": "19c815a3dbae372a6e52fa2c75087e5d",
"score": "0.0",
"text": "function capitalize(words) {\n words = words.split(' ');\n for(var i = 0; i <words.length; i++) {\n words[i] = words[i].split('');\n words[i][0] = words[i][0].toUpperCase();\n words[i] = words[i].join('');\n }\nreturn wo... | [
{
"docid": "1acb1766174a774cff4437a1a375686a",
"score": "0.66325575",
"text": "function isjQuery(obj) {\n\t\treturn (obj && (obj instanceof jQuery || obj.constructor.prototype.jquery));\n\t}",
"title": ""
},
{
"docid": "ab7ee6f5971c549252a6c3f81e05ad79",
"score": "0.6607967",
"text":... |
2439680a46d13dbfb9364428ea31a2f0 | genVerts helper : Duplicate and Rotate a set of vertices, | [
{
"docid": "b95f5a97ebd94104d3bd57413bb2da56",
"score": "0.55866027",
"text": "static repeatPoints(buf, offset, cnt, scl, verts, norm) {\n // eslint-disable-next-line @typescript-eslint/no-empty-function\n const fn = [() => { }, VRot90.yn, VRot90.y2, VRot90.yp];\n const len = cnt - ... | [
{
"docid": "fbf241a5b26bf82c490cd1c8e67b71c4",
"score": "0.6157152",
"text": "function insertDuplicateVertices(vertices) {\n for (var i = vertices.length - 1; i > 0; i -= 2) \n vertices.splice(i, 0, vertices[i], vertices[i]);\n return vertices;\n}",
"title": ""
},
{
"docid": "f9... |
2f44a40eaefa37699abec62f8b417092 | Use as little precision as is needed to generate a completely uniform distribution from the PRNG to the target range. Can be very slow to execute. If max is not specified, assume 2^53. | [
{
"docid": "e5bc0de0facace7f927fbac8dfe353b8",
"score": "0.74500555",
"text": "function _randIntUniform (max) {\n if (typeof max === 'undefined')\n return _randInt53();\n if (max == 0)\n return 0;\n var log2 = 0;\n var mult = 1;\n... | [
{
"docid": "296c1008f7d5a0c81d9900cc18d268b0",
"score": "0.7735634",
"text": "function rng(max) {\n return Math.floor(Math.random() * max)\n}",
"title": ""
},
{
"docid": "e76e4aa7c9a03adb82434e8ebacde9e6",
"score": "0.7482255",
"text": "function r(max){ return Math.floor(Math.rand... |
c6ccd9669c91bb1fc3c5f6b62f619228 | Expects: DNI number Returns: Letter of DNI number | [
{
"docid": "99472617af811dc0d8e8f0694cda4466",
"score": "0.74684435",
"text": "function getDNILetterByParameter (dni) { \r\n dniLetter =\"TRWAGMYFPDXBNJZSQVHLCKET\"; \r\n position = dni % 23; \r\n return dniLetter.substring(position, position+1); \r... | [
{
"docid": "06ede784af491b7a2f86ebef2a4a0823",
"score": "0.7212819",
"text": "function getDNILetter () { \r\n dniLetter =\"TRWAGMYFPDXBNJZSQVHLCKET\"; \r\n position = $(\"#dniNumber\").val() % 23; \r\n return dniLetter.substring(position, position+1); ... |
cf7c4f5d4fb5b23d515c4ff8cc664bdc | Get the data destination type. | [
{
"docid": "8019875d090026dc341c980116546efa",
"score": "0.714835",
"text": "function getDataDestinationType(dataDestination) {\n if (typeof dataDestination === 'string') {\n return '';\n }\n return 'remove' in dataDestination ? 'rdfjsStore' : dataDestination.type;\n}",
"title": ""
... | [
{
"docid": "98725d825dc18ebedaaea980ffb8b92d",
"score": "0.6582534",
"text": "get destinationTypeInput() {\n return this._destinationType;\n }",
"title": ""
},
{
"docid": "be6f85d7d17c59d0875850eb61696aae",
"score": "0.65191704",
"text": "function getDataDestinationValue(da... |
88eaf74e22e6c2e85199be3e84f4fff6 | 408 409 Retrieves a jQuery element's computed CSS value as a floatingpoint number. // 410 If the queried value is nonnumeric (ex: IE can return "medium" for border width), will just return zero. // 411 | [
{
"docid": "9d2380522aae60ff587687b0ad0ebe72",
"score": "0.7516368",
"text": "function getCssFloat(el, prop) { // 412\n\treturn parseFloat(el.css(prop)) || 0; ... | [
{
"docid": "546397ec2f8a80b5d474eb983359c072",
"score": "0.7193292",
"text": "function num(elem, prop) {\r\n\treturn elem[0] && parseInt( jQuery.curCSS(elem[0], prop, true), 10 ) || 0;\r\n}",
"title": ""
},
{
"docid": "546397ec2f8a80b5d474eb983359c072",
"score": "0.7193292",
"text": ... |
3c7dbb9c95abb0b5f65fa82e58b503ee | validate ajax the category modal in adding stock table | [
{
"docid": "c79fbf5210ca34c3c8a2f65e24d9e5bc",
"score": "0.7433039",
"text": "function ajax_validate(){\n$('#submit').click(function() {\n var form_data = {\n name: $('#name').val(),\n\t\tstatus: $('#status').val(),\n };\n $.ajax({\n url: \"http://localhost/projects/inventory/admi... | [
{
"docid": "b2b41d7b159cc501fcfae015eeb1c9b8",
"score": "0.7432481",
"text": "function ajax_validate(){\n$('#submit').click(function() {\n var form_data = {\n name: $('#name').val(),\n\t\tstatus: $('#status').val(),\n };\n $.ajax({\n url: \"<?php echo base_url() ?>admin/category/a... |
21bce911663c0fcce1d9e929cb5aba1c | Lookup by stream, then id to store [values, id]] | [
{
"docid": "39b4b21a697858ff5214153c13333db9",
"score": "0.5201559",
"text": "_addVariableEntry() {\n if (!this._dataPending()) {\n return;\n }\n\n // Lookup where to put the value\n let fieldName = 'doubles';\n const value = this._values[0];\n if (typeof value === 'string' || val... | [
{
"docid": "98d2ac71c52400a3b8cc801cd40cfce6",
"score": "0.6135192",
"text": "getStreamFromId(id) {\n for (item in this.options) {\n var locations = this.options[item].locations;\n\n for (var i=0; i<locations.length; i++) {\n if (locations[i].i... |
00c68013629eb189c6d920608b827374 | Returns Content 3rd Party Details | [
{
"docid": "9a17774b8c3b5d8c1027ac2a5107ed1d",
"score": "0.74442935",
"text": "function IQ_GetContent3rdPartyDetails(contentid, JSONCallback){\n\n}",
"title": ""
}
] | [
{
"docid": "db3327656c32bf1e176200a26e7929ce",
"score": "0.60870594",
"text": "getThirdPartyInfo() {\n var _this = this;\n let customAccounts = \"SmartCampus__SystemManagement/1.0.0/getCustomAccountTypeDefinition\";\n _this.callAPIConn(customAccou... |
19ed42199c4bc57a36f0e1058fa6ce1f | Find the deepest React component completely containing the root of the passedin instance (for use when entire React trees are nested within each other). If React trees are not nested, returns null. | [
{
"docid": "e994ce5cd24cd19d4ccf8e70a46b9ade",
"score": "0.0",
"text": "function findParent(inst) {\n\t // TODO: It may be a good idea to cache this to prevent unnecessary DOM\n\t // traversal, but caching is difficult to do correctly without using a\n\t // mutation observer to listen for all DOM cha... | [
{
"docid": "1d9714f4d7d57cbd57f3e4a3542c1458",
"score": "0.68767685",
"text": "function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n ... |
b0d649ee5e81aabb20f6f157b1d8b8a0 | TO DO: Maybe finished query batching | [
{
"docid": "abf5424781086b517fe235353157331f",
"score": "0.6456513",
"text": "willBatch(query) {\n const now = Date.now();\n if (this.io_stats.since < Date.now()) {\n this.io_stats.since = Date.now();\n this.io_stats.queries = 0;\n }\n else {\n ... | [
{
"docid": "99f066f0c7f4996826d9dfdac7ad8b06",
"score": "0.6895774",
"text": "function next() {\n\n if (pointer >= amount)\n return callback(false, bulk);\n\n var amountParams = bulk[pointer].params.length;\n\n bulk[pointer].batches = new Array();\n\n var i, j;\n for (i = 0, j = bulk... |
9c32a4ddef81014ebe30174ce29363b9 | Fim [add_marker] Inicio [render] | [
{
"docid": "e182b0211c63ba6b24a9f41f6eb97451",
"score": "0.0",
"text": "function render(arr){\n\tfor(var layer in omarker){\n\t\tvar l = omarker[layer];\n\t\tomapa.removeLayer( l );\n\t}\n\tomarker = [];\n\tfor(var bus in arr){\n\t\tvar b = arr[bus];\n\t\tadd_marker({lat: b[3], lon: b[4], datahora: b[0]... | [
{
"docid": "a0a9fbe8ba55b23f2081243cb5f361e4",
"score": "0.74909216",
"text": "function placeMarkers(){}",
"title": ""
},
{
"docid": "57d19e884adb48fdbd223716bfc5d524",
"score": "0.7144001",
"text": "addMarker() {\n const markerObj = {\n Snap: this.Snap,\n ... |
56aa6dc2a937817ef05001ee601daa20 | returns a function for filtering head child elements which shouldn't be duplicated, like Also adds support for deduplicated `key` properties | [
{
"docid": "6f101482750643c9ad4efad2b06e8651",
"score": "0.5222795",
"text": "function unique() {\n var keys = new _Set();\n var tags = new _Set();\n var metaTypes = new _Set();\n var metaCategories = {};\n return function (h) {\n var unique = true;\n\n if (h.key && typeof h.key !== 'number' ... | [
{
"docid": "ebe630af367033e75ecdd81b5462dc54",
"score": "0.56671464",
"text": "removeDuplicatesHash() {\n let currentNode = this.head;\n let uniqueEls = {};\n let prev;\n\n while (currentNode) {\n if (uniqueEls[currentNode.value]) {\n // I need to set this element to look at it's... |
5304ea79c6bd07b47ca53e66e6d47211 | Function to return completed matches, i.e. only matches that reached FullTime | [
{
"docid": "3f5b8a6b316bfddffa36df698f27af84",
"score": "0.60400975",
"text": "function isFullTime(match) {\n return match.MatchInfo.Period === 'FullTime';\n }",
"title": ""
}
] | [
{
"docid": "0144ca03645e1b68a0d6e9dc540bcee7",
"score": "0.61511713",
"text": "function getCurrentMatches(callback){\n\tvar currentMatchesData={\n\t\tapikey:\"qMdsykxRTkft5pvwqdaqOI8D6Sm2\"\n\t};\n\trequest({\n\t\turi:'http://cricapi.com/api/matchCalendar',\n\t\tmethod:'POST',\n\t\tjson:currentMatchesDa... |
d829ae93b8798714284a56331e896b82 | Shares an object based on the supplied options | [
{
"docid": "1a9eb9c35f2c16074cb47966093ed5f7",
"score": "0.684982",
"text": "function shareObject(o, options, bypass = false) {\n return Object(tslib__WEBPACK_IMPORTED_MODULE_0__[\"__awaiter\"])(this, void 0, void 0, function* () {\n if (bypass) {\n // if the bypass flag is set send... | [
{
"docid": "fc50ee063b9bf57e67a4dade23294736",
"score": "0.59715945",
"text": "async sharedWithMe(options = null) {\n const q = DriveItems(this, \"sharedWithMe\");\n if ((options === null || options === void 0 ? void 0 : options.allowExternal) != null) {\n q.query.set(\"allowext... |
3dc8a6eb68d0039de67a00c7de8c4c49 | Matrix > Vector > Vector | [
{
"docid": "67392d2d52df0892f99d3d6a13b190f1",
"score": "0.6657332",
"text": "function vectorTransform(m, v) {\n var w = m.map(function(e) {\n return innerProduct(e, v).reduce((t, v) => t + v)\n }) ; return w\n}",
"title": ""
}
] | [
{
"docid": "2b8e3a8d111f1cdd9c4664a3421864dc",
"score": "0.7044515",
"text": "function multVecByMat(vector, matrix)\n{\n\t var newVector = new Vector(0,0,0);\n\t \n var a = vector.x * matrix[0][0];\n var b = vector.y * matrix[0][1];\n var c = vector.z * matrix[0][2];\n newVector.x = a+b+c;\n... |
c09c19e8b3ad08f731073e05e848994d | Gets the user's default company. | [
{
"docid": "dcb605ae6864ad0915938b71f92fbcb1",
"score": "0.5530931",
"text": "getUserDefaultCompany(companyId, token) {\n const data = {\n Authorization: token\n };\n axios\n .get(`${VUE_APP_BASE_API_URL}/companies?q=(id:${companyId})`, {\n headers: data\n })\n .then(... | [
{
"docid": "7755be4d7a2870409d23444657bd5cf8",
"score": "0.65907705",
"text": "getCompany() {\n \tfor(let comp of allCompanies){\n \t\tif(comp.name == this.companyName){\n \t\t\treturn comp\n \t\t}\n \t}\n \treturn -1\n }",
"title": ""
},
{
"docid": "d31ebf3637c4b56a7f06505f9bd3f394",... |
de8b2b784aacf491e1e562031c835485 | event detail > upcoming event tab | [
{
"docid": "663df67d82dc2342938bc16457e14b2d",
"score": "0.56007874",
"text": "function event_upcoming() {\n $http.get('/upcomingResult', {\n params: {\n venue: $scope.detail_result.event.venue.value\n }}).\n then(function(response) {\n ... | [
{
"docid": "4fbb2a3660ead40318ca265f7d19379d",
"score": "0.6465918",
"text": "function displayEventDetails(e){\n let scheduleTab = document.getElementById(\"schedule\");\n scheduleTab.style.display=\"none\";\n scheduleTab.className.replace(\" active\", \"\");\n\n //make event details tab act... |
412b99e2f13d67faa7f1feaf6a53bbda | destroy this shader objects resources (program, attributes, uniforms) | [
{
"docid": "3e50f0bef1ccb25218f0202567438d60",
"score": "0.86804366",
"text": "destroy() {\n this.uniforms = null;\n this.attributes = null;\n\n this.gl.deleteProgram(this.program);\n\n this.vertex = null;\n this.fragment = null;\n }",
"title": ""
}
] | [
{
"docid": "d3ffada20ae7c99b11b09d02a7d0429f",
"score": "0.82215697",
"text": "destroy()\n {\n this.shaderCache = [];\n this.emptyPool();\n }",
"title": ""
},
{
"docid": "d94b322d906e0708a068fcf14e62f13e",
"score": "0.8011686",
"text": "destroy()\n {\n t... |
abe972f2ab04f8bf425463a9bc349671 | import postForm from './components/postForm'; | [
{
"docid": "c0ea7879c3a3a5e3d552bbc981f6e637",
"score": "0.0",
"text": "function App() {\n const [loginStatus,setLoginStatus]=useState(false)\n\n const loginStat=()=>{\n setLoginStatus(true)\n }\n \n return(\n <Router>\n <Switch>\n <Route \n ... | [
{
"docid": "1c4142d08bd7c3f25144631f887208b1",
"score": "0.6193693",
"text": "function App() {\n return (\n <Form />\n );\n}",
"title": ""
},
{
"docid": "5ebde33c09aeb4eb448e39b879ea62dc",
"score": "0.61428165",
"text": "render() {\n return (\n //provider holds store and... |
ddcb0cd40fb3ff0bf6e253759e52acb9 | Sends a flag click to server | [
{
"docid": "b34d1572efb4ecb803503fc98da3fe44",
"score": "0.6460138",
"text": "function sendFlag(i, j) {\n socket.emit('flag', { i, j });\n}",
"title": ""
}
] | [
{
"docid": "6cb91b662939d7ddb5faf89541e4f7f6",
"score": "0.65079015",
"text": "function flagClick(event) {\n // Prevent the default browser click handler\n event.preventDefault();\n\n // 'this' won't point to the element when it's inside the ajax closures,\n // so we reference it using a var... |
2bfd946f8397d3be80b0d16fa7ea9ee8 | Extract the x and y movement out of the targets webkittransform property | [
{
"docid": "ffef719190fd0186d98a57814b0e3909",
"score": "0.7005815",
"text": "function extractTransformTranslation( target ) {\n var textual = target.css( '-webkit-transform' ),\n re = /^translate3d\\((-?[0-9.]+)[^0-9-]+(-?[0-9.]+).+$/,\n matches = re.exec( textual ); \n\n ... | [
{
"docid": "ca15684c18e01edaa292ddc6cb9406a5",
"score": "0.640155",
"text": "function getElementCoordinates($element) {\n var style = window.getComputedStyle($element.get(0)); // Need the DOM object\n var matrix = new WebKitCSSMatrix(style.WebkitTransform);\n return {xPos: matrix.m... |
798991f4a0e5d7517fcae294b2db5caf | Calculates box size and creates divs accordingly | [
{
"docid": "8b2e683a9b06fefab03f2acd300192a5",
"score": "0.0",
"text": "function displayGrid(columns) {\n var grid = $(\".grid\").html(\"\");\n var boxSize = grid.width() / columns - 2;\n for (var i = 0; i < columns; i++) {\n for (var j = 0; j < columns; j++) {\n grid.append($... | [
{
"docid": "2184837ce3cf5794e9be9e49361a85db",
"score": "0.7083457",
"text": "function createDivBox(sizes) {\n var divBox = new HtmlElement({tagName:\"div\",className:\"box\",AttributeName:\"data-after\"})\n .createHtml(sizes);\n return divBox.htmlElement;\n }",
"title": ""
},
{
"... |
7caf4c988bae90aff959582f10ce4ce5 | Return a list of Trial objects. A large part of the work of defining the experiment takes place here, although the key properties are actually defined in the Governor definition. The trials defined here are the master list used by the Governor to decide which stimuli to serve, which advisor or choice to offer, etc. Thi... | [
{
"docid": "c09f37ea4331be0511ed0f71730d7ee4",
"score": "0.65652674",
"text": "getTrials() {\n\t \tlet trials = [];\n let id = 0;\n let realId = 0;\n let blockCount = this.blockStructure.length * this.blockCount;\n let practiceBlockCount = this.practiceBlockStructure.length; ... | [
{
"docid": "47a49a7b9e70f94c064517530513dd95",
"score": "0.6071815",
"text": "function initTrial() {\r\n\r\n\t// Get Trials\r\n\tvar data = getData(preExptTrialFile);\r\n\r\n\tvar records = data.split(\"\\n\");\r\n\tnumTrials = records.length - 1;\r\n\tfor (var i = 1; i <= numTrials; i++) {\r\n\t\tvar c... |
9c9dd3dfab388f186f590c9aea540414 | holds all rows of data | [
{
"docid": "06eddd5809b5dda73e8291b22c7f50e5",
"score": "0.0",
"text": "async function setHeader(){\n console.log('config file')\n const header = []\n header.push('bid')\n header.push('ask')\n output.push(header.join())\n fs.writeFileSync(filename, output.join(os.EOL));\n}",
"title... | [
{
"docid": "e4ecbb17495516263d58c5a27a293397",
"score": "0.69443625",
"text": "getData() {\n return this.rows;\n }",
"title": ""
},
{
"docid": "6dff6839976568a860561d08d2a36d39",
"score": "0.69259226",
"text": "function addtoArray() {\n //console.info(\"getRowC... |
c0de08339873cd2cabea5bd7692bb822 | public class Block extends Statement constructor | [
{
"docid": "d43b766e523e43d43b632eb5c120fd47",
"score": "0.9157575",
"text": "function Block(){ // default constructor\n // default constructor: call super.constructor\n Statement.prototype.constructor.apply(this,arguments)\n //properties\n //body:array of Statement // [AS... | [
{
"docid": "9a520a1dcb5802b2f5c30d9459a39785",
"score": "0.9183074",
"text": "function BlockStatement(){ // default constructor\n // default constructor: call super.constructor\n Block.prototype.constructor.apply(this,arguments)\n }",
"title": ""
},
{
"docid": "b84c0d472a17b816f... |
1c58a2438aaf7de885f1429d309d3002 | makePlotFramework: Create the plot container and axes | [
{
"docid": "bdbf582d449ded24f0ca47c6d45aeded",
"score": "0.75246304",
"text": "function makePlotFramework(gd) {\n var gd3 = d3.select(gd);\n var fullLayout = gd._fullLayout;\n\n // Plot container\n fullLayout._container = gd3.selectAll('.plot-container').data([0]);\n fullLayout._container... | [
{
"docid": "a5766c42681ac992cd0418ebae787a6b",
"score": "0.7294494",
"text": "function makePlotFramework(gd) {\n var gd3 = d3.select(gd);\n var fullLayout = gd._fullLayout;\n\n // Plot container\n fullLayout._container = gd3.selectAll('.plot-co... |
8707fb0a26b090050ee70d890a5987f9 | (protected) r = this + a | [
{
"docid": "04402f37b9c2266437787911a1845e95",
"score": "0.6520421",
"text": "function bnpAddTo(a,r) {\n\t var i = 0, c = 0, m = Math.min(a.t,this.t);\n\t while(i < m) {\n\t c += this[i]+a[i];\n\t r[i++] = c&this.DM;\n\t c >>= this.DB;\n\t }\n\t if(a.t < this.t) ... | [
{
"docid": "7a828f4cd93bbd46ddfb4ed4dbe11228",
"score": "0.6961447",
"text": "function A(){r.apply(this)}",
"title": ""
},
{
"docid": "1eef6495f1caf9beeb1b809ec3da8682",
"score": "0.68854123",
"text": "add(c) {\n let r = this.r + c.r;\n let i = this.i + c.i;\n th... |
b634d0adb4f9b2a41844df13b099a792 | 7 / We first get an array of arguments except the firstone, because the firstone is the function and we don't need that one, and in this case we're assuming that we're on ES5 so we're not doing the awful "Array.prototype.slice.apply", and then "curry" returns a function and that function will apply the "arguments" to t... | [
{
"docid": "06254c6907fbd175220b822645d397a6",
"score": "0.0",
"text": "function make_promise() {\n\tvar status = 'unresolved',\n\t\toutcome,\n\t\twaiting = [],\n\t\tdreading = [];\n\t\t\n\tfunction vouch(deed, func) {\n\t\tswitch (status) {\n\t\t\tcase 'unresolved':\n\t\t\t\t(deed === 'fulfilled' ? wai... | [
{
"docid": "ea54ab2b63fd694bfc11c37ea2108bc4",
"score": "0.684296",
"text": "function curry(fn){\n return function(){\n if(fn.length > arguments.length){\n var slice = Array.prototype.slice;\n var args = slice.apply(arguments);\n return function(){\n return fn.apply(\n ... |
86d898e17a92bca1479be195403a484f | Draws an item on the canvas | [
{
"docid": "b984244bf9cf2775e3f915d5266e0a85",
"score": "0.0",
"text": "function drawCanvas(data, x, y){\n let newCanvas = document.getElementById(\"newCanvas\");\n let ctx = newCanvas.getContext(\"2d\");\n let img = new Image();\n //Base 64 data from call to proxy server\n img.src=data;\n img.onl... | [
{
"docid": "fabab0134feadbfa00ea851f4d31f580",
"score": "0.8015483",
"text": "drawItem() {\n ctx.fillStyle = \"red\";\n ctx.fillRect(this.xPos, this.yPos, this.size, this.extension);\n }",
"title": ""
},
{
"docid": "7593b778efc346877e01cceb024ba098",
"score": "0.74550843... |
e6ddc89ccbcf161af880b4511519cff7 | Zoom in on the sector defined by the brush | [
{
"docid": "f089547a18ac0c1bf218549c584d2cc5",
"score": "0.59185183",
"text": "function zoom() {\n let t = svg.transition().duration(750);\n\n // Update axes, circles, and lines\n svg.select(\".axis--x\")\n .transition(t)\n .call(xAxis);\n g.select(\".ax... | [
{
"docid": "c5786e5b508cef896918618581dc8e0d",
"score": "0.651965",
"text": "function zoomIn() {\n\t//decreases the value of the slider and saves the value\n\tif (slider.immediateValue > minScale) { //if slider isnt at the lowest point\n\t\tslider.decrement();\n\t\tcurrentScale = slider.immediateValue;\... |
39490a79195bc29e80948c2b5cfa8dd2 | TODO: REMOVE, NOW GOT OWN URL | [
{
"docid": "fc4adfff6054e168c4bee83b3a3496c2",
"score": "0.0",
"text": "function toggleInfo() {\n\t\t\tvm.info = !vm.info;\n\t\t}",
"title": ""
}
] | [
{
"docid": "8c13e189a82b45213c499487f13f750c",
"score": "0.66145855",
"text": "url() {\n throw new Error('Not implemented');\n }",
"title": ""
},
{
"docid": "a4a72405a35ca12b211ec9786197d992",
"score": "0.6252065",
"text": "function URLUtils() {}",
"title": ""
},
{
... |
06c7e98d4804c657be8465ae3d4486cf | Functions to manage the message information | [
{
"docid": "b7d26c8f4bbbcf47f8e795dc6ac7ae7f",
"score": "0.6110371",
"text": "function createDataMessage(message) {\n // Return the Data from message to make the template\n const img_src = createFileLogo();\n let user = getData('user');\n\n return {'text': message.types === 'text',\n ... | [
{
"docid": "70020c6a32c5d1a7a9905b490bfb15af",
"score": "0.70404255",
"text": "handleMessage(message) {\n\n this.Name=message.Name;\n this.Description=message.Description;\n this.CourseImage=message.CourseImage;\n this.Level=message.Level;\n this.Position=message.Posit... |
f1924d9293a0423db05e59c0cd9c63a6 | Update the viewport's total content size. | [
{
"docid": "13e0e370e7d6d76a9c71f90062f9afee",
"score": "0.8635498",
"text": "_updateTotalContentSize() {\n if (!this._viewport) {\n return;\n }\n this._viewport.setTotalContentSize(this._viewport.getDataLength() * this._itemSize);\n }",
"title": ""
}
] | [
{
"docid": "8007d29a0be99c9ea729b133a589c578",
"score": "0.87372094",
"text": "_updateTotalContentSize() {\n if (!this._viewport) {\n return;\n }\n\n this._viewport.setTotalContentSize(this._viewport.getDataLength() * this._itemSize);\n }",
"title": ""
},
{
"docid": "bf32a1ccf... |
d3e665e7933e7201fb3676666d90f7cc | Function constructor() : Create Terminal | [
{
"docid": "55bcab55d9b67a4ff7ffc40493933962",
"score": "0.6266489",
"text": "constructor() {\n\t\tif ( Terminal.instance == null ) {\n\n\t\t\t/**\n\t\t\t * @type {import('@appsflow/core/src/modules/logger').Logger}\n\t\t\t */\n\t\t\tthis.logger = new ($flow.modules().Logger)( Terminal.getName(), true )... | [
{
"docid": "ea52ec07958a49b098a3da6a8af08ce4",
"score": "0.69422585",
"text": "function Terminal(options) {\n if (! options) options = {};\n this.width = options.width;\n this.height = options.height;\n this.bell = options.bell;\n this.visualBell = options.visualBell;\n this.scrollback... |
91cacd50c65ee0b72f446365d62dcd03 | End keypressevent functionality / enableRotateButtons( disabledButton ) Enables all buttons of class controllerrotatebtn except the button passed in. Parameters: disabledButton: button to remain disabled. | [
{
"docid": "3621a7b749bec31c26f9e428fcba815a",
"score": "0.805899",
"text": "function enableRotateButtons(disabledButton) {\r\n\t$('.controller-rotate-btn').removeAttr(\"disabled\", \"disabled\");\r\n\r\n\tdisabledButton.attr(\"disabled\", \"disabled\");\r\n}",
"title": ""
}
] | [
{
"docid": "6607c4bb379e7e06fe4f8f1a5bcd66fa",
"score": "0.6386415",
"text": "function disableButton() {\n this.disabled = true;\n}",
"title": ""
},
{
"docid": "56762e1d77e4d4c320eb3e0f75a74bdf",
"score": "0.6324147",
"text": "function disable_buttons_retailer()\n {\n \n ... |
7c44b7c5cfc250bbab594b40318cff95 | Default loader for ajax number fields. | [
{
"docid": "b578cc983c653e07510be9191733a4be",
"score": "0.65648115",
"text": "function loadAjaxNumberFields(parentElement, msgDisplay) {\n parentElement.find('.fieldAjaxnumber').ajaxFormNumber({messageDisplay: msgDisplay});\n}",
"title": ""
}
] | [
{
"docid": "acdd3eb94963dea9e55764a54a1c3268",
"score": "0.5861056",
"text": "function NumericSpinner(onChange, min, max) {\n if (onChange === void 0) { onChange = function (numericSpinner) { }; }\n if (min === void 0) { min = 0; }\n this.onChange = onChange;\n this.min = min... |
7adc7aa0df86cb0be1c977c0fd0f70e9 | to make this work, simply link it to an on click of your desired element to track for the name, the id usually works best | [
{
"docid": "90b57b3fb0d8947d45d82cd171e6afcd",
"score": "0.5923881",
"text": "function addClickToElement(elementName) {\n var readData;\n var thisNum;\n if(clickTrackerFile.exists) {\n clickTrackerFile.open(\"r\");\n readData = JSON.parse(clickTrackerFile.read());\n clickTr... | [
{
"docid": "f4f92900f815d9005e1f5c978613db3b",
"score": "0.67212814",
"text": "renderName (name, id) {\n this.name.innerHTML = name\n this.name.setAttribute('id', id)\n }",
"title": ""
},
{
"docid": "15cdf58384646effc595f59661d354f4",
"score": "0.6525958",
"text": "elmId(name)... |
c42e68828dc938a23081cc4e740798d0 | T U E 100 200 REST PARAMS use 'rest params' as array. SPREAD SYNTAX use nnumber of FIRST PARAMS as array. | [
{
"docid": "70f929b44ddefe63c155661e7a0d35c2",
"score": "0.5099933",
"text": "function spreadAndRestParams(firstChar, secondChar, ...lastArray) {\n console.log(firstChar, secondChar, lastArray);\n}",
"title": ""
}
] | [
{
"docid": "59b8c6915d5edbb975387d15ffb79e29",
"score": "0.69667065",
"text": "function restParams5(...rest) {\n return rest[5]; // CHANGE ME\n}",
"title": ""
},
{
"docid": "57f43cf2df029d3b9b6f5a136c1af03a",
"score": "0.6378944",
"text": "function restParam(param1, param2, ...res... |
46f55b731c17b8e4f933c6ef493c3904 | el formulario de Login | [
{
"docid": "56b43b0e2d71b0851ffbac56925082cf",
"score": "0.63106716",
"text": "function Login(props) {\n const [form, setForm] = useState({ email: '', password: '' });\n const update = (({ target }) => setForm({ ...form, [target.name]: target.value }))\n return (\n <React.Fragment>\n\t <div classN... | [
{
"docid": "9a6dae195be4fddbb6d5f7be89ab2e25",
"score": "0.76384974",
"text": "login() {\n this.provider.login(this.form.value);\n }",
"title": ""
},
{
"docid": "a5791cfe165d4289347251b338d66e56",
"score": "0.71379304",
"text": "login (email, password) {\n this.emai... |
0da06b90d0b702715e43b06239f7fa78 | See API for function description. | [
{
"docid": "11f6138fe5fe1d77392e136d8456f5ff",
"score": "0.0",
"text": "function getCapabilities() {\n var capabilities = [];\n // Get capabilities objects from the container.\n for (var i = 0; i < _capabilitiesContainer.length; ++i) {\n capabilities.push(... | [
{
"docid": "07baaa7b10a2faddf5ad2c1b651b13e9",
"score": "0.6372456",
"text": "function miFuncion(){}",
"title": ""
},
{
"docid": "ac54ce770b0cd27b0ae6243ee1905e7c",
"score": "0.6127683",
"text": "XXX() {\n\t\treturn 0;\n\t}",
"title": ""
},
{
"docid": "4ba42df549fe9202b55... |
8e61ea05f0758a477096e46998078d01 | Function for making the hot spot background visible | [
{
"docid": "eac8c3489c63f91cb289f09e0e1ac9e6",
"score": "0.7828869",
"text": "function makeHotSpotBackgroundsVisible()\r\n\t\t\t{\r\n\t\t\t\t// Alter the CSS (SmoothDivScroll.css) if you want to customize\r\n\t\t\t\t// the look'n'feel of the visible hot spots\r\n\t\t\t\t\r\n\t\t\t\t// The left hot spot\... | [
{
"docid": "3d68a178d28e1a6134e311a4b8520f0a",
"score": "0.6617614",
"text": "function hideHotSpotBackgrounds()\r\n\t\t\t{\r\n\t\t\t\tclearInterval($mom.hideHotSpotBackgroundsInterval);\r\n\t\t\t\t\r\n\t\t\t\t// Fade out the left hot spot\r\n\t\t\t\t$mom.find(options.scrollingHotSpotLeft).fadeTo(\"slow\... |
6d79d236c19dc99f63fdb31a66331f31 | eslintdisable noalert SLICE 1 | [
{
"docid": "2885a7ab67d73d30fda755c3a48918fb",
"score": "0.0",
"text": "function updateCoffeeView(coffeeQty) {\n //grab coffee counter span and store in var\n const coffeeCounter = document.getElementById('coffee_counter');\n //take the passed in coffee quantity and make it the new text of the span\n... | [
{
"docid": "d8b4133fc964556a39720dd0472f1b1c",
"score": "0.65968776",
"text": "function warning(){\n alert(`Please pick the correct answer.`);\n}",
"title": ""
},
{
"docid": "5c86eca3f7e632b95d52cfa3425d15a9",
"score": "0.65915525",
"text": "raiseWarning(e) {\n e.preventDefault()... |
711eb04ea9a4ca50048d0bba6c594455 | For Node v0.10 support. Remove this eventually. | [
{
"docid": "40d9d01aaaa4b330d7a22f1c44271f73",
"score": "0.0",
"text": "function isSlowBuffer (obj) {\n return typeof obj.readFloatLE === 'function' && typeof obj.slice === 'function' && isBuffer(obj.slice(0, 0))\n}",
"title": ""
}
] | [
{
"docid": "82ede7fecff156cb3cfac6b553d6e865",
"score": "0.5760611",
"text": "function NodeModule() {\n}",
"title": ""
},
{
"docid": "60f97f51026b80566d0fec120b1f7bf5",
"score": "0.55544066",
"text": "function NodeFsHandler() {}",
"title": ""
},
{
"docid": "60f97f51026b80... |
8afef9fb9f02efcd69d7ce49055e9dc5 | Get all blank coordinates from board | [
{
"docid": "8d5011f7cf98931c99110239adbb2a30",
"score": "0.84945273",
"text": "getBlankCoordinates(board) {\n const blankCoordinates = [];\n \n for (let r = 0; r < board.length; r++) {\n for (let c = 0; c < board[r].length; c++) {\n if (board[r][c] === 0) {blankCoordinates... | [
{
"docid": "dd942c10a10bbbb9e0b4c48f0330f636",
"score": "0.7752392",
"text": "function getEmptyPlaces(board) {\r\n var emptyPlaces = []\r\n\r\n for (var i = 0; i < board.length; i++) {\r\n for (var j = 0; j < board[i].length; j++) {\r\n var cell = board[i][j]\r\n if (!... |
e709b079a31c6760440e50e5564d9cf9 | Displays the video feed that would normally be visible if the app. The DefaultVideoFeed generally shows feeds based on their volume level. | [
{
"docid": "b8f41eab44b98d4c5090d348c3e3bb06",
"score": "0.7425924",
"text": "function showDefaultFeed() {\n\n // Remove the highlighting.\n if (currentHighlightedParticipantId) {\n google.hangout.av.clearAvatar(currentHighlightedParticipantId);\n }\n\n currentHigh... | [
{
"docid": "6a9929bc2f33b33e2921b14de5c59cbb",
"score": "0.66274816",
"text": "function publicFeed(){\n if(navigator.getUserMedia) { // Standard\n navigator.getUserMedia(videoObj, function(stream) {\n p.video.src = stream;\n p.video.play();\n }, errBack);\n } else if(naviga... |
da6c89b80482a34455d46192934b385f | console.log(buscarPosicion("a")); ///////////// Ejercicio 3 | [
{
"docid": "0d1e6ed61b938e64a1708aba968450a2",
"score": "0.0",
"text": "function obtenerPrecioConIva(precio){\r\n iva = precio * 0.19;\r\n precio = precio + iva;\r\n return precio;\r\n}",
"title": ""
}
] | [
{
"docid": "8899795ba52e51c9470550f66b338bb8",
"score": "0.7208335",
"text": "function pozdravi(a){\n console.log(\"Dobro dosli,\" + \" \" + a)\n}",
"title": ""
},
{
"docid": "0fbbfee4c10c5bb609d9f0a257a77e82",
"score": "0.68732965",
"text": "function valoracion(valor) {\r\n cons... |
400b39f0165819530d447ef742d992bb | Set the slider value. | [
{
"docid": "50ade92e5dcb3e757977153cfb4fa80a",
"score": "0.0",
"text": "function valueSet ( input, fireSetEvent ) {\n\n\t\tvar values = asArray(input);\n\t\tvar isInit = scope_Locations[0] === undefined;\n\n\t\t// Event fires by default\n\t\tfireSetEvent = (fireSetEvent === undefined ? true : !!fireSetE... | [
{
"docid": "11c5f131fedd881fba0d2e07e1bfc537",
"score": "0.7653699",
"text": "setSliderValue(id, value) {\n const slider = this.sliders[id];\n if (value <= slider.min) {\n slider.endAngle = this.startAngle;\n slider.ang_degrees = 0;\n sl... |
603f089628e8b523e8830f4f938f629b | function to delete row on clicking each row. | [
{
"docid": "2a86add8ab22cf50b6f5046e3070e553",
"score": "0.0",
"text": "function remove_row(th) {\n $(\"input[id=\\'\"+th.id+\"\\']\")[0].checked = false;\n $(th).remove();\n addition_of_nutrition();\n}",
"title": ""
}
] | [
{
"docid": "6101a5a59be74a35c8cb2f955b5a8a9d",
"score": "0.80456716",
"text": "function deleteRow(e) {\n var row = e.target.parentElement.parentElement;\n row.parentElement.removeChild(row);\n }",
"title": ""
},
{
"docid": "867e5837d50339c45700b409b847cec4",
"score": "0.790097",
... |
da65f80f1a4d7cbdc952dd1a35bec5bb | inform if userGuess isn't a vowel | [
{
"docid": "c36fd4101389f7cc81264e1c11154bb7",
"score": "0.74465036",
"text": "function notVowel() {\n message.innerHTML = \"'\" + userGuess + \"'\" + \" is not a vowel.<br/>Guess again.\";\n return;\n}",
"title": ""
}
] | [
{
"docid": "04685207a75fe977efe42a54fdcf735f",
"score": "0.71731216",
"text": "function isVowel(c){\n switch (c.toLowerCase()){\n case 'a':\n return true;\n case 'e':\n return true;\n ca... |
3cec76ca6cff8e0731d2f0ddfd348c0b | Updates the position of the bullet each cycle | [
{
"docid": "99d03e96344cffed47d59f45fd6119ce",
"score": "0.0",
"text": "update() { }",
"title": ""
}
] | [
{
"docid": "1d7b5a6743340529fae33d42cc5299cd",
"score": "0.72966367",
"text": "function updateBullet(event)\n{\n var delta = event.delta / 1000;\n \n bullet.x -= delta * bullet_speed * 3;\n \n if(bullet.x + bullet.image.width < 0)\n resetBullet();\n}",
"title": ""
},
{
... |
0bff74b8c2dabe4382660ce3cba03aa7 | For not moving after drag | [
{
"docid": "8bff6c4cbfdc6f554f2d1ae5d1d60c51",
"score": "0.0",
"text": "function dblclick(d) {\n d3.select(this).classed(\"fixed\", d.fixed = false);\n }",
"title": ""
}
] | [
{
"docid": "ce0eefd035078ba7c176d47ceb320704",
"score": "0.7504444",
"text": "function dragMove (e) {\n var clientX = isTouch ? e.touches[0].pageX : e.clientX,\n clientY = isTouch ? e.touches[0].pageY : e.clientY,\n limitsX = self.limits.x,\n limitsY = self.limits... |
619db4928fc7d4424dd32f9e199e7dbd | Definition of the Portfolio class for the GFPortfolio gadget. Each instance of the class is used to store information about one stock. | [
{
"docid": "7614fb4a896d7ff9bff0ab1a08288fd4",
"score": "0.84471726",
"text": "function Portfolio()\n{\n\t// Create an empty array of stocks\n\tthis.stocks = new Array();\n\tthis.addPriceData = addPriceData;\n\tthis.displayPriceData = displayPriceData;\n\tthis.displaySymbols = displaySymbols;\n\tthis.ma... | [
{
"docid": "eb1ee5d98dace17b357601e37e74999b",
"score": "0.6714322",
"text": "function Stock(symbol){\n // this.name = name;\n this.symbol = symbol;\n this.numShares = 0;\n this.data = this.lookupStock();\n this.name = name;\n this.price = price;\n\n}",
"title": ""
},
{
"docid": "6498e... |
317e65450c842cbc416219808b6bac50 | Get/Read e.g. get(" "_design/viewByName/_view/viewByNames"); This is the only func that (optionally) takes two parts of a URL. Inconsistent, but it makes the other files neater. | [
{
"docid": "1ba4cc860f1fe3acd824786290fe9aaf",
"score": "0.5513797",
"text": "function get(url, path) {\n // Will join URL and path if two arguments, or just use a single full URL if only one argument.\n if (path) {\n url += path;\n }\n\n return fetch(url)\n .then(function (res... | [
{
"docid": "26a6f0203cdd58039d6af52f04a81599",
"score": "0.59865975",
"text": "get(uri){\n\n }",
"title": ""
},
{
"docid": "9d7ad6d3ad9b76bb045d3f6aec02f3d5",
"score": "0.59822434",
"text": "get(path) {\n if (path && typeof path === \"string\") {\n const split = Page.splitPa... |
a7aac160b02ad30dcec88e3e1a1b3d65 | Create and return a new ReactElement of the given type. See | [
{
"docid": "f757810746c7780c0e0ed361e5f40335",
"score": "0.0",
"text": "function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\... | [
{
"docid": "ba89f7470e9f759722c6a227e170b58d",
"score": "0.7050864",
"text": "function CreateType (props) {\n const {as, children, ...remainder} = props\n return React.createElement(as || 'span', remainder, children)\n}",
"title": ""
},
{
"docid": "8d9f98312fc7c5eb18bccc8b52e7b155",
"s... |
85e327b2462f0467d086481a85e554f2 | For IE8 and IE9. | [
{
"docid": "b6a82c40de3522753cd3152728ca92aa",
"score": "0.0",
"text": "function getTargetIDForInputEventIE(topLevelType, topLevelTarget, topLevelTargetID) {\n\t if (topLevelType === topLevelTypes.topSelectionChange || topLevelType === topLevelTypes.topKeyUp || topLevelType === topLevelTypes.topKeyDown... | [
{
"docid": "152ae9bc1417f8a0e5996a8772fc212a",
"score": "0.729394",
"text": "function isIE9or8(){\n\t\tvar version = getInternetExplorerVersion();\n\t\treturn(version != -1 && version <= 9 && version >= 7);\n\t\t\n\t\t//return ($.browser.msie && $.browser.version <= 9 && window.XDomainRequest);\n\t}",
... |
197d7f16daaffd456012310f5598f214 | Creates a new Node with `attributes`, resolving with the new record | [
{
"docid": "b09e88ffa5f1fa8ead95edd57b2b1176",
"score": "0.6254221",
"text": "create(attributes) {\n return new Promise((resolve, reject) => {\n // Add the new record to the IDB store, then resolve with the newly\n // allocated localId on the record\n this.objectStore.put(attributes)\n... | [
{
"docid": "795d0183456139f8cfda0754c39c5c94",
"score": "0.59545773",
"text": "function newTag() //E Create a new node\n {const parameters = Array.from(arguments);\n const tag = parameters.shift(); ... |
decb3823ea9d53ab355b97675829d143 | 1. Draw the image data onto offscreen buffer 2. Draw buffer to canvas at zoom level | [
{
"docid": "db73486f235926182a6e4c747760f0c4",
"score": "0.6300846",
"text": "function updateBuffer() {\n\toffscreen.width = canvasWidth;\n\toffscreen.height = canvasHeight;\n\n\tvar imgdata = offscreenCtx.getImageData(0, 0, canvasWidth, canvasHeight);\n\tvar color;\n\tvar pixel;\n\tvar index;\n\tvar da... | [
{
"docid": "2630d8bc28c8735c9ed296f6a319091e",
"score": "0.66202974",
"text": "function render() {//used in run():271\n requestAnimationFrame(render);\n\n lHis && lHis.style(\"display\", setting.showHistogram ? null : \"none\");\n lLeg && lLeg.style(\"display\", setting.showCountExt... |
8b02d6e077f551b63dc4bc64973e7e13 | Deal with Mobile Click | [
{
"docid": "fbcc7736882403b5d127f335c0802219",
"score": "0.0",
"text": "function openMenu(){\n let menu = document.querySelector('.dropdown-content');\n if(menu.style.display === 'block')\n {\n menu.style.display = 'none';\n } else {\n menu.style.display = 'block';\n }\n}",
... | [
{
"docid": "601b36ab5035fb431fa9cd9e7eb32c86",
"score": "0.682185",
"text": "function mmm_mobile_double_tap_to_go () {\r\n\t\t\tfunction_selector = '#mega_main_menu li:has(.mega_dropdown) > .item_link, #mega_main_menu li:has(.post_details) > .processed_image';\r\n\t\t\tjQuery( function_selector ).unbind... |
35d89ee3ac1e30c58af916935248994e | generate new questions and reset instance variables | [
{
"docid": "48d178d010aa7ecf90b5f65262dec541",
"score": "0.6474137",
"text": "reset() {\n this.generateQuestions();\n this.timer = new Timer(10, this.timesUp(this));\n this.round = 0;\n this.score = 0;\n this.multiplier = 1;\n this.currentQuestion = this.questio... | [
{
"docid": "6e0608ad32e552f242d97ac25d68cb39",
"score": "0.7902963",
"text": "generateQuestions() {\n const questions = []\n const randoms = this.randomQuestions();\n for (let i = 0; i < randoms.length; i++) {\n const question = new Question(randoms[i]);\n ques... |
1bd114b8b72f3c32ad22ac07270ccd69 | 'this' will refer to tdInstance here. | [
{
"docid": "974f97f6a39a72aa861ebfafb3175a67",
"score": "0.0",
"text": "function onPlaylistPreloaded(e) {\n this.getTracks(function(tracks) {\n var nowPlaying = this.getTrack();\n\n log(tracks);\n\n // If parameters.single is not ex... | [
{
"docid": "939791025edbd806410f7d0a6de0c114",
"score": "0.58534116",
"text": "setTR(t, r) {\nthis._t = t;\nthis._r = r;\nreturn this;\n}",
"title": ""
},
{
"docid": "f8d4419b49780f7014f96fc9a0f2bd6b",
"score": "0.56894654",
"text": "setT(t) {\nthis._t = t;\nreturn this;\n}",
"ti... |
44eed7e81a733925352630a4047892cb | create the grid class | [
{
"docid": "b6638c4c05344c9ed2dc062016227888",
"score": "0.0",
"text": "function grid(options) {\n //declare members\n this.behavior = \"tabular\";\n this.container = \"\";\n this.columns = [];\n this.data = null;\n this.width = \"auto\";\n this.height = ... | [
{
"docid": "52056d0689414f518fcf33688752104b",
"score": "0.7925451",
"text": "function createGrid(){\n for (var j = 0; j < rows; j++) {\n for (var i = 0; i < cols; i++) {\n var cell = new Cell(i, j, w);\n cell = makeCellProperty(cell, j, i);\n ... |
cd40fba3b398a94f9d8cd86d381a995e | A lot faster than stringify/parse | [
{
"docid": "41541930bdf25afb14c392749adb7c07",
"score": "0.0",
"text": "function cloneBounds(bounds /*: Bounds*/) /*: Bounds*/ {\n return {\n left: bounds.left,\n top: bounds.top,\n right: bounds.right,\n bottom: bounds.bottom\n };\n}",
"title": ""
}
] | [
{
"docid": "a377fdb4ac27e03b22388b7c4db145c6",
"score": "0.61210936",
"text": "function stringify() {\n return parser.stringify();\n }",
"title": ""
},
{
"docid": "6dab958f55359b8b37c49dde68fd5c58",
"score": "0.5834731",
"text": "serialize() {}",
"title": ""
},
{
... |
c87d94629de56989a7c39ae00829b47c | The individual responsible for making the annotation. | [
{
"docid": "d91fa62431420ca8b177433d3e98a2f2",
"score": "0.0",
"text": "get authorReference () {\r\n\t\treturn this._authorReference;\r\n\t}",
"title": ""
}
] | [
{
"docid": "94373dcf82a3cd1e2265778b0ab87d07",
"score": "0.612936",
"text": "get individual() {\n\t\treturn this.__individual;\n\t}",
"title": ""
},
{
"docid": "fe54ec14db14fbf1803d31950d9eb52c",
"score": "0.59623784",
"text": "function Annotation() {\n this.guid_ = tr.b.GUID.allo... |
720b63c3b931b6dc2b076ce4a16a40f2 | _[static]_ Determine if a given layer group contains base layers | [
{
"docid": "8c55b8f00c55b5d8282cd9199f6d66f0",
"score": "0.82641727",
"text": "static isBaseGroup(grp) {\n if (grp instanceof LayerGroup) {\n const lyrs = grp.getLayers().getArray();\n return lyrs.length && lyrs[0].get('type') === 'base';\n }\n else {\n ... | [
{
"docid": "a668d1a3a92a83b0bc4c3051dc769456",
"score": "0.6448219",
"text": "static ensureTopVisibleBaseLayerShown(map, groupSelectStyle) {\n let lastVisibleBaseLyr;\n LayerSwitcher.forEachRecursive(map, function (lyr, _idx, _arr) {\n if (lyr.get('type') === 'base' && lyr.getVi... |
fd0c67607d6c812e726cedbe2f21dc2f | 12.14 The try statement | [
{
"docid": "99f65120aaed9c240ef9328e5d120b74",
"score": "0.0",
"text": "function parseCatchClause() {\n var param;\n\n expectKeyword('catch');\n\n expect('(');\n if (!match(')')) {\n param = parseExpression();\n // 12.14.1\n ... | [
{
"docid": "45bc8c5537a1add033f26edd26a30e10",
"score": "0.7532619",
"text": "function TryStatement() {\n}",
"title": ""
},
{
"docid": "524c3505676eb6dd7c51e2b094e45785",
"score": "0.7301539",
"text": "function attempt () {\n\t\t\t\t\t\t\ttry {\n\n\t\t\t\t\t\t\t} catch (f) {\n\n\t\t\... |
36c6772bab287aaa63d16de68d72ffcb | Frontend sends a request to play all songs in the queue database table | [
{
"docid": "6ccf4a8c0d738eb4e72badd7156a0d83",
"score": "0.0",
"text": "playQue(e) {\n fetch(`${window.MyAppGlobals.serverURL}playQue`).then(res => res.json())\n .then(res => { \n this.result = Object.values(res); \n console.log(\"resultatet var: \" + this.result[0]... | [
{
"docid": "33015abca3bd17896615732c60959f80",
"score": "0.68767816",
"text": "async function playlist() { \n const response = await fetch('http://localhost:3001/playlist')\n if (response.ok){\n registerMetric('play-clicked', 1)\n var i=0\n const jsonResponse = await response.json()\n ... |
9d4216745a92021afb93dbc904b94b42 | is the current page a duckduckgo.com page? switch to the google url | [
{
"docid": "f2290c7b60dccea7fe3b87fee9f6c9cc",
"score": "0.7803325",
"text": "function switchURL() {\n\tif (isDCK) {\n\t\tvar searchTerm;\n\t\tvar splitted = currentURL.split(/(\\?|\\&)/);\n\n\t\tfor (var i = 0; i < splitted.length; i++) {\t\n\t\t\tif (splitted[i].match(/^q=.*$/)) {\n \t\t\t\tsearchTer... | [
{
"docid": "8b6ef607a5a36d73237da882b6d0cc97",
"score": "0.6438335",
"text": "function _gotoFirstPage() {\n window.location.href = \"/visitor_page\";\n\n return false\n}",
"title": ""
},
{
"docid": "43c67de9222b5883eb8d21f85f70db24",
"score": "0.63341933",
"text": "function whi... |
e89915e8aa22d99f21ff514852199218 | helper function to create a unit with a fixed prefix | [
{
"docid": "b35043967721cca4fedcbd7ac4c0732f",
"score": "0.71195364",
"text": "function fixedUnit(str) {\n var unit = type.Unit.parse(str);\n unit.fixPrefix = true;\n return unit;\n }",
"title": ""
}
] | [
{
"docid": "b6f119e67f2be1106ee3c2f436f3bcfb",
"score": "0.71431434",
"text": "function fixedUnit(str) {\n var unit = type.Unit.parse(str);\n unit.fixPrefix = true;\n return unit;\n } // Source: https://en.wikipedia.org/wiki/Physical_constant",
"title": ""
},
{
"docid": "4fc677d72c... |
e5805592cacb12f452da3105cbceb169 | 9 Dash between Even Numbers Write a JavaScript program which accepts a number as input and inserts dashes () between two consecutive even numbers. Test: dash_in_even(012345684); Output: "01245684" | [
{
"docid": "d2689236fdc550b0d354a69890493384",
"score": "0.8415265",
"text": "function dash_in_even(number) {\n var x=number.toString();\n var y=x[0];\n for(var i=1;i<x.length;i++)\n {\n if((parseInt(x[i-1])%2==0) && (parseInt(x[i])%2==0) )\n {\n y=y+\"-\... | [
{
"docid": "2b79a9448d3043857409bb892646d528",
"score": "0.81194633",
"text": "function dashes_between_even(number) {\n\n const number_string = number.toString();\n\n let result = number_string[0];\n\n const length = number_string.length;\n\n for (let i = 1; i < length; i++) {\n // if... |
e2b3b020f10ed3c7c9cbe9c3e5b32c72 | common function used for validation | [
{
"docid": "027f7bc4f80cebc808d2cc79e7b51aa7",
"score": "0.0",
"text": "function validateCourse(course){\n const schema = {\n name: Joi.string().min(3).required()\n };\n return Joi.validate(course, schema);\n}",
"title": ""
}
] | [
{
"docid": "c0a7655d0d51c9ae8ba639759bd33757",
"score": "0.7258242",
"text": "validate() {\n\n }",
"title": ""
},
{
"docid": "12d273ab92672cff7df1171f15f8ac3d",
"score": "0.7239957",
"text": "validate(_value, _utils) {\n return false;\n }",
"title": ""
},
{
"docid": ... |
7e710619df243d78015af0988cc66468 | cloned and reversed json_data: most recent data first; use with timeline | [
{
"docid": "d85ff580e1ec8de36be8713012ac6eea",
"score": "0.0",
"text": "function getTimelineSearch(){\r\n\t$('#timeline-search').keyup(function () {\r\n\t\tvar output, inQuotes;\r\n\t\tvar searchField = $(this).val();\r\n\t\tif (searchField === '') {\r\n\t\t\t$('#timeline').html('');\r\n\t\t\treturn;\r\... | [
{
"docid": "a55b3401d992ed51b96a346abcc16a49",
"score": "0.60497373",
"text": "function timelineData() {\n var array = [];\n var date = results[0] ? new Date(results[0].values[0].timestamp): new Date();\n for (var i = 0; i < 7; i++) {\n array.push({value:date, tooltip:{show... |
4ab5bbb65e12683265797fe4f9c1b7a0 | Handler for dragging no longer over an element. | [
{
"docid": "88e018ce6dd4a8728f293e6d44550b5c",
"score": "0.62451595",
"text": "function handleDragLeave() {\n this.classList.remove('over');\n }",
"title": ""
}
] | [
{
"docid": "9f6cade4ec8489708c8d2880a4511b37",
"score": "0.70727825",
"text": "function stopDragover() {\n placeholder.remove();\n element.removeClass(\"dndDragover\");\n return true;\n }",
"title": ""
},
{
"docid": "5a8... |
8cc80fec48cedb5927ea979ec2cd8927 | Return time in hours for how long one can rent an offer for the given sum | [
{
"docid": "ff65356f7ff09b96ce4597bfa1fbdd59",
"score": "0.71285266",
"text": "function getHours4Quote(offer, sum) {\n\n if (offer.setup != \"\" ) {\n // Subtract setup cost\n sum = sum - offer.setup;\n }\n console.log(\"hours4quote \"+offer.shortname+\" sum=\"+sum);\n if (sum ... | [
{
"docid": "9b37ced5e8fd2a23e3bdba7a4db617c6",
"score": "0.6523558",
"text": "function getQuote4Hours(offer, h) {\n var cost = 0;\n if (offer.setup != \"\" ) {\n cost += offer.setup;\n }\n if (\"continuous\" in offer && offer.continuous != \"\" ) {\n\n if (offer.continuous == 1... |
945e982445722fb5be026421c828b313 | active state for visible element on the viewport | [
{
"docid": "47cb8f62a3a19da8828e9ebc7e152733",
"score": "0.0",
"text": "function scrollNav() {\n $(\"nav a\").click(function(e) {\n e.preventDefault();\n $('html,body').animate({\n scrollTop: ($(this.hash).offset().top - 100)\n }, 600);\n\n });\n\n var aChildren ... | [
{
"docid": "753fd2aadc13a906756ac678a4a12330",
"score": "0.7436931",
"text": "function activeView(element) {\n const postion = element.getBoundingClientRect();\n return (\n // the first two values to insure that every section is on the top of the screen or down a bit.\n postion.top >= 0 &&\n ... |
3f60cf2e59a963e38b7ed84a35f35a3d | Get Game List using Steam API | [
{
"docid": "1971d5c6f15cf983e64d80a56f529f48",
"score": "0.64932305",
"text": "getGames(steamid){\n\t//set steamID to user's entered id\n\tthis.steamID = steamid;\n\tlet sortedObj;\n\tlet playerName;\n\t//run get request via http library, and return sorted object\n\treturn http.get(`https://cors-anywher... | [
{
"docid": "4dcc33453988784deb2c1831a624db70",
"score": "0.7437258",
"text": "function fetchGameList(){\n\tfetch(\"https://rawg-video-games-database.p.rapidapi.com/games?page=1\", {\n\t\"method\": \"GET\",\n\t\"headers\": {\n\t\t\"x-rapidapi-host\": \"rawg-video-games-database.p.rapidapi.com\",\n\t\t\"x... |
a1dc34970fec7ab79a35de215a33066d | This function will redirect you to a page where you can edit this person's profile page. | [
{
"docid": "d3f9d0150e96509c6b74a72095074dc2",
"score": "0.0",
"text": "function handleEdit(e) {\n e.preventDefault();\n setEdited(true);\n \n }",
"title": ""
}
] | [
{
"docid": "611e91bb3036b274e8968d9efe39942c",
"score": "0.80398744",
"text": "function goEditProfile() {\n var dirPath = dirname(location.href);\n var fullPath = dirPath + \"/editprofile.html\";\n window.location = fullPath;\n}",
"title": ""
},
{
"docid": "b437445df49582a8c23cfc41c... |
6b1dce8cde8b24e069020263745fbf26 | Is stdout a TTY? Colored output is enabled when `true`. | [
{
"docid": "637a3c942a626401fe3c5bc99f726b4e",
"score": "0.69316745",
"text": "function useColors() {\n var debugColors = (process.env.DEBUG_COLORS || '').trim().toLowerCase();\n if (0 === debugColors.length) {\n return tty.isatty(fd);\n } else {\n return '0' !== debugColors\n && 'no' !=... | [
{
"docid": "0e40e3456ca6a316c8fcd7d0d38c545f",
"score": "0.7625948",
"text": "function stdoutOK() {\n\treturn process.stdout._type === 'tty' || typeof config !== 'object' || config?.console?.output;\n} // stdoutOK()",
"title": ""
},
{
"docid": "4985d83c67c8e9785aefbe56b8f83dfa",
"score":... |
a40766ae734abb32e6155521f076e305 | Close modal window and bg | [
{
"docid": "af8546168a97cb0a51a50d3ec523674b",
"score": "0.6966335",
"text": "function closeModal(){\r\n\t\t$modal.fadeOut(200, function(){\r\n\t\t\t$(\".jqx-validator-error-label\").html(\"\");\r\n\t\t\t$(\"#joinUserId, #joinpassword, #passwordChk, #joinemail, #VerificationCode\").val(\"\");\r\n\t\t});... | [
{
"docid": "a99f87148fb915298b5ac756c0833f4c",
"score": "0.7837651",
"text": "function closeModal() {\n modalbg.style.display = \"none\";\n}",
"title": ""
},
{
"docid": "66e83cf7ef711a18672ca45668a10231",
"score": "0.7817357",
"text": "function close_modal(){\n $('#modal_background... |
464e0930f3c307bdabe192ade0db326e | creating child divs inside a div to make snow particles | [
{
"docid": "442f4abc7f8f84e0e88b82dbdd5374aa",
"score": "0.74549365",
"text": "function createSnowChildDivs(element,snowDotArray){\n let snowDot;\n for(i=0;i<100;i++){\n snowDot = document.createElement(\"div\");\n element.appendChild(snowDot);\n snowDot.setAttribute(\"class\"... | [
{
"docid": "bae08515a8304528da296cc4ec8bea1a",
"score": "0.7164519",
"text": "function initSnow() {\n\n var container = document.createElement('div');\n\n container.style.position = 'absolute';\n container.style.top = '0';\n container.style.left = '0';\n\n document.body.appendChild(contai... |
a1278ab0785c9c8aa90a1ad36e1f52a1 | =========================================================================== Compress as much as possible from the input stream, return the current block state. This function does not perform lazy evaluation of matches and inserts new strings in the dictionary only for unmatched strings or for short matches. It is used ... | [
{
"docid": "a25e77007fcfed846c6e48e83551cc9a",
"score": "0.0",
"text": "function deflate_fast(s, flush) {\n var hash_head; /* head of the hash chain */\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, exce... | [
{
"docid": "f7270f04a4e803be9ef4735a42ab0d3f",
"score": "0.6782075",
"text": "function zip_deflate_fast() {\n while (zip_lookahead != 0 && zip_qhead == null) {\n var flush; // set if current block must be flushed\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, a... |
b5736285a325c47809495c7cab28b5ed | Catch all exit posix codes and stop server gracefully. Also bind q key to exit. | [
{
"docid": "6591d1e3cd8108a1c54118c9a8f33616",
"score": "0.7369915",
"text": "function exit(signal) {\n socket.close(() => {\n cli.log('Stopped server.');\n process.exit(signal === 'ERR' ? 1 : 0);\n });\n}",
"title": ""
}
] | [
{
"docid": "9dfba6eda724418230543aabba059abc",
"score": "0.6939805",
"text": "function initTerminateHandlers() {\n var readLine;\n\n if (process.platform === \"win32\"){\n readLine = require(\"readline\");\n\n readLine.createInterface ({\n input: process.stdin,\n output: process.stdout... |
1f006d25f488dab4d66b50184c5402dd | MSG: rename in place | [
{
"docid": "0b72352d2b1a06e75ffc04cb1ae5bdf5",
"score": "0.0",
"text": "function renameInPlace_4l(msger, logger) {\n return () => {\n msger.log(`${addTab()}... renamed files in place.`);\n };\n}",
"title": ""
}
] | [
{
"docid": "4578810a4b67560ab5f5e7ee21f66996",
"score": "0.7102932",
"text": "rename(oldName, newName) {\n files.rename(files.pathJoin(this.cwd, oldName),\n files.pathJoin(this.cwd, newName));\n }",
"title": ""
},
{
"docid": "520abd173032cc53ce85a51b4bb5fea0",
"score"... |
01ec85c4f909f8ceee2a72e78a412c3a | parseKerning parses a string representing the additional X advance between two characters. The input string consists of one line per pair of characters. Each line starts with the two characters to adjust the spacing for. Those are followed by whitespace and a number. This is parsed into a javascript map (associative ar... | [
{
"docid": "d38b552dd929e5eaab15a18c4815e2a3",
"score": "0.7181909",
"text": "function parseKerning(kerning) {\n var k = {};\n var re = /([-a-zA-Z0-9!@#$%^&*()_+={}|<>,./]{2}) +([0-9]+(.[0-9]*)?)/;\n var lines = kerning.split('\\n');\n for (var i = 0; i < lines.length; i++) {\n var line = lines[i... | [
{
"docid": "5a3c493ccdb38366780bc881e319a712",
"score": "0.56152",
"text": "function parseKernTable(data, start) {\n var pairs = {};\n var p = new parse.Parser(data, start);\n var tableVersion = p.parseUShort();\n check.argument(tableVersion === 0, 'Unsupported kern table version.');\n //... |
2bdb3980bcab3c031f24d4e9b685fa86 | Old versions of Chromium (below 61.0.3163.100) formats floating pointer numbers in a localedependent way, using a comma instead of a dot. If comma is not replaced with a dot, the input will be rounded down (i.e. acting as a floor function) causing unexpected behaviors | [
{
"docid": "1b013ee53f896cd3a04fd7de1975605a",
"score": "0.0",
"text": "function toMs (s) {\n return Number(s.slice(0, -1).replace(',', '.')) * 1000\n}",
"title": ""
}
] | [
{
"docid": "7cd0487307e1ea18a14162b76c663248",
"score": "0.67688954",
"text": "function commaOnly(value) {\n var num = parseFloat(value);\n if ((vp.utils.isNumber(num)) && (!isNaN(num)) && (value.toString().indexOf(\"e+\") == -1)) {\n //---- add commas, as needed ---... |
3d7fa02684abb84b2918625fa8e8510c | PASO 4: Reemplaza ModalTypes | [
{
"docid": "8ace6fa4eb22c736d8d39487b1d8ee9b",
"score": "0.0",
"text": "function compararValoresyReemplaza() {\n for(var i=0; i < infoSkus.length; i++) {\n for(var j=0 ;j < dataSkus.length; j++) {\n if (infoSkus[i][0] == dataSkus[j][0]) {\n infoFinal.push([dataSkus[j], infoSkus... | [
{
"docid": "1c573b9bf8f4eb05ce53a042f59b6b70",
"score": "0.66466486",
"text": "renderTypeAModal() {\n return (\n <Modal\n isOpen={this.state.showTypeAModal}\n onRequestClose={this.handleCloseTypeAModal}\n style={customStyles}\n >\n <h2>Type A</h2>\n {/* TO... |
e648e577c4f5dcfb9b76e91c18e53098 | override to do stuff right before we fetch | [
{
"docid": "6af8e2fc8bb5a39f1999d239baefb4a3",
"score": "0.70543426",
"text": "async preFetchHook () {\n\t}",
"title": ""
}
] | [
{
"docid": "33cb2aca61a6c44fda9d829b9eac6fea",
"score": "0.6104147",
"text": "function potentiallyCORSEnabledFetch(urlObj) {\n // TO BE IMPLEMENTED\n establishTheConnection();\n }",
"title": ""
},
{
"docid": "a2c4bc696750a483a43e06a886a5902b",
"score": "0.60896736",
... |
253f1369fefa79254de01a870ad18d7e | Sets or gets the language. Used in conjunction with the property messages. Property type: boolean | [
{
"docid": "d151f6715b11feaf888aebdf8404c29c",
"score": "0.0",
"text": "get keyboardNavigation() {\n\t\treturn this.nativeElement ? this.nativeElement.keyboardNavigation : undefined;\n\t}",
"title": ""
}
] | [
{
"docid": "93e76965300e68e7a5fedb37f5b09110",
"score": "0.6746043",
"text": "get language () {\r\n\t\treturn this._language;\r\n\t}",
"title": ""
},
{
"docid": "2cf89c464e4f1893ee19c5074956fce1",
"score": "0.6512211",
"text": "get language() {\n\t\treturn this.__language;\n\t}",
... |
ad0312c104298bff802a307bf383f0a3 | hide mute toggle if the current tech doesn't support volume control | [
{
"docid": "9ad99f9c63ac07118f29a88d11dbbe42",
"score": "0.7128578",
"text": "function updateVisibility() {\n if (player.tech_ && player.tech_['featuresVolumeControl'] === false) {\n this.addClass('vjs-hidden');\n } else {\n this.removeClass('vjs-hidden');\n }\n }",
"... | [
{
"docid": "cb3750a2191ee5bc9ab7cff154935e7a",
"score": "0.7850713",
"text": "toggleVolume() {\n if (this.isMuted) {\n this.unmute();\n } else {\n this.mute();\n }\n }",
"title": ""
},
{
"docid": "eaf4d1254784c86d03067fad24dc525f",
"score": "0.7658586",
"text": "f... |