n === node);\\n currrentNode.x = Pos.x;\\n currrentNode.y = Pos.y;\\n }\",\n \"assignPosition(node, position) {\\n // update the position of the node\\n node.position = position;\\n \\n // the base case\\n if (node.children.length === 0)\\n {\\n leafNodeCounter = leafNodeCounter + 1;\\n return node;\\n }\\n // recursive case\\n else\\n {\\n leafNodeCounter = 0;\\n for (var d = 0; d < node.children.length; d++)\\n {\\n // this is a really bad hack and there is definitely something better out there. \\n // However, it gets the job done\\n if (node.children[d].name === \\\"Protosomes\\\")\\n {\\n leafNodeCounter = leafNodeCounter + 2;\\n }\\n\\n this.assignPosition(node.children[d], node.position + leafNodeCounter);\\n }\\n }\\n\\n }\",\n \"assignPosition(node, position) {\\n\\t\\tif(node.parentNode && position<node.parentNode.position){\\n\\t\\t\\tposition = node.parentNode.position;\\n\\t\\t}\\n\\t\\twhile(this.positionMap.get(`${node.level},${position}`)){\\n\\t\\t\\tposition++;\\n\\t\\t}\\n\\t\\tnode.position = position;\\n\\t\\tthis.positionMap.set(`${node.level},${position}`, true);\\n\\t\\tfor(var i in node.children){\\n\\t\\t\\tthis.assignPosition(node.children[i], position+Number(i));\\n\\t\\t}\\n\\t}\",\n \"function positionTokenAtNode(token, node) {\\n // these details depend on the node template\\n token.location = node.position.copy().offset(4 + 6, 5 + 6);\\n }\",\n \"function updatePosition() {\\r\\n\\t\\t\\tcircle.attr('transform', `translate(${point.x * graph.cell_size + graph.offset.x} ${point.y * graph.cell_size + graph.offset.y})`);\\r\\n\\t\\t}\",\n \"function position() {\\n var before = now()\\n\\n return update\\n\\n // Add the position to a node.\\n function update(node, indent) {\\n var previous = node.position\\n var start = previous ? previous.start : before\\n var combined = []\\n var n = previous && previous.end.line\\n var l = before.line\\n\\n node.position = new Position(start)\\n\\n // If there was already a `position`, this node was merged. Fixing\\n // `start` wasn’t hard, but the indent is different. Especially\\n // because some information, the indent between `n` and `l` wasn’t\\n // tracked. Luckily, that space is (should be?) empty, so we can\\n // safely check for it now.\\n if (previous && indent && previous.indent) {\\n combined = previous.indent\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1)\\n }\\n\\n combined.push(before.column)\\n }\\n\\n indent = combined.concat(indent)\\n }\\n\\n node.position.indent = indent || []\\n\\n return node\\n }\\n }\",\n \"function setCursorPositionInNode(node, pos)\\n\\t{\\n\\t\\tvar sel, range;\\n\\t\\tif (window.getSelection && document.createRange) {\\n\\t\\t\\trange = document.createRange();\\n \\t\\t\\trange.setEnd(node, pos);\\n\\t\\t\\trange.setStart(node, pos);\\n\\t\\t\\tsel = window.getSelection();\\n\\t\\t\\tsel.removeAllRanges();\\n\\t\\t\\tsel.addRange(range);\\n\\t\\t} else if (document.body.createTextRange) {\\n\\t\\t\\trange = document.body.createTextRange();\\n\\t\\t\\trange.setEnd(node, pos);\\n\\t\\t\\trange.setStart(node, pos);\\n\\t\\t\\trange.select();\\n\\t\\t}\\n\\t}\",\n \"markLocation(node/*, startLocation*/) {\\n return node;\\n }\",\n \"function sync(dom, pos) {\\r\\n dom.style.left = `${pos.x}px`;\\r\\n dom.style.top = `${pos.y}px`;\\r\\n}\",\n \"set pos(newPos) {\\n this._pos = newPos;\\n }\",\n \"markOn(){\\n this.room.markPosition(this.positionX, this.positionY);\\n }\",\n \"setPosition(x, y) {\\n this.pos.x = x;\\n this.pos.y = y;\\n }\",\n \"setPosition(newX=this.x, newY=this.y) {\\n this.x = newX;\\n this.y = newY;\\n this.updateEdges() // Update Edge positions\\n this.setAnchorPostion(this, newX, newY); // Update DOM element\\n }\",\n \"function setpos (object, x, y) {\\n object.setAttribute('x', x + '');\\n object.setAttribute('y', y + '');\\n}\",\n \"function updateNodePositions() {\\n // set node positions\\n rect.attr('transform', function (d) {\\n return 'translate(' + d.x + ',' + d.y + ')';\\n });\\n}\",\n \"modify_mark(marker) {\\n if (!marker.offset_handled) {\\n marker.start_pos += this.offset;\\n marker.end_pos += this.offset;\\n }\\n return marker;\\n }\",\n \"function markPosition(x, y, markerObject) {\\n if (x >= 0 && x < size && y >= 0 && y < size){\\n if (matrix[y][x] && matrix[y][x].marker != markerObject.marker)\\n matrix[y][x] = {steps: matrix[y][x].steps + markerObject.steps, marker: 'x'};\\n else \\n matrix[y][x] = markerObject;\\n }\\n}\",\n \"function setNodePosition(){\\n\\t\\t//console.log(print);\\n\\t\\tvar change = 0;\\n\\t\\tvar offset = Math.max(xOffset - leftPanelWidth,0);\\n\\n\\t\\t//set xpos of nodes, and check if node is an outside node\\n\\t\\tlayerMap.forEach(function(d, i){\\n\\t\\t\\tif (i > 0){\\n\\t\\t\\t\\td.forEach(function(e){\\n\\t\\t\\t\\t\\tvar tmp = [];\\n\\t\\t\\t\\t\\tnodesChildren[e].forEach(function(f){\\n\\t\\t\\t\\t\\t\\tif (!nodesData[f].outside.isOutside){\\n\\t\\t\\t\\t\\t\\t\\ttmp.push(nodesData[f].xpos);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t});\\t\\n\\t\\t\\t\\t\\tif (tmp.length == 0){\\n\\t\\t\\t\\t\\t\\tif (!nodesData[e].outside.isOutside){\\n\\t\\t\\t\\t\\t\\t\\tchange++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tnodesData[e].outside.isOutside = true;\\n\\t\\t\\t\\t\\t\\tnodesData[e].xpos = -1;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tif (nodesData[e].outside.isOutside){\\n\\t\\t\\t\\t\\t\\t\\tchange++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tnodesData[e].xpos = (d3.min(tmp) + d3.max(tmp)) / 2;\\n\\t\\t\\t\\t\\t\\tif (!d.fixed){\\n\\t\\t\\t\\t\\t\\t\\tnodesData[e].position.x = nodesData[e].xpos;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tnodesData[e].outside.isOutside = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}); \\n\\t\\t\\t} else {\\n\\t\\t\\t\\td.forEach(function(e){\\n\\t\\t\\t\\t\\tvar tmpX = nodesData[e].xpos;\\t\\n\\t\\t\\t\\t\\tif (tmpX - nodeRadius > offset && tmpX + nodeRadius < offset + windowWidth){\\n\\t\\t\\t\\t\\t\\tif (nodesData[e].outside.isOutside){\\n\\t\\t\\t\\t\\t\\t\\tchange++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tnodesData[e].outside.isOutside = false;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tif (!nodesData[e].outside.isOutside){\\n\\t\\t\\t\\t\\t\\t\\tchange++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tnodesData[e].outside.isOutside = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t})\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\n\\t\\t\\n\\t\\t//Set the color, opacity of nodes based on the status of isOutside\\n\\t\\tnodes.each(function(d){\\n\\t\\t\\t/*if (d.noLayer){\\n\\t\\t\\t\\td.outside.isOutside = true;\\n\\t\\t\\t\\td3.select(this)\\n\\t\\t\\t\\t\\t.attr(\\\"opacity\\\", 0.8)\\n\\t\\t\\t\\t\\t.attr(\\\"r\\\", nodeRadius)\\n\\t\\t\\t\\t\\t.attr(\\\"fill\\\", \\\"red\\\");\\n\\t\\t\\t}\\t\\t*/\\t\\t\\t\\t\\n\\t\\t\\tif (d.fixed && !(d.x - nodeRadius > offset && d.x + nodeRadius < offset + windowWidth)){\\n\\t\\t\\t\\td.fixed = false\\t\\t\\t\\t\\n\\t\\t\\t\\td3.select(this).classed(\\\"fixed\\\", false);\\n\\t \\t\\t\\td.position.x = d.xpos;\\n\\t\\t\\t\\td.position.y = height - nodeRadius - d.layer * unitLinkLength;\\n\\t\\t\\t}\\n\\t\\t\\tif (d.outside.isOutside && !d.noLayer){\\n\\t\\t\\t\\tif (d.unAssigned){\\n\\n\\t\\t\\t\\t}\\t\\t\\t\\t\\n\\t\\t\\t\\td3.select(this)\\n\\t\\t\\t\\t\\t.transition()\\n\\t\\t\\t\\t\\t.duration(500)\\n\\t\\t\\t\\t\\t.attr(\\\"opacity\\\", 0.5)\\n\\t\\t\\t\\t\\t.attr(\\\"r\\\", nodeRadius)\\n\\t\\t\\t\\t\\t.attr(\\\"fill\\\", function(d){\\n\\t\\t\\t\\t\\t\\treturn cScale(d.index + 1);\\n\\t\\t\\t\\t\\t});\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t} else {\\n\\t\\t\\t\\td3.select(this)\\n\\t\\t\\t\\t\\t.transition()\\n\\t\\t\\t\\t\\t.duration(500)\\n\\t\\t\\t\\t\\t.attr(\\\"opacity\\\", 0.7)\\n\\t\\t\\t\\t\\t.attr(\\\"r\\\", nodeRadius)\\n\\t\\t\\t\\t\\t.attr(\\\"fill\\\", \\\"red\\\");\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t//console.log(d.id + \\\" \\\" + d.outside.isOutside + \\\" \\\" + d.position.x);\\n\\t\\t});\\n\\t\\t//console.log(change)\\n\\n\\t\\t//when some node changes its status, the correspoding links, labels and the x position of inside nodes should also change.\\n\\t\\tif (change > 0 || firstTime){\\n\\t\\t\\tfirstTime = false;\\n\\t\\t\\td3.select(htmlElement).selectAll(\\\".nodeLabel\\\")\\n\\t\\t\\t\\t.attr(\\\"opacity\\\", function(d){\\n\\t\\t\\t\\t\\tif (d.node.noLayer){\\n\\t\\t\\t\\t\\t\\td.node.showLabel = true;\\n\\t\\t\\t\\t\\t\\treturn 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (d.type == \\\"nodeLabel\\\" && d.node.outside){\\n\\t\\t\\t\\t\\t\\tif ((!d.node.outside.isOutside && (print || d.node.type != \\\"anchor\\\")) || (d.node.outside.isOutside && d.node.degree >= 3)){\\n\\t\\t\\t\\t\\t\\t\\td.node.showLabel = true;\\n\\t\\t\\t\\t\\t\\t\\treturn 1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\t\\n\\t\\t\\t\\t\\td.node.showLabel = false;\\n\\t\\t\\t\\t\\treturn 0;\\t\\t\\t\\n\\t\\t\\t\\t});\\n\\t\\t\\td3.select(htmlElement).selectAll(\\\".linkLabel\\\")\\n\\t\\t\\t\\t.attr(\\\"opacity\\\", function(d){\\n\\t\\t\\t\\t\\tif (d.type == \\\"linkLabel\\\"){\\n\\t\\t\\t\\t\\t\\t// if (nodesData[d.node.tgt].noLayer){\\n\\t\\t\\t\\t\\t\\t// \\td.show = true;\\n\\t\\t\\t\\t\\t\\t// \\treturn 1;\\n\\t\\t\\t\\t\\t\\t// }\\n\\t\\t\\t\\t\\t\\t// if (nodesData[d.node.tgt].type == 'anchor' && !nodesData[d.node.tgt].outside.isOutside){\\n\\t\\t\\t\\t\\t\\t// \\td.show = true;\\n\\t\\t\\t\\t\\t\\t// \\treturn 1;\\n\\t\\t\\t\\t\\t\\t// }\\n\\t\\t\\t\\t\\t\\tif ((d.node.src < nodesData.length && nodesData[d.node.src].noLayer == undefined && nodesData[d.node.src].outside.isOutside) \\n\\t\\t\\t\\t\\t\\t\\t|| (d.node.tgt < nodesData.length && nodesData[d.node.tgt].noLayer == undefined && nodesData[d.node.tgt].outside.isOutside)){\\n\\t\\t\\t\\t\\t\\t\\td.show = false;\\n\\t\\t\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\td.show = true;\\n\\t\\t\\t\\t\\t\\treturn 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t});\\n\\t\\t\\td3.select(htmlElement).selectAll(\\\".edgeLinkLabel\\\")\\n\\t\\t\\t\\t.attr(\\\"opacity\\\", function(d){\\n\\t\\t\\t\\t\\t//console.log(d.index);\\n\\t\\t\\t\\t\\tif (!d.node.src.show || \\n\\t\\t\\t\\t\\t\\t(nodesData[d.node.tgt].noLayer == undefined && nodesData[d.node.tgt].outside.isOutside)) {\\n\\t\\t\\t\\t\\t\\td.show = false;\\n\\t\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\td.show = true;\\n\\t\\t\\t\\t\\treturn 1;\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t});\\n\\t\\t\\t/*d3.select(htmlElement).selectAll(\\\".clickBoard\\\")\\n\\t\\t\\t\\t.attr(\\\"fill\\\", function(d){\\n\\t\\t\\t\\t\\tif (d.content == \\\"edgeLinks\\\"){\\n\\t\\t\\t\\t\\t\\tif (nodesData[d.node.tgt].outside.isOutside || !d.node.src.show){\\n\\t\\t\\t\\t\\t\\t\\treturn \\\"node\\\";\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\treturn \\\"transparent\\\";\\n\\t\\t\\t\\t\\t} else if (d.type == \\\"linkLabel\\\"){\\n\\t\\t\\t\\t\\t\\tif (nodesData[d.node.src].outside.isOutside || nodesData[d.node.tgt].outside.isOutside){\\n\\t\\t\\t\\t\\t\\t\\treturn \\\"none\\\";\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\treturn \\\"transparent\\\";\\n\\t\\t\\t\\t\\t} \\n\\t\\t\\t\\t\\treturn d.node.showLabel ? \\\"transparent\\\" : \\\"none\\\";\\n\\t\\t\\t\\t});*/\\n\\n\\t\\t\\tlinks.classed(\\\"outsideLink\\\", function(d){\\n\\t\\t\\t\\t/*if (d.type == \\\"edgeLink\\\"){\\n\\t\\t\\t\\t\\treturn d.target.outside.isOutside;\\n\\t\\t\\t\\t}*/\\n\\t\\t\\t\\tif (d.target.noLayer){\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (d.source.outside && d.target.outside){\\n\\t\\t\\t\\t\\tif (d.target.type == 'anchor' && !d.target.outside.isOutside){\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn d.source.outside.isOutside || d.target.outside.isOutside;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\n\\t\\t\\t\\n\\t\\t\\tforce.start();\\n\\t\\t}\\n\\t}\",\n \"set x(nx){\\n\\t\\tthis.position.nx = nx;\\n\\t}\",\n \"set position(p) {\\n this.previous.to(this);\\n if (this._lock)\\n this._lockPt = p;\\n this.to(p);\\n }\",\n \"updatePos(token, tObj) {\\n tObj.xPos = token.get('left');\\n tObj.yPos = token.get('top');\\n }\",\n \"newPosition(position) {\\n this.position = position;\\n }\",\n \"setPosition(x, y) {\\n this.x = x\\n this.y = y\\n }\",\n \"function setPosition(el, point) {\\n /*eslint-disable */\\n el._leaflet_pos = point;\\n /* eslint-enable */\\n\\n if (any3d) {\\n setTransform(el, point);\\n } else {\\n el.style.left = point.x + 'px';\\n el.style.top = point.y + 'px';\\n }\\n } // @function getPosition(el: HTMLElement): Point\",\n \"function patch(nodes, location, offset) {\\n var index = -1\\n var start = offset\\n var end\\n var node\\n\\n while (++index < nodes.length) {\\n node = nodes[index]\\n\\n if (node.children) {\\n patch(node.children, location, start)\\n }\\n\\n end = start + toString(node).length\\n\\n node.position = {\\n start: location.toPoint(start),\\n end: location.toPoint(end)\\n }\\n\\n start = end\\n }\\n\\n return nodes\\n }\",\n \"function handleToMovePatchNode() {}\",\n \"setPosition(x, y) {\\n this.x = x;\\n this.y = y;\\n }\",\n \"sendToStartPos() {\\n this.x = this.spawnX;\\n this.y = this.spawnY;\\n }\",\n \"set position (newPosition) {\\n this.emit('position', newPosition)\\n this._position = newPosition * this.ticksPerSongPosition\\n }\",\n \"function setPos(j) {\\n pos = j;\\n update();\\n\\n\\n}\",\n \"function setpostion(newPostion) {\\n setPosition(newPostion);\\n }\",\n \"updatePosition(position) \\n {\\n this.position = position;\\n }\",\n \"setPosition() {\\r\\n if (!this.object) return;\\r\\n this.updatePosition();\\r\\n }\",\n \"set_position(newval) {\\n this.liveFunc.set_position(newval);\\n return this._yapi.SUCCESS;\\n }\",\n \"setPosition(position) {\\n this.position = position;\\n }\",\n \"set position(value) {\\n this.position$.next(value);\\n }\",\n \"updatePos(node) {\\n if (node != null) {\\n\\n var q = node.distanceFromParent;\\n\\n // this.isRB && \\n if (node.dpth == 0) {\\n node.changePositionNoMove(10_000, 200);\\n }\\n \\n if (node.dpth > 0) {\\n node.changePositionNoMove(node.parent.posX+q, node.parent.posY+this.z);\\n }\\n\\n this.updatePos(node.left);\\n this.updatePos(node.right);\\n }\\n }\",\n \"SetNewPositionToANode(registeredPos) {\\n this.setNodePosition(registeredPos.newValue, registeredPos.element);\\n }\",\n \"function setPosition( graphID, updatedX, updatedY )\\n{\\n console.log( `moving ${graphID} to ${updatedX}, ${updatedY}`);\\n\\n // changing a body's position in Matter JS maintains the constraints\\n // we will remove all the constraints, move the body, then put the constraints back in\\n var circleBody = idToCircleMap.get( graphID );\\n\\n // track neighbors \\n var neighbors = new Array();\\n var currentConstraints = Composite.allConstraints(barAndJointComposite);\\n var currentConstraint;\\n\\n // iterate over all constraints\\n // if find a neighbor, remove the constraint and track the graphID to add back in\\n for ( var i = 0; i < currentConstraints.length; i++ )\\n {\\n currentConstraint = currentConstraints[i];\\n if ( currentConstraint.bodyA == circleBody )\\n {\\n neighbors.push( currentConstraint.bodyB.graphID );\\n Composite.remove( barAndJointComposite, currentConstraint ); \\n }\\n else if ( currentConstraint.bodyB == circleBody )\\n {\\n neighbors.push( currentConstraint.bodyA.graphID );\\n Composite.remove( barAndJointComposite, currentConstraint ); \\n }\\n }\\n Body.setPosition( circleBody, {x:updatedX, y:updatedY});\\n\\n // now add the constraints back in\\n for ( var i = 0; i < neighbors.length; i++ )\\n addConstraintBetween( graphID, neighbors[i] );\\n console.log( circleBody );\\n}\",\n \"setPosition(posX, posY) {\\n this._positionX = posX;\\n this._positionY = posY;\\n this._zoomDirty = true;\\n }\",\n \"function changeLinePos(line, pos) {\\n pos = {\\n x: pos.x / resizer,\\n y: pos.y / resizer\\n }\\n gMeme[getMemeIdxInGMeme(gCurrMeme)].lines[line].pos = pos;\\n}\",\n \"set posX(value){\\n this._posX = value;\\n }\",\n \"setPosition(position)\\n {\\n this.position = position;\\n }\",\n \"updatePosition(position) {\\n if (position == null)\\n return;\\n const positionNodes = parseExpressions(position)[0].terms;\\n for (let i = 0; i < 3; ++i) {\\n this.position.setComponent(i, normalizeUnit(positionNodes[i]).number);\\n }\\n this.updateMatrixWorld();\\n }\",\n \"update () {\\n this.position = [this.x, this.y];\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"updatePosition(position) {\\n if (position == null)\\n return;\\n const positionNodes = parseExpressions(position)[0].terms;\\n for (let i = 0; i < 3; ++i) {\\n this.position.setComponent(i, normalizeUnit(positionNodes[i]).number);\\n }\\n }\",\n \"addNodeMark(pos, mark) {\\n this.step(new AddNodeMarkStep(pos, mark));\\n return this;\\n }\",\n \"setPosition(newX=this.x, newY=this.y) {\\n this.x = newX;\\n this.y = newY;\\n this.updateEdges() // Update Edge positions\\n this.setBlobPosition(this, newX, newY); // Update DOM element\\n // Update Text Positioning\\n if (this.shape === \\\"rectangle\\\") {\\n this.updateTextPosition(this.html, this.x, this.y, this.width, this.height);\\n }\\n else if (this.shape === \\\"circle\\\") {\\n this.updateTextPosition(this.html, this.x - this.radius/1.4, this.y - this.radius/1.4, this.radius*1.4, this.radius*1.4);\\n }\\n else {\\n this.updateTextPosition(this.html, this.x - this.radiusx/1.4, this.y - this.radiusy/1.4, this.radiusx*1.4, this.radiusy*1.4);\\n }\\n }\",\n \"set targetPosition(value) {}\",\n \"set_red_ghost_pos(position) {\\r\\n\\r\\n this.ghost.ghost_red_pos_x = position.x_pos;\\r\\n this.ghost.ghost_red_pos_y = position.y_pos; \\r\\n }\",\n \"invalidateCSSPositioning() {\\n if ( !this.positionDirty ) {\\n this.positionDirty = true;\\n\\n // mark all ancestors of this peer so that we can quickly find this dirty peer when we traverse\\n // the PDOMInstance tree\\n let parent = this.pdomInstance.parent;\\n while ( parent ) {\\n parent.peer.childPositionDirty = true;\\n parent = parent.parent;\\n }\\n }\\n }\",\n \"setPos(x,y){\\n\\t\\tthis.setX(x);\\n\\t\\tthis.setY(y);\\n\\t}\",\n \"function removePosition(node, force) {\\n visit(node, force ? hard : soft)\\n return node\\n}\",\n \"function removePosition(node, force) {\\n visit(node, force ? hard : soft)\\n return node\\n}\",\n \"function removePosition(node, force) {\\n visit(node, force ? hard : soft)\\n return node\\n}\",\n \"function CWCMFlowNode_setPoint(_x, _y){\\n\\tthis.updated = true;\\n\\tthis.center.x = _x;\\n\\tthis.center.y = _y;\\n}\",\n \"moveTo(point) {\\n if (!this.fixed) {\\n this.reset()\\n this.dest = point\\n }\\n // this.pos = point\\n // this.fixed = true\\n }\",\n \"function markIt(node) {\\n node.addClass(\\\"marked\\\");\\n jsav.umsg(\\\"Mark node \\\" + node.value());\\n node.highlight();\\n jsav.step();\\n}\",\n \"function positionSet(point, index) {\\n circles[index].x = point.x;\\n circles[index].y = point.y;\\n positioned[index] = true;\\n }\",\n \"function position() {\\n var start = {line: lineno, column: column}\\n return function(node) {\\n node.position = new Position(start)\\n whitespace()\\n return node\\n }\\n }\",\n \"setOldPosition(registeredPos) {\\n this.setNodePosition(registeredPos.oldValue, registeredPos.element);\\n }\",\n \"function reposition(node, x, k) {\\r\\n // console.log(node)\\r\\n node.x = x;\\r\\n if (node.children && (n = node.children.length)) {\\r\\n var i = -1, n;\\r\\n while (++i < n) x += reposition(node.children[i], x, k);\\r\\n }\\r\\n return node.dx = node.value * k;\\r\\n}\",\n \"function positionSet(point, index) {\\n circles[index].x = point.x;\\n circles[index].y = point.y;\\n positioned[index] = true;\\n }\",\n \"function positionSet(point, index) {\\n circles[index].x = point.x;\\n circles[index].y = point.y;\\n positioned[index] = true;\\n }\",\n \"function positionSet(point, index) {\\n circles[index].x = point.x;\\n circles[index].y = point.y;\\n positioned[index] = true;\\n }\",\n \"function ticked() {\\n link.attr(\\\"d\\\", positionLink);\\n node.attr(\\\"transform\\\", positionNode);\\n }\",\n \"function setNewXPositions(last) {\\n data.tree.eachBefore(d => {\\n d.x = d.x / last\\n d.x = d.x * graph.scale.vertical.value\\n\\n let element = d3.select('#node' + d.data.id)\\n if (!element) return\\n element.attr('transform', 'translate(' + [d.y, d.x] + ')')\\n if (d.parent) {\\n d3.select('#link' + d.data.id)\\n .select('path')\\n .attr('d', 'M' + [d.parent.y, d.parent.x] + 'V' + d.x + 'H' + d.y)\\n\\n if (graph.style.linkLabels) {\\n if (d3.select('#label' + d.data.id)) {\\n d3.select('#label' + d.data.id)\\n .attr('y', (d.x - 5).toString())\\n }\\n }\\n }\\n })\\n }\",\n \"function pointAt(node){\\n var parent = node.parentNode;\\n var next = node.nextSibling;\\n return function(newnode) {\\n parent.insertBefore(newnode, next);\\n };\\n }\",\n \"setWorldPosition(position, update = false){ \\n let new_pos = this.getParentSpaceMatrix().getInverse().times(position)\\n let pp_r_s_inv = Matrix3x3.Translation(new_pos).times(\\n Matrix3x3.Rotation(this.getRotation()).times(\\n Matrix3x3.Scale(this.getScale())\\n )).getInverse()\\n let new_a_mat = pp_r_s_inv.times(this.matrix)\\n this.setPosition(new_pos, update)\\n this.setAnchorShift(new Vec2(new_a_mat.m02, new_a_mat.m12))\\n this.updateMatrixProperties()\\n }\",\n \"changePosition(x, y, z) {\\n\\t\\t'use strict';\\n\\t\\tthis.obj.position.set(x, y, z);\\n\\t}\",\n \"changePosition(x, y, z) {\\n\\t\\t'use strict';\\n\\t\\tthis.obj.position.set(x, y, z);\\n\\t}\",\n \"function finishNodeAt(node, type, pos, loc) {\\n node.type = type;\\n node.end = pos;\\n if (this.options.locations)\\n { node.loc.end = loc; }\\n if (this.options.ranges)\\n { node.range[1] = pos; }\\n return node\\n }\",\n \"function finishNodeAt(node, type, pos, loc) {\\n node.type = type;\\n node.end = pos;\\n if (this.options.locations)\\n { node.loc.end = loc; }\\n if (this.options.ranges)\\n { node.range[1] = pos; }\\n return node\\n }\",\n \"function finishNodeAt(node, type, pos, loc) {\\n node.type = type;\\n node.end = pos;\\n if (this.options.locations)\\n { node.loc.end = loc; }\\n if (this.options.ranges)\\n { node.range[1] = pos; }\\n return node\\n }\",\n \"insertAfterPart(ref){ref.__insert(this.startNode=createMarker());this.endNode=ref.endNode;ref.endNode=this.startNode}\",\n \"function position() {\\n const start = {\\n line: lineno,\\n column\\n };\\n return function (node) {\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function reposition(node, x, k) {\\n node.x = x;\\n if (node.children && (n = node.children.length)) {\\n var i = -1, n;\\n while (++i < n) x += reposition(node.children[i], x, k);\\n }\\n return node.dx = node.value * k;\\n }\",\n \"function setNodesPosition(nodes) {\\n var deferred = $.Deferred();\\n if ( nodes.length == 0 ) { deferred.resolve(); return deferred.promise(); }\\n var lab_filename = $('#lab-viewport').attr('data-path');\\n var form_data = [];\\n form_data=nodes;\\n var url = '/api/labs' + lab_filename + '/nodes' ;\\n var type = 'PUT';\\n $.ajax({\\n cache: false,\\n timeout: TIMEOUT,\\n type: type,\\n url: encodeURI(url),\\n dataType: 'json',\\n data: JSON.stringify(form_data),\\n success: function (data) {\\n if (data['status'] == 'success') {\\n logger(1, 'DEBUG: node position updated.');\\n deferred.resolve();\\n } else {\\n // Application error\\n logger(1, 'DEBUG: application error (' + data['status'] + ') on ' + type + ' ' + url + ' (' + data['message'] + ').');\\n deferred.reject(data['message']);\\n }\\n },\\n error: function (data) {\\n // Server error\\n var message = getJsonMessage(data['responseText']);\\n logger(1, 'DEBUG: server error (' + data['status'] + ') on ' + type + ' ' + url + '.');\\n logger(1, 'DEBUG: ' + message);\\n deferred.reject(message);\\n }\\n });\\n return deferred.promise();\\n}\",\n \"reset(position) {\\n this.x = this.x0;\\n this.y = this.y0;\\n }\",\n \"newPosition(x, y)\\n {\\n this.x = x;\\n this.y = y;\\n }\",\n \"function position() {\\n\\t var start = { line: lineno, column: column };\\n\\t return function(node){\\n\\t node.position = new Position(start);\\n\\t whitespace();\\n\\t return node;\\n\\t };\\n\\t }\",\n \"updatePosition() {\\n this.position = Utils.convertToEntityPosition(this.bmp);\\n }\",\n \"function removePosition(node, force) {\\n visit(node, force ? hard : soft);\\n return node;\\n}\",\n \"function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\",\n \"function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\",\n \"function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\",\n \"function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\",\n \"function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\",\n \"updatePosition() {\\n this.handleWrapping();\\n this.x += this.vx;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7861916","0.6788894","0.6681636","0.6610156","0.6173554","0.6161047","0.6156374","0.6002291","0.5998681","0.59891766","0.59890425","0.59074354","0.5890844","0.58887213","0.5858468","0.58487445","0.58283585","0.5807958","0.578546","0.5776166","0.5738537","0.57345665","0.57160676","0.57159877","0.568641","0.56833047","0.5668272","0.56670654","0.56437093","0.56378496","0.5619375","0.5618386","0.5598774","0.55974984","0.5594161","0.55873626","0.55770046","0.55669427","0.5566843","0.5560061","0.55485374","0.5546027","0.55324996","0.55317974","0.55279386","0.5527807","0.5519506","0.5519506","0.5519506","0.5519506","0.5519506","0.5519506","0.5514231","0.5513732","0.5511838","0.55108047","0.55080056","0.5506884","0.5506144","0.5488956","0.5488956","0.5488956","0.54822105","0.5475014","0.5465711","0.54641","0.54621327","0.5431846","0.54280686","0.542779","0.542779","0.542779","0.5419225","0.54158497","0.5410287","0.539644","0.5393866","0.5393866","0.538352","0.538352","0.538352","0.5377997","0.5364237","0.5352925","0.53521043","0.5349427","0.5349224","0.5348465","0.534532","0.53425676","0.53411424","0.53411424","0.53411424","0.53411424","0.53411424","0.5333536"],"string":"[\n \"0.7861916\",\n \"0.6788894\",\n \"0.6681636\",\n \"0.6610156\",\n \"0.6173554\",\n \"0.6161047\",\n \"0.6156374\",\n \"0.6002291\",\n \"0.5998681\",\n \"0.59891766\",\n \"0.59890425\",\n \"0.59074354\",\n \"0.5890844\",\n \"0.58887213\",\n \"0.5858468\",\n \"0.58487445\",\n \"0.58283585\",\n \"0.5807958\",\n \"0.578546\",\n \"0.5776166\",\n \"0.5738537\",\n \"0.57345665\",\n \"0.57160676\",\n \"0.57159877\",\n \"0.568641\",\n \"0.56833047\",\n \"0.5668272\",\n \"0.56670654\",\n \"0.56437093\",\n \"0.56378496\",\n \"0.5619375\",\n \"0.5618386\",\n \"0.5598774\",\n \"0.55974984\",\n \"0.5594161\",\n \"0.55873626\",\n \"0.55770046\",\n \"0.55669427\",\n \"0.5566843\",\n \"0.5560061\",\n \"0.55485374\",\n \"0.5546027\",\n \"0.55324996\",\n \"0.55317974\",\n \"0.55279386\",\n \"0.5527807\",\n \"0.5519506\",\n \"0.5519506\",\n \"0.5519506\",\n \"0.5519506\",\n \"0.5519506\",\n \"0.5519506\",\n \"0.5514231\",\n \"0.5513732\",\n \"0.5511838\",\n \"0.55108047\",\n \"0.55080056\",\n \"0.5506884\",\n \"0.5506144\",\n \"0.5488956\",\n \"0.5488956\",\n \"0.5488956\",\n \"0.54822105\",\n \"0.5475014\",\n \"0.5465711\",\n \"0.54641\",\n \"0.54621327\",\n \"0.5431846\",\n \"0.54280686\",\n \"0.542779\",\n \"0.542779\",\n \"0.542779\",\n \"0.5419225\",\n \"0.54158497\",\n \"0.5410287\",\n \"0.539644\",\n \"0.5393866\",\n \"0.5393866\",\n \"0.538352\",\n \"0.538352\",\n \"0.538352\",\n \"0.5377997\",\n \"0.5364237\",\n \"0.5352925\",\n \"0.53521043\",\n \"0.5349427\",\n \"0.5349224\",\n \"0.5348465\",\n \"0.534532\",\n \"0.53425676\",\n \"0.53411424\",\n \"0.53411424\",\n \"0.53411424\",\n \"0.53411424\",\n \"0.53411424\",\n \"0.5333536\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.612533"},"document_rank":{"kind":"string","value":"11"}}},{"rowIdx":76392,"cells":{"query":{"kind":"string","value":"Add the position to a node."},"document":{"kind":"string","value":"function update(node, indent) {\n var prev = node.position;\n var start = prev ? prev.start : before;\n var combined = [];\n var n = prev && prev.end.line;\n var l = before.line;\n\n node.position = new Position(start);\n\n /* If there was already a `position`, this\n * node was merged. Fixing `start` wasn’t\n * hard, but the indent is different.\n * Especially because some information, the\n * indent between `n` and `l` wasn’t\n * tracked. Luckily, that space is\n * (should be?) empty, so we can safely\n * check for it now. */\n if (prev && indent && prev.indent) {\n combined = prev.indent;\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1);\n }\n\n combined.push(before.column);\n }\n\n indent = combined.concat(indent);\n }\n\n node.position.indent = indent || [];\n\n return node;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function add (node, parent) {\n parent.children.push(node)\n if (parser.position) {\n parent.position = {\n start: parent.children[0].position.start,\n end: node.position.end\n }\n }\n }","addPosition(pos) {\n this.positions += '=\"'+pos.line + ':' + pos.linePosition + '\",';\n }","assignPosition(node, position) {\n\t\tif(node.parentNode && position<node.parentNode.position){\n\t\t\tposition = node.parentNode.position;\n\t\t}\n\t\twhile(this.positionMap.get(`${node.level},${position}`)){\n\t\t\tposition++;\n\t\t}\n\t\tnode.position = position;\n\t\tthis.positionMap.set(`${node.level},${position}`, true);\n\t\tfor(var i in node.children){\n\t\t\tthis.assignPosition(node.children[i], position+Number(i));\n\t\t}\n\t}","assignPosition(node, position) {\n // update the position of the node\n node.position = position;\n \n // the base case\n if (node.children.length === 0)\n {\n leafNodeCounter = leafNodeCounter + 1;\n return node;\n }\n // recursive case\n else\n {\n leafNodeCounter = 0;\n for (var d = 0; d < node.children.length; d++)\n {\n // this is a really bad hack and there is definitely something better out there. \n // However, it gets the job done\n if (node.children[d].name === \"Protosomes\")\n {\n leafNodeCounter = leafNodeCounter + 2;\n }\n\n this.assignPosition(node.children[d], node.position + leafNodeCounter);\n }\n }\n\n }","setNodePosition(Pos, node) {\n let currrentNode = this.nodes.find(n => n === node);\n currrentNode.x = Pos.x;\n currrentNode.y = Pos.y;\n }","SetNewPositionToANode(registeredPos) {\n this.setNodePosition(registeredPos.newValue, registeredPos.element);\n }","function positionTokenAtNode(token, node) {\n // these details depend on the node template\n token.location = node.position.copy().offset(4 + 6, 5 + 6);\n }","insertAtPosition(position, nodeToInsert) {\n if(position > this.length + 1 || !position || !nodeToInsert)\n return\n\n if(position === 1) {\n this.setHead(nodeToInsert)\n return\n }\n\n let curr = this.head, currPost = 1\n while(curr && currPost++ < position)\n curr = curr.next\n\n if(curr) this.insertBefore(curr, nodeToInsert)\n else this.setTail(nodeToInsert)\n\n }","insertIn(position, value) {\n if (position < 0 || \n position > this.length) {\n\n console.error(\"Position is out of range! \", position)\n return null;\n }\n\n let node = new Node(value);\n\n if (position === 0) {\n\n node.next = this.head;\n this.head = node;\n\n } else {\n let current = this.head,\n prev = null,\n index = 0;\n\n while (index < position) {\n prev = current;\n current = current.next;\n index ++;\n }\n\n prev.next = node;\n node.next = current;\n }\n\n this.length++;\n\n }","pushPosition(position) {\n\t\tthis.positionContainer.push(position);\n\t}","function position() {\n var before = now()\n\n return update\n\n // Add the position to a node.\n function update(node, indent) {\n var previous = node.position\n var start = previous ? previous.start : before\n var combined = []\n var n = previous && previous.end.line\n var l = before.line\n\n node.position = new Position(start)\n\n // If there was already a `position`, this node was merged. Fixing\n // `start` wasn’t hard, but the indent is different. Especially\n // because some information, the indent between `n` and `l` wasn’t\n // tracked. Luckily, that space is (should be?) empty, so we can\n // safely check for it now.\n if (previous && indent && previous.indent) {\n combined = previous.indent\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1)\n }\n\n combined.push(before.column)\n }\n\n indent = combined.concat(indent)\n }\n\n node.position.indent = indent || []\n\n return node\n }\n }","insertAfter(position, data) {\n /*\n `position === -1` means we are adding the node before the head,\n hence, our `head` should be changed\n */\n if (position === -1) {\n let newNode = new ListNode(data)\n newNode.next = this.head\n this.head = newNode\n return\n }\n\n let currentNode = this.find(position)\n\n if (currentNode) {\n let newNode = new ListNode(data)\n newNode.next = currentNode.next\n currentNode.next = newNode\n } else {\n throw new Error(`Cannot insert at position ${position + 1}: unreachable position!`)\n }\n }","function addNode(){\n\n if (!CONST.nodeEditingEnabled)\n return;\n // prevent I-bar on drag\n //d3.event.preventDefault();\n\n // because :active only works in WebKit?\n svg.classed('active', true);\n\n if(d3.event.ctrlKey || mousedown_node || mousedown_link) return;\n\n // insert new node at point\n var point = d3.mouse(this),\n node = {id: 'ID' + ++lastNodeId, reflexive: false};\n node.x = point[0];\n node.y = point[1];\n nodes.push(node);\n\n showMsg('New node is added', 'success');\n restart();\n }","function position() {\n var before = now();\n\n return update;\n\n /* Add the position to a node. */\n function update(node, indent) {\n var prev = node.position;\n var start = prev ? prev.start : before;\n var combined = [];\n var n = prev && prev.end.line;\n var l = before.line;\n\n node.position = new Position(start);\n\n /* If there was already a `position`, this\n * node was merged. Fixing `start` wasn’t\n * hard, but the indent is different.\n * Especially because some information, the\n * indent between `n` and `l` wasn’t\n * tracked. Luckily, that space is\n * (should be?) empty, so we can safely\n * check for it now. */\n if (prev && indent && prev.indent) {\n combined = prev.indent;\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1);\n }\n\n combined.push(before.column);\n }\n\n indent = combined.concat(indent);\n }\n\n node.position.indent = indent || [];\n\n return node;\n }\n }","function position() {\n var before = now();\n\n return update;\n\n /* Add the position to a node. */\n function update(node, indent) {\n var prev = node.position;\n var start = prev ? prev.start : before;\n var combined = [];\n var n = prev && prev.end.line;\n var l = before.line;\n\n node.position = new Position(start);\n\n /* If there was already a `position`, this\n * node was merged. Fixing `start` wasn’t\n * hard, but the indent is different.\n * Especially because some information, the\n * indent between `n` and `l` wasn’t\n * tracked. Luckily, that space is\n * (should be?) empty, so we can safely\n * check for it now. */\n if (prev && indent && prev.indent) {\n combined = prev.indent;\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1);\n }\n\n combined.push(before.column);\n }\n\n indent = combined.concat(indent);\n }\n\n node.position.indent = indent || [];\n\n return node;\n }\n }","function position() {\n var before = now();\n\n return update;\n\n /* Add the position to a node. */\n function update(node, indent) {\n var prev = node.position;\n var start = prev ? prev.start : before;\n var combined = [];\n var n = prev && prev.end.line;\n var l = before.line;\n\n node.position = new Position(start);\n\n /* If there was already a `position`, this\n * node was merged. Fixing `start` wasn’t\n * hard, but the indent is different.\n * Especially because some information, the\n * indent between `n` and `l` wasn’t\n * tracked. Luckily, that space is\n * (should be?) empty, so we can safely\n * check for it now. */\n if (prev && indent && prev.indent) {\n combined = prev.indent;\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1);\n }\n\n combined.push(before.column);\n }\n\n indent = combined.concat(indent);\n }\n\n node.position.indent = indent || [];\n\n return node;\n }\n }","function position() {\n var before = now();\n\n return update;\n\n /* Add the position to a node. */\n function update(node, indent) {\n var prev = node.position;\n var start = prev ? prev.start : before;\n var combined = [];\n var n = prev && prev.end.line;\n var l = before.line;\n\n node.position = new Position(start);\n\n /* If there was already a `position`, this\n * node was merged. Fixing `start` wasn’t\n * hard, but the indent is different.\n * Especially because some information, the\n * indent between `n` and `l` wasn’t\n * tracked. Luckily, that space is\n * (should be?) empty, so we can safely\n * check for it now. */\n if (prev && indent && prev.indent) {\n combined = prev.indent;\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1);\n }\n\n combined.push(before.column);\n }\n\n indent = combined.concat(indent);\n }\n\n node.position.indent = indent || [];\n\n return node;\n }\n }","function position() {\n var before = now();\n\n return update;\n\n /* Add the position to a node. */\n function update(node, indent) {\n var prev = node.position;\n var start = prev ? prev.start : before;\n var combined = [];\n var n = prev && prev.end.line;\n var l = before.line;\n\n node.position = new Position(start);\n\n /* If there was already a `position`, this\n * node was merged. Fixing `start` wasn’t\n * hard, but the indent is different.\n * Especially because some information, the\n * indent between `n` and `l` wasn’t\n * tracked. Luckily, that space is\n * (should be?) empty, so we can safely\n * check for it now. */\n if (prev && indent && prev.indent) {\n combined = prev.indent;\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1);\n }\n\n combined.push(before.column);\n }\n\n indent = combined.concat(indent);\n }\n\n node.position.indent = indent || [];\n\n return node;\n }\n }","function InsertNode() {}","insertAt(item, position) {\n if(this.head === null) {\n this.head = new _Node(item, this.head)\n }\n let currNode = this.head\n let count = 0\n while(count < position - 1) {\n currNode = currNode.next\n count++\n }\n currNode.next = new _Node(item, currNode.next)\n }","insert(pos, val) {\n const newNode = new LListNode(val, pos.current().getNext());\n pos.current().setNext(newNode);\n pos.next();\n return pos;\n }","addNode(node, outerDeco, innerDeco, view, pos) {\n this.top.children.splice(this.index++, 0, NodeViewDesc.create(this.top, node, outerDeco, innerDeco, view, pos));\n this.changed = true;\n }","function insertNode(text, position, parentNode, session) {\n var seed = session.seed();\n\n seed.setValue(text);\n parentNode.insert(seed, position);\n\n return seed;\n }","function insertNode(location, reference) {\n\tvar newNode = document.createElement('div');\n\tnewNode.className = 'node';\n\n\tif (location === 'before') {\n\t\tnodeList.insertBefore(newNode, reference);\n\t} else {\n\t\tnodeList.insertBefore(newNode, reference.nextSibling);\n\t}\n\t\n\tnewNode.innerHTML = nodeFiller;\n}","newPosition(position) {\n this.position = position;\n }","function positionNode(d) {\n // keep the node within the boundaries of the svg\n if (d.x < 0) {\n d.x = 0\n };\n if (d.y < 0) {\n d.y = 0\n };\n if (d.x > width) {\n d.x = width\n };\n if (d.y > height) {\n d.y = height\n };\n return \"translate(\" + d.x + \",\" + d.y + \")\";\n }","insert(pos, val){\r\n\r\n if(pos > this.length || pos < 0) return false;\r\n\r\n if(pos === this.length){\r\n this.push(val);\r\n }else if(pos === 0){\r\n this.unshift(val);\r\n }else{\r\n let selectedNode = this.getNode(pos-1);\r\n let oldNext = selectedNode.next;\r\n\r\n let newNode = new Node(val);\r\n selectedNode.next = newNode;\r\n newNode.next = oldNext; \r\n newNode.prev = selectedNode;\r\n selectedNode.prev = newNode;\r\n this.length += 1;\r\n }\r\n\r\n return true;\r\n\r\n }","function addNodeOnto(x,y,name){\n var index = node_dataOnto.length;\n node_dataOnto.push({x:x,y:y,name:name,index:index});\n refreshGraphOnto(node_dataOnto,link_dataOnto);\n}","function adjustNodeInsertPosition(root, nodeToInsert, position) {\n adjustSteps.forEach(function (handler) {\n position = handler(root, nodeToInsert, position);\n });\n return position;\n}","createNode(pos) {\n let newX;\n let newY;\n if (pos !== undefined) {\n newX = pos.x;\n newY = pos.y;\n }\n else {\n newX = this.cursorPosition.x;\n newY = this.cursorPosition.y;\n }\n return new Types_1.Node(\"0\", this.findLowestIDAvailable(), newX, newY, this.frozen, false);\n }","function addNode(){\n d.push(createNode(nodeCount));\n nodeCount++;\n}","function patch(node) {\n if (!node.position) {\n node.position = {}\n }\n}","function insertNodeAtPosition(head, data, position){ \n \tif(position == 0){\n \tconst to_insert = new LinkedListNode(data)\n \tto_insert.next = head\n head = to_insert\n return head\n }\n let count = 1\n let current = head\n while(count < position){\n \tcount++\n current = current.next\n\t}\n const to_insert = new LinkedListNode(data)\n to_insert.next = current.next\n current.next = to_insert\n \n current = head\n let result = \"\"\n while(current){\n \tresult += `${current.data} `\n \tcurrent = current.next\n }\n \n return head\n}","set position(value) {\n this.position$.next(value);\n }","get pos()\n\t{\n\t\treturn new NodeGraph.Position(this.x, this.y);\n\t}","insertAt(element, position){\n var head = this.head;\n var node = new Node(element);\n if(position <=0 || position>this.size+1)\n return;\n else if(position == 1){\n node.next = head;\n this.head = node;\n }\n else if(position == this.size+1){\n var current = this.head;\n while(current.next){\n current = current.next;\n }\n current.next = node;\n }\n else{\n var current = this.head;\n for(var i=1; i<position-1; i++){\n current = current.next;\n }\n var nextNode = current.next;\n node.next = current.next;\n current.next = node;\n\n }\n this.size++;\n\n }","insertAt(element, pos) {\n let nodeToInsert = new Node(element);\n let count = 0;\n let current = this.head;\n let previous;\n if (pos === 0) {\n nodeToInsert.next = this.head;\n this.head = nodeToInsert;\n } else if (pos == this.size) {\n while (count < pos) {\n previous = current;\n current = current.next;\n count++;\n }\n previous.next = nodeToInsert;\n }\n else {\n while (count < pos) {\n previous = current;\n current = current.next;\n count++;\n }\n nodeToInsert.next = previous.next;\n previous.next = nodeToInsert;\n this.size++;\n }\n }","function addNodeToCy(nodeText, x, y){\r\n\tif(x == undefined) x = 0;\r\n\tif(y == undefined) y = 0;\r\n\t\r\n\tif(hasSuperSubScript(nodeText)){\r\n\t\treturn insertSuperSubscript(nodeText, x, y);\r\n\t}\t\r\n\r\n\tnode = \t{ // node\" +\r\n\t\t\t\tdata: {name: nodeText/*, label_name: nodeText*/},\r\n\t\t\t\trenderedPosition: { x: x, y: y},\r\n\t\t\t\tclasses:['base']\r\n\t\t\t};\r\n\treturn cy.add(node);\r\n}","set position (newPosition) {\n this.emit('position', newPosition)\n this._position = newPosition * this.ticksPerSongPosition\n }","constructor($pos) {\n let node = $pos.nodeAfter;\n let $end = $pos.node(0).resolve($pos.pos + node.nodeSize);\n super($pos, $end);\n this.node = node;\n }","insertAt(position,item){\n \n if(this.head === null){\n this.insertFirst(item);\n }\n \n let ticker = 0;\n let currNode = this.head;\n let nextNode = this.head;\n \n while ((nextNode !== null) && (ticker !== position)) {\n //save the previous node \n currNode = nextNode;\n nextNode = currNode.next;\n ticker++;\n }\n \n currNode.next = new _Node(item,nextNode);\n \n }","function writePosition(x,y){\n //first refer to the point and set the value\n database.ref('ball/position').set({\n 'x':position.x+x,\n 'y':position.y+y\n })\n}","insert(position, element){\n if (position >= 0 && position < this.length){\n var node = new Node(element);\n var current = this.head;\n var previous;\n var counter = 0;\n // if adding element at the beginning of the list...\n if (position === 0){\n // push back the 1st element...\n node.next = current;\n // point head to inserted node\n this.head = node;\n } else {\n // loop thru til we reach the desired position...\n while (counter++ < position){\n previous = current;\n current = current.next;\n }\n // when finally bust out of the loop, CURRENT is referencing element after the position we would like to insert... (want to add new item b/w prev and current)\n // point previous.next to node && point node.next to current\n // make a link b/w the new item and current\n node.next = current;\n // change link b/w previous and current\n previous.next = node;\n }\n this.length++;\n return true;\n } else {\n return false;\n }\n }","function addPosition(x,y,positionArray) {\n var position={x,y};\n positionArray.push(position);\n}","setPosition(newX=this.x, newY=this.y) {\n this.x = newX;\n this.y = newY;\n this.updateEdges() // Update Edge positions\n this.setAnchorPostion(this, newX, newY); // Update DOM element\n }","insertAfterNode(e){this.startNode=e,this.endNode=e.nextSibling}","set pos(newPos) {\n this._pos = newPos;\n }","function addNode(val,x,y)\n{\n d3.select(`#node${val-1}`).remove();\n\n const svg = d3.select('svg');\n\n const g= svg.append('g')\n .attr('id',`node${val-1}`);\n\n const c = g.append('circle')\n .attr('cx',`${x}`)\n .attr('cy',`${y}`)\n .attr('r',25)\n .style('fill','#F5F2B8')\n .attr('stroke','#383F51')\n .attr('stroke-width','2px');\n\n const t =g.append('text')\n .attr('x',`${x}`)\n .attr('y',`${y}`)\n .text(val)\n .attr('fill','#383F51')\n .attr('alignment-baseline',\"central\")\n .attr('text-anchor','middle')\n .attr('font-size','20px')\n .style('font-weight','bold');\n\n}","function setCursorPositionInNode(node, pos)\n\t{\n\t\tvar sel, range;\n\t\tif (window.getSelection && document.createRange) {\n\t\t\trange = document.createRange();\n \t\t\trange.setEnd(node, pos);\n\t\t\trange.setStart(node, pos);\n\t\t\tsel = window.getSelection();\n\t\t\tsel.removeAllRanges();\n\t\t\tsel.addRange(range);\n\t\t} else if (document.body.createTextRange) {\n\t\t\trange = document.body.createTextRange();\n\t\t\trange.setEnd(node, pos);\n\t\t\trange.setStart(node, pos);\n\t\t\trange.select();\n\t\t}\n\t}","addAfter(value, position){\n\t\tif(!this.head) return this.add(value);\n\t\tif(this.length < position) return 'position does not exist';\n\t\tif(this.length === position) return this.add(value);\n\t\tlet newNode = new Node(value);\n\t\tlet aux, count = 1;\n\t\tlet current = this.head;\n\t\twhile(count <= position){\n\t\t\tcurrent = current.next\n\t\t\tcount++\n\t\t}\n\t\taux = current.next;\n\t\tnewNode.next = aux;\n\t\tcurrent.next = newNode;\n\t\tthis.length++;\n\t\treturn this;\n\t}","function setNode(pos, dist){\n\tif(nodeArray[pos] != start){\n\t\tnodeArray[pos].addDis('∞');\n\t}\n\n\tif(pos < nodeArray.length - 1){\n\t\tsetTimeout(function(){setNode(++pos, dist);}, 50);\n\t\t// setTimeout(function(){alert(pos);}, 1000);\n\t}\n\n\tif (pos == nodeArray.length - 1) {\n\t\tdijkstraHelp(null, q, [], dist);\n\t};\n}","insertAfterNode(ref){this.startNode=ref;this.endNode=ref.nextSibling}","updatePosition(position) {\n if (position == null)\n return;\n const positionNodes = parseExpressions(position)[0].terms;\n for (let i = 0; i < 3; ++i) {\n this.position.setComponent(i, normalizeUnit(positionNodes[i]).number);\n }\n }","newPosition(x, y)\n {\n this.x = x;\n this.y = y;\n }","function append(node, item, offset) {\n\n\t\titem.offset = ++offset;\n\t\tsiblingIndex.add(item);\n\t\tnode.children.push(item);\n\t\titem.parent = node;\n\t\titem.id = id++;\n\t\ttree.push(item);\n\n\t}","function pointAt(node){\n var parent = node.parentNode;\n var next = node.nextSibling;\n return function(newnode) {\n parent.insertBefore(newnode, next);\n };\n }","updatePosition(position) {\n if (position == null)\n return;\n const positionNodes = parseExpressions(position)[0].terms;\n for (let i = 0; i < 3; ++i) {\n this.position.setComponent(i, normalizeUnit(positionNodes[i]).number);\n }\n this.updateMatrixWorld();\n }","insertAfterNode(ref) {\n this.startNode = ref;\n this.endNode = ref.nextSibling;\n }","function addNode(x,y,radius,nodeColor,nodeName)\r\n{\r\n\r\n\tnodeText[nodeString.length]='<text x=\"'+(x-4.3*nodeName.length)+'\" y=\"'+(y+2*radius)+'\" fill=\"white\">'+nodeName+'</text>';\r\n\tnodeString[nodeString.length]='<circle cx=\"'+x+'\" cy=\"'+y+'\" r=\"'+radius+'\" stroke=\"white\" stroke-width=\"1\" fill=\"'+nodeColor+'\" onmouseover=\"changeNodeInformation('+nodeString.length+')\" onClick=\"nodeClickHandle('+nodeString.length+')\" />';\r\n}","function updateNodePositions() {\n // set node positions\n rect.attr('transform', function (d) {\n return 'translate(' + d.x + ',' + d.y + ')';\n });\n}","addValue(val) {\n let n = new Node(val);\n if (this.root == null) {\n this.root = n;\n // An initial position for the root node\n this.root.x = width / 2;\n this.root.y = 16;\n } else {\n this.root.addNode(n);\n }\n }","function position() {\n var start = {line: lineno, column: column}\n return function(node) {\n node.position = new Position(start)\n whitespace()\n return node\n }\n }","function createNodes(node, positionX, positionY, val = 0){\n let newVal = val + int(node.freq);\n circles.push([positionX, positionY, node.freq, node.symbol]);\n \n if(node.left !== null){\n createNodes(node.left, positionX - 100, positionY + 100, newVal);\n lines.push([positionX, positionY, positionX - 100, positionY + 100]);\n } \n \n if(node.right !== null){\n createNodes(node.right, positionX + 100, positionY + 100, newVal)\n lines.push([positionX, positionY, positionX + 100, positionY + 100]);\n }\n \n}","function insertPositions() {\n $.each(rankingData, function(index, value) {\n rankingData[index].position = index + 1;\n });\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","add_node (node) {\n this.socket.emit('add_node', {\n nodeId: node.nodeId,\n iport: node.iport\n });\n }","addAt(index, data) {\n var node = new Node(data);\n\n if (index < 0 || index > this.size) {\n console.log(\"this index \" + index + \"th position is not from current list position 0 to \" + this. size);\n this.size--;\n }else if (index == 0) {\n this.addStart(data);\n this.size--;\n }else if (index == this.size) {\n this.add(data);\n this.size--;\n }else {\n var temp = this.head;\n for (var i = 0; i < index - 1; i++) {\n temp = temp.next;\n }\n\n //updating new nodes pointer to next node\n node.next = temp.next;\n //updating previous node's pointer to new node\n temp.next = node;\n }\n this.size++;\n }","function position(pos) {\n log.innerHTML = pos\n }","insertAfterNode(ref){this.startNode=ref;this.endNode=ref.nextSibling;}","function position() {\n\t var start = { line: lineno, column: column };\n\t return function(node){\n\t node.position = new Position(start);\n\t whitespace();\n\t return node;\n\t };\n\t }","insertAfterNode(ref) {\n this.startNode = ref;\n this.endNode = ref.nextSibling;\n }","insertAfterNode(ref) {\n this.startNode = ref;\n this.endNode = ref.nextSibling;\n }","insertAfterNode(ref) {\n this.startNode = ref;\n this.endNode = ref.nextSibling;\n }","insertAfterNode(ref) {\n this.startNode = ref;\n this.endNode = ref.nextSibling;\n }","insertAfterNode(ref) {\n this.startNode = ref;\n this.endNode = ref.nextSibling;\n }","set x(nx){\n\t\tthis.position.nx = nx;\n\t}","setNodeColumn() {\n const node = this;\n if (!defined(node.options.column)) {\n // No links to this node, place it left\n if (node.linksTo.length === 0) {\n node.column = 0;\n }\n else {\n node.column = node.getFromNode().fromColumn + 1;\n }\n }\n }","pushNewPos(x, y, stack)\n\t{\n\t\tconsole.log (\"==> \", x, \", \", y);\n let npos = new Position();\n\t\tnpos.setx(x);\n\t\tnpos.sety(y);\n\t\tif (this.maze.validPosition(x,y))\n\t\t\tstack.push(npos);\n\t}","setPosition(x, y) {\n this.pos.x = x;\n this.pos.y = y;\n }","insert(index, val) {\n // check if the index less than zero ang greater than the length.\n if(index < 0 || index > this.length) {\n return false;\n }\n // if the index is the same as length use push.\n if(index === this.length){\n this.push(val);\n return true;\n }\n // if the index is zero use unshift. \n if(index === 0) {\n this.unshift(val);\n return true;\n }\n // get the node at the target position\n let targetNode = this.get(index);\n // find the node before the target index.\n let beforeTargetNode = this.get(index - 1);\n // Create new Node with val. \n let newNode = new Node(val);\n // set the next prop on the node be the new node. \n newNode.next = targetNode;\n // set the before target node next prop to the new Node. \n beforeTargetNode.next = newNode;\n // increment the length\n this.length++;\n\n // return true.\n return true;\n }","function insertOrAppend(container, pos, el) {\n var childs = container.childNodes;\n if (pos < childs.length) {\n var refNode = childs[pos];\n container.insertBefore(el, refNode);\n } else {\n container.appendChild(el);\n }\n }","addNode(x, y, text, rx = 20, ry = 20) {\n let node = new Node(x, y, rx, ry, text);\n this.root.appendChild(node.root);\n this.nodes.push(node);\n return node;\n }","insertNode(editor, node) {\n editor.insertNode(node);\n }","insertNode(editor, node) {\n editor.insertNode(node);\n }","function position() {\n const start = {\n line: lineno,\n column\n };\n return function (node) {\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function insert(n, p, x1, y1, x2, y2) {\n if (isNaN(p.x) || isNaN(p.y)) return; // ignore invalid points\n if (n.leaf) {\n var v = n.point;\n if (v) {\n // If the point at this leaf node is at the same position as the new\n // point we are adding, we leave the point associated with the\n // internal node while adding the new point to a child node. This\n // avoids infinite recursion.\n if ((Math.abs(v.x - p.x) + Math.abs(v.y - p.y)) < .01) {\n insertChild(n, p, x1, y1, x2, y2);\n } else {\n n.point = null;\n insertChild(n, v, x1, y1, x2, y2);\n insertChild(n, p, x1, y1, x2, y2);\n }\n } else {\n n.point = p;\n }\n } else {\n insertChild(n, p, x1, y1, x2, y2);\n }\n }","function insert(n, p, x1, y1, x2, y2) {\n if (isNaN(p.x) || isNaN(p.y)) return; // ignore invalid points\n if (n.leaf) {\n var v = n.point;\n if (v) {\n // If the point at this leaf node is at the same position as the new\n // point we are adding, we leave the point associated with the\n // internal node while adding the new point to a child node. This\n // avoids infinite recursion.\n if ((Math.abs(v.x - p.x) + Math.abs(v.y - p.y)) < .01) {\n insertChild(n, p, x1, y1, x2, y2);\n } else {\n n.point = null;\n insertChild(n, v, x1, y1, x2, y2);\n insertChild(n, p, x1, y1, x2, y2);\n }\n } else {\n n.point = p;\n }\n } else {\n insertChild(n, p, x1, y1, x2, y2);\n }\n }","setPosition(x, y) {\n this.x = x\n this.y = y\n }","insertAfterNode(ref) {\n this.startNode = ref;\n this.endNode = ref.nextSibling;\n }","setPosition(position) {\n this.position = position;\n }","insert(element, position) {\n // check for out-of-bounds values\n if(index >= 0 && index <= this.count) { \n const node = new Node(element);\n // change the head reference to node and add a new element to the list\n if(index === 0) { \n node.next = current; \n this.head = node;\n // to loop through the list until the desired position\n } else {\n const previous = this.getElementAt(index - 1);\n node.next = previous.next; // to link the new node and the current\n previous.next = node; \n }\n this.count++;\n return true;\n }\n return false;\n }","insertCell(x, y) {\n this.root.insert(x, y);\n }","function ParticleRotateToPositionNode(mode /*uint*/, position) {\n if (position === void 0) { position = null; }\n _super.call(this, \"ParticleRotateToPosition\", mode, 3, 3);\n this._pStateClass = ParticleRotateToPositionState;\n this._iPosition = position || new Vector3D();\n }","function addNode() {\r\n\t\t\t\t\t\t\t// removeId(root);\r\n\r\n\t\t\t\t\t\t\tvar newNode = {};\r\n\t\t\t\t\t\t\tnewNode.name = \"Node\"\r\n\t\t\t\t\t\t\t\t\t+ Math.floor((Math.random() * 100) + 1);\r\n\t\t\t\t\t\t\tnewNode.VALUE = 100;\r\n\t\t\t\t\t\t\tvar component = root[\"children\"]; // considering\r\n\t\t\t\t\t\t\t// component\r\n\t\t\t\t\t\t\t// node to add\r\n\t\t\t\t\t\t\t// new nodes as\r\n\t\t\t\t\t\t\t// a test.\r\n\t\t\t\t\t\t\tcomponent.push(newNode);\r\n\t\t\t\t\t\t\tgeneratedNodesIdx.push(component.length - 1);// tracking\r\n\t\t\t\t\t\t\t// newly\r\n\t\t\t\t\t\t\t// generated\r\n\t\t\t\t\t\t\t// nodes\r\n\t\t\t\t\t\t\t// to\r\n\t\t\t\t\t\t\t// remove\r\n\t\t\t\t\t\t\tupdate();\r\n\t\t\t\t\t\t}","setPosition(x, y) {\n this.x = x;\n this.y = y;\n }","function updatePosition() {\r\n\t\t\tcircle.attr('transform', `translate(${point.x * graph.cell_size + graph.offset.x} ${point.y * graph.cell_size + graph.offset.y})`);\r\n\t\t}"],"string":"[\n \"function add (node, parent) {\\n parent.children.push(node)\\n if (parser.position) {\\n parent.position = {\\n start: parent.children[0].position.start,\\n end: node.position.end\\n }\\n }\\n }\",\n \"addPosition(pos) {\\n this.positions += '=\\\"'+pos.line + ':' + pos.linePosition + '\\\",';\\n }\",\n \"assignPosition(node, position) {\\n\\t\\tif(node.parentNode && position<node.parentNode.position){\\n\\t\\t\\tposition = node.parentNode.position;\\n\\t\\t}\\n\\t\\twhile(this.positionMap.get(`${node.level},${position}`)){\\n\\t\\t\\tposition++;\\n\\t\\t}\\n\\t\\tnode.position = position;\\n\\t\\tthis.positionMap.set(`${node.level},${position}`, true);\\n\\t\\tfor(var i in node.children){\\n\\t\\t\\tthis.assignPosition(node.children[i], position+Number(i));\\n\\t\\t}\\n\\t}\",\n \"assignPosition(node, position) {\\n // update the position of the node\\n node.position = position;\\n \\n // the base case\\n if (node.children.length === 0)\\n {\\n leafNodeCounter = leafNodeCounter + 1;\\n return node;\\n }\\n // recursive case\\n else\\n {\\n leafNodeCounter = 0;\\n for (var d = 0; d < node.children.length; d++)\\n {\\n // this is a really bad hack and there is definitely something better out there. \\n // However, it gets the job done\\n if (node.children[d].name === \\\"Protosomes\\\")\\n {\\n leafNodeCounter = leafNodeCounter + 2;\\n }\\n\\n this.assignPosition(node.children[d], node.position + leafNodeCounter);\\n }\\n }\\n\\n }\",\n \"setNodePosition(Pos, node) {\\n let currrentNode = this.nodes.find(n => n === node);\\n currrentNode.x = Pos.x;\\n currrentNode.y = Pos.y;\\n }\",\n \"SetNewPositionToANode(registeredPos) {\\n this.setNodePosition(registeredPos.newValue, registeredPos.element);\\n }\",\n \"function positionTokenAtNode(token, node) {\\n // these details depend on the node template\\n token.location = node.position.copy().offset(4 + 6, 5 + 6);\\n }\",\n \"insertAtPosition(position, nodeToInsert) {\\n if(position > this.length + 1 || !position || !nodeToInsert)\\n return\\n\\n if(position === 1) {\\n this.setHead(nodeToInsert)\\n return\\n }\\n\\n let curr = this.head, currPost = 1\\n while(curr && currPost++ < position)\\n curr = curr.next\\n\\n if(curr) this.insertBefore(curr, nodeToInsert)\\n else this.setTail(nodeToInsert)\\n\\n }\",\n \"insertIn(position, value) {\\n if (position < 0 || \\n position > this.length) {\\n\\n console.error(\\\"Position is out of range! \\\", position)\\n return null;\\n }\\n\\n let node = new Node(value);\\n\\n if (position === 0) {\\n\\n node.next = this.head;\\n this.head = node;\\n\\n } else {\\n let current = this.head,\\n prev = null,\\n index = 0;\\n\\n while (index < position) {\\n prev = current;\\n current = current.next;\\n index ++;\\n }\\n\\n prev.next = node;\\n node.next = current;\\n }\\n\\n this.length++;\\n\\n }\",\n \"pushPosition(position) {\\n\\t\\tthis.positionContainer.push(position);\\n\\t}\",\n \"function position() {\\n var before = now()\\n\\n return update\\n\\n // Add the position to a node.\\n function update(node, indent) {\\n var previous = node.position\\n var start = previous ? previous.start : before\\n var combined = []\\n var n = previous && previous.end.line\\n var l = before.line\\n\\n node.position = new Position(start)\\n\\n // If there was already a `position`, this node was merged. Fixing\\n // `start` wasn’t hard, but the indent is different. Especially\\n // because some information, the indent between `n` and `l` wasn’t\\n // tracked. Luckily, that space is (should be?) empty, so we can\\n // safely check for it now.\\n if (previous && indent && previous.indent) {\\n combined = previous.indent\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1)\\n }\\n\\n combined.push(before.column)\\n }\\n\\n indent = combined.concat(indent)\\n }\\n\\n node.position.indent = indent || []\\n\\n return node\\n }\\n }\",\n \"insertAfter(position, data) {\\n /*\\n `position === -1` means we are adding the node before the head,\\n hence, our `head` should be changed\\n */\\n if (position === -1) {\\n let newNode = new ListNode(data)\\n newNode.next = this.head\\n this.head = newNode\\n return\\n }\\n\\n let currentNode = this.find(position)\\n\\n if (currentNode) {\\n let newNode = new ListNode(data)\\n newNode.next = currentNode.next\\n currentNode.next = newNode\\n } else {\\n throw new Error(`Cannot insert at position ${position + 1}: unreachable position!`)\\n }\\n }\",\n \"function addNode(){\\n\\n if (!CONST.nodeEditingEnabled)\\n return;\\n // prevent I-bar on drag\\n //d3.event.preventDefault();\\n\\n // because :active only works in WebKit?\\n svg.classed('active', true);\\n\\n if(d3.event.ctrlKey || mousedown_node || mousedown_link) return;\\n\\n // insert new node at point\\n var point = d3.mouse(this),\\n node = {id: 'ID' + ++lastNodeId, reflexive: false};\\n node.x = point[0];\\n node.y = point[1];\\n nodes.push(node);\\n\\n showMsg('New node is added', 'success');\\n restart();\\n }\",\n \"function position() {\\n var before = now();\\n\\n return update;\\n\\n /* Add the position to a node. */\\n function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\\n }\",\n \"function position() {\\n var before = now();\\n\\n return update;\\n\\n /* Add the position to a node. */\\n function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\\n }\",\n \"function position() {\\n var before = now();\\n\\n return update;\\n\\n /* Add the position to a node. */\\n function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\\n }\",\n \"function position() {\\n var before = now();\\n\\n return update;\\n\\n /* Add the position to a node. */\\n function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\\n }\",\n \"function position() {\\n var before = now();\\n\\n return update;\\n\\n /* Add the position to a node. */\\n function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\\n }\",\n \"function InsertNode() {}\",\n \"insertAt(item, position) {\\n if(this.head === null) {\\n this.head = new _Node(item, this.head)\\n }\\n let currNode = this.head\\n let count = 0\\n while(count < position - 1) {\\n currNode = currNode.next\\n count++\\n }\\n currNode.next = new _Node(item, currNode.next)\\n }\",\n \"insert(pos, val) {\\n const newNode = new LListNode(val, pos.current().getNext());\\n pos.current().setNext(newNode);\\n pos.next();\\n return pos;\\n }\",\n \"addNode(node, outerDeco, innerDeco, view, pos) {\\n this.top.children.splice(this.index++, 0, NodeViewDesc.create(this.top, node, outerDeco, innerDeco, view, pos));\\n this.changed = true;\\n }\",\n \"function insertNode(text, position, parentNode, session) {\\n var seed = session.seed();\\n\\n seed.setValue(text);\\n parentNode.insert(seed, position);\\n\\n return seed;\\n }\",\n \"function insertNode(location, reference) {\\n\\tvar newNode = document.createElement('div');\\n\\tnewNode.className = 'node';\\n\\n\\tif (location === 'before') {\\n\\t\\tnodeList.insertBefore(newNode, reference);\\n\\t} else {\\n\\t\\tnodeList.insertBefore(newNode, reference.nextSibling);\\n\\t}\\n\\t\\n\\tnewNode.innerHTML = nodeFiller;\\n}\",\n \"newPosition(position) {\\n this.position = position;\\n }\",\n \"function positionNode(d) {\\n // keep the node within the boundaries of the svg\\n if (d.x < 0) {\\n d.x = 0\\n };\\n if (d.y < 0) {\\n d.y = 0\\n };\\n if (d.x > width) {\\n d.x = width\\n };\\n if (d.y > height) {\\n d.y = height\\n };\\n return \\\"translate(\\\" + d.x + \\\",\\\" + d.y + \\\")\\\";\\n }\",\n \"insert(pos, val){\\r\\n\\r\\n if(pos > this.length || pos < 0) return false;\\r\\n\\r\\n if(pos === this.length){\\r\\n this.push(val);\\r\\n }else if(pos === 0){\\r\\n this.unshift(val);\\r\\n }else{\\r\\n let selectedNode = this.getNode(pos-1);\\r\\n let oldNext = selectedNode.next;\\r\\n\\r\\n let newNode = new Node(val);\\r\\n selectedNode.next = newNode;\\r\\n newNode.next = oldNext; \\r\\n newNode.prev = selectedNode;\\r\\n selectedNode.prev = newNode;\\r\\n this.length += 1;\\r\\n }\\r\\n\\r\\n return true;\\r\\n\\r\\n }\",\n \"function addNodeOnto(x,y,name){\\n var index = node_dataOnto.length;\\n node_dataOnto.push({x:x,y:y,name:name,index:index});\\n refreshGraphOnto(node_dataOnto,link_dataOnto);\\n}\",\n \"function adjustNodeInsertPosition(root, nodeToInsert, position) {\\n adjustSteps.forEach(function (handler) {\\n position = handler(root, nodeToInsert, position);\\n });\\n return position;\\n}\",\n \"createNode(pos) {\\n let newX;\\n let newY;\\n if (pos !== undefined) {\\n newX = pos.x;\\n newY = pos.y;\\n }\\n else {\\n newX = this.cursorPosition.x;\\n newY = this.cursorPosition.y;\\n }\\n return new Types_1.Node(\\\"0\\\", this.findLowestIDAvailable(), newX, newY, this.frozen, false);\\n }\",\n \"function addNode(){\\n d.push(createNode(nodeCount));\\n nodeCount++;\\n}\",\n \"function patch(node) {\\n if (!node.position) {\\n node.position = {}\\n }\\n}\",\n \"function insertNodeAtPosition(head, data, position){ \\n \\tif(position == 0){\\n \\tconst to_insert = new LinkedListNode(data)\\n \\tto_insert.next = head\\n head = to_insert\\n return head\\n }\\n let count = 1\\n let current = head\\n while(count < position){\\n \\tcount++\\n current = current.next\\n\\t}\\n const to_insert = new LinkedListNode(data)\\n to_insert.next = current.next\\n current.next = to_insert\\n \\n current = head\\n let result = \\\"\\\"\\n while(current){\\n \\tresult += `${current.data} `\\n \\tcurrent = current.next\\n }\\n \\n return head\\n}\",\n \"set position(value) {\\n this.position$.next(value);\\n }\",\n \"get pos()\\n\\t{\\n\\t\\treturn new NodeGraph.Position(this.x, this.y);\\n\\t}\",\n \"insertAt(element, position){\\n var head = this.head;\\n var node = new Node(element);\\n if(position <=0 || position>this.size+1)\\n return;\\n else if(position == 1){\\n node.next = head;\\n this.head = node;\\n }\\n else if(position == this.size+1){\\n var current = this.head;\\n while(current.next){\\n current = current.next;\\n }\\n current.next = node;\\n }\\n else{\\n var current = this.head;\\n for(var i=1; i<position-1; i++){\\n current = current.next;\\n }\\n var nextNode = current.next;\\n node.next = current.next;\\n current.next = node;\\n\\n }\\n this.size++;\\n\\n }\",\n \"insertAt(element, pos) {\\n let nodeToInsert = new Node(element);\\n let count = 0;\\n let current = this.head;\\n let previous;\\n if (pos === 0) {\\n nodeToInsert.next = this.head;\\n this.head = nodeToInsert;\\n } else if (pos == this.size) {\\n while (count < pos) {\\n previous = current;\\n current = current.next;\\n count++;\\n }\\n previous.next = nodeToInsert;\\n }\\n else {\\n while (count < pos) {\\n previous = current;\\n current = current.next;\\n count++;\\n }\\n nodeToInsert.next = previous.next;\\n previous.next = nodeToInsert;\\n this.size++;\\n }\\n }\",\n \"function addNodeToCy(nodeText, x, y){\\r\\n\\tif(x == undefined) x = 0;\\r\\n\\tif(y == undefined) y = 0;\\r\\n\\t\\r\\n\\tif(hasSuperSubScript(nodeText)){\\r\\n\\t\\treturn insertSuperSubscript(nodeText, x, y);\\r\\n\\t}\\t\\r\\n\\r\\n\\tnode = \\t{ // node\\\" +\\r\\n\\t\\t\\t\\tdata: {name: nodeText/*, label_name: nodeText*/},\\r\\n\\t\\t\\t\\trenderedPosition: { x: x, y: y},\\r\\n\\t\\t\\t\\tclasses:['base']\\r\\n\\t\\t\\t};\\r\\n\\treturn cy.add(node);\\r\\n}\",\n \"set position (newPosition) {\\n this.emit('position', newPosition)\\n this._position = newPosition * this.ticksPerSongPosition\\n }\",\n \"constructor($pos) {\\n let node = $pos.nodeAfter;\\n let $end = $pos.node(0).resolve($pos.pos + node.nodeSize);\\n super($pos, $end);\\n this.node = node;\\n }\",\n \"insertAt(position,item){\\n \\n if(this.head === null){\\n this.insertFirst(item);\\n }\\n \\n let ticker = 0;\\n let currNode = this.head;\\n let nextNode = this.head;\\n \\n while ((nextNode !== null) && (ticker !== position)) {\\n //save the previous node \\n currNode = nextNode;\\n nextNode = currNode.next;\\n ticker++;\\n }\\n \\n currNode.next = new _Node(item,nextNode);\\n \\n }\",\n \"function writePosition(x,y){\\n //first refer to the point and set the value\\n database.ref('ball/position').set({\\n 'x':position.x+x,\\n 'y':position.y+y\\n })\\n}\",\n \"insert(position, element){\\n if (position >= 0 && position < this.length){\\n var node = new Node(element);\\n var current = this.head;\\n var previous;\\n var counter = 0;\\n // if adding element at the beginning of the list...\\n if (position === 0){\\n // push back the 1st element...\\n node.next = current;\\n // point head to inserted node\\n this.head = node;\\n } else {\\n // loop thru til we reach the desired position...\\n while (counter++ < position){\\n previous = current;\\n current = current.next;\\n }\\n // when finally bust out of the loop, CURRENT is referencing element after the position we would like to insert... (want to add new item b/w prev and current)\\n // point previous.next to node && point node.next to current\\n // make a link b/w the new item and current\\n node.next = current;\\n // change link b/w previous and current\\n previous.next = node;\\n }\\n this.length++;\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"function addPosition(x,y,positionArray) {\\n var position={x,y};\\n positionArray.push(position);\\n}\",\n \"setPosition(newX=this.x, newY=this.y) {\\n this.x = newX;\\n this.y = newY;\\n this.updateEdges() // Update Edge positions\\n this.setAnchorPostion(this, newX, newY); // Update DOM element\\n }\",\n \"insertAfterNode(e){this.startNode=e,this.endNode=e.nextSibling}\",\n \"set pos(newPos) {\\n this._pos = newPos;\\n }\",\n \"function addNode(val,x,y)\\n{\\n d3.select(`#node${val-1}`).remove();\\n\\n const svg = d3.select('svg');\\n\\n const g= svg.append('g')\\n .attr('id',`node${val-1}`);\\n\\n const c = g.append('circle')\\n .attr('cx',`${x}`)\\n .attr('cy',`${y}`)\\n .attr('r',25)\\n .style('fill','#F5F2B8')\\n .attr('stroke','#383F51')\\n .attr('stroke-width','2px');\\n\\n const t =g.append('text')\\n .attr('x',`${x}`)\\n .attr('y',`${y}`)\\n .text(val)\\n .attr('fill','#383F51')\\n .attr('alignment-baseline',\\\"central\\\")\\n .attr('text-anchor','middle')\\n .attr('font-size','20px')\\n .style('font-weight','bold');\\n\\n}\",\n \"function setCursorPositionInNode(node, pos)\\n\\t{\\n\\t\\tvar sel, range;\\n\\t\\tif (window.getSelection && document.createRange) {\\n\\t\\t\\trange = document.createRange();\\n \\t\\t\\trange.setEnd(node, pos);\\n\\t\\t\\trange.setStart(node, pos);\\n\\t\\t\\tsel = window.getSelection();\\n\\t\\t\\tsel.removeAllRanges();\\n\\t\\t\\tsel.addRange(range);\\n\\t\\t} else if (document.body.createTextRange) {\\n\\t\\t\\trange = document.body.createTextRange();\\n\\t\\t\\trange.setEnd(node, pos);\\n\\t\\t\\trange.setStart(node, pos);\\n\\t\\t\\trange.select();\\n\\t\\t}\\n\\t}\",\n \"addAfter(value, position){\\n\\t\\tif(!this.head) return this.add(value);\\n\\t\\tif(this.length < position) return 'position does not exist';\\n\\t\\tif(this.length === position) return this.add(value);\\n\\t\\tlet newNode = new Node(value);\\n\\t\\tlet aux, count = 1;\\n\\t\\tlet current = this.head;\\n\\t\\twhile(count <= position){\\n\\t\\t\\tcurrent = current.next\\n\\t\\t\\tcount++\\n\\t\\t}\\n\\t\\taux = current.next;\\n\\t\\tnewNode.next = aux;\\n\\t\\tcurrent.next = newNode;\\n\\t\\tthis.length++;\\n\\t\\treturn this;\\n\\t}\",\n \"function setNode(pos, dist){\\n\\tif(nodeArray[pos] != start){\\n\\t\\tnodeArray[pos].addDis('∞');\\n\\t}\\n\\n\\tif(pos < nodeArray.length - 1){\\n\\t\\tsetTimeout(function(){setNode(++pos, dist);}, 50);\\n\\t\\t// setTimeout(function(){alert(pos);}, 1000);\\n\\t}\\n\\n\\tif (pos == nodeArray.length - 1) {\\n\\t\\tdijkstraHelp(null, q, [], dist);\\n\\t};\\n}\",\n \"insertAfterNode(ref){this.startNode=ref;this.endNode=ref.nextSibling}\",\n \"updatePosition(position) {\\n if (position == null)\\n return;\\n const positionNodes = parseExpressions(position)[0].terms;\\n for (let i = 0; i < 3; ++i) {\\n this.position.setComponent(i, normalizeUnit(positionNodes[i]).number);\\n }\\n }\",\n \"newPosition(x, y)\\n {\\n this.x = x;\\n this.y = y;\\n }\",\n \"function append(node, item, offset) {\\n\\n\\t\\titem.offset = ++offset;\\n\\t\\tsiblingIndex.add(item);\\n\\t\\tnode.children.push(item);\\n\\t\\titem.parent = node;\\n\\t\\titem.id = id++;\\n\\t\\ttree.push(item);\\n\\n\\t}\",\n \"function pointAt(node){\\n var parent = node.parentNode;\\n var next = node.nextSibling;\\n return function(newnode) {\\n parent.insertBefore(newnode, next);\\n };\\n }\",\n \"updatePosition(position) {\\n if (position == null)\\n return;\\n const positionNodes = parseExpressions(position)[0].terms;\\n for (let i = 0; i < 3; ++i) {\\n this.position.setComponent(i, normalizeUnit(positionNodes[i]).number);\\n }\\n this.updateMatrixWorld();\\n }\",\n \"insertAfterNode(ref) {\\n this.startNode = ref;\\n this.endNode = ref.nextSibling;\\n }\",\n \"function addNode(x,y,radius,nodeColor,nodeName)\\r\\n{\\r\\n\\r\\n\\tnodeText[nodeString.length]='<text x=\\\"'+(x-4.3*nodeName.length)+'\\\" y=\\\"'+(y+2*radius)+'\\\" fill=\\\"white\\\">'+nodeName+'</text>';\\r\\n\\tnodeString[nodeString.length]='<circle cx=\\\"'+x+'\\\" cy=\\\"'+y+'\\\" r=\\\"'+radius+'\\\" stroke=\\\"white\\\" stroke-width=\\\"1\\\" fill=\\\"'+nodeColor+'\\\" onmouseover=\\\"changeNodeInformation('+nodeString.length+')\\\" onClick=\\\"nodeClickHandle('+nodeString.length+')\\\" />';\\r\\n}\",\n \"function updateNodePositions() {\\n // set node positions\\n rect.attr('transform', function (d) {\\n return 'translate(' + d.x + ',' + d.y + ')';\\n });\\n}\",\n \"addValue(val) {\\n let n = new Node(val);\\n if (this.root == null) {\\n this.root = n;\\n // An initial position for the root node\\n this.root.x = width / 2;\\n this.root.y = 16;\\n } else {\\n this.root.addNode(n);\\n }\\n }\",\n \"function position() {\\n var start = {line: lineno, column: column}\\n return function(node) {\\n node.position = new Position(start)\\n whitespace()\\n return node\\n }\\n }\",\n \"function createNodes(node, positionX, positionY, val = 0){\\n let newVal = val + int(node.freq);\\n circles.push([positionX, positionY, node.freq, node.symbol]);\\n \\n if(node.left !== null){\\n createNodes(node.left, positionX - 100, positionY + 100, newVal);\\n lines.push([positionX, positionY, positionX - 100, positionY + 100]);\\n } \\n \\n if(node.right !== null){\\n createNodes(node.right, positionX + 100, positionY + 100, newVal)\\n lines.push([positionX, positionY, positionX + 100, positionY + 100]);\\n }\\n \\n}\",\n \"function insertPositions() {\\n $.each(rankingData, function(index, value) {\\n rankingData[index].position = index + 1;\\n });\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"add_node (node) {\\n this.socket.emit('add_node', {\\n nodeId: node.nodeId,\\n iport: node.iport\\n });\\n }\",\n \"addAt(index, data) {\\n var node = new Node(data);\\n\\n if (index < 0 || index > this.size) {\\n console.log(\\\"this index \\\" + index + \\\"th position is not from current list position 0 to \\\" + this. size);\\n this.size--;\\n }else if (index == 0) {\\n this.addStart(data);\\n this.size--;\\n }else if (index == this.size) {\\n this.add(data);\\n this.size--;\\n }else {\\n var temp = this.head;\\n for (var i = 0; i < index - 1; i++) {\\n temp = temp.next;\\n }\\n\\n //updating new nodes pointer to next node\\n node.next = temp.next;\\n //updating previous node's pointer to new node\\n temp.next = node;\\n }\\n this.size++;\\n }\",\n \"function position(pos) {\\n log.innerHTML = pos\\n }\",\n \"insertAfterNode(ref){this.startNode=ref;this.endNode=ref.nextSibling;}\",\n \"function position() {\\n\\t var start = { line: lineno, column: column };\\n\\t return function(node){\\n\\t node.position = new Position(start);\\n\\t whitespace();\\n\\t return node;\\n\\t };\\n\\t }\",\n \"insertAfterNode(ref) {\\n this.startNode = ref;\\n this.endNode = ref.nextSibling;\\n }\",\n \"insertAfterNode(ref) {\\n this.startNode = ref;\\n this.endNode = ref.nextSibling;\\n }\",\n \"insertAfterNode(ref) {\\n this.startNode = ref;\\n this.endNode = ref.nextSibling;\\n }\",\n \"insertAfterNode(ref) {\\n this.startNode = ref;\\n this.endNode = ref.nextSibling;\\n }\",\n \"insertAfterNode(ref) {\\n this.startNode = ref;\\n this.endNode = ref.nextSibling;\\n }\",\n \"set x(nx){\\n\\t\\tthis.position.nx = nx;\\n\\t}\",\n \"setNodeColumn() {\\n const node = this;\\n if (!defined(node.options.column)) {\\n // No links to this node, place it left\\n if (node.linksTo.length === 0) {\\n node.column = 0;\\n }\\n else {\\n node.column = node.getFromNode().fromColumn + 1;\\n }\\n }\\n }\",\n \"pushNewPos(x, y, stack)\\n\\t{\\n\\t\\tconsole.log (\\\"==> \\\", x, \\\", \\\", y);\\n let npos = new Position();\\n\\t\\tnpos.setx(x);\\n\\t\\tnpos.sety(y);\\n\\t\\tif (this.maze.validPosition(x,y))\\n\\t\\t\\tstack.push(npos);\\n\\t}\",\n \"setPosition(x, y) {\\n this.pos.x = x;\\n this.pos.y = y;\\n }\",\n \"insert(index, val) {\\n // check if the index less than zero ang greater than the length.\\n if(index < 0 || index > this.length) {\\n return false;\\n }\\n // if the index is the same as length use push.\\n if(index === this.length){\\n this.push(val);\\n return true;\\n }\\n // if the index is zero use unshift. \\n if(index === 0) {\\n this.unshift(val);\\n return true;\\n }\\n // get the node at the target position\\n let targetNode = this.get(index);\\n // find the node before the target index.\\n let beforeTargetNode = this.get(index - 1);\\n // Create new Node with val. \\n let newNode = new Node(val);\\n // set the next prop on the node be the new node. \\n newNode.next = targetNode;\\n // set the before target node next prop to the new Node. \\n beforeTargetNode.next = newNode;\\n // increment the length\\n this.length++;\\n\\n // return true.\\n return true;\\n }\",\n \"function insertOrAppend(container, pos, el) {\\n var childs = container.childNodes;\\n if (pos < childs.length) {\\n var refNode = childs[pos];\\n container.insertBefore(el, refNode);\\n } else {\\n container.appendChild(el);\\n }\\n }\",\n \"addNode(x, y, text, rx = 20, ry = 20) {\\n let node = new Node(x, y, rx, ry, text);\\n this.root.appendChild(node.root);\\n this.nodes.push(node);\\n return node;\\n }\",\n \"insertNode(editor, node) {\\n editor.insertNode(node);\\n }\",\n \"insertNode(editor, node) {\\n editor.insertNode(node);\\n }\",\n \"function position() {\\n const start = {\\n line: lineno,\\n column\\n };\\n return function (node) {\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function insert(n, p, x1, y1, x2, y2) {\\n if (isNaN(p.x) || isNaN(p.y)) return; // ignore invalid points\\n if (n.leaf) {\\n var v = n.point;\\n if (v) {\\n // If the point at this leaf node is at the same position as the new\\n // point we are adding, we leave the point associated with the\\n // internal node while adding the new point to a child node. This\\n // avoids infinite recursion.\\n if ((Math.abs(v.x - p.x) + Math.abs(v.y - p.y)) < .01) {\\n insertChild(n, p, x1, y1, x2, y2);\\n } else {\\n n.point = null;\\n insertChild(n, v, x1, y1, x2, y2);\\n insertChild(n, p, x1, y1, x2, y2);\\n }\\n } else {\\n n.point = p;\\n }\\n } else {\\n insertChild(n, p, x1, y1, x2, y2);\\n }\\n }\",\n \"function insert(n, p, x1, y1, x2, y2) {\\n if (isNaN(p.x) || isNaN(p.y)) return; // ignore invalid points\\n if (n.leaf) {\\n var v = n.point;\\n if (v) {\\n // If the point at this leaf node is at the same position as the new\\n // point we are adding, we leave the point associated with the\\n // internal node while adding the new point to a child node. This\\n // avoids infinite recursion.\\n if ((Math.abs(v.x - p.x) + Math.abs(v.y - p.y)) < .01) {\\n insertChild(n, p, x1, y1, x2, y2);\\n } else {\\n n.point = null;\\n insertChild(n, v, x1, y1, x2, y2);\\n insertChild(n, p, x1, y1, x2, y2);\\n }\\n } else {\\n n.point = p;\\n }\\n } else {\\n insertChild(n, p, x1, y1, x2, y2);\\n }\\n }\",\n \"setPosition(x, y) {\\n this.x = x\\n this.y = y\\n }\",\n \"insertAfterNode(ref) {\\n this.startNode = ref;\\n this.endNode = ref.nextSibling;\\n }\",\n \"setPosition(position) {\\n this.position = position;\\n }\",\n \"insert(element, position) {\\n // check for out-of-bounds values\\n if(index >= 0 && index <= this.count) { \\n const node = new Node(element);\\n // change the head reference to node and add a new element to the list\\n if(index === 0) { \\n node.next = current; \\n this.head = node;\\n // to loop through the list until the desired position\\n } else {\\n const previous = this.getElementAt(index - 1);\\n node.next = previous.next; // to link the new node and the current\\n previous.next = node; \\n }\\n this.count++;\\n return true;\\n }\\n return false;\\n }\",\n \"insertCell(x, y) {\\n this.root.insert(x, y);\\n }\",\n \"function ParticleRotateToPositionNode(mode /*uint*/, position) {\\n if (position === void 0) { position = null; }\\n _super.call(this, \\\"ParticleRotateToPosition\\\", mode, 3, 3);\\n this._pStateClass = ParticleRotateToPositionState;\\n this._iPosition = position || new Vector3D();\\n }\",\n \"function addNode() {\\r\\n\\t\\t\\t\\t\\t\\t\\t// removeId(root);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tvar newNode = {};\\r\\n\\t\\t\\t\\t\\t\\t\\tnewNode.name = \\\"Node\\\"\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ Math.floor((Math.random() * 100) + 1);\\r\\n\\t\\t\\t\\t\\t\\t\\tnewNode.VALUE = 100;\\r\\n\\t\\t\\t\\t\\t\\t\\tvar component = root[\\\"children\\\"]; // considering\\r\\n\\t\\t\\t\\t\\t\\t\\t// component\\r\\n\\t\\t\\t\\t\\t\\t\\t// node to add\\r\\n\\t\\t\\t\\t\\t\\t\\t// new nodes as\\r\\n\\t\\t\\t\\t\\t\\t\\t// a test.\\r\\n\\t\\t\\t\\t\\t\\t\\tcomponent.push(newNode);\\r\\n\\t\\t\\t\\t\\t\\t\\tgeneratedNodesIdx.push(component.length - 1);// tracking\\r\\n\\t\\t\\t\\t\\t\\t\\t// newly\\r\\n\\t\\t\\t\\t\\t\\t\\t// generated\\r\\n\\t\\t\\t\\t\\t\\t\\t// nodes\\r\\n\\t\\t\\t\\t\\t\\t\\t// to\\r\\n\\t\\t\\t\\t\\t\\t\\t// remove\\r\\n\\t\\t\\t\\t\\t\\t\\tupdate();\\r\\n\\t\\t\\t\\t\\t\\t}\",\n \"setPosition(x, y) {\\n this.x = x;\\n this.y = y;\\n }\",\n \"function updatePosition() {\\r\\n\\t\\t\\tcircle.attr('transform', `translate(${point.x * graph.cell_size + graph.offset.x} ${point.y * graph.cell_size + graph.offset.y})`);\\r\\n\\t\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.65842587","0.6516607","0.6484519","0.6458811","0.63893163","0.62335664","0.6225618","0.61637735","0.61253077","0.60475916","0.60419756","0.5999882","0.59785116","0.5964825","0.5964825","0.5964825","0.5964825","0.5964825","0.59278154","0.59051055","0.5901259","0.58630866","0.5838625","0.58188635","0.5809159","0.5797509","0.5774651","0.57729393","0.5772319","0.5768111","0.5731056","0.5717036","0.5708865","0.56807077","0.5666992","0.5664542","0.56640655","0.5660068","0.56595004","0.565204","0.560263","0.56018305","0.56014013","0.56006944","0.5594555","0.5591222","0.55698967","0.55558455","0.5552502","0.55331004","0.55274653","0.5526056","0.5505175","0.55015147","0.5495383","0.54930955","0.5479434","0.54737186","0.54603213","0.54598755","0.54550207","0.5452428","0.54511666","0.54473","0.54385203","0.54385203","0.54385203","0.54385203","0.54385203","0.54385203","0.54353106","0.542941","0.54277307","0.5421702","0.5409045","0.53886795","0.53886795","0.53886795","0.53886795","0.53886795","0.5374939","0.5372405","0.5365805","0.5362376","0.5360638","0.5358303","0.535758","0.5355967","0.5355967","0.535018","0.5348159","0.5348159","0.5344112","0.5330438","0.53300214","0.53265595","0.5308668","0.5298879","0.52846766","0.52830726","0.5276127"],"string":"[\n \"0.65842587\",\n \"0.6516607\",\n \"0.6484519\",\n \"0.6458811\",\n \"0.63893163\",\n \"0.62335664\",\n \"0.6225618\",\n \"0.61637735\",\n \"0.61253077\",\n \"0.60475916\",\n \"0.60419756\",\n \"0.5999882\",\n \"0.59785116\",\n \"0.5964825\",\n \"0.5964825\",\n \"0.5964825\",\n \"0.5964825\",\n \"0.5964825\",\n \"0.59278154\",\n \"0.59051055\",\n \"0.5901259\",\n \"0.58630866\",\n \"0.5838625\",\n \"0.58188635\",\n \"0.5809159\",\n \"0.5797509\",\n \"0.5774651\",\n \"0.57729393\",\n \"0.5772319\",\n \"0.5768111\",\n \"0.5731056\",\n \"0.5717036\",\n \"0.5708865\",\n \"0.56807077\",\n \"0.5666992\",\n \"0.5664542\",\n \"0.56640655\",\n \"0.5660068\",\n \"0.56595004\",\n \"0.565204\",\n \"0.560263\",\n \"0.56018305\",\n \"0.56014013\",\n \"0.56006944\",\n \"0.5594555\",\n \"0.5591222\",\n \"0.55698967\",\n \"0.55558455\",\n \"0.5552502\",\n \"0.55331004\",\n \"0.55274653\",\n \"0.5526056\",\n \"0.5505175\",\n \"0.55015147\",\n \"0.5495383\",\n \"0.54930955\",\n \"0.5479434\",\n \"0.54737186\",\n \"0.54603213\",\n \"0.54598755\",\n \"0.54550207\",\n \"0.5452428\",\n \"0.54511666\",\n \"0.54473\",\n \"0.54385203\",\n \"0.54385203\",\n \"0.54385203\",\n \"0.54385203\",\n \"0.54385203\",\n \"0.54385203\",\n \"0.54353106\",\n \"0.542941\",\n \"0.54277307\",\n \"0.5421702\",\n \"0.5409045\",\n \"0.53886795\",\n \"0.53886795\",\n \"0.53886795\",\n \"0.53886795\",\n \"0.53886795\",\n \"0.5374939\",\n \"0.5372405\",\n \"0.5365805\",\n \"0.5362376\",\n \"0.5360638\",\n \"0.5358303\",\n \"0.535758\",\n \"0.5355967\",\n \"0.5355967\",\n \"0.535018\",\n \"0.5348159\",\n \"0.5348159\",\n \"0.5344112\",\n \"0.5330438\",\n \"0.53300214\",\n \"0.53265595\",\n \"0.5308668\",\n \"0.5298879\",\n \"0.52846766\",\n \"0.52830726\",\n \"0.5276127\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":76393,"cells":{"query":{"kind":"string","value":"Add `node` to `parent`s children or to `tokens`. Performs merges where possible."},"document":{"kind":"string","value":"function add(node, parent) {\n var children = parent ? parent.children : tokens;\n var prev = children[children.length - 1];\n\n if (\n prev &&\n node.type === prev.type &&\n node.type in MERGEABLE_NODES &&\n mergeable(prev) &&\n mergeable(node)\n ) {\n node = MERGEABLE_NODES[node.type].call(self, prev, node);\n }\n\n if (node !== prev) {\n children.push(node);\n }\n\n if (self.atStart && tokens.length !== 0) {\n self.exitStart();\n }\n\n return node;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function add(node, parent) {\n var children = parent ? parent.children : tokens\n var previous = children[children.length - 1]\n var fn\n\n if (\n previous &&\n node.type === previous.type &&\n (node.type === 'text' || node.type === 'blockquote') &&\n mergeable(previous) &&\n mergeable(node)\n ) {\n fn = node.type === 'text' ? mergeText : mergeBlockquote\n node = fn.call(self, previous, node)\n }\n\n if (node !== previous) {\n children.push(node)\n }\n\n if (self.atStart && tokens.length !== 0) {\n self.exitStart()\n }\n\n return node\n }","function add (node, parent) {\n parent.children.push(node)\n if (parser.position) {\n parent.position = {\n start: parent.children[0].position.start,\n end: node.position.end\n }\n }\n }","function mutation_append(node, parent) {\n /**\n * To append a node to a parent, pre-insert node into parent before null.\n */\n return mutation_preInsert(node, parent, null);\n}","function union(nodeA, nodeB, parent) {\n let parentA = findParent(nodeA, parent);\n let parentB = findParent(nodeB, parent);\n parent[parentB] = parentA;\n}","function addNodes(parent, nodes) {\n return nodes ? { ...parent, nodes } : parent;\n }","function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }","function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }","function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }","function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }","function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }","appendToTree(Node) {\n this.tree = {...this.tree, ...Node};\n }","function addNode(parent_id, node_data, user, done) {\n\n Node.findById(parent_id, function (error, parent_node) {\n if (error) {\n return done(error);\n }\n\n if (!parent_node) {\n return done('This parent node doesn\\'t exist');\n }\n\n // Assign task ID.\n // Task IDs are incremental, prefixed by parent task IDs.\n var taskId = 1;\n if (typeof parent_node.last_task_id !== 'undefined') {\n taskId = parent_node.last_task_id + 1;\n }\n\n var node = new Node({\n title: node_data.title,\n user: user._id,\n _parent: parent_node._id,\n level: parent_node.level + 1,\n path: (parent_node.path) ? (parent_node.path + ',' + parent_node._id) : parent_node._id,\n _project: parent_node._project,\n task_id: parent_node.task_id + '.' + taskId,\n });\n\n // Save the last task ID.\n parent_node.set('last_task_id', taskId);\n parent_node.save();\n\n node.save(function (error) {\n if (error) {\n return done(error);\n }\n\n parent_node._nodes.unshift(node._id);\n parent_node.save(function (err) {});\n\n done(null, node, parent_node);\n\n });\n });\n}","function apply(node, parent) {\n return pos(add(pos(node), parent), indent)\n }","function appendNode(parent, node) {\n\n // Handle the replacement based on the type\n if (isElement(node) == true)\n parent.appendChild(node);\n else {\n var el = document.createElement(\"div\");\n el.innerHTML = node;\n\n var nodes = [];\n\n // Populate the nodes\n for (var i = 0; i < el.childNodes.length; i++)\n nodes.push(el.childNodes[i]);\n\n // Insert all the nodes\n for (i = 0; i < nodes.length; i++)\n parent.appendChild(nodes[i]);\n\n }\n\n // Return\n return;\n\n }","shiftNodeUp(node) {\n\n\t\tif (node.parent == null) {\n\t\t\tthis.root = node;\n\t\t\treturn;\n\t\t}\n\n\t\tif (node.priority <= node.parent.priority) {\n\t\t\treturn;\n\n\t\t} else if (this.parentNodes.length != 0) {\n\t\t\tvar indexOfNode = this.parentNodes.indexOf (node);\n\t\t\tvar indexOfNodeParent = this.parentNodes.indexOf (node.parent);\n\t\t\tif ( indexOfNode != -1) {\n\t\t\t\tthis.parentNodes[indexOfNode] = node.parent;\n\t\t\t\tif (indexOfNodeParent != -1) {\n\t\t\t\t\tthis.parentNodes[indexOfNodeParent] = node;\n\t\t\t\t}\t\n\t\t\t}\t\n\n\t\tif (this.root == node.parent) { \n\t\t\tthis.root = node; \n\t\t}\n\n\t\tnode.swapWithParent ();\n\t\tthis.shiftNodeUp(node);\n\t\t} \t\n\t}","function walkAddParent(ast, fn) {\n let stack = [ast], i, j, key, len, node, child, subchild;\n for (i = 0; i < stack.length; i += 1) {\n node = stack[i];\n fn(node);\n for (key in node) {\n if (key !== 'parent' && key.substr(0, 3) != 'fp_') {\n child = node[key];\n if (child instanceof Array) {\n for (j = 0, len = child.length; j < len; j += 1) {\n subchild = child[j];\n if (subchild instanceof Object) {\n subchild.parent = node;\n }\n stack.push(subchild);\n }\n }\n else if (child != void 0 && typeof child.type === 'string') {\n child.parent = node;\n stack.push(child);\n }\n }\n }\n }\n}","addSibling(node){\r\n\t\tif(this.parent != null){\r\n\t\t\tvar childrenList = this.parent.children;\r\n\t\t\tchildrenList[childrenList.length] = node;\r\n\t\t\tnode.parent = this.parent;\r\n\t\t}\r\n\t}","function mergeBlockquote(prev, node) {\n if (this.options.commonmark) {\n return node;\n }\n\n prev.children = prev.children.concat(node.children);\n\n return prev;\n}","function mergeBlockquote(prev, node) {\n if (this.options.commonmark) {\n return node;\n }\n\n prev.children = prev.children.concat(node.children);\n\n return prev;\n}","function mergeBlockquote(prev, node) {\n if (this.options.commonmark) {\n return node;\n }\n\n prev.children = prev.children.concat(node.children);\n\n return prev;\n}","function mergeBlockquote(prev, node) {\n if (this.options.commonmark) {\n return node;\n }\n\n prev.children = prev.children.concat(node.children);\n\n return prev;\n}","function mergeBlockquote(prev, node) {\n if (this.options.commonmark) {\n return node;\n }\n\n prev.children = prev.children.concat(node.children);\n\n return prev;\n}","function mergeBlockquote(prev, node) {\n if (this.options.commonmark) {\n return node;\n }\n\n prev.children = prev.children.concat(node.children);\n\n return prev;\n}","addParent(node, parent) {\n // implement by subclass\n }","function mergeBlockquote(previous, node) {\n if (this.options.commonmark || this.options.gfm) {\n return node\n }\n\n previous.children = previous.children.concat(node.children)\n\n return previous\n}","mergeToRight(leftNode, rightNode) {\n if (!leftNode.empty()) {\n\n let rightNodeFirstLeftChildOldValue = rightNode.first().leftChild;\n rightNode.first().leftChild = leftNode.getRightmostChild();\n this.addAtLastIndexOfCallStack(\n () => {\n rightNode.first().leftChild = rightNodeFirstLeftChildOldValue;\n }\n );\n\n if (rightNode.hasLeftmostChild()) {\n let rightNodeFirstLeftChildParentOldValue = rightNode.first().leftChild.parent;\n rightNode.first().leftChild.parent = rightNode;\n this.addAtLastIndexOfCallStack(\n () => {\n rightNode.first().leftChild.parent = rightNodeFirstLeftChildParentOldValue;\n }\n );\n }\n while (!leftNode.empty()) {\n let leftNodeElement = leftNode.popLast();\n this.addAtLastIndexOfCallStack(\n this.undoPopLast.bind(this, leftNodeElement, leftNode)\n );\n\n rightNode.addFirst(leftNodeElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddFirst.bind(this, rightNode)\n );\n\n if (rightNode.first().leftChild !== null) {\n let rightNodeFirstLeftChildParentOldValue = rightNode.first().leftChild.parent;\n rightNode.first().leftChild.parent = rightNode;\n this.addAtLastIndexOfCallStack(\n () => {\n rightNode.first().leftChild.parent = rightNodeFirstLeftChildParentOldValue;\n }\n );\n }\n if (rightNode.first().rightChild !== null) {\n let rightNodeFirstRightChildParentOldValue = rightNode.first().rightChild.parent;\n rightNode.first().rightChild.parent = rightNode;\n this.addAtLastIndexOfCallStack(\n () => {\n rightNode.first().rightChild.parent = rightNodeFirstRightChildParentOldValue;\n }\n );\n }\n }\n }\n\n let leftNodeParentOldValue = leftNode.parent;\n leftNode.parent = null;\n this.addAtLastIndexOfCallStack(\n () => {\n leftNode.parent = leftNodeParentOldValue;\n }\n )\n\n let leftNodeOldValue = leftNode;\n leftNode = null;\n this.addAtLastIndexOfCallStack(\n () => {\n leftNode = leftNodeOldValue;\n }\n );\n\n }","function merge(target, source) {\n target.additionalNodes = target.additionalNodes || [];\n target.additionalNodes.push(source.node);\n if (source.additionalNodes) {\n (_a = target.additionalNodes).push.apply(_a, source.additionalNodes);\n }\n target.children = ts.concatenate(target.children, source.children);\n if (target.children) {\n mergeChildren(target.children);\n sortChildren(target.children);\n }\n var _a;\n }","function _onNodeAction (node, parent) {\n var par = parent;\n\n node.setParent = function (newParent) {\n par = newParent;\n };\n\n /**\n * Method getParent\n *\n * Method return parent of the node\n *\n * @returns {*}\n */\n node.getParent = function () {\n return par;\n };\n\n /**\n * Method getNext\n *\n * Method returns next node in subnodes array or null if current node is last in array\n *\n * @returns {*}\n */\n node.getNext = function () {\n var index,\n nextNode;\n\n if (parent !== null) {\n index = parent.subnodes.indexOf(node);\n nextNode = parent.subnodes[index+1];\n\n return (typeof nextNode !== 'undefined') ? nextNode : null;\n } else {\n return null;\n }\n };\n\n /**\n * Method getPrev\n *\n * Method returns previous node in subnodes array or null if current node is first in array\n *\n * @returns {*}\n */\n node.getPrev = function () {\n var index,\n prevNode;\n\n if (parent !== null) {\n index = parent.subnodes.indexOf(node);\n prevNode = parent.subnodes[index-1];\n\n return (typeof prevNode !== 'undefined') ? prevNode : null;\n } else {\n return null;\n }\n };\n\n /*\n Add levels indicators to nested subtrees.\n */\n node.level = (parent === null) ? 1 : parent.level + 1;\n\n\n if (angular.isArray(node.subnodes)) {\n for (var i = 0, len = node.subnodes.length; i < len; i++) {\n _onNodeAction(node.subnodes[i], node);\n }\n }\n }","function _insertBefore(parent, node, refNode) {\n\t\tparent.insertBefore(node, refNode);\n\t}","function mutation_replaceAll(node, parent) {\n /**\n * 1. If node is not null, adopt node into parent’s node document.\n */\n if (node !== null) {\n DocumentAlgorithm_1.document_adopt(node, parent._nodeDocument);\n }\n /**\n * 2. Let removedNodes be parent’s children.\n */\n const removedNodes = Array.from(parent._children);\n /**\n * 3. Let addedNodes be the empty list.\n * 4. If node is DocumentFragment node, then set addedNodes to node’s\n * children.\n * 5. Otherwise, if node is non-null, set addedNodes to [node].\n */\n let addedNodes = [];\n if (node && node._nodeType === interfaces_1.NodeType.DocumentFragment) {\n addedNodes = Array.from(node._children);\n }\n else if (node !== null) {\n addedNodes.push(node);\n }\n /**\n * 6. Remove all parent’s children, in tree order, with the suppress\n * observers flag set.\n */\n for (const childNode of removedNodes) {\n mutation_remove(childNode, parent, true);\n }\n /**\n * 7. If node is not null, then insert node into parent before null with the\n * suppress observers flag set.\n */\n if (node !== null) {\n mutation_insert(node, parent, null, true);\n }\n /**\n * 8. Queue a tree mutation record for parent with addedNodes, removedNodes,\n * null, and null.\n */\n if (dom_1.dom.features.mutationObservers) {\n MutationObserverAlgorithm_1.observer_queueTreeMutationRecord(parent, addedNodes, removedNodes, null, null);\n }\n}","add_node(parent, child) {\n if (!this._is_node(parent)) {\n console.error(\"[ERROR] can't add a data that is not a node : 'parent' is not a node\")\n }\n if (!this._is_node(child)) {\n console.error(\"[ERROR] can't add a data that is not a node : 'child' is not a node\")\n }\n\n if (this._id_set.includes(child.id)) {\n console.error(\"[ERROR] id '\" + child.id + \"' already exist in the tree\");\n return;\n }\n\n if (typeof child.parent_node !== 'undefined') {\n console.error(\"[ERROR] can't add a node that has a parent : 'child' already has a parent\");\n return;\n }\n\n child.parent_node = parent;\n parent.child_list.push(child);\n this._id_set.push(child.id);\n }","process(node) {\n let parent = this.parentPrefix(node)\n\n for (let prefix of this.prefixes) {\n if (!parent || parent === prefix) {\n this.add(node, prefix)\n }\n }\n }","mergeToLeft(leftNode, rightNode) {\n if (!rightNode.empty()) {\n let leftNodeLastRightChildOldValue = leftNode.last().rightChild;\n leftNode.last().rightChild = rightNode.getLeftmostChild();\n this.addAtLastIndexOfCallStack(\n () => {\n leftNode.last().rightChild = leftNodeLastRightChildOldValue;\n }\n )\n if (leftNode.hasRightmostChild()) {\n let leftNodeLastRightChildParentOldValue = leftNode.last().rightChild.parent;\n leftNode.last().rightChild.parent = leftNode;\n this.addAtLastIndexOfCallStack(\n () => {\n leftNode.last().rightChild.parent = leftNodeLastRightChildParentOldValue;\n }\n );\n }\n while (!rightNode.empty()) {\n let rightNodeElement = rightNode.popFirst();\n this.addAtLastIndexOfCallStack(\n this.undoPopFirst.bind(this, rightNodeElement, rightNode)\n );\n leftNode.addLast(rightNodeElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddLast.bind(this, leftNode)\n )\n if (leftNode.last().leftChild != null) {\n let leftNodeLastLeftChildParentOldValue = leftNode.last().leftChild.parent;\n leftNode.last().leftChild.parent = leftNode;\n this.addAtLastIndexOfCallStack(\n () => {\n leftNode.last().leftChild.parent = leftNodeLastLeftChildParentOldValue;\n }\n )\n }\n if (leftNode.last().rightChild != null) {\n let leftNodeLastRightChildParentOldValue = leftNode.last().rightChild.parent;\n leftNode.last().rightChild.parent = leftNode;\n this.addAtLastIndexOfCallStack(\n () => {\n leftNode.last().rightChild.parent = leftNodeLastRightChildParentOldValue\n }\n );\n }\n }\n }\n\n let rightNodeParentOldValue = rightNode.parent;\n rightNode.parent = null;\n this.addAtLastIndexOfCallStack(\n () => {\n rightNode.parent = rightNodeParentOldValue;\n }\n );\n\n let rightNodeOldValue = rightNode;\n rightNode = null;\n this.addAtLastIndexOfCallStack(\n () => {\n rightNode = rightNodeOldValue;\n }\n );\n }","liftUp(node, parentIndex, side) {\n let parentElement = node.popAt(Math.floor(this.base / 2));\n this.addAtLastIndexOfCallStack(\n this.undoPopAt.bind(this, parentElement, node, Math.floor(this.base / 2))\n );\n let newNode = this.split(node);\n\n if (!node.hasParent()) {\n node.parent = new BNode();\n let nodeParentIsLeafOldValue = node.parent.isLeaf;\n node.parent.isLeaf = false;\n this.addAtLastIndexOfCallStack(() => {\n node.parent.isLeaf = nodeParentIsLeafOldValue;\n });\n }\n\n if (this.root === node) {\n let rootOldValue = this.root;\n this.root = node.parent;\n this.addAtLastIndexOfCallStack(() => {\n this.root = rootOldValue\n });\n }\n\n let newNodeParentOldValue = newNode.parent;\n newNode.parent = node.parent;\n this.addAtLastIndexOfCallStack(() => {\n newNode.parent = newNodeParentOldValue;\n });\n\n let parentElementLeftChildOldValue = parentElement.leftChild;\n parentElement.leftChild = node;\n this.addAtLastIndexOfCallStack(() => {\n parentElement.leftChild = parentElementLeftChildOldValue\n });\n\n let parentElementRightChildOldValue = parentElement.rightChild;\n parentElement.rightChild = newNode;\n this.addAtLastIndexOfCallStack(() => {\n parentElement.rightChild = parentElementRightChildOldValue;\n });\n\n if (node.parent.empty() || (parentIndex === node.parent.size() - 1 && side === true)) {\n node.parent.addLast(parentElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddLast.bind(this, node.parent)\n );\n } else {\n if (node.parent.hasLeftChildAt(parentIndex)) {\n let nodeParentAtLeftChildOldValue = node.parent.at(parentIndex).leftChild;\n node.parent.at(parentIndex).leftChild = parentElement.rightChild;\n this.addAtLastIndexOfCallStack(() => {\n node.parent.at(parentIndex).leftChild = nodeParentAtLeftChildOldValue;\n });\n }\n\n if (node.parent.hasRightChildAt(parentIndex - 1)) {\n let nodeParentAtRightChildOldValue = node.parent.at(parentIndex - 1).rightChild;\n node.parent.at(parentIndex - 1).rightChild = parentElement.leftChild;\n this.addAtLastIndexOfCallStack(() => {\n node.parent.at(parentIndex - 1).rightChild = nodeParentAtRightChildOldValue;\n });\n }\n\n node.parent.addAt(parentIndex, parentElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddAt.bind(this, node.parent, parentIndex)\n );\n }\n\n let nodeParentIsLeafOldValue = node.parent.isLeaf;\n node.parent.isLeaf = false;\n this.addAtLastIndexOfCallStack(() => {\n node.parent.isLeaf = nodeParentIsLeafOldValue;\n })\n }","function addChildNode(child, node, sourceFile, appId) {\n var childType = child.type;\n if (child.type === \"Literal\") {\n if (child.value != undefined && typeof child.value === 'string') {\n childType = \"StringLiteral\";\n }\n else if (child.value != undefined && typeof child.value === 'number') {\n childType = \"NumberLiteral\";\n }\n else if (child.value != undefined && typeof child.value == 'boolean') {\n childType = \"BooleanLiteral\";\n }\n }\n\n var hasLoc = (child.loc != undefined), lineNumber, columnNumber;\n if (hasLoc) {\n lineNumber = child.loc.start.line;\n columnNumber = child.loc.start.column;\n }\n\n //Add this in the childNodes array of the current node\n var newCodeTreeNode = new CodeTreeNode(\"ast\", childType, node.codetreeref, sourceFile, appId);\n if (child.type === \"Literal\") newCodeTreeNode.abstractOut();\n if (hasLoc) newCodeTreeNode.addLoc(lineNumber, columnNumber);\n node.codetreeref.addChild(newCodeTreeNode);\n child.codetreeref = newCodeTreeNode;\n\n //Add values if necessary\n if (child.type === \"Literal\" && child.raw != undefined) {\n var newLiteralNode = new CodeTreeNode(\"ast\", \"\" + child.raw, newCodeTreeNode, sourceFile, appId);\n if (hasLoc) newLiteralNode.addLoc(lineNumber, columnNumber);\n newLiteralNode.abstractOut();\n newCodeTreeNode.addChild(newLiteralNode);\n }\n else if (child.type === \"Identifier\" && child.name != undefined) {\n var newNameNode = new CodeTreeNode(\"ast\", child.name, newCodeTreeNode, sourceFile, appId);\n if (hasLoc) newNameNode.addLoc(lineNumber, columnNumber);\n newNameNode.abstractOut();\n newCodeTreeNode.addChild(newNameNode);\n }\n else if (child.type === \"BinaryExpression\" || child.type === \"UpdateExpression\" || child.type === \"UnaryExpression\") {\n if (child.operator != undefined) {\n var newOperatorNode = new CodeTreeNode(\"ast\", child.operator, newCodeTreeNode, \n sourceFile, appId);\n if (hasLoc) newOperatorNode.addLoc(lineNumber, columnNumber);\n newCodeTreeNode.addChild(newOperatorNode);\n }\n if (child.prefix != undefined) {\n var newPrefixNode = new CodeTreeNode(\"ast\", child.prefix + \"\", newCodeTreeNode, \n sourceFile, appId);\n if (hasLoc) newPrefixNode.addLoc(lineNumber, columnNumber);\n newCodeTreeNode.addChild(newPrefixNode);\n }\n }\n }","function addToTree(parent, current, userquestion, userans) {\n var newnode = {Q: userquestion, Y: userans, N: current};\n // replace the guess in the parent node\n if( current == parent.Y ) {\n parent.Y = newnode;\n } else if (current == parent.N) {\n parent.N = newnode;\n } else {\n throw new Error(\"this shouldn't happen\");\n }\n}","add(node) {\n if (this.left === null) {\n this.left = node;\n return this.left;\n } else if (this.right === null) {\n this.right = node;\n return this.right;\n }\n return null;\n }","merge(tree) {\n let arr = tree.toArray();\n for(let i=0; i<arr.length; i++) {\n this.add(arr[i]);\n }\n }","function setParent(node) {\n if ('children' in node) {\n for (var index in node.children) {\n node.children[index].parent = node;\n setParent(node.children[index]);\n }\n }\n }","function mutation_preInsert(node, parent, child) {\n /**\n * 1. Ensure pre-insertion validity of node into parent before child.\n * 2. Let reference child be child.\n * 3. If reference child is node, set it to node’s next sibling.\n * 4. Adopt node into parent’s node document.\n * 5. Insert node into parent before reference child.\n * 6. Return node.\n */\n mutation_ensurePreInsertionValidity(node, parent, child);\n let referenceChild = child;\n if (referenceChild === node)\n referenceChild = node._nextSibling;\n DocumentAlgorithm_1.document_adopt(node, parent._nodeDocument);\n mutation_insert(node, parent, referenceChild);\n return node;\n}","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","function appendBuiltContent( ancestorBranches, key, node ){\n \n nodeOf( head( ancestorBranches))[key] = node;\n }","insertNode(node, newNode) {\n // Handle case where value is less than parent, GO LEFT\n if (newNode.data < node.data) {\n // Check if we can place node\n if (node.left === null) {\n // Place node\n node.left = newNode;\n // Otherwise use recursion to do the same process over again\n // until we find a null position to put the node\n } else this.insertNode(node.left, newNode);\n } else {\n // Handle case where value is grater than parent, GO RIGHT\n if (node.right === null) {\n node.right = newNode;\n } else this.insertNode(node.right, newNode);\n }\n }","function addParentLinks(tree, parent) {\n if (!tree) {\n return;\n }\n tree.parent = parent;\n addParentLinks(tree.left, tree);\n addParentLinks(tree.right, tree);\n}","function insertRight(parent, node) {\n\tvar index = parent.length - 1;\n\tparent[index] = node;\n\tparent.sizes[index] = (0, _util.length)(node) + (index > 0 ? parent.sizes[index - 1] : 0);\n}","function visit(node) {\r\n if (visited.has(node)) {\r\n return;\r\n }\r\n visited.add(node);\r\n var children = graph.get(node);\r\n if (children) {\r\n children.forEach(visit);\r\n }\r\n sorted.push(node);\r\n }","function addNode(token, docId, child) {\n\t\tvar getter = me.store.get(token);\n\t\t\n\t\tgetter.onsuccess = function(evt) {\n\t\t\tvar node = evt.target.result || { prefix: token };\n\t\t\tvar insert = false;\n\t\t\t\n\t\t\tif (child) {\n\t\t\t\t// It’s an internal node!\n\t\t\t\t// Children: Characters that could follow\n\t\t\t\tnode.children = node.children || [];\n\t\t\t\t\n\t\t\t\tif (node.children.indexOf(child) === -1) {\n\t\t\t\t\tnode.children.push(child);\n\t\t\t\t\tinsert = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\t// DocIds: Documents that contain this word *as a whole token*\n\t\t\t\t// Notice that the same document cannot add both docIds and\n\t\t\t\t// children to the same node, by definition of what these are.\n\t\t\t\tnode.docIds = node.docIds || [];\n\t\t\t\t\n\t\t\t\tif (node.docIds.indexOf(docId) === -1) {\n\t\t\t\t\tnode.docIds.push(docId);\n\t\t\t\t\tinsert = true;\n\t\t\t\t}\n\t\t\t}\n\t\n\t\t\tif (insert) {\n\t\t\t\tvar insertion = me.store.put(node);\n\t\t\t\t\n\t\t\t\t// TODO retry or something\n\t\t\t\tinsertion.onerror = me.onerror;\n\t\t\t}\n\t\t};\n\t\t\n\t\tgetter.onerror = me.onerror;\n\t}","add(data, parentNode) {\n let node = new Node(data);\n parentNode = parentNode ? this.contains(parentNode) : null;\n\n if (parentNode) {\n parentNode.children.push(node);\n }\n else if (!this.root) {\n this.root = node;\n }\n else {\n return 'There is no parent node in the tree';\n }\n }","function insert(parent, elm, ref) {\n if (isDef(parent)) {\n if (isDef(ref)) {\n if (nodeOps.parentNode(ref) === parent) {\n nodeOps.insertBefore(parent, elm, ref);\n }\n }\n else {\n nodeOps.appendChild(parent, elm);\n }\n }\n }","function addChild(child, node) {\n\t var children = node.children;\n\t\n\t if (child.parentNode === node) {\n\t return;\n\t }\n\t\n\t children.push(child);\n\t child.parentNode = node;\n\t }","function addChild(child, node) {\n var children = node.children;\n\n if (child.parentNode === node) {\n return;\n }\n\n children.push(child);\n child.parentNode = node;\n}","propagateDownFromLeft(node, parentPos, leftSibling) {\n let parentElement = node.parent.popAt(parentPos);\n this.addAtLastIndexOfCallStack(\n this.undoPopAt.bind(this, parentElement, node.parent, parentPos)\n );\n if (node.parent.hasRightChildAt(parentPos - 1)) {\n let nodeParentAtRightChildOldValue = node.parent.at(parentPos - 1).rightChild;\n node.parent.at(parentPos - 1).rightChild = node;\n this.addAtLastIndexOfCallStack(\n () => {\n node.parent.at(parentPos - 1).rightChild = nodeParentAtRightChildOldValue;\n }\n );\n }\n let parentElementLeftChildOldValue = parentElement.leftChild;\n parentElement.leftChild = null;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.leftChild = parentElementLeftChildOldValue;\n }\n )\n\n let parentElementRightChildOldValue = parentElement.rightChild;\n parentElement.rightChild = node.hasLeftmostChild() ? node.getLeftmostChild() : this.recentNode;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.rightChild = parentElementRightChildOldValue;\n }\n )\n\n node.addFirst(parentElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddFirst.bind(this, node)\n );\n\n let nodeIsLeafOldValue = node.isLeaf;\n node.isLeaf = node.isLeaf && leftSibling.isLeaf;\n this.addAtLastIndexOfCallStack(\n () => {\n node.isLeaf = nodeIsLeafOldValue;\n }\n );\n\n this.mergeToRight(leftSibling, node);\n if (node.parent === this.root && this.root.size() === 0) {\n let rootOldValue = this.root;\n this.root = node;\n this.addAtLastIndexOfCallStack(\n () => {\n this.root = rootOldValue;\n }\n );\n\n let nodeParentOldValue = node.parent;\n node.parent = null;\n this.addAtLastIndexOfCallStack(\n () => {\n node.parent = nodeParentOldValue;\n }\n )\n }\n }","function processNode(node){\n processChild(node);\n for( i in node.children )\n processNode(node.children[i]);\n }","function mergeText(previous, node) {\n previous.value += node.value\n\n return previous\n}","setLeftAndUpdateParent(node) {\n this.left = node;\n if (node) {\n node.parent = this;\n node.parentSide = LEFT;\n }\n }","mergeNodes(editor) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n Editor.withoutNormalizing(editor, () => {\n var {\n match,\n at = editor.selection\n } = options;\n var {\n hanging = false,\n voids = false,\n mode = 'lowest'\n } = options;\n\n if (!at) {\n return;\n }\n\n if (match == null) {\n if (Path.isPath(at)) {\n var [parent] = Editor.parent(editor, at);\n\n match = n => parent.children.includes(n);\n } else {\n match = n => Editor.isBlock(editor, n);\n }\n }\n\n if (!hanging && Range.isRange(at)) {\n at = Editor.unhangRange(editor, at);\n }\n\n if (Range.isRange(at)) {\n if (Range.isCollapsed(at)) {\n at = at.anchor;\n } else {\n var [, end] = Range.edges(at);\n var pointRef = Editor.pointRef(editor, end);\n Transforms.delete(editor, {\n at\n });\n at = pointRef.unref();\n\n if (options.at == null) {\n Transforms.select(editor, at);\n }\n }\n }\n\n var [current] = Editor.nodes(editor, {\n at,\n match,\n voids,\n mode\n });\n var prev = Editor.previous(editor, {\n at,\n match,\n voids,\n mode\n });\n\n if (!current || !prev) {\n return;\n }\n\n var [node, path] = current;\n var [prevNode, prevPath] = prev;\n\n if (path.length === 0 || prevPath.length === 0) {\n return;\n }\n\n var newPath = Path.next(prevPath);\n var commonPath = Path.common(path, prevPath);\n var isPreviousSibling = Path.isSibling(path, prevPath);\n var levels = Array.from(Editor.levels(editor, {\n at: path\n }), _ref2 => {\n var [n] = _ref2;\n return n;\n }).slice(commonPath.length).slice(0, -1); // Determine if the merge will leave an ancestor of the path empty as a\n // result, in which case we'll want to remove it after merging.\n\n var emptyAncestor = Editor.above(editor, {\n at: path,\n mode: 'highest',\n match: n => levels.includes(n) && hasSingleChildNest(editor, n)\n });\n var emptyRef = emptyAncestor && Editor.pathRef(editor, emptyAncestor[1]);\n var properties;\n var position; // Ensure that the nodes are equivalent, and figure out what the position\n // and extra properties of the merge will be.\n\n if (Text.isText(node) && Text.isText(prevNode)) {\n var rest = _objectWithoutProperties(node, _excluded);\n\n position = prevNode.text.length;\n properties = rest;\n } else if (Element.isElement(node) && Element.isElement(prevNode)) {\n var rest = _objectWithoutProperties(node, _excluded2);\n\n position = prevNode.children.length;\n properties = rest;\n } else {\n throw new Error(\"Cannot merge the node at path [\".concat(path, \"] with the previous sibling because it is not the same kind: \").concat(JSON.stringify(node), \" \").concat(JSON.stringify(prevNode)));\n } // If the node isn't already the next sibling of the previous node, move\n // it so that it is before merging.\n\n\n if (!isPreviousSibling) {\n Transforms.moveNodes(editor, {\n at: path,\n to: newPath,\n voids\n });\n } // If there was going to be an empty ancestor of the node that was merged,\n // we remove it from the tree.\n\n\n if (emptyRef) {\n Transforms.removeNodes(editor, {\n at: emptyRef.current,\n voids\n });\n } // If the target node that we're merging with is empty, remove it instead\n // of merging the two. This is a common rich text editor behavior to\n // prevent losing formatting when deleting entire nodes when you have a\n // hanging selection.\n // if prevNode is first child in parent,don't remove it.\n\n\n if (Element.isElement(prevNode) && Editor.isEmpty(editor, prevNode) || Text.isText(prevNode) && prevNode.text === '' && prevPath[prevPath.length - 1] !== 0) {\n Transforms.removeNodes(editor, {\n at: prevPath,\n voids\n });\n } else {\n editor.apply({\n type: 'merge_node',\n path: newPath,\n position,\n properties\n });\n }\n\n if (emptyRef) {\n emptyRef.unref();\n }\n });\n }","insertNode(node, new_node) {\n // if the data is less than the node\n // data move left of the tree\n if (new_node.data < node.data) {\n if (node.left === null) {\n node.left = new_node;\n } else {\n //if left id not null\n //recurse until null is found\n this.insertNode(node.left, new_node);\n }\n } else {\n // if right is null insert node here\n if (node.right === null) {\n node.right = new_node;\n } else {\n //if right is not null\n //recurse until null is found\n this.insertNode(node.right, new_node);\n }\n }\n }","mergeNodes(editor) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n Editor.withoutNormalizing(editor, () => {\n var {\n match,\n at = editor.selection\n } = options;\n var {\n hanging = false,\n voids = false,\n mode = 'lowest'\n } = options;\n\n if (!at) {\n return;\n }\n\n if (match == null) {\n if (Path.isPath(at)) {\n var [parent] = Editor.parent(editor, at);\n\n match = n => parent.children.includes(n);\n } else {\n match = n => Editor.isBlock(editor, n);\n }\n }\n\n if (!hanging && Range.isRange(at)) {\n at = Editor.unhangRange(editor, at);\n }\n\n if (Range.isRange(at)) {\n if (Range.isCollapsed(at)) {\n at = at.anchor;\n } else {\n var [, end] = Range.edges(at);\n var pointRef = Editor.pointRef(editor, end);\n Transforms.delete(editor, {\n at\n });\n at = pointRef.unref();\n\n if (options.at == null) {\n Transforms.select(editor, at);\n }\n }\n }\n\n var [current] = Editor.nodes(editor, {\n at,\n match,\n voids,\n mode\n });\n var prev = Editor.previous(editor, {\n at,\n match,\n voids,\n mode\n });\n\n if (!current || !prev) {\n return;\n }\n\n var [node, path] = current;\n var [prevNode, prevPath] = prev;\n\n if (path.length === 0 || prevPath.length === 0) {\n return;\n }\n\n var newPath = Path.next(prevPath);\n var commonPath = Path.common(path, prevPath);\n var isPreviousSibling = Path.isSibling(path, prevPath);\n var levels = Array.from(Editor.levels(editor, {\n at: path\n }), (_ref2) => {\n var [n] = _ref2;\n return n;\n }).slice(commonPath.length).slice(0, -1); // Determine if the merge will leave an ancestor of the path empty as a\n // result, in which case we'll want to remove it after merging.\n\n var emptyAncestor = Editor.above(editor, {\n at: path,\n mode: 'highest',\n match: n => levels.includes(n) && Element.isElement(n) && n.children.length === 1\n });\n var emptyRef = emptyAncestor && Editor.pathRef(editor, emptyAncestor[1]);\n var properties;\n var position; // Ensure that the nodes are equivalent, and figure out what the position\n // and extra properties of the merge will be.\n\n if (Text.isText(node) && Text.isText(prevNode)) {\n var rest = _objectWithoutProperties(node, [\"text\"]);\n\n position = prevNode.text.length;\n properties = rest;\n } else if (Element.isElement(node) && Element.isElement(prevNode)) {\n var rest = _objectWithoutProperties(node, [\"children\"]);\n\n position = prevNode.children.length;\n properties = rest;\n } else {\n throw new Error(\"Cannot merge the node at path [\".concat(path, \"] with the previous sibling because it is not the same kind: \").concat(JSON.stringify(node), \" \").concat(JSON.stringify(prevNode)));\n } // If the node isn't already the next sibling of the previous node, move\n // it so that it is before merging.\n\n\n if (!isPreviousSibling) {\n Transforms.moveNodes(editor, {\n at: path,\n to: newPath,\n voids\n });\n } // If there was going to be an empty ancestor of the node that was merged,\n // we remove it from the tree.\n\n\n if (emptyRef) {\n Transforms.removeNodes(editor, {\n at: emptyRef.current,\n voids\n });\n } // If the target node that we're merging with is empty, remove it instead\n // of merging the two. This is a common rich text editor behavior to\n // prevent losing formatting when deleting entire nodes when you have a\n // hanging selection.\n\n\n if (Element.isElement(prevNode) && Editor.isEmpty(editor, prevNode) || Text.isText(prevNode) && prevNode.text === '') {\n Transforms.removeNodes(editor, {\n at: prevPath,\n voids\n });\n } else {\n editor.apply({\n type: 'merge_node',\n path: newPath,\n position,\n properties\n });\n }\n\n if (emptyRef) {\n emptyRef.unref();\n }\n });\n }","function addNode(node, path){\n if ( node.name.indexOf('.') === 0 || path.indexOf('/.') >= 0){ // ignore hidden files\n return;\n }\n var relativePath = path.replace(root,'');\n\n node.path = relativePath + '/' + node.name;\n nodesMap[node.path] = node;\n\n if ( relativePath.length === 0 ){ //is root\n tree.push(node);\n return;\n }\n node.parentPath = node.path.substring(0,node.path.lastIndexOf('/'));\n const parent = nodesMap[node.parentPath];\n parent.children.push(node);\n\n }","function populate_parent(astroot) {\n\n function visit(node, parent) {\n if (!node || typeof node.type !== \"string\") {\n return;\n }\n\n for ( var prop in node) {\n if (node.hasOwnProperty(prop)) {\n\n // skip cyclic reference\n // at least for try-statement\n if (prop === '__parent__') {\n continue;\n }\n\n var child = node[prop];\n if (Array.isArray(child)) {\n for (var i = 0; i < child.length; i++) {\n visit(child[i], node);\n }\n }\n else {\n visit(child, node);\n }\n }\n }\n\n // must be post\n node.__parent__ = parent;\n }\n visit(astroot, null);\n}","propagateDownFromRight(node, parentPos, rightSibling) {\n let parentElement = node.parent.popAt(parentPos);\n this.addAtLastIndexOfCallStack(\n this.undoPopAt.bind(this, parentElement, node.parent, parentPos)\n );\n\n if (node.parent.hasLeftChildAt(parentPos)) {\n let nodeParentAtLeftChildOldValue = node.parent.at(parentPos).leftChild;\n node.parent.at(parentPos).leftChild = node;\n this.addAtLastIndexOfCallStack(\n () => {\n node.parent.at(parentPos).leftChild = nodeParentAtLeftChildOldValue;\n }\n )\n }\n\n let parentElementLeftChildOldValue = parentElement.leftChild;\n parentElement.leftChild = node.hasRightmostChild() ? node.getRightmostChild() : this.recentNode;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.leftChild = parentElementLeftChildOldValue;\n }\n );\n\n let parentElementRightChildOldValue = parentElement.rightChild;\n parentElement.rightChild = null;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.rightChild = parentElementRightChildOldValue;\n }\n );\n\n node.addLast(parentElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddLast.bind(this, node)\n );\n\n let nodeIsLeafOldValue = node.isLeaf;\n node.isLeaf = node.isLeaf && rightSibling.isLeaf;\n this.addAtLastIndexOfCallStack(\n () => {\n node.isLeaf = nodeIsLeafOldValue;\n }\n );\n\n this.mergeToLeft(node, rightSibling);\n\n\n if (node.parent === this.root && this.root.size() === 0) {\n let rootOldValue = this.root;\n this.root = node;\n this.addAtLastIndexOfCallStack(\n () => {\n this.root = rootOldValue;\n }\n )\n\n let nodeParentOldValue = node.parent;\n node.parent = null;\n this.addAtLastIndexOfCallStack(\n () => {\n node.parent = nodeParentOldValue;\n }\n );\n }\n }","function appendBuiltContent (ancestorBranches, key, node) {\n Object(__WEBPACK_IMPORTED_MODULE_1__ascent__[\"c\" /* nodeOf */])(Object(__WEBPACK_IMPORTED_MODULE_3__lists__[\"g\" /* head */])(ancestorBranches))[key] = node\n }","function append(node, item, offset) {\n\n\t\titem.offset = ++offset;\n\t\tsiblingIndex.add(item);\n\t\tnode.children.push(item);\n\t\titem.parent = node;\n\t\titem.id = id++;\n\t\ttree.push(item);\n\n\t}","function _build(_lst, _parent) {\n for (var i = 0; i < _lst.length; i++) {\n var node = _lst[i];\n node._parent = _parent; // public assign of parent; ugly \n if (node.children) {\n _build(node.children, node);\n }\n }\n }","function recursiveAdd(node) {\n // node.depth = depth;\n if (node.data.name !== 'ROOT') {\n descendants.push(node);\n }\n if (node.children) {\n node.children.forEach(d => recursiveAdd(d));\n }\n }","setRightAndUpdateParent(node) {\n this.right = node;\n if (node) {\n node.parent = this;\n node.parentSide = RIGHT;\n }\n }","_replaceWith(node) {\n if (this.parent) {\n if (this == this.parent.left) {\n this.parent.left = node;\n } else if (this == this.parent.right) {\n this.parent.right = node;\n }\n\n if (node) {\n node.parent = this.parent;\n }\n } else {\n if (node) {\n this.key = node.key;\n this.value = node.value;\n this.left = node.left;\n this.right = node.right;\n } else {\n this.key = null;\n this.value = null;\n this.left = null;\n this.right = null;\n }\n }\n }","function insert(node, parent, tight) {\n var children = parent.children\n var length = children.length\n var last = children[length - 1]\n var isLoose = false\n var index\n var item\n\n if (node.depth === 1) {\n item = listItem()\n\n item.children.push({\n type: PARAGRAPH,\n children: [\n {\n type: LINK,\n title: null,\n url: '#' + node.id,\n children: [{type: TEXT, value: node.value}]\n }\n ]\n })\n\n children.push(item)\n } else if (last && last.type === LIST_ITEM) {\n insert(node, last, tight)\n } else if (last && last.type === LIST) {\n node.depth--\n\n insert(node, last, tight)\n } else if (parent.type === LIST) {\n item = listItem()\n\n insert(node, item, tight)\n\n children.push(item)\n } else {\n item = list()\n node.depth--\n\n insert(node, item, tight)\n\n children.push(item)\n }\n\n // Properly style list-items with new lines.\n parent.spread = !tight\n\n if (parent.type === LIST && parent.spread) {\n parent.spread = false\n index = -1\n\n while (++index < length) {\n if (children[index].children.length > 1) {\n parent.spread = true\n break\n }\n }\n }\n\n // To do: remove `loose` in next major release.\n if (parent.type === LIST_ITEM) {\n parent.loose = tight ? false : children.length > 1\n } else {\n if (tight) {\n isLoose = false\n } else {\n index = -1\n\n while (++index < length) {\n if (children[index].loose) {\n isLoose = true\n\n break\n }\n }\n }\n\n index = -1\n\n while (++index < length) {\n children[index].loose = isLoose\n }\n }\n}","function add_parent_links(node) {\n\tfor(var c = 0; c < node.children.length; c++) {\n\t\tnode.children[c].parent = node;\n\t\tadd_parent_links(node.children[c]);\n\t}\n}","function moveNode(node, parent) {\n\tvar n = document.getElementById(node);\n\tvar p = document.getElementById(parent);\n\tif (n != undefined && n !== null && p != undefined && p !== null) {\n\t\tp.appendChild(n.parentNode.removeChild(n));\n\t}\n}","function mergeText(prev, node) {\n prev.value += node.value;\n\n return prev;\n}","function mergeText(prev, node) {\n prev.value += node.value;\n\n return prev;\n}","function mergeText(prev, node) {\n prev.value += node.value;\n\n return prev;\n}","function mergeText(prev, node) {\n prev.value += node.value;\n\n return prev;\n}","function mergeText(prev, node) {\n prev.value += node.value;\n\n return prev;\n}","function mergeText(prev, node) {\n prev.value += node.value;\n\n return prev;\n}","function mutation_insert_single(node, parent, suppressObservers) {\n /**\n * 1. Let count be the number of children of node if it is a\n * DocumentFragment node, and one otherwise.\n * 2. If child is non-null, then:\n * 2.1. For each live range whose start node is parent and start\n * offset is greater than child's index, increase its start\n * offset by count.\n * 2.2. For each live range whose end node is parent and end\n * offset is greater than child's index, increase its end\n * offset by count.\n * 3. Let nodes be node’s children, if node is a DocumentFragment node;\n * otherwise « node ».\n * 4. If node is a DocumentFragment node, remove its children with the\n * suppress observers flag set.\n * 5. If node is a DocumentFragment node, then queue a tree mutation record\n * for node with « », nodes, null, and null.\n */\n /**\n * 6. Let previousSibling be child’s previous sibling or parent’s last\n * child if child is null.\n */\n const previousSibling = parent._lastChild;\n // set document element node\n if (util_1.Guard.isElementNode(node)) {\n // set document element node\n if (util_1.Guard.isDocumentNode(parent)) {\n parent._documentElement = node;\n }\n // mark that the document has namespaces\n if (!node._nodeDocument._hasNamespaces && (node._namespace !== null ||\n node._namespacePrefix !== null)) {\n node._nodeDocument._hasNamespaces = true;\n }\n }\n /**\n * 7. For each node in nodes, in tree order:\n * 7.1. If child is null, then append node to parent’s children.\n * 7.2. Otherwise, insert node into parent’s children before child’s\n * index.\n */\n node._parent = parent;\n parent._children.add(node);\n // assign siblings and children for quick lookups\n if (parent._firstChild === null) {\n node._previousSibling = null;\n node._nextSibling = null;\n parent._firstChild = node;\n parent._lastChild = node;\n }\n else {\n const prev = parent._lastChild;\n node._previousSibling = prev;\n node._nextSibling = null;\n if (prev)\n prev._nextSibling = node;\n if (!prev)\n parent._firstChild = node;\n parent._lastChild = node;\n }\n /**\n * 7.3. If parent is a shadow host and node is a slotable, then\n * assign a slot for node.\n */\n if (dom_1.dom.features.slots) {\n if (parent._shadowRoot !== null && util_1.Guard.isSlotable(node)) {\n ShadowTreeAlgorithm_1.shadowTree_assignASlot(node);\n }\n }\n /**\n * 7.4. If node is a Text node, run the child text content change\n * steps for parent.\n */\n if (dom_1.dom.features.steps) {\n if (util_1.Guard.isTextNode(node)) {\n DOMAlgorithm_1.dom_runChildTextContentChangeSteps(parent);\n }\n }\n /**\n * 7.5. If parent's root is a shadow root, and parent is a slot\n * whose assigned nodes is the empty list, then run signal\n * a slot change for parent.\n */\n if (dom_1.dom.features.slots) {\n if (util_1.Guard.isShadowRoot(TreeAlgorithm_1.tree_rootNode(parent)) &&\n util_1.Guard.isSlot(parent) && util_2.isEmpty(parent._assignedNodes)) {\n ShadowTreeAlgorithm_1.shadowTree_signalASlotChange(parent);\n }\n }\n /**\n * 7.6. Run assign slotables for a tree with node's root.\n */\n if (dom_1.dom.features.slots) {\n ShadowTreeAlgorithm_1.shadowTree_assignSlotablesForATree(TreeAlgorithm_1.tree_rootNode(node));\n }\n /**\n * 7.7. For each shadow-including inclusive descendant\n * inclusiveDescendant of node, in shadow-including tree\n * order:\n * 7.7.1. Run the insertion steps with inclusiveDescendant.\n */\n if (dom_1.dom.features.steps) {\n DOMAlgorithm_1.dom_runInsertionSteps(node);\n }\n if (dom_1.dom.features.customElements) {\n /**\n * 7.7.2. If inclusiveDescendant is connected, then:\n */\n if (util_1.Guard.isElementNode(node) &&\n ShadowTreeAlgorithm_1.shadowTree_isConnected(node)) {\n if (util_1.Guard.isCustomElementNode(node)) {\n /**\n * 7.7.2.1. If inclusiveDescendant is custom, then enqueue a custom\n * element callback reaction with inclusiveDescendant, callback name\n * \"connectedCallback\", and an empty argument list.\n */\n CustomElementAlgorithm_1.customElement_enqueueACustomElementCallbackReaction(node, \"connectedCallback\", []);\n }\n else {\n /**\n * 7.7.2.2. Otherwise, try to upgrade inclusiveDescendant.\n */\n CustomElementAlgorithm_1.customElement_tryToUpgrade(node);\n }\n }\n }\n /**\n * 8. If suppress observers flag is unset, then queue a tree mutation record\n * for parent with nodes, « », previousSibling, and child.\n */\n if (dom_1.dom.features.mutationObservers) {\n if (!suppressObservers) {\n MutationObserverAlgorithm_1.observer_queueTreeMutationRecord(parent, [node], [], previousSibling, null);\n }\n }\n}","function doTreesMerge(newLvl, existingLvl, newParentId, existingParentId, tP) { //console.log(\"doTreesMerge called. newLvl = %s, existingLvl = %s, newParent = %s, existingParent = %s\", newLvl, existingLvl, taxaNameMap[newParentId], taxaNameMap[existingParentId])\n if (newLvl > existingLvl) { // more specific taxon\n if (treesMergeAtHigherLevel(tP.taxaObjs[taxaNameMap[newParentId]], existingParentId, tP)) {\n tP.recrd.parent = newParentId; \t\t\t\t\t\t// console.log(\"trees merge\");\n }\n } else { confirmDirectRelationship(tP.taxaObjs[taxaNameMap[newParentId]], newParentId); }\n /**\n * If the taxon has a less specific direct parent in this record than in one previously processed, \n * check to ensure the existing parent is a child of the parent taxon in this record.\n */\n function confirmDirectRelationship(existingTaxonObj, newParentId) { \n if (!isChild(existingTaxonObj)) { // No case yet. TODO: add to Complex Errors\n console.log(\"trees don't merge. newParent =%s, existing =%s, rcrd = %O, existingParent = %O\", taxaNameMap[newParentId], taxaNameMap[existingParentId], tP.recrd, tP.taxaObjs[taxaNameMap[existingParentId]].name); \n }\n\n function isChild(existingParnt) { // console.log(\"existingParnt - %s, existingParntLvl - %s, tP.taxaObjs = %O\", existingParnt.name, existingParnt.level, tP.taxaObjs)\n if ( existingParnt.level === newLvl ) { //console.log(\"levels equal. existingId = %s, newParentId = %s\", existingParnt.tempId, newParentId)\n if ( existingParnt.tempId === newParentId ) { return true; \n } else { return false; }\n }\n if ( existingParnt.parent === newParentId ) { return true;\n } else { return isChild(existingParnt.parent); }\n }\n }\n }","function insert(node, parent_id, sort)\n {\n var li, parent_li,\n parent_node = parent_id ? indexbyid[parent_id] : null\n search_ = search_active;\n\n // ignore, already exists\n if (indexbyid[node.id]) {\n return;\n }\n\n // apply saved state\n state = get_state(node.id, node.collapsed);\n if (state !== undefined) {\n node.collapsed = state;\n }\n\n // insert as child of an existing node\n if (parent_node) {\n node.level = parent_node.level + 1;\n if (!parent_node.children)\n parent_node.children = [];\n\n search_active = false;\n parent_node.children.push(node);\n parent_li = id2dom(parent_id);\n\n // re-render the entire subtree\n if (parent_node.children.length == 1) {\n render_node(parent_node, null, parent_li);\n li = id2dom(node.id);\n }\n else {\n // append new node to parent's child list\n li = render_node(node, parent_li.children('ul').first());\n }\n\n // list is in search mode\n if (search_) {\n search_active = search_;\n\n // add clone to current search results (top level)\n if (!li.is(':visible')) {\n $('<li>')\n .attr('id', li.attr('id') + '--xsR')\n .attr('class', li.attr('class'))\n .addClass('searchresult__')\n .append(li.children().first().clone(true, true))\n .appendTo(container);\n }\n }\n }\n // insert at top level\n else {\n node.level = 0;\n data.push(node);\n li = render_node(node, container);\n }\n\n indexbyid[node.id] = node;\n\n // set new reference to node.html after insert\n // will otherwise vanish in Firefox 3.6\n if (typeof node.html == 'object') {\n indexbyid[node.id].html = id2dom(node.id, true).children();\n }\n\n if (sort) {\n resort_node(li, typeof sort == 'string' ? '[class~=\"' + sort + '\"]' : '');\n }\n }","function setChild(parent, node) {\n\n var c, newNode, currentDocument = parent._ownerDocument || parent;\n\n switch (node.type)\n {\n case 'tag':\n case 'script':\n case 'style':\n try {\n newNode = currentDocument.createElement(node.name);\n if (node.location) {\n newNode.sourceLocation = node.location;\n newNode.sourceLocation.file = parent.sourceLocation.file;\n }\n } catch (err) {\n currentDocument.trigger('error', 'invalid markup', {\n exception: err,\n node : node\n });\n\n return null;\n }\n break;\n\n case 'text':\n newNode = currentDocument.createTextNode(HTMLDecode(node.data));\n break;\n\n case 'comment':\n newNode = currentDocument.createComment(node.data);\n break;\n\n default:\n return null;\n break;\n }\n\n if (!newNode)\n return null;\n\n if (node.attribs) {\n for (c in node.attribs) {\n // catchin errors here helps with improperly escaped attributes\n // but properly fixing parent should (can only?) be done in the htmlparser itself\n try {\n newNode.setAttribute(c.toLowerCase(), HTMLDecode(node.attribs[c]));\n } catch(e2) { /* noop */ }\n }\n }\n\n if (node.children) {\n for (c = 0; c < node.children.length; c++) {\n setChild(newNode, node.children[c]);\n }\n }\n\n return parent.appendChild(newNode);\n}","function inorder(node){\n if(!_.isNull(node.left)) inorder(node.left)\n trav.push({\"key\": node.key, \"value\": node.value, \"children\": [_.get(node, \"left.value\", \"null\"), _.get(node, \"right.value\", \"null\")]})\n if(!_.isNull(node.right)) inorder(node.right)\n}","function addParent(obj, parent) {\n const isNode = obj && typeof obj.type === 'string';\n const childParent = isNode ? obj : parent;\n\n for (const k in obj) {\n const value = obj[k];\n\n if (Array.isArray(value)) {\n value.forEach(function (v) {\n addParent(v, childParent);\n });\n } else if (value && typeof value === 'object') {\n addParent(value, childParent);\n }\n }\n\n if (isNode) {\n Object.defineProperty(obj, 'parent', {\n configurable: true,\n writable: true,\n enumerable: false,\n value: parent || null\n });\n }\n\n return obj;\n}","function addParent(obj, parent) {\n var isNode = obj && typeof obj.type === 'string'\n var childParent = isNode ? obj : parent\n\n for (var k in obj) {\n var value = obj[k]\n if (Array.isArray(value)) {\n value.forEach(function(v) {\n addParent(v, childParent)\n })\n } else if (value && typeof value === 'object') {\n addParent(value, childParent)\n }\n }\n\n if (isNode) {\n Object.defineProperty(obj, 'parent', {\n configurable: true,\n writable: true,\n enumerable: false,\n value: parent || null,\n })\n }\n\n return obj\n}","function addParent(obj, parent) {\n var isNode = obj && typeof obj.type === 'string';\n var childParent = isNode ? obj : parent;\n for (var k in obj) {\n var value = obj[k];\n if (Array.isArray(value)) {\n value.forEach(function (v) { addParent(v, childParent); });\n }\n else if (value && typeof value === 'object') {\n addParent(value, childParent);\n }\n }\n if (isNode) {\n Object.defineProperty(obj, 'parent', {\n configurable: true,\n writable: true,\n enumerable: false,\n value: parent || null\n });\n }\n return obj;\n}","function addParent(obj, parent) {\n\t var isNode = obj && typeof obj.type === 'string';\n\t var childParent = isNode ? obj : parent;\n\n\t for (var k in obj) {\n\t var value = obj[k];\n\t if (Array.isArray(value)) {\n\t value.forEach(function(v) { addParent(v, childParent); });\n\t } else if (value && typeof value === 'object') {\n\t addParent(value, childParent);\n\t }\n\t }\n\n\t if (isNode) {\n\t Object.defineProperty(obj, 'parent', {\n\t configurable: true,\n\t writable: true,\n\t enumerable: false,\n\t value: parent || null\n\t });\n\t }\n\n\t return obj;\n\t}"],"string":"[\n \"function add(node, parent) {\\n var children = parent ? parent.children : tokens\\n var previous = children[children.length - 1]\\n var fn\\n\\n if (\\n previous &&\\n node.type === previous.type &&\\n (node.type === 'text' || node.type === 'blockquote') &&\\n mergeable(previous) &&\\n mergeable(node)\\n ) {\\n fn = node.type === 'text' ? mergeText : mergeBlockquote\\n node = fn.call(self, previous, node)\\n }\\n\\n if (node !== previous) {\\n children.push(node)\\n }\\n\\n if (self.atStart && tokens.length !== 0) {\\n self.exitStart()\\n }\\n\\n return node\\n }\",\n \"function add (node, parent) {\\n parent.children.push(node)\\n if (parser.position) {\\n parent.position = {\\n start: parent.children[0].position.start,\\n end: node.position.end\\n }\\n }\\n }\",\n \"function mutation_append(node, parent) {\\n /**\\n * To append a node to a parent, pre-insert node into parent before null.\\n */\\n return mutation_preInsert(node, parent, null);\\n}\",\n \"function union(nodeA, nodeB, parent) {\\n let parentA = findParent(nodeA, parent);\\n let parentB = findParent(nodeB, parent);\\n parent[parentB] = parentA;\\n}\",\n \"function addNodes(parent, nodes) {\\n return nodes ? { ...parent, nodes } : parent;\\n }\",\n \"function apply(node, parent) {\\n return pos(add(pos(node), parent), indent);\\n }\",\n \"function apply(node, parent) {\\n return pos(add(pos(node), parent), indent);\\n }\",\n \"function apply(node, parent) {\\n return pos(add(pos(node), parent), indent);\\n }\",\n \"function apply(node, parent) {\\n return pos(add(pos(node), parent), indent);\\n }\",\n \"function apply(node, parent) {\\n return pos(add(pos(node), parent), indent);\\n }\",\n \"appendToTree(Node) {\\n this.tree = {...this.tree, ...Node};\\n }\",\n \"function addNode(parent_id, node_data, user, done) {\\n\\n Node.findById(parent_id, function (error, parent_node) {\\n if (error) {\\n return done(error);\\n }\\n\\n if (!parent_node) {\\n return done('This parent node doesn\\\\'t exist');\\n }\\n\\n // Assign task ID.\\n // Task IDs are incremental, prefixed by parent task IDs.\\n var taskId = 1;\\n if (typeof parent_node.last_task_id !== 'undefined') {\\n taskId = parent_node.last_task_id + 1;\\n }\\n\\n var node = new Node({\\n title: node_data.title,\\n user: user._id,\\n _parent: parent_node._id,\\n level: parent_node.level + 1,\\n path: (parent_node.path) ? (parent_node.path + ',' + parent_node._id) : parent_node._id,\\n _project: parent_node._project,\\n task_id: parent_node.task_id + '.' + taskId,\\n });\\n\\n // Save the last task ID.\\n parent_node.set('last_task_id', taskId);\\n parent_node.save();\\n\\n node.save(function (error) {\\n if (error) {\\n return done(error);\\n }\\n\\n parent_node._nodes.unshift(node._id);\\n parent_node.save(function (err) {});\\n\\n done(null, node, parent_node);\\n\\n });\\n });\\n}\",\n \"function apply(node, parent) {\\n return pos(add(pos(node), parent), indent)\\n }\",\n \"function appendNode(parent, node) {\\n\\n // Handle the replacement based on the type\\n if (isElement(node) == true)\\n parent.appendChild(node);\\n else {\\n var el = document.createElement(\\\"div\\\");\\n el.innerHTML = node;\\n\\n var nodes = [];\\n\\n // Populate the nodes\\n for (var i = 0; i < el.childNodes.length; i++)\\n nodes.push(el.childNodes[i]);\\n\\n // Insert all the nodes\\n for (i = 0; i < nodes.length; i++)\\n parent.appendChild(nodes[i]);\\n\\n }\\n\\n // Return\\n return;\\n\\n }\",\n \"shiftNodeUp(node) {\\n\\n\\t\\tif (node.parent == null) {\\n\\t\\t\\tthis.root = node;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tif (node.priority <= node.parent.priority) {\\n\\t\\t\\treturn;\\n\\n\\t\\t} else if (this.parentNodes.length != 0) {\\n\\t\\t\\tvar indexOfNode = this.parentNodes.indexOf (node);\\n\\t\\t\\tvar indexOfNodeParent = this.parentNodes.indexOf (node.parent);\\n\\t\\t\\tif ( indexOfNode != -1) {\\n\\t\\t\\t\\tthis.parentNodes[indexOfNode] = node.parent;\\n\\t\\t\\t\\tif (indexOfNodeParent != -1) {\\n\\t\\t\\t\\t\\tthis.parentNodes[indexOfNodeParent] = node;\\n\\t\\t\\t\\t}\\t\\n\\t\\t\\t}\\t\\n\\n\\t\\tif (this.root == node.parent) { \\n\\t\\t\\tthis.root = node; \\n\\t\\t}\\n\\n\\t\\tnode.swapWithParent ();\\n\\t\\tthis.shiftNodeUp(node);\\n\\t\\t} \\t\\n\\t}\",\n \"function walkAddParent(ast, fn) {\\n let stack = [ast], i, j, key, len, node, child, subchild;\\n for (i = 0; i < stack.length; i += 1) {\\n node = stack[i];\\n fn(node);\\n for (key in node) {\\n if (key !== 'parent' && key.substr(0, 3) != 'fp_') {\\n child = node[key];\\n if (child instanceof Array) {\\n for (j = 0, len = child.length; j < len; j += 1) {\\n subchild = child[j];\\n if (subchild instanceof Object) {\\n subchild.parent = node;\\n }\\n stack.push(subchild);\\n }\\n }\\n else if (child != void 0 && typeof child.type === 'string') {\\n child.parent = node;\\n stack.push(child);\\n }\\n }\\n }\\n }\\n}\",\n \"addSibling(node){\\r\\n\\t\\tif(this.parent != null){\\r\\n\\t\\t\\tvar childrenList = this.parent.children;\\r\\n\\t\\t\\tchildrenList[childrenList.length] = node;\\r\\n\\t\\t\\tnode.parent = this.parent;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"function mergeBlockquote(prev, node) {\\n if (this.options.commonmark) {\\n return node;\\n }\\n\\n prev.children = prev.children.concat(node.children);\\n\\n return prev;\\n}\",\n \"function mergeBlockquote(prev, node) {\\n if (this.options.commonmark) {\\n return node;\\n }\\n\\n prev.children = prev.children.concat(node.children);\\n\\n return prev;\\n}\",\n \"function mergeBlockquote(prev, node) {\\n if (this.options.commonmark) {\\n return node;\\n }\\n\\n prev.children = prev.children.concat(node.children);\\n\\n return prev;\\n}\",\n \"function mergeBlockquote(prev, node) {\\n if (this.options.commonmark) {\\n return node;\\n }\\n\\n prev.children = prev.children.concat(node.children);\\n\\n return prev;\\n}\",\n \"function mergeBlockquote(prev, node) {\\n if (this.options.commonmark) {\\n return node;\\n }\\n\\n prev.children = prev.children.concat(node.children);\\n\\n return prev;\\n}\",\n \"function mergeBlockquote(prev, node) {\\n if (this.options.commonmark) {\\n return node;\\n }\\n\\n prev.children = prev.children.concat(node.children);\\n\\n return prev;\\n}\",\n \"addParent(node, parent) {\\n // implement by subclass\\n }\",\n \"function mergeBlockquote(previous, node) {\\n if (this.options.commonmark || this.options.gfm) {\\n return node\\n }\\n\\n previous.children = previous.children.concat(node.children)\\n\\n return previous\\n}\",\n \"mergeToRight(leftNode, rightNode) {\\n if (!leftNode.empty()) {\\n\\n let rightNodeFirstLeftChildOldValue = rightNode.first().leftChild;\\n rightNode.first().leftChild = leftNode.getRightmostChild();\\n this.addAtLastIndexOfCallStack(\\n () => {\\n rightNode.first().leftChild = rightNodeFirstLeftChildOldValue;\\n }\\n );\\n\\n if (rightNode.hasLeftmostChild()) {\\n let rightNodeFirstLeftChildParentOldValue = rightNode.first().leftChild.parent;\\n rightNode.first().leftChild.parent = rightNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n rightNode.first().leftChild.parent = rightNodeFirstLeftChildParentOldValue;\\n }\\n );\\n }\\n while (!leftNode.empty()) {\\n let leftNodeElement = leftNode.popLast();\\n this.addAtLastIndexOfCallStack(\\n this.undoPopLast.bind(this, leftNodeElement, leftNode)\\n );\\n\\n rightNode.addFirst(leftNodeElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddFirst.bind(this, rightNode)\\n );\\n\\n if (rightNode.first().leftChild !== null) {\\n let rightNodeFirstLeftChildParentOldValue = rightNode.first().leftChild.parent;\\n rightNode.first().leftChild.parent = rightNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n rightNode.first().leftChild.parent = rightNodeFirstLeftChildParentOldValue;\\n }\\n );\\n }\\n if (rightNode.first().rightChild !== null) {\\n let rightNodeFirstRightChildParentOldValue = rightNode.first().rightChild.parent;\\n rightNode.first().rightChild.parent = rightNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n rightNode.first().rightChild.parent = rightNodeFirstRightChildParentOldValue;\\n }\\n );\\n }\\n }\\n }\\n\\n let leftNodeParentOldValue = leftNode.parent;\\n leftNode.parent = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n leftNode.parent = leftNodeParentOldValue;\\n }\\n )\\n\\n let leftNodeOldValue = leftNode;\\n leftNode = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n leftNode = leftNodeOldValue;\\n }\\n );\\n\\n }\",\n \"function merge(target, source) {\\n target.additionalNodes = target.additionalNodes || [];\\n target.additionalNodes.push(source.node);\\n if (source.additionalNodes) {\\n (_a = target.additionalNodes).push.apply(_a, source.additionalNodes);\\n }\\n target.children = ts.concatenate(target.children, source.children);\\n if (target.children) {\\n mergeChildren(target.children);\\n sortChildren(target.children);\\n }\\n var _a;\\n }\",\n \"function _onNodeAction (node, parent) {\\n var par = parent;\\n\\n node.setParent = function (newParent) {\\n par = newParent;\\n };\\n\\n /**\\n * Method getParent\\n *\\n * Method return parent of the node\\n *\\n * @returns {*}\\n */\\n node.getParent = function () {\\n return par;\\n };\\n\\n /**\\n * Method getNext\\n *\\n * Method returns next node in subnodes array or null if current node is last in array\\n *\\n * @returns {*}\\n */\\n node.getNext = function () {\\n var index,\\n nextNode;\\n\\n if (parent !== null) {\\n index = parent.subnodes.indexOf(node);\\n nextNode = parent.subnodes[index+1];\\n\\n return (typeof nextNode !== 'undefined') ? nextNode : null;\\n } else {\\n return null;\\n }\\n };\\n\\n /**\\n * Method getPrev\\n *\\n * Method returns previous node in subnodes array or null if current node is first in array\\n *\\n * @returns {*}\\n */\\n node.getPrev = function () {\\n var index,\\n prevNode;\\n\\n if (parent !== null) {\\n index = parent.subnodes.indexOf(node);\\n prevNode = parent.subnodes[index-1];\\n\\n return (typeof prevNode !== 'undefined') ? prevNode : null;\\n } else {\\n return null;\\n }\\n };\\n\\n /*\\n Add levels indicators to nested subtrees.\\n */\\n node.level = (parent === null) ? 1 : parent.level + 1;\\n\\n\\n if (angular.isArray(node.subnodes)) {\\n for (var i = 0, len = node.subnodes.length; i < len; i++) {\\n _onNodeAction(node.subnodes[i], node);\\n }\\n }\\n }\",\n \"function _insertBefore(parent, node, refNode) {\\n\\t\\tparent.insertBefore(node, refNode);\\n\\t}\",\n \"function mutation_replaceAll(node, parent) {\\n /**\\n * 1. If node is not null, adopt node into parent’s node document.\\n */\\n if (node !== null) {\\n DocumentAlgorithm_1.document_adopt(node, parent._nodeDocument);\\n }\\n /**\\n * 2. Let removedNodes be parent’s children.\\n */\\n const removedNodes = Array.from(parent._children);\\n /**\\n * 3. Let addedNodes be the empty list.\\n * 4. If node is DocumentFragment node, then set addedNodes to node’s\\n * children.\\n * 5. Otherwise, if node is non-null, set addedNodes to [node].\\n */\\n let addedNodes = [];\\n if (node && node._nodeType === interfaces_1.NodeType.DocumentFragment) {\\n addedNodes = Array.from(node._children);\\n }\\n else if (node !== null) {\\n addedNodes.push(node);\\n }\\n /**\\n * 6. Remove all parent’s children, in tree order, with the suppress\\n * observers flag set.\\n */\\n for (const childNode of removedNodes) {\\n mutation_remove(childNode, parent, true);\\n }\\n /**\\n * 7. If node is not null, then insert node into parent before null with the\\n * suppress observers flag set.\\n */\\n if (node !== null) {\\n mutation_insert(node, parent, null, true);\\n }\\n /**\\n * 8. Queue a tree mutation record for parent with addedNodes, removedNodes,\\n * null, and null.\\n */\\n if (dom_1.dom.features.mutationObservers) {\\n MutationObserverAlgorithm_1.observer_queueTreeMutationRecord(parent, addedNodes, removedNodes, null, null);\\n }\\n}\",\n \"add_node(parent, child) {\\n if (!this._is_node(parent)) {\\n console.error(\\\"[ERROR] can't add a data that is not a node : 'parent' is not a node\\\")\\n }\\n if (!this._is_node(child)) {\\n console.error(\\\"[ERROR] can't add a data that is not a node : 'child' is not a node\\\")\\n }\\n\\n if (this._id_set.includes(child.id)) {\\n console.error(\\\"[ERROR] id '\\\" + child.id + \\\"' already exist in the tree\\\");\\n return;\\n }\\n\\n if (typeof child.parent_node !== 'undefined') {\\n console.error(\\\"[ERROR] can't add a node that has a parent : 'child' already has a parent\\\");\\n return;\\n }\\n\\n child.parent_node = parent;\\n parent.child_list.push(child);\\n this._id_set.push(child.id);\\n }\",\n \"process(node) {\\n let parent = this.parentPrefix(node)\\n\\n for (let prefix of this.prefixes) {\\n if (!parent || parent === prefix) {\\n this.add(node, prefix)\\n }\\n }\\n }\",\n \"mergeToLeft(leftNode, rightNode) {\\n if (!rightNode.empty()) {\\n let leftNodeLastRightChildOldValue = leftNode.last().rightChild;\\n leftNode.last().rightChild = rightNode.getLeftmostChild();\\n this.addAtLastIndexOfCallStack(\\n () => {\\n leftNode.last().rightChild = leftNodeLastRightChildOldValue;\\n }\\n )\\n if (leftNode.hasRightmostChild()) {\\n let leftNodeLastRightChildParentOldValue = leftNode.last().rightChild.parent;\\n leftNode.last().rightChild.parent = leftNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n leftNode.last().rightChild.parent = leftNodeLastRightChildParentOldValue;\\n }\\n );\\n }\\n while (!rightNode.empty()) {\\n let rightNodeElement = rightNode.popFirst();\\n this.addAtLastIndexOfCallStack(\\n this.undoPopFirst.bind(this, rightNodeElement, rightNode)\\n );\\n leftNode.addLast(rightNodeElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddLast.bind(this, leftNode)\\n )\\n if (leftNode.last().leftChild != null) {\\n let leftNodeLastLeftChildParentOldValue = leftNode.last().leftChild.parent;\\n leftNode.last().leftChild.parent = leftNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n leftNode.last().leftChild.parent = leftNodeLastLeftChildParentOldValue;\\n }\\n )\\n }\\n if (leftNode.last().rightChild != null) {\\n let leftNodeLastRightChildParentOldValue = leftNode.last().rightChild.parent;\\n leftNode.last().rightChild.parent = leftNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n leftNode.last().rightChild.parent = leftNodeLastRightChildParentOldValue\\n }\\n );\\n }\\n }\\n }\\n\\n let rightNodeParentOldValue = rightNode.parent;\\n rightNode.parent = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n rightNode.parent = rightNodeParentOldValue;\\n }\\n );\\n\\n let rightNodeOldValue = rightNode;\\n rightNode = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n rightNode = rightNodeOldValue;\\n }\\n );\\n }\",\n \"liftUp(node, parentIndex, side) {\\n let parentElement = node.popAt(Math.floor(this.base / 2));\\n this.addAtLastIndexOfCallStack(\\n this.undoPopAt.bind(this, parentElement, node, Math.floor(this.base / 2))\\n );\\n let newNode = this.split(node);\\n\\n if (!node.hasParent()) {\\n node.parent = new BNode();\\n let nodeParentIsLeafOldValue = node.parent.isLeaf;\\n node.parent.isLeaf = false;\\n this.addAtLastIndexOfCallStack(() => {\\n node.parent.isLeaf = nodeParentIsLeafOldValue;\\n });\\n }\\n\\n if (this.root === node) {\\n let rootOldValue = this.root;\\n this.root = node.parent;\\n this.addAtLastIndexOfCallStack(() => {\\n this.root = rootOldValue\\n });\\n }\\n\\n let newNodeParentOldValue = newNode.parent;\\n newNode.parent = node.parent;\\n this.addAtLastIndexOfCallStack(() => {\\n newNode.parent = newNodeParentOldValue;\\n });\\n\\n let parentElementLeftChildOldValue = parentElement.leftChild;\\n parentElement.leftChild = node;\\n this.addAtLastIndexOfCallStack(() => {\\n parentElement.leftChild = parentElementLeftChildOldValue\\n });\\n\\n let parentElementRightChildOldValue = parentElement.rightChild;\\n parentElement.rightChild = newNode;\\n this.addAtLastIndexOfCallStack(() => {\\n parentElement.rightChild = parentElementRightChildOldValue;\\n });\\n\\n if (node.parent.empty() || (parentIndex === node.parent.size() - 1 && side === true)) {\\n node.parent.addLast(parentElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddLast.bind(this, node.parent)\\n );\\n } else {\\n if (node.parent.hasLeftChildAt(parentIndex)) {\\n let nodeParentAtLeftChildOldValue = node.parent.at(parentIndex).leftChild;\\n node.parent.at(parentIndex).leftChild = parentElement.rightChild;\\n this.addAtLastIndexOfCallStack(() => {\\n node.parent.at(parentIndex).leftChild = nodeParentAtLeftChildOldValue;\\n });\\n }\\n\\n if (node.parent.hasRightChildAt(parentIndex - 1)) {\\n let nodeParentAtRightChildOldValue = node.parent.at(parentIndex - 1).rightChild;\\n node.parent.at(parentIndex - 1).rightChild = parentElement.leftChild;\\n this.addAtLastIndexOfCallStack(() => {\\n node.parent.at(parentIndex - 1).rightChild = nodeParentAtRightChildOldValue;\\n });\\n }\\n\\n node.parent.addAt(parentIndex, parentElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddAt.bind(this, node.parent, parentIndex)\\n );\\n }\\n\\n let nodeParentIsLeafOldValue = node.parent.isLeaf;\\n node.parent.isLeaf = false;\\n this.addAtLastIndexOfCallStack(() => {\\n node.parent.isLeaf = nodeParentIsLeafOldValue;\\n })\\n }\",\n \"function addChildNode(child, node, sourceFile, appId) {\\n var childType = child.type;\\n if (child.type === \\\"Literal\\\") {\\n if (child.value != undefined && typeof child.value === 'string') {\\n childType = \\\"StringLiteral\\\";\\n }\\n else if (child.value != undefined && typeof child.value === 'number') {\\n childType = \\\"NumberLiteral\\\";\\n }\\n else if (child.value != undefined && typeof child.value == 'boolean') {\\n childType = \\\"BooleanLiteral\\\";\\n }\\n }\\n\\n var hasLoc = (child.loc != undefined), lineNumber, columnNumber;\\n if (hasLoc) {\\n lineNumber = child.loc.start.line;\\n columnNumber = child.loc.start.column;\\n }\\n\\n //Add this in the childNodes array of the current node\\n var newCodeTreeNode = new CodeTreeNode(\\\"ast\\\", childType, node.codetreeref, sourceFile, appId);\\n if (child.type === \\\"Literal\\\") newCodeTreeNode.abstractOut();\\n if (hasLoc) newCodeTreeNode.addLoc(lineNumber, columnNumber);\\n node.codetreeref.addChild(newCodeTreeNode);\\n child.codetreeref = newCodeTreeNode;\\n\\n //Add values if necessary\\n if (child.type === \\\"Literal\\\" && child.raw != undefined) {\\n var newLiteralNode = new CodeTreeNode(\\\"ast\\\", \\\"\\\" + child.raw, newCodeTreeNode, sourceFile, appId);\\n if (hasLoc) newLiteralNode.addLoc(lineNumber, columnNumber);\\n newLiteralNode.abstractOut();\\n newCodeTreeNode.addChild(newLiteralNode);\\n }\\n else if (child.type === \\\"Identifier\\\" && child.name != undefined) {\\n var newNameNode = new CodeTreeNode(\\\"ast\\\", child.name, newCodeTreeNode, sourceFile, appId);\\n if (hasLoc) newNameNode.addLoc(lineNumber, columnNumber);\\n newNameNode.abstractOut();\\n newCodeTreeNode.addChild(newNameNode);\\n }\\n else if (child.type === \\\"BinaryExpression\\\" || child.type === \\\"UpdateExpression\\\" || child.type === \\\"UnaryExpression\\\") {\\n if (child.operator != undefined) {\\n var newOperatorNode = new CodeTreeNode(\\\"ast\\\", child.operator, newCodeTreeNode, \\n sourceFile, appId);\\n if (hasLoc) newOperatorNode.addLoc(lineNumber, columnNumber);\\n newCodeTreeNode.addChild(newOperatorNode);\\n }\\n if (child.prefix != undefined) {\\n var newPrefixNode = new CodeTreeNode(\\\"ast\\\", child.prefix + \\\"\\\", newCodeTreeNode, \\n sourceFile, appId);\\n if (hasLoc) newPrefixNode.addLoc(lineNumber, columnNumber);\\n newCodeTreeNode.addChild(newPrefixNode);\\n }\\n }\\n }\",\n \"function addToTree(parent, current, userquestion, userans) {\\n var newnode = {Q: userquestion, Y: userans, N: current};\\n // replace the guess in the parent node\\n if( current == parent.Y ) {\\n parent.Y = newnode;\\n } else if (current == parent.N) {\\n parent.N = newnode;\\n } else {\\n throw new Error(\\\"this shouldn't happen\\\");\\n }\\n}\",\n \"add(node) {\\n if (this.left === null) {\\n this.left = node;\\n return this.left;\\n } else if (this.right === null) {\\n this.right = node;\\n return this.right;\\n }\\n return null;\\n }\",\n \"merge(tree) {\\n let arr = tree.toArray();\\n for(let i=0; i<arr.length; i++) {\\n this.add(arr[i]);\\n }\\n }\",\n \"function setParent(node) {\\n if ('children' in node) {\\n for (var index in node.children) {\\n node.children[index].parent = node;\\n setParent(node.children[index]);\\n }\\n }\\n }\",\n \"function mutation_preInsert(node, parent, child) {\\n /**\\n * 1. Ensure pre-insertion validity of node into parent before child.\\n * 2. Let reference child be child.\\n * 3. If reference child is node, set it to node’s next sibling.\\n * 4. Adopt node into parent’s node document.\\n * 5. Insert node into parent before reference child.\\n * 6. Return node.\\n */\\n mutation_ensurePreInsertionValidity(node, parent, child);\\n let referenceChild = child;\\n if (referenceChild === node)\\n referenceChild = node._nextSibling;\\n DocumentAlgorithm_1.document_adopt(node, parent._nodeDocument);\\n mutation_insert(node, parent, referenceChild);\\n return node;\\n}\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"function appendBuiltContent( ancestorBranches, key, node ){\\n \\n nodeOf( head( ancestorBranches))[key] = node;\\n }\",\n \"insertNode(node, newNode) {\\n // Handle case where value is less than parent, GO LEFT\\n if (newNode.data < node.data) {\\n // Check if we can place node\\n if (node.left === null) {\\n // Place node\\n node.left = newNode;\\n // Otherwise use recursion to do the same process over again\\n // until we find a null position to put the node\\n } else this.insertNode(node.left, newNode);\\n } else {\\n // Handle case where value is grater than parent, GO RIGHT\\n if (node.right === null) {\\n node.right = newNode;\\n } else this.insertNode(node.right, newNode);\\n }\\n }\",\n \"function addParentLinks(tree, parent) {\\n if (!tree) {\\n return;\\n }\\n tree.parent = parent;\\n addParentLinks(tree.left, tree);\\n addParentLinks(tree.right, tree);\\n}\",\n \"function insertRight(parent, node) {\\n\\tvar index = parent.length - 1;\\n\\tparent[index] = node;\\n\\tparent.sizes[index] = (0, _util.length)(node) + (index > 0 ? parent.sizes[index - 1] : 0);\\n}\",\n \"function visit(node) {\\r\\n if (visited.has(node)) {\\r\\n return;\\r\\n }\\r\\n visited.add(node);\\r\\n var children = graph.get(node);\\r\\n if (children) {\\r\\n children.forEach(visit);\\r\\n }\\r\\n sorted.push(node);\\r\\n }\",\n \"function addNode(token, docId, child) {\\n\\t\\tvar getter = me.store.get(token);\\n\\t\\t\\n\\t\\tgetter.onsuccess = function(evt) {\\n\\t\\t\\tvar node = evt.target.result || { prefix: token };\\n\\t\\t\\tvar insert = false;\\n\\t\\t\\t\\n\\t\\t\\tif (child) {\\n\\t\\t\\t\\t// It’s an internal node!\\n\\t\\t\\t\\t// Children: Characters that could follow\\n\\t\\t\\t\\tnode.children = node.children || [];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (node.children.indexOf(child) === -1) {\\n\\t\\t\\t\\t\\tnode.children.push(child);\\n\\t\\t\\t\\t\\tinsert = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\t// DocIds: Documents that contain this word *as a whole token*\\n\\t\\t\\t\\t// Notice that the same document cannot add both docIds and\\n\\t\\t\\t\\t// children to the same node, by definition of what these are.\\n\\t\\t\\t\\tnode.docIds = node.docIds || [];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (node.docIds.indexOf(docId) === -1) {\\n\\t\\t\\t\\t\\tnode.docIds.push(docId);\\n\\t\\t\\t\\t\\tinsert = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\n\\t\\t\\tif (insert) {\\n\\t\\t\\t\\tvar insertion = me.store.put(node);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// TODO retry or something\\n\\t\\t\\t\\tinsertion.onerror = me.onerror;\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\t\\n\\t\\tgetter.onerror = me.onerror;\\n\\t}\",\n \"add(data, parentNode) {\\n let node = new Node(data);\\n parentNode = parentNode ? this.contains(parentNode) : null;\\n\\n if (parentNode) {\\n parentNode.children.push(node);\\n }\\n else if (!this.root) {\\n this.root = node;\\n }\\n else {\\n return 'There is no parent node in the tree';\\n }\\n }\",\n \"function insert(parent, elm, ref) {\\n if (isDef(parent)) {\\n if (isDef(ref)) {\\n if (nodeOps.parentNode(ref) === parent) {\\n nodeOps.insertBefore(parent, elm, ref);\\n }\\n }\\n else {\\n nodeOps.appendChild(parent, elm);\\n }\\n }\\n }\",\n \"function addChild(child, node) {\\n\\t var children = node.children;\\n\\t\\n\\t if (child.parentNode === node) {\\n\\t return;\\n\\t }\\n\\t\\n\\t children.push(child);\\n\\t child.parentNode = node;\\n\\t }\",\n \"function addChild(child, node) {\\n var children = node.children;\\n\\n if (child.parentNode === node) {\\n return;\\n }\\n\\n children.push(child);\\n child.parentNode = node;\\n}\",\n \"propagateDownFromLeft(node, parentPos, leftSibling) {\\n let parentElement = node.parent.popAt(parentPos);\\n this.addAtLastIndexOfCallStack(\\n this.undoPopAt.bind(this, parentElement, node.parent, parentPos)\\n );\\n if (node.parent.hasRightChildAt(parentPos - 1)) {\\n let nodeParentAtRightChildOldValue = node.parent.at(parentPos - 1).rightChild;\\n node.parent.at(parentPos - 1).rightChild = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.parent.at(parentPos - 1).rightChild = nodeParentAtRightChildOldValue;\\n }\\n );\\n }\\n let parentElementLeftChildOldValue = parentElement.leftChild;\\n parentElement.leftChild = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.leftChild = parentElementLeftChildOldValue;\\n }\\n )\\n\\n let parentElementRightChildOldValue = parentElement.rightChild;\\n parentElement.rightChild = node.hasLeftmostChild() ? node.getLeftmostChild() : this.recentNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.rightChild = parentElementRightChildOldValue;\\n }\\n )\\n\\n node.addFirst(parentElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddFirst.bind(this, node)\\n );\\n\\n let nodeIsLeafOldValue = node.isLeaf;\\n node.isLeaf = node.isLeaf && leftSibling.isLeaf;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.isLeaf = nodeIsLeafOldValue;\\n }\\n );\\n\\n this.mergeToRight(leftSibling, node);\\n if (node.parent === this.root && this.root.size() === 0) {\\n let rootOldValue = this.root;\\n this.root = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n this.root = rootOldValue;\\n }\\n );\\n\\n let nodeParentOldValue = node.parent;\\n node.parent = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.parent = nodeParentOldValue;\\n }\\n )\\n }\\n }\",\n \"function processNode(node){\\n processChild(node);\\n for( i in node.children )\\n processNode(node.children[i]);\\n }\",\n \"function mergeText(previous, node) {\\n previous.value += node.value\\n\\n return previous\\n}\",\n \"setLeftAndUpdateParent(node) {\\n this.left = node;\\n if (node) {\\n node.parent = this;\\n node.parentSide = LEFT;\\n }\\n }\",\n \"mergeNodes(editor) {\\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\\n Editor.withoutNormalizing(editor, () => {\\n var {\\n match,\\n at = editor.selection\\n } = options;\\n var {\\n hanging = false,\\n voids = false,\\n mode = 'lowest'\\n } = options;\\n\\n if (!at) {\\n return;\\n }\\n\\n if (match == null) {\\n if (Path.isPath(at)) {\\n var [parent] = Editor.parent(editor, at);\\n\\n match = n => parent.children.includes(n);\\n } else {\\n match = n => Editor.isBlock(editor, n);\\n }\\n }\\n\\n if (!hanging && Range.isRange(at)) {\\n at = Editor.unhangRange(editor, at);\\n }\\n\\n if (Range.isRange(at)) {\\n if (Range.isCollapsed(at)) {\\n at = at.anchor;\\n } else {\\n var [, end] = Range.edges(at);\\n var pointRef = Editor.pointRef(editor, end);\\n Transforms.delete(editor, {\\n at\\n });\\n at = pointRef.unref();\\n\\n if (options.at == null) {\\n Transforms.select(editor, at);\\n }\\n }\\n }\\n\\n var [current] = Editor.nodes(editor, {\\n at,\\n match,\\n voids,\\n mode\\n });\\n var prev = Editor.previous(editor, {\\n at,\\n match,\\n voids,\\n mode\\n });\\n\\n if (!current || !prev) {\\n return;\\n }\\n\\n var [node, path] = current;\\n var [prevNode, prevPath] = prev;\\n\\n if (path.length === 0 || prevPath.length === 0) {\\n return;\\n }\\n\\n var newPath = Path.next(prevPath);\\n var commonPath = Path.common(path, prevPath);\\n var isPreviousSibling = Path.isSibling(path, prevPath);\\n var levels = Array.from(Editor.levels(editor, {\\n at: path\\n }), _ref2 => {\\n var [n] = _ref2;\\n return n;\\n }).slice(commonPath.length).slice(0, -1); // Determine if the merge will leave an ancestor of the path empty as a\\n // result, in which case we'll want to remove it after merging.\\n\\n var emptyAncestor = Editor.above(editor, {\\n at: path,\\n mode: 'highest',\\n match: n => levels.includes(n) && hasSingleChildNest(editor, n)\\n });\\n var emptyRef = emptyAncestor && Editor.pathRef(editor, emptyAncestor[1]);\\n var properties;\\n var position; // Ensure that the nodes are equivalent, and figure out what the position\\n // and extra properties of the merge will be.\\n\\n if (Text.isText(node) && Text.isText(prevNode)) {\\n var rest = _objectWithoutProperties(node, _excluded);\\n\\n position = prevNode.text.length;\\n properties = rest;\\n } else if (Element.isElement(node) && Element.isElement(prevNode)) {\\n var rest = _objectWithoutProperties(node, _excluded2);\\n\\n position = prevNode.children.length;\\n properties = rest;\\n } else {\\n throw new Error(\\\"Cannot merge the node at path [\\\".concat(path, \\\"] with the previous sibling because it is not the same kind: \\\").concat(JSON.stringify(node), \\\" \\\").concat(JSON.stringify(prevNode)));\\n } // If the node isn't already the next sibling of the previous node, move\\n // it so that it is before merging.\\n\\n\\n if (!isPreviousSibling) {\\n Transforms.moveNodes(editor, {\\n at: path,\\n to: newPath,\\n voids\\n });\\n } // If there was going to be an empty ancestor of the node that was merged,\\n // we remove it from the tree.\\n\\n\\n if (emptyRef) {\\n Transforms.removeNodes(editor, {\\n at: emptyRef.current,\\n voids\\n });\\n } // If the target node that we're merging with is empty, remove it instead\\n // of merging the two. This is a common rich text editor behavior to\\n // prevent losing formatting when deleting entire nodes when you have a\\n // hanging selection.\\n // if prevNode is first child in parent,don't remove it.\\n\\n\\n if (Element.isElement(prevNode) && Editor.isEmpty(editor, prevNode) || Text.isText(prevNode) && prevNode.text === '' && prevPath[prevPath.length - 1] !== 0) {\\n Transforms.removeNodes(editor, {\\n at: prevPath,\\n voids\\n });\\n } else {\\n editor.apply({\\n type: 'merge_node',\\n path: newPath,\\n position,\\n properties\\n });\\n }\\n\\n if (emptyRef) {\\n emptyRef.unref();\\n }\\n });\\n }\",\n \"insertNode(node, new_node) {\\n // if the data is less than the node\\n // data move left of the tree\\n if (new_node.data < node.data) {\\n if (node.left === null) {\\n node.left = new_node;\\n } else {\\n //if left id not null\\n //recurse until null is found\\n this.insertNode(node.left, new_node);\\n }\\n } else {\\n // if right is null insert node here\\n if (node.right === null) {\\n node.right = new_node;\\n } else {\\n //if right is not null\\n //recurse until null is found\\n this.insertNode(node.right, new_node);\\n }\\n }\\n }\",\n \"mergeNodes(editor) {\\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\\n Editor.withoutNormalizing(editor, () => {\\n var {\\n match,\\n at = editor.selection\\n } = options;\\n var {\\n hanging = false,\\n voids = false,\\n mode = 'lowest'\\n } = options;\\n\\n if (!at) {\\n return;\\n }\\n\\n if (match == null) {\\n if (Path.isPath(at)) {\\n var [parent] = Editor.parent(editor, at);\\n\\n match = n => parent.children.includes(n);\\n } else {\\n match = n => Editor.isBlock(editor, n);\\n }\\n }\\n\\n if (!hanging && Range.isRange(at)) {\\n at = Editor.unhangRange(editor, at);\\n }\\n\\n if (Range.isRange(at)) {\\n if (Range.isCollapsed(at)) {\\n at = at.anchor;\\n } else {\\n var [, end] = Range.edges(at);\\n var pointRef = Editor.pointRef(editor, end);\\n Transforms.delete(editor, {\\n at\\n });\\n at = pointRef.unref();\\n\\n if (options.at == null) {\\n Transforms.select(editor, at);\\n }\\n }\\n }\\n\\n var [current] = Editor.nodes(editor, {\\n at,\\n match,\\n voids,\\n mode\\n });\\n var prev = Editor.previous(editor, {\\n at,\\n match,\\n voids,\\n mode\\n });\\n\\n if (!current || !prev) {\\n return;\\n }\\n\\n var [node, path] = current;\\n var [prevNode, prevPath] = prev;\\n\\n if (path.length === 0 || prevPath.length === 0) {\\n return;\\n }\\n\\n var newPath = Path.next(prevPath);\\n var commonPath = Path.common(path, prevPath);\\n var isPreviousSibling = Path.isSibling(path, prevPath);\\n var levels = Array.from(Editor.levels(editor, {\\n at: path\\n }), (_ref2) => {\\n var [n] = _ref2;\\n return n;\\n }).slice(commonPath.length).slice(0, -1); // Determine if the merge will leave an ancestor of the path empty as a\\n // result, in which case we'll want to remove it after merging.\\n\\n var emptyAncestor = Editor.above(editor, {\\n at: path,\\n mode: 'highest',\\n match: n => levels.includes(n) && Element.isElement(n) && n.children.length === 1\\n });\\n var emptyRef = emptyAncestor && Editor.pathRef(editor, emptyAncestor[1]);\\n var properties;\\n var position; // Ensure that the nodes are equivalent, and figure out what the position\\n // and extra properties of the merge will be.\\n\\n if (Text.isText(node) && Text.isText(prevNode)) {\\n var rest = _objectWithoutProperties(node, [\\\"text\\\"]);\\n\\n position = prevNode.text.length;\\n properties = rest;\\n } else if (Element.isElement(node) && Element.isElement(prevNode)) {\\n var rest = _objectWithoutProperties(node, [\\\"children\\\"]);\\n\\n position = prevNode.children.length;\\n properties = rest;\\n } else {\\n throw new Error(\\\"Cannot merge the node at path [\\\".concat(path, \\\"] with the previous sibling because it is not the same kind: \\\").concat(JSON.stringify(node), \\\" \\\").concat(JSON.stringify(prevNode)));\\n } // If the node isn't already the next sibling of the previous node, move\\n // it so that it is before merging.\\n\\n\\n if (!isPreviousSibling) {\\n Transforms.moveNodes(editor, {\\n at: path,\\n to: newPath,\\n voids\\n });\\n } // If there was going to be an empty ancestor of the node that was merged,\\n // we remove it from the tree.\\n\\n\\n if (emptyRef) {\\n Transforms.removeNodes(editor, {\\n at: emptyRef.current,\\n voids\\n });\\n } // If the target node that we're merging with is empty, remove it instead\\n // of merging the two. This is a common rich text editor behavior to\\n // prevent losing formatting when deleting entire nodes when you have a\\n // hanging selection.\\n\\n\\n if (Element.isElement(prevNode) && Editor.isEmpty(editor, prevNode) || Text.isText(prevNode) && prevNode.text === '') {\\n Transforms.removeNodes(editor, {\\n at: prevPath,\\n voids\\n });\\n } else {\\n editor.apply({\\n type: 'merge_node',\\n path: newPath,\\n position,\\n properties\\n });\\n }\\n\\n if (emptyRef) {\\n emptyRef.unref();\\n }\\n });\\n }\",\n \"function addNode(node, path){\\n if ( node.name.indexOf('.') === 0 || path.indexOf('/.') >= 0){ // ignore hidden files\\n return;\\n }\\n var relativePath = path.replace(root,'');\\n\\n node.path = relativePath + '/' + node.name;\\n nodesMap[node.path] = node;\\n\\n if ( relativePath.length === 0 ){ //is root\\n tree.push(node);\\n return;\\n }\\n node.parentPath = node.path.substring(0,node.path.lastIndexOf('/'));\\n const parent = nodesMap[node.parentPath];\\n parent.children.push(node);\\n\\n }\",\n \"function populate_parent(astroot) {\\n\\n function visit(node, parent) {\\n if (!node || typeof node.type !== \\\"string\\\") {\\n return;\\n }\\n\\n for ( var prop in node) {\\n if (node.hasOwnProperty(prop)) {\\n\\n // skip cyclic reference\\n // at least for try-statement\\n if (prop === '__parent__') {\\n continue;\\n }\\n\\n var child = node[prop];\\n if (Array.isArray(child)) {\\n for (var i = 0; i < child.length; i++) {\\n visit(child[i], node);\\n }\\n }\\n else {\\n visit(child, node);\\n }\\n }\\n }\\n\\n // must be post\\n node.__parent__ = parent;\\n }\\n visit(astroot, null);\\n}\",\n \"propagateDownFromRight(node, parentPos, rightSibling) {\\n let parentElement = node.parent.popAt(parentPos);\\n this.addAtLastIndexOfCallStack(\\n this.undoPopAt.bind(this, parentElement, node.parent, parentPos)\\n );\\n\\n if (node.parent.hasLeftChildAt(parentPos)) {\\n let nodeParentAtLeftChildOldValue = node.parent.at(parentPos).leftChild;\\n node.parent.at(parentPos).leftChild = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.parent.at(parentPos).leftChild = nodeParentAtLeftChildOldValue;\\n }\\n )\\n }\\n\\n let parentElementLeftChildOldValue = parentElement.leftChild;\\n parentElement.leftChild = node.hasRightmostChild() ? node.getRightmostChild() : this.recentNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.leftChild = parentElementLeftChildOldValue;\\n }\\n );\\n\\n let parentElementRightChildOldValue = parentElement.rightChild;\\n parentElement.rightChild = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.rightChild = parentElementRightChildOldValue;\\n }\\n );\\n\\n node.addLast(parentElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddLast.bind(this, node)\\n );\\n\\n let nodeIsLeafOldValue = node.isLeaf;\\n node.isLeaf = node.isLeaf && rightSibling.isLeaf;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.isLeaf = nodeIsLeafOldValue;\\n }\\n );\\n\\n this.mergeToLeft(node, rightSibling);\\n\\n\\n if (node.parent === this.root && this.root.size() === 0) {\\n let rootOldValue = this.root;\\n this.root = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n this.root = rootOldValue;\\n }\\n )\\n\\n let nodeParentOldValue = node.parent;\\n node.parent = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.parent = nodeParentOldValue;\\n }\\n );\\n }\\n }\",\n \"function appendBuiltContent (ancestorBranches, key, node) {\\n Object(__WEBPACK_IMPORTED_MODULE_1__ascent__[\\\"c\\\" /* nodeOf */])(Object(__WEBPACK_IMPORTED_MODULE_3__lists__[\\\"g\\\" /* head */])(ancestorBranches))[key] = node\\n }\",\n \"function append(node, item, offset) {\\n\\n\\t\\titem.offset = ++offset;\\n\\t\\tsiblingIndex.add(item);\\n\\t\\tnode.children.push(item);\\n\\t\\titem.parent = node;\\n\\t\\titem.id = id++;\\n\\t\\ttree.push(item);\\n\\n\\t}\",\n \"function _build(_lst, _parent) {\\n for (var i = 0; i < _lst.length; i++) {\\n var node = _lst[i];\\n node._parent = _parent; // public assign of parent; ugly \\n if (node.children) {\\n _build(node.children, node);\\n }\\n }\\n }\",\n \"function recursiveAdd(node) {\\n // node.depth = depth;\\n if (node.data.name !== 'ROOT') {\\n descendants.push(node);\\n }\\n if (node.children) {\\n node.children.forEach(d => recursiveAdd(d));\\n }\\n }\",\n \"setRightAndUpdateParent(node) {\\n this.right = node;\\n if (node) {\\n node.parent = this;\\n node.parentSide = RIGHT;\\n }\\n }\",\n \"_replaceWith(node) {\\n if (this.parent) {\\n if (this == this.parent.left) {\\n this.parent.left = node;\\n } else if (this == this.parent.right) {\\n this.parent.right = node;\\n }\\n\\n if (node) {\\n node.parent = this.parent;\\n }\\n } else {\\n if (node) {\\n this.key = node.key;\\n this.value = node.value;\\n this.left = node.left;\\n this.right = node.right;\\n } else {\\n this.key = null;\\n this.value = null;\\n this.left = null;\\n this.right = null;\\n }\\n }\\n }\",\n \"function insert(node, parent, tight) {\\n var children = parent.children\\n var length = children.length\\n var last = children[length - 1]\\n var isLoose = false\\n var index\\n var item\\n\\n if (node.depth === 1) {\\n item = listItem()\\n\\n item.children.push({\\n type: PARAGRAPH,\\n children: [\\n {\\n type: LINK,\\n title: null,\\n url: '#' + node.id,\\n children: [{type: TEXT, value: node.value}]\\n }\\n ]\\n })\\n\\n children.push(item)\\n } else if (last && last.type === LIST_ITEM) {\\n insert(node, last, tight)\\n } else if (last && last.type === LIST) {\\n node.depth--\\n\\n insert(node, last, tight)\\n } else if (parent.type === LIST) {\\n item = listItem()\\n\\n insert(node, item, tight)\\n\\n children.push(item)\\n } else {\\n item = list()\\n node.depth--\\n\\n insert(node, item, tight)\\n\\n children.push(item)\\n }\\n\\n // Properly style list-items with new lines.\\n parent.spread = !tight\\n\\n if (parent.type === LIST && parent.spread) {\\n parent.spread = false\\n index = -1\\n\\n while (++index < length) {\\n if (children[index].children.length > 1) {\\n parent.spread = true\\n break\\n }\\n }\\n }\\n\\n // To do: remove `loose` in next major release.\\n if (parent.type === LIST_ITEM) {\\n parent.loose = tight ? false : children.length > 1\\n } else {\\n if (tight) {\\n isLoose = false\\n } else {\\n index = -1\\n\\n while (++index < length) {\\n if (children[index].loose) {\\n isLoose = true\\n\\n break\\n }\\n }\\n }\\n\\n index = -1\\n\\n while (++index < length) {\\n children[index].loose = isLoose\\n }\\n }\\n}\",\n \"function add_parent_links(node) {\\n\\tfor(var c = 0; c < node.children.length; c++) {\\n\\t\\tnode.children[c].parent = node;\\n\\t\\tadd_parent_links(node.children[c]);\\n\\t}\\n}\",\n \"function moveNode(node, parent) {\\n\\tvar n = document.getElementById(node);\\n\\tvar p = document.getElementById(parent);\\n\\tif (n != undefined && n !== null && p != undefined && p !== null) {\\n\\t\\tp.appendChild(n.parentNode.removeChild(n));\\n\\t}\\n}\",\n \"function mergeText(prev, node) {\\n prev.value += node.value;\\n\\n return prev;\\n}\",\n \"function mergeText(prev, node) {\\n prev.value += node.value;\\n\\n return prev;\\n}\",\n \"function mergeText(prev, node) {\\n prev.value += node.value;\\n\\n return prev;\\n}\",\n \"function mergeText(prev, node) {\\n prev.value += node.value;\\n\\n return prev;\\n}\",\n \"function mergeText(prev, node) {\\n prev.value += node.value;\\n\\n return prev;\\n}\",\n \"function mergeText(prev, node) {\\n prev.value += node.value;\\n\\n return prev;\\n}\",\n \"function mutation_insert_single(node, parent, suppressObservers) {\\n /**\\n * 1. Let count be the number of children of node if it is a\\n * DocumentFragment node, and one otherwise.\\n * 2. If child is non-null, then:\\n * 2.1. For each live range whose start node is parent and start\\n * offset is greater than child's index, increase its start\\n * offset by count.\\n * 2.2. For each live range whose end node is parent and end\\n * offset is greater than child's index, increase its end\\n * offset by count.\\n * 3. Let nodes be node’s children, if node is a DocumentFragment node;\\n * otherwise « node ».\\n * 4. If node is a DocumentFragment node, remove its children with the\\n * suppress observers flag set.\\n * 5. If node is a DocumentFragment node, then queue a tree mutation record\\n * for node with « », nodes, null, and null.\\n */\\n /**\\n * 6. Let previousSibling be child’s previous sibling or parent’s last\\n * child if child is null.\\n */\\n const previousSibling = parent._lastChild;\\n // set document element node\\n if (util_1.Guard.isElementNode(node)) {\\n // set document element node\\n if (util_1.Guard.isDocumentNode(parent)) {\\n parent._documentElement = node;\\n }\\n // mark that the document has namespaces\\n if (!node._nodeDocument._hasNamespaces && (node._namespace !== null ||\\n node._namespacePrefix !== null)) {\\n node._nodeDocument._hasNamespaces = true;\\n }\\n }\\n /**\\n * 7. For each node in nodes, in tree order:\\n * 7.1. If child is null, then append node to parent’s children.\\n * 7.2. Otherwise, insert node into parent’s children before child’s\\n * index.\\n */\\n node._parent = parent;\\n parent._children.add(node);\\n // assign siblings and children for quick lookups\\n if (parent._firstChild === null) {\\n node._previousSibling = null;\\n node._nextSibling = null;\\n parent._firstChild = node;\\n parent._lastChild = node;\\n }\\n else {\\n const prev = parent._lastChild;\\n node._previousSibling = prev;\\n node._nextSibling = null;\\n if (prev)\\n prev._nextSibling = node;\\n if (!prev)\\n parent._firstChild = node;\\n parent._lastChild = node;\\n }\\n /**\\n * 7.3. If parent is a shadow host and node is a slotable, then\\n * assign a slot for node.\\n */\\n if (dom_1.dom.features.slots) {\\n if (parent._shadowRoot !== null && util_1.Guard.isSlotable(node)) {\\n ShadowTreeAlgorithm_1.shadowTree_assignASlot(node);\\n }\\n }\\n /**\\n * 7.4. If node is a Text node, run the child text content change\\n * steps for parent.\\n */\\n if (dom_1.dom.features.steps) {\\n if (util_1.Guard.isTextNode(node)) {\\n DOMAlgorithm_1.dom_runChildTextContentChangeSteps(parent);\\n }\\n }\\n /**\\n * 7.5. If parent's root is a shadow root, and parent is a slot\\n * whose assigned nodes is the empty list, then run signal\\n * a slot change for parent.\\n */\\n if (dom_1.dom.features.slots) {\\n if (util_1.Guard.isShadowRoot(TreeAlgorithm_1.tree_rootNode(parent)) &&\\n util_1.Guard.isSlot(parent) && util_2.isEmpty(parent._assignedNodes)) {\\n ShadowTreeAlgorithm_1.shadowTree_signalASlotChange(parent);\\n }\\n }\\n /**\\n * 7.6. Run assign slotables for a tree with node's root.\\n */\\n if (dom_1.dom.features.slots) {\\n ShadowTreeAlgorithm_1.shadowTree_assignSlotablesForATree(TreeAlgorithm_1.tree_rootNode(node));\\n }\\n /**\\n * 7.7. For each shadow-including inclusive descendant\\n * inclusiveDescendant of node, in shadow-including tree\\n * order:\\n * 7.7.1. Run the insertion steps with inclusiveDescendant.\\n */\\n if (dom_1.dom.features.steps) {\\n DOMAlgorithm_1.dom_runInsertionSteps(node);\\n }\\n if (dom_1.dom.features.customElements) {\\n /**\\n * 7.7.2. If inclusiveDescendant is connected, then:\\n */\\n if (util_1.Guard.isElementNode(node) &&\\n ShadowTreeAlgorithm_1.shadowTree_isConnected(node)) {\\n if (util_1.Guard.isCustomElementNode(node)) {\\n /**\\n * 7.7.2.1. If inclusiveDescendant is custom, then enqueue a custom\\n * element callback reaction with inclusiveDescendant, callback name\\n * \\\"connectedCallback\\\", and an empty argument list.\\n */\\n CustomElementAlgorithm_1.customElement_enqueueACustomElementCallbackReaction(node, \\\"connectedCallback\\\", []);\\n }\\n else {\\n /**\\n * 7.7.2.2. Otherwise, try to upgrade inclusiveDescendant.\\n */\\n CustomElementAlgorithm_1.customElement_tryToUpgrade(node);\\n }\\n }\\n }\\n /**\\n * 8. If suppress observers flag is unset, then queue a tree mutation record\\n * for parent with nodes, « », previousSibling, and child.\\n */\\n if (dom_1.dom.features.mutationObservers) {\\n if (!suppressObservers) {\\n MutationObserverAlgorithm_1.observer_queueTreeMutationRecord(parent, [node], [], previousSibling, null);\\n }\\n }\\n}\",\n \"function doTreesMerge(newLvl, existingLvl, newParentId, existingParentId, tP) { //console.log(\\\"doTreesMerge called. newLvl = %s, existingLvl = %s, newParent = %s, existingParent = %s\\\", newLvl, existingLvl, taxaNameMap[newParentId], taxaNameMap[existingParentId])\\n if (newLvl > existingLvl) { // more specific taxon\\n if (treesMergeAtHigherLevel(tP.taxaObjs[taxaNameMap[newParentId]], existingParentId, tP)) {\\n tP.recrd.parent = newParentId; \\t\\t\\t\\t\\t\\t// console.log(\\\"trees merge\\\");\\n }\\n } else { confirmDirectRelationship(tP.taxaObjs[taxaNameMap[newParentId]], newParentId); }\\n /**\\n * If the taxon has a less specific direct parent in this record than in one previously processed, \\n * check to ensure the existing parent is a child of the parent taxon in this record.\\n */\\n function confirmDirectRelationship(existingTaxonObj, newParentId) { \\n if (!isChild(existingTaxonObj)) { // No case yet. TODO: add to Complex Errors\\n console.log(\\\"trees don't merge. newParent =%s, existing =%s, rcrd = %O, existingParent = %O\\\", taxaNameMap[newParentId], taxaNameMap[existingParentId], tP.recrd, tP.taxaObjs[taxaNameMap[existingParentId]].name); \\n }\\n\\n function isChild(existingParnt) { // console.log(\\\"existingParnt - %s, existingParntLvl - %s, tP.taxaObjs = %O\\\", existingParnt.name, existingParnt.level, tP.taxaObjs)\\n if ( existingParnt.level === newLvl ) { //console.log(\\\"levels equal. existingId = %s, newParentId = %s\\\", existingParnt.tempId, newParentId)\\n if ( existingParnt.tempId === newParentId ) { return true; \\n } else { return false; }\\n }\\n if ( existingParnt.parent === newParentId ) { return true;\\n } else { return isChild(existingParnt.parent); }\\n }\\n }\\n }\",\n \"function insert(node, parent_id, sort)\\n {\\n var li, parent_li,\\n parent_node = parent_id ? indexbyid[parent_id] : null\\n search_ = search_active;\\n\\n // ignore, already exists\\n if (indexbyid[node.id]) {\\n return;\\n }\\n\\n // apply saved state\\n state = get_state(node.id, node.collapsed);\\n if (state !== undefined) {\\n node.collapsed = state;\\n }\\n\\n // insert as child of an existing node\\n if (parent_node) {\\n node.level = parent_node.level + 1;\\n if (!parent_node.children)\\n parent_node.children = [];\\n\\n search_active = false;\\n parent_node.children.push(node);\\n parent_li = id2dom(parent_id);\\n\\n // re-render the entire subtree\\n if (parent_node.children.length == 1) {\\n render_node(parent_node, null, parent_li);\\n li = id2dom(node.id);\\n }\\n else {\\n // append new node to parent's child list\\n li = render_node(node, parent_li.children('ul').first());\\n }\\n\\n // list is in search mode\\n if (search_) {\\n search_active = search_;\\n\\n // add clone to current search results (top level)\\n if (!li.is(':visible')) {\\n $('<li>')\\n .attr('id', li.attr('id') + '--xsR')\\n .attr('class', li.attr('class'))\\n .addClass('searchresult__')\\n .append(li.children().first().clone(true, true))\\n .appendTo(container);\\n }\\n }\\n }\\n // insert at top level\\n else {\\n node.level = 0;\\n data.push(node);\\n li = render_node(node, container);\\n }\\n\\n indexbyid[node.id] = node;\\n\\n // set new reference to node.html after insert\\n // will otherwise vanish in Firefox 3.6\\n if (typeof node.html == 'object') {\\n indexbyid[node.id].html = id2dom(node.id, true).children();\\n }\\n\\n if (sort) {\\n resort_node(li, typeof sort == 'string' ? '[class~=\\\"' + sort + '\\\"]' : '');\\n }\\n }\",\n \"function setChild(parent, node) {\\n\\n var c, newNode, currentDocument = parent._ownerDocument || parent;\\n\\n switch (node.type)\\n {\\n case 'tag':\\n case 'script':\\n case 'style':\\n try {\\n newNode = currentDocument.createElement(node.name);\\n if (node.location) {\\n newNode.sourceLocation = node.location;\\n newNode.sourceLocation.file = parent.sourceLocation.file;\\n }\\n } catch (err) {\\n currentDocument.trigger('error', 'invalid markup', {\\n exception: err,\\n node : node\\n });\\n\\n return null;\\n }\\n break;\\n\\n case 'text':\\n newNode = currentDocument.createTextNode(HTMLDecode(node.data));\\n break;\\n\\n case 'comment':\\n newNode = currentDocument.createComment(node.data);\\n break;\\n\\n default:\\n return null;\\n break;\\n }\\n\\n if (!newNode)\\n return null;\\n\\n if (node.attribs) {\\n for (c in node.attribs) {\\n // catchin errors here helps with improperly escaped attributes\\n // but properly fixing parent should (can only?) be done in the htmlparser itself\\n try {\\n newNode.setAttribute(c.toLowerCase(), HTMLDecode(node.attribs[c]));\\n } catch(e2) { /* noop */ }\\n }\\n }\\n\\n if (node.children) {\\n for (c = 0; c < node.children.length; c++) {\\n setChild(newNode, node.children[c]);\\n }\\n }\\n\\n return parent.appendChild(newNode);\\n}\",\n \"function inorder(node){\\n if(!_.isNull(node.left)) inorder(node.left)\\n trav.push({\\\"key\\\": node.key, \\\"value\\\": node.value, \\\"children\\\": [_.get(node, \\\"left.value\\\", \\\"null\\\"), _.get(node, \\\"right.value\\\", \\\"null\\\")]})\\n if(!_.isNull(node.right)) inorder(node.right)\\n}\",\n \"function addParent(obj, parent) {\\n const isNode = obj && typeof obj.type === 'string';\\n const childParent = isNode ? obj : parent;\\n\\n for (const k in obj) {\\n const value = obj[k];\\n\\n if (Array.isArray(value)) {\\n value.forEach(function (v) {\\n addParent(v, childParent);\\n });\\n } else if (value && typeof value === 'object') {\\n addParent(value, childParent);\\n }\\n }\\n\\n if (isNode) {\\n Object.defineProperty(obj, 'parent', {\\n configurable: true,\\n writable: true,\\n enumerable: false,\\n value: parent || null\\n });\\n }\\n\\n return obj;\\n}\",\n \"function addParent(obj, parent) {\\n var isNode = obj && typeof obj.type === 'string'\\n var childParent = isNode ? obj : parent\\n\\n for (var k in obj) {\\n var value = obj[k]\\n if (Array.isArray(value)) {\\n value.forEach(function(v) {\\n addParent(v, childParent)\\n })\\n } else if (value && typeof value === 'object') {\\n addParent(value, childParent)\\n }\\n }\\n\\n if (isNode) {\\n Object.defineProperty(obj, 'parent', {\\n configurable: true,\\n writable: true,\\n enumerable: false,\\n value: parent || null,\\n })\\n }\\n\\n return obj\\n}\",\n \"function addParent(obj, parent) {\\n var isNode = obj && typeof obj.type === 'string';\\n var childParent = isNode ? obj : parent;\\n for (var k in obj) {\\n var value = obj[k];\\n if (Array.isArray(value)) {\\n value.forEach(function (v) { addParent(v, childParent); });\\n }\\n else if (value && typeof value === 'object') {\\n addParent(value, childParent);\\n }\\n }\\n if (isNode) {\\n Object.defineProperty(obj, 'parent', {\\n configurable: true,\\n writable: true,\\n enumerable: false,\\n value: parent || null\\n });\\n }\\n return obj;\\n}\",\n \"function addParent(obj, parent) {\\n\\t var isNode = obj && typeof obj.type === 'string';\\n\\t var childParent = isNode ? obj : parent;\\n\\n\\t for (var k in obj) {\\n\\t var value = obj[k];\\n\\t if (Array.isArray(value)) {\\n\\t value.forEach(function(v) { addParent(v, childParent); });\\n\\t } else if (value && typeof value === 'object') {\\n\\t addParent(value, childParent);\\n\\t }\\n\\t }\\n\\n\\t if (isNode) {\\n\\t Object.defineProperty(obj, 'parent', {\\n\\t configurable: true,\\n\\t writable: true,\\n\\t enumerable: false,\\n\\t value: parent || null\\n\\t });\\n\\t }\\n\\n\\t return obj;\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.74623704","0.5998085","0.57359624","0.57040995","0.56888145","0.5535257","0.5535257","0.5535257","0.5535257","0.5535257","0.55218256","0.5493243","0.5486552","0.54409987","0.54202956","0.5411669","0.5390074","0.53790534","0.53790534","0.53790534","0.53790534","0.53790534","0.53790534","0.5371325","0.5319005","0.5274896","0.52699554","0.52597815","0.5209134","0.5184268","0.51841974","0.5155314","0.51059544","0.5099333","0.507212","0.50685","0.50469136","0.5014044","0.49929148","0.49847203","0.495219","0.495219","0.495219","0.495219","0.495219","0.495219","0.495219","0.495219","0.495219","0.495219","0.495219","0.495219","0.495219","0.49518812","0.49414974","0.49396214","0.49374208","0.49367702","0.49260554","0.4919646","0.49158227","0.49065253","0.4898696","0.4898408","0.48935607","0.48881334","0.48849413","0.4878346","0.487683","0.48706537","0.48678532","0.4854516","0.48428777","0.4832726","0.48295563","0.48269823","0.48189488","0.48056132","0.48051724","0.48051092","0.47925398","0.47891352","0.47891352","0.47891352","0.47891352","0.47891352","0.47891352","0.47807458","0.4780702","0.47782883","0.4771163","0.47606012","0.4755697","0.47343466","0.47313714","0.47299752"],"string":"[\n \"0.74623704\",\n \"0.5998085\",\n \"0.57359624\",\n \"0.57040995\",\n \"0.56888145\",\n \"0.5535257\",\n \"0.5535257\",\n \"0.5535257\",\n \"0.5535257\",\n \"0.5535257\",\n \"0.55218256\",\n \"0.5493243\",\n \"0.5486552\",\n \"0.54409987\",\n \"0.54202956\",\n \"0.5411669\",\n \"0.5390074\",\n \"0.53790534\",\n \"0.53790534\",\n \"0.53790534\",\n \"0.53790534\",\n \"0.53790534\",\n \"0.53790534\",\n \"0.5371325\",\n \"0.5319005\",\n \"0.5274896\",\n \"0.52699554\",\n \"0.52597815\",\n \"0.5209134\",\n \"0.5184268\",\n \"0.51841974\",\n \"0.5155314\",\n \"0.51059544\",\n \"0.5099333\",\n \"0.507212\",\n \"0.50685\",\n \"0.50469136\",\n \"0.5014044\",\n \"0.49929148\",\n \"0.49847203\",\n \"0.495219\",\n \"0.495219\",\n \"0.495219\",\n \"0.495219\",\n \"0.495219\",\n \"0.495219\",\n \"0.495219\",\n \"0.495219\",\n \"0.495219\",\n \"0.495219\",\n \"0.495219\",\n \"0.495219\",\n \"0.495219\",\n \"0.49518812\",\n \"0.49414974\",\n \"0.49396214\",\n \"0.49374208\",\n \"0.49367702\",\n \"0.49260554\",\n \"0.4919646\",\n \"0.49158227\",\n \"0.49065253\",\n \"0.4898696\",\n \"0.4898408\",\n \"0.48935607\",\n \"0.48881334\",\n \"0.48849413\",\n \"0.4878346\",\n \"0.487683\",\n \"0.48706537\",\n \"0.48678532\",\n \"0.4854516\",\n \"0.48428777\",\n \"0.4832726\",\n \"0.48295563\",\n \"0.48269823\",\n \"0.48189488\",\n \"0.48056132\",\n \"0.48051724\",\n \"0.48051092\",\n \"0.47925398\",\n \"0.47891352\",\n \"0.47891352\",\n \"0.47891352\",\n \"0.47891352\",\n \"0.47891352\",\n \"0.47891352\",\n \"0.47807458\",\n \"0.4780702\",\n \"0.47782883\",\n \"0.4771163\",\n \"0.47606012\",\n \"0.4755697\",\n \"0.47343466\",\n \"0.47313714\",\n \"0.47299752\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7812813"},"document_rank":{"kind":"string","value":"3"}}},{"rowIdx":76394,"cells":{"query":{"kind":"string","value":"Remove `subvalue` from `value`. `subvalue` must be at the start of `value`."},"document":{"kind":"string","value":"function eat(subvalue) {\n var indent = getOffset();\n var pos = position();\n var current = now();\n\n validateEat(subvalue);\n\n apply.reset = reset;\n reset.test = test;\n apply.test = test;\n\n value = value.substring(subvalue.length);\n\n updatePosition(subvalue);\n\n indent = indent();\n\n return apply;\n\n /* Add the given arguments, add `position` to\n * the returned node, and return the node. */\n function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }\n\n /* Functions just like apply, but resets the\n * content: the line and column are reversed,\n * and the eaten value is re-added.\n * This is useful for nodes with a single\n * type of content, such as lists and tables.\n * See `apply` above for what parameters are\n * expected. */\n function reset() {\n var node = apply.apply(null, arguments);\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return node;\n }\n\n /* Test the position, after eating, and reverse\n * to a not-eaten state. */\n function test() {\n var result = pos({});\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return result.position;\n }\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function subInputValue(val, sub)\n{\n var dataArray = '';\n var data = \"\";\n if (val == sub) return 0;\n dataArray = val.toString().split(',');\n var index = $.inArray(sub, dataArray);\n dataArray.splice(index, 1);\n return dataArray.join();\n}","deleteVal(str) {\n\t\tvar sub = str.substring(0, str.length - 1);\n\t\treturn sub;\n\t}","function removeSarja(subfield) {\n if (subfield.code !== 'a') {\n return;\n }\n const tmp = subfield.value.replace(/ ?-(?:[a-z]|ä|ö)*sarja$/u, '');\n if (tmp.length > 0) {\n subfield.value = tmp; // eslint-disable-line functional/immutable-data\n return;\n }\n }","function removeChar(value, char) {\n if (!value.length || !char.length) {\n return '';\n }\n\n if (char.includes(value[0])) {\n return '' + removeChar(value.slice(1), char);\n }\n\n return value[0] + removeChar(value.slice(1), char);\n}","function removeSubStr(str, substr) {\n\t\tstr = str || \"\";\n\t\tvar k = str.indexOf(substr);\n\t\treturn k + 1 ? str.slice(0, k) + str.slice(k + substr.length) : str;\n\t}","static removePrefix(value) {\n if (value.includes(InitialPrefix) && value.includes(EndPrefix)) {\n return value\n .toString()\n .replace(InitialPrefix, \"\")\n .replace(EndPrefix, \"\");\n }\n return value;\n }","removeByValue (value) {\n\t\tthis.remove(this.findFirst(value));\n\t}","function removeSubStr(string,substring){\n return string.replace(substring,\"\")\n}","removeByValue(value) {\n return this.delete(this.getIndexOf(value));\n }","function listRemoveOneElementByValue(list, remove_value){\n list=substr(list, 1, list.length-1);\n var index=find_not_in_str_list_dict(list, remove_value);\n list=replace_from_index_to_index(list, remove_value, \"\", index, index+remove_value.length);\n list=append(\"[\", list);\n list=append(list, \"]\");\n list=replace_not_in_string(list, \",,\", \",\");\n list=replace_not_in_string(list, \"[,\", \"[\");\n list=replace_not_in_string(list, \",]\", \"]\");\n return list;\n}","function removeTrailingZeroes(value) {\n while (value.charAt(value.length - 1) === '0') {\n value = value.slice(0, -1);\n }\n if (value.charAt(value.length - 1) === '.') {\n value = value.slice(0, -1);\n }\n return value;\n }","removeValue (value) {\r\n // TODO: Do we need it?\r\n console.warn(`This feature is not implemented yet`)\r\n }","function deleteOnValue() {\n return displayScreenNumber.value = displayScreenNumber.value.slice(0, displayScreenNumber.value.length - 1);\n}","remove(value) {\n\t\tif (!this.root) {\n\t\t\treturn 'Tree is empty!';\n\t\t} else {\n\t\t\tthis.removeNode(this.root, value);\n\t\t}\n\t}","function removeZeros(value) {\n if (value.indexOf('.') !== -1) {\n while (value[value.length - 1] === '0') {\n value = value.substring(0, value.length - 1);\n }\n if (value[value.length - 1] === '.') {\n value = value.substring(0, value.length - 1);\n }\n }\n return value;\n}","static subtract(array, subArray) {\n return Utils.removeIf(array, function(el) {\n return Utils.hasValue(subArray, el);\n });\n }","removeValue(value) {\n\t\tlet currentNode = this.head\n\t\tlet index = 0\n\n\t\twhile (value != currentNode.value) {\n\t\t\tcurrentNode = currentNode.next\n\t\t\tindex++\n\t\t}\n\t\treturn this.remove(index)\n\t}","function remove(as, value) {\n var index = as.indexOf(value);\n if (index != -1) {\n as.splice(index, 1);\n return true;\n }\n else {\n return false;\n }\n }","function dropBrackets (value) {\n return value.replace(/[(,)]/g, '');\n}","static removeValue(array, value) {\n for (var tI = array.length - 1; tI >= 0; tI--) {\n if (array[tI] === value) {\n array.splice(tI, 1);\n return tI;\n }\n }\n }","function removeNumber(){\n var stringInput = document.getElementById(\"input-number\").value; \n var inputLength = stringInput.length\n var remove = stringInput.slice(0,inputLength-1);\n document.getElementById(\"input-number\").value = remove;\n}","function clean_start_end_value(value){\n\n\t// In case we pass in a number\n\tvalue = value.toString();\n\n\tlet changed = false;\n\tlet new_value;\n\n\tif(value == ''){\n\n\t\t// Check if empty string\n\t\tnew_value = 0;\n\t\tchanged = true;\n\n\t}else if(value.charAt(0) == '0'){\n\n\t\t// Remove leading zeroes\n\t\tnew_value = parseInt(value,10);\n\t\tchanged = true;\n\n\t}else{\n\n\t\t// Check if we exceed the limits for the start or end value\n\t\tnew_value = parseInt(value,10);\n\t\tif(new_value > 180){\n\t\t\tnew_value = 180;\n\t\t\tchanged = true;\t \n\t\t}else if(new_value < 0){\n\t\t\tnew_value = 0;\n\t\t\tchanged = true;\n\t\t}\n\t}\n\n\tif(changed){\n\t\treturn new_value;\n\t}else{\n\t\treturn false;\n\t}\n}","function removeFromLast(){\n \n const previousValue = document.querySelector(\".inputValueShower\").value\n \n const updateValue = previousValue.substring(0, previousValue.length - 1)\n \n document.querySelector(\".inputValueShower\").value = updateValue \n }","function eat(subvalue) {\n var indent = getOffset()\n var pos = position()\n var current = now()\n\n validateEat(subvalue)\n\n apply.reset = reset\n reset.test = test\n apply.test = test\n\n value = value.slice(subvalue.length)\n\n updatePosition(subvalue)\n\n indent = indent()\n\n return apply\n\n // Add the given arguments, add `position` to the returned node, and\n // return the node.\n function apply(node, parent) {\n return pos(add(pos(node), parent), indent)\n }\n\n // Functions just like apply, but resets the content: the line and\n // column are reversed, and the eaten value is re-added. This is\n // useful for nodes with a single type of content, such as lists and\n // tables. See `apply` above for what parameters are expected.\n function reset() {\n var node = apply.apply(null, arguments)\n\n line = current.line\n column = current.column\n value = subvalue + value\n\n return node\n }\n\n // Test the position, after eating, and reverse to a not-eaten state.\n function test() {\n var result = pos({})\n\n line = current.line\n column = current.column\n value = subvalue + value\n\n return result.position\n }\n }","function cut_out_tags(value) {\n return value.replace(/<.+>/g, \"\");\n}","static removeLeftZeros(value) {\n while (value.startsWith('0')) {\n value = value.substring(1, value.length);\n }\n return value;\n }","function FFString_trim( value ){\n\treturn FFString_trimRight(FFSting_trimLeft(value));\t\n}","remove(value) {\n this.root = this.removeVisitor(this.root, value)\n }","function removeDigit() {\n pinInsert.value = pinInsert.value.slice(0, -1);\n}","function removeValue(array, value, can_fail) {\n var idx = array.indexOf(value);\n ASSERT(can_fail || idx != -1, 'Unable to Remove Value ' + value);\n if (idx != -1) array.splice(idx, 1);\n return idx != -1;\n}","function removeExtraCommas(value) {\n\t//if last char of textbox value is comma then remove\n\tif(value.charAt(value.length-1) == ',')\n\t\tvalue = value.substring(0, value.length-1);\n\t//if first char of textbox value is comma then remove\n\tif(value.charAt(0) == ',')\n\t\tvalue = value.replace(\",\", \"\");\n\t//return value\n\treturn value;\n}","function reviver(key, value){\n \n if (typeof value === \"string\"){\n var str = value.replace(/---/g, \" \");\n return str;\n }\n return value\n }","remove(value) {\n this.root = this.removeNode(thisroot, value);\n }","function trim( value ) {\n\t\n\treturn LTrim(RTrim(value));\n\t\n}","function trim( value ) {\n\t\n\treturn LTrim(RTrim(value));\n\t\n}","function trim( value ) {\n\t\n\treturn LTrim(RTrim(value));\n\t\n}","function trimNbspAfterDeleteAndPaddValue() {\n\t\t\t\t\tvar rng, container, offset;\n\n\t\t\t\t\trng = selection.getRng(true);\n\t\t\t\t\tcontainer = rng.startContainer;\n\t\t\t\t\toffset = rng.startOffset;\n\n\t\t\t\t\tif (container.nodeType == 3 && rng.collapsed) {\n\t\t\t\t\t\tif (container.data[offset] === '\\u00a0') {\n\t\t\t\t\t\t\tcontainer.deleteData(offset, 1);\n\n\t\t\t\t\t\t\tif (!/[\\u00a0| ]$/.test(value)) {\n\t\t\t\t\t\t\t\tvalue += ' ';\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else if (container.data[offset - 1] === '\\u00a0') {\n\t\t\t\t\t\t\tcontainer.deleteData(offset - 1, 1);\n\n\t\t\t\t\t\t\tif (!/[\\u00a0| ]$/.test(value)) {\n\t\t\t\t\t\t\t\tvalue = ' ' + value;\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}","removekey(value) {\n\n this.root = this.remove(this.root, value)\n\n }","function trim( value ) {\r\n\t\r\n return LTrim(RTrim(value));\r\n\t\r\n }","function trim( value )\r\n{\r\n\t\r\n\treturn LTrim(RTrim(value));\r\n\t\r\n}","function removeAt(arr, value) {\n return arr[value]\n}","cleanValue() {\n if (!this.node.value.match(/\\d/)) {\n this.node.value = '';\n }\n }","function del() {\n currentValue = currentValue.slice(0, -1);\n}","function trimNbspAfterDeleteAndPaddValue() {\n\t\t\tvar rng, container, offset;\n\n\t\t\trng = selection.getRng(true);\n\t\t\tcontainer = rng.startContainer;\n\t\t\toffset = rng.startOffset;\n\n\t\t\tif (container.nodeType == 3 && rng.collapsed) {\n\t\t\t\tif (container.data[offset] === '\\u00a0') {\n\t\t\t\t\tcontainer.deleteData(offset, 1);\n\n\t\t\t\t\tif (!/[\\u00a0| ]$/.test(value)) {\n\t\t\t\t\t\tvalue += ' ';\n\t\t\t\t\t}\n\t\t\t\t} else if (container.data[offset - 1] === '\\u00a0') {\n\t\t\t\t\tcontainer.deleteData(offset - 1, 1);\n\n\t\t\t\t\tif (!/[\\u00a0| ]$/.test(value)) {\n\t\t\t\t\t\tvalue = ' ' + value;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}","function trimNbspAfterDeleteAndPaddValue() {\n\t\t\tvar rng, container, offset;\n\n\t\t\trng = selection.getRng(true);\n\t\t\tcontainer = rng.startContainer;\n\t\t\toffset = rng.startOffset;\n\n\t\t\tif (container.nodeType == 3 && rng.collapsed) {\n\t\t\t\tif (container.data[offset] === '\\u00a0') {\n\t\t\t\t\tcontainer.deleteData(offset, 1);\n\n\t\t\t\t\tif (!/[\\u00a0| ]$/.test(value)) {\n\t\t\t\t\t\tvalue += ' ';\n\t\t\t\t\t}\n\t\t\t\t} else if (container.data[offset - 1] === '\\u00a0') {\n\t\t\t\t\tcontainer.deleteData(offset - 1, 1);\n\n\t\t\t\t\tif (!/[\\u00a0| ]$/.test(value)) {\n\t\t\t\t\t\tvalue = ' ' + value;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}","function remove_copy(first, last, output, val) {\r\n return remove_copy_if(first, last, output, function (elem) { return comparators_1.equal_to(elem, val); });\r\n}","function trim( value ) {\n\t\n\treturn LTrim(RTrim(value));\n}","function trim( value ) {\r\n\t\r\n\treturn LTrim(RTrim(value));\r\n\t\r\n}","function removeOne(){\n let x=document.getElementById('input').value;\n console.log(x);\n let length=x.length;\n console.log(length);\n if(length>0)\n {\n document.getElementById('input').value=x.slice(0,length-1);\n if(operand1==null)\n {\n operand1=null;\n }\n else{\n operand2=null;\n }\n }\n else{\n window.alert('cannot remove from empty');\n }\n}","function trim( value ) {\n\n return LTrim(RTrim(value));\n\n}","function trim( value )\r\n{\r\n return LTrim(RTrim(value));\r\n}","function trim( value )\n{\n\n return LTrim(RTrim(value));\n\n}","remove(value) {\n let currentNode = this.head;\n\n if (currentNode !== null) {\n if (currentNode.data == value) {\n this.head = currentNode.next;\n this.size--;\n } else {\n let previousNode;\n\n while (currentNode && currentNode.data !== value) {\n previousNode = currentNode;\n currentNode = currentNode.next;\n }\n\n if (currentNode && previousNode) {\n previousNode.next = currentNode.next;\n this.size--;\n } else {\n return `Given ${value} value not found !!!`;\n }\n }\n }\n }","function removeFirst(x, y){\n return x.toString().replace(y, \"\");\n }","function trim( value ) {\r\n\t\treturn LTrim(RTrim(value));\r\n\t}","function cleanup(value) {\n return value.trim();\n }","function removeValueQuery(key, value) {\n\tarray = urlParams.getAll(key).filter((el) => el != value);\n\turlParams.delete(key);\n\tarray.forEach((el) => {\n\t\turlParams.append(key, el.replaceAll(' ', '-'));\n\t});\n}","function trim( value ) {\r\n\treturn LTrim(RTrim(value));\r\n}","eliminate_token( t, type, value ) {\n if( Array.isArray(t.value) ) {\n var a = t.value\n for(var i=a.length-1; i>=0; i-- ) {\n if(a[i].type==EmptyRule.TAG || \n a[i].type ==type &&\n (value==null || t.value==value)) a.splice(i,1)\n else a[i] = this.eliminate_token(a[i],type,value)\n } \n }\n return t\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }","function subtract$1 (input, value) {\n return addSubtract$1(this, input, value, -1);\n }"],"string":"[\n \"function subInputValue(val, sub)\\n{\\n var dataArray = '';\\n var data = \\\"\\\";\\n if (val == sub) return 0;\\n dataArray = val.toString().split(',');\\n var index = $.inArray(sub, dataArray);\\n dataArray.splice(index, 1);\\n return dataArray.join();\\n}\",\n \"deleteVal(str) {\\n\\t\\tvar sub = str.substring(0, str.length - 1);\\n\\t\\treturn sub;\\n\\t}\",\n \"function removeSarja(subfield) {\\n if (subfield.code !== 'a') {\\n return;\\n }\\n const tmp = subfield.value.replace(/ ?-(?:[a-z]|ä|ö)*sarja$/u, '');\\n if (tmp.length > 0) {\\n subfield.value = tmp; // eslint-disable-line functional/immutable-data\\n return;\\n }\\n }\",\n \"function removeChar(value, char) {\\n if (!value.length || !char.length) {\\n return '';\\n }\\n\\n if (char.includes(value[0])) {\\n return '' + removeChar(value.slice(1), char);\\n }\\n\\n return value[0] + removeChar(value.slice(1), char);\\n}\",\n \"function removeSubStr(str, substr) {\\n\\t\\tstr = str || \\\"\\\";\\n\\t\\tvar k = str.indexOf(substr);\\n\\t\\treturn k + 1 ? str.slice(0, k) + str.slice(k + substr.length) : str;\\n\\t}\",\n \"static removePrefix(value) {\\n if (value.includes(InitialPrefix) && value.includes(EndPrefix)) {\\n return value\\n .toString()\\n .replace(InitialPrefix, \\\"\\\")\\n .replace(EndPrefix, \\\"\\\");\\n }\\n return value;\\n }\",\n \"removeByValue (value) {\\n\\t\\tthis.remove(this.findFirst(value));\\n\\t}\",\n \"function removeSubStr(string,substring){\\n return string.replace(substring,\\\"\\\")\\n}\",\n \"removeByValue(value) {\\n return this.delete(this.getIndexOf(value));\\n }\",\n \"function listRemoveOneElementByValue(list, remove_value){\\n list=substr(list, 1, list.length-1);\\n var index=find_not_in_str_list_dict(list, remove_value);\\n list=replace_from_index_to_index(list, remove_value, \\\"\\\", index, index+remove_value.length);\\n list=append(\\\"[\\\", list);\\n list=append(list, \\\"]\\\");\\n list=replace_not_in_string(list, \\\",,\\\", \\\",\\\");\\n list=replace_not_in_string(list, \\\"[,\\\", \\\"[\\\");\\n list=replace_not_in_string(list, \\\",]\\\", \\\"]\\\");\\n return list;\\n}\",\n \"function removeTrailingZeroes(value) {\\n while (value.charAt(value.length - 1) === '0') {\\n value = value.slice(0, -1);\\n }\\n if (value.charAt(value.length - 1) === '.') {\\n value = value.slice(0, -1);\\n }\\n return value;\\n }\",\n \"removeValue (value) {\\r\\n // TODO: Do we need it?\\r\\n console.warn(`This feature is not implemented yet`)\\r\\n }\",\n \"function deleteOnValue() {\\n return displayScreenNumber.value = displayScreenNumber.value.slice(0, displayScreenNumber.value.length - 1);\\n}\",\n \"remove(value) {\\n\\t\\tif (!this.root) {\\n\\t\\t\\treturn 'Tree is empty!';\\n\\t\\t} else {\\n\\t\\t\\tthis.removeNode(this.root, value);\\n\\t\\t}\\n\\t}\",\n \"function removeZeros(value) {\\n if (value.indexOf('.') !== -1) {\\n while (value[value.length - 1] === '0') {\\n value = value.substring(0, value.length - 1);\\n }\\n if (value[value.length - 1] === '.') {\\n value = value.substring(0, value.length - 1);\\n }\\n }\\n return value;\\n}\",\n \"static subtract(array, subArray) {\\n return Utils.removeIf(array, function(el) {\\n return Utils.hasValue(subArray, el);\\n });\\n }\",\n \"removeValue(value) {\\n\\t\\tlet currentNode = this.head\\n\\t\\tlet index = 0\\n\\n\\t\\twhile (value != currentNode.value) {\\n\\t\\t\\tcurrentNode = currentNode.next\\n\\t\\t\\tindex++\\n\\t\\t}\\n\\t\\treturn this.remove(index)\\n\\t}\",\n \"function remove(as, value) {\\n var index = as.indexOf(value);\\n if (index != -1) {\\n as.splice(index, 1);\\n return true;\\n }\\n else {\\n return false;\\n }\\n }\",\n \"function dropBrackets (value) {\\n return value.replace(/[(,)]/g, '');\\n}\",\n \"static removeValue(array, value) {\\n for (var tI = array.length - 1; tI >= 0; tI--) {\\n if (array[tI] === value) {\\n array.splice(tI, 1);\\n return tI;\\n }\\n }\\n }\",\n \"function removeNumber(){\\n var stringInput = document.getElementById(\\\"input-number\\\").value; \\n var inputLength = stringInput.length\\n var remove = stringInput.slice(0,inputLength-1);\\n document.getElementById(\\\"input-number\\\").value = remove;\\n}\",\n \"function clean_start_end_value(value){\\n\\n\\t// In case we pass in a number\\n\\tvalue = value.toString();\\n\\n\\tlet changed = false;\\n\\tlet new_value;\\n\\n\\tif(value == ''){\\n\\n\\t\\t// Check if empty string\\n\\t\\tnew_value = 0;\\n\\t\\tchanged = true;\\n\\n\\t}else if(value.charAt(0) == '0'){\\n\\n\\t\\t// Remove leading zeroes\\n\\t\\tnew_value = parseInt(value,10);\\n\\t\\tchanged = true;\\n\\n\\t}else{\\n\\n\\t\\t// Check if we exceed the limits for the start or end value\\n\\t\\tnew_value = parseInt(value,10);\\n\\t\\tif(new_value > 180){\\n\\t\\t\\tnew_value = 180;\\n\\t\\t\\tchanged = true;\\t \\n\\t\\t}else if(new_value < 0){\\n\\t\\t\\tnew_value = 0;\\n\\t\\t\\tchanged = true;\\n\\t\\t}\\n\\t}\\n\\n\\tif(changed){\\n\\t\\treturn new_value;\\n\\t}else{\\n\\t\\treturn false;\\n\\t}\\n}\",\n \"function removeFromLast(){\\n \\n const previousValue = document.querySelector(\\\".inputValueShower\\\").value\\n \\n const updateValue = previousValue.substring(0, previousValue.length - 1)\\n \\n document.querySelector(\\\".inputValueShower\\\").value = updateValue \\n }\",\n \"function eat(subvalue) {\\n var indent = getOffset()\\n var pos = position()\\n var current = now()\\n\\n validateEat(subvalue)\\n\\n apply.reset = reset\\n reset.test = test\\n apply.test = test\\n\\n value = value.slice(subvalue.length)\\n\\n updatePosition(subvalue)\\n\\n indent = indent()\\n\\n return apply\\n\\n // Add the given arguments, add `position` to the returned node, and\\n // return the node.\\n function apply(node, parent) {\\n return pos(add(pos(node), parent), indent)\\n }\\n\\n // Functions just like apply, but resets the content: the line and\\n // column are reversed, and the eaten value is re-added. This is\\n // useful for nodes with a single type of content, such as lists and\\n // tables. See `apply` above for what parameters are expected.\\n function reset() {\\n var node = apply.apply(null, arguments)\\n\\n line = current.line\\n column = current.column\\n value = subvalue + value\\n\\n return node\\n }\\n\\n // Test the position, after eating, and reverse to a not-eaten state.\\n function test() {\\n var result = pos({})\\n\\n line = current.line\\n column = current.column\\n value = subvalue + value\\n\\n return result.position\\n }\\n }\",\n \"function cut_out_tags(value) {\\n return value.replace(/<.+>/g, \\\"\\\");\\n}\",\n \"static removeLeftZeros(value) {\\n while (value.startsWith('0')) {\\n value = value.substring(1, value.length);\\n }\\n return value;\\n }\",\n \"function FFString_trim( value ){\\n\\treturn FFString_trimRight(FFSting_trimLeft(value));\\t\\n}\",\n \"remove(value) {\\n this.root = this.removeVisitor(this.root, value)\\n }\",\n \"function removeDigit() {\\n pinInsert.value = pinInsert.value.slice(0, -1);\\n}\",\n \"function removeValue(array, value, can_fail) {\\n var idx = array.indexOf(value);\\n ASSERT(can_fail || idx != -1, 'Unable to Remove Value ' + value);\\n if (idx != -1) array.splice(idx, 1);\\n return idx != -1;\\n}\",\n \"function removeExtraCommas(value) {\\n\\t//if last char of textbox value is comma then remove\\n\\tif(value.charAt(value.length-1) == ',')\\n\\t\\tvalue = value.substring(0, value.length-1);\\n\\t//if first char of textbox value is comma then remove\\n\\tif(value.charAt(0) == ',')\\n\\t\\tvalue = value.replace(\\\",\\\", \\\"\\\");\\n\\t//return value\\n\\treturn value;\\n}\",\n \"function reviver(key, value){\\n \\n if (typeof value === \\\"string\\\"){\\n var str = value.replace(/---/g, \\\" \\\");\\n return str;\\n }\\n return value\\n }\",\n \"remove(value) {\\n this.root = this.removeNode(thisroot, value);\\n }\",\n \"function trim( value ) {\\n\\t\\n\\treturn LTrim(RTrim(value));\\n\\t\\n}\",\n \"function trim( value ) {\\n\\t\\n\\treturn LTrim(RTrim(value));\\n\\t\\n}\",\n \"function trim( value ) {\\n\\t\\n\\treturn LTrim(RTrim(value));\\n\\t\\n}\",\n \"function trimNbspAfterDeleteAndPaddValue() {\\n\\t\\t\\t\\t\\tvar rng, container, offset;\\n\\n\\t\\t\\t\\t\\trng = selection.getRng(true);\\n\\t\\t\\t\\t\\tcontainer = rng.startContainer;\\n\\t\\t\\t\\t\\toffset = rng.startOffset;\\n\\n\\t\\t\\t\\t\\tif (container.nodeType == 3 && rng.collapsed) {\\n\\t\\t\\t\\t\\t\\tif (container.data[offset] === '\\\\u00a0') {\\n\\t\\t\\t\\t\\t\\t\\tcontainer.deleteData(offset, 1);\\n\\n\\t\\t\\t\\t\\t\\t\\tif (!/[\\\\u00a0| ]$/.test(value)) {\\n\\t\\t\\t\\t\\t\\t\\t\\tvalue += ' ';\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t} else if (container.data[offset - 1] === '\\\\u00a0') {\\n\\t\\t\\t\\t\\t\\t\\tcontainer.deleteData(offset - 1, 1);\\n\\n\\t\\t\\t\\t\\t\\t\\tif (!/[\\\\u00a0| ]$/.test(value)) {\\n\\t\\t\\t\\t\\t\\t\\t\\tvalue = ' ' + value;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\",\n \"removekey(value) {\\n\\n this.root = this.remove(this.root, value)\\n\\n }\",\n \"function trim( value ) {\\r\\n\\t\\r\\n return LTrim(RTrim(value));\\r\\n\\t\\r\\n }\",\n \"function trim( value )\\r\\n{\\r\\n\\t\\r\\n\\treturn LTrim(RTrim(value));\\r\\n\\t\\r\\n}\",\n \"function removeAt(arr, value) {\\n return arr[value]\\n}\",\n \"cleanValue() {\\n if (!this.node.value.match(/\\\\d/)) {\\n this.node.value = '';\\n }\\n }\",\n \"function del() {\\n currentValue = currentValue.slice(0, -1);\\n}\",\n \"function trimNbspAfterDeleteAndPaddValue() {\\n\\t\\t\\tvar rng, container, offset;\\n\\n\\t\\t\\trng = selection.getRng(true);\\n\\t\\t\\tcontainer = rng.startContainer;\\n\\t\\t\\toffset = rng.startOffset;\\n\\n\\t\\t\\tif (container.nodeType == 3 && rng.collapsed) {\\n\\t\\t\\t\\tif (container.data[offset] === '\\\\u00a0') {\\n\\t\\t\\t\\t\\tcontainer.deleteData(offset, 1);\\n\\n\\t\\t\\t\\t\\tif (!/[\\\\u00a0| ]$/.test(value)) {\\n\\t\\t\\t\\t\\t\\tvalue += ' ';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else if (container.data[offset - 1] === '\\\\u00a0') {\\n\\t\\t\\t\\t\\tcontainer.deleteData(offset - 1, 1);\\n\\n\\t\\t\\t\\t\\tif (!/[\\\\u00a0| ]$/.test(value)) {\\n\\t\\t\\t\\t\\t\\tvalue = ' ' + value;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function trimNbspAfterDeleteAndPaddValue() {\\n\\t\\t\\tvar rng, container, offset;\\n\\n\\t\\t\\trng = selection.getRng(true);\\n\\t\\t\\tcontainer = rng.startContainer;\\n\\t\\t\\toffset = rng.startOffset;\\n\\n\\t\\t\\tif (container.nodeType == 3 && rng.collapsed) {\\n\\t\\t\\t\\tif (container.data[offset] === '\\\\u00a0') {\\n\\t\\t\\t\\t\\tcontainer.deleteData(offset, 1);\\n\\n\\t\\t\\t\\t\\tif (!/[\\\\u00a0| ]$/.test(value)) {\\n\\t\\t\\t\\t\\t\\tvalue += ' ';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else if (container.data[offset - 1] === '\\\\u00a0') {\\n\\t\\t\\t\\t\\tcontainer.deleteData(offset - 1, 1);\\n\\n\\t\\t\\t\\t\\tif (!/[\\\\u00a0| ]$/.test(value)) {\\n\\t\\t\\t\\t\\t\\tvalue = ' ' + value;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function remove_copy(first, last, output, val) {\\r\\n return remove_copy_if(first, last, output, function (elem) { return comparators_1.equal_to(elem, val); });\\r\\n}\",\n \"function trim( value ) {\\n\\t\\n\\treturn LTrim(RTrim(value));\\n}\",\n \"function trim( value ) {\\r\\n\\t\\r\\n\\treturn LTrim(RTrim(value));\\r\\n\\t\\r\\n}\",\n \"function removeOne(){\\n let x=document.getElementById('input').value;\\n console.log(x);\\n let length=x.length;\\n console.log(length);\\n if(length>0)\\n {\\n document.getElementById('input').value=x.slice(0,length-1);\\n if(operand1==null)\\n {\\n operand1=null;\\n }\\n else{\\n operand2=null;\\n }\\n }\\n else{\\n window.alert('cannot remove from empty');\\n }\\n}\",\n \"function trim( value ) {\\n\\n return LTrim(RTrim(value));\\n\\n}\",\n \"function trim( value )\\r\\n{\\r\\n return LTrim(RTrim(value));\\r\\n}\",\n \"function trim( value )\\n{\\n\\n return LTrim(RTrim(value));\\n\\n}\",\n \"remove(value) {\\n let currentNode = this.head;\\n\\n if (currentNode !== null) {\\n if (currentNode.data == value) {\\n this.head = currentNode.next;\\n this.size--;\\n } else {\\n let previousNode;\\n\\n while (currentNode && currentNode.data !== value) {\\n previousNode = currentNode;\\n currentNode = currentNode.next;\\n }\\n\\n if (currentNode && previousNode) {\\n previousNode.next = currentNode.next;\\n this.size--;\\n } else {\\n return `Given ${value} value not found !!!`;\\n }\\n }\\n }\\n }\",\n \"function removeFirst(x, y){\\n return x.toString().replace(y, \\\"\\\");\\n }\",\n \"function trim( value ) {\\r\\n\\t\\treturn LTrim(RTrim(value));\\r\\n\\t}\",\n \"function cleanup(value) {\\n return value.trim();\\n }\",\n \"function removeValueQuery(key, value) {\\n\\tarray = urlParams.getAll(key).filter((el) => el != value);\\n\\turlParams.delete(key);\\n\\tarray.forEach((el) => {\\n\\t\\turlParams.append(key, el.replaceAll(' ', '-'));\\n\\t});\\n}\",\n \"function trim( value ) {\\r\\n\\treturn LTrim(RTrim(value));\\r\\n}\",\n \"eliminate_token( t, type, value ) {\\n if( Array.isArray(t.value) ) {\\n var a = t.value\\n for(var i=a.length-1; i>=0; i-- ) {\\n if(a[i].type==EmptyRule.TAG || \\n a[i].type ==type &&\\n (value==null || t.value==value)) a.splice(i,1)\\n else a[i] = this.eliminate_token(a[i],type,value)\\n } \\n }\\n return t\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\",\n \"function subtract$1 (input, value) {\\n return addSubtract$1(this, input, value, -1);\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.66989744","0.615324","0.6097065","0.6078783","0.59160215","0.5887385","0.5751531","0.5706532","0.5595195","0.5557081","0.5488317","0.54675454","0.5466561","0.5354575","0.5338592","0.53191656","0.53060836","0.53027904","0.5236537","0.5217721","0.52087337","0.5207466","0.52063435","0.518902","0.51641876","0.51426446","0.5140779","0.5134126","0.5122181","0.5110599","0.51101446","0.51026213","0.5093175","0.5091366","0.5091366","0.5091366","0.5087284","0.50858223","0.5084209","0.50797963","0.50746536","0.50738543","0.50632775","0.5058835","0.5058835","0.5057153","0.50476307","0.50425947","0.504131","0.5032724","0.503269","0.503151","0.5030651","0.5020485","0.5015161","0.5014819","0.5008207","0.5007002","0.5006053","0.5004041","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496","0.5003496"],"string":"[\n \"0.66989744\",\n \"0.615324\",\n \"0.6097065\",\n \"0.6078783\",\n \"0.59160215\",\n \"0.5887385\",\n \"0.5751531\",\n \"0.5706532\",\n \"0.5595195\",\n \"0.5557081\",\n \"0.5488317\",\n \"0.54675454\",\n \"0.5466561\",\n \"0.5354575\",\n \"0.5338592\",\n \"0.53191656\",\n \"0.53060836\",\n \"0.53027904\",\n \"0.5236537\",\n \"0.5217721\",\n \"0.52087337\",\n \"0.5207466\",\n \"0.52063435\",\n \"0.518902\",\n \"0.51641876\",\n \"0.51426446\",\n \"0.5140779\",\n \"0.5134126\",\n \"0.5122181\",\n \"0.5110599\",\n \"0.51101446\",\n \"0.51026213\",\n \"0.5093175\",\n \"0.5091366\",\n \"0.5091366\",\n \"0.5091366\",\n \"0.5087284\",\n \"0.50858223\",\n \"0.5084209\",\n \"0.50797963\",\n \"0.50746536\",\n \"0.50738543\",\n \"0.50632775\",\n \"0.5058835\",\n \"0.5058835\",\n \"0.5057153\",\n \"0.50476307\",\n \"0.50425947\",\n \"0.504131\",\n \"0.5032724\",\n \"0.503269\",\n \"0.503151\",\n \"0.5030651\",\n \"0.5020485\",\n \"0.5015161\",\n \"0.5014819\",\n \"0.5008207\",\n \"0.5007002\",\n \"0.5006053\",\n \"0.5004041\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\",\n \"0.5003496\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.51343733"},"document_rank":{"kind":"string","value":"30"}}},{"rowIdx":76395,"cells":{"query":{"kind":"string","value":"Add the given arguments, add `position` to the returned node, and return the node."},"document":{"kind":"string","value":"function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["assignPosition(node, position) {\n // update the position of the node\n node.position = position;\n \n // the base case\n if (node.children.length === 0)\n {\n leafNodeCounter = leafNodeCounter + 1;\n return node;\n }\n // recursive case\n else\n {\n leafNodeCounter = 0;\n for (var d = 0; d < node.children.length; d++)\n {\n // this is a really bad hack and there is definitely something better out there. \n // However, it gets the job done\n if (node.children[d].name === \"Protosomes\")\n {\n leafNodeCounter = leafNodeCounter + 2;\n }\n\n this.assignPosition(node.children[d], node.position + leafNodeCounter);\n }\n }\n\n }","addAfter(value, position){\n\t\tif(!this.head) return this.add(value);\n\t\tif(this.length < position) return 'position does not exist';\n\t\tif(this.length === position) return this.add(value);\n\t\tlet newNode = new Node(value);\n\t\tlet aux, count = 1;\n\t\tlet current = this.head;\n\t\twhile(count <= position){\n\t\t\tcurrent = current.next\n\t\t\tcount++\n\t\t}\n\t\taux = current.next;\n\t\tnewNode.next = aux;\n\t\tcurrent.next = newNode;\n\t\tthis.length++;\n\t\treturn this;\n\t}","insertAtPosition(position, nodeToInsert) {\n if(position > this.length + 1 || !position || !nodeToInsert)\n return\n\n if(position === 1) {\n this.setHead(nodeToInsert)\n return\n }\n\n let curr = this.head, currPost = 1\n while(curr && currPost++ < position)\n curr = curr.next\n\n if(curr) this.insertBefore(curr, nodeToInsert)\n else this.setTail(nodeToInsert)\n\n }","pushPosition(position) {\n\t\tthis.positionContainer.push(position);\n\t}","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n\t var start = { line: lineno, column: column };\n\t return function(node){\n\t node.position = new Position(start);\n\t whitespace();\n\t return node;\n\t };\n\t }","function position() {\n var start = {line: lineno, column: column}\n return function(node) {\n node.position = new Position(start)\n whitespace()\n return node\n }\n }","function insertNode(text, position, parentNode, session) {\n var seed = session.seed();\n\n seed.setValue(text);\n parentNode.insert(seed, position);\n\n return seed;\n }","insertIn(position, value) {\n if (position < 0 || \n position > this.length) {\n\n console.error(\"Position is out of range! \", position)\n return null;\n }\n\n let node = new Node(value);\n\n if (position === 0) {\n\n node.next = this.head;\n this.head = node;\n\n } else {\n let current = this.head,\n prev = null,\n index = 0;\n\n while (index < position) {\n prev = current;\n current = current.next;\n index ++;\n }\n\n prev.next = node;\n node.next = current;\n }\n\n this.length++;\n\n }","async addNode(){\r\n return this.call('addnode',...(Array.from(arguments)));\r\n }","function position() {\n var before = now()\n\n return update\n\n // Add the position to a node.\n function update(node, indent) {\n var previous = node.position\n var start = previous ? previous.start : before\n var combined = []\n var n = previous && previous.end.line\n var l = before.line\n\n node.position = new Position(start)\n\n // If there was already a `position`, this node was merged. Fixing\n // `start` wasn’t hard, but the indent is different. Especially\n // because some information, the indent between `n` and `l` wasn’t\n // tracked. Luckily, that space is (should be?) empty, so we can\n // safely check for it now.\n if (previous && indent && previous.indent) {\n combined = previous.indent\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1)\n }\n\n combined.push(before.column)\n }\n\n indent = combined.concat(indent)\n }\n\n node.position.indent = indent || []\n\n return node\n }\n }","function position() {\n var before = now();\n\n return update;\n\n /* Add the position to a node. */\n function update(node, indent) {\n var prev = node.position;\n var start = prev ? prev.start : before;\n var combined = [];\n var n = prev && prev.end.line;\n var l = before.line;\n\n node.position = new Position(start);\n\n /* If there was already a `position`, this\n * node was merged. Fixing `start` wasn’t\n * hard, but the indent is different.\n * Especially because some information, the\n * indent between `n` and `l` wasn’t\n * tracked. Luckily, that space is\n * (should be?) empty, so we can safely\n * check for it now. */\n if (prev && indent && prev.indent) {\n combined = prev.indent;\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1);\n }\n\n combined.push(before.column);\n }\n\n indent = combined.concat(indent);\n }\n\n node.position.indent = indent || [];\n\n return node;\n }\n }","function position() {\n var before = now();\n\n return update;\n\n /* Add the position to a node. */\n function update(node, indent) {\n var prev = node.position;\n var start = prev ? prev.start : before;\n var combined = [];\n var n = prev && prev.end.line;\n var l = before.line;\n\n node.position = new Position(start);\n\n /* If there was already a `position`, this\n * node was merged. Fixing `start` wasn’t\n * hard, but the indent is different.\n * Especially because some information, the\n * indent between `n` and `l` wasn’t\n * tracked. Luckily, that space is\n * (should be?) empty, so we can safely\n * check for it now. */\n if (prev && indent && prev.indent) {\n combined = prev.indent;\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1);\n }\n\n combined.push(before.column);\n }\n\n indent = combined.concat(indent);\n }\n\n node.position.indent = indent || [];\n\n return node;\n }\n }","function position() {\n var before = now();\n\n return update;\n\n /* Add the position to a node. */\n function update(node, indent) {\n var prev = node.position;\n var start = prev ? prev.start : before;\n var combined = [];\n var n = prev && prev.end.line;\n var l = before.line;\n\n node.position = new Position(start);\n\n /* If there was already a `position`, this\n * node was merged. Fixing `start` wasn’t\n * hard, but the indent is different.\n * Especially because some information, the\n * indent between `n` and `l` wasn’t\n * tracked. Luckily, that space is\n * (should be?) empty, so we can safely\n * check for it now. */\n if (prev && indent && prev.indent) {\n combined = prev.indent;\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1);\n }\n\n combined.push(before.column);\n }\n\n indent = combined.concat(indent);\n }\n\n node.position.indent = indent || [];\n\n return node;\n }\n }","function position() {\n var before = now();\n\n return update;\n\n /* Add the position to a node. */\n function update(node, indent) {\n var prev = node.position;\n var start = prev ? prev.start : before;\n var combined = [];\n var n = prev && prev.end.line;\n var l = before.line;\n\n node.position = new Position(start);\n\n /* If there was already a `position`, this\n * node was merged. Fixing `start` wasn’t\n * hard, but the indent is different.\n * Especially because some information, the\n * indent between `n` and `l` wasn’t\n * tracked. Luckily, that space is\n * (should be?) empty, so we can safely\n * check for it now. */\n if (prev && indent && prev.indent) {\n combined = prev.indent;\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1);\n }\n\n combined.push(before.column);\n }\n\n indent = combined.concat(indent);\n }\n\n node.position.indent = indent || [];\n\n return node;\n }\n }","function position() {\n var before = now();\n\n return update;\n\n /* Add the position to a node. */\n function update(node, indent) {\n var prev = node.position;\n var start = prev ? prev.start : before;\n var combined = [];\n var n = prev && prev.end.line;\n var l = before.line;\n\n node.position = new Position(start);\n\n /* If there was already a `position`, this\n * node was merged. Fixing `start` wasn’t\n * hard, but the indent is different.\n * Especially because some information, the\n * indent between `n` and `l` wasn’t\n * tracked. Luckily, that space is\n * (should be?) empty, so we can safely\n * check for it now. */\n if (prev && indent && prev.indent) {\n combined = prev.indent;\n\n if (n < l) {\n while (++n < l) {\n combined.push((offset[n] || 0) + 1);\n }\n\n combined.push(before.column);\n }\n\n indent = combined.concat(indent);\n }\n\n node.position.indent = indent || [];\n\n return node;\n }\n }","assignPosition(node, position) {\n\t\tif(node.parentNode && position<node.parentNode.position){\n\t\t\tposition = node.parentNode.position;\n\t\t}\n\t\twhile(this.positionMap.get(`${node.level},${position}`)){\n\t\t\tposition++;\n\t\t}\n\t\tnode.position = position;\n\t\tthis.positionMap.set(`${node.level},${position}`, true);\n\t\tfor(var i in node.children){\n\t\t\tthis.assignPosition(node.children[i], position+Number(i));\n\t\t}\n\t}","createNode(pos) {\n let newX;\n let newY;\n if (pos !== undefined) {\n newX = pos.x;\n newY = pos.y;\n }\n else {\n newX = this.cursorPosition.x;\n newY = this.cursorPosition.y;\n }\n return new Types_1.Node(\"0\", this.findLowestIDAvailable(), newX, newY, this.frozen, false);\n }","function add (node, parent) {\n parent.children.push(node)\n if (parser.position) {\n parent.position = {\n start: parent.children[0].position.start,\n end: node.position.end\n }\n }\n }","function position() {\n const start = {\n line: lineno,\n column\n };\n return function (node) {\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function insertNodeAtPosition(head, data, position){ \n \tif(position == 0){\n \tconst to_insert = new LinkedListNode(data)\n \tto_insert.next = head\n head = to_insert\n return head\n }\n let count = 1\n let current = head\n while(count < position){\n \tcount++\n current = current.next\n\t}\n const to_insert = new LinkedListNode(data)\n to_insert.next = current.next\n current.next = to_insert\n \n current = head\n let result = \"\"\n while(current){\n \tresult += `${current.data} `\n \tcurrent = current.next\n }\n \n return head\n}","function insert(position, newText) {\n return { range: { start: position, end: position }, newText: newText };\n }","function insert(position, newText) {\r\n return { range: { start: position, end: position }, newText: newText };\r\n }","function insert(position, newText) {\r\n return { range: { start: position, end: position }, newText: newText };\r\n }","function insert(position, newText) {\r\n return { range: { start: position, end: position }, newText: newText };\r\n }","function insert(position, newText) {\r\n return { range: { start: position, end: position }, newText: newText };\r\n }","function insert(position, newText) {\r\n return { range: { start: position, end: position }, newText: newText };\r\n }","function insert(position, newText) {\r\n return { range: { start: position, end: position }, newText: newText };\r\n }","function insert(position, newText) {\n return {\n range: {\n start: position,\n end: position\n },\n newText: newText\n };\n }","function insert(position, newText) {\n return {\n range: {\n start: position,\n end: position\n },\n newText: newText\n };\n }","function insert(position, newText) {\n return {\n range: {\n start: position,\n end: position\n },\n newText: newText\n };\n }","function adjustNodeInsertPosition(root, nodeToInsert, position) {\n adjustSteps.forEach(function (handler) {\n position = handler(root, nodeToInsert, position);\n });\n return position;\n}","insertAfter(position, data) {\n /*\n `position === -1` means we are adding the node before the head,\n hence, our `head` should be changed\n */\n if (position === -1) {\n let newNode = new ListNode(data)\n newNode.next = this.head\n this.head = newNode\n return\n }\n\n let currentNode = this.find(position)\n\n if (currentNode) {\n let newNode = new ListNode(data)\n newNode.next = currentNode.next\n currentNode.next = newNode\n } else {\n throw new Error(`Cannot insert at position ${position + 1}: unreachable position!`)\n }\n }","addPosition(pos) {\n this.positions += '=\"'+pos.line + ':' + pos.linePosition + '\",';\n }","insert(pos, val) {\n const newNode = new LListNode(val, pos.current().getNext());\n pos.current().setNext(newNode);\n pos.next();\n return pos;\n }","insert(position, element){\n if (position >= 0 && position < this.length){\n var node = new Node(element);\n var current = this.head;\n var previous;\n var counter = 0;\n // if adding element at the beginning of the list...\n if (position === 0){\n // push back the 1st element...\n node.next = current;\n // point head to inserted node\n this.head = node;\n } else {\n // loop thru til we reach the desired position...\n while (counter++ < position){\n previous = current;\n current = current.next;\n }\n // when finally bust out of the loop, CURRENT is referencing element after the position we would like to insert... (want to add new item b/w prev and current)\n // point previous.next to node && point node.next to current\n // make a link b/w the new item and current\n node.next = current;\n // change link b/w previous and current\n previous.next = node;\n }\n this.length++;\n return true;\n } else {\n return false;\n }\n }","function position() {\n var start = { line: lineno, column: column };\n return function (node) {\n node.position = new ParsePosition(start);\n whitespace();\n return node;\n };\n }","addNode(x, y, text, rx = 20, ry = 20) {\n let node = new Node(x, y, rx, ry, text);\n this.root.appendChild(node.root);\n this.nodes.push(node);\n return node;\n }","function addPosition(x,y,positionArray) {\n var position={x,y};\n positionArray.push(position);\n}","getNextPositionForward(position) {\n const valueToAdd = position.c === 'N' || position.c === 'E' ? 1 : -1;\n const propToChange = position.c ==='W' || position.c === 'E' ? 'x' : 'y';\n position[propToChange] = position[propToChange] + valueToAdd;\n return position;\n }","newPosition(position) {\n this.position = position;\n }","constructor($pos) {\n let node = $pos.nodeAfter;\n let $end = $pos.node(0).resolve($pos.pos + node.nodeSize);\n super($pos, $end);\n this.node = node;\n }","function insertNode(location, reference) {\n\tvar newNode = document.createElement('div');\n\tnewNode.className = 'node';\n\n\tif (location === 'before') {\n\t\tnodeList.insertBefore(newNode, reference);\n\t} else {\n\t\tnodeList.insertBefore(newNode, reference.nextSibling);\n\t}\n\t\n\tnewNode.innerHTML = nodeFiller;\n}","findChildAtPosition(position, options) {\n return this.findChild((node) => {\n var _a;\n //if the current node includes this range, keep that node\n if (util_1.default.rangeContains(node.range, position)) {\n return (_a = node.findChildAtPosition(position, options)) !== null && _a !== void 0 ? _a : node;\n }\n }, options);\n }","function addText(text, position = \"left\", color = \"\") {\n\tlet element = new Text(text, position, color ? color : fontColor);\n\telement.add();\n\treturn element;\n}","insertAt(element, position){\n var head = this.head;\n var node = new Node(element);\n if(position <=0 || position>this.size+1)\n return;\n else if(position == 1){\n node.next = head;\n this.head = node;\n }\n else if(position == this.size+1){\n var current = this.head;\n while(current.next){\n current = current.next;\n }\n current.next = node;\n }\n else{\n var current = this.head;\n for(var i=1; i<position-1; i++){\n current = current.next;\n }\n var nextNode = current.next;\n node.next = current.next;\n current.next = node;\n\n }\n this.size++;\n\n }","insertAt(item, position) {\n if(this.head === null) {\n this.head = new _Node(item, this.head)\n }\n let currNode = this.head\n let count = 0\n while(count < position - 1) {\n currNode = currNode.next\n count++\n }\n currNode.next = new _Node(item, currNode.next)\n }","updatePosition(position) {\n if (position == null)\n return;\n const positionNodes = parseExpressions(position)[0].terms;\n for (let i = 0; i < 3; ++i) {\n this.position.setComponent(i, normalizeUnit(positionNodes[i]).number);\n }\n this.updateMatrixWorld();\n }","updatePosition(position) {\n if (position == null)\n return;\n const positionNodes = parseExpressions(position)[0].terms;\n for (let i = 0; i < 3; ++i) {\n this.position.setComponent(i, normalizeUnit(positionNodes[i]).number);\n }\n }","function InsertNode() {}","function calcPosition (position, velocity) {\n var deltaP = multVector(velocity, animSpeed);\n return addVectors(position, deltaP);\n}","goToPosition(position) {\n\t\t//if we are already ina position clear the positionContainer\n\t\tif (this.presentPosition()) {\n\t\t\tthis.positionContainer.length = 0;\n\t\t}\n\t\t//if we find an 'entry' in a given position , we call it\n\t\tif (position.entry) {\n\t\t\tposition.entry(play);\n\t\t}\n\t\t//setting the current game position in the positionContainer\n\t\tthis.positionContainer.push(position);\n\t}","addModifier(modifier, position) {\n if (position !== undefined) {\n modifier.setPosition(position);\n }\n\n modifier.setStave(this);\n this.formatted = false;\n this.modifiers.push(modifier);\n return this;\n }","function add_node( id, type, place)\n{\n\tvar my = document.createElement(type);\n\tmy.id = id;\n\n\tmy.style.position = \"relative\";\n\n\tplace.appendChild(my);\n\n\treturn my;\n}","function createNodes(node, positionX, positionY, val = 0){\n let newVal = val + int(node.freq);\n circles.push([positionX, positionY, node.freq, node.symbol]);\n \n if(node.left !== null){\n createNodes(node.left, positionX - 100, positionY + 100, newVal);\n lines.push([positionX, positionY, positionX - 100, positionY + 100]);\n } \n \n if(node.right !== null){\n createNodes(node.right, positionX + 100, positionY + 100, newVal)\n lines.push([positionX, positionY, positionX + 100, positionY + 100]);\n }\n \n}","appendValue( value, location ) {\n const node = new Node( value )\n\n if ( ! this.head ) {\n this.head = node\n\n return this\n }\n\n if ( location === 0 ) {\n node.next = this.head.next\n this.head.next = node\n\n return this\n }\n\n let count = 0\n let runner = this.head\n\n while ( count < location && runner.next ) {\n runner = runner.next\n count ++\n }\n\n node.next = runner.next\n runner.next = node\n\n return this\n }","function node_add(_pos, _rx, _ry, _fontsize,_type){\r\n\tvar newnode=null;\r\n\tvar title_pre = \"V\";\r\n\tswitch(_type){\r\n\t\tcase \"ellipse\": title_pre =\"F\";\r\n\t\t\tbreak;\r\n\t\tcase \"rect\": title_pre =\"X\";\r\n\t\t\tbreak;\r\n\t\tcase \"triangle\": title_pre = \"1\";\r\n\t\t\tbreak;\r\n\t\tdefault:;\r\n\t}// end of switch (_type) title_pre\r\n\tswitch (_type){\r\n\t\tcase \"ellipse\": \r\n\t\t\tNodecurrent_IdNUM++;\r\n\t\t\tElli_current_TitleNUM++;\t\t\t\r\n\t\t\tnewnode = { id: \"node\"+String(Nodecurrent_IdNUM), type: _type, x:_pos.x, y:_pos.y, rx: default_RADIUSH,ry:default_RADIUSV, strokedotted:0, color: defaultCOLOR, title: title_pre+ Elli_current_TitleNUM, fontsize:defaultFONTSIZE,strokewidth:default_strokeWIDTH, selected: false};\r\n\t\t\tnodes.push(newnode);\r\n\t\t\tnumElli++;\r\n\t\t\tnumNode++;\t\t\t\t\r\n\t\t\tbreak;\r\n\t\tcase \"rect\":\r\n\t\t\tNodecurrent_IdNUM++;\r\n\t\t\tRec_current_TitleNUM++;\r\n\t\t\tnewnode = { id: \"node\"+String(Nodecurrent_IdNUM), type: _type, x:_pos.x, y:_pos.y, rx: default_RADIUSH,ry:default_RADIUSV, strokedotted:0, color: defaultCOLOR, title: title_pre+ Rec_current_TitleNUM, fontsize:defaultFONTSIZE,strokewidth:default_strokeWIDTH,selected: false};\r\n\t\t\tnodes.push(newnode);\r\n\t\t\tnumRec++;\r\n\t\t\tnumNode++;\t\t\t\t\r\n\t\t\tbreak;\r\n\t\tcase \"triangle\":{\r\n\t\t\tNodecurrent_IdNUM++;\r\n\t\t\tnewnode = { id: \"node\"+String(Nodecurrent_IdNUM), type: _type, x:_pos.x, y:_pos.y, rx: default_RADIUSH,ry:default_RADIUSV, strokedotted:0, color: defaultCOLOR, title: title_pre, fontsize:defaultFONTSIZE,strokewidth:default_strokeWIDTH,selected: false};\r\n\t\t\tnodes.push(newnode);\r\n\t\t\tnumTri++;\r\n\t\t\tnumNode++;\t\t\t\t\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\t\tbreak;\r\n\t\tdefault:;\r\n\t}//end of switch (_type) \r\n\treturn newnode;\r\n}","insert (options) {\n // set the parent div and create the node:\n options.div= this.div.sub;\n options.control= this.control;\n var node= new MooTreeNode(options);\n // set the new node's parent:\n node.parent= this;\n // mark this node's last node as no longer being the last, then add the new last node:\n var n= this.nodes;\n if (n.length) n[n.length-1].last= false;\n n.push(node);\n // repaint the new node:\n node.update();\n // repaint the new node's parent (this node):\n if (n.length == 1) this.update();\n // recursively repaint the new node's previous sibling node:\n if (n.length > 1) n[n.length-2].update(true);\n return node;\n }","insertAt(position,item){\n \n if(this.head === null){\n this.insertFirst(item);\n }\n \n let ticker = 0;\n let currNode = this.head;\n let nextNode = this.head;\n \n while ((nextNode !== null) && (ticker !== position)) {\n //save the previous node \n currNode = nextNode;\n nextNode = currNode.next;\n ticker++;\n }\n \n currNode.next = new _Node(item,nextNode);\n \n }","function prepareUiNode( node, position ) {\n\t\t\n\t\tvar id = node.getId();\n\t\tvar type = node.getInfo().nodeType;\n\t\tvar name = node.getInfo().typeName;\n\t\t\n\t\tvar div = $('<div>', {id : id})\n\t\t\t\t\t.addClass(campaign_designer.settings.nodeClass)\n\t\t\t\t\t.offset(position)\n\t\t\t\t\t.appendTo(campaign_designer.settings.nodePositionRoot)\n\t\t\t\t\t.html(\tname+'<br/><br/>' + \n\t\t\t\t\t\t\t'<a href=\"#\" class=\"cmdLink edit\" rel=\"'+id+'\">edit</a><br/>'+\n\t\t\t\t\t\t\t'<a href=\"#\" class=\"cmdLink remove\" rel=\"'+id+'\">remove</a>');\n\t\tnode.setUiNode( div );\n\t\treturn div;\n\t}","insert(element, position) {\n // check for out-of-bounds values\n if(index >= 0 && index <= this.count) { \n const node = new Node(element);\n // change the head reference to node and add a new element to the list\n if(index === 0) { \n node.next = current; \n this.head = node;\n // to loop through the list until the desired position\n } else {\n const previous = this.getElementAt(index - 1);\n node.next = previous.next; // to link the new node and the current\n previous.next = node; \n }\n this.count++;\n return true;\n }\n return false;\n }","function createObject(position, member) {\n\n function newObj(position, member) {\n this.position = position;\n this.member = member;\n }\n\n var newOB = new newObj(position, member);\n\n listOfPosition.push(newOB);\n\n\n}","function ParticleRotateToPositionNode(mode /*uint*/, position) {\n if (position === void 0) { position = null; }\n _super.call(this, \"ParticleRotateToPosition\", mode, 3, 3);\n this._pStateClass = ParticleRotateToPositionState;\n this._iPosition = position || new Vector3D();\n }","function addEl() {\r\n var nodes = arguments\r\n for (var i = 1; i < nodes.length; i++) {\r\n nodes[i - 1].appendChild(nodes[i])\r\n }\r\n}","insert(pos, val){\r\n\r\n if(pos > this.length || pos < 0) return false;\r\n\r\n if(pos === this.length){\r\n this.push(val);\r\n }else if(pos === 0){\r\n this.unshift(val);\r\n }else{\r\n let selectedNode = this.getNode(pos-1);\r\n let oldNext = selectedNode.next;\r\n\r\n let newNode = new Node(val);\r\n selectedNode.next = newNode;\r\n newNode.next = oldNext; \r\n newNode.prev = selectedNode;\r\n selectedNode.prev = newNode;\r\n this.length += 1;\r\n }\r\n\r\n return true;\r\n\r\n }","static createNode(params) {\n let renderer = params.renderer;\n let paper = params.paper;\n let metadata = params.metadata;\n let position = params.position;\n let props = params.props;\n let graph = params.graph || (params.paper ? params.paper.model : undefined);\n let node;\n if (!position) {\n position = { x: 0, y: 0 };\n }\n if (renderer && isFunction(renderer.createNode)) {\n node = renderer.createNode(metadata, props);\n }\n else {\n node = new joint.shapes.flo.Node();\n if (metadata) {\n node.attr('.label/text', metadata.name);\n }\n }\n node.set('type', joint.shapes.flo.NODE_TYPE);\n if (position) {\n node.set('position', position);\n }\n if (props) {\n Array.from(props.keys()).forEach(key => node.attr(`props/${key}`, props.get(key)));\n }\n node.attr('metadata', metadata);\n if (graph) {\n graph.addCell(node);\n }\n if (renderer && isFunction(renderer.initializeNewNode)) {\n let descriptor = {\n paper: paper,\n graph: graph\n };\n renderer.initializeNewNode(node, descriptor);\n }\n return node;\n }","add(value, type, name, status, description) {\n if(typeof value !== 'number') {\n return null;\n }\n\n if(!this.root) {\n this.root = new Node(value, type, name, status, description);\n return;\n }\n\n let _insert = (node) => {\n if(value < node.value) {\n if(node.left === null) {\n node.left = new Node(value, type, name, status, description);\n return;\n } else if (node.left !== null) {\n return +_insert(node.left);\n }\n } else if(value >= node.value) {\n if(node.right === null) {\n node.right = new Node(value, type, name, status, description);\n return;\n } else if (node.right !== null) {\n return _insert(node.right);\n }\n }\n }\n _insert(this.root);\n }","function LayoutNode(plane, position) {\n return {\n plane: plane,\n position: position\n };\n }","insertAt(element, pos) {\n let nodeToInsert = new Node(element);\n let count = 0;\n let current = this.head;\n let previous;\n if (pos === 0) {\n nodeToInsert.next = this.head;\n this.head = nodeToInsert;\n } else if (pos == this.size) {\n while (count < pos) {\n previous = current;\n current = current.next;\n count++;\n }\n previous.next = nodeToInsert;\n }\n else {\n while (count < pos) {\n previous = current;\n current = current.next;\n count++;\n }\n nodeToInsert.next = previous.next;\n previous.next = nodeToInsert;\n this.size++;\n }\n }","setPosition(pos) {\n this.position = pos;\n return this;\n }","givePosition() {\n let v = createVector(this.x, this.y);\n return v;\n }","newPosition(x, y)\n {\n this.x = x;\n this.y = y;\n }","function addNode(x,y,radius,nodeColor,nodeName)\r\n{\r\n\r\n\tnodeText[nodeString.length]='<text x=\"'+(x-4.3*nodeName.length)+'\" y=\"'+(y+2*radius)+'\" fill=\"white\">'+nodeName+'</text>';\r\n\tnodeString[nodeString.length]='<circle cx=\"'+x+'\" cy=\"'+y+'\" r=\"'+radius+'\" stroke=\"white\" stroke-width=\"1\" fill=\"'+nodeColor+'\" onmouseover=\"changeNodeInformation('+nodeString.length+')\" onClick=\"nodeClickHandle('+nodeString.length+')\" />';\r\n}","function getNodeByPosition(positionPath){\n\tvar tree = positionPath.getTree();\n\tvar node = tree.root;\n\tvar pathValues = tree.path;\n\n\tfor(var i = 0; i < pathValues.length; i++){\n\t\tnode = node.childNodes[pathValues[i]];\n\t}\n\n\treturn node;\n}","function insertOrAppend(container, pos, el) {\n var childs = container.childNodes;\n if (pos < childs.length) {\n var refNode = childs[pos];\n container.insertBefore(el, refNode);\n } else {\n container.appendChild(el);\n }\n }","function position(val, norm_fn)\n{\n norm_fn = def(norm_fn, normalizePosition);\n\n var value = norm_fn(val);\n require(typeof value !== 'undefined',\n \"Cannot create Position instance from \" + repr(val));\n\n return new Position(value);\n}","function position(val, norm_fn)\n{\n norm_fn = def(norm_fn, normalizePosition);\n\n var value = norm_fn(val);\n require(typeof value !== 'undefined',\n \"Cannot create Position instance from \" + repr(val));\n\n return new Position(value);\n}","function addNode(){\n d.push(createNode(nodeCount));\n nodeCount++;\n}","function insert(position, newText, annotation) {\n return {\n range: {\n start: position,\n end: position\n },\n newText: newText,\n annotationId: annotation\n };\n }","add(index, value) {\n if (index < 0 || index > this.size()) return; /* TODO: Throw IndexOutOfBoundsException */\n if (index === 0) return this.addFirst(value);\n if (index === this.size()) return this.addLast(value);\n\n const newNode = new Node(value);\n const beforeNode = this._getNode(index - 1);\n const afterNode = beforeNode.next;\n beforeNode.next = newNode;\n newNode.next = afterNode;\n this.length++;\n return this;\n }","function finishNodeAt(node, type, pos, loc) {\n node.type = type;\n node.end = pos;\n if (this.options.locations)\n { node.loc.end = loc; }\n if (this.options.ranges)\n { node.range[1] = pos; }\n return node\n }","function finishNodeAt(node, type, pos, loc) {\n node.type = type;\n node.end = pos;\n if (this.options.locations)\n { node.loc.end = loc; }\n if (this.options.ranges)\n { node.range[1] = pos; }\n return node\n }","function finishNodeAt(node, type, pos, loc) {\n node.type = type;\n node.end = pos;\n if (this.options.locations)\n { node.loc.end = loc; }\n if (this.options.ranges)\n { node.range[1] = pos; }\n return node\n }","pushNewPos(x, y, stack)\n\t{\n\t\tconsole.log (\"==> \", x, \", \", y);\n let npos = new Position();\n\t\tnpos.setx(x);\n\t\tnpos.sety(y);\n\t\tif (this.maze.validPosition(x,y))\n\t\t\tstack.push(npos);\n\t}","function createNode(radius, xStartPos, id) {\n var newNode = Object.create(nodeObject);\n newNode.radius = radius;\n newNode.x = xStartPos;\n newNode.y = 0;\n newNode.id = id;\n\n return newNode;\n}","function addNode(val,node){\n\tconst link = document.createElement(\"a\");\n\tconst para = document.createElement(\"p\");\n\tpara.innerHTML = val;\n\tlink.appendChild(para)\n\tnode.appendChild(link)\n}","add(x, y){\n return new Vector2(this.x + x, this.y + y);\n }","function addNodeToCy(nodeText, x, y){\r\n\tif(x == undefined) x = 0;\r\n\tif(y == undefined) y = 0;\r\n\t\r\n\tif(hasSuperSubScript(nodeText)){\r\n\t\treturn insertSuperSubscript(nodeText, x, y);\r\n\t}\t\r\n\r\n\tnode = \t{ // node\" +\r\n\t\t\t\tdata: {name: nodeText/*, label_name: nodeText*/},\r\n\t\t\t\trenderedPosition: { x: x, y: y},\r\n\t\t\t\tclasses:['base']\r\n\t\t\t};\r\n\treturn cy.add(node);\r\n}","add(v) {\n\t\tfor (var i = 0; i < arguments.length; i++) {\n\t\t\tthis.x += arguments[i].x\n\t\t\tthis.y += arguments[i].y\n\t\t}\n\n\t\treturn this;\n\t}","positionInfo(position)\n {\n return new WorldPositionInfo(this, position);\n }","function spawnLocation(xPos, yPos) {\n \n return { x: xPos, y: yPos };\n\n}","function addPosition() {\n var newposition = $(\"#position\").val();\n var params = {\n \"position\": newposition\n };\n submitAJAX(\"newpos\", params, showPosResult);\n}","function domMan(elType, text, position, callback){\n\tvar newEl = create(elType);\n\tvar textInfo = text;\n\tnewEl.appendChild(text);\n\tposition.appendChild(newEl);\n\n\tif(callback !== undefined){\n\t\tcallback(newEl);\n\t}\n}","function node_position(node){\n params = {\n x: node.getX() - node.getOffsetX(),\n y: node.getY() - node.getOffsetY(),\n width: node.getWidth() * node.getScaleX(),\n height: node.getHeight() * node.getScaleY()\n };\n\n return params;\n}","add(x, y) {\n return new Vector(this.x + x, this.y + y);\n }","FetchNodeIndex(position)\n {\n return position.x + (position.y * grid.resolution);\n }"],"string":"[\n \"assignPosition(node, position) {\\n // update the position of the node\\n node.position = position;\\n \\n // the base case\\n if (node.children.length === 0)\\n {\\n leafNodeCounter = leafNodeCounter + 1;\\n return node;\\n }\\n // recursive case\\n else\\n {\\n leafNodeCounter = 0;\\n for (var d = 0; d < node.children.length; d++)\\n {\\n // this is a really bad hack and there is definitely something better out there. \\n // However, it gets the job done\\n if (node.children[d].name === \\\"Protosomes\\\")\\n {\\n leafNodeCounter = leafNodeCounter + 2;\\n }\\n\\n this.assignPosition(node.children[d], node.position + leafNodeCounter);\\n }\\n }\\n\\n }\",\n \"addAfter(value, position){\\n\\t\\tif(!this.head) return this.add(value);\\n\\t\\tif(this.length < position) return 'position does not exist';\\n\\t\\tif(this.length === position) return this.add(value);\\n\\t\\tlet newNode = new Node(value);\\n\\t\\tlet aux, count = 1;\\n\\t\\tlet current = this.head;\\n\\t\\twhile(count <= position){\\n\\t\\t\\tcurrent = current.next\\n\\t\\t\\tcount++\\n\\t\\t}\\n\\t\\taux = current.next;\\n\\t\\tnewNode.next = aux;\\n\\t\\tcurrent.next = newNode;\\n\\t\\tthis.length++;\\n\\t\\treturn this;\\n\\t}\",\n \"insertAtPosition(position, nodeToInsert) {\\n if(position > this.length + 1 || !position || !nodeToInsert)\\n return\\n\\n if(position === 1) {\\n this.setHead(nodeToInsert)\\n return\\n }\\n\\n let curr = this.head, currPost = 1\\n while(curr && currPost++ < position)\\n curr = curr.next\\n\\n if(curr) this.insertBefore(curr, nodeToInsert)\\n else this.setTail(nodeToInsert)\\n\\n }\",\n \"pushPosition(position) {\\n\\t\\tthis.positionContainer.push(position);\\n\\t}\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n\\t var start = { line: lineno, column: column };\\n\\t return function(node){\\n\\t node.position = new Position(start);\\n\\t whitespace();\\n\\t return node;\\n\\t };\\n\\t }\",\n \"function position() {\\n var start = {line: lineno, column: column}\\n return function(node) {\\n node.position = new Position(start)\\n whitespace()\\n return node\\n }\\n }\",\n \"function insertNode(text, position, parentNode, session) {\\n var seed = session.seed();\\n\\n seed.setValue(text);\\n parentNode.insert(seed, position);\\n\\n return seed;\\n }\",\n \"insertIn(position, value) {\\n if (position < 0 || \\n position > this.length) {\\n\\n console.error(\\\"Position is out of range! \\\", position)\\n return null;\\n }\\n\\n let node = new Node(value);\\n\\n if (position === 0) {\\n\\n node.next = this.head;\\n this.head = node;\\n\\n } else {\\n let current = this.head,\\n prev = null,\\n index = 0;\\n\\n while (index < position) {\\n prev = current;\\n current = current.next;\\n index ++;\\n }\\n\\n prev.next = node;\\n node.next = current;\\n }\\n\\n this.length++;\\n\\n }\",\n \"async addNode(){\\r\\n return this.call('addnode',...(Array.from(arguments)));\\r\\n }\",\n \"function position() {\\n var before = now()\\n\\n return update\\n\\n // Add the position to a node.\\n function update(node, indent) {\\n var previous = node.position\\n var start = previous ? previous.start : before\\n var combined = []\\n var n = previous && previous.end.line\\n var l = before.line\\n\\n node.position = new Position(start)\\n\\n // If there was already a `position`, this node was merged. Fixing\\n // `start` wasn’t hard, but the indent is different. Especially\\n // because some information, the indent between `n` and `l` wasn’t\\n // tracked. Luckily, that space is (should be?) empty, so we can\\n // safely check for it now.\\n if (previous && indent && previous.indent) {\\n combined = previous.indent\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1)\\n }\\n\\n combined.push(before.column)\\n }\\n\\n indent = combined.concat(indent)\\n }\\n\\n node.position.indent = indent || []\\n\\n return node\\n }\\n }\",\n \"function position() {\\n var before = now();\\n\\n return update;\\n\\n /* Add the position to a node. */\\n function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\\n }\",\n \"function position() {\\n var before = now();\\n\\n return update;\\n\\n /* Add the position to a node. */\\n function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\\n }\",\n \"function position() {\\n var before = now();\\n\\n return update;\\n\\n /* Add the position to a node. */\\n function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\\n }\",\n \"function position() {\\n var before = now();\\n\\n return update;\\n\\n /* Add the position to a node. */\\n function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\\n }\",\n \"function position() {\\n var before = now();\\n\\n return update;\\n\\n /* Add the position to a node. */\\n function update(node, indent) {\\n var prev = node.position;\\n var start = prev ? prev.start : before;\\n var combined = [];\\n var n = prev && prev.end.line;\\n var l = before.line;\\n\\n node.position = new Position(start);\\n\\n /* If there was already a `position`, this\\n * node was merged. Fixing `start` wasn’t\\n * hard, but the indent is different.\\n * Especially because some information, the\\n * indent between `n` and `l` wasn’t\\n * tracked. Luckily, that space is\\n * (should be?) empty, so we can safely\\n * check for it now. */\\n if (prev && indent && prev.indent) {\\n combined = prev.indent;\\n\\n if (n < l) {\\n while (++n < l) {\\n combined.push((offset[n] || 0) + 1);\\n }\\n\\n combined.push(before.column);\\n }\\n\\n indent = combined.concat(indent);\\n }\\n\\n node.position.indent = indent || [];\\n\\n return node;\\n }\\n }\",\n \"assignPosition(node, position) {\\n\\t\\tif(node.parentNode && position<node.parentNode.position){\\n\\t\\t\\tposition = node.parentNode.position;\\n\\t\\t}\\n\\t\\twhile(this.positionMap.get(`${node.level},${position}`)){\\n\\t\\t\\tposition++;\\n\\t\\t}\\n\\t\\tnode.position = position;\\n\\t\\tthis.positionMap.set(`${node.level},${position}`, true);\\n\\t\\tfor(var i in node.children){\\n\\t\\t\\tthis.assignPosition(node.children[i], position+Number(i));\\n\\t\\t}\\n\\t}\",\n \"createNode(pos) {\\n let newX;\\n let newY;\\n if (pos !== undefined) {\\n newX = pos.x;\\n newY = pos.y;\\n }\\n else {\\n newX = this.cursorPosition.x;\\n newY = this.cursorPosition.y;\\n }\\n return new Types_1.Node(\\\"0\\\", this.findLowestIDAvailable(), newX, newY, this.frozen, false);\\n }\",\n \"function add (node, parent) {\\n parent.children.push(node)\\n if (parser.position) {\\n parent.position = {\\n start: parent.children[0].position.start,\\n end: node.position.end\\n }\\n }\\n }\",\n \"function position() {\\n const start = {\\n line: lineno,\\n column\\n };\\n return function (node) {\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function insertNodeAtPosition(head, data, position){ \\n \\tif(position == 0){\\n \\tconst to_insert = new LinkedListNode(data)\\n \\tto_insert.next = head\\n head = to_insert\\n return head\\n }\\n let count = 1\\n let current = head\\n while(count < position){\\n \\tcount++\\n current = current.next\\n\\t}\\n const to_insert = new LinkedListNode(data)\\n to_insert.next = current.next\\n current.next = to_insert\\n \\n current = head\\n let result = \\\"\\\"\\n while(current){\\n \\tresult += `${current.data} `\\n \\tcurrent = current.next\\n }\\n \\n return head\\n}\",\n \"function insert(position, newText) {\\n return { range: { start: position, end: position }, newText: newText };\\n }\",\n \"function insert(position, newText) {\\r\\n return { range: { start: position, end: position }, newText: newText };\\r\\n }\",\n \"function insert(position, newText) {\\r\\n return { range: { start: position, end: position }, newText: newText };\\r\\n }\",\n \"function insert(position, newText) {\\r\\n return { range: { start: position, end: position }, newText: newText };\\r\\n }\",\n \"function insert(position, newText) {\\r\\n return { range: { start: position, end: position }, newText: newText };\\r\\n }\",\n \"function insert(position, newText) {\\r\\n return { range: { start: position, end: position }, newText: newText };\\r\\n }\",\n \"function insert(position, newText) {\\r\\n return { range: { start: position, end: position }, newText: newText };\\r\\n }\",\n \"function insert(position, newText) {\\n return {\\n range: {\\n start: position,\\n end: position\\n },\\n newText: newText\\n };\\n }\",\n \"function insert(position, newText) {\\n return {\\n range: {\\n start: position,\\n end: position\\n },\\n newText: newText\\n };\\n }\",\n \"function insert(position, newText) {\\n return {\\n range: {\\n start: position,\\n end: position\\n },\\n newText: newText\\n };\\n }\",\n \"function adjustNodeInsertPosition(root, nodeToInsert, position) {\\n adjustSteps.forEach(function (handler) {\\n position = handler(root, nodeToInsert, position);\\n });\\n return position;\\n}\",\n \"insertAfter(position, data) {\\n /*\\n `position === -1` means we are adding the node before the head,\\n hence, our `head` should be changed\\n */\\n if (position === -1) {\\n let newNode = new ListNode(data)\\n newNode.next = this.head\\n this.head = newNode\\n return\\n }\\n\\n let currentNode = this.find(position)\\n\\n if (currentNode) {\\n let newNode = new ListNode(data)\\n newNode.next = currentNode.next\\n currentNode.next = newNode\\n } else {\\n throw new Error(`Cannot insert at position ${position + 1}: unreachable position!`)\\n }\\n }\",\n \"addPosition(pos) {\\n this.positions += '=\\\"'+pos.line + ':' + pos.linePosition + '\\\",';\\n }\",\n \"insert(pos, val) {\\n const newNode = new LListNode(val, pos.current().getNext());\\n pos.current().setNext(newNode);\\n pos.next();\\n return pos;\\n }\",\n \"insert(position, element){\\n if (position >= 0 && position < this.length){\\n var node = new Node(element);\\n var current = this.head;\\n var previous;\\n var counter = 0;\\n // if adding element at the beginning of the list...\\n if (position === 0){\\n // push back the 1st element...\\n node.next = current;\\n // point head to inserted node\\n this.head = node;\\n } else {\\n // loop thru til we reach the desired position...\\n while (counter++ < position){\\n previous = current;\\n current = current.next;\\n }\\n // when finally bust out of the loop, CURRENT is referencing element after the position we would like to insert... (want to add new item b/w prev and current)\\n // point previous.next to node && point node.next to current\\n // make a link b/w the new item and current\\n node.next = current;\\n // change link b/w previous and current\\n previous.next = node;\\n }\\n this.length++;\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function (node) {\\n node.position = new ParsePosition(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"addNode(x, y, text, rx = 20, ry = 20) {\\n let node = new Node(x, y, rx, ry, text);\\n this.root.appendChild(node.root);\\n this.nodes.push(node);\\n return node;\\n }\",\n \"function addPosition(x,y,positionArray) {\\n var position={x,y};\\n positionArray.push(position);\\n}\",\n \"getNextPositionForward(position) {\\n const valueToAdd = position.c === 'N' || position.c === 'E' ? 1 : -1;\\n const propToChange = position.c ==='W' || position.c === 'E' ? 'x' : 'y';\\n position[propToChange] = position[propToChange] + valueToAdd;\\n return position;\\n }\",\n \"newPosition(position) {\\n this.position = position;\\n }\",\n \"constructor($pos) {\\n let node = $pos.nodeAfter;\\n let $end = $pos.node(0).resolve($pos.pos + node.nodeSize);\\n super($pos, $end);\\n this.node = node;\\n }\",\n \"function insertNode(location, reference) {\\n\\tvar newNode = document.createElement('div');\\n\\tnewNode.className = 'node';\\n\\n\\tif (location === 'before') {\\n\\t\\tnodeList.insertBefore(newNode, reference);\\n\\t} else {\\n\\t\\tnodeList.insertBefore(newNode, reference.nextSibling);\\n\\t}\\n\\t\\n\\tnewNode.innerHTML = nodeFiller;\\n}\",\n \"findChildAtPosition(position, options) {\\n return this.findChild((node) => {\\n var _a;\\n //if the current node includes this range, keep that node\\n if (util_1.default.rangeContains(node.range, position)) {\\n return (_a = node.findChildAtPosition(position, options)) !== null && _a !== void 0 ? _a : node;\\n }\\n }, options);\\n }\",\n \"function addText(text, position = \\\"left\\\", color = \\\"\\\") {\\n\\tlet element = new Text(text, position, color ? color : fontColor);\\n\\telement.add();\\n\\treturn element;\\n}\",\n \"insertAt(element, position){\\n var head = this.head;\\n var node = new Node(element);\\n if(position <=0 || position>this.size+1)\\n return;\\n else if(position == 1){\\n node.next = head;\\n this.head = node;\\n }\\n else if(position == this.size+1){\\n var current = this.head;\\n while(current.next){\\n current = current.next;\\n }\\n current.next = node;\\n }\\n else{\\n var current = this.head;\\n for(var i=1; i<position-1; i++){\\n current = current.next;\\n }\\n var nextNode = current.next;\\n node.next = current.next;\\n current.next = node;\\n\\n }\\n this.size++;\\n\\n }\",\n \"insertAt(item, position) {\\n if(this.head === null) {\\n this.head = new _Node(item, this.head)\\n }\\n let currNode = this.head\\n let count = 0\\n while(count < position - 1) {\\n currNode = currNode.next\\n count++\\n }\\n currNode.next = new _Node(item, currNode.next)\\n }\",\n \"updatePosition(position) {\\n if (position == null)\\n return;\\n const positionNodes = parseExpressions(position)[0].terms;\\n for (let i = 0; i < 3; ++i) {\\n this.position.setComponent(i, normalizeUnit(positionNodes[i]).number);\\n }\\n this.updateMatrixWorld();\\n }\",\n \"updatePosition(position) {\\n if (position == null)\\n return;\\n const positionNodes = parseExpressions(position)[0].terms;\\n for (let i = 0; i < 3; ++i) {\\n this.position.setComponent(i, normalizeUnit(positionNodes[i]).number);\\n }\\n }\",\n \"function InsertNode() {}\",\n \"function calcPosition (position, velocity) {\\n var deltaP = multVector(velocity, animSpeed);\\n return addVectors(position, deltaP);\\n}\",\n \"goToPosition(position) {\\n\\t\\t//if we are already ina position clear the positionContainer\\n\\t\\tif (this.presentPosition()) {\\n\\t\\t\\tthis.positionContainer.length = 0;\\n\\t\\t}\\n\\t\\t//if we find an 'entry' in a given position , we call it\\n\\t\\tif (position.entry) {\\n\\t\\t\\tposition.entry(play);\\n\\t\\t}\\n\\t\\t//setting the current game position in the positionContainer\\n\\t\\tthis.positionContainer.push(position);\\n\\t}\",\n \"addModifier(modifier, position) {\\n if (position !== undefined) {\\n modifier.setPosition(position);\\n }\\n\\n modifier.setStave(this);\\n this.formatted = false;\\n this.modifiers.push(modifier);\\n return this;\\n }\",\n \"function add_node( id, type, place)\\n{\\n\\tvar my = document.createElement(type);\\n\\tmy.id = id;\\n\\n\\tmy.style.position = \\\"relative\\\";\\n\\n\\tplace.appendChild(my);\\n\\n\\treturn my;\\n}\",\n \"function createNodes(node, positionX, positionY, val = 0){\\n let newVal = val + int(node.freq);\\n circles.push([positionX, positionY, node.freq, node.symbol]);\\n \\n if(node.left !== null){\\n createNodes(node.left, positionX - 100, positionY + 100, newVal);\\n lines.push([positionX, positionY, positionX - 100, positionY + 100]);\\n } \\n \\n if(node.right !== null){\\n createNodes(node.right, positionX + 100, positionY + 100, newVal)\\n lines.push([positionX, positionY, positionX + 100, positionY + 100]);\\n }\\n \\n}\",\n \"appendValue( value, location ) {\\n const node = new Node( value )\\n\\n if ( ! this.head ) {\\n this.head = node\\n\\n return this\\n }\\n\\n if ( location === 0 ) {\\n node.next = this.head.next\\n this.head.next = node\\n\\n return this\\n }\\n\\n let count = 0\\n let runner = this.head\\n\\n while ( count < location && runner.next ) {\\n runner = runner.next\\n count ++\\n }\\n\\n node.next = runner.next\\n runner.next = node\\n\\n return this\\n }\",\n \"function node_add(_pos, _rx, _ry, _fontsize,_type){\\r\\n\\tvar newnode=null;\\r\\n\\tvar title_pre = \\\"V\\\";\\r\\n\\tswitch(_type){\\r\\n\\t\\tcase \\\"ellipse\\\": title_pre =\\\"F\\\";\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tcase \\\"rect\\\": title_pre =\\\"X\\\";\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tcase \\\"triangle\\\": title_pre = \\\"1\\\";\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tdefault:;\\r\\n\\t}// end of switch (_type) title_pre\\r\\n\\tswitch (_type){\\r\\n\\t\\tcase \\\"ellipse\\\": \\r\\n\\t\\t\\tNodecurrent_IdNUM++;\\r\\n\\t\\t\\tElli_current_TitleNUM++;\\t\\t\\t\\r\\n\\t\\t\\tnewnode = { id: \\\"node\\\"+String(Nodecurrent_IdNUM), type: _type, x:_pos.x, y:_pos.y, rx: default_RADIUSH,ry:default_RADIUSV, strokedotted:0, color: defaultCOLOR, title: title_pre+ Elli_current_TitleNUM, fontsize:defaultFONTSIZE,strokewidth:default_strokeWIDTH, selected: false};\\r\\n\\t\\t\\tnodes.push(newnode);\\r\\n\\t\\t\\tnumElli++;\\r\\n\\t\\t\\tnumNode++;\\t\\t\\t\\t\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tcase \\\"rect\\\":\\r\\n\\t\\t\\tNodecurrent_IdNUM++;\\r\\n\\t\\t\\tRec_current_TitleNUM++;\\r\\n\\t\\t\\tnewnode = { id: \\\"node\\\"+String(Nodecurrent_IdNUM), type: _type, x:_pos.x, y:_pos.y, rx: default_RADIUSH,ry:default_RADIUSV, strokedotted:0, color: defaultCOLOR, title: title_pre+ Rec_current_TitleNUM, fontsize:defaultFONTSIZE,strokewidth:default_strokeWIDTH,selected: false};\\r\\n\\t\\t\\tnodes.push(newnode);\\r\\n\\t\\t\\tnumRec++;\\r\\n\\t\\t\\tnumNode++;\\t\\t\\t\\t\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tcase \\\"triangle\\\":{\\r\\n\\t\\t\\tNodecurrent_IdNUM++;\\r\\n\\t\\t\\tnewnode = { id: \\\"node\\\"+String(Nodecurrent_IdNUM), type: _type, x:_pos.x, y:_pos.y, rx: default_RADIUSH,ry:default_RADIUSV, strokedotted:0, color: defaultCOLOR, title: title_pre, fontsize:defaultFONTSIZE,strokewidth:default_strokeWIDTH,selected: false};\\r\\n\\t\\t\\tnodes.push(newnode);\\r\\n\\t\\t\\tnumTri++;\\r\\n\\t\\t\\tnumNode++;\\t\\t\\t\\t\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t}\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tdefault:;\\r\\n\\t}//end of switch (_type) \\r\\n\\treturn newnode;\\r\\n}\",\n \"insert (options) {\\n // set the parent div and create the node:\\n options.div= this.div.sub;\\n options.control= this.control;\\n var node= new MooTreeNode(options);\\n // set the new node's parent:\\n node.parent= this;\\n // mark this node's last node as no longer being the last, then add the new last node:\\n var n= this.nodes;\\n if (n.length) n[n.length-1].last= false;\\n n.push(node);\\n // repaint the new node:\\n node.update();\\n // repaint the new node's parent (this node):\\n if (n.length == 1) this.update();\\n // recursively repaint the new node's previous sibling node:\\n if (n.length > 1) n[n.length-2].update(true);\\n return node;\\n }\",\n \"insertAt(position,item){\\n \\n if(this.head === null){\\n this.insertFirst(item);\\n }\\n \\n let ticker = 0;\\n let currNode = this.head;\\n let nextNode = this.head;\\n \\n while ((nextNode !== null) && (ticker !== position)) {\\n //save the previous node \\n currNode = nextNode;\\n nextNode = currNode.next;\\n ticker++;\\n }\\n \\n currNode.next = new _Node(item,nextNode);\\n \\n }\",\n \"function prepareUiNode( node, position ) {\\n\\t\\t\\n\\t\\tvar id = node.getId();\\n\\t\\tvar type = node.getInfo().nodeType;\\n\\t\\tvar name = node.getInfo().typeName;\\n\\t\\t\\n\\t\\tvar div = $('<div>', {id : id})\\n\\t\\t\\t\\t\\t.addClass(campaign_designer.settings.nodeClass)\\n\\t\\t\\t\\t\\t.offset(position)\\n\\t\\t\\t\\t\\t.appendTo(campaign_designer.settings.nodePositionRoot)\\n\\t\\t\\t\\t\\t.html(\\tname+'<br/><br/>' + \\n\\t\\t\\t\\t\\t\\t\\t'<a href=\\\"#\\\" class=\\\"cmdLink edit\\\" rel=\\\"'+id+'\\\">edit</a><br/>'+\\n\\t\\t\\t\\t\\t\\t\\t'<a href=\\\"#\\\" class=\\\"cmdLink remove\\\" rel=\\\"'+id+'\\\">remove</a>');\\n\\t\\tnode.setUiNode( div );\\n\\t\\treturn div;\\n\\t}\",\n \"insert(element, position) {\\n // check for out-of-bounds values\\n if(index >= 0 && index <= this.count) { \\n const node = new Node(element);\\n // change the head reference to node and add a new element to the list\\n if(index === 0) { \\n node.next = current; \\n this.head = node;\\n // to loop through the list until the desired position\\n } else {\\n const previous = this.getElementAt(index - 1);\\n node.next = previous.next; // to link the new node and the current\\n previous.next = node; \\n }\\n this.count++;\\n return true;\\n }\\n return false;\\n }\",\n \"function createObject(position, member) {\\n\\n function newObj(position, member) {\\n this.position = position;\\n this.member = member;\\n }\\n\\n var newOB = new newObj(position, member);\\n\\n listOfPosition.push(newOB);\\n\\n\\n}\",\n \"function ParticleRotateToPositionNode(mode /*uint*/, position) {\\n if (position === void 0) { position = null; }\\n _super.call(this, \\\"ParticleRotateToPosition\\\", mode, 3, 3);\\n this._pStateClass = ParticleRotateToPositionState;\\n this._iPosition = position || new Vector3D();\\n }\",\n \"function addEl() {\\r\\n var nodes = arguments\\r\\n for (var i = 1; i < nodes.length; i++) {\\r\\n nodes[i - 1].appendChild(nodes[i])\\r\\n }\\r\\n}\",\n \"insert(pos, val){\\r\\n\\r\\n if(pos > this.length || pos < 0) return false;\\r\\n\\r\\n if(pos === this.length){\\r\\n this.push(val);\\r\\n }else if(pos === 0){\\r\\n this.unshift(val);\\r\\n }else{\\r\\n let selectedNode = this.getNode(pos-1);\\r\\n let oldNext = selectedNode.next;\\r\\n\\r\\n let newNode = new Node(val);\\r\\n selectedNode.next = newNode;\\r\\n newNode.next = oldNext; \\r\\n newNode.prev = selectedNode;\\r\\n selectedNode.prev = newNode;\\r\\n this.length += 1;\\r\\n }\\r\\n\\r\\n return true;\\r\\n\\r\\n }\",\n \"static createNode(params) {\\n let renderer = params.renderer;\\n let paper = params.paper;\\n let metadata = params.metadata;\\n let position = params.position;\\n let props = params.props;\\n let graph = params.graph || (params.paper ? params.paper.model : undefined);\\n let node;\\n if (!position) {\\n position = { x: 0, y: 0 };\\n }\\n if (renderer && isFunction(renderer.createNode)) {\\n node = renderer.createNode(metadata, props);\\n }\\n else {\\n node = new joint.shapes.flo.Node();\\n if (metadata) {\\n node.attr('.label/text', metadata.name);\\n }\\n }\\n node.set('type', joint.shapes.flo.NODE_TYPE);\\n if (position) {\\n node.set('position', position);\\n }\\n if (props) {\\n Array.from(props.keys()).forEach(key => node.attr(`props/${key}`, props.get(key)));\\n }\\n node.attr('metadata', metadata);\\n if (graph) {\\n graph.addCell(node);\\n }\\n if (renderer && isFunction(renderer.initializeNewNode)) {\\n let descriptor = {\\n paper: paper,\\n graph: graph\\n };\\n renderer.initializeNewNode(node, descriptor);\\n }\\n return node;\\n }\",\n \"add(value, type, name, status, description) {\\n if(typeof value !== 'number') {\\n return null;\\n }\\n\\n if(!this.root) {\\n this.root = new Node(value, type, name, status, description);\\n return;\\n }\\n\\n let _insert = (node) => {\\n if(value < node.value) {\\n if(node.left === null) {\\n node.left = new Node(value, type, name, status, description);\\n return;\\n } else if (node.left !== null) {\\n return +_insert(node.left);\\n }\\n } else if(value >= node.value) {\\n if(node.right === null) {\\n node.right = new Node(value, type, name, status, description);\\n return;\\n } else if (node.right !== null) {\\n return _insert(node.right);\\n }\\n }\\n }\\n _insert(this.root);\\n }\",\n \"function LayoutNode(plane, position) {\\n return {\\n plane: plane,\\n position: position\\n };\\n }\",\n \"insertAt(element, pos) {\\n let nodeToInsert = new Node(element);\\n let count = 0;\\n let current = this.head;\\n let previous;\\n if (pos === 0) {\\n nodeToInsert.next = this.head;\\n this.head = nodeToInsert;\\n } else if (pos == this.size) {\\n while (count < pos) {\\n previous = current;\\n current = current.next;\\n count++;\\n }\\n previous.next = nodeToInsert;\\n }\\n else {\\n while (count < pos) {\\n previous = current;\\n current = current.next;\\n count++;\\n }\\n nodeToInsert.next = previous.next;\\n previous.next = nodeToInsert;\\n this.size++;\\n }\\n }\",\n \"setPosition(pos) {\\n this.position = pos;\\n return this;\\n }\",\n \"givePosition() {\\n let v = createVector(this.x, this.y);\\n return v;\\n }\",\n \"newPosition(x, y)\\n {\\n this.x = x;\\n this.y = y;\\n }\",\n \"function addNode(x,y,radius,nodeColor,nodeName)\\r\\n{\\r\\n\\r\\n\\tnodeText[nodeString.length]='<text x=\\\"'+(x-4.3*nodeName.length)+'\\\" y=\\\"'+(y+2*radius)+'\\\" fill=\\\"white\\\">'+nodeName+'</text>';\\r\\n\\tnodeString[nodeString.length]='<circle cx=\\\"'+x+'\\\" cy=\\\"'+y+'\\\" r=\\\"'+radius+'\\\" stroke=\\\"white\\\" stroke-width=\\\"1\\\" fill=\\\"'+nodeColor+'\\\" onmouseover=\\\"changeNodeInformation('+nodeString.length+')\\\" onClick=\\\"nodeClickHandle('+nodeString.length+')\\\" />';\\r\\n}\",\n \"function getNodeByPosition(positionPath){\\n\\tvar tree = positionPath.getTree();\\n\\tvar node = tree.root;\\n\\tvar pathValues = tree.path;\\n\\n\\tfor(var i = 0; i < pathValues.length; i++){\\n\\t\\tnode = node.childNodes[pathValues[i]];\\n\\t}\\n\\n\\treturn node;\\n}\",\n \"function insertOrAppend(container, pos, el) {\\n var childs = container.childNodes;\\n if (pos < childs.length) {\\n var refNode = childs[pos];\\n container.insertBefore(el, refNode);\\n } else {\\n container.appendChild(el);\\n }\\n }\",\n \"function position(val, norm_fn)\\n{\\n norm_fn = def(norm_fn, normalizePosition);\\n\\n var value = norm_fn(val);\\n require(typeof value !== 'undefined',\\n \\\"Cannot create Position instance from \\\" + repr(val));\\n\\n return new Position(value);\\n}\",\n \"function position(val, norm_fn)\\n{\\n norm_fn = def(norm_fn, normalizePosition);\\n\\n var value = norm_fn(val);\\n require(typeof value !== 'undefined',\\n \\\"Cannot create Position instance from \\\" + repr(val));\\n\\n return new Position(value);\\n}\",\n \"function addNode(){\\n d.push(createNode(nodeCount));\\n nodeCount++;\\n}\",\n \"function insert(position, newText, annotation) {\\n return {\\n range: {\\n start: position,\\n end: position\\n },\\n newText: newText,\\n annotationId: annotation\\n };\\n }\",\n \"add(index, value) {\\n if (index < 0 || index > this.size()) return; /* TODO: Throw IndexOutOfBoundsException */\\n if (index === 0) return this.addFirst(value);\\n if (index === this.size()) return this.addLast(value);\\n\\n const newNode = new Node(value);\\n const beforeNode = this._getNode(index - 1);\\n const afterNode = beforeNode.next;\\n beforeNode.next = newNode;\\n newNode.next = afterNode;\\n this.length++;\\n return this;\\n }\",\n \"function finishNodeAt(node, type, pos, loc) {\\n node.type = type;\\n node.end = pos;\\n if (this.options.locations)\\n { node.loc.end = loc; }\\n if (this.options.ranges)\\n { node.range[1] = pos; }\\n return node\\n }\",\n \"function finishNodeAt(node, type, pos, loc) {\\n node.type = type;\\n node.end = pos;\\n if (this.options.locations)\\n { node.loc.end = loc; }\\n if (this.options.ranges)\\n { node.range[1] = pos; }\\n return node\\n }\",\n \"function finishNodeAt(node, type, pos, loc) {\\n node.type = type;\\n node.end = pos;\\n if (this.options.locations)\\n { node.loc.end = loc; }\\n if (this.options.ranges)\\n { node.range[1] = pos; }\\n return node\\n }\",\n \"pushNewPos(x, y, stack)\\n\\t{\\n\\t\\tconsole.log (\\\"==> \\\", x, \\\", \\\", y);\\n let npos = new Position();\\n\\t\\tnpos.setx(x);\\n\\t\\tnpos.sety(y);\\n\\t\\tif (this.maze.validPosition(x,y))\\n\\t\\t\\tstack.push(npos);\\n\\t}\",\n \"function createNode(radius, xStartPos, id) {\\n var newNode = Object.create(nodeObject);\\n newNode.radius = radius;\\n newNode.x = xStartPos;\\n newNode.y = 0;\\n newNode.id = id;\\n\\n return newNode;\\n}\",\n \"function addNode(val,node){\\n\\tconst link = document.createElement(\\\"a\\\");\\n\\tconst para = document.createElement(\\\"p\\\");\\n\\tpara.innerHTML = val;\\n\\tlink.appendChild(para)\\n\\tnode.appendChild(link)\\n}\",\n \"add(x, y){\\n return new Vector2(this.x + x, this.y + y);\\n }\",\n \"function addNodeToCy(nodeText, x, y){\\r\\n\\tif(x == undefined) x = 0;\\r\\n\\tif(y == undefined) y = 0;\\r\\n\\t\\r\\n\\tif(hasSuperSubScript(nodeText)){\\r\\n\\t\\treturn insertSuperSubscript(nodeText, x, y);\\r\\n\\t}\\t\\r\\n\\r\\n\\tnode = \\t{ // node\\\" +\\r\\n\\t\\t\\t\\tdata: {name: nodeText/*, label_name: nodeText*/},\\r\\n\\t\\t\\t\\trenderedPosition: { x: x, y: y},\\r\\n\\t\\t\\t\\tclasses:['base']\\r\\n\\t\\t\\t};\\r\\n\\treturn cy.add(node);\\r\\n}\",\n \"add(v) {\\n\\t\\tfor (var i = 0; i < arguments.length; i++) {\\n\\t\\t\\tthis.x += arguments[i].x\\n\\t\\t\\tthis.y += arguments[i].y\\n\\t\\t}\\n\\n\\t\\treturn this;\\n\\t}\",\n \"positionInfo(position)\\n {\\n return new WorldPositionInfo(this, position);\\n }\",\n \"function spawnLocation(xPos, yPos) {\\n \\n return { x: xPos, y: yPos };\\n\\n}\",\n \"function addPosition() {\\n var newposition = $(\\\"#position\\\").val();\\n var params = {\\n \\\"position\\\": newposition\\n };\\n submitAJAX(\\\"newpos\\\", params, showPosResult);\\n}\",\n \"function domMan(elType, text, position, callback){\\n\\tvar newEl = create(elType);\\n\\tvar textInfo = text;\\n\\tnewEl.appendChild(text);\\n\\tposition.appendChild(newEl);\\n\\n\\tif(callback !== undefined){\\n\\t\\tcallback(newEl);\\n\\t}\\n}\",\n \"function node_position(node){\\n params = {\\n x: node.getX() - node.getOffsetX(),\\n y: node.getY() - node.getOffsetY(),\\n width: node.getWidth() * node.getScaleX(),\\n height: node.getHeight() * node.getScaleY()\\n };\\n\\n return params;\\n}\",\n \"add(x, y) {\\n return new Vector(this.x + x, this.y + y);\\n }\",\n \"FetchNodeIndex(position)\\n {\\n return position.x + (position.y * grid.resolution);\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6184237","0.5976594","0.5897871","0.5891385","0.5836728","0.5836728","0.5836728","0.5836728","0.5836728","0.5836728","0.5797177","0.57895225","0.578314","0.5762615","0.573231","0.5724759","0.57198524","0.57198524","0.57198524","0.57198524","0.57198524","0.57099944","0.56889683","0.5685877","0.56463426","0.55636245","0.5562105","0.5552071","0.5552071","0.5552071","0.5552071","0.5541066","0.5541066","0.5512098","0.5512098","0.5512098","0.5468487","0.54638124","0.54232275","0.542109","0.54192406","0.54191345","0.5402493","0.5396506","0.53817844","0.5370782","0.53576016","0.5352683","0.53459144","0.52953845","0.5289711","0.52719724","0.52669555","0.5254973","0.5246701","0.51902765","0.51588166","0.51147556","0.5088135","0.50755984","0.50638354","0.5060797","0.5042587","0.50388974","0.5036257","0.50357896","0.50217694","0.5017066","0.5005017","0.5000717","0.49979576","0.49843317","0.4979786","0.49677545","0.49519694","0.4951644","0.49506095","0.49374598","0.492315","0.49021935","0.48791328","0.48791328","0.48727736","0.4871798","0.48620468","0.4860607","0.4860607","0.4860607","0.48593706","0.48571298","0.484635","0.48361868","0.48342305","0.4833768","0.48332158","0.48250628","0.4815021","0.4812519","0.47991866","0.47970715","0.4789527"],"string":"[\n \"0.6184237\",\n \"0.5976594\",\n \"0.5897871\",\n \"0.5891385\",\n \"0.5836728\",\n \"0.5836728\",\n \"0.5836728\",\n \"0.5836728\",\n \"0.5836728\",\n \"0.5836728\",\n \"0.5797177\",\n \"0.57895225\",\n \"0.578314\",\n \"0.5762615\",\n \"0.573231\",\n \"0.5724759\",\n \"0.57198524\",\n \"0.57198524\",\n \"0.57198524\",\n \"0.57198524\",\n \"0.57198524\",\n \"0.57099944\",\n \"0.56889683\",\n \"0.5685877\",\n \"0.56463426\",\n \"0.55636245\",\n \"0.5562105\",\n \"0.5552071\",\n \"0.5552071\",\n \"0.5552071\",\n \"0.5552071\",\n \"0.5541066\",\n \"0.5541066\",\n \"0.5512098\",\n \"0.5512098\",\n \"0.5512098\",\n \"0.5468487\",\n \"0.54638124\",\n \"0.54232275\",\n \"0.542109\",\n \"0.54192406\",\n \"0.54191345\",\n \"0.5402493\",\n \"0.5396506\",\n \"0.53817844\",\n \"0.5370782\",\n \"0.53576016\",\n \"0.5352683\",\n \"0.53459144\",\n \"0.52953845\",\n \"0.5289711\",\n \"0.52719724\",\n \"0.52669555\",\n \"0.5254973\",\n \"0.5246701\",\n \"0.51902765\",\n \"0.51588166\",\n \"0.51147556\",\n \"0.5088135\",\n \"0.50755984\",\n \"0.50638354\",\n \"0.5060797\",\n \"0.5042587\",\n \"0.50388974\",\n \"0.5036257\",\n \"0.50357896\",\n \"0.50217694\",\n \"0.5017066\",\n \"0.5005017\",\n \"0.5000717\",\n \"0.49979576\",\n \"0.49843317\",\n \"0.4979786\",\n \"0.49677545\",\n \"0.49519694\",\n \"0.4951644\",\n \"0.49506095\",\n \"0.49374598\",\n \"0.492315\",\n \"0.49021935\",\n \"0.48791328\",\n \"0.48791328\",\n \"0.48727736\",\n \"0.4871798\",\n \"0.48620468\",\n \"0.4860607\",\n \"0.4860607\",\n \"0.4860607\",\n \"0.48593706\",\n \"0.48571298\",\n \"0.484635\",\n \"0.48361868\",\n \"0.48342305\",\n \"0.4833768\",\n \"0.48332158\",\n \"0.48250628\",\n \"0.4815021\",\n \"0.4812519\",\n \"0.47991866\",\n \"0.47970715\",\n \"0.4789527\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":76396,"cells":{"query":{"kind":"string","value":"Functions just like apply, but resets the content: the line and column are reversed, and the eaten value is readded. This is useful for nodes with a single type of content, such as lists and tables. See `apply` above for what parameters are expected."},"document":{"kind":"string","value":"function reset() {\n var node = apply.apply(null, arguments);\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return node;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function reset() {\n var node = apply.apply(null, arguments)\n\n line = current.line\n column = current.column\n value = subvalue + value\n\n return node\n }","_reset(line, column) {\n this.tagName = '';\n this.attributes = [];\n this.endTag = false;\n this.endSlash = false;\n this.line = line;\n this.column = column;\n }","shiftRight() {\n for (let line of this.cells) {\n for (let i = line.length - 1; i > 0; i--) {\n line[i].setType(line[i - 1].type);\n }\n line[0].setType(BeadType.default);\n }\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n var start = { line: lineno, column: column };\n return function(node){\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function position() {\n\t var start = { line: lineno, column: column };\n\t return function(node){\n\t node.position = new Position(start);\n\t whitespace();\n\t return node;\n\t };\n\t }","reverseIndex() {\n this._restrictCursor();\n const buffer = this._bufferService.buffer;\n if (buffer.y === buffer.scrollTop) {\n // possibly move the code below to term.reverseScroll();\n // test: echo -ne '\\e[1;1H\\e[44m\\eM\\e[0m'\n // blankLine(true) is xterm/linux behavior\n const scrollRegionHeight = buffer.scrollBottom - buffer.scrollTop;\n buffer.lines.shiftElements(buffer.ybase + buffer.y, scrollRegionHeight, 1);\n buffer.lines.set(buffer.ybase + buffer.y, buffer.getBlankLine(this._eraseAttrData()));\n this._dirtyRowService.markRangeDirty(buffer.scrollTop, buffer.scrollBottom);\n }\n else {\n buffer.y--;\n this._restrictCursor(); // quickfix to not run out of bounds\n }\n return true;\n }","restoreValueAt(columnIndex, rowIndex) {\n if (!this.hasCellAt(columnIndex, rowIndex))\n return;\n var cell = this.getCellElementAt(columnIndex, rowIndex);\n if (!latte._undef(cell.data('original-value'))) {\n this.setValueAt(columnIndex, rowIndex, cell.data('original-value'));\n cell.removeData('original-value');\n }\n }","function position() {\n var start = {line: lineno, column: column}\n return function(node) {\n node.position = new Position(start)\n whitespace()\n return node\n }\n }","function position() {\n const start = {\n line: lineno,\n column\n };\n return function (node) {\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }","function eat(subvalue) {\n var indent = getOffset()\n var pos = position()\n var current = now()\n\n validateEat(subvalue)\n\n apply.reset = reset\n reset.test = test\n apply.test = test\n\n value = value.slice(subvalue.length)\n\n updatePosition(subvalue)\n\n indent = indent()\n\n return apply\n\n // Add the given arguments, add `position` to the returned node, and\n // return the node.\n function apply(node, parent) {\n return pos(add(pos(node), parent), indent)\n }\n\n // Functions just like apply, but resets the content: the line and\n // column are reversed, and the eaten value is re-added. This is\n // useful for nodes with a single type of content, such as lists and\n // tables. See `apply` above for what parameters are expected.\n function reset() {\n var node = apply.apply(null, arguments)\n\n line = current.line\n column = current.column\n value = subvalue + value\n\n return node\n }\n\n // Test the position, after eating, and reverse to a not-eaten state.\n function test() {\n var result = pos({})\n\n line = current.line\n column = current.column\n value = subvalue + value\n\n return result.position\n }\n }","function reverseLine(line){\n \n var tempX = line.x1;\n var tempY = line.y1;\n line.x1 = line.x2;\n line.y1 = line.y2;\n line.x2 = tempX;\n line.y2 = tempY;\n \n return line;\n}","function decrementColumn() {\n GameData.column = correctColumn(GameData.column--);\n}","function position() {\n var start = { line: lineno, column: column };\n return function (node) {\n node.position = new ParsePosition(start);\n whitespace();\n return node;\n };\n }","_reverseCols() {\n this.forEach(arr => {\n arr.reverse();\n });\n }","restore() {\n if(this.saved.caret)\n this.set(this.saved.startNodeIndex, this.saved.startOffset);\n else\n this.set(this.saved.startNodeIndex, this.saved.startOffset,\n this.saved.endNodeIndex, this.saved.endOffset);\n }","propagateFromRightSibling(node, parentPos, rightSibling) {\n let nodeElement = node.parent.popAt(parentPos);\n this.addAtLastIndexOfCallStack(\n this.undoPopAt.bind(this, nodeElement, node.parent, parentPos)\n );\n\n let nodeElementLeftChildOldValue = nodeElement.leftChild;\n nodeElement.leftChild = node.hasRightmostChild() ? node.getRightmostChild() : this.recentNode;\n this.addAtLastIndexOfCallStack(\n () => {\n nodeElement.leftChild = nodeElementLeftChildOldValue;\n }\n );\n\n let nodeElementRightChildOldValue = nodeElement.rightChild;\n nodeElement.rightChild = rightSibling.getLeftmostChild();\n this.addAtLastIndexOfCallStack(\n () => {\n nodeElement.rightChild = nodeElementRightChildOldValue;\n }\n );\n\n if (nodeElement.hasLeftChild()) {\n let nodeElementLeftChildParentOldValue = nodeElement.leftChild.parent;\n nodeElement.leftChild.parent = node;\n this.addAtLastIndexOfCallStack(\n () => {\n nodeElement.leftChild.parent = nodeElementLeftChildParentOldValue;\n }\n );\n }\n\n if (nodeElement.hasRightChild()) {\n let nodeElementRightChildParent = nodeElement.rightChild.parent;\n nodeElement.rightChild.parent = node;\n this.addAtLastIndexOfCallStack(\n () => {\n nodeElement.rightChild.parent = nodeElementRightChildParent;\n }\n );\n }\n\n node.addLast(nodeElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddLast.bind(this, node)\n );\n\n let parentElement = rightSibling.popFirst();\n this.addAtLastIndexOfCallStack(\n this.undoPopFirst.bind(this, parentElement, rightSibling)\n );\n\n let parentElementLeftChildOldValue = parentElement.leftChild;\n parentElement.leftChild = node;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.leftChild = parentElementLeftChildOldValue;\n }\n );\n\n let parentElementRightChildOldValue = parentElement.rightChild;\n parentElement.rightChild = rightSibling;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.rightChild = parentElementRightChildOldValue;\n }\n );\n\n node.parent.addAt(parentPos, parentElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddAt.bind(this, node.parent, parentPos)\n );\n }","propagateFromLeftSibling(node, parentPos, leftSibling) {\n let nodeElement = node.parent.popAt(parentPos);\n this.addAtLastIndexOfCallStack(\n this.undoPopAt.bind(this, nodeElement, node.parent, parentPos)\n );\n\n let oldLeftChildValue = nodeElement.leftChild;\n nodeElement.leftChild = leftSibling.getRightmostChild();\n this.addAtLastIndexOfCallStack(\n () => {\n nodeElement.leftChild = oldLeftChildValue;\n }\n );\n\n let oldRightChildValue = nodeElement.rightChild;\n nodeElement.rightChild = node.hasLeftmostChild() ? node.getLeftmostChild() : this.recentNode;\n this.addAtLastIndexOfCallStack(\n () => {\n nodeElement.rightChild = oldRightChildValue;\n }\n );\n\n if (nodeElement.hasLeftChild()) {\n let oldLeftChildParentValue = nodeElement.leftChild.parent;\n nodeElement.leftChild.parent = node;\n this.addAtLastIndexOfCallStack(\n () => {\n nodeElement.leftChild.parent = oldLeftChildParentValue\n }\n );\n }\n\n if (nodeElement.hasRightChild()) {\n let oldRightChildParentValue = nodeElement.rightChild.parent;\n nodeElement.rightChild.parent = node;\n this.addAtLastIndexOfCallStack(\n () => {\n nodeElement.rightChild.parent = oldRightChildParentValue\n }\n );\n }\n\n node.addFirst(nodeElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddFirst.bind(this, node)\n );\n\n let parentElement = leftSibling.popLast();\n this.addAtLastIndexOfCallStack(\n this.undoPopLast.bind(this, parentElement, leftSibling)\n );\n\n let parentElementLeftChildOldValue = parentElement.leftChild;\n parentElement.leftChild = leftSibling;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.leftChild = parentElementLeftChildOldValue;\n }\n );\n\n let parentElementRightChildOldValue = parentElement.rightChild;\n parentElement.rightChild = node;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.rightChild = parentElementRightChildOldValue\n }\n );\n\n node.parent.addAt(parentPos, parentElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddAt.bind(this, node.parent, parentPos)\n );\n }","function eat(subvalue) {\n var indent = getOffset();\n var pos = position();\n var current = now();\n\n validateEat(subvalue);\n\n apply.reset = reset;\n reset.test = test;\n apply.test = test;\n\n value = value.substring(subvalue.length);\n\n updatePosition(subvalue);\n\n indent = indent();\n\n return apply;\n\n /* Add the given arguments, add `position` to\n * the returned node, and return the node. */\n function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }\n\n /* Functions just like apply, but resets the\n * content: the line and column are reversed,\n * and the eaten value is re-added.\n * This is useful for nodes with a single\n * type of content, such as lists and tables.\n * See `apply` above for what parameters are\n * expected. */\n function reset() {\n var node = apply.apply(null, arguments);\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return node;\n }\n\n /* Test the position, after eating, and reverse\n * to a not-eaten state. */\n function test() {\n var result = pos({});\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return result.position;\n }\n }","function eat(subvalue) {\n var indent = getOffset();\n var pos = position();\n var current = now();\n\n validateEat(subvalue);\n\n apply.reset = reset;\n reset.test = test;\n apply.test = test;\n\n value = value.substring(subvalue.length);\n\n updatePosition(subvalue);\n\n indent = indent();\n\n return apply;\n\n /* Add the given arguments, add `position` to\n * the returned node, and return the node. */\n function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }\n\n /* Functions just like apply, but resets the\n * content: the line and column are reversed,\n * and the eaten value is re-added.\n * This is useful for nodes with a single\n * type of content, such as lists and tables.\n * See `apply` above for what parameters are\n * expected. */\n function reset() {\n var node = apply.apply(null, arguments);\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return node;\n }\n\n /* Test the position, after eating, and reverse\n * to a not-eaten state. */\n function test() {\n var result = pos({});\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return result.position;\n }\n }","function eat(subvalue) {\n var indent = getOffset();\n var pos = position();\n var current = now();\n\n validateEat(subvalue);\n\n apply.reset = reset;\n reset.test = test;\n apply.test = test;\n\n value = value.substring(subvalue.length);\n\n updatePosition(subvalue);\n\n indent = indent();\n\n return apply;\n\n /* Add the given arguments, add `position` to\n * the returned node, and return the node. */\n function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }\n\n /* Functions just like apply, but resets the\n * content: the line and column are reversed,\n * and the eaten value is re-added.\n * This is useful for nodes with a single\n * type of content, such as lists and tables.\n * See `apply` above for what parameters are\n * expected. */\n function reset() {\n var node = apply.apply(null, arguments);\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return node;\n }\n\n /* Test the position, after eating, and reverse\n * to a not-eaten state. */\n function test() {\n var result = pos({});\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return result.position;\n }\n }","function eat(subvalue) {\n var indent = getOffset();\n var pos = position();\n var current = now();\n\n validateEat(subvalue);\n\n apply.reset = reset;\n reset.test = test;\n apply.test = test;\n\n value = value.substring(subvalue.length);\n\n updatePosition(subvalue);\n\n indent = indent();\n\n return apply;\n\n /* Add the given arguments, add `position` to\n * the returned node, and return the node. */\n function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }\n\n /* Functions just like apply, but resets the\n * content: the line and column are reversed,\n * and the eaten value is re-added.\n * This is useful for nodes with a single\n * type of content, such as lists and tables.\n * See `apply` above for what parameters are\n * expected. */\n function reset() {\n var node = apply.apply(null, arguments);\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return node;\n }\n\n /* Test the position, after eating, and reverse\n * to a not-eaten state. */\n function test() {\n var result = pos({});\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return result.position;\n }\n }","function eat(subvalue) {\n var indent = getOffset();\n var pos = position();\n var current = now();\n\n validateEat(subvalue);\n\n apply.reset = reset;\n reset.test = test;\n apply.test = test;\n\n value = value.substring(subvalue.length);\n\n updatePosition(subvalue);\n\n indent = indent();\n\n return apply;\n\n /* Add the given arguments, add `position` to\n * the returned node, and return the node. */\n function apply(node, parent) {\n return pos(add(pos(node), parent), indent);\n }\n\n /* Functions just like apply, but resets the\n * content: the line and column are reversed,\n * and the eaten value is re-added.\n * This is useful for nodes with a single\n * type of content, such as lists and tables.\n * See `apply` above for what parameters are\n * expected. */\n function reset() {\n var node = apply.apply(null, arguments);\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return node;\n }\n\n /* Test the position, after eating, and reverse\n * to a not-eaten state. */\n function test() {\n var result = pos({});\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return result.position;\n }\n }","function flip(board, row, col) {\n const index = rowColToIndex(board, row, col);\n let boardCopy = [...board];\n if (boardCopy[index] === \"X\") {\n boardCopy = setBoardCell(boardCopy, \"O\", row, col);\n return boardCopy;\n }\n else if (boardCopy[index] === \"O\") {\n boardCopy = setBoardCell(boardCopy, \"X\", row, col);\n return boardCopy;\n }\n else {\n return boardCopy;\n }\n}","function revert(h, node) {\n var subtype = node.referenceType\n var suffix = ']'\n var contents\n var head\n var tail\n\n if (subtype === 'collapsed') {\n suffix += '[]'\n } else if (subtype === 'full') {\n suffix += '[' + (node.label || node.identifier) + ']'\n }\n\n if (node.type === 'imageReference') {\n return u('text', '![' + node.alt + suffix)\n }\n\n contents = all(h, node)\n head = contents[0]\n\n if (head && head.type === 'text') {\n head.value = '[' + head.value\n } else {\n contents.unshift(u('text', '['))\n }\n\n tail = contents[contents.length - 1]\n\n if (tail && tail.type === 'text') {\n tail.value += suffix\n } else {\n contents.push(u('text', suffix))\n }\n\n return contents\n}","function testTree_TableAccess_CrossColumnIndex_Reverse() {\n var treeBefore =\n 'project()\\n' +\n '-order_by(DummyTable.string DESC, DummyTable.number DESC)\\n' +\n '--select(value_pred(DummyTable.boolean eq false))\\n' +\n '---table_access(DummyTable)\\n';\n\n var treeAfter =\n 'project()\\n' +\n '-select(value_pred(DummyTable.boolean eq false))\\n' +\n '--table_access_by_row_id(DummyTable)\\n' +\n '---index_range_scan(DummyTable.pkDummyTable, ' +\n '[unbound, unbound],[unbound, unbound], reverse)\\n';\n\n var rootNodeBefore = constructTree2(lf.Order.DESC, lf.Order.DESC);\n assertEquals(treeBefore, lf.tree.toString(rootNodeBefore));\n\n var pass = new lf.proc.OrderByIndexPass(hr.db.getGlobal());\n var rootNodeAfter = pass.rewrite(rootNodeBefore);\n assertEquals(treeAfter, lf.tree.toString(rootNodeAfter));\n}","function undo(){\n _.last(lines).remove();\n lines.pop();\n}","setNodeColumn() {\n const node = this;\n if (!defined(node.options.column)) {\n // No links to this node, place it left\n if (node.linksTo.length === 0) {\n node.column = 0;\n }\n else {\n node.column = node.getFromNode().fromColumn + 1;\n }\n }\n }","function mirrorVertical(originalFunction){\n return function(parameter){\n var point = originalFunction(parameter);\n point[1] = -point[1];\n return point;\n }\n}","restoreOriginalState() {\n\n\t\tconst originalValueOffset = this.valueSize * 3;\n\t\tthis.binding.setValue( this.buffer, originalValueOffset );\n\n\t}","function defaultTransform_(data, row, column, options) {\r\n if (!data[row][column]) {\r\n if (row < 2 || hasOption_(options, \"noInherit\")) {\r\n data[row][column] = \"\";\r\n } else {\r\n data[row][column] = data[row-1][column];\r\n }\r\n }\r\n\r\n if (!hasOption_(options, \"rawHeaders\") && row == 0) {\r\n if (column == 0 && data[row].length > 1) {\r\n removeCommonPrefixes_(data, row);\r\n }\r\n\r\n data[row][column] = toTitleCase_(data[row][column].toString().replace(/[\\/\\_]/g, \" \"));\r\n }\r\n\r\n if (!hasOption_(options, \"noTruncate\") && data[row][column]) {\r\n data[row][column] = data[row][column].toString().substr(0, 256);\r\n }\r\n\r\n if (hasOption_(options, \"debugLocation\")) {\r\n data[row][column] = \"[\" + row + \",\" + column + \"]\" + data[row][column];\r\n }\r\n}","@action eventBinder() {\n var that = this;\n\n that.startPos = 0;\n that.endPos = 0;\n that.selection = '';\n that.lastchar = '\\n';\n that.previousValue = that.value;\n\n that.clearUndo();\n }","function changeLine(doc, handle, changeType, op) {\n var no = handle,\n line = handle;\n\n if (typeof handle == \"number\") {\n line = getLine(doc, clipLine(doc, handle));\n } else {\n no = lineNo(handle);\n }\n\n if (no == null) {\n return null;\n }\n\n if (op(line, no) && doc.cm) {\n regLineChange(doc.cm, no, changeType);\n }\n\n return line;\n } // The document is represented as a BTree consisting of leaves, with","invert() {\r\n this.data = this.data.map(rows => rows.map(cols => cols*-1));\r\n }","function getCursor($node, offset) {\n\t\t\t\t$nodeTd = $node.parent();\n \t\t\tvar oldLine, newLine;\n\t\t\t\tif (!$nodeTd.hasClass(\"old\") && !$nodeTd.hasClass(\"new\") \n\t\t\t\t\t\t|| $nodeTd.hasClass(\"old\") && $nodeTd.hasClass(\"new\")) {\n\t\t\t\t\toldLine = $nodeTd.data(\"old\") + 1;\n\t\t\t\t\tnewLine = $nodeTd.data(\"new\") + 1;\n\t\t\t\t} else if ($nodeTd.hasClass(\"old\")) {\n\t\t\t\t\toldLine = $nodeTd.data(\"old\") + 1;\n\t\t\t\t} else {\n\t\t\t\t\tnewLine = $nodeTd.data(\"new\") + 1;\n\t\t\t\t}\n\t\t\t\tvar $contents = $nodeTd.contents();\n\t\t\t\tvar oldOffset = 0, newOffset = 0;\n \t\t\tfor (var i=0; i<$contents.length; i++) {\n \t\t\t\tvar $content = $($contents[i]);\n \t\t\t\tif ($content.is($node)) {\n \t\t\t\t\tif ($content.hasClass(\"delete\")) { \n \t\t\t\t\t\toldCh = oldOffset + offset;\n \t\t\t\t\t\tnewCh = undefined;\n \t\t\t\t\t\tnewLine = undefined;\n \t\t\t\t\t} else if ($content.hasClass(\"insert\")) {\n \t\t\t\t\t\toldCh = undefined;\n \t\t\t\t\t\toldLine = undefined;\n \t\t\t\t\t\tnewCh = newOffset + offset;\n \t\t\t\t\t} else {\n \t\t\t\t\t\toldCh = oldOffset + offset;\n \t\t\t\t\t\tnewCh = newOffset + offset;\n \t\t\t\t\t}\n \t\t\t\t\tbreak;\n \t\t\t\t} else {\n \t\t\t\t\tvar len = $content.text().length;\n \t\t\t\t\tif ($content.hasClass(\"delete\")) {\n \t\t\t\t\t\toldOffset += len;\n \t\t\t\t\t} else if ($content.hasClass(\"insert\")) {\n \t\t\t\t\t\tnewOffset += len;\n \t\t\t\t\t} else {\n\t \t\t\t\t\toldOffset += len;\n\t \t\t\t\t\tnewOffset += len;\n \t\t\t\t\t}\n \t\t\t\t}\n \t\t\t}\n \t\t\tif ($nodeTd.hasClass(\"left\")) {\n \t\t\t\tnewLine = newCh = undefined;\n \t\t\t} else if ($nodeTd.hasClass(\"right\")) {\n \t\t\t\toldLine = oldCh = undefined;\n \t\t\t}\n\t\t\t\treturn {\n\t\t\t\t\toldLine: oldLine,\n\t\t\t\t\toldCh: oldCh,\n\t\t\t\t\tnewLine: newLine,\n\t\t\t\t\tnewCh: newCh\n\t\t\t\t};\n \t\t}","function modifyClearCells(arg, row, column) {\r\n\tvar i = arg.emptyCells.indexOf(String(row) + String(column));\r\n\targ.emptyCells.splice(i, 1);\r\n}","function flipRe(idx) {return {row: Math.floor(idx/numRows), ele: idx%numRows}}","function moveRight() {\n\t\tfor (var row = 0; row < Rows; row++) {\n\t\t\tarrayCol = new Array(Cols);\n\t\t\tfor (var col = 0; col < Cols; col++) {\n\t\t\t\tarrayCol[col] = matrix[row][Cols - 1 - col];\n\t\t\t}\n\t\t\tmatrix[row] = newArray(arrayCol).reverse();\n\t\t}\n\n\t\tdraw();\n\t}","function clearCell(x,y){}","function undo() {\n updateFormula(function(text) {\n return text.slice(0, -1);\n });\n }","originalValue(columnIndex, rowIndex, value = null) {\n var cell = this.getCellElementAt(columnIndex, rowIndex);\n if (latte._undef(value))\n return cell.data('original-value');\n cell.data('original-value', value);\n return this;\n }","propagateDownFromLeft(node, parentPos, leftSibling) {\n let parentElement = node.parent.popAt(parentPos);\n this.addAtLastIndexOfCallStack(\n this.undoPopAt.bind(this, parentElement, node.parent, parentPos)\n );\n if (node.parent.hasRightChildAt(parentPos - 1)) {\n let nodeParentAtRightChildOldValue = node.parent.at(parentPos - 1).rightChild;\n node.parent.at(parentPos - 1).rightChild = node;\n this.addAtLastIndexOfCallStack(\n () => {\n node.parent.at(parentPos - 1).rightChild = nodeParentAtRightChildOldValue;\n }\n );\n }\n let parentElementLeftChildOldValue = parentElement.leftChild;\n parentElement.leftChild = null;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.leftChild = parentElementLeftChildOldValue;\n }\n )\n\n let parentElementRightChildOldValue = parentElement.rightChild;\n parentElement.rightChild = node.hasLeftmostChild() ? node.getLeftmostChild() : this.recentNode;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.rightChild = parentElementRightChildOldValue;\n }\n )\n\n node.addFirst(parentElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddFirst.bind(this, node)\n );\n\n let nodeIsLeafOldValue = node.isLeaf;\n node.isLeaf = node.isLeaf && leftSibling.isLeaf;\n this.addAtLastIndexOfCallStack(\n () => {\n node.isLeaf = nodeIsLeafOldValue;\n }\n );\n\n this.mergeToRight(leftSibling, node);\n if (node.parent === this.root && this.root.size() === 0) {\n let rootOldValue = this.root;\n this.root = node;\n this.addAtLastIndexOfCallStack(\n () => {\n this.root = rootOldValue;\n }\n );\n\n let nodeParentOldValue = node.parent;\n node.parent = null;\n this.addAtLastIndexOfCallStack(\n () => {\n node.parent = nodeParentOldValue;\n }\n )\n }\n }","function R(e,t,a){if(void 0===a&&(a=null),!(this instanceof R))return new R(e,t,a);this.line=e,this.ch=t,this.sticky=a}","propagateDownFromRight(node, parentPos, rightSibling) {\n let parentElement = node.parent.popAt(parentPos);\n this.addAtLastIndexOfCallStack(\n this.undoPopAt.bind(this, parentElement, node.parent, parentPos)\n );\n\n if (node.parent.hasLeftChildAt(parentPos)) {\n let nodeParentAtLeftChildOldValue = node.parent.at(parentPos).leftChild;\n node.parent.at(parentPos).leftChild = node;\n this.addAtLastIndexOfCallStack(\n () => {\n node.parent.at(parentPos).leftChild = nodeParentAtLeftChildOldValue;\n }\n )\n }\n\n let parentElementLeftChildOldValue = parentElement.leftChild;\n parentElement.leftChild = node.hasRightmostChild() ? node.getRightmostChild() : this.recentNode;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.leftChild = parentElementLeftChildOldValue;\n }\n );\n\n let parentElementRightChildOldValue = parentElement.rightChild;\n parentElement.rightChild = null;\n this.addAtLastIndexOfCallStack(\n () => {\n parentElement.rightChild = parentElementRightChildOldValue;\n }\n );\n\n node.addLast(parentElement);\n this.addAtLastIndexOfCallStack(\n this.undoAddLast.bind(this, node)\n );\n\n let nodeIsLeafOldValue = node.isLeaf;\n node.isLeaf = node.isLeaf && rightSibling.isLeaf;\n this.addAtLastIndexOfCallStack(\n () => {\n node.isLeaf = nodeIsLeafOldValue;\n }\n );\n\n this.mergeToLeft(node, rightSibling);\n\n\n if (node.parent === this.root && this.root.size() === 0) {\n let rootOldValue = this.root;\n this.root = node;\n this.addAtLastIndexOfCallStack(\n () => {\n this.root = rootOldValue;\n }\n )\n\n let nodeParentOldValue = node.parent;\n node.parent = null;\n this.addAtLastIndexOfCallStack(\n () => {\n node.parent = nodeParentOldValue;\n }\n );\n }\n }","clear() {\n if (this.buffer.ybase === 0 && this.buffer.y === 0) {\n // Don't clear if it's already clear\n return;\n }\n this.buffer.lines.set(0, this.buffer.lines.get(this.buffer.ybase + this.buffer.y));\n this.buffer.lines.length = 1;\n this.buffer.ydisp = 0;\n this.buffer.ybase = 0;\n this.buffer.y = 0;\n for (let i = 1; i < this.rows; i++) {\n this.buffer.lines.push(this.buffer.getBlankLine(DEFAULT_ATTR_DATA));\n }\n this.refresh(0, this.rows - 1);\n this._onScroll.fire(this.buffer.ydisp);\n }","undoPos()\n {\n this.dot.undoPos();\n }","function reverseMutate() {\n let newOnes = ones.slice().reverse();\n console.log(ones);\n console.log(newOnes);\n }","function removePosition(node, force) {\n visit(node, force ? hard : soft)\n return node\n}","function removePosition(node, force) {\n visit(node, force ? hard : soft)\n return node\n}","function removePosition(node, force) {\n visit(node, force ? hard : soft)\n return node\n}","set(row, column, value) {\n const n = this._width * row + column;\n this._elements[n] = value;\n return this;\n }","function SpreadFromLeft(tree) {\n\n return Spread(+tree.getAttribute(\"data-x\") - 1,\n +tree.getAttribute(\"data-y\"));\n\n}","trimEmptyLines () {\n this.trimEmptyLinesAtBeginning()\n\n this.lines.reverse()\n this.trimEmptyLinesAtBeginning()\n this.lines.reverse()\n }","function rewriteXY(newMatrix,rewX rewY, rewValue) {\n\t\tvar zwischenSpeicher = newMatrix[rewX];\n\t\tzwischenSpeicher[rewY] = rewValue;\n\t\tnewMatrix[rewX] = zwischenSpeicher;\n\t\treturn newMatrix;\t\n\t}","function borrarRow2(e) {\n // console.log(e);\n e.target.parentNode.parentNode.removeChild(e.target.parentNode);\n document.querySelector('textarea').value = ej;\n}","clearEol() {\n const {cursor, bg_color, size, font_attr} = this.proxy\n const {line, col} = cursor\n const clear_length = (size.cols - col) * font_attr.font_width\n log.debug(`Clear until EOL: ${line}:${col} length=${clear_length}`)\n this.drawBlock(line, col, 1, clear_length, bg_color)\n this.lines.clearEol(line, col)\n }","function relaxRightToLeft(columns, alpha, beta) {\n for (var n = columns.length, i = n - 2; i >= 0; --i) {\n var column = columns[i];\n for (var _i = 0, column_2 = column; _i < column_2.length; _i++) {\n var source = column_2[_i];\n var y = 0;\n var w = 0;\n for (var _a = 0, _b = source.sourceLinks; _a < _b.length; _a++) {\n var _c = _b[_a], target = _c.target, value_2 = _c.value;\n var v = value_2 * (target.layer - source.layer);\n y += sourceTop(source, target) * v;\n w += v;\n }\n if (!(w > 0))\n continue;\n var dy_2 = (y / w - source.y0) * alpha;\n source.y0 += dy_2;\n source.y1 += dy_2;\n reorderNodeLinks(source);\n }\n if (sort === undefined)\n column.sort(ascendingBreadth);\n if (column.length)\n resolveCollisions(column, beta);\n }\n }","function columnize($putInHere, $pullOutHere, $parentColumn, height){\n while($parentColumn.height() < height &&\n $pullOutHere[0].childNodes.length){\n $putInHere.append($pullOutHere[0].childNodes[0]);\n }\n if($putInHere[0].childNodes.length == 0) return;\n\n // now we're too tall, undo the last one\n var kids = $putInHere[0].childNodes;\n var lastKid = kids[kids.length-1];\n $putInHere[0].removeChild(lastKid);\n var $item = jQuery(lastKid);\n\n\n if($item[0].nodeType == 3){\n // it's a text node, split it up\n var oText = $item[0].nodeValue;\n var counter2 = options.width / 18;\n if(options.accuracy)\n counter2 = options.accuracy;\n var columnText;\n var latestTextNode = null;\n while($parentColumn.height() < height && oText.length){\n if (oText.indexOf(' ', counter2) != '-1') {\n columnText = oText.substring(0, oText.indexOf(' ', counter2));\n } else {\n columnText = oText;\n }\n latestTextNode = document.createTextNode(columnText);\n $putInHere.append(latestTextNode);\n\n if(oText.length > counter2){\n oText = oText.substring(oText.indexOf(' ', counter2));\n }else{\n oText = \"\";\n }\n }\n if($parentColumn.height() >= height && latestTextNode != null){\n // too tall :(\n $putInHere[0].removeChild(latestTextNode);\n oText = latestTextNode.nodeValue + oText;\n }\n if(oText.length){\n $item[0].nodeValue = oText;\n }else{\n return false; // we ate the whole text node, move on to the next node\n }\n }\n\n if($pullOutHere.children().length){\n $pullOutHere.prepend($item);\n }else{\n $pullOutHere.append($item);\n }\n\n return $item[0].nodeType == 3;\n }","function operate() {\n var matrix = this.matrix,\n dataProvider = this.dataProvider;\n matrix.cellReferences.length = 0;\n (0, _array.arrayEach)(matrix.data, function (cell) {\n cell.setState(_value.default.STATE_OUT_OFF_DATE);\n cell.clearPrecedents();\n var row = cell.row,\n column = cell.column;\n var value = dataProvider.getSourceDataAtCell(row, column);\n\n if ((0, _utils.isFormulaExpression)(value)) {\n var prevRow = visualRows.get(cell);\n var expModifier = new _expressionModifier.default(value);\n expModifier.translate({\n row: dataProvider.t.toVisualRow(row) - prevRow\n });\n dataProvider.updateSourceData(row, column, expModifier.toString());\n }\n });\n visualRows = null;\n}","function removePosition(node, force) {\n visit(node, force ? hard : soft);\n return node;\n}","function toggleleft () {\n\n // grab the current column1 column and save it!\n old_column1 = document.getElementById(\"hello-world-column1\").innerHTML;\n\n // replace the screen contents of column1 column with new_text\n document.getElementById(\"hello-world-column1\").innerHTML = new_column1;\n\n\n console.log(\"-- updated by click --\");\n console.log(\"new_column1: \" + new_column1);\n console.log(\"old_column1: \" + old_column1);\n console.log(\"----------------------\\n\\n\\n\");\n\n // this allows the \"toggle\" - we swap the old for the new!\n new_column1 = old_column1;\n\n console.log(\"-- updated by \\\"toggle\\\" --\");\n console.log(\"new_column1: \" + new_column1);\n console.log(\"old_column1: \" + old_column1);\n console.log(\"*** NOTE: new_column1 == old_column1 now! ***\");\n console.log(\"-------------------------\\n\\n\\n\");\n }","function consume() {\n // Line ending; assumes CR is not used (remark removes those).\n if (value.charCodeAt(index) === lineFeed) {\n place.line++\n place.column = 1\n }\n // Anything else.\n else {\n place.column++\n }\n\n index++\n\n place.offset++\n place.index = index\n }","function undoMove(board, move) {\n board[move] = ' ';\n}","function mirrorHorizontal(originalFunction){\n return function(parameter){\n var point = originalFunction(parameter);\n point[0] = -point[0];\n return point;\n }\n}","pop()\n\t{\n\t\tthis.rows.pop();\n\t\t// Update the column count\n\t\tthis.width = this.rows.reduce(\n\t\t\t(width, row) => Math.max(row.type == 'full' ? 1 : row.data.length, width),\n\t\t\t0\n\t\t);\n\t}","function colRev(col, rev){\n\tanimateCollapse(col);\n\tsetTimeout(animateReveal(rev), 1500);\n}","function helper(change){\n let [row, col] = change\n for(let i = 0; i < matrix.length; i+=1){\n matrix[i][col] = 0\n }\n for(let j = 0; j < matrix[0].length; j+=1){\n matrix[row][j] = 0\n }\n }","shiftLeft() {\n for (let line of this.cells) {\n for (let i = 0; i < line.length - 1; i++) {\n line[i].setType(line[i + 1].type);\n }\n line[line.length - 1].setType(BeadType.default);\n }\n }","function resetRowContents()\r\n\t{\r\n\r\n\t\tvar theCell;\r\n\t\tvar thisRow;\r\n\r\n\t\tif ( editingRow !== -1 )\r\n\t\t{\r\n\t\t\t// get a reference to the Cell selected\r\n\t\t\ttheCell = document.getElementById('cell' + editingRow);\r\n\r\n\t\t\tthisRow = class_myRows[editingRow];\r\n\r\n\t\t\t// re-create the cell as it was before\r\n\t\t\tif ( thisRow.link.length > 0 )\r\n\t\t\t{\r\n\t\t\t\ttheCell.innerHTML= \"<A href=\\\"\" + thisRow.link + getOptionalParams( thisRow ) + \"\\\">\" + thisRow.name + \"</a> \" + fn_MenuStr( '', '', thisRow.dataId, '', imgSrc, LocString( 'Functions' ), '' ) + thisRow.modifiedImgs;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttheCell.innerHTML= \" \" + thisRow.name + fn_MenuStr( '', '', thisRow.dataId, '', imgSrc, LocString( 'Functions' ), '' ) + thisRow.modifiedImgs;\r\n\t\t\t}\r\n\t\t\teditingRow = -1;\r\n\t\t\tkillPopup();\r\n\t\t}\r\n\t}","function flipCell(y, x) {\n if (x >= 0 && x < ncols && y >= 0 && y < nrows) {\n board[y][x] = !board[y][x];\n }\n }","function r(e,t,n,r,o){this.children=[],this.sourceContents={},this.line=null==e?null:e,this.column=null==t?null:t,this.source=null==n?null:n,this.name=null==o?null:o,null!=r&&this.add(r)}","function break_up_node(read_node, $write_context) {\n \n // check type to determine how to break it\n if (read_node.nodeType == Node.TEXT_NODE) {\n \n // text nodes get chopped up by words\n $write_context = write_text_to_column($(read_node), $write_context);\n \n } else {\n \n // put an empty clone of it in the column (the same one the whole didn't fit into)\n // and trigger the recursion.\n var $write_sub_context = $(read_node).clone().empty().appendTo($write_context);\n $write_context = walk_read_nodes($(read_node), $write_sub_context);\n }\n return $write_context;\n }","function SpreadFromRight(tree) {\n\n return Spread(+tree.getAttribute(\"data-x\") + 1,\n +tree.getAttribute(\"data-y\"));\n\n}","restorePos(_x, _y)\n {\n this.x = _x;\n this.y = _y;\n }","_undo() {\n for (const [k, v] of Object.entries(this._undos)) {\n if (v) {\n\tthis._cells[k] = v;\n }\n else {\n\tdelete this._cells[k];\n }\n }\n }","revert() { }","Rewind() {}","undo() {\n if (this.canUndo()) {\n this.shouldSaveHistory = false;\n const { index, state } = this.stack[(this.position -= 1)];\n this.onUpdate();\n\n this.editor.blocks.render({ blocks: state }).then(() => this.editor.caret.setToBlock(index, \"end\"));\n }\n }","restoreValue() {\n this.textInputNode.value = this.originalValue;\n }","function reverseRowsAndColumns(matrix) {\n let transformedMx = [];\n matrix.map((row) => {\n row.map((val, cIndex) => {\n if (!transformedMx[cIndex]) transformedMx.push([]);\n transformedMx[cIndex].push(val);\n});\n});\n return transformedMx;\n}","function redips_column(std){\n\tvar nrows = std.hall.nrows;\n\treturn nrows - 1 - (std.hall_position.charCodeAt(0) - 65); // 'A' is 65, 'B' is 66, .. Vertical offset -1\n}","function backspace() {\n if (calcVals.cur.length > 0) {\n calcVals.cur = calcVals.cur.substring(0, calcVals.cur.length - 1);\n }\n if (calcVals.cur.length === 0) {\n calcVals.cur = \"0\";\n }\n calcVals.prevAttr = \"filler\";\n}","function _overwrite(args, t) {\n var previous = _stack[_index].graph;\n if (_index > 0) {\n _index--;\n _stack.pop();\n }\n _stack = _stack.slice(0, _index + 1);\n var actionResult = _act(args, t);\n _stack.push(actionResult);\n _index++;\n return change(previous);\n }","function changeLine(doc, handle, changeType, op) {\n\t\t var no = handle, line = handle;\n\t\t if (typeof handle == \"number\") { line = getLine(doc, clipLine(doc, handle)); }\n\t\t else { no = lineNo(handle); }\n\t\t if (no == null) { return null }\n\t\t if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\n\t\t return line\n\t\t }","rotate() {\n const newCells = []\n for (let i = 0; i < this.cells.length; i++) {\n newCells[i] = []\n for (let j = 0; j < this.cells.length; j++) {\n newCells[i][j] = this.cells[this.cells.length - 1 - j][i]\n }\n }\n this.cells = newCells\n }","function changeLine(doc, handle, changeType, op) {\n var no = handle, line = handle;\n if (typeof handle == \"number\") { line = getLine(doc, clipLine(doc, handle)); }\n else { no = lineNo(handle); }\n if (no == null) { return null }\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\n return line\n }","function changeLine(doc, handle, changeType, op) {\n var no = handle, line = handle;\n if (typeof handle == \"number\") { line = getLine(doc, clipLine(doc, handle)); }\n else { no = lineNo(handle); }\n if (no == null) { return null }\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\n return line\n }","function changeLine(doc, handle, changeType, op) {\n var no = handle, line = handle;\n if (typeof handle == \"number\") { line = getLine(doc, clipLine(doc, handle)); }\n else { no = lineNo(handle); }\n if (no == null) { return null }\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\n return line\n }","function changeLine(doc, handle, changeType, op) {\n var no = handle, line = handle;\n if (typeof handle == \"number\") { line = getLine(doc, clipLine(doc, handle)); }\n else { no = lineNo(handle); }\n if (no == null) { return null }\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\n return line\n }","function changeLine(doc, handle, changeType, op) {\n var no = handle, line = handle;\n if (typeof handle == \"number\") { line = getLine(doc, clipLine(doc, handle)); }\n else { no = lineNo(handle); }\n if (no == null) { return null }\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\n return line\n }","function changeLine(doc, handle, changeType, op) {\n var no = handle, line = handle;\n if (typeof handle == \"number\") { line = getLine(doc, clipLine(doc, handle)); }\n else { no = lineNo(handle); }\n if (no == null) { return null }\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\n return line\n }","function changeLine(doc, handle, changeType, op) {\n var no = handle, line = handle;\n if (typeof handle == \"number\") { line = getLine(doc, clipLine(doc, handle)); }\n else { no = lineNo(handle); }\n if (no == null) { return null }\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\n return line\n }"],"string":"[\n \"function reset() {\\n var node = apply.apply(null, arguments)\\n\\n line = current.line\\n column = current.column\\n value = subvalue + value\\n\\n return node\\n }\",\n \"_reset(line, column) {\\n this.tagName = '';\\n this.attributes = [];\\n this.endTag = false;\\n this.endSlash = false;\\n this.line = line;\\n this.column = column;\\n }\",\n \"shiftRight() {\\n for (let line of this.cells) {\\n for (let i = line.length - 1; i > 0; i--) {\\n line[i].setType(line[i - 1].type);\\n }\\n line[0].setType(BeadType.default);\\n }\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function(node){\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function position() {\\n\\t var start = { line: lineno, column: column };\\n\\t return function(node){\\n\\t node.position = new Position(start);\\n\\t whitespace();\\n\\t return node;\\n\\t };\\n\\t }\",\n \"reverseIndex() {\\n this._restrictCursor();\\n const buffer = this._bufferService.buffer;\\n if (buffer.y === buffer.scrollTop) {\\n // possibly move the code below to term.reverseScroll();\\n // test: echo -ne '\\\\e[1;1H\\\\e[44m\\\\eM\\\\e[0m'\\n // blankLine(true) is xterm/linux behavior\\n const scrollRegionHeight = buffer.scrollBottom - buffer.scrollTop;\\n buffer.lines.shiftElements(buffer.ybase + buffer.y, scrollRegionHeight, 1);\\n buffer.lines.set(buffer.ybase + buffer.y, buffer.getBlankLine(this._eraseAttrData()));\\n this._dirtyRowService.markRangeDirty(buffer.scrollTop, buffer.scrollBottom);\\n }\\n else {\\n buffer.y--;\\n this._restrictCursor(); // quickfix to not run out of bounds\\n }\\n return true;\\n }\",\n \"restoreValueAt(columnIndex, rowIndex) {\\n if (!this.hasCellAt(columnIndex, rowIndex))\\n return;\\n var cell = this.getCellElementAt(columnIndex, rowIndex);\\n if (!latte._undef(cell.data('original-value'))) {\\n this.setValueAt(columnIndex, rowIndex, cell.data('original-value'));\\n cell.removeData('original-value');\\n }\\n }\",\n \"function position() {\\n var start = {line: lineno, column: column}\\n return function(node) {\\n node.position = new Position(start)\\n whitespace()\\n return node\\n }\\n }\",\n \"function position() {\\n const start = {\\n line: lineno,\\n column\\n };\\n return function (node) {\\n node.position = new Position(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"function eat(subvalue) {\\n var indent = getOffset()\\n var pos = position()\\n var current = now()\\n\\n validateEat(subvalue)\\n\\n apply.reset = reset\\n reset.test = test\\n apply.test = test\\n\\n value = value.slice(subvalue.length)\\n\\n updatePosition(subvalue)\\n\\n indent = indent()\\n\\n return apply\\n\\n // Add the given arguments, add `position` to the returned node, and\\n // return the node.\\n function apply(node, parent) {\\n return pos(add(pos(node), parent), indent)\\n }\\n\\n // Functions just like apply, but resets the content: the line and\\n // column are reversed, and the eaten value is re-added. This is\\n // useful for nodes with a single type of content, such as lists and\\n // tables. See `apply` above for what parameters are expected.\\n function reset() {\\n var node = apply.apply(null, arguments)\\n\\n line = current.line\\n column = current.column\\n value = subvalue + value\\n\\n return node\\n }\\n\\n // Test the position, after eating, and reverse to a not-eaten state.\\n function test() {\\n var result = pos({})\\n\\n line = current.line\\n column = current.column\\n value = subvalue + value\\n\\n return result.position\\n }\\n }\",\n \"function reverseLine(line){\\n \\n var tempX = line.x1;\\n var tempY = line.y1;\\n line.x1 = line.x2;\\n line.y1 = line.y2;\\n line.x2 = tempX;\\n line.y2 = tempY;\\n \\n return line;\\n}\",\n \"function decrementColumn() {\\n GameData.column = correctColumn(GameData.column--);\\n}\",\n \"function position() {\\n var start = { line: lineno, column: column };\\n return function (node) {\\n node.position = new ParsePosition(start);\\n whitespace();\\n return node;\\n };\\n }\",\n \"_reverseCols() {\\n this.forEach(arr => {\\n arr.reverse();\\n });\\n }\",\n \"restore() {\\n if(this.saved.caret)\\n this.set(this.saved.startNodeIndex, this.saved.startOffset);\\n else\\n this.set(this.saved.startNodeIndex, this.saved.startOffset,\\n this.saved.endNodeIndex, this.saved.endOffset);\\n }\",\n \"propagateFromRightSibling(node, parentPos, rightSibling) {\\n let nodeElement = node.parent.popAt(parentPos);\\n this.addAtLastIndexOfCallStack(\\n this.undoPopAt.bind(this, nodeElement, node.parent, parentPos)\\n );\\n\\n let nodeElementLeftChildOldValue = nodeElement.leftChild;\\n nodeElement.leftChild = node.hasRightmostChild() ? node.getRightmostChild() : this.recentNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n nodeElement.leftChild = nodeElementLeftChildOldValue;\\n }\\n );\\n\\n let nodeElementRightChildOldValue = nodeElement.rightChild;\\n nodeElement.rightChild = rightSibling.getLeftmostChild();\\n this.addAtLastIndexOfCallStack(\\n () => {\\n nodeElement.rightChild = nodeElementRightChildOldValue;\\n }\\n );\\n\\n if (nodeElement.hasLeftChild()) {\\n let nodeElementLeftChildParentOldValue = nodeElement.leftChild.parent;\\n nodeElement.leftChild.parent = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n nodeElement.leftChild.parent = nodeElementLeftChildParentOldValue;\\n }\\n );\\n }\\n\\n if (nodeElement.hasRightChild()) {\\n let nodeElementRightChildParent = nodeElement.rightChild.parent;\\n nodeElement.rightChild.parent = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n nodeElement.rightChild.parent = nodeElementRightChildParent;\\n }\\n );\\n }\\n\\n node.addLast(nodeElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddLast.bind(this, node)\\n );\\n\\n let parentElement = rightSibling.popFirst();\\n this.addAtLastIndexOfCallStack(\\n this.undoPopFirst.bind(this, parentElement, rightSibling)\\n );\\n\\n let parentElementLeftChildOldValue = parentElement.leftChild;\\n parentElement.leftChild = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.leftChild = parentElementLeftChildOldValue;\\n }\\n );\\n\\n let parentElementRightChildOldValue = parentElement.rightChild;\\n parentElement.rightChild = rightSibling;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.rightChild = parentElementRightChildOldValue;\\n }\\n );\\n\\n node.parent.addAt(parentPos, parentElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddAt.bind(this, node.parent, parentPos)\\n );\\n }\",\n \"propagateFromLeftSibling(node, parentPos, leftSibling) {\\n let nodeElement = node.parent.popAt(parentPos);\\n this.addAtLastIndexOfCallStack(\\n this.undoPopAt.bind(this, nodeElement, node.parent, parentPos)\\n );\\n\\n let oldLeftChildValue = nodeElement.leftChild;\\n nodeElement.leftChild = leftSibling.getRightmostChild();\\n this.addAtLastIndexOfCallStack(\\n () => {\\n nodeElement.leftChild = oldLeftChildValue;\\n }\\n );\\n\\n let oldRightChildValue = nodeElement.rightChild;\\n nodeElement.rightChild = node.hasLeftmostChild() ? node.getLeftmostChild() : this.recentNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n nodeElement.rightChild = oldRightChildValue;\\n }\\n );\\n\\n if (nodeElement.hasLeftChild()) {\\n let oldLeftChildParentValue = nodeElement.leftChild.parent;\\n nodeElement.leftChild.parent = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n nodeElement.leftChild.parent = oldLeftChildParentValue\\n }\\n );\\n }\\n\\n if (nodeElement.hasRightChild()) {\\n let oldRightChildParentValue = nodeElement.rightChild.parent;\\n nodeElement.rightChild.parent = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n nodeElement.rightChild.parent = oldRightChildParentValue\\n }\\n );\\n }\\n\\n node.addFirst(nodeElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddFirst.bind(this, node)\\n );\\n\\n let parentElement = leftSibling.popLast();\\n this.addAtLastIndexOfCallStack(\\n this.undoPopLast.bind(this, parentElement, leftSibling)\\n );\\n\\n let parentElementLeftChildOldValue = parentElement.leftChild;\\n parentElement.leftChild = leftSibling;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.leftChild = parentElementLeftChildOldValue;\\n }\\n );\\n\\n let parentElementRightChildOldValue = parentElement.rightChild;\\n parentElement.rightChild = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.rightChild = parentElementRightChildOldValue\\n }\\n );\\n\\n node.parent.addAt(parentPos, parentElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddAt.bind(this, node.parent, parentPos)\\n );\\n }\",\n \"function eat(subvalue) {\\n var indent = getOffset();\\n var pos = position();\\n var current = now();\\n\\n validateEat(subvalue);\\n\\n apply.reset = reset;\\n reset.test = test;\\n apply.test = test;\\n\\n value = value.substring(subvalue.length);\\n\\n updatePosition(subvalue);\\n\\n indent = indent();\\n\\n return apply;\\n\\n /* Add the given arguments, add `position` to\\n * the returned node, and return the node. */\\n function apply(node, parent) {\\n return pos(add(pos(node), parent), indent);\\n }\\n\\n /* Functions just like apply, but resets the\\n * content: the line and column are reversed,\\n * and the eaten value is re-added.\\n * This is useful for nodes with a single\\n * type of content, such as lists and tables.\\n * See `apply` above for what parameters are\\n * expected. */\\n function reset() {\\n var node = apply.apply(null, arguments);\\n\\n line = current.line;\\n column = current.column;\\n value = subvalue + value;\\n\\n return node;\\n }\\n\\n /* Test the position, after eating, and reverse\\n * to a not-eaten state. */\\n function test() {\\n var result = pos({});\\n\\n line = current.line;\\n column = current.column;\\n value = subvalue + value;\\n\\n return result.position;\\n }\\n }\",\n \"function eat(subvalue) {\\n var indent = getOffset();\\n var pos = position();\\n var current = now();\\n\\n validateEat(subvalue);\\n\\n apply.reset = reset;\\n reset.test = test;\\n apply.test = test;\\n\\n value = value.substring(subvalue.length);\\n\\n updatePosition(subvalue);\\n\\n indent = indent();\\n\\n return apply;\\n\\n /* Add the given arguments, add `position` to\\n * the returned node, and return the node. */\\n function apply(node, parent) {\\n return pos(add(pos(node), parent), indent);\\n }\\n\\n /* Functions just like apply, but resets the\\n * content: the line and column are reversed,\\n * and the eaten value is re-added.\\n * This is useful for nodes with a single\\n * type of content, such as lists and tables.\\n * See `apply` above for what parameters are\\n * expected. */\\n function reset() {\\n var node = apply.apply(null, arguments);\\n\\n line = current.line;\\n column = current.column;\\n value = subvalue + value;\\n\\n return node;\\n }\\n\\n /* Test the position, after eating, and reverse\\n * to a not-eaten state. */\\n function test() {\\n var result = pos({});\\n\\n line = current.line;\\n column = current.column;\\n value = subvalue + value;\\n\\n return result.position;\\n }\\n }\",\n \"function eat(subvalue) {\\n var indent = getOffset();\\n var pos = position();\\n var current = now();\\n\\n validateEat(subvalue);\\n\\n apply.reset = reset;\\n reset.test = test;\\n apply.test = test;\\n\\n value = value.substring(subvalue.length);\\n\\n updatePosition(subvalue);\\n\\n indent = indent();\\n\\n return apply;\\n\\n /* Add the given arguments, add `position` to\\n * the returned node, and return the node. */\\n function apply(node, parent) {\\n return pos(add(pos(node), parent), indent);\\n }\\n\\n /* Functions just like apply, but resets the\\n * content: the line and column are reversed,\\n * and the eaten value is re-added.\\n * This is useful for nodes with a single\\n * type of content, such as lists and tables.\\n * See `apply` above for what parameters are\\n * expected. */\\n function reset() {\\n var node = apply.apply(null, arguments);\\n\\n line = current.line;\\n column = current.column;\\n value = subvalue + value;\\n\\n return node;\\n }\\n\\n /* Test the position, after eating, and reverse\\n * to a not-eaten state. */\\n function test() {\\n var result = pos({});\\n\\n line = current.line;\\n column = current.column;\\n value = subvalue + value;\\n\\n return result.position;\\n }\\n }\",\n \"function eat(subvalue) {\\n var indent = getOffset();\\n var pos = position();\\n var current = now();\\n\\n validateEat(subvalue);\\n\\n apply.reset = reset;\\n reset.test = test;\\n apply.test = test;\\n\\n value = value.substring(subvalue.length);\\n\\n updatePosition(subvalue);\\n\\n indent = indent();\\n\\n return apply;\\n\\n /* Add the given arguments, add `position` to\\n * the returned node, and return the node. */\\n function apply(node, parent) {\\n return pos(add(pos(node), parent), indent);\\n }\\n\\n /* Functions just like apply, but resets the\\n * content: the line and column are reversed,\\n * and the eaten value is re-added.\\n * This is useful for nodes with a single\\n * type of content, such as lists and tables.\\n * See `apply` above for what parameters are\\n * expected. */\\n function reset() {\\n var node = apply.apply(null, arguments);\\n\\n line = current.line;\\n column = current.column;\\n value = subvalue + value;\\n\\n return node;\\n }\\n\\n /* Test the position, after eating, and reverse\\n * to a not-eaten state. */\\n function test() {\\n var result = pos({});\\n\\n line = current.line;\\n column = current.column;\\n value = subvalue + value;\\n\\n return result.position;\\n }\\n }\",\n \"function eat(subvalue) {\\n var indent = getOffset();\\n var pos = position();\\n var current = now();\\n\\n validateEat(subvalue);\\n\\n apply.reset = reset;\\n reset.test = test;\\n apply.test = test;\\n\\n value = value.substring(subvalue.length);\\n\\n updatePosition(subvalue);\\n\\n indent = indent();\\n\\n return apply;\\n\\n /* Add the given arguments, add `position` to\\n * the returned node, and return the node. */\\n function apply(node, parent) {\\n return pos(add(pos(node), parent), indent);\\n }\\n\\n /* Functions just like apply, but resets the\\n * content: the line and column are reversed,\\n * and the eaten value is re-added.\\n * This is useful for nodes with a single\\n * type of content, such as lists and tables.\\n * See `apply` above for what parameters are\\n * expected. */\\n function reset() {\\n var node = apply.apply(null, arguments);\\n\\n line = current.line;\\n column = current.column;\\n value = subvalue + value;\\n\\n return node;\\n }\\n\\n /* Test the position, after eating, and reverse\\n * to a not-eaten state. */\\n function test() {\\n var result = pos({});\\n\\n line = current.line;\\n column = current.column;\\n value = subvalue + value;\\n\\n return result.position;\\n }\\n }\",\n \"function flip(board, row, col) {\\n const index = rowColToIndex(board, row, col);\\n let boardCopy = [...board];\\n if (boardCopy[index] === \\\"X\\\") {\\n boardCopy = setBoardCell(boardCopy, \\\"O\\\", row, col);\\n return boardCopy;\\n }\\n else if (boardCopy[index] === \\\"O\\\") {\\n boardCopy = setBoardCell(boardCopy, \\\"X\\\", row, col);\\n return boardCopy;\\n }\\n else {\\n return boardCopy;\\n }\\n}\",\n \"function revert(h, node) {\\n var subtype = node.referenceType\\n var suffix = ']'\\n var contents\\n var head\\n var tail\\n\\n if (subtype === 'collapsed') {\\n suffix += '[]'\\n } else if (subtype === 'full') {\\n suffix += '[' + (node.label || node.identifier) + ']'\\n }\\n\\n if (node.type === 'imageReference') {\\n return u('text', '![' + node.alt + suffix)\\n }\\n\\n contents = all(h, node)\\n head = contents[0]\\n\\n if (head && head.type === 'text') {\\n head.value = '[' + head.value\\n } else {\\n contents.unshift(u('text', '['))\\n }\\n\\n tail = contents[contents.length - 1]\\n\\n if (tail && tail.type === 'text') {\\n tail.value += suffix\\n } else {\\n contents.push(u('text', suffix))\\n }\\n\\n return contents\\n}\",\n \"function testTree_TableAccess_CrossColumnIndex_Reverse() {\\n var treeBefore =\\n 'project()\\\\n' +\\n '-order_by(DummyTable.string DESC, DummyTable.number DESC)\\\\n' +\\n '--select(value_pred(DummyTable.boolean eq false))\\\\n' +\\n '---table_access(DummyTable)\\\\n';\\n\\n var treeAfter =\\n 'project()\\\\n' +\\n '-select(value_pred(DummyTable.boolean eq false))\\\\n' +\\n '--table_access_by_row_id(DummyTable)\\\\n' +\\n '---index_range_scan(DummyTable.pkDummyTable, ' +\\n '[unbound, unbound],[unbound, unbound], reverse)\\\\n';\\n\\n var rootNodeBefore = constructTree2(lf.Order.DESC, lf.Order.DESC);\\n assertEquals(treeBefore, lf.tree.toString(rootNodeBefore));\\n\\n var pass = new lf.proc.OrderByIndexPass(hr.db.getGlobal());\\n var rootNodeAfter = pass.rewrite(rootNodeBefore);\\n assertEquals(treeAfter, lf.tree.toString(rootNodeAfter));\\n}\",\n \"function undo(){\\n _.last(lines).remove();\\n lines.pop();\\n}\",\n \"setNodeColumn() {\\n const node = this;\\n if (!defined(node.options.column)) {\\n // No links to this node, place it left\\n if (node.linksTo.length === 0) {\\n node.column = 0;\\n }\\n else {\\n node.column = node.getFromNode().fromColumn + 1;\\n }\\n }\\n }\",\n \"function mirrorVertical(originalFunction){\\n return function(parameter){\\n var point = originalFunction(parameter);\\n point[1] = -point[1];\\n return point;\\n }\\n}\",\n \"restoreOriginalState() {\\n\\n\\t\\tconst originalValueOffset = this.valueSize * 3;\\n\\t\\tthis.binding.setValue( this.buffer, originalValueOffset );\\n\\n\\t}\",\n \"function defaultTransform_(data, row, column, options) {\\r\\n if (!data[row][column]) {\\r\\n if (row < 2 || hasOption_(options, \\\"noInherit\\\")) {\\r\\n data[row][column] = \\\"\\\";\\r\\n } else {\\r\\n data[row][column] = data[row-1][column];\\r\\n }\\r\\n }\\r\\n\\r\\n if (!hasOption_(options, \\\"rawHeaders\\\") && row == 0) {\\r\\n if (column == 0 && data[row].length > 1) {\\r\\n removeCommonPrefixes_(data, row);\\r\\n }\\r\\n\\r\\n data[row][column] = toTitleCase_(data[row][column].toString().replace(/[\\\\/\\\\_]/g, \\\" \\\"));\\r\\n }\\r\\n\\r\\n if (!hasOption_(options, \\\"noTruncate\\\") && data[row][column]) {\\r\\n data[row][column] = data[row][column].toString().substr(0, 256);\\r\\n }\\r\\n\\r\\n if (hasOption_(options, \\\"debugLocation\\\")) {\\r\\n data[row][column] = \\\"[\\\" + row + \\\",\\\" + column + \\\"]\\\" + data[row][column];\\r\\n }\\r\\n}\",\n \"@action eventBinder() {\\n var that = this;\\n\\n that.startPos = 0;\\n that.endPos = 0;\\n that.selection = '';\\n that.lastchar = '\\\\n';\\n that.previousValue = that.value;\\n\\n that.clearUndo();\\n }\",\n \"function changeLine(doc, handle, changeType, op) {\\n var no = handle,\\n line = handle;\\n\\n if (typeof handle == \\\"number\\\") {\\n line = getLine(doc, clipLine(doc, handle));\\n } else {\\n no = lineNo(handle);\\n }\\n\\n if (no == null) {\\n return null;\\n }\\n\\n if (op(line, no) && doc.cm) {\\n regLineChange(doc.cm, no, changeType);\\n }\\n\\n return line;\\n } // The document is represented as a BTree consisting of leaves, with\",\n \"invert() {\\r\\n this.data = this.data.map(rows => rows.map(cols => cols*-1));\\r\\n }\",\n \"function getCursor($node, offset) {\\n\\t\\t\\t\\t$nodeTd = $node.parent();\\n \\t\\t\\tvar oldLine, newLine;\\n\\t\\t\\t\\tif (!$nodeTd.hasClass(\\\"old\\\") && !$nodeTd.hasClass(\\\"new\\\") \\n\\t\\t\\t\\t\\t\\t|| $nodeTd.hasClass(\\\"old\\\") && $nodeTd.hasClass(\\\"new\\\")) {\\n\\t\\t\\t\\t\\toldLine = $nodeTd.data(\\\"old\\\") + 1;\\n\\t\\t\\t\\t\\tnewLine = $nodeTd.data(\\\"new\\\") + 1;\\n\\t\\t\\t\\t} else if ($nodeTd.hasClass(\\\"old\\\")) {\\n\\t\\t\\t\\t\\toldLine = $nodeTd.data(\\\"old\\\") + 1;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tnewLine = $nodeTd.data(\\\"new\\\") + 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tvar $contents = $nodeTd.contents();\\n\\t\\t\\t\\tvar oldOffset = 0, newOffset = 0;\\n \\t\\t\\tfor (var i=0; i<$contents.length; i++) {\\n \\t\\t\\t\\tvar $content = $($contents[i]);\\n \\t\\t\\t\\tif ($content.is($node)) {\\n \\t\\t\\t\\t\\tif ($content.hasClass(\\\"delete\\\")) { \\n \\t\\t\\t\\t\\t\\toldCh = oldOffset + offset;\\n \\t\\t\\t\\t\\t\\tnewCh = undefined;\\n \\t\\t\\t\\t\\t\\tnewLine = undefined;\\n \\t\\t\\t\\t\\t} else if ($content.hasClass(\\\"insert\\\")) {\\n \\t\\t\\t\\t\\t\\toldCh = undefined;\\n \\t\\t\\t\\t\\t\\toldLine = undefined;\\n \\t\\t\\t\\t\\t\\tnewCh = newOffset + offset;\\n \\t\\t\\t\\t\\t} else {\\n \\t\\t\\t\\t\\t\\toldCh = oldOffset + offset;\\n \\t\\t\\t\\t\\t\\tnewCh = newOffset + offset;\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\tbreak;\\n \\t\\t\\t\\t} else {\\n \\t\\t\\t\\t\\tvar len = $content.text().length;\\n \\t\\t\\t\\t\\tif ($content.hasClass(\\\"delete\\\")) {\\n \\t\\t\\t\\t\\t\\toldOffset += len;\\n \\t\\t\\t\\t\\t} else if ($content.hasClass(\\\"insert\\\")) {\\n \\t\\t\\t\\t\\t\\tnewOffset += len;\\n \\t\\t\\t\\t\\t} else {\\n\\t \\t\\t\\t\\t\\toldOffset += len;\\n\\t \\t\\t\\t\\t\\tnewOffset += len;\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t\\tif ($nodeTd.hasClass(\\\"left\\\")) {\\n \\t\\t\\t\\tnewLine = newCh = undefined;\\n \\t\\t\\t} else if ($nodeTd.hasClass(\\\"right\\\")) {\\n \\t\\t\\t\\toldLine = oldCh = undefined;\\n \\t\\t\\t}\\n\\t\\t\\t\\treturn {\\n\\t\\t\\t\\t\\toldLine: oldLine,\\n\\t\\t\\t\\t\\toldCh: oldCh,\\n\\t\\t\\t\\t\\tnewLine: newLine,\\n\\t\\t\\t\\t\\tnewCh: newCh\\n\\t\\t\\t\\t};\\n \\t\\t}\",\n \"function modifyClearCells(arg, row, column) {\\r\\n\\tvar i = arg.emptyCells.indexOf(String(row) + String(column));\\r\\n\\targ.emptyCells.splice(i, 1);\\r\\n}\",\n \"function flipRe(idx) {return {row: Math.floor(idx/numRows), ele: idx%numRows}}\",\n \"function moveRight() {\\n\\t\\tfor (var row = 0; row < Rows; row++) {\\n\\t\\t\\tarrayCol = new Array(Cols);\\n\\t\\t\\tfor (var col = 0; col < Cols; col++) {\\n\\t\\t\\t\\tarrayCol[col] = matrix[row][Cols - 1 - col];\\n\\t\\t\\t}\\n\\t\\t\\tmatrix[row] = newArray(arrayCol).reverse();\\n\\t\\t}\\n\\n\\t\\tdraw();\\n\\t}\",\n \"function clearCell(x,y){}\",\n \"function undo() {\\n updateFormula(function(text) {\\n return text.slice(0, -1);\\n });\\n }\",\n \"originalValue(columnIndex, rowIndex, value = null) {\\n var cell = this.getCellElementAt(columnIndex, rowIndex);\\n if (latte._undef(value))\\n return cell.data('original-value');\\n cell.data('original-value', value);\\n return this;\\n }\",\n \"propagateDownFromLeft(node, parentPos, leftSibling) {\\n let parentElement = node.parent.popAt(parentPos);\\n this.addAtLastIndexOfCallStack(\\n this.undoPopAt.bind(this, parentElement, node.parent, parentPos)\\n );\\n if (node.parent.hasRightChildAt(parentPos - 1)) {\\n let nodeParentAtRightChildOldValue = node.parent.at(parentPos - 1).rightChild;\\n node.parent.at(parentPos - 1).rightChild = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.parent.at(parentPos - 1).rightChild = nodeParentAtRightChildOldValue;\\n }\\n );\\n }\\n let parentElementLeftChildOldValue = parentElement.leftChild;\\n parentElement.leftChild = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.leftChild = parentElementLeftChildOldValue;\\n }\\n )\\n\\n let parentElementRightChildOldValue = parentElement.rightChild;\\n parentElement.rightChild = node.hasLeftmostChild() ? node.getLeftmostChild() : this.recentNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.rightChild = parentElementRightChildOldValue;\\n }\\n )\\n\\n node.addFirst(parentElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddFirst.bind(this, node)\\n );\\n\\n let nodeIsLeafOldValue = node.isLeaf;\\n node.isLeaf = node.isLeaf && leftSibling.isLeaf;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.isLeaf = nodeIsLeafOldValue;\\n }\\n );\\n\\n this.mergeToRight(leftSibling, node);\\n if (node.parent === this.root && this.root.size() === 0) {\\n let rootOldValue = this.root;\\n this.root = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n this.root = rootOldValue;\\n }\\n );\\n\\n let nodeParentOldValue = node.parent;\\n node.parent = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.parent = nodeParentOldValue;\\n }\\n )\\n }\\n }\",\n \"function R(e,t,a){if(void 0===a&&(a=null),!(this instanceof R))return new R(e,t,a);this.line=e,this.ch=t,this.sticky=a}\",\n \"propagateDownFromRight(node, parentPos, rightSibling) {\\n let parentElement = node.parent.popAt(parentPos);\\n this.addAtLastIndexOfCallStack(\\n this.undoPopAt.bind(this, parentElement, node.parent, parentPos)\\n );\\n\\n if (node.parent.hasLeftChildAt(parentPos)) {\\n let nodeParentAtLeftChildOldValue = node.parent.at(parentPos).leftChild;\\n node.parent.at(parentPos).leftChild = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.parent.at(parentPos).leftChild = nodeParentAtLeftChildOldValue;\\n }\\n )\\n }\\n\\n let parentElementLeftChildOldValue = parentElement.leftChild;\\n parentElement.leftChild = node.hasRightmostChild() ? node.getRightmostChild() : this.recentNode;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.leftChild = parentElementLeftChildOldValue;\\n }\\n );\\n\\n let parentElementRightChildOldValue = parentElement.rightChild;\\n parentElement.rightChild = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n parentElement.rightChild = parentElementRightChildOldValue;\\n }\\n );\\n\\n node.addLast(parentElement);\\n this.addAtLastIndexOfCallStack(\\n this.undoAddLast.bind(this, node)\\n );\\n\\n let nodeIsLeafOldValue = node.isLeaf;\\n node.isLeaf = node.isLeaf && rightSibling.isLeaf;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.isLeaf = nodeIsLeafOldValue;\\n }\\n );\\n\\n this.mergeToLeft(node, rightSibling);\\n\\n\\n if (node.parent === this.root && this.root.size() === 0) {\\n let rootOldValue = this.root;\\n this.root = node;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n this.root = rootOldValue;\\n }\\n )\\n\\n let nodeParentOldValue = node.parent;\\n node.parent = null;\\n this.addAtLastIndexOfCallStack(\\n () => {\\n node.parent = nodeParentOldValue;\\n }\\n );\\n }\\n }\",\n \"clear() {\\n if (this.buffer.ybase === 0 && this.buffer.y === 0) {\\n // Don't clear if it's already clear\\n return;\\n }\\n this.buffer.lines.set(0, this.buffer.lines.get(this.buffer.ybase + this.buffer.y));\\n this.buffer.lines.length = 1;\\n this.buffer.ydisp = 0;\\n this.buffer.ybase = 0;\\n this.buffer.y = 0;\\n for (let i = 1; i < this.rows; i++) {\\n this.buffer.lines.push(this.buffer.getBlankLine(DEFAULT_ATTR_DATA));\\n }\\n this.refresh(0, this.rows - 1);\\n this._onScroll.fire(this.buffer.ydisp);\\n }\",\n \"undoPos()\\n {\\n this.dot.undoPos();\\n }\",\n \"function reverseMutate() {\\n let newOnes = ones.slice().reverse();\\n console.log(ones);\\n console.log(newOnes);\\n }\",\n \"function removePosition(node, force) {\\n visit(node, force ? hard : soft)\\n return node\\n}\",\n \"function removePosition(node, force) {\\n visit(node, force ? hard : soft)\\n return node\\n}\",\n \"function removePosition(node, force) {\\n visit(node, force ? hard : soft)\\n return node\\n}\",\n \"set(row, column, value) {\\n const n = this._width * row + column;\\n this._elements[n] = value;\\n return this;\\n }\",\n \"function SpreadFromLeft(tree) {\\n\\n return Spread(+tree.getAttribute(\\\"data-x\\\") - 1,\\n +tree.getAttribute(\\\"data-y\\\"));\\n\\n}\",\n \"trimEmptyLines () {\\n this.trimEmptyLinesAtBeginning()\\n\\n this.lines.reverse()\\n this.trimEmptyLinesAtBeginning()\\n this.lines.reverse()\\n }\",\n \"function rewriteXY(newMatrix,rewX rewY, rewValue) {\\n\\t\\tvar zwischenSpeicher = newMatrix[rewX];\\n\\t\\tzwischenSpeicher[rewY] = rewValue;\\n\\t\\tnewMatrix[rewX] = zwischenSpeicher;\\n\\t\\treturn newMatrix;\\t\\n\\t}\",\n \"function borrarRow2(e) {\\n // console.log(e);\\n e.target.parentNode.parentNode.removeChild(e.target.parentNode);\\n document.querySelector('textarea').value = ej;\\n}\",\n \"clearEol() {\\n const {cursor, bg_color, size, font_attr} = this.proxy\\n const {line, col} = cursor\\n const clear_length = (size.cols - col) * font_attr.font_width\\n log.debug(`Clear until EOL: ${line}:${col} length=${clear_length}`)\\n this.drawBlock(line, col, 1, clear_length, bg_color)\\n this.lines.clearEol(line, col)\\n }\",\n \"function relaxRightToLeft(columns, alpha, beta) {\\n for (var n = columns.length, i = n - 2; i >= 0; --i) {\\n var column = columns[i];\\n for (var _i = 0, column_2 = column; _i < column_2.length; _i++) {\\n var source = column_2[_i];\\n var y = 0;\\n var w = 0;\\n for (var _a = 0, _b = source.sourceLinks; _a < _b.length; _a++) {\\n var _c = _b[_a], target = _c.target, value_2 = _c.value;\\n var v = value_2 * (target.layer - source.layer);\\n y += sourceTop(source, target) * v;\\n w += v;\\n }\\n if (!(w > 0))\\n continue;\\n var dy_2 = (y / w - source.y0) * alpha;\\n source.y0 += dy_2;\\n source.y1 += dy_2;\\n reorderNodeLinks(source);\\n }\\n if (sort === undefined)\\n column.sort(ascendingBreadth);\\n if (column.length)\\n resolveCollisions(column, beta);\\n }\\n }\",\n \"function columnize($putInHere, $pullOutHere, $parentColumn, height){\\n while($parentColumn.height() < height &&\\n $pullOutHere[0].childNodes.length){\\n $putInHere.append($pullOutHere[0].childNodes[0]);\\n }\\n if($putInHere[0].childNodes.length == 0) return;\\n\\n // now we're too tall, undo the last one\\n var kids = $putInHere[0].childNodes;\\n var lastKid = kids[kids.length-1];\\n $putInHere[0].removeChild(lastKid);\\n var $item = jQuery(lastKid);\\n\\n\\n if($item[0].nodeType == 3){\\n // it's a text node, split it up\\n var oText = $item[0].nodeValue;\\n var counter2 = options.width / 18;\\n if(options.accuracy)\\n counter2 = options.accuracy;\\n var columnText;\\n var latestTextNode = null;\\n while($parentColumn.height() < height && oText.length){\\n if (oText.indexOf(' ', counter2) != '-1') {\\n columnText = oText.substring(0, oText.indexOf(' ', counter2));\\n } else {\\n columnText = oText;\\n }\\n latestTextNode = document.createTextNode(columnText);\\n $putInHere.append(latestTextNode);\\n\\n if(oText.length > counter2){\\n oText = oText.substring(oText.indexOf(' ', counter2));\\n }else{\\n oText = \\\"\\\";\\n }\\n }\\n if($parentColumn.height() >= height && latestTextNode != null){\\n // too tall :(\\n $putInHere[0].removeChild(latestTextNode);\\n oText = latestTextNode.nodeValue + oText;\\n }\\n if(oText.length){\\n $item[0].nodeValue = oText;\\n }else{\\n return false; // we ate the whole text node, move on to the next node\\n }\\n }\\n\\n if($pullOutHere.children().length){\\n $pullOutHere.prepend($item);\\n }else{\\n $pullOutHere.append($item);\\n }\\n\\n return $item[0].nodeType == 3;\\n }\",\n \"function operate() {\\n var matrix = this.matrix,\\n dataProvider = this.dataProvider;\\n matrix.cellReferences.length = 0;\\n (0, _array.arrayEach)(matrix.data, function (cell) {\\n cell.setState(_value.default.STATE_OUT_OFF_DATE);\\n cell.clearPrecedents();\\n var row = cell.row,\\n column = cell.column;\\n var value = dataProvider.getSourceDataAtCell(row, column);\\n\\n if ((0, _utils.isFormulaExpression)(value)) {\\n var prevRow = visualRows.get(cell);\\n var expModifier = new _expressionModifier.default(value);\\n expModifier.translate({\\n row: dataProvider.t.toVisualRow(row) - prevRow\\n });\\n dataProvider.updateSourceData(row, column, expModifier.toString());\\n }\\n });\\n visualRows = null;\\n}\",\n \"function removePosition(node, force) {\\n visit(node, force ? hard : soft);\\n return node;\\n}\",\n \"function toggleleft () {\\n\\n // grab the current column1 column and save it!\\n old_column1 = document.getElementById(\\\"hello-world-column1\\\").innerHTML;\\n\\n // replace the screen contents of column1 column with new_text\\n document.getElementById(\\\"hello-world-column1\\\").innerHTML = new_column1;\\n\\n\\n console.log(\\\"-- updated by click --\\\");\\n console.log(\\\"new_column1: \\\" + new_column1);\\n console.log(\\\"old_column1: \\\" + old_column1);\\n console.log(\\\"----------------------\\\\n\\\\n\\\\n\\\");\\n\\n // this allows the \\\"toggle\\\" - we swap the old for the new!\\n new_column1 = old_column1;\\n\\n console.log(\\\"-- updated by \\\\\\\"toggle\\\\\\\" --\\\");\\n console.log(\\\"new_column1: \\\" + new_column1);\\n console.log(\\\"old_column1: \\\" + old_column1);\\n console.log(\\\"*** NOTE: new_column1 == old_column1 now! ***\\\");\\n console.log(\\\"-------------------------\\\\n\\\\n\\\\n\\\");\\n }\",\n \"function consume() {\\n // Line ending; assumes CR is not used (remark removes those).\\n if (value.charCodeAt(index) === lineFeed) {\\n place.line++\\n place.column = 1\\n }\\n // Anything else.\\n else {\\n place.column++\\n }\\n\\n index++\\n\\n place.offset++\\n place.index = index\\n }\",\n \"function undoMove(board, move) {\\n board[move] = ' ';\\n}\",\n \"function mirrorHorizontal(originalFunction){\\n return function(parameter){\\n var point = originalFunction(parameter);\\n point[0] = -point[0];\\n return point;\\n }\\n}\",\n \"pop()\\n\\t{\\n\\t\\tthis.rows.pop();\\n\\t\\t// Update the column count\\n\\t\\tthis.width = this.rows.reduce(\\n\\t\\t\\t(width, row) => Math.max(row.type == 'full' ? 1 : row.data.length, width),\\n\\t\\t\\t0\\n\\t\\t);\\n\\t}\",\n \"function colRev(col, rev){\\n\\tanimateCollapse(col);\\n\\tsetTimeout(animateReveal(rev), 1500);\\n}\",\n \"function helper(change){\\n let [row, col] = change\\n for(let i = 0; i < matrix.length; i+=1){\\n matrix[i][col] = 0\\n }\\n for(let j = 0; j < matrix[0].length; j+=1){\\n matrix[row][j] = 0\\n }\\n }\",\n \"shiftLeft() {\\n for (let line of this.cells) {\\n for (let i = 0; i < line.length - 1; i++) {\\n line[i].setType(line[i + 1].type);\\n }\\n line[line.length - 1].setType(BeadType.default);\\n }\\n }\",\n \"function resetRowContents()\\r\\n\\t{\\r\\n\\r\\n\\t\\tvar theCell;\\r\\n\\t\\tvar thisRow;\\r\\n\\r\\n\\t\\tif ( editingRow !== -1 )\\r\\n\\t\\t{\\r\\n\\t\\t\\t// get a reference to the Cell selected\\r\\n\\t\\t\\ttheCell = document.getElementById('cell' + editingRow);\\r\\n\\r\\n\\t\\t\\tthisRow = class_myRows[editingRow];\\r\\n\\r\\n\\t\\t\\t// re-create the cell as it was before\\r\\n\\t\\t\\tif ( thisRow.link.length > 0 )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttheCell.innerHTML= \\\"<A href=\\\\\\\"\\\" + thisRow.link + getOptionalParams( thisRow ) + \\\"\\\\\\\">\\\" + thisRow.name + \\\"</a> \\\" + fn_MenuStr( '', '', thisRow.dataId, '', imgSrc, LocString( 'Functions' ), '' ) + thisRow.modifiedImgs;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttheCell.innerHTML= \\\" \\\" + thisRow.name + fn_MenuStr( '', '', thisRow.dataId, '', imgSrc, LocString( 'Functions' ), '' ) + thisRow.modifiedImgs;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\teditingRow = -1;\\r\\n\\t\\t\\tkillPopup();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"function flipCell(y, x) {\\n if (x >= 0 && x < ncols && y >= 0 && y < nrows) {\\n board[y][x] = !board[y][x];\\n }\\n }\",\n \"function r(e,t,n,r,o){this.children=[],this.sourceContents={},this.line=null==e?null:e,this.column=null==t?null:t,this.source=null==n?null:n,this.name=null==o?null:o,null!=r&&this.add(r)}\",\n \"function break_up_node(read_node, $write_context) {\\n \\n // check type to determine how to break it\\n if (read_node.nodeType == Node.TEXT_NODE) {\\n \\n // text nodes get chopped up by words\\n $write_context = write_text_to_column($(read_node), $write_context);\\n \\n } else {\\n \\n // put an empty clone of it in the column (the same one the whole didn't fit into)\\n // and trigger the recursion.\\n var $write_sub_context = $(read_node).clone().empty().appendTo($write_context);\\n $write_context = walk_read_nodes($(read_node), $write_sub_context);\\n }\\n return $write_context;\\n }\",\n \"function SpreadFromRight(tree) {\\n\\n return Spread(+tree.getAttribute(\\\"data-x\\\") + 1,\\n +tree.getAttribute(\\\"data-y\\\"));\\n\\n}\",\n \"restorePos(_x, _y)\\n {\\n this.x = _x;\\n this.y = _y;\\n }\",\n \"_undo() {\\n for (const [k, v] of Object.entries(this._undos)) {\\n if (v) {\\n\\tthis._cells[k] = v;\\n }\\n else {\\n\\tdelete this._cells[k];\\n }\\n }\\n }\",\n \"revert() { }\",\n \"Rewind() {}\",\n \"undo() {\\n if (this.canUndo()) {\\n this.shouldSaveHistory = false;\\n const { index, state } = this.stack[(this.position -= 1)];\\n this.onUpdate();\\n\\n this.editor.blocks.render({ blocks: state }).then(() => this.editor.caret.setToBlock(index, \\\"end\\\"));\\n }\\n }\",\n \"restoreValue() {\\n this.textInputNode.value = this.originalValue;\\n }\",\n \"function reverseRowsAndColumns(matrix) {\\n let transformedMx = [];\\n matrix.map((row) => {\\n row.map((val, cIndex) => {\\n if (!transformedMx[cIndex]) transformedMx.push([]);\\n transformedMx[cIndex].push(val);\\n});\\n});\\n return transformedMx;\\n}\",\n \"function redips_column(std){\\n\\tvar nrows = std.hall.nrows;\\n\\treturn nrows - 1 - (std.hall_position.charCodeAt(0) - 65); // 'A' is 65, 'B' is 66, .. Vertical offset -1\\n}\",\n \"function backspace() {\\n if (calcVals.cur.length > 0) {\\n calcVals.cur = calcVals.cur.substring(0, calcVals.cur.length - 1);\\n }\\n if (calcVals.cur.length === 0) {\\n calcVals.cur = \\\"0\\\";\\n }\\n calcVals.prevAttr = \\\"filler\\\";\\n}\",\n \"function _overwrite(args, t) {\\n var previous = _stack[_index].graph;\\n if (_index > 0) {\\n _index--;\\n _stack.pop();\\n }\\n _stack = _stack.slice(0, _index + 1);\\n var actionResult = _act(args, t);\\n _stack.push(actionResult);\\n _index++;\\n return change(previous);\\n }\",\n \"function changeLine(doc, handle, changeType, op) {\\n\\t\\t var no = handle, line = handle;\\n\\t\\t if (typeof handle == \\\"number\\\") { line = getLine(doc, clipLine(doc, handle)); }\\n\\t\\t else { no = lineNo(handle); }\\n\\t\\t if (no == null) { return null }\\n\\t\\t if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\\n\\t\\t return line\\n\\t\\t }\",\n \"rotate() {\\n const newCells = []\\n for (let i = 0; i < this.cells.length; i++) {\\n newCells[i] = []\\n for (let j = 0; j < this.cells.length; j++) {\\n newCells[i][j] = this.cells[this.cells.length - 1 - j][i]\\n }\\n }\\n this.cells = newCells\\n }\",\n \"function changeLine(doc, handle, changeType, op) {\\n var no = handle, line = handle;\\n if (typeof handle == \\\"number\\\") { line = getLine(doc, clipLine(doc, handle)); }\\n else { no = lineNo(handle); }\\n if (no == null) { return null }\\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\\n return line\\n }\",\n \"function changeLine(doc, handle, changeType, op) {\\n var no = handle, line = handle;\\n if (typeof handle == \\\"number\\\") { line = getLine(doc, clipLine(doc, handle)); }\\n else { no = lineNo(handle); }\\n if (no == null) { return null }\\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\\n return line\\n }\",\n \"function changeLine(doc, handle, changeType, op) {\\n var no = handle, line = handle;\\n if (typeof handle == \\\"number\\\") { line = getLine(doc, clipLine(doc, handle)); }\\n else { no = lineNo(handle); }\\n if (no == null) { return null }\\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\\n return line\\n }\",\n \"function changeLine(doc, handle, changeType, op) {\\n var no = handle, line = handle;\\n if (typeof handle == \\\"number\\\") { line = getLine(doc, clipLine(doc, handle)); }\\n else { no = lineNo(handle); }\\n if (no == null) { return null }\\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\\n return line\\n }\",\n \"function changeLine(doc, handle, changeType, op) {\\n var no = handle, line = handle;\\n if (typeof handle == \\\"number\\\") { line = getLine(doc, clipLine(doc, handle)); }\\n else { no = lineNo(handle); }\\n if (no == null) { return null }\\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\\n return line\\n }\",\n \"function changeLine(doc, handle, changeType, op) {\\n var no = handle, line = handle;\\n if (typeof handle == \\\"number\\\") { line = getLine(doc, clipLine(doc, handle)); }\\n else { no = lineNo(handle); }\\n if (no == null) { return null }\\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\\n return line\\n }\",\n \"function changeLine(doc, handle, changeType, op) {\\n var no = handle, line = handle;\\n if (typeof handle == \\\"number\\\") { line = getLine(doc, clipLine(doc, handle)); }\\n else { no = lineNo(handle); }\\n if (no == null) { return null }\\n if (op(line, no) && doc.cm) { regLineChange(doc.cm, no, changeType); }\\n return line\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.72795355","0.53835183","0.5181338","0.518","0.518","0.518","0.518","0.518","0.518","0.51663584","0.5156114","0.5098013","0.5072985","0.4976196","0.4880812","0.48687857","0.48530856","0.48391765","0.48253495","0.4817544","0.4776628","0.4767747","0.47495526","0.47495526","0.47495526","0.47495526","0.47495526","0.47313908","0.46884713","0.46787226","0.46785676","0.4660378","0.46584618","0.46545672","0.4651193","0.46413124","0.4631119","0.4609149","0.46089718","0.4605441","0.45965233","0.45875913","0.45802027","0.45744443","0.4560223","0.4559384","0.45450038","0.45415407","0.4532388","0.45190972","0.45142126","0.45133683","0.45133683","0.45133683","0.45039946","0.44802177","0.44690162","0.44662288","0.44662043","0.44591838","0.44566286","0.44518396","0.44464812","0.4445049","0.44384328","0.44382668","0.44269183","0.44247082","0.44208026","0.44136697","0.4412158","0.44095832","0.4405493","0.43911996","0.43896455","0.43756694","0.43705237","0.43699673","0.43670103","0.43664387","0.43663156","0.43611988","0.43483156","0.43465108","0.43346033","0.43270853","0.4324269","0.43213335","0.43169698","0.43169576","0.43169576","0.43169576","0.43169576","0.43169576","0.43169576","0.43169576"],"string":"[\n \"0.72795355\",\n \"0.53835183\",\n \"0.5181338\",\n \"0.518\",\n \"0.518\",\n \"0.518\",\n \"0.518\",\n \"0.518\",\n \"0.518\",\n \"0.51663584\",\n \"0.5156114\",\n \"0.5098013\",\n \"0.5072985\",\n \"0.4976196\",\n \"0.4880812\",\n \"0.48687857\",\n \"0.48530856\",\n \"0.48391765\",\n \"0.48253495\",\n \"0.4817544\",\n \"0.4776628\",\n \"0.4767747\",\n \"0.47495526\",\n \"0.47495526\",\n \"0.47495526\",\n \"0.47495526\",\n \"0.47495526\",\n \"0.47313908\",\n \"0.46884713\",\n \"0.46787226\",\n \"0.46785676\",\n \"0.4660378\",\n \"0.46584618\",\n \"0.46545672\",\n \"0.4651193\",\n \"0.46413124\",\n \"0.4631119\",\n \"0.4609149\",\n \"0.46089718\",\n \"0.4605441\",\n \"0.45965233\",\n \"0.45875913\",\n \"0.45802027\",\n \"0.45744443\",\n \"0.4560223\",\n \"0.4559384\",\n \"0.45450038\",\n \"0.45415407\",\n \"0.4532388\",\n \"0.45190972\",\n \"0.45142126\",\n \"0.45133683\",\n \"0.45133683\",\n \"0.45133683\",\n \"0.45039946\",\n \"0.44802177\",\n \"0.44690162\",\n \"0.44662288\",\n \"0.44662043\",\n \"0.44591838\",\n \"0.44566286\",\n \"0.44518396\",\n \"0.44464812\",\n \"0.4445049\",\n \"0.44384328\",\n \"0.44382668\",\n \"0.44269183\",\n \"0.44247082\",\n \"0.44208026\",\n \"0.44136697\",\n \"0.4412158\",\n \"0.44095832\",\n \"0.4405493\",\n \"0.43911996\",\n \"0.43896455\",\n \"0.43756694\",\n \"0.43705237\",\n \"0.43699673\",\n \"0.43670103\",\n \"0.43664387\",\n \"0.43663156\",\n \"0.43611988\",\n \"0.43483156\",\n \"0.43465108\",\n \"0.43346033\",\n \"0.43270853\",\n \"0.4324269\",\n \"0.43213335\",\n \"0.43169698\",\n \"0.43169576\",\n \"0.43169576\",\n \"0.43169576\",\n \"0.43169576\",\n \"0.43169576\",\n \"0.43169576\",\n \"0.43169576\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.71728957"},"document_rank":{"kind":"string","value":"4"}}},{"rowIdx":76397,"cells":{"query":{"kind":"string","value":"Test the position, after eating, and reverse to a noteaten state."},"document":{"kind":"string","value":"function test() {\n var result = pos({});\n\n line = current.line;\n column = current.column;\n value = subvalue + value;\n\n return result.position;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["backToPosition() {\n while (this.current_position != this.position) {\n this.closeDoors();\n if (this.current_position > this.position) {\n this.moveDown();\n console.log(this.current_position);\n } else if (this.current_position < this.position) {\n this.moveUp();\n }\n console.log(this.current_position);\n }\n this.openDoors = true;\n }","function handleReversedCoordinates(){\n if (complexScope.aLeftUpper > complexScope.aRightBottom) {\n complexScope.changer = complexScope.aLeftUpper;\n complexScope.aLeftUpper = complexScope.aRightBottom;\n complexScope.aRightBottom = complexScope.changer;\n // if you create the new area from right to left\n }\n if (complexScope.bLeftUpper < complexScope.bRightBottom) {\n complexScope.changer = complexScope.bLeftUpper;\n complexScope.bLeftUpper = complexScope.bRightBottom;\n complexScope.bRightBottom = complexScope.changer;\n // if you create the new area from right to left\n }\n }","eat(pos) {\n \tvar x = this.frame.x;\n var y = this.frame.y;\n if(x == pos.x && y == pos.y) {\n return true;\n }\n return false;\n }","function updateFoodAcquiredState(){\n if(snake.history[0].x === food.x && snake.history[0].y === food.y){\n $(\"#success\").get(0).play();\n points = points + 10;\n $(\"#points\").html(points);\n snake.history.unshift({x:snake.history[0].x,y:snake.history[0].y});\n toBeClearedFields.push(food);\n food.x = Math.floor(Math.random() * size);\n food.y = Math.floor(Math.random() * size);\n }\n }","markOff(){\n this.room.unmarkPosition(this.positionX, this.positionY);\n }","eoi() { return this.pos==this.end }","function inPosA2() {\n\trandomNum = Random.value * 10;\n\n\tif(targetDirF == true && randomNum < 6){\n\t\t//do nothing, go forward\n\t\tcalculatingMove = false;\n\t}else if(targetDirR == true){\n\t\t//turn right\n\t\tif(targetTurnR2 == 0){\n\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\n\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t}else{\n\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\n\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t}\n\t}else{\n\t\tif(targetDirF == true){\n\t\t\t//do nothing, go forward\n\t\t\tcalculatingMove = false;\n\t\t}else if(targetDirR == true){\n\t\t\t//turn right\n\t\t\tif(targetTurnR2 == 0){\n\t\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\n\t\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t\t}else{\n\t\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\n\t\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t\t}\n\t\t}else{\n\t\t\tDebug.Log(\"Error with turn selection, position A2\");\n\t\t\ttransform.GetComponent(aiStates).startAgain = true;\n\t\t}\n\t}\n}","eat(pos){\n let x = this.body[this.body.length-1].x\n let y = this.body[this.body.length-1].y\n if (x == pos.x && y == pos.y){\n this.grow();\n return true;\n }\n else{\n false;\n }\n }","click(e, position) {\n\t/*check if the positon in state.position is empty, else alert invalid*/\n if (this.state.positions[position] == \"\") {\n this.state.positions.splice(position, 1, this.state.toggle);\n this.setState({ positions: this.state.positions });\n this.winner()\n if (this.state.toggle == \"x\") {\n this.setState({ toggle: \"o\" })\n } else {\n this.setState({ toggle: \"x\" })\n };\n } else { alert(\"invalid\") }\n }","function goBackward(rover) {\n switch (rover.direction) {\n case 'N':\n rover.position[0]--\n break;\n case 'E':\n rover.position[1]--\n break;\n case 'S':\n rover.position[0]++\n break;\n case 'W':\n rover.position[1]++\n break;\n };\n\t\tconsole.log(\"New Rover Position: [\" + rover.position[0] + \", \" + rover.position[1] + \"]\")\n}","function check_arrow(event){\r\n\r\n const LEFT_KEY = 37;\r\n const RIGHT_KEY = 39;\r\n const UP_KEY = 38;\r\n const DOWN_KEY = 40;\r\n\r\n if(changing_direction) return;\r\n changing_direction = true;\r\n const keyPressed = event.keyCode;\r\n // Use this to check if the snake is moving in the reverse side\r\n const goingUp = dy === -10;\r\n const goingDown = dy === 10;\r\n const goingRight = dx === 10;\r\n const goingLeft = dx === -10;\r\n\r\n if(keyPressed === LEFT_KEY && !goingRight){\r\n dx = -10;\r\n dy = 0;\r\n }\r\n\r\n if(keyPressed === RIGHT_KEY && !goingLeft){\r\n dx = 10;\r\n dy = 0;\r\n }\r\n\r\n if(keyPressed === UP_KEY && !goingDown){\r\n dx = 0;\r\n dy = -10;\r\n }\r\n\r\n if(keyPressed === DOWN_KEY && !goingUp){\r\n dx = 0;\r\n dy = 10;\r\n }\r\n}","function noteOff(noteNumber) { }","function checkForTrick(trickEndPosition : Vector3)\n\t{\n\t\tvar xDifference : float = 0;\n\t\t\n\t\txDifference = trickEndPosition.x - trickStartPosition.x;\n\t\t\n\t\tif(xDifference < -180 || xDifference > 180)//they did a flip\n\t\t{\n\t\t\tvar didATrick : String = \"hi\";\n\t\t\txDifference = 2;\n\t\t}\n\t\t\n\t\ttrickStartPosition = new Vector3(0,0,0);\n\t}","function downPropogate(){\n newPosition = ghostPosition + options[3]\n newGhostDirection = directions[3]\n if (!canMove()) {\n let randomIndex = Math.floor(Math.random()*2)+1\n newPosition = ghostPosition + options[randomIndex]\n newGhostDirection = directions[randomIndex]\n if (!canMove()){\n randomIndex = (randomIndex===1) ? 2:1\n newPosition = ghostPosition + options[randomIndex]\n newGhostDirection = directions[randomIndex]\n if (!canMove()){\n newPosition = ghostPosition + options[0]\n newGhostDirection = directions[0]\n }\n }\n }\n }","function encloseRightState(){\n if(shipY < 0){\n shipY = 0;\n }\n if(shipY > height - 50){\n shipY = height - 50;\n }\n if(shipX > width - 40){\n shipX = width - 40;\n }\n}","moveForward () {\n let posAux = Object.assign({}, this.position);\n switch (this.position.orientation) {\n case 'N':\n this.position.column++;\n break;\n case 'S':\n this.position.column--;\n break;\n case 'E':\n this.position.row--;\n break;\n case 'W':\n this.position.row++;\n break;\n default:\n break;\n }\n this.isLost(posAux);\n }","function outOfSight(){\n\t\tif(snakeArr[0].x>99&¤tMove=='r'){\n\t\t\treturn 'rightExcede';\n\t\t}\n\t\telse if(snakeArr[0].x<0&¤tMove=='l'){\n\t\t\treturn 'leftExcede';\n\t\t}\n\t\telse if(snakeArr[0].y>45.5&¤tMove=='b'){\n\t\t\treturn 'bottomExcede';\n\t\t}\n\t\telse if(snakeArr[0].y<0&¤tMove=='t'){\n\t\t\treturn 'topExcede';\n\t\t}\n\t\telse{\n\t\t\treturn false;\n\t\t}\n\t}","winner(){\n const msg = \" Winner is: \" + this.state.toggle;\n /*check from the central position */\n if(this.state.positions[4]!==\"\"){\n if(this.state.positions[0]===this.state.positions[4] && this.state.positions[4]===this.state.positions[8]||\n this.state.positions[2]===this.state.positions[4] && this.state.positions[4]===this.state.positions[6]||\n this.state.positions[1]===this.state.positions[4] && this.state.positions[4]===this.state.positions[7]||\n this.state.positions[3]===this.state.positions[4] && this.state.positions[4]===this.state.positions[5]\n ){\n alert(msg)\n this.setState({positions:[\"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\"]});\n this.setState({toggle:\"x\"});\n }\n /*check from the inicial position */\n \t}else if(this.state.positions[0]!==\"\"){\n \tif(this.state.positions[1]===this.state.positions[0] && this.state.positions[0]===this.state.positions[2]||\n this.state.positions[3]===this.state.positions[0] && this.state.positions[0]===this.state.positions[6]\n \t){\n alert(msg);\n this.setState({positions:[\"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\"]});\n this.setState({toggle:\"x\"});\n \t}\n \t/*check from the last position */\n \t}else if(this.state.positions[8]!==\"\")\n \tif(this.state.positions[2]===this.state.positions[8] && this.state.positions[8]===this.state.positions[5]||\n this.state.positions[6]===this.state.positions[8] && this.state.positions[8]===this.state.positions[7]\n \t){\n alert(msg);\n this.setState({positions:[\"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\"]});\n this.setState({toggle:\"x\"});\n \t}\n }","function trackbackAlternations(originalPos, newPos) {\n var vp = getMaskSet()[\"validPositions\"][newPos],\n targetLocator = vp.locator,\n tll = targetLocator.length;\n\n for (var ps = originalPos; ps < newPos; ps++) {\n if (!isMask(ps)) {\n var tests = getTests(ps),\n bestMatch = tests[0], equality = -1;\n $.each(tests, function (ndx, tst) {\n for (var i = 0; i < tll; i++) {\n if (tst.locator[i] && checkAlternationMatch(tst.locator[i].toString().split(','), targetLocator[i].toString().split(',')) && equality < i) {\n equality = i;\n bestMatch = tst;\n }\n }\n });\n setValidPosition(ps, $.extend({}, bestMatch, { \"input\": bestMatch[\"match\"].def }), true)\n }\n }\n }","function updateState(pos) {\n if ('NEWS'.indexOf(pos.val) > -1) {\n bender.direction = pos.val;\n }\n else if (pos.val === 'B') {\n bender.breaker = !bender.breaker;\n }\n else if (pos.val === 'X') {\n board[pos.row][pos.col] = ' ';\n }\n else if (pos.val === 'I') {\n bender.pattern = bender.pattern.split('').reverse().join('');\n }\n else if (pos.val === 'T') {\n teleport();\n }\n }","if (!game.inEditorMode) {\n // revert pos\n this.pos = lastPos;\n }","tellPositionInFrontY(){\n switch(this.orientation){\n case 0:\n return this.positionY - 1;\n case 2:\n return this.positionY + 1;\n }\n return this.positionY;\n }","function trackbackAlternations(originalPos, newPos) {\n\t\t\t\tvar vp = getMaskSet().validPositions[newPos];\n\t\t\t\tif (vp) {\n\t\t\t\t\tvar targetLocator = vp.locator,\n\t\t\t\t\t\ttll = targetLocator.length;\n\n\t\t\t\t\tfor (var ps = originalPos; ps < newPos; ps++) {\n\t\t\t\t\t\tif (getMaskSet().validPositions[ps] === undefined && !isMask(ps, true)) {\n\t\t\t\t\t\t\tvar tests = getTests(ps).slice(),\n\t\t\t\t\t\t\t\tbestMatch = determineTestTemplate(tests, true),\n\t\t\t\t\t\t\t\tequality = -1;\n\t\t\t\t\t\t\tif (tests[tests.length - 1].match.def === \"\") tests.pop();\n\t\t\t\t\t\t\t$.each(tests, function (ndx, tst) { //find best matching\n\t\t\t\t\t\t\t\tfor (var i = 0; i < tll; i++) {\n\t\t\t\t\t\t\t\t\tif (tst.locator[i] !== undefined && checkAlternationMatch(tst.locator[i].toString().split(\",\"), targetLocator[i].toString().split(\",\"), tst.na)) {\n\t\t\t\t\t\t\t\t\t\tif (equality < i) {\n\t\t\t\t\t\t\t\t\t\t\tequality = i;\n\t\t\t\t\t\t\t\t\t\t\tbestMatch = tst;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t//check if alternationIndex is closer then the current bestmatch\n\t\t\t\t\t\t\t\t\t\tvar targetAI = targetLocator[i],\n\t\t\t\t\t\t\t\t\t\t\tbestMatchAI = bestMatch.locator[i],\n\t\t\t\t\t\t\t\t\t\t\ttstAI = tst.locator[i];\n\t\t\t\t\t\t\t\t\t\tif ((targetAI - bestMatchAI) > Math.abs(targetAI - tstAI)) {\n\t\t\t\t\t\t\t\t\t\t\tbestMatch = tst;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tbreak;\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\tbestMatch = $.extend({}, bestMatch, {\n\t\t\t\t\t\t\t\t\"input\": getPlaceholder(ps, bestMatch.match, true) || bestMatch.match.def\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\tbestMatch.generatedInput = true;\n\t\t\t\t\t\t\tsetValidPosition(ps, bestMatch, true);\n\t\t\t\t\t\t\t//revalidate the new position to update the locator value\n\t\t\t\t\t\t\tgetMaskSet().validPositions[newPos] = undefined;\n\t\t\t\t\t\t\t_isValid(newPos, vp.input, true);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}","function reactionReverse () {\n direction = -direction; // Stromrichtung umkehren\n reset(); // Ausgangsstellung\n }","function elongateTopNote(noteIndex)\n{\n if(topNoteBlocks[noteIndex]){\n var newTop = - fallDownSpeed;\n topNoteBlocks[noteIndex].style.top = newTop;\n }\n \n}","function C012_AfterClass_Amanda_CheckNotes() {\n\tif (((ActorGetValue(ActorCloth) == \"\") || (ActorGetValue(ActorCloth) == \"Clothed\") || (ActorGetValue(ActorCloth) == \"Pajamas\")) && !ActorHasInventory(\"Collar\") && !ActorIsRestrained() && !ActorIsGagged()) ActorSetPose(\"CheckNotes\");\n\tLeaveIcon = \"Leave\";\n}","function flip(mark) {\nif (mark ==\"X\")\n return 'O';\nreturn 'X';\n}","function gameLogic() {\n\n // Check if pressed direction is opposite of current direction\n var isReverseDir =\n (nextDir === Directions.UP && snakeDir === Directions.DOWN) ||\n (nextDir === Directions.DOWN && snakeDir === Directions.UP) ||\n (nextDir === Directions.RIGHT && snakeDir === Directions.LEFT) ||\n (nextDir === Directions.LEFT && snakeDir === Directions.RIGHT);\n\n // Change snake dir only if pressed direction is not reverse\n if (!isReverseDir) {\n snakeDir = nextDir;\n }\n\n var oldHead = snake[0]; // Get the position of the head\n \n // Position new head depending on snake direction\n if (snakeDir === Directions.UP)\n var newHead = { x: oldHead.x, y: oldHead.y - 1 };\n else if (snakeDir === Directions.DOWN)\n var newHead = { x: oldHead.x, y: oldHead.y + 1 };\n else if (snakeDir === Directions.LEFT)\n var newHead = { x: oldHead.x - 1, y: oldHead.y };\n else if (snakeDir === Directions.RIGHT)\n var newHead = { x: oldHead.x + 1, y: oldHead.y };\n\n // Add the new head to the front of snake \n snake.unshift(newHead)\n \n // Check if food is eaten\n var ateFood = newHead.x === food.x && newHead.y === food.y;\n\n if (ateFood) { // If the food is eaten then reposition food randomly\n food = {\n x: (Math.random() * 40) | 0,\n y: (Math.random() * 40) | 0\n };\n } else { \n // Remove the last part of the snake - this moves the snake\n // if food is eaten then we skip this part. This is how the \n // snake grows.\n snake.pop();\n }\n\n // Check if snake is dead\n var isDead = false; // initial value\n // Check if newHead is on any other snake part\n for (var i = 1; i < snake.length; i++) {\n if (newHead.x === snake[i].x && newHead.y === snake[i].y) {\n isDead = true;\n break;\n }\n }\n\n\n // Check if snake is out of bounds\n if (newHead.x < 0 || newHead.y < 0 || newHead.x >= 40 || newHead.y >= 40) {\n isDead = true;\n }\n\n // Stop the game if player is dead\n if (isDead) gameRunning = false;\n}","function trackbackAlternations(originalPos, newPos) {\n\t var vp = getMaskSet().validPositions[newPos],\n\t\t\t\t\t\ttargetLocator = vp.locator,\n\t\t\t\t\t\ttll = targetLocator.length;\n\n\t for (var ps = originalPos; ps < newPos; ps++) {\n\t if (getMaskSet().validPositions[ps] === undefined && !isMask(ps, true)) {\n\t var tests = getTests(ps),\n\t\t\t\t\t\t\t\tbestMatch = tests[0],\n\t\t\t\t\t\t\t\tequality = -1;\n\t $.each(tests, function (ndx, tst) { //find best matching\n\t for (var i = 0; i < tll; i++) {\n\t if (tst.locator[i] !== undefined && checkAlternationMatch(tst.locator[i].toString().split(\",\"), targetLocator[i].toString().split(\",\"))) {\n\t if (equality < i) {\n\t equality = i;\n\t bestMatch = tst;\n\t }\n\t } else break;\n\t }\n\t });\n\t setValidPosition(ps, $.extend({}, bestMatch, {\n\t \"input\": bestMatch.match.placeholder || bestMatch.match.def\n\t }), true);\n\t }\n\t }\n\t }","function C012_AfterClass_Amanda_SetPose() {\n\tif (((ActorGetValue(ActorCloth) == \"\") || (ActorGetValue(ActorCloth) == \"Clothed\")) && !ActorIsRestrained() && !ActorIsGagged()) {\n\t\tvar Love = ActorGetValue(ActorLove);\n\t\tvar Sub = ActorGetValue(ActorSubmission);\n\t\tif ((Sub <= -10) && (Math.abs(Sub) >= Math.abs(Love))) ActorSetPose(\"Point\");\n\t\tif ((Sub >= 10) && (Math.abs(Sub) >= Math.abs(Love))) ActorSetPose(\"Shy\");\n\t\tif ((Love >= 10) && (Math.abs(Love) >= Math.abs(Sub))) ActorSetPose(\"Love\");\n\t\tif ((Love <= -10) && (Math.abs(Love) >= Math.abs(Sub))) ActorSetPose(\"Angry\");\n\t\tif (Common_ActorIsOwned) ActorSetPose(\"Shy\");\n\t} else {\n\t\tif ((ActorGetValue(ActorCloth) == \"Naked\") && !ActorIsRestrained() && !ActorIsGagged() && (ActorGetValue(ActorSubmission) >= 10)) ActorSetPose(\"Shy\");\n\t\tif ((ActorGetValue(ActorCloth) == \"Pajamas\") && !ActorIsRestrained() && !ActorIsGagged() && (ActorGetValue(ActorLove) >= 10)) ActorSetPose(\"Happy\");\n\t\telse ActorSetPose(\"\");\n\t}\n}","function ELdown(){\n console.log(\"In eyes l arrow clicked\");\n eyes.destroy();\n eyeindex--;\n if(eyeindex<=0)\n {\n eyeindex = 0;\n eyes = game.add.image(970, 235, images.eyes[eyeindex].name);\n eyes.scale.setTo(0.1);\n be = bb.create(550, 55, images.eyes[eyeindex].name);\n be.scale.setTo(0.1);\n }\n else if (eyeindex >= images.eyes.length)\n {\n eyeindex = images.eyes.length -1;\n eyes = game.add.image(970, 235, images.eyes[eyeindex].name);\n eyes.scale.setTo(0.1);\n be = bb.create(550, 55, images.eyes[eyeindex].name);\n be.scale.setTo(0.1);\n }\n else\n {\n eyes = game.add.image(970, 235, images.eyes[eyeindex].name);\n eyes.scale.setTo(0.1);\n be = bb.create(550, 55, images.eyes[eyeindex].name);\n be.scale.setTo(0.1);\n }\n player.appearance.head.eye = images.eyes[eyeindex].name;\n\n}","isTonic(note) {\n return (note % 12) == this.offset();\n }","function C012_AfterClass_Amanda_TestLove() {\n\tif (!ActorIsGagged()) {\n\t\tif (!ActorIsRestrained() && !Common_PlayerRestrained) {\n\t\t\tif (!Common_PlayerNaked && (ActorGetValue(ActorCloth) != \"Naked\")) {\n\t\t\t\tif (ActorGetValue(ActorLove) >= 20) {\n\t\t\t\t\tActorSetPose(\"\");\n\t\t\t\t\tC012_AfterClass_Amanda_CurrentStage = 100;\n\t\t\t\t\tOverridenIntroText = \"\";\n\t\t\t\t}\n\t\t\t} else OverridenIntroText = GetText(\"CantDateWhileNaked\");\n\t\t} else OverridenIntroText = GetText(\"CantDateWhileRestrained\");\n\t} else C012_AfterClass_Amanda_GaggedAnswer();\n}","function testCase(pos) {\n switch (pos) {\n case 0:\n thisPos = {Location: 'now', lng: 121.5552137, ret: 25.0851076};\n break;\n case 1:\n thisPos = {Location: 'now', lng: 121.5536283, ret: 25.0926443};\n break;\n case 2:\n thisPos = {Location: 'now', lng: 121.5575088, ret: 25.1077731};\n break;\n }\n gmap.onPositionChange();\n}","function offCourse() {\n getCurrentPosition().then(function (position) {\n if (!routeExists()) {\n return;\n }\n var startPoint = turf.point([position.coords.longitude, position.coords.latitude]);\n var nextRoutePoint = turf.along(currentRoute.geom, currentRoute.stepped + stepLengthMiles, 'miles');\n var currentBearing = turf.bearing(startPoint, nextRoutePoint);\n var bearing = currentBearing + 90;\n if (bearing > 180) {\n bearing -= 360;\n }\n var reroutePoint = turf.destination(startPoint, stepLengthMiles * 2, bearing, 'miles');\n $rootScope.$broadcast(events.positionOffCourse, reroutePoint);\n });\n }","getPosition(absState) {\n return absState % (this._w + 1);\n }","function resetFood(){\n //to ensure the food position is not on surrent snake/resetPos\n function isFoodPosOK(x,y){\n //not on snake0\n for (var i = 0; i < snakes[0].body.length; i++){\n if (x == snakes[0].body[i][0] && y == snakes[0].body[i][1])\n return false;\n }\n //not on snake1\n for (var i = 0; i < snakes[1].body.length; i++){\n if (x == snakes[1].body[i][0] && y == snakes[1].body[i][1])\n return false;\n }\n return true;\n }\n \n //update position\n var x = Math.floor(Math.random()*18)+1;\n var y = Math.floor(Math.random()*18)+1;\n while (!isFoodPosOK(x,y)){\n x = Math.floor(Math.random()*18)+1;\n y = Math.floor(Math.random()*18)+1;\n } \n foodPos = [x,y,0];\n }","function calculateDirectionToMoveAndUpdatePosition() {\n var NS, EW;\n\n if (TY < LY) {\n NS = 'S';\n TY += 1;\n }\n else if (TY > LY) {\n NS = 'N';\n TY -= 1;\n }\n else {\n NS = '';\n }\n\n if (TX < LX) {\n EW = 'E';\n TX += 1;\n }\n else if (TX > LX) {\n EW = 'W';\n TX -= 1;\n }\n else {\n EW = '';\n }\n\n return NS+EW;\n }","function is_eating(w) {\n $rt_addContract(w, cd4e49798d42ac5a95f1a8edbd8ed8c01c, \"motion.ts(68,27)\");\n return (w.food).equals(w.snake.segs.x);\n }","function resetSnake(i){\n //ensure reset position is not on the other sname nor on food\n function isSnakePosOK(x,y){\n //not on the other snake\n for (var k = 0; k < snakes[1-i].body.length; k++){\n if ((x == snakes[1-i].body[k][0] || x-1 == snakes[1-i].body[k][0] || x-2 == snakes[1-i].body[k][0]) && y == snakes[1-i].body[k][1])\n return false; \n }\n //not on food\n if ((x == foodPos[0] || x-1 == foodPos[0] || x-2 == foodPos[0]) && y == foodPos[1])\n return false;\n return true;\n }\n \n //update point\n if (i==0) {\n point = 0;\n document.getElementById(\"point\").innerHTML = point;\n }\n else {\n cpoint = 0;\n document.getElementById(\"cpoint\").innerHTML = cpoint;\n }\n\n //update position\n var x = Math.floor(Math.random()*15)+3;\n var y = Math.floor(Math.random()*18)+1;\n while (!isSnakePosOK(x,y)){\n x = Math.floor(Math.random()*15)+3;\n y = Math.floor(Math.random()*18)+1;\n } \n snakes[i].body = [[x,y,0],[x-1,y,0],[x-2,y,0]];\n snakes[i].direction=[\"right\", \"right\"];\n }","function moveBackward(rover){\n console.log(`----${rover.name}----`);\n console.log(\"moveBackward was called\");\n switch (rover.direction) {\n case 'N':\n if (rover.y < 9) {\n rover.y++;\n if (rover1.x === rover2.x && rover1.y === rover2.y) {\n rover.y--\n console.log(`There is an other Rover at (${rover.x},${rover.y+1}). Change your way!`);\n } else if (grid[rover.y][rover.x] === o) {\n rover.y--;\n console.log(`There is an ${o} at (${rover.x},${rover.y+1}). Change your way!`)\n }\n } else {\n console.log(\"canceled command, you are on the grid limit!\");\n }\n break;\n case 'W':\n if (rover.x < 9) {\n rover.x++;\n if (rover1.x === rover2.x && rover1.y === rover2.y) {\n rover.x--\n console.log(`There is an other Rover at (${rover.x+1},${rover.y}). Change your way!`);\n } else if (grid[rover.y][rover.x] === o) {\n rover.x--;\n console.log(`There is an ${o} at (${rover.x+1},${rover.y}). Change your way!`)\n }\n } else {\n console.log(\"canceled command, you are on the grid limit!\");\n }\n break;\n case 'S':\n if (rover.y > 0) {\n rover.y--;\n if (rover1.x === rover2.x && rover1.y === rover2.y) {\n rover.y++\n console.log(`There is an other Rover at (${rover.x},${rover.y-1}). Change your way!`);\n } else if (grid[rover.y][rover.x] === o) {\n rover.y++;\n console.log(`There is an ${o} at (${rover.x},${rover.y-1}). Change your way!`)\n }\n } else {\n console.log(\"canceled command, you are on the grid limit!\");\n }\n break;\n case 'E':\n if (rover.x > 0) {\n rover.x--;\n if (rover1.x === rover2.x && rover1.y === rover2.y) {\n rover.x++\n console.log(`There is an other Rover at (${rover.x-1},${rover.y}). Change your way!`);\n } else if (grid[rover.y][rover.x] === o) {\n rover.x++;\n console.log(`There is an ${o} at (${rover.x-1},${rover.y}). Change your way!`)\n }\n } else {\n console.log(\"canceled command, you are on the grid limit!\");\n }\n break;\n }\n console.log(`Direction: ${rover.direction}`);\n console.log(`Position: (${rover.x},${rover.y})`);\n rover.travelLog.push({x: rover.x, y: rover.y});\n}","reoderQuestion(up = true) {\n const {questionId, answerId} = this.props;\n up ? this.moveUp(questionId, answerId) : this.moveDown(questionId, answerId);\n }","function moveDown() {\n undraw(); //undraw tetromino\n currentPosition += width; //change reference point to one row down\n draw(); //draw the tetromino \n freeze(); \n }","function stepApplyNewPosition () {\n\t\tvar state={\n\t\t\t\tediting: false,\n\t\t\t\tnode: false,\n\t\t\t\tdata: {\n\t\t\t\t\tx: 0,\n\t\t\t\t\ty: 0,\n\t\t\t\t\trotate: 0,\n\t\t\t\t\tscale: 0\n\t\t\t\t}\n\t\t },\n\t\tconfig= {\n\t\t\trotateStep: 3,\n\t\t\tscaleStep: 1,\n\t\t\tmoveStep: 50\n\t\t },\n\t\tdefaults= {\n\t\t\tx: 0,\n\t\t\ty: 0,\n\t\t\trotate: 0,\n\t\t\tscale: 1\n\t\t };\n\t\t \n\t /* $('body').on('mousedown','.step',function(e){\n\t\tstate.editing=true;\n\t\tstate.node=$(this);\n\t\tstate.node.fadeTo(0.6);\n\t\t});\n\t\t\n\t $('body').on('mouseup','.step',function(e){\n\t\tstate.editing=false;\n\t\tvar $t=$(this);\n\t\t$t.fadeTo(1);\n\t\t});\n\t*/\t\n\t\tstate.editing=true;\n\t\tstate.node=$(this);\n\t\t\n\t\tif(state.editing){\n\t\t var $t=state.node;\n\t\t for(var i in state.data){\n\t\t\tvar tmp=$t.attr('data-'+i);\n\t\t\tif(tmp===''){tmp=defaults[i]}\n\t\t\tstate.data[i]= ~~(tmp);\n\t\t\t}\n\t\t\t//console.log(['before...',state.data,state.node[0]]);\n\t\t \n\t\t switch(e.which){\n\t\t\tcase 113: //q\n\t\t\t state.data.rotate-=config.rotateStep;\n\t\t\t\tbreak;\n\t\t\tcase 119: //w\n\t\t\t state.data.y-=config.moveStep;\n\t\t\t\tbreak;\n\t\t\tcase 101: //e\n\t\t\t state.data.rotate+=config.rotateStep;\n\t\t\t\tbreak;\n\t\t\tcase 97: //a\n\t\t\t state.data.x-=config.moveStep;\n\t\t\t\tbreak;\n\t\t\tcase 115: //s\n\t\t\t state.data.y+=config.moveStep;\n\t\t\t\tbreak;\n\t\t\tcase 100: //d\n\t\t\t state.data.x+=config.moveStep;\n\t\t\t\tbreak;\n\t\t\tcase 122: //z\n\t\t\t state.data.scale+=config.scaleStep;\n\t\t\t\tbreak;\n\t\t\tcase 120: //x\n\t\t\t state.data.scale-=config.scaleStep;\n\t\t\t\tbreak;\n\t\t\t \n\t\t\tdefault:\n\t\t\t console.log(e.which);\n\t\t\t \n\t\t\t //yeah, I know, but it looks better when it's here\n\t\t\t break;\n\t\t \n\t\t \n\t\t\t}\n\t\t //console.log(['done...',state.data,state.node[0]]);\n\t\t //reapply all. damn slow \n\t\t for(var i in state.data){\n\t\t\t$t.attr('data-'+i,state.data[i]);\n\t\t\t}\n\t\t\t\n\t\t window['--drawSlideGlobalHandler'](state.node[0],'whatever')\n\t\t\t\n\t\t }\n\t}","function flip(mark) {\n if (mark ==\"X\")\n return 'O';\n return 'X';\n}","checkCheatNotes() {\n let cheatKey = true\n let cheatTouch = true\n for (let posIdx = 1; posIdx <= this.noteToShow; posIdx++) {\n cheatKey = cheatKey && this.key.isDownVisually(this.key.pos[posIdx])\n }\n for (let posIdx = 1; posIdx <= this.noteToShow; posIdx++) {\n cheatTouch = cheatTouch && this.touch.isDownVisually(this.touch.pos[posIdx])\n }\n\n return cheatKey || cheatTouch\n }","function palmPosition(hand, index) {\n if (!isLocked) {\n lateralTracking(hand.palmPosition[0]);\n }\n // console.log(hand);\n }","noteOff() {\n this.keyRect.fill(this.displayOptions.color);\n grid.highlightPitch(this.pitch, false, this.displayOptions);\n audio.noteOff(this.pitch)\n }","invertDirectionRandom() {\n let hasInverted = false;\n if (Math.random() < 0.5) {\n let temp = this.deltaY;\n this.deltaY = this.deltaX;\n this.deltaX = temp;\n hasInverted = true;\n }\n if (Math.random() < 0.5) {\n this.deltaX = -this.deltaX;\n hasInverted = true;\n }\n if (Math.random() < 0.5) {\n this.deltaY = -this.deltaY;\n hasInverted = true;\n }\n if (!hasInverted) {\n this.invertDirection();\n }\n this.updateHitboxes();\n }","function onSnake(position){\n for (var i = 0; i < snake.length; ++i){ //Iterates through the snake\n if (position.x == snake[i].x && position.y == snake[i].y) { //if position of x & y is the same as the position of the snake x and y\n return true;\n }\n }\n return false; //Default false\n}","function trash_down(trashy) {\n //trashy handles the movement of elements with the CSS atrributes\n var trash_current_top = parseInt(trashy.css('top'));\n var trash_current_bottom = parseInt(trashy.css('bottom'));\n var trash_current_left = parseInt(trashy.css('left'));\n var rb_area_height = parseInt(rb_area.height());\n var trash_in = rb_area_height-(rb_area_height*0.4); //.4 of the trash is inside the RB\n var trash_away = rb_area_height-(rb_area_height*0.7);//.7 of the trash is inside the RB\n \n setGameDimension();\n \n if(ft){ //sets the position of the first trash, \n var new_lane_pos = 0;\n var first_trash=Math.floor(Math.random() * max_lane);\n new_lane_pos = recycle_bins_container.dumpsters[first_trash].rb_coordinates;\n laneTracker = first_trash;\n trashy.css('left', new_lane_pos);\n ft=false;\n }\n \n \n //document.getElementById(\"myoutput\").innerHTML = \"GW: \"+ container_width + \" RB1:<i>\"+recycle_bins_container.dumpsters[0].rb_coordinates + \"</i> RB2:<i>\"+recycle_bins_container.dumpsters[1].rb_coordinates + \"</i> RB3:<i>\"+recycle_bins_container.dumpsters[2].rb_coordinates + \"</i> RB4:<i>\"+recycle_bins_container.dumpsters[3].rb_coordinates+\"</i>\";\n //document.getElementById(\"myoutput2\").innerHTML = \"L: \"+ trash_current_left + \" Speed: \"+speed +\" CL: \"+laneTracker+\" RBH: \"+rb_area_height +\" RBW:\"+ $(\"#image-rb-1\").width() +\" B: \"+ trash_current_bottom +\" T: \"+ trash_current_top;\n \n //635 this is near the RB \n if (parseInt(trashy.css('top'))>=container_height){ \n speed = 1;\n trash_info_status = true; //now it needs change because it has reached the RB... //I think I don't need this\n } \n if (trash_current_bottom <= trash_in && my_collision == false) {\n //trash bottom possition vs Recycle Bins Heights \n //once this validation has been done, then it won't be possible to move the trash! #todo\n my_collision = true;\n collision();\n\n }\n if (trash_current_bottom <= trash_away) {\n trash_current_top = -100;\n my_collision = false;\n trashy.css('left', newLane());//here is where the new Y position is being defined...\n nextTrash(); //sets the next current trash values\n }\n trashy.css('top', trash_current_top + speed); //this is what moves trash down.:\n }","function C012_AfterClass_Jennifer_TestLove() {\n\tif (!ActorIsGagged()) {\n\t\tif (!ActorIsRestrained() && !Common_PlayerRestrained) {\n\t\t\tif (!Common_PlayerNaked && (ActorGetValue(ActorCloth) != \"Naked\")) {\n\t\t\t\tif (ActorGetValue(ActorLove) >= 20) {\n\t\t\t\t\tActorSetPose(\"\");\n\t\t\t\t\tC012_AfterClass_Jennifer_CurrentStage = 100;\n\t\t\t\t\tOverridenIntroText = \"\";\n\t\t\t\t}\n\t\t\t} else OverridenIntroText = GetText(\"CantDateWhileNaked\");\n\t\t} else OverridenIntroText = GetText(\"CantDateWhileRestrained\");\n\t} else C012_AfterClass_Jennifer_GaggedAnswer();\n}","moveDown() {\n this.y<332?this.y+=83:false;\n }","function checkPosition() {\n // Für Ameise Schwarz\n for (let i = 0; i < Sem.ant.length; i++) {\n let a = Sem.ant[i];\n // Wenn Ameisen Position auf X - Achse zwischen 567 & 750 \n if (a.x >= 567 && a.x <= 750) {\n // Wenn Ameisen Position auf Y - Achse zwischen 245 & 429\n if (a.y >= 245 && a.y <= 429) {\n // Ruft Funktion für Game Over Screen auf\n gameLost();\n }\n }\n }\n // Für Ameise Braun\n for (let i = 0; i < Sem.antBrown.length; i++) {\n let b = Sem.antBrown[i];\n // Wenn Ameisen Position auf X - Achse zwischen 567 & 750\n if (b.x >= 567 && b.x <= 750) {\n // Wenn Ameisen Position auf Y - Achse zwischen 245 & 429\n if (b.y >= 245 && b.y <= 429) {\n // Ruft Funktion für Game Over Screen auf\n gameLost();\n }\n }\n }\n // Für Ameise Rot\n for (let i = 0; i < Sem.antRed.length; i++) {\n let r = Sem.antRed[i];\n // Wenn Ameisen Position auf X - Achse zwischen 567 & 750\n if (r.x >= 567 && r.x <= 750) {\n // Wenn Ameisen Position auf Y - Achse zwischen 245 & 429\n if (r.y >= 245 && r.y <= 429) {\n // Ruft Funktion für Game Over Screen auf\n gameLost();\n }\n }\n }\n }","function checkPosition(){\n if (i > (data.omicron.length - 1)) {\n i = 0;\n } else if (i < 0) {\n i = (data.omicron.length - 1);\n }\n }","function inPosA1() {\n\t//TWO LANE ROAD, POSITION A1\n\tif(coordOpt2 == 0 && coordOpt3 == 0){\n\t\trandomNum = Random.value * 10;\n\t\tif(targetDirF == true && randomNum <= 3){\n\t\t\t//do nothing, go forward\n\t\t\tcalculatingMove = false;\n\t\t}else if(targetDirL == true && randomNum > 3 && randomNum <= 6){\n\t\t\t//turn left\n\t\t\ttransform.GetComponent(aiStates).leftCoord = targetTurnL;\n\t\t\ttransform.GetComponent(aiStates).leftState = true;\n\t\t}else if(targetDirR == true && randomNum > 6){\n\t\t\t//turn right\n\t\t\tif(targetTurnR2 == 0){\n\t\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\n\t\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t\t}else{\n\t\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\n\t\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t\t}\n\t\t}else{\n\t\t\t//if none of the above, take first available option\n\t\t\tif(targetDirF == true){\n\t\t\t\t//do nothing, go forward\n\t\t\t\tcalculatingMove = false;\n\t\t\t}else if(targetDirL == true){\n\t\t\t\t//turn left\n\t\t\t\ttransform.GetComponent(aiStates).leftCoord = targetTurnL;\n\t\t\t\ttransform.GetComponent(aiStates).leftState = true;\n\t\t\t}else if(targetDirR == true){\n\t\t\t\t//turn right\n\t\t\t\tif(targetTurnR2 == 0){\n\t\t\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\n\t\t\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t\t\t}else{\n\t\t\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\n\t\t\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tDebug.Log(\"Error with turn selection 2ln road\");\n\t\t\t\ttransform.GetComponent(aiStates).startAgain = true;\n\t\t\t}\n\t\t}\n\t\t\n\t//THREE LANE ROAD, POSITION A1\n\t}else if(coordOpt2 == 0 && coordOpt3 != 0){\n\t\trandomNum = Random.value * 10;\n\t\tif(targetDirF == true && randomNum < 6){\n\t\t\t//do nothing, go forward\n\t\t\tcalculatingMove = false;\n\t\t}else if(targetDirR == true){\n\t\t\t//turn right\n\t\t\tif(targetTurnR2 == 0){\n\t\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\n\t\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t\t}else{\n\t\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\n\t\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t\t}\n\t\t}else{\n\t\t\tif(targetDirF == true){\n\t\t\t\t//do nothing, go forward\n\t\t\t\tcalculatingMove = false;\n\t\t\t}else if(targetDirR == true){\n\t\t\t\t//turn right\n\t\t\t\tif(targetTurnR2 == 0){\n\t\t\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\n\t\t\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t\t\t}else{\n\t\t\t\t\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\n\t\t\t\t\ttransform.GetComponent(aiStates).rightState = true;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tDebug.Log(\"Error with turn selection 3ln road\");\n\t\t\t\ttransform.GetComponent(aiStates).startAgain = true;\n\t\t\t}\n\t\t}\n\t\n\t//FOUR LANE ROAD, POSITION A1\n\t}else if(coordOpt3 == 0 && coordOpt2 != 0){\n\t\trandomNum = Random.value * 10;\n\t\tif(targetDirF == true && randomNum > 6){\n\t\t\t//do nothing, go forward\n\t\t\tcalculatingMove = false;\n\t\t}else if(targetDirL == true){\n\t\t\t//turn left\n\t\t\ttransform.GetComponent(aiStates).leftCoord = targetTurnL;\n\t\t\ttransform.GetComponent(aiStates).leftState = true;\n\t\t}else{\n\t\t\tif(targetDirF == true){\n\t\t\t\t//do nothing, go forward\n\t\t\t\tcalculatingMove = false;\n\t\t\t}else if(targetDirL == true){\n\t\t\t\t//turn left\n\t\t\t\ttransform.GetComponent(aiStates).leftCoord = targetTurnL;\n\t\t\t\ttransform.GetComponent(aiStates).leftState = true;\n\t\t\t}else{\n\t\t\t\tDebug.Log(\"Error with turn selection 4ln road\");\n\t\t\t\ttransform.GetComponent(aiStates).startAgain = true;\n\t\t\t}\n\t\t}\n\t\t\t\t\n\t//FIVE LANE ROAD, POSITION A1\n\t}else if(coordOpt2 != 0 && coordOpt3 != 0){\n\t\t//5ln road\n\t\t//MUST GO FORWARD\n\t\tcalculatingMove = false;\n\t\tif(targetDirF == false){\n\t\t\ttransform.GetComponent(aiStates).startAgain = true;\n\t\t}\n\t}\n}","rotateBasedOnPositionOfLetter( letter, oppositeDay ) {\n var index = this.positionOfLetter( this.target, letter );\n\n if (oppositeDay) {\n // rotate back left based on where the letter used to be. how?\n if (index === 0) {\n index = 1;\n } else if (index === 1) {\n index = 1;\n } else {\n index = 4;\n }\n this.rotateSteps(\"left\", index );\n\n } else {\n if (index >= 4) {\n index++;\n }\n index++;\n this.rotateSteps(\"right\", index );\n }\n }","function C012_AfterClass_Amanda_TestPunish() {\n\n\t// The more love, the less chances the player will be punished\n\tif (EventRandomChance(\"Love\")) {\n\t\tC012_AfterClass_Amanda_CheckNotes();\n\t} else {\n\t\tActorSetPose(\"Angry\");\n\t\tOverridenIntroText = \"\";\n\t\tC012_AfterClass_Amanda_CurrentStage = 3900;\n\t}\n\n}","moveCheck(direction, originalLocation) {\n const { dispatch } = this.props;\n let newLocationId;\n let newLocation;\n if(direction == \"north\") {\n newLocationId = originalLocation - 1;\n newLocation = this.props.currentLevel[newLocationId];\n if(newLocationId >= 0 && newLocation.value !== 'W') {\n return newLocationId;\n } else if (newLocation.isEnemy !== '' || newLocation.isProjectile || newLocation.value === 'L') {\n let knockBackDirection = this.reverseDirection(direction);\n dispatch(actions.knockBack(originalLocation, knockBackDirection));\n return false;\n } else {\n return false;\n }\n } else if (direction == \"east\") {\n newLocationId = originalLocation + 10;\n newLocation = this.props.currentLevel[newLocationId];\n if(newLocationId <= 100 && newLocation.value !== 'W') {\n return newLocationId;\n } else if (newLocation.isEnemy !== '' || newLocation.isProjectile || newLocation.value === 'L') {\n let knockBackDirection = this.reverseDirection(direction);\n dispatch(actions.knockBack(originalLocation, knockBackDirection));\n return false;\n } else {\n return false;\n }\n } else if (direction == \"south\") {\n newLocationId = originalLocation + 1;\n newLocation = this.props.currentLevel[newLocationId];\n if(newLocationId > 0 && newLocationId <= 100 && originalLocation % 10 !== 0 && newLocation.value !== 'W') {\n return newLocationId;\n } else if (newLocation.isEnemy !== '' || newLocation.isProjectile || newLocation.value === 'L') {\n let knockBackDirection = this.reverseDirection(direction);\n dispatch(actions.knockBack(originalLocation, knockBackDirection));\n return false;\n } else {\n return false;\n }\n } else if (direction == \"west\") {\n newLocationId = originalLocation - 10;\n newLocation = this.props.currentLevel[newLocationId];\n if(newLocationId >= 0 && newLocation.value !== 'W') {\n return newLocationId;\n } else if (newLocation.isEnemy !== '' || newLocation.isProjectile || newLocation.value === 'L') {\n let knockBackDirection = this.reverseDirection(direction);\n dispatch(actions.knockBack(originalLocation, knockBackDirection));\n return false;\n } else {\n return false;\n }\n }\n }","function change_direction(){\n\tvar lastx = snake_array[snake_array.length-1].x;\n\tvar lasty = snake_array[snake_array.length-1].y;\n\tsnake_array[0] = {x: lastx, y: lasty, color: \"black\"};\n\tvar tail = snake_array.shift();\n\tif(d === \"left\"){\n\t\tsnake_array.push(tail);\n\t\tsnake_array[snake_array.length-1].x--;\n\t}\n\telse if(d === \"right\"){\n\t\tsnake_array.push(tail);\n\t\tsnake_array[snake_array.length-1].x++;\n\t}\n\telse if(d === \"up\"){\n\t\tsnake_array.push(tail);\n\t\tsnake_array[snake_array.length-1].y--;\n\t}\n\telse if(d === \"down\"){\n\t\tsnake_array.push(tail);\n\t\tsnake_array[snake_array.length-1].y++;\n\t}\n\thitItself(snake_array[snake_array.length-1]);\n\thitTheWall(snake_array[snake_array.length-1]);\n\tpaint_snake();\n\teat();\n\t// console.log(snake_array[snake_array.length - 1]);\n\n}","function rePosition(){\r\n piece.pos.y = 0; // this and next line puts the next piece at the top centered\r\n piece.pos.x = ( (arena[0].length / 2) | 0) - ( (piece.matrix[0].length / 2) | 0);\r\n }","if (move.endsWith(\"'\")) {\n // three turns\n completedRotation = -NINETY_DEGREES;\n }","returnToLastPos() {\n if (this.previousPos) {\n this.x = this.previousPos.x\n this.y = this.previousPos.y\n }\n }","returnFromRight() {\r\n this.fltire.rotateY(16);\r\n this.frtire.rotateY(16);\r\n }","moveRight() {\n\n if (this.posX <= 670 && pause == false)\n this.posX = this.posX + 5;\n }","function checkIfEatenR() {\n // Thanks Jeremy.\n //paintFood(Math.random()*300,Math.random()*300,\"blue\")\n // This works: moveRight() == paintFood(235,10,\"blue\")\n //moveRight == paintFood(235,10,\"blue\")\n \n if ( moveRight() == paintFood(235,10) ){\n console.log(\"Food updated.\")\n updateFood();\n console.log(\"Next food.\");\n nextFood();\n }\n}","function updateSnakeMovement() {\n let newPos = {x: snake.history[0].x, y: snake.history[0].y};\n toBeClearedFields.push(snake.history.pop());\n if (command !== null) {\n switch (command) {\n case \"LEFT\":\n newPos.x--;\n break;\n case \"UP\":\n newPos.y--;\n break;\n case \"RIGHT\":\n newPos.x++;\n break;\n case \"DOWN\":\n newPos.y++;\n break;\n }\n }\n snake.history.unshift(newPos);\n }","function decideSlideBead(beadSpot){ \n let x;\n spot = beadChecker(\"left\", \"left\");\n if (beadSpot === spot && canClick){\n moveBead(\"right\"); \n } else {\n spot= beadChecker(\"right\", \"right\"); \n if (beadSpot === spot && canClick){\n moveBead(\"left\"); \n }\n }\n}","resetState() {\n this._movements = 0;\n }","function stare() {\n\t\ttry {\n\t\t\tmoveEye(\".tally_eye_left\", \"stare\");\n\t\t\tmoveEye(\".tally_eye_right\", \"stare\");\n\t\t\tsetTimeout(function() {\n\t\t\t\tfollowCursor = true;\n\t\t\t}, 400);\n\t\t} catch (err) {\n\t\t\tconsole.error(err);\n\t\t}\n\t}","offscreen() {\n if (this.xpos < -this.width) {\n return true;\n } else {\n return false;\n }\n }","upgradePionToDameAdverse(posRow, colorPion, tailleDamier){\n let dame = false;\n if(colorPion == this.couleurJoueur){\n if(posRow == 0){\n dame = true;\n }\n } else {\n if(posRow+1 == tailleDamier){\n dame = true;\n }\n }\n return dame;\n }","reverseFinished() {\n return (this.y < height / 2 + 0.5 && this.y > height / 2 - 0.5) || (this.x < width / 2 + 0.5 && this.x > width / 2 - 0.5)\n }","function MoveNoteDown(noteIndex) {\n if (noteIndex > stateVars.itemArray.length - 2) {\n return;\n }\n\n var newNoteArray = [];\n if (stateVars.itemArray != null) {\n newNoteArray = stateVars.itemArray;\n }\n\n var placeholder = newNoteArray[noteIndex + 1];\n newNoteArray[noteIndex + 1] = newNoteArray[noteIndex];\n newNoteArray[noteIndex] = placeholder;\n\n setStateVars((prevState) => {\n return ({\n ...prevState,\n noteArray: newNoteArray,\n promptNewNote: false,\n editNoteIndex: noteIndex + 1,\n requireUpdate: true\n });\n });\n }","function MoveDown()\n{\n mrRat.direction = 'down';\n\n if (gameData[mrRat.y + 1][mrRat.x] >= 10)\n {\n //The rat eats a cheese\n if (gameData[mrRat.y + 1][mrRat.x] === 12) {\n EatsCheese(false);\n }\n\n //The rats eats a random cheese\n if (gameData[mrRat.y + 1][mrRat.x] === 15) {\n EatsCheese(true);\n }\n\n //The rat hits the rat poison or rat trap\n if (gameData[mrRat.y + 1][mrRat.x] === 16 || gameData[mrRat.y + 1][mrRat.x] === 13) {\n TheRatDied();\n }\n\n gameData[mrRat.y][mrRat.x] = _GROUND;\n mrRat.y = mrRat.y + 1;\n gameData[mrRat.y][mrRat.x] = _RAT;\n\n //MrRat has reached the gool\n if (mrRat.x == 18 && mrRat.y == 14) {\n Goal();\n return;\n }\n\n DeleteMap();\n DrawMap();\n }\n}","posZahtMet()\n {\n this.posZah=!this.posZah;\n }","async reverse() {\n this.tl.pause();\n this.angle = 100;\n this._playShieldBounceSound();\n\n await gsap.to(this, {\n x: -50,\n y: 'random(-50,50)',\n duration: 1,\n });\n }","Smotion(desloc)\n\t{\n\t\t// If the key A is pressed then moves the vehicle backward and turn left\n\t\tif (this.keysdirectionPress[0]){\n\t\t\tthis.angleDirection -= desloc/5;\n\t\t\tthis.position[2] -= desloc*Math.cos(this.angleDirection);\n\t\t\tthis.position[0] += desloc*Math.sin(this.angleDirection);\n\n\t\t\t// If the next position is out of limits or has altimetry other than 0 then revert the movement\n\t\t\tif ( ! this.checkNextPosition(this.position[0],this.position[2])){\n\t\t\t\tthis.angleDirection += desloc/5;\n\t\t\t\tthis.position[2] += desloc*Math.cos(this.angleDirection);\n\t\t\t\tthis.position[0] -= desloc*Math.sin(this.angleDirection);\n\t\t\t}\n\t\t\tthis.frontLeftWheel.update(desloc,5);\n\t\t\tthis.frontRightWheel.update(-desloc,5);\n\t\t\tthis.backLeftWheel.update(desloc,0);\n\t\t\tthis.backRightWheel.update(-desloc,0);\n\t\t} else \n\t\t\t// If the key D is pressed then moves the vehicle backward and turn rigth\n\t\t\tif (this.keysdirectionPress[1]){\n\t\t\t\tthis.angleDirection += desloc/5;\n\t\t\t\tthis.position[2] -= desloc*Math.cos(this.angleDirection);\n\t\t\t\tthis.position[0] += desloc*Math.sin(this.angleDirection);\n\n\t\t\t\t// If the next position is out of limits or has altimetry other than 0 then revert the movement\n\t\t\t\tif ( ! this.checkNextPosition(this.position[0],this.position[2])){\n\t\t\t\t\tthis.angleDirection -= desloc/5;\n\t\t\t\t\tthis.position[2] += desloc*Math.cos(this.angleDirection);\n\t\t\t\t\tthis.position[0] -= desloc*Math.sin(this.angleDirection);\n\t\t\t\t}\n\t\t\t\tthis.frontLeftWheel.update(desloc,-5);\n\t\t\t\tthis.frontRightWheel.update(-desloc,-5);\n\t\t\t\tthis.backLeftWheel.update(desloc,0);\n\t\t\t\tthis.backRightWheel.update(-desloc,0);\n\t\t\t}\n\n\t\t// If only key W is pressed then moves the vehicle backward straight\n\t\tif ( !(this.keysdirectionPress[0] || this.keysdirectionPress[1]) ){\n\t\t\tthis.position[2] -= desloc*Math.cos(this.angleDirection);\n\t\t\tthis.position[0] += desloc*Math.sin(this.angleDirection);\n\n\t\t\t// If the next position is out of limits or has altimetry other than 0 then revert the movement\n\t\t\tif ( ! this.checkNextPosition(this.position[0],this.position[2])){\n\t\t\t\tthis.position[2] += desloc*Math.cos(this.angleDirection);\n\t\t\t\tthis.position[0] -= desloc*Math.sin(this.angleDirection);\n\t\t\t}\n\t\t\tthis.frontLeftWheel.update(desloc,0);\n\t\t\tthis.frontRightWheel.update(-desloc,0);\n\t\t\tthis.backLeftWheel.update(desloc,0);\n\t\t\tthis.backRightWheel.update(-desloc,0);\n\t\t}\n\t}","function test21() {\n reset();\n e = {key: 'z', preventDefault: function() {}}\n downkey(e)\n let swapCurr = copyPiece(currentPiece)\n let swapHeld = copyPiece(heldPiece)\n downkey(e)\n return currentPiece.equals(swapCurr) && heldPiece.equals(swapHeld);\n}","static MoveTowards() {}","hasStarted () {\r\n return Boolean(this._pastPos[this._pastPos.length-1])\r\n }","get true_position() { return this.position.copy().rotateX(Ribbon.LATITUDE).rotateZ(Earth.rotation).rotateZ(Ribbon.LONGITUDE); }","function movementLogic(ant) {\n if(grid[ant.x][ant.y] == 0) {\n ant.turnRight();\n grid[ant.x][ant.y] = 1;\n } else if (grid[ant.x][ant.y] == 1) {\n ant.turnLeft();\n grid[ant.x][ant.y] = 0;\n }\n stroke(color(255 * grid[ant.x][ant.y]));\n ant.moveForward();\n point(ant.x ,ant.y);\n}","function answer(e) {\n clearInterval(counter);\n let y = e.path[1];\n let x = parseInt(e.path[1].dataset.num);\n if (x === currentQuote) {\n correct(y);\n } else {\n wrong(y);\n }\n }","function moveRight() {\n undraw()\n const reachedRightEdge = curT.some(index => (curPos + index) % width === width - 1)\n if (!reachedRightEdge) curPos += 1\n if (curT.some(index => squares[curPos + index].classList.contains('taken'))) {\n // if the position has been taken by another figure, push the tetromino back\n curPos -= 1 \n }\n draw()\n }","noteOff(pitch) {\n this.keys[pitch].noteOff()\n }","function frame() {\n console.log(\"zaim\");\n if (pos == z) {\n clearInterval(id);\n } else {\n pos--; \n //elem.style.top = pos + 'px'; \n elemt.style.left = pos+\"px\"; \n x=pos;\n //console.log(`avancer pos ${tos}`);\n }\n }","function test20() {\n reset();\n let origCurr = copyPiece(currentPiece)\n heldPiece = getRandomPiece()\n let origHeld = copyPiece(heldPiece)\n e = {key: 'z', preventDefault: function() {}}\n downkey(e)\n return heldPiece.equals(origCurr) && currentPiece.equals(origHeld)\n}","handleToggle(type, cursorToEnd, oldState) {\n const { noteTracker, tr, markType } = this;\n const { $cursor, from, to } = tr.selection;\n\n if ($cursor) {\n const note = this.currentNote;\n if (note) {\n const { start, end } = note;\n return this.removeRanges([{ from: start, to: end }]);\n } else if (this.hasPlaceholder(oldState)) {\n return tr.removeStoredMark(markType);\n }\n return this.startNote(type);\n } else {\n const note = noteTracker.noteCoveringRange(from, to, true);\n if (note) {\n const { start, end, meta } = note;\n\n const notes = [];\n notes.push({\n from: start,\n to: from,\n meta: cloneDeep(meta),\n });\n\n // If this is a not of a different type then split add it in\n // the middle\n if (note.meta.type && note.meta.type !== type) {\n notes.push({\n from,\n to,\n meta: {\n type,\n },\n });\n }\n\n notes.push({\n from: to,\n to: end,\n meta: cloneDeep(meta),\n });\n\n return this.rebuildRange(\n {\n from: start,\n to: end,\n },\n notes\n );\n }\n return this.addNotes([{ from, to, meta: { type } }], cursorToEnd);\n }\n }","move(predicate) {\n //console.log(predicate);\n const moveBy = this.moveMap[this.state.heading];\n // console.log(moveBy);\n const nextPos = { x: this.state.pos.x, y: this.state.pos.y };\n //console.log(nextPos);\n // Set next position\n nextPos[moveBy.plane] += moveBy.amount;\n\n // Check if move is legal\n const isLegal = predicate(nextPos);\n\n if (isLegal) {\n this.state.pos = nextPos;\n }\n }","function toggleState (state) {\n scope.ytModel.open = state\n scope.ytModel.active = true\n return scope.ytModel.moveX = state ? boundary : 0\n }","function moveRight()\r\n {\r\n undraw()\r\n const isAtRightEdge = currentTetromino.some(index => (currentPosition + index) % 10 === 9)\r\n\r\n if(!isAtRightEdge)\r\n currentPosition +=1\r\n if(currentTetromino.some(index => squares[currentPosition + index].classList.contains('taken')))\r\n currentPosition -= 1\r\n draw()\r\n }","function swapDown(state) {\n let blankPOS = findBlankCell(state)\n return swap(state, { y: blankPOS.y + 1, x: blankPOS.x })\n}","function encloseLeftState(){\n if(shipY < 0){\n shipY = 0;\n }\n if(shipY > height - 50){\n shipY = height - 50;\n }\n if(shipX < 0){\n shipX = 0;\n }\n}","lookAt(target) {\n let orientation = (target.x - this.x < 0) ? 'left' : 'right';\n this.setOrientation(orientation);\n }","function changeDirection(e) {\n if (e.keyCode == 37) {\n direction = 0;\n console.log(\"direction is left:\" + direction);\n updateSnakeList();\n } else if (e.keyCode == 38) {\n direction = 1;\n console.log(\"direction is up:\" + direction)\n } else if (e.keyCode == 39) {\n direction = 2;\n console.log(\"direction is right :\" + direction)\n } else if (e.keyCode == 40) {\n direction = 3;\n console.log(\"direction is down :\" + direction)\n }\n }"],"string":"[\n \"backToPosition() {\\n while (this.current_position != this.position) {\\n this.closeDoors();\\n if (this.current_position > this.position) {\\n this.moveDown();\\n console.log(this.current_position);\\n } else if (this.current_position < this.position) {\\n this.moveUp();\\n }\\n console.log(this.current_position);\\n }\\n this.openDoors = true;\\n }\",\n \"function handleReversedCoordinates(){\\n if (complexScope.aLeftUpper > complexScope.aRightBottom) {\\n complexScope.changer = complexScope.aLeftUpper;\\n complexScope.aLeftUpper = complexScope.aRightBottom;\\n complexScope.aRightBottom = complexScope.changer;\\n // if you create the new area from right to left\\n }\\n if (complexScope.bLeftUpper < complexScope.bRightBottom) {\\n complexScope.changer = complexScope.bLeftUpper;\\n complexScope.bLeftUpper = complexScope.bRightBottom;\\n complexScope.bRightBottom = complexScope.changer;\\n // if you create the new area from right to left\\n }\\n }\",\n \"eat(pos) {\\n \\tvar x = this.frame.x;\\n var y = this.frame.y;\\n if(x == pos.x && y == pos.y) {\\n return true;\\n }\\n return false;\\n }\",\n \"function updateFoodAcquiredState(){\\n if(snake.history[0].x === food.x && snake.history[0].y === food.y){\\n $(\\\"#success\\\").get(0).play();\\n points = points + 10;\\n $(\\\"#points\\\").html(points);\\n snake.history.unshift({x:snake.history[0].x,y:snake.history[0].y});\\n toBeClearedFields.push(food);\\n food.x = Math.floor(Math.random() * size);\\n food.y = Math.floor(Math.random() * size);\\n }\\n }\",\n \"markOff(){\\n this.room.unmarkPosition(this.positionX, this.positionY);\\n }\",\n \"eoi() { return this.pos==this.end }\",\n \"function inPosA2() {\\n\\trandomNum = Random.value * 10;\\n\\n\\tif(targetDirF == true && randomNum < 6){\\n\\t\\t//do nothing, go forward\\n\\t\\tcalculatingMove = false;\\n\\t}else if(targetDirR == true){\\n\\t\\t//turn right\\n\\t\\tif(targetTurnR2 == 0){\\n\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\\n\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t}else{\\n\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\\n\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t}\\n\\t}else{\\n\\t\\tif(targetDirF == true){\\n\\t\\t\\t//do nothing, go forward\\n\\t\\t\\tcalculatingMove = false;\\n\\t\\t}else if(targetDirR == true){\\n\\t\\t\\t//turn right\\n\\t\\t\\tif(targetTurnR2 == 0){\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tDebug.Log(\\\"Error with turn selection, position A2\\\");\\n\\t\\t\\ttransform.GetComponent(aiStates).startAgain = true;\\n\\t\\t}\\n\\t}\\n}\",\n \"eat(pos){\\n let x = this.body[this.body.length-1].x\\n let y = this.body[this.body.length-1].y\\n if (x == pos.x && y == pos.y){\\n this.grow();\\n return true;\\n }\\n else{\\n false;\\n }\\n }\",\n \"click(e, position) {\\n\\t/*check if the positon in state.position is empty, else alert invalid*/\\n if (this.state.positions[position] == \\\"\\\") {\\n this.state.positions.splice(position, 1, this.state.toggle);\\n this.setState({ positions: this.state.positions });\\n this.winner()\\n if (this.state.toggle == \\\"x\\\") {\\n this.setState({ toggle: \\\"o\\\" })\\n } else {\\n this.setState({ toggle: \\\"x\\\" })\\n };\\n } else { alert(\\\"invalid\\\") }\\n }\",\n \"function goBackward(rover) {\\n switch (rover.direction) {\\n case 'N':\\n rover.position[0]--\\n break;\\n case 'E':\\n rover.position[1]--\\n break;\\n case 'S':\\n rover.position[0]++\\n break;\\n case 'W':\\n rover.position[1]++\\n break;\\n };\\n\\t\\tconsole.log(\\\"New Rover Position: [\\\" + rover.position[0] + \\\", \\\" + rover.position[1] + \\\"]\\\")\\n}\",\n \"function check_arrow(event){\\r\\n\\r\\n const LEFT_KEY = 37;\\r\\n const RIGHT_KEY = 39;\\r\\n const UP_KEY = 38;\\r\\n const DOWN_KEY = 40;\\r\\n\\r\\n if(changing_direction) return;\\r\\n changing_direction = true;\\r\\n const keyPressed = event.keyCode;\\r\\n // Use this to check if the snake is moving in the reverse side\\r\\n const goingUp = dy === -10;\\r\\n const goingDown = dy === 10;\\r\\n const goingRight = dx === 10;\\r\\n const goingLeft = dx === -10;\\r\\n\\r\\n if(keyPressed === LEFT_KEY && !goingRight){\\r\\n dx = -10;\\r\\n dy = 0;\\r\\n }\\r\\n\\r\\n if(keyPressed === RIGHT_KEY && !goingLeft){\\r\\n dx = 10;\\r\\n dy = 0;\\r\\n }\\r\\n\\r\\n if(keyPressed === UP_KEY && !goingDown){\\r\\n dx = 0;\\r\\n dy = -10;\\r\\n }\\r\\n\\r\\n if(keyPressed === DOWN_KEY && !goingUp){\\r\\n dx = 0;\\r\\n dy = 10;\\r\\n }\\r\\n}\",\n \"function noteOff(noteNumber) { }\",\n \"function checkForTrick(trickEndPosition : Vector3)\\n\\t{\\n\\t\\tvar xDifference : float = 0;\\n\\t\\t\\n\\t\\txDifference = trickEndPosition.x - trickStartPosition.x;\\n\\t\\t\\n\\t\\tif(xDifference < -180 || xDifference > 180)//they did a flip\\n\\t\\t{\\n\\t\\t\\tvar didATrick : String = \\\"hi\\\";\\n\\t\\t\\txDifference = 2;\\n\\t\\t}\\n\\t\\t\\n\\t\\ttrickStartPosition = new Vector3(0,0,0);\\n\\t}\",\n \"function downPropogate(){\\n newPosition = ghostPosition + options[3]\\n newGhostDirection = directions[3]\\n if (!canMove()) {\\n let randomIndex = Math.floor(Math.random()*2)+1\\n newPosition = ghostPosition + options[randomIndex]\\n newGhostDirection = directions[randomIndex]\\n if (!canMove()){\\n randomIndex = (randomIndex===1) ? 2:1\\n newPosition = ghostPosition + options[randomIndex]\\n newGhostDirection = directions[randomIndex]\\n if (!canMove()){\\n newPosition = ghostPosition + options[0]\\n newGhostDirection = directions[0]\\n }\\n }\\n }\\n }\",\n \"function encloseRightState(){\\n if(shipY < 0){\\n shipY = 0;\\n }\\n if(shipY > height - 50){\\n shipY = height - 50;\\n }\\n if(shipX > width - 40){\\n shipX = width - 40;\\n }\\n}\",\n \"moveForward () {\\n let posAux = Object.assign({}, this.position);\\n switch (this.position.orientation) {\\n case 'N':\\n this.position.column++;\\n break;\\n case 'S':\\n this.position.column--;\\n break;\\n case 'E':\\n this.position.row--;\\n break;\\n case 'W':\\n this.position.row++;\\n break;\\n default:\\n break;\\n }\\n this.isLost(posAux);\\n }\",\n \"function outOfSight(){\\n\\t\\tif(snakeArr[0].x>99&¤tMove=='r'){\\n\\t\\t\\treturn 'rightExcede';\\n\\t\\t}\\n\\t\\telse if(snakeArr[0].x<0&¤tMove=='l'){\\n\\t\\t\\treturn 'leftExcede';\\n\\t\\t}\\n\\t\\telse if(snakeArr[0].y>45.5&¤tMove=='b'){\\n\\t\\t\\treturn 'bottomExcede';\\n\\t\\t}\\n\\t\\telse if(snakeArr[0].y<0&¤tMove=='t'){\\n\\t\\t\\treturn 'topExcede';\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\",\n \"winner(){\\n const msg = \\\" Winner is: \\\" + this.state.toggle;\\n /*check from the central position */\\n if(this.state.positions[4]!==\\\"\\\"){\\n if(this.state.positions[0]===this.state.positions[4] && this.state.positions[4]===this.state.positions[8]||\\n this.state.positions[2]===this.state.positions[4] && this.state.positions[4]===this.state.positions[6]||\\n this.state.positions[1]===this.state.positions[4] && this.state.positions[4]===this.state.positions[7]||\\n this.state.positions[3]===this.state.positions[4] && this.state.positions[4]===this.state.positions[5]\\n ){\\n alert(msg)\\n this.setState({positions:[\\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\"]});\\n this.setState({toggle:\\\"x\\\"});\\n }\\n /*check from the inicial position */\\n \\t}else if(this.state.positions[0]!==\\\"\\\"){\\n \\tif(this.state.positions[1]===this.state.positions[0] && this.state.positions[0]===this.state.positions[2]||\\n this.state.positions[3]===this.state.positions[0] && this.state.positions[0]===this.state.positions[6]\\n \\t){\\n alert(msg);\\n this.setState({positions:[\\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\"]});\\n this.setState({toggle:\\\"x\\\"});\\n \\t}\\n \\t/*check from the last position */\\n \\t}else if(this.state.positions[8]!==\\\"\\\")\\n \\tif(this.state.positions[2]===this.state.positions[8] && this.state.positions[8]===this.state.positions[5]||\\n this.state.positions[6]===this.state.positions[8] && this.state.positions[8]===this.state.positions[7]\\n \\t){\\n alert(msg);\\n this.setState({positions:[\\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\"]});\\n this.setState({toggle:\\\"x\\\"});\\n \\t}\\n }\",\n \"function trackbackAlternations(originalPos, newPos) {\\n var vp = getMaskSet()[\\\"validPositions\\\"][newPos],\\n targetLocator = vp.locator,\\n tll = targetLocator.length;\\n\\n for (var ps = originalPos; ps < newPos; ps++) {\\n if (!isMask(ps)) {\\n var tests = getTests(ps),\\n bestMatch = tests[0], equality = -1;\\n $.each(tests, function (ndx, tst) {\\n for (var i = 0; i < tll; i++) {\\n if (tst.locator[i] && checkAlternationMatch(tst.locator[i].toString().split(','), targetLocator[i].toString().split(',')) && equality < i) {\\n equality = i;\\n bestMatch = tst;\\n }\\n }\\n });\\n setValidPosition(ps, $.extend({}, bestMatch, { \\\"input\\\": bestMatch[\\\"match\\\"].def }), true)\\n }\\n }\\n }\",\n \"function updateState(pos) {\\n if ('NEWS'.indexOf(pos.val) > -1) {\\n bender.direction = pos.val;\\n }\\n else if (pos.val === 'B') {\\n bender.breaker = !bender.breaker;\\n }\\n else if (pos.val === 'X') {\\n board[pos.row][pos.col] = ' ';\\n }\\n else if (pos.val === 'I') {\\n bender.pattern = bender.pattern.split('').reverse().join('');\\n }\\n else if (pos.val === 'T') {\\n teleport();\\n }\\n }\",\n \"if (!game.inEditorMode) {\\n // revert pos\\n this.pos = lastPos;\\n }\",\n \"tellPositionInFrontY(){\\n switch(this.orientation){\\n case 0:\\n return this.positionY - 1;\\n case 2:\\n return this.positionY + 1;\\n }\\n return this.positionY;\\n }\",\n \"function trackbackAlternations(originalPos, newPos) {\\n\\t\\t\\t\\tvar vp = getMaskSet().validPositions[newPos];\\n\\t\\t\\t\\tif (vp) {\\n\\t\\t\\t\\t\\tvar targetLocator = vp.locator,\\n\\t\\t\\t\\t\\t\\ttll = targetLocator.length;\\n\\n\\t\\t\\t\\t\\tfor (var ps = originalPos; ps < newPos; ps++) {\\n\\t\\t\\t\\t\\t\\tif (getMaskSet().validPositions[ps] === undefined && !isMask(ps, true)) {\\n\\t\\t\\t\\t\\t\\t\\tvar tests = getTests(ps).slice(),\\n\\t\\t\\t\\t\\t\\t\\t\\tbestMatch = determineTestTemplate(tests, true),\\n\\t\\t\\t\\t\\t\\t\\t\\tequality = -1;\\n\\t\\t\\t\\t\\t\\t\\tif (tests[tests.length - 1].match.def === \\\"\\\") tests.pop();\\n\\t\\t\\t\\t\\t\\t\\t$.each(tests, function (ndx, tst) { //find best matching\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (var i = 0; i < tll; i++) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (tst.locator[i] !== undefined && checkAlternationMatch(tst.locator[i].toString().split(\\\",\\\"), targetLocator[i].toString().split(\\\",\\\"), tst.na)) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (equality < i) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tequality = i;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbestMatch = tst;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//check if alternationIndex is closer then the current bestmatch\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tvar targetAI = targetLocator[i],\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbestMatchAI = bestMatch.locator[i],\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttstAI = tst.locator[i];\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif ((targetAI - bestMatchAI) > Math.abs(targetAI - tstAI)) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbestMatch = tst;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\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\\tbestMatch = $.extend({}, bestMatch, {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\\"input\\\": getPlaceholder(ps, bestMatch.match, true) || bestMatch.match.def\\n\\t\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\t\\tbestMatch.generatedInput = true;\\n\\t\\t\\t\\t\\t\\t\\tsetValidPosition(ps, bestMatch, true);\\n\\t\\t\\t\\t\\t\\t\\t//revalidate the new position to update the locator value\\n\\t\\t\\t\\t\\t\\t\\tgetMaskSet().validPositions[newPos] = undefined;\\n\\t\\t\\t\\t\\t\\t\\t_isValid(newPos, vp.input, true);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"function reactionReverse () {\\n direction = -direction; // Stromrichtung umkehren\\n reset(); // Ausgangsstellung\\n }\",\n \"function elongateTopNote(noteIndex)\\n{\\n if(topNoteBlocks[noteIndex]){\\n var newTop = - fallDownSpeed;\\n topNoteBlocks[noteIndex].style.top = newTop;\\n }\\n \\n}\",\n \"function C012_AfterClass_Amanda_CheckNotes() {\\n\\tif (((ActorGetValue(ActorCloth) == \\\"\\\") || (ActorGetValue(ActorCloth) == \\\"Clothed\\\") || (ActorGetValue(ActorCloth) == \\\"Pajamas\\\")) && !ActorHasInventory(\\\"Collar\\\") && !ActorIsRestrained() && !ActorIsGagged()) ActorSetPose(\\\"CheckNotes\\\");\\n\\tLeaveIcon = \\\"Leave\\\";\\n}\",\n \"function flip(mark) {\\nif (mark ==\\\"X\\\")\\n return 'O';\\nreturn 'X';\\n}\",\n \"function gameLogic() {\\n\\n // Check if pressed direction is opposite of current direction\\n var isReverseDir =\\n (nextDir === Directions.UP && snakeDir === Directions.DOWN) ||\\n (nextDir === Directions.DOWN && snakeDir === Directions.UP) ||\\n (nextDir === Directions.RIGHT && snakeDir === Directions.LEFT) ||\\n (nextDir === Directions.LEFT && snakeDir === Directions.RIGHT);\\n\\n // Change snake dir only if pressed direction is not reverse\\n if (!isReverseDir) {\\n snakeDir = nextDir;\\n }\\n\\n var oldHead = snake[0]; // Get the position of the head\\n \\n // Position new head depending on snake direction\\n if (snakeDir === Directions.UP)\\n var newHead = { x: oldHead.x, y: oldHead.y - 1 };\\n else if (snakeDir === Directions.DOWN)\\n var newHead = { x: oldHead.x, y: oldHead.y + 1 };\\n else if (snakeDir === Directions.LEFT)\\n var newHead = { x: oldHead.x - 1, y: oldHead.y };\\n else if (snakeDir === Directions.RIGHT)\\n var newHead = { x: oldHead.x + 1, y: oldHead.y };\\n\\n // Add the new head to the front of snake \\n snake.unshift(newHead)\\n \\n // Check if food is eaten\\n var ateFood = newHead.x === food.x && newHead.y === food.y;\\n\\n if (ateFood) { // If the food is eaten then reposition food randomly\\n food = {\\n x: (Math.random() * 40) | 0,\\n y: (Math.random() * 40) | 0\\n };\\n } else { \\n // Remove the last part of the snake - this moves the snake\\n // if food is eaten then we skip this part. This is how the \\n // snake grows.\\n snake.pop();\\n }\\n\\n // Check if snake is dead\\n var isDead = false; // initial value\\n // Check if newHead is on any other snake part\\n for (var i = 1; i < snake.length; i++) {\\n if (newHead.x === snake[i].x && newHead.y === snake[i].y) {\\n isDead = true;\\n break;\\n }\\n }\\n\\n\\n // Check if snake is out of bounds\\n if (newHead.x < 0 || newHead.y < 0 || newHead.x >= 40 || newHead.y >= 40) {\\n isDead = true;\\n }\\n\\n // Stop the game if player is dead\\n if (isDead) gameRunning = false;\\n}\",\n \"function trackbackAlternations(originalPos, newPos) {\\n\\t var vp = getMaskSet().validPositions[newPos],\\n\\t\\t\\t\\t\\t\\ttargetLocator = vp.locator,\\n\\t\\t\\t\\t\\t\\ttll = targetLocator.length;\\n\\n\\t for (var ps = originalPos; ps < newPos; ps++) {\\n\\t if (getMaskSet().validPositions[ps] === undefined && !isMask(ps, true)) {\\n\\t var tests = getTests(ps),\\n\\t\\t\\t\\t\\t\\t\\t\\tbestMatch = tests[0],\\n\\t\\t\\t\\t\\t\\t\\t\\tequality = -1;\\n\\t $.each(tests, function (ndx, tst) { //find best matching\\n\\t for (var i = 0; i < tll; i++) {\\n\\t if (tst.locator[i] !== undefined && checkAlternationMatch(tst.locator[i].toString().split(\\\",\\\"), targetLocator[i].toString().split(\\\",\\\"))) {\\n\\t if (equality < i) {\\n\\t equality = i;\\n\\t bestMatch = tst;\\n\\t }\\n\\t } else break;\\n\\t }\\n\\t });\\n\\t setValidPosition(ps, $.extend({}, bestMatch, {\\n\\t \\\"input\\\": bestMatch.match.placeholder || bestMatch.match.def\\n\\t }), true);\\n\\t }\\n\\t }\\n\\t }\",\n \"function C012_AfterClass_Amanda_SetPose() {\\n\\tif (((ActorGetValue(ActorCloth) == \\\"\\\") || (ActorGetValue(ActorCloth) == \\\"Clothed\\\")) && !ActorIsRestrained() && !ActorIsGagged()) {\\n\\t\\tvar Love = ActorGetValue(ActorLove);\\n\\t\\tvar Sub = ActorGetValue(ActorSubmission);\\n\\t\\tif ((Sub <= -10) && (Math.abs(Sub) >= Math.abs(Love))) ActorSetPose(\\\"Point\\\");\\n\\t\\tif ((Sub >= 10) && (Math.abs(Sub) >= Math.abs(Love))) ActorSetPose(\\\"Shy\\\");\\n\\t\\tif ((Love >= 10) && (Math.abs(Love) >= Math.abs(Sub))) ActorSetPose(\\\"Love\\\");\\n\\t\\tif ((Love <= -10) && (Math.abs(Love) >= Math.abs(Sub))) ActorSetPose(\\\"Angry\\\");\\n\\t\\tif (Common_ActorIsOwned) ActorSetPose(\\\"Shy\\\");\\n\\t} else {\\n\\t\\tif ((ActorGetValue(ActorCloth) == \\\"Naked\\\") && !ActorIsRestrained() && !ActorIsGagged() && (ActorGetValue(ActorSubmission) >= 10)) ActorSetPose(\\\"Shy\\\");\\n\\t\\tif ((ActorGetValue(ActorCloth) == \\\"Pajamas\\\") && !ActorIsRestrained() && !ActorIsGagged() && (ActorGetValue(ActorLove) >= 10)) ActorSetPose(\\\"Happy\\\");\\n\\t\\telse ActorSetPose(\\\"\\\");\\n\\t}\\n}\",\n \"function ELdown(){\\n console.log(\\\"In eyes l arrow clicked\\\");\\n eyes.destroy();\\n eyeindex--;\\n if(eyeindex<=0)\\n {\\n eyeindex = 0;\\n eyes = game.add.image(970, 235, images.eyes[eyeindex].name);\\n eyes.scale.setTo(0.1);\\n be = bb.create(550, 55, images.eyes[eyeindex].name);\\n be.scale.setTo(0.1);\\n }\\n else if (eyeindex >= images.eyes.length)\\n {\\n eyeindex = images.eyes.length -1;\\n eyes = game.add.image(970, 235, images.eyes[eyeindex].name);\\n eyes.scale.setTo(0.1);\\n be = bb.create(550, 55, images.eyes[eyeindex].name);\\n be.scale.setTo(0.1);\\n }\\n else\\n {\\n eyes = game.add.image(970, 235, images.eyes[eyeindex].name);\\n eyes.scale.setTo(0.1);\\n be = bb.create(550, 55, images.eyes[eyeindex].name);\\n be.scale.setTo(0.1);\\n }\\n player.appearance.head.eye = images.eyes[eyeindex].name;\\n\\n}\",\n \"isTonic(note) {\\n return (note % 12) == this.offset();\\n }\",\n \"function C012_AfterClass_Amanda_TestLove() {\\n\\tif (!ActorIsGagged()) {\\n\\t\\tif (!ActorIsRestrained() && !Common_PlayerRestrained) {\\n\\t\\t\\tif (!Common_PlayerNaked && (ActorGetValue(ActorCloth) != \\\"Naked\\\")) {\\n\\t\\t\\t\\tif (ActorGetValue(ActorLove) >= 20) {\\n\\t\\t\\t\\t\\tActorSetPose(\\\"\\\");\\n\\t\\t\\t\\t\\tC012_AfterClass_Amanda_CurrentStage = 100;\\n\\t\\t\\t\\t\\tOverridenIntroText = \\\"\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else OverridenIntroText = GetText(\\\"CantDateWhileNaked\\\");\\n\\t\\t} else OverridenIntroText = GetText(\\\"CantDateWhileRestrained\\\");\\n\\t} else C012_AfterClass_Amanda_GaggedAnswer();\\n}\",\n \"function testCase(pos) {\\n switch (pos) {\\n case 0:\\n thisPos = {Location: 'now', lng: 121.5552137, ret: 25.0851076};\\n break;\\n case 1:\\n thisPos = {Location: 'now', lng: 121.5536283, ret: 25.0926443};\\n break;\\n case 2:\\n thisPos = {Location: 'now', lng: 121.5575088, ret: 25.1077731};\\n break;\\n }\\n gmap.onPositionChange();\\n}\",\n \"function offCourse() {\\n getCurrentPosition().then(function (position) {\\n if (!routeExists()) {\\n return;\\n }\\n var startPoint = turf.point([position.coords.longitude, position.coords.latitude]);\\n var nextRoutePoint = turf.along(currentRoute.geom, currentRoute.stepped + stepLengthMiles, 'miles');\\n var currentBearing = turf.bearing(startPoint, nextRoutePoint);\\n var bearing = currentBearing + 90;\\n if (bearing > 180) {\\n bearing -= 360;\\n }\\n var reroutePoint = turf.destination(startPoint, stepLengthMiles * 2, bearing, 'miles');\\n $rootScope.$broadcast(events.positionOffCourse, reroutePoint);\\n });\\n }\",\n \"getPosition(absState) {\\n return absState % (this._w + 1);\\n }\",\n \"function resetFood(){\\n //to ensure the food position is not on surrent snake/resetPos\\n function isFoodPosOK(x,y){\\n //not on snake0\\n for (var i = 0; i < snakes[0].body.length; i++){\\n if (x == snakes[0].body[i][0] && y == snakes[0].body[i][1])\\n return false;\\n }\\n //not on snake1\\n for (var i = 0; i < snakes[1].body.length; i++){\\n if (x == snakes[1].body[i][0] && y == snakes[1].body[i][1])\\n return false;\\n }\\n return true;\\n }\\n \\n //update position\\n var x = Math.floor(Math.random()*18)+1;\\n var y = Math.floor(Math.random()*18)+1;\\n while (!isFoodPosOK(x,y)){\\n x = Math.floor(Math.random()*18)+1;\\n y = Math.floor(Math.random()*18)+1;\\n } \\n foodPos = [x,y,0];\\n }\",\n \"function calculateDirectionToMoveAndUpdatePosition() {\\n var NS, EW;\\n\\n if (TY < LY) {\\n NS = 'S';\\n TY += 1;\\n }\\n else if (TY > LY) {\\n NS = 'N';\\n TY -= 1;\\n }\\n else {\\n NS = '';\\n }\\n\\n if (TX < LX) {\\n EW = 'E';\\n TX += 1;\\n }\\n else if (TX > LX) {\\n EW = 'W';\\n TX -= 1;\\n }\\n else {\\n EW = '';\\n }\\n\\n return NS+EW;\\n }\",\n \"function is_eating(w) {\\n $rt_addContract(w, cd4e49798d42ac5a95f1a8edbd8ed8c01c, \\\"motion.ts(68,27)\\\");\\n return (w.food).equals(w.snake.segs.x);\\n }\",\n \"function resetSnake(i){\\n //ensure reset position is not on the other sname nor on food\\n function isSnakePosOK(x,y){\\n //not on the other snake\\n for (var k = 0; k < snakes[1-i].body.length; k++){\\n if ((x == snakes[1-i].body[k][0] || x-1 == snakes[1-i].body[k][0] || x-2 == snakes[1-i].body[k][0]) && y == snakes[1-i].body[k][1])\\n return false; \\n }\\n //not on food\\n if ((x == foodPos[0] || x-1 == foodPos[0] || x-2 == foodPos[0]) && y == foodPos[1])\\n return false;\\n return true;\\n }\\n \\n //update point\\n if (i==0) {\\n point = 0;\\n document.getElementById(\\\"point\\\").innerHTML = point;\\n }\\n else {\\n cpoint = 0;\\n document.getElementById(\\\"cpoint\\\").innerHTML = cpoint;\\n }\\n\\n //update position\\n var x = Math.floor(Math.random()*15)+3;\\n var y = Math.floor(Math.random()*18)+1;\\n while (!isSnakePosOK(x,y)){\\n x = Math.floor(Math.random()*15)+3;\\n y = Math.floor(Math.random()*18)+1;\\n } \\n snakes[i].body = [[x,y,0],[x-1,y,0],[x-2,y,0]];\\n snakes[i].direction=[\\\"right\\\", \\\"right\\\"];\\n }\",\n \"function moveBackward(rover){\\n console.log(`----${rover.name}----`);\\n console.log(\\\"moveBackward was called\\\");\\n switch (rover.direction) {\\n case 'N':\\n if (rover.y < 9) {\\n rover.y++;\\n if (rover1.x === rover2.x && rover1.y === rover2.y) {\\n rover.y--\\n console.log(`There is an other Rover at (${rover.x},${rover.y+1}). Change your way!`);\\n } else if (grid[rover.y][rover.x] === o) {\\n rover.y--;\\n console.log(`There is an ${o} at (${rover.x},${rover.y+1}). Change your way!`)\\n }\\n } else {\\n console.log(\\\"canceled command, you are on the grid limit!\\\");\\n }\\n break;\\n case 'W':\\n if (rover.x < 9) {\\n rover.x++;\\n if (rover1.x === rover2.x && rover1.y === rover2.y) {\\n rover.x--\\n console.log(`There is an other Rover at (${rover.x+1},${rover.y}). Change your way!`);\\n } else if (grid[rover.y][rover.x] === o) {\\n rover.x--;\\n console.log(`There is an ${o} at (${rover.x+1},${rover.y}). Change your way!`)\\n }\\n } else {\\n console.log(\\\"canceled command, you are on the grid limit!\\\");\\n }\\n break;\\n case 'S':\\n if (rover.y > 0) {\\n rover.y--;\\n if (rover1.x === rover2.x && rover1.y === rover2.y) {\\n rover.y++\\n console.log(`There is an other Rover at (${rover.x},${rover.y-1}). Change your way!`);\\n } else if (grid[rover.y][rover.x] === o) {\\n rover.y++;\\n console.log(`There is an ${o} at (${rover.x},${rover.y-1}). Change your way!`)\\n }\\n } else {\\n console.log(\\\"canceled command, you are on the grid limit!\\\");\\n }\\n break;\\n case 'E':\\n if (rover.x > 0) {\\n rover.x--;\\n if (rover1.x === rover2.x && rover1.y === rover2.y) {\\n rover.x++\\n console.log(`There is an other Rover at (${rover.x-1},${rover.y}). Change your way!`);\\n } else if (grid[rover.y][rover.x] === o) {\\n rover.x++;\\n console.log(`There is an ${o} at (${rover.x-1},${rover.y}). Change your way!`)\\n }\\n } else {\\n console.log(\\\"canceled command, you are on the grid limit!\\\");\\n }\\n break;\\n }\\n console.log(`Direction: ${rover.direction}`);\\n console.log(`Position: (${rover.x},${rover.y})`);\\n rover.travelLog.push({x: rover.x, y: rover.y});\\n}\",\n \"reoderQuestion(up = true) {\\n const {questionId, answerId} = this.props;\\n up ? this.moveUp(questionId, answerId) : this.moveDown(questionId, answerId);\\n }\",\n \"function moveDown() {\\n undraw(); //undraw tetromino\\n currentPosition += width; //change reference point to one row down\\n draw(); //draw the tetromino \\n freeze(); \\n }\",\n \"function stepApplyNewPosition () {\\n\\t\\tvar state={\\n\\t\\t\\t\\tediting: false,\\n\\t\\t\\t\\tnode: false,\\n\\t\\t\\t\\tdata: {\\n\\t\\t\\t\\t\\tx: 0,\\n\\t\\t\\t\\t\\ty: 0,\\n\\t\\t\\t\\t\\trotate: 0,\\n\\t\\t\\t\\t\\tscale: 0\\n\\t\\t\\t\\t}\\n\\t\\t },\\n\\t\\tconfig= {\\n\\t\\t\\trotateStep: 3,\\n\\t\\t\\tscaleStep: 1,\\n\\t\\t\\tmoveStep: 50\\n\\t\\t },\\n\\t\\tdefaults= {\\n\\t\\t\\tx: 0,\\n\\t\\t\\ty: 0,\\n\\t\\t\\trotate: 0,\\n\\t\\t\\tscale: 1\\n\\t\\t };\\n\\t\\t \\n\\t /* $('body').on('mousedown','.step',function(e){\\n\\t\\tstate.editing=true;\\n\\t\\tstate.node=$(this);\\n\\t\\tstate.node.fadeTo(0.6);\\n\\t\\t});\\n\\t\\t\\n\\t $('body').on('mouseup','.step',function(e){\\n\\t\\tstate.editing=false;\\n\\t\\tvar $t=$(this);\\n\\t\\t$t.fadeTo(1);\\n\\t\\t});\\n\\t*/\\t\\n\\t\\tstate.editing=true;\\n\\t\\tstate.node=$(this);\\n\\t\\t\\n\\t\\tif(state.editing){\\n\\t\\t var $t=state.node;\\n\\t\\t for(var i in state.data){\\n\\t\\t\\tvar tmp=$t.attr('data-'+i);\\n\\t\\t\\tif(tmp===''){tmp=defaults[i]}\\n\\t\\t\\tstate.data[i]= ~~(tmp);\\n\\t\\t\\t}\\n\\t\\t\\t//console.log(['before...',state.data,state.node[0]]);\\n\\t\\t \\n\\t\\t switch(e.which){\\n\\t\\t\\tcase 113: //q\\n\\t\\t\\t state.data.rotate-=config.rotateStep;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 119: //w\\n\\t\\t\\t state.data.y-=config.moveStep;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 101: //e\\n\\t\\t\\t state.data.rotate+=config.rotateStep;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 97: //a\\n\\t\\t\\t state.data.x-=config.moveStep;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 115: //s\\n\\t\\t\\t state.data.y+=config.moveStep;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 100: //d\\n\\t\\t\\t state.data.x+=config.moveStep;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 122: //z\\n\\t\\t\\t state.data.scale+=config.scaleStep;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 120: //x\\n\\t\\t\\t state.data.scale-=config.scaleStep;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t \\n\\t\\t\\tdefault:\\n\\t\\t\\t console.log(e.which);\\n\\t\\t\\t \\n\\t\\t\\t //yeah, I know, but it looks better when it's here\\n\\t\\t\\t break;\\n\\t\\t \\n\\t\\t \\n\\t\\t\\t}\\n\\t\\t //console.log(['done...',state.data,state.node[0]]);\\n\\t\\t //reapply all. damn slow \\n\\t\\t for(var i in state.data){\\n\\t\\t\\t$t.attr('data-'+i,state.data[i]);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t window['--drawSlideGlobalHandler'](state.node[0],'whatever')\\n\\t\\t\\t\\n\\t\\t }\\n\\t}\",\n \"function flip(mark) {\\n if (mark ==\\\"X\\\")\\n return 'O';\\n return 'X';\\n}\",\n \"checkCheatNotes() {\\n let cheatKey = true\\n let cheatTouch = true\\n for (let posIdx = 1; posIdx <= this.noteToShow; posIdx++) {\\n cheatKey = cheatKey && this.key.isDownVisually(this.key.pos[posIdx])\\n }\\n for (let posIdx = 1; posIdx <= this.noteToShow; posIdx++) {\\n cheatTouch = cheatTouch && this.touch.isDownVisually(this.touch.pos[posIdx])\\n }\\n\\n return cheatKey || cheatTouch\\n }\",\n \"function palmPosition(hand, index) {\\n if (!isLocked) {\\n lateralTracking(hand.palmPosition[0]);\\n }\\n // console.log(hand);\\n }\",\n \"noteOff() {\\n this.keyRect.fill(this.displayOptions.color);\\n grid.highlightPitch(this.pitch, false, this.displayOptions);\\n audio.noteOff(this.pitch)\\n }\",\n \"invertDirectionRandom() {\\n let hasInverted = false;\\n if (Math.random() < 0.5) {\\n let temp = this.deltaY;\\n this.deltaY = this.deltaX;\\n this.deltaX = temp;\\n hasInverted = true;\\n }\\n if (Math.random() < 0.5) {\\n this.deltaX = -this.deltaX;\\n hasInverted = true;\\n }\\n if (Math.random() < 0.5) {\\n this.deltaY = -this.deltaY;\\n hasInverted = true;\\n }\\n if (!hasInverted) {\\n this.invertDirection();\\n }\\n this.updateHitboxes();\\n }\",\n \"function onSnake(position){\\n for (var i = 0; i < snake.length; ++i){ //Iterates through the snake\\n if (position.x == snake[i].x && position.y == snake[i].y) { //if position of x & y is the same as the position of the snake x and y\\n return true;\\n }\\n }\\n return false; //Default false\\n}\",\n \"function trash_down(trashy) {\\n //trashy handles the movement of elements with the CSS atrributes\\n var trash_current_top = parseInt(trashy.css('top'));\\n var trash_current_bottom = parseInt(trashy.css('bottom'));\\n var trash_current_left = parseInt(trashy.css('left'));\\n var rb_area_height = parseInt(rb_area.height());\\n var trash_in = rb_area_height-(rb_area_height*0.4); //.4 of the trash is inside the RB\\n var trash_away = rb_area_height-(rb_area_height*0.7);//.7 of the trash is inside the RB\\n \\n setGameDimension();\\n \\n if(ft){ //sets the position of the first trash, \\n var new_lane_pos = 0;\\n var first_trash=Math.floor(Math.random() * max_lane);\\n new_lane_pos = recycle_bins_container.dumpsters[first_trash].rb_coordinates;\\n laneTracker = first_trash;\\n trashy.css('left', new_lane_pos);\\n ft=false;\\n }\\n \\n \\n //document.getElementById(\\\"myoutput\\\").innerHTML = \\\"GW: \\\"+ container_width + \\\" RB1:<i>\\\"+recycle_bins_container.dumpsters[0].rb_coordinates + \\\"</i> RB2:<i>\\\"+recycle_bins_container.dumpsters[1].rb_coordinates + \\\"</i> RB3:<i>\\\"+recycle_bins_container.dumpsters[2].rb_coordinates + \\\"</i> RB4:<i>\\\"+recycle_bins_container.dumpsters[3].rb_coordinates+\\\"</i>\\\";\\n //document.getElementById(\\\"myoutput2\\\").innerHTML = \\\"L: \\\"+ trash_current_left + \\\" Speed: \\\"+speed +\\\" CL: \\\"+laneTracker+\\\" RBH: \\\"+rb_area_height +\\\" RBW:\\\"+ $(\\\"#image-rb-1\\\").width() +\\\" B: \\\"+ trash_current_bottom +\\\" T: \\\"+ trash_current_top;\\n \\n //635 this is near the RB \\n if (parseInt(trashy.css('top'))>=container_height){ \\n speed = 1;\\n trash_info_status = true; //now it needs change because it has reached the RB... //I think I don't need this\\n } \\n if (trash_current_bottom <= trash_in && my_collision == false) {\\n //trash bottom possition vs Recycle Bins Heights \\n //once this validation has been done, then it won't be possible to move the trash! #todo\\n my_collision = true;\\n collision();\\n\\n }\\n if (trash_current_bottom <= trash_away) {\\n trash_current_top = -100;\\n my_collision = false;\\n trashy.css('left', newLane());//here is where the new Y position is being defined...\\n nextTrash(); //sets the next current trash values\\n }\\n trashy.css('top', trash_current_top + speed); //this is what moves trash down.:\\n }\",\n \"function C012_AfterClass_Jennifer_TestLove() {\\n\\tif (!ActorIsGagged()) {\\n\\t\\tif (!ActorIsRestrained() && !Common_PlayerRestrained) {\\n\\t\\t\\tif (!Common_PlayerNaked && (ActorGetValue(ActorCloth) != \\\"Naked\\\")) {\\n\\t\\t\\t\\tif (ActorGetValue(ActorLove) >= 20) {\\n\\t\\t\\t\\t\\tActorSetPose(\\\"\\\");\\n\\t\\t\\t\\t\\tC012_AfterClass_Jennifer_CurrentStage = 100;\\n\\t\\t\\t\\t\\tOverridenIntroText = \\\"\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else OverridenIntroText = GetText(\\\"CantDateWhileNaked\\\");\\n\\t\\t} else OverridenIntroText = GetText(\\\"CantDateWhileRestrained\\\");\\n\\t} else C012_AfterClass_Jennifer_GaggedAnswer();\\n}\",\n \"moveDown() {\\n this.y<332?this.y+=83:false;\\n }\",\n \"function checkPosition() {\\n // Für Ameise Schwarz\\n for (let i = 0; i < Sem.ant.length; i++) {\\n let a = Sem.ant[i];\\n // Wenn Ameisen Position auf X - Achse zwischen 567 & 750 \\n if (a.x >= 567 && a.x <= 750) {\\n // Wenn Ameisen Position auf Y - Achse zwischen 245 & 429\\n if (a.y >= 245 && a.y <= 429) {\\n // Ruft Funktion für Game Over Screen auf\\n gameLost();\\n }\\n }\\n }\\n // Für Ameise Braun\\n for (let i = 0; i < Sem.antBrown.length; i++) {\\n let b = Sem.antBrown[i];\\n // Wenn Ameisen Position auf X - Achse zwischen 567 & 750\\n if (b.x >= 567 && b.x <= 750) {\\n // Wenn Ameisen Position auf Y - Achse zwischen 245 & 429\\n if (b.y >= 245 && b.y <= 429) {\\n // Ruft Funktion für Game Over Screen auf\\n gameLost();\\n }\\n }\\n }\\n // Für Ameise Rot\\n for (let i = 0; i < Sem.antRed.length; i++) {\\n let r = Sem.antRed[i];\\n // Wenn Ameisen Position auf X - Achse zwischen 567 & 750\\n if (r.x >= 567 && r.x <= 750) {\\n // Wenn Ameisen Position auf Y - Achse zwischen 245 & 429\\n if (r.y >= 245 && r.y <= 429) {\\n // Ruft Funktion für Game Over Screen auf\\n gameLost();\\n }\\n }\\n }\\n }\",\n \"function checkPosition(){\\n if (i > (data.omicron.length - 1)) {\\n i = 0;\\n } else if (i < 0) {\\n i = (data.omicron.length - 1);\\n }\\n }\",\n \"function inPosA1() {\\n\\t//TWO LANE ROAD, POSITION A1\\n\\tif(coordOpt2 == 0 && coordOpt3 == 0){\\n\\t\\trandomNum = Random.value * 10;\\n\\t\\tif(targetDirF == true && randomNum <= 3){\\n\\t\\t\\t//do nothing, go forward\\n\\t\\t\\tcalculatingMove = false;\\n\\t\\t}else if(targetDirL == true && randomNum > 3 && randomNum <= 6){\\n\\t\\t\\t//turn left\\n\\t\\t\\ttransform.GetComponent(aiStates).leftCoord = targetTurnL;\\n\\t\\t\\ttransform.GetComponent(aiStates).leftState = true;\\n\\t\\t}else if(targetDirR == true && randomNum > 6){\\n\\t\\t\\t//turn right\\n\\t\\t\\tif(targetTurnR2 == 0){\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\t//if none of the above, take first available option\\n\\t\\t\\tif(targetDirF == true){\\n\\t\\t\\t\\t//do nothing, go forward\\n\\t\\t\\t\\tcalculatingMove = false;\\n\\t\\t\\t}else if(targetDirL == true){\\n\\t\\t\\t\\t//turn left\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).leftCoord = targetTurnL;\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).leftState = true;\\n\\t\\t\\t}else if(targetDirR == true){\\n\\t\\t\\t\\t//turn right\\n\\t\\t\\t\\tif(targetTurnR2 == 0){\\n\\t\\t\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\\n\\t\\t\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\\n\\t\\t\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tDebug.Log(\\\"Error with turn selection 2ln road\\\");\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).startAgain = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t//THREE LANE ROAD, POSITION A1\\n\\t}else if(coordOpt2 == 0 && coordOpt3 != 0){\\n\\t\\trandomNum = Random.value * 10;\\n\\t\\tif(targetDirF == true && randomNum < 6){\\n\\t\\t\\t//do nothing, go forward\\n\\t\\t\\tcalculatingMove = false;\\n\\t\\t}else if(targetDirR == true){\\n\\t\\t\\t//turn right\\n\\t\\t\\tif(targetTurnR2 == 0){\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tif(targetDirF == true){\\n\\t\\t\\t\\t//do nothing, go forward\\n\\t\\t\\t\\tcalculatingMove = false;\\n\\t\\t\\t}else if(targetDirR == true){\\n\\t\\t\\t\\t//turn right\\n\\t\\t\\t\\tif(targetTurnR2 == 0){\\n\\t\\t\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR1;\\n\\t\\t\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\ttransform.GetComponent(aiStates).rightCoord = targetTurnR2;\\n\\t\\t\\t\\t\\ttransform.GetComponent(aiStates).rightState = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tDebug.Log(\\\"Error with turn selection 3ln road\\\");\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).startAgain = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\n\\t//FOUR LANE ROAD, POSITION A1\\n\\t}else if(coordOpt3 == 0 && coordOpt2 != 0){\\n\\t\\trandomNum = Random.value * 10;\\n\\t\\tif(targetDirF == true && randomNum > 6){\\n\\t\\t\\t//do nothing, go forward\\n\\t\\t\\tcalculatingMove = false;\\n\\t\\t}else if(targetDirL == true){\\n\\t\\t\\t//turn left\\n\\t\\t\\ttransform.GetComponent(aiStates).leftCoord = targetTurnL;\\n\\t\\t\\ttransform.GetComponent(aiStates).leftState = true;\\n\\t\\t}else{\\n\\t\\t\\tif(targetDirF == true){\\n\\t\\t\\t\\t//do nothing, go forward\\n\\t\\t\\t\\tcalculatingMove = false;\\n\\t\\t\\t}else if(targetDirL == true){\\n\\t\\t\\t\\t//turn left\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).leftCoord = targetTurnL;\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).leftState = true;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tDebug.Log(\\\"Error with turn selection 4ln road\\\");\\n\\t\\t\\t\\ttransform.GetComponent(aiStates).startAgain = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\t\\t\\n\\t//FIVE LANE ROAD, POSITION A1\\n\\t}else if(coordOpt2 != 0 && coordOpt3 != 0){\\n\\t\\t//5ln road\\n\\t\\t//MUST GO FORWARD\\n\\t\\tcalculatingMove = false;\\n\\t\\tif(targetDirF == false){\\n\\t\\t\\ttransform.GetComponent(aiStates).startAgain = true;\\n\\t\\t}\\n\\t}\\n}\",\n \"rotateBasedOnPositionOfLetter( letter, oppositeDay ) {\\n var index = this.positionOfLetter( this.target, letter );\\n\\n if (oppositeDay) {\\n // rotate back left based on where the letter used to be. how?\\n if (index === 0) {\\n index = 1;\\n } else if (index === 1) {\\n index = 1;\\n } else {\\n index = 4;\\n }\\n this.rotateSteps(\\\"left\\\", index );\\n\\n } else {\\n if (index >= 4) {\\n index++;\\n }\\n index++;\\n this.rotateSteps(\\\"right\\\", index );\\n }\\n }\",\n \"function C012_AfterClass_Amanda_TestPunish() {\\n\\n\\t// The more love, the less chances the player will be punished\\n\\tif (EventRandomChance(\\\"Love\\\")) {\\n\\t\\tC012_AfterClass_Amanda_CheckNotes();\\n\\t} else {\\n\\t\\tActorSetPose(\\\"Angry\\\");\\n\\t\\tOverridenIntroText = \\\"\\\";\\n\\t\\tC012_AfterClass_Amanda_CurrentStage = 3900;\\n\\t}\\n\\n}\",\n \"moveCheck(direction, originalLocation) {\\n const { dispatch } = this.props;\\n let newLocationId;\\n let newLocation;\\n if(direction == \\\"north\\\") {\\n newLocationId = originalLocation - 1;\\n newLocation = this.props.currentLevel[newLocationId];\\n if(newLocationId >= 0 && newLocation.value !== 'W') {\\n return newLocationId;\\n } else if (newLocation.isEnemy !== '' || newLocation.isProjectile || newLocation.value === 'L') {\\n let knockBackDirection = this.reverseDirection(direction);\\n dispatch(actions.knockBack(originalLocation, knockBackDirection));\\n return false;\\n } else {\\n return false;\\n }\\n } else if (direction == \\\"east\\\") {\\n newLocationId = originalLocation + 10;\\n newLocation = this.props.currentLevel[newLocationId];\\n if(newLocationId <= 100 && newLocation.value !== 'W') {\\n return newLocationId;\\n } else if (newLocation.isEnemy !== '' || newLocation.isProjectile || newLocation.value === 'L') {\\n let knockBackDirection = this.reverseDirection(direction);\\n dispatch(actions.knockBack(originalLocation, knockBackDirection));\\n return false;\\n } else {\\n return false;\\n }\\n } else if (direction == \\\"south\\\") {\\n newLocationId = originalLocation + 1;\\n newLocation = this.props.currentLevel[newLocationId];\\n if(newLocationId > 0 && newLocationId <= 100 && originalLocation % 10 !== 0 && newLocation.value !== 'W') {\\n return newLocationId;\\n } else if (newLocation.isEnemy !== '' || newLocation.isProjectile || newLocation.value === 'L') {\\n let knockBackDirection = this.reverseDirection(direction);\\n dispatch(actions.knockBack(originalLocation, knockBackDirection));\\n return false;\\n } else {\\n return false;\\n }\\n } else if (direction == \\\"west\\\") {\\n newLocationId = originalLocation - 10;\\n newLocation = this.props.currentLevel[newLocationId];\\n if(newLocationId >= 0 && newLocation.value !== 'W') {\\n return newLocationId;\\n } else if (newLocation.isEnemy !== '' || newLocation.isProjectile || newLocation.value === 'L') {\\n let knockBackDirection = this.reverseDirection(direction);\\n dispatch(actions.knockBack(originalLocation, knockBackDirection));\\n return false;\\n } else {\\n return false;\\n }\\n }\\n }\",\n \"function change_direction(){\\n\\tvar lastx = snake_array[snake_array.length-1].x;\\n\\tvar lasty = snake_array[snake_array.length-1].y;\\n\\tsnake_array[0] = {x: lastx, y: lasty, color: \\\"black\\\"};\\n\\tvar tail = snake_array.shift();\\n\\tif(d === \\\"left\\\"){\\n\\t\\tsnake_array.push(tail);\\n\\t\\tsnake_array[snake_array.length-1].x--;\\n\\t}\\n\\telse if(d === \\\"right\\\"){\\n\\t\\tsnake_array.push(tail);\\n\\t\\tsnake_array[snake_array.length-1].x++;\\n\\t}\\n\\telse if(d === \\\"up\\\"){\\n\\t\\tsnake_array.push(tail);\\n\\t\\tsnake_array[snake_array.length-1].y--;\\n\\t}\\n\\telse if(d === \\\"down\\\"){\\n\\t\\tsnake_array.push(tail);\\n\\t\\tsnake_array[snake_array.length-1].y++;\\n\\t}\\n\\thitItself(snake_array[snake_array.length-1]);\\n\\thitTheWall(snake_array[snake_array.length-1]);\\n\\tpaint_snake();\\n\\teat();\\n\\t// console.log(snake_array[snake_array.length - 1]);\\n\\n}\",\n \"function rePosition(){\\r\\n piece.pos.y = 0; // this and next line puts the next piece at the top centered\\r\\n piece.pos.x = ( (arena[0].length / 2) | 0) - ( (piece.matrix[0].length / 2) | 0);\\r\\n }\",\n \"if (move.endsWith(\\\"'\\\")) {\\n // three turns\\n completedRotation = -NINETY_DEGREES;\\n }\",\n \"returnToLastPos() {\\n if (this.previousPos) {\\n this.x = this.previousPos.x\\n this.y = this.previousPos.y\\n }\\n }\",\n \"returnFromRight() {\\r\\n this.fltire.rotateY(16);\\r\\n this.frtire.rotateY(16);\\r\\n }\",\n \"moveRight() {\\n\\n if (this.posX <= 670 && pause == false)\\n this.posX = this.posX + 5;\\n }\",\n \"function checkIfEatenR() {\\n // Thanks Jeremy.\\n //paintFood(Math.random()*300,Math.random()*300,\\\"blue\\\")\\n // This works: moveRight() == paintFood(235,10,\\\"blue\\\")\\n //moveRight == paintFood(235,10,\\\"blue\\\")\\n \\n if ( moveRight() == paintFood(235,10) ){\\n console.log(\\\"Food updated.\\\")\\n updateFood();\\n console.log(\\\"Next food.\\\");\\n nextFood();\\n }\\n}\",\n \"function updateSnakeMovement() {\\n let newPos = {x: snake.history[0].x, y: snake.history[0].y};\\n toBeClearedFields.push(snake.history.pop());\\n if (command !== null) {\\n switch (command) {\\n case \\\"LEFT\\\":\\n newPos.x--;\\n break;\\n case \\\"UP\\\":\\n newPos.y--;\\n break;\\n case \\\"RIGHT\\\":\\n newPos.x++;\\n break;\\n case \\\"DOWN\\\":\\n newPos.y++;\\n break;\\n }\\n }\\n snake.history.unshift(newPos);\\n }\",\n \"function decideSlideBead(beadSpot){ \\n let x;\\n spot = beadChecker(\\\"left\\\", \\\"left\\\");\\n if (beadSpot === spot && canClick){\\n moveBead(\\\"right\\\"); \\n } else {\\n spot= beadChecker(\\\"right\\\", \\\"right\\\"); \\n if (beadSpot === spot && canClick){\\n moveBead(\\\"left\\\"); \\n }\\n }\\n}\",\n \"resetState() {\\n this._movements = 0;\\n }\",\n \"function stare() {\\n\\t\\ttry {\\n\\t\\t\\tmoveEye(\\\".tally_eye_left\\\", \\\"stare\\\");\\n\\t\\t\\tmoveEye(\\\".tally_eye_right\\\", \\\"stare\\\");\\n\\t\\t\\tsetTimeout(function() {\\n\\t\\t\\t\\tfollowCursor = true;\\n\\t\\t\\t}, 400);\\n\\t\\t} catch (err) {\\n\\t\\t\\tconsole.error(err);\\n\\t\\t}\\n\\t}\",\n \"offscreen() {\\n if (this.xpos < -this.width) {\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"upgradePionToDameAdverse(posRow, colorPion, tailleDamier){\\n let dame = false;\\n if(colorPion == this.couleurJoueur){\\n if(posRow == 0){\\n dame = true;\\n }\\n } else {\\n if(posRow+1 == tailleDamier){\\n dame = true;\\n }\\n }\\n return dame;\\n }\",\n \"reverseFinished() {\\n return (this.y < height / 2 + 0.5 && this.y > height / 2 - 0.5) || (this.x < width / 2 + 0.5 && this.x > width / 2 - 0.5)\\n }\",\n \"function MoveNoteDown(noteIndex) {\\n if (noteIndex > stateVars.itemArray.length - 2) {\\n return;\\n }\\n\\n var newNoteArray = [];\\n if (stateVars.itemArray != null) {\\n newNoteArray = stateVars.itemArray;\\n }\\n\\n var placeholder = newNoteArray[noteIndex + 1];\\n newNoteArray[noteIndex + 1] = newNoteArray[noteIndex];\\n newNoteArray[noteIndex] = placeholder;\\n\\n setStateVars((prevState) => {\\n return ({\\n ...prevState,\\n noteArray: newNoteArray,\\n promptNewNote: false,\\n editNoteIndex: noteIndex + 1,\\n requireUpdate: true\\n });\\n });\\n }\",\n \"function MoveDown()\\n{\\n mrRat.direction = 'down';\\n\\n if (gameData[mrRat.y + 1][mrRat.x] >= 10)\\n {\\n //The rat eats a cheese\\n if (gameData[mrRat.y + 1][mrRat.x] === 12) {\\n EatsCheese(false);\\n }\\n\\n //The rats eats a random cheese\\n if (gameData[mrRat.y + 1][mrRat.x] === 15) {\\n EatsCheese(true);\\n }\\n\\n //The rat hits the rat poison or rat trap\\n if (gameData[mrRat.y + 1][mrRat.x] === 16 || gameData[mrRat.y + 1][mrRat.x] === 13) {\\n TheRatDied();\\n }\\n\\n gameData[mrRat.y][mrRat.x] = _GROUND;\\n mrRat.y = mrRat.y + 1;\\n gameData[mrRat.y][mrRat.x] = _RAT;\\n\\n //MrRat has reached the gool\\n if (mrRat.x == 18 && mrRat.y == 14) {\\n Goal();\\n return;\\n }\\n\\n DeleteMap();\\n DrawMap();\\n }\\n}\",\n \"posZahtMet()\\n {\\n this.posZah=!this.posZah;\\n }\",\n \"async reverse() {\\n this.tl.pause();\\n this.angle = 100;\\n this._playShieldBounceSound();\\n\\n await gsap.to(this, {\\n x: -50,\\n y: 'random(-50,50)',\\n duration: 1,\\n });\\n }\",\n \"Smotion(desloc)\\n\\t{\\n\\t\\t// If the key A is pressed then moves the vehicle backward and turn left\\n\\t\\tif (this.keysdirectionPress[0]){\\n\\t\\t\\tthis.angleDirection -= desloc/5;\\n\\t\\t\\tthis.position[2] -= desloc*Math.cos(this.angleDirection);\\n\\t\\t\\tthis.position[0] += desloc*Math.sin(this.angleDirection);\\n\\n\\t\\t\\t// If the next position is out of limits or has altimetry other than 0 then revert the movement\\n\\t\\t\\tif ( ! this.checkNextPosition(this.position[0],this.position[2])){\\n\\t\\t\\t\\tthis.angleDirection += desloc/5;\\n\\t\\t\\t\\tthis.position[2] += desloc*Math.cos(this.angleDirection);\\n\\t\\t\\t\\tthis.position[0] -= desloc*Math.sin(this.angleDirection);\\n\\t\\t\\t}\\n\\t\\t\\tthis.frontLeftWheel.update(desloc,5);\\n\\t\\t\\tthis.frontRightWheel.update(-desloc,5);\\n\\t\\t\\tthis.backLeftWheel.update(desloc,0);\\n\\t\\t\\tthis.backRightWheel.update(-desloc,0);\\n\\t\\t} else \\n\\t\\t\\t// If the key D is pressed then moves the vehicle backward and turn rigth\\n\\t\\t\\tif (this.keysdirectionPress[1]){\\n\\t\\t\\t\\tthis.angleDirection += desloc/5;\\n\\t\\t\\t\\tthis.position[2] -= desloc*Math.cos(this.angleDirection);\\n\\t\\t\\t\\tthis.position[0] += desloc*Math.sin(this.angleDirection);\\n\\n\\t\\t\\t\\t// If the next position is out of limits or has altimetry other than 0 then revert the movement\\n\\t\\t\\t\\tif ( ! this.checkNextPosition(this.position[0],this.position[2])){\\n\\t\\t\\t\\t\\tthis.angleDirection -= desloc/5;\\n\\t\\t\\t\\t\\tthis.position[2] += desloc*Math.cos(this.angleDirection);\\n\\t\\t\\t\\t\\tthis.position[0] -= desloc*Math.sin(this.angleDirection);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tthis.frontLeftWheel.update(desloc,-5);\\n\\t\\t\\t\\tthis.frontRightWheel.update(-desloc,-5);\\n\\t\\t\\t\\tthis.backLeftWheel.update(desloc,0);\\n\\t\\t\\t\\tthis.backRightWheel.update(-desloc,0);\\n\\t\\t\\t}\\n\\n\\t\\t// If only key W is pressed then moves the vehicle backward straight\\n\\t\\tif ( !(this.keysdirectionPress[0] || this.keysdirectionPress[1]) ){\\n\\t\\t\\tthis.position[2] -= desloc*Math.cos(this.angleDirection);\\n\\t\\t\\tthis.position[0] += desloc*Math.sin(this.angleDirection);\\n\\n\\t\\t\\t// If the next position is out of limits or has altimetry other than 0 then revert the movement\\n\\t\\t\\tif ( ! this.checkNextPosition(this.position[0],this.position[2])){\\n\\t\\t\\t\\tthis.position[2] += desloc*Math.cos(this.angleDirection);\\n\\t\\t\\t\\tthis.position[0] -= desloc*Math.sin(this.angleDirection);\\n\\t\\t\\t}\\n\\t\\t\\tthis.frontLeftWheel.update(desloc,0);\\n\\t\\t\\tthis.frontRightWheel.update(-desloc,0);\\n\\t\\t\\tthis.backLeftWheel.update(desloc,0);\\n\\t\\t\\tthis.backRightWheel.update(-desloc,0);\\n\\t\\t}\\n\\t}\",\n \"function test21() {\\n reset();\\n e = {key: 'z', preventDefault: function() {}}\\n downkey(e)\\n let swapCurr = copyPiece(currentPiece)\\n let swapHeld = copyPiece(heldPiece)\\n downkey(e)\\n return currentPiece.equals(swapCurr) && heldPiece.equals(swapHeld);\\n}\",\n \"static MoveTowards() {}\",\n \"hasStarted () {\\r\\n return Boolean(this._pastPos[this._pastPos.length-1])\\r\\n }\",\n \"get true_position() { return this.position.copy().rotateX(Ribbon.LATITUDE).rotateZ(Earth.rotation).rotateZ(Ribbon.LONGITUDE); }\",\n \"function movementLogic(ant) {\\n if(grid[ant.x][ant.y] == 0) {\\n ant.turnRight();\\n grid[ant.x][ant.y] = 1;\\n } else if (grid[ant.x][ant.y] == 1) {\\n ant.turnLeft();\\n grid[ant.x][ant.y] = 0;\\n }\\n stroke(color(255 * grid[ant.x][ant.y]));\\n ant.moveForward();\\n point(ant.x ,ant.y);\\n}\",\n \"function answer(e) {\\n clearInterval(counter);\\n let y = e.path[1];\\n let x = parseInt(e.path[1].dataset.num);\\n if (x === currentQuote) {\\n correct(y);\\n } else {\\n wrong(y);\\n }\\n }\",\n \"function moveRight() {\\n undraw()\\n const reachedRightEdge = curT.some(index => (curPos + index) % width === width - 1)\\n if (!reachedRightEdge) curPos += 1\\n if (curT.some(index => squares[curPos + index].classList.contains('taken'))) {\\n // if the position has been taken by another figure, push the tetromino back\\n curPos -= 1 \\n }\\n draw()\\n }\",\n \"noteOff(pitch) {\\n this.keys[pitch].noteOff()\\n }\",\n \"function frame() {\\n console.log(\\\"zaim\\\");\\n if (pos == z) {\\n clearInterval(id);\\n } else {\\n pos--; \\n //elem.style.top = pos + 'px'; \\n elemt.style.left = pos+\\\"px\\\"; \\n x=pos;\\n //console.log(`avancer pos ${tos}`);\\n }\\n }\",\n \"function test20() {\\n reset();\\n let origCurr = copyPiece(currentPiece)\\n heldPiece = getRandomPiece()\\n let origHeld = copyPiece(heldPiece)\\n e = {key: 'z', preventDefault: function() {}}\\n downkey(e)\\n return heldPiece.equals(origCurr) && currentPiece.equals(origHeld)\\n}\",\n \"handleToggle(type, cursorToEnd, oldState) {\\n const { noteTracker, tr, markType } = this;\\n const { $cursor, from, to } = tr.selection;\\n\\n if ($cursor) {\\n const note = this.currentNote;\\n if (note) {\\n const { start, end } = note;\\n return this.removeRanges([{ from: start, to: end }]);\\n } else if (this.hasPlaceholder(oldState)) {\\n return tr.removeStoredMark(markType);\\n }\\n return this.startNote(type);\\n } else {\\n const note = noteTracker.noteCoveringRange(from, to, true);\\n if (note) {\\n const { start, end, meta } = note;\\n\\n const notes = [];\\n notes.push({\\n from: start,\\n to: from,\\n meta: cloneDeep(meta),\\n });\\n\\n // If this is a not of a different type then split add it in\\n // the middle\\n if (note.meta.type && note.meta.type !== type) {\\n notes.push({\\n from,\\n to,\\n meta: {\\n type,\\n },\\n });\\n }\\n\\n notes.push({\\n from: to,\\n to: end,\\n meta: cloneDeep(meta),\\n });\\n\\n return this.rebuildRange(\\n {\\n from: start,\\n to: end,\\n },\\n notes\\n );\\n }\\n return this.addNotes([{ from, to, meta: { type } }], cursorToEnd);\\n }\\n }\",\n \"move(predicate) {\\n //console.log(predicate);\\n const moveBy = this.moveMap[this.state.heading];\\n // console.log(moveBy);\\n const nextPos = { x: this.state.pos.x, y: this.state.pos.y };\\n //console.log(nextPos);\\n // Set next position\\n nextPos[moveBy.plane] += moveBy.amount;\\n\\n // Check if move is legal\\n const isLegal = predicate(nextPos);\\n\\n if (isLegal) {\\n this.state.pos = nextPos;\\n }\\n }\",\n \"function toggleState (state) {\\n scope.ytModel.open = state\\n scope.ytModel.active = true\\n return scope.ytModel.moveX = state ? boundary : 0\\n }\",\n \"function moveRight()\\r\\n {\\r\\n undraw()\\r\\n const isAtRightEdge = currentTetromino.some(index => (currentPosition + index) % 10 === 9)\\r\\n\\r\\n if(!isAtRightEdge)\\r\\n currentPosition +=1\\r\\n if(currentTetromino.some(index => squares[currentPosition + index].classList.contains('taken')))\\r\\n currentPosition -= 1\\r\\n draw()\\r\\n }\",\n \"function swapDown(state) {\\n let blankPOS = findBlankCell(state)\\n return swap(state, { y: blankPOS.y + 1, x: blankPOS.x })\\n}\",\n \"function encloseLeftState(){\\n if(shipY < 0){\\n shipY = 0;\\n }\\n if(shipY > height - 50){\\n shipY = height - 50;\\n }\\n if(shipX < 0){\\n shipX = 0;\\n }\\n}\",\n \"lookAt(target) {\\n let orientation = (target.x - this.x < 0) ? 'left' : 'right';\\n this.setOrientation(orientation);\\n }\",\n \"function changeDirection(e) {\\n if (e.keyCode == 37) {\\n direction = 0;\\n console.log(\\\"direction is left:\\\" + direction);\\n updateSnakeList();\\n } else if (e.keyCode == 38) {\\n direction = 1;\\n console.log(\\\"direction is up:\\\" + direction)\\n } else if (e.keyCode == 39) {\\n direction = 2;\\n console.log(\\\"direction is right :\\\" + direction)\\n } else if (e.keyCode == 40) {\\n direction = 3;\\n console.log(\\\"direction is down :\\\" + direction)\\n }\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5747144","0.55379176","0.55339026","0.54902875","0.54773253","0.54693604","0.5463387","0.5449033","0.54478693","0.53943497","0.5390149","0.5382457","0.5367056","0.5353433","0.53518414","0.53282654","0.53261423","0.5319799","0.5306259","0.5305748","0.52875155","0.5286165","0.52837783","0.5275026","0.52733016","0.5268174","0.526177","0.525922","0.5254313","0.5248475","0.52469075","0.52418053","0.52103424","0.5184941","0.51804894","0.51761764","0.5174548","0.51647425","0.51303947","0.5128262","0.51270795","0.5122117","0.5121537","0.5119905","0.51164645","0.5109902","0.50918025","0.509092","0.5087641","0.50792366","0.5078407","0.5072986","0.50632167","0.50609475","0.50493586","0.5048017","0.50474924","0.5041004","0.5034936","0.5032151","0.50278157","0.50269586","0.50239575","0.50207615","0.50155824","0.50151163","0.501479","0.50132555","0.5002544","0.5001513","0.4998847","0.4997094","0.49882665","0.49850178","0.49820077","0.49814463","0.49796802","0.49757335","0.49738544","0.49728665","0.49683106","0.49570513","0.49540034","0.49539778","0.49491397","0.49467856","0.4938097","0.49362886","0.49349728","0.4934565","0.49329442","0.4932399","0.49281734","0.49267942","0.4922213","0.4919026"],"string":"[\n \"0.5747144\",\n \"0.55379176\",\n \"0.55339026\",\n \"0.54902875\",\n \"0.54773253\",\n \"0.54693604\",\n \"0.5463387\",\n \"0.5449033\",\n \"0.54478693\",\n \"0.53943497\",\n \"0.5390149\",\n \"0.5382457\",\n \"0.5367056\",\n \"0.5353433\",\n \"0.53518414\",\n \"0.53282654\",\n \"0.53261423\",\n \"0.5319799\",\n \"0.5306259\",\n \"0.5305748\",\n \"0.52875155\",\n \"0.5286165\",\n \"0.52837783\",\n \"0.5275026\",\n \"0.52733016\",\n \"0.5268174\",\n \"0.526177\",\n \"0.525922\",\n \"0.5254313\",\n \"0.5248475\",\n \"0.52469075\",\n \"0.52418053\",\n \"0.52103424\",\n \"0.5184941\",\n \"0.51804894\",\n \"0.51761764\",\n \"0.5174548\",\n \"0.51647425\",\n \"0.51303947\",\n \"0.5128262\",\n \"0.51270795\",\n \"0.5122117\",\n \"0.5121537\",\n \"0.5119905\",\n \"0.51164645\",\n \"0.5109902\",\n \"0.50918025\",\n \"0.509092\",\n \"0.5087641\",\n \"0.50792366\",\n \"0.5078407\",\n \"0.5072986\",\n \"0.50632167\",\n \"0.50609475\",\n \"0.50493586\",\n \"0.5048017\",\n \"0.50474924\",\n \"0.5041004\",\n \"0.5034936\",\n \"0.5032151\",\n \"0.50278157\",\n \"0.50269586\",\n \"0.50239575\",\n \"0.50207615\",\n \"0.50155824\",\n \"0.50151163\",\n \"0.501479\",\n \"0.50132555\",\n \"0.5002544\",\n \"0.5001513\",\n \"0.4998847\",\n \"0.4997094\",\n \"0.49882665\",\n \"0.49850178\",\n \"0.49820077\",\n \"0.49814463\",\n \"0.49796802\",\n \"0.49757335\",\n \"0.49738544\",\n \"0.49728665\",\n \"0.49683106\",\n \"0.49570513\",\n \"0.49540034\",\n \"0.49539778\",\n \"0.49491397\",\n \"0.49467856\",\n \"0.4938097\",\n \"0.49362886\",\n \"0.49349728\",\n \"0.4934565\",\n \"0.49329442\",\n \"0.4932399\",\n \"0.49281734\",\n \"0.49267942\",\n \"0.4922213\",\n \"0.4919026\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.49256462"},"document_rank":{"kind":"string","value":"97"}}},{"rowIdx":76398,"cells":{"query":{"kind":"string","value":"Parse the bound file."},"document":{"kind":"string","value":"function parse() {\n var self = this;\n var value = String(self.file);\n var start = {line: 1, column: 1, offset: 0};\n var content = xtend(start);\n var node;\n\n /* Clean non-unix newlines: `\\r\\n` and `\\r` are all\n * changed to `\\n`. This should not affect positional\n * information. */\n value = value.replace(EXPRESSION_LINE_BREAKS, C_NEWLINE);\n\n if (value.charCodeAt(0) === 0xFEFF) {\n value = value.slice(1);\n\n content.column++;\n content.offset++;\n }\n\n node = {\n type: 'root',\n children: self.tokenizeBlock(value, content),\n position: {\n start: start,\n end: self.eof || xtend(start)\n }\n };\n\n if (!self.options.position) {\n removePosition(node, true);\n }\n\n return node;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function parse(fileName) {\n\n var baseDir = path.dirname(fileName);\n\n var jsonData = parseFile(fileName);\n if (!jsonData) {\n return null;\n }\n\n jsonData = replace(baseDir, jsonData, 'segment');\n if (!jsonData) {\n return null;\n }\n\n\n if (jsonData.hasOwnProperty('segment')) {\n if (!Array.isArray(jsonData.segment)) {\n console.error('segment must be array');\n return null;\n }\n for (var i = 0; i < jsonData.segment.length; i++) {\n\n var segment = jsonData.segment[i];\n segment = replace(baseDir, segment, 'host');\n if (!segment) {\n return null;\n }\n segment = replace(baseDir, segment, 'gateway');\n if (!segment) {\n return null;\n }\n jsonData.segment[i] = segment;\n }\n }\n\n jsonData = replace(baseDir, jsonData, 'event');\n\n //console.log(JSON.stringify(jsonData));\n return jsonData;\n}","function BinaryParser() {}","function BinaryParser() {}","function BinaryParser() {}","function BinaryParser() {}","function BinaryParser() {}","function parse(file) {\n let names = [];\n let parts = file.split(':');\n parts[0].split('\\n').forEach(function(line) {\n if (line !== '') {\n names.push(line.split(',')[0]);\n }\n });\n let n = -1;\n parts[1].split('\\n').forEach(function(line) {\n if (n >= 0) {\n data[names[n]] = line;\n }\n n++;\n });\n}","function parse( file ) {\n\t\treturn __awaiter( this, void 0, void 0, function () {\n\t\t\treturn __generator( this, function ( _a ) {\n\t\t\t\treturn [\n\t\t\t\t\t2,\n\t\t\t\t\t/*return*/\n\t\t\t\t\tnew Promise( function ( resolve, reject ) {\n\t\t\t\t\t\tfs.readFile( file, 'utf8', function ( err, data ) {\n\t\t\t\t\t\t\tif ( err ) {\n\t\t\t\t\t\t\t\treject( err );\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tresolve( parseString( data ) );\n\t\t\t\t\t\t} );\n\t\t\t\t\t} ),\n\t\t\t\t];\n\t\t\t} );\n\t\t} );\n\t}","function BinaryParser() { }","function parseFile(event) {\n Papa.parse(event.target.files[0], {\n complete: function (results) {\n console.log(results.data)\n setParse(results.data);\n setIsReady(true)\n }\n })\n }","function parseRawTagData() {\n\n\t// Pre-populate the `generators.all` store with\n\t// all of the generator names, so that they can\n\t// be referenced.\n\t_.each( rawTagData, function( gen, path ) {\n\t\tlet name = getGeneratorNameFromPath( path );\n\t\tgenerators.all[ name ] = null;\n\t});\n\n\t// Iterate over each file and its Dox data\n\t_.each( rawTagData, function( gen, path ) {\n\n\t\t// Resolve a name for the generator\n\t\tlet name = getGeneratorNameFromPath( path );\n\n\t\t// Initialize a generator info object\n\t\tlet item = {\n\t\t\tname: name,\n\t\t\ttype: \"partial\",\n\t\t\tisDefault: false,\n\t\t\tdescription: gen.description,\n\t\t\tauthor: null,\n\t\t\tcreated: null,\n\t\t\tpaths: {\n\t\t\t\tabs: path,\n\t\t\t\trel: getRelativeGeneratorPath( path )\n\t\t\t},\n\t\t\tuses: {},\n\t\t\tcreates: {},\n\t\t\toperations: [],\n\t\t\tpromptsFor: {},\n\t\t\texample: null\n\t\t};\n\n\t\t// Parse each tag object generated by Dox\n\t\t_.each( gen.doxData, function( tag ) {\n\t\t\tparseOneTag( item, tag );\n\t\t});\n\n\t\t// Persist the generator info object\n\t\tgenerators.all[ name ] = item;\n\t\tgenerators[ item.type ][ name ] = item;\n\n\t});\n\n}","function parse(file) {\n return __awaiter(this, void 0, void 0, function () {\n return __generator(this, function (_a) {\n return [2\n /*return*/\n , new Promise(function (resolve, reject) {\n fs.readFile(file, 'utf8', function (err, data) {\n if (err) {\n reject(err);\n return;\n }\n\n resolve(parseString(data));\n });\n })];\n });\n });\n }","parse() {\n /**\n * The first two bytes are a bitmask which states which features are present in the mapFile\n * The second two bytes are.. something?\n */\n const featureFlags = this.take(2, \"featureFlags\").readUInt16LE(0);\n this.take(2, \"unknown01\");\n if (featureFlags & 0b000000000000001) {\n this.robotStatus = this.take(0x2C, \"robot status\");\n }\n\n\n if (featureFlags & 0b000000000000010) {\n this.mapHead = this.take(0x28, \"map head\");\n this.parseImg();\n }\n if (featureFlags & 0b000000000000100) {\n let head = asInts(this.take(12, \"history\"));\n this.history = [];\n for (let i = 0; i < head[2]; i++) {\n // Convert from ±meters to mm. UI assumes center is at 20m\n let position = this.readFloatPosition(this.buf, this.offset + 1);\n // first byte may be angle or whether robot is in taxi mode/cleaning\n //position.push(this.buf.readUInt8(this.offset)); //TODO\n this.history.push(position[0], position[1]);\n this.offset += 9;\n }\n }\n if (featureFlags & 0b000000000001000) {\n // TODO: Figure out charge station location from this.\n let chargeStation = this.take(16, \"charge station\");\n this.chargeStation = {\n position: this.readFloatPosition(chargeStation, 4),\n orientation: chargeStation.readFloatLE(12)\n };\n }\n if (featureFlags & 0b000000000010000) {\n let head = asInts(this.take(12, \"virtual wall\"));\n\n this.virtual_wall = [];\n this.no_go_area = [];\n\n let wall_num = head[2];\n\n for (let i = 0; i < wall_num; i++) {\n this.take(12, \"virtual wall prefix\");\n let body = asFloat(this.take(32, \"Virtual walls coords\"));\n\n if (body[0] === body[2] && body[1] === body[3] && body[4] === body[6] && body[5] === body[7]) {\n //is wall\n let x1 = Math.round(ViomiMapParser.convertFloat(body[0]));\n let y1 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[1]));\n let x2 = Math.round(ViomiMapParser.convertFloat(body[4]));\n let y2 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[5]));\n\n this.virtual_wall.push([x1, y1, x2, y2]);\n } else {\n //is zone\n let x1 = Math.round(ViomiMapParser.convertFloat(body[0]));\n let y1 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[1]));\n let x2 = Math.round(ViomiMapParser.convertFloat(body[2]));\n let y2 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[3]));\n let x3 = Math.round(ViomiMapParser.convertFloat(body[4]));\n let y3 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[5]));\n let x4 = Math.round(ViomiMapParser.convertFloat(body[6]));\n let y4 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[7]));\n\n this.no_go_area.push([x1, y1, x2, y2, x3, y3, x4, y4]);\n }\n\n this.take(48, \"unknown48\");\n }\n }\n if (featureFlags & 0b000000000100000) {\n let head = asInts(this.take(12, \"area head\"));\n let area_num = head[2];\n\n this.clean_area = [];\n\n for (let i = 0; i < area_num; i++) {\n this.take(12, \"area prefix\");\n let body = asFloat(this.take(32, \"area coords\"));\n\n let x1 = Math.round(ViomiMapParser.convertFloat(body[0]));\n let y1 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[1]));\n let x2 = Math.round(ViomiMapParser.convertFloat(body[2]));\n let y2 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[3]));\n let x3 = Math.round(ViomiMapParser.convertFloat(body[4]));\n let y3 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[5]));\n let x4 = Math.round(ViomiMapParser.convertFloat(body[6]));\n let y4 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[7]));\n\n this.clean_area.push([x1, y1, x2, y2, x3, y3, x4, y4]);\n\n this.take(48, \"unknown48\");\n }\n }\n if (featureFlags & 0b000000001000000) {\n let navigateTarget = this.take(20, \"navigate\");\n this.navigateTarget = {position: this.readFloatPosition(navigateTarget, 8)};\n }\n if (featureFlags & 0b000000010000000) {\n let realtimePose = this.take(21, \"realtime\");\n this.realtimePose = {position: this.readFloatPosition(realtimePose, 9)};\n }\n\n if (featureFlags & 0b000100000000000) {\n //v6 example: 5b590f5f00000001\n //v7 example: e35a185e00000001\n this.take(8, \"unknown8\");\n this.parseRooms();\n // more stuff i don't understand\n this.take(50, \"unknown50\");\n this.take(5, \"unknown5\");\n this.points = [];\n try {\n this.parsePose();\n } catch (e) {\n Logger.warn(\"Unable to parse Pose\", e); //TODO\n }\n }\n this.take(this.buf.length - this.offset, \"trailing\");\n\n // TODO: one of them is just the room outline, not actual past navigation logic\n return this.convertToValetudoMap({\n image: this.img,\n zones: this.rooms,\n //TODO: at least according to all my sample files, this.points is never the path\n //Why is this here?\n //path: {points: this.points.length ? this.points : this.history},\n path: {points: this.history},\n goto_target: this.navigateTarget && this.navigateTarget.position,\n robot: this.realtimePose && this.realtimePose.position,\n charger: this.chargeStation && this.chargeStation.position,\n virtual_wall: this.virtual_wall,\n no_go_area: this.no_go_area,\n clean_area: this.clean_area\n });\n }","function parseFile(str) {\n\n\t\t// Verifying str type\n\t\tif (typeof str !== 'string') {\n\t\t\talert('Sorry... we had a uhh... error parsing?');\n\t\t\treturn;\n\t\t}\n\n\t\t// RegEx is a blast -_-\n\t\tlet newParsedArr = str.match(/['\"].*?['\"]/g).map(item => {\n\t\t\treturn item.replace(/['\"]/g, \"\");\n\t\t});\n\t\tformatPaths(newParsedArr);\n\t}","load(file) {\n this._loading = file;\n\n // Read file and split into lines\n const map = {};\n\n const content = fs.readFileSync(file, 'ascii');\n const lines = content.split(/[\\r\\n]+/);\n\n lines.forEach(line => {\n // Clean up whitespace/comments, and split into fields\n const fields = line.replace(/\\s*#.*|^\\s*|\\s*$/g, '').split(/\\s+/);\n map[fields.shift()] = fields;\n });\n\n this.define(map);\n\n this._loading = null;\n }","function parseHBX(completePath)\n{\n\tnTodo++;\n\tlet fileName = path.parse(completePath).name\n\tvar ck = /DYNAMIC\\s+([_a-z0-9]+)/i;\n\tvar reader = readline.createInterface({input:fs.createReadStream(completePath,\"utf8\")});\n\treader.on(\"line\",l =>\n\t{\n\t\tvar m = l.match(ck);\n\t\tif(m && m[1])\n\t\t{\n\t\t\tstdMethods.push([m[1],fileName]);\n\t\t}\n\t});\n\treader.on(\"close\",() =>\n\t{\n\t\tnTodo--;\n\t\tif(nTodo==0)\n\t\t\tcreateDoc();\n\t})\n}","parseFlsFile(baseFile) {\r\n this.extension.logger.addLogMessage('Parse fls file.');\r\n const rootDir = path.dirname(baseFile);\r\n const outDir = this.getOutDir(baseFile);\r\n const flsFile = path.resolve(rootDir, path.join(outDir, path.basename(baseFile, '.tex') + '.fls'));\r\n if (!fs.existsSync(flsFile)) {\r\n this.extension.logger.addLogMessage(`Cannot find fls file: ${flsFile}`);\r\n return;\r\n }\r\n this.extension.logger.addLogMessage(`Fls file found: ${flsFile}`);\r\n const ioFiles = this.parseFlsContent(fs.readFileSync(flsFile).toString(), rootDir);\r\n ioFiles.input.forEach((inputFile) => {\r\n // Drop files that are also listed as OUTPUT or should be ignored\r\n if (ioFiles.output.includes(inputFile) ||\r\n this.isExcluded(inputFile) ||\r\n !fs.existsSync(inputFile)) {\r\n return;\r\n }\r\n // Drop the current rootFile often listed as INPUT and drop any file that is already in the texFileTree\r\n if (baseFile === inputFile || inputFile in this.cachedContent) {\r\n return;\r\n }\r\n if (path.extname(inputFile) === '.tex') {\r\n // Parse tex files as imported subfiles.\r\n this.cachedContent[baseFile].children.push({\r\n index: Number.MAX_VALUE,\r\n file: inputFile\r\n });\r\n this.parseFileAndSubs(inputFile);\r\n }\r\n else if (this.fileWatcher && !this.filesWatched.includes(inputFile)) {\r\n // Watch non-tex files.\r\n this.fileWatcher.add(inputFile);\r\n this.filesWatched.push(inputFile);\r\n }\r\n });\r\n ioFiles.output.forEach((outputFile) => {\r\n if (path.extname(outputFile) === '.aux' && fs.existsSync(outputFile)) {\r\n this.parseAuxFile(fs.readFileSync(outputFile).toString(), path.dirname(outputFile).replace(outDir, rootDir));\r\n }\r\n });\r\n }","function parse() {\n var self = this\n var value = String(self.file)\n var start = {line: 1, column: 1, offset: 0}\n var content = xtend(start)\n var node\n\n // Clean non-unix newlines: `\\r\\n` and `\\r` are all changed to `\\n`.\n // This should not affect positional information.\n value = value.replace(lineBreaksExpression, lineFeed)\n\n // BOM.\n if (value.charCodeAt(0) === 0xfeff) {\n value = value.slice(1)\n\n content.column++\n content.offset++\n }\n\n node = {\n type: 'root',\n children: self.tokenizeBlock(value, content),\n position: {start: start, end: self.eof || xtend(start)}\n }\n\n if (!self.options.position) {\n removePosition(node, true)\n }\n\n return node\n}","function parseAllGRIBs(inData) {\n // create the object to keep all the data in\n var weatherDB = new weatherDBObject();\n\n // loop through all the grib parts in the file\n var gribCount = 1;\n var starttime = +new Date();\n while (inData.byteLength > 0) {\n if (gribCount % 10 == 0) {\n\n var currentTime = +new Date();\n starttime = currentTime;\n }\n dbg(2, \" Starting GRIB Block \" + gribCount);\n gribCount++;\n var sect0 = new DataView(inData, 0, 16);\n // Make sure this is a grib file\n // first 4 characters should be GRIB. Must be a meteorological file (byte 7 = 0) and version 2 (byte 8 = 2). Max length supported is 2^32 (top 32 if length =0)\n\n if (sect0.getUint8(0) == 0x47 && sect0.getUint8(1) == 0x52 && sect0.getUint8(2) == 0x49 && sect0.getUint8(3) == 0x42 && sect0.getUint8(6) == 0x0 && sect0.getUint8(7) == 0x2 && sect0.getUint32(8) == 0) {\n\n // get the length of the grub file\n var griblength = sect0.getUint32(12);\n\n // trim off this grib\n var grib = inData.slice(0, griblength);\n inData = inData.slice(griblength);\n // at this point grib contains one of the multiple gribs in the source file\n // there is a separate grib for each parameter and pressure (alt)\n parseGRIB(grib, weatherDB);\n if (weatherDB.status < 0) {\n // error found, return\n return (weatherDB);\n }\n\n } else {\n // alert(\"ERROR: Not a grib file this parser understands\");\n dbg(0, \"ERROR: Not a grib file this parser understands\");\n weatherDB.statusMsg = \"ERROR: Not a grib file this parser understands\";\n weatherDB.status = -1;\n\t\t\tthrow error;\n return (weatherDB);\n }\n }\n // just keep the unique, sorted values for lats, longs, pressures, & params.\n weatherDB.lats = arrayUnique(weatherDB.lats);\n weatherDB.lats.sort(function (a, b) {\n return a - b\n });\n weatherDB.longs = arrayUnique(weatherDB.longs);\n weatherDB.longs.sort(function (a, b) {\n return a - b\n });\n weatherDB.pressures = arrayUnique(weatherDB.pressures);\n weatherDB.pressures.sort(function (a, b) {\n return a - b\n });\n weatherDB.params = arrayUnique(weatherDB.params);\n weatherDB.params.sort();\n weatherDB.status = 100; // say the data is valid\n return weatherDB;\n}","parseFileAndSubs(file, onChange = false) {\r\n if (this.isExcluded(file)) {\r\n this.extension.logger.addLogMessage(`Ignoring ${file}`);\r\n return;\r\n }\r\n this.extension.logger.addLogMessage(`Parsing ${file}`);\r\n if (this.fileWatcher && !this.filesWatched.includes(file)) {\r\n // The file is first time considered by the extension.\r\n this.fileWatcher.add(file);\r\n this.filesWatched.push(file);\r\n }\r\n const content = this.getDirtyContent(file, onChange);\r\n this.cachedContent[file].children = [];\r\n this.cachedContent[file].bibs = [];\r\n this.cachedFullContent = undefined;\r\n this.parseInputFiles(content, file);\r\n this.parseBibFiles(content, file);\r\n // We need to parse the fls to discover file dependencies when defined by TeX macro\r\n // It happens a lot with subfiles, https://tex.stackexchange.com/questions/289450/path-of-figures-in-different-directories-with-subfile-latex\r\n this.parseFlsFile(file);\r\n }","function readFile() {\n\t\tlet reader = new FileReader();\n\t\treader.addEventListener('loadend', () => {\n\t\t\tparseFile(reader.result);\n\t\t});\n\t\treader.readAsText(this.files[0]);\n\t}","function parseFile(evt){\n let files = evt.target.files; // FileList object\n if(files.length === 0){ //if no files\n return;\n }\n let f = files[0];\n\n let pointsArray = [];\n fileFaces = [];\n let reader = new FileReader();\n reader.onload = (function(theFile) {\n return function(e) {\n let contents = atob(e.target.result.split(\"base64,\")[1]);\n contents = contents.split(/\\n/); //split contents into lines\n if(contents[0].replace(/\\s+/, \"\") === \"\"){ //if first line is blank\n contents.shift(); //delete it\n }\n if(contents[0].replace(/\\s+/, \"\") !== \"ply\"){ //if first line does not contain \"ply\"\n console.log(\"No Ply: \" + contents[0]); //do nothing with the file\n return;\n }\n\n let i = 1;\n let numVerts = 0;\n let numFaces = 0;\n\n while(contents[i].indexOf(\"end_header\") === -1){ //while we haven't hit the end of the header\n if(contents[i].indexOf(\"element vertex\") !== -1){ //if this line indicates # vertices\n let idx = contents[i].indexOf(\"element vertex\");\n numVerts = parseInt(contents[i].substring(idx+14)); //parse # of vertices\n } else if(contents[i].indexOf(\"element face\") !== -1){ //if this line indicates # of faces\n let idx = contents[i].indexOf(\"element face\");\n numFaces = parseInt(contents[i].substring(idx+12)); //parse # of faces\n }\n i++;\n }\n i++; //increment to line just after end_header\n let left = vec4(Number.MAX_VALUE, 0.0, 0.0, 0.0);\n let right = vec4(Number.MIN_VALUE, 0.0, 0.0, 0.0);\n let top = vec4(0.0, Number.MIN_VALUE, 0.0, 0.0);\n let bottom = vec4(0.0, Number.MAX_VALUE, 0.0, 0.0);\n let minZ = vec4(0.0, 0.0, Number.MAX_VALUE, 0.0);\n let maxZ = vec4(0.0, 0.0, Number.MIN_VALUE, 0.0); //initialize extents to easily-overridden values\n\n let j = 0;\n for(j = 0; j < numVerts; j++){ //for each vertex\n while(contents[i].replace(/\\s+/, \"\") === \"\"){ //ignore empty lines\n i++;\n }\n let points = contents[i].split(/\\s+/); //split along spaces\n if(points[0].replace(/\\s+/, \"\") === \"\"){ //ignore empty first element\n points.shift();\n }\n let x = parseFloat(points[0]);\n let y = parseFloat(points[1]);\n let z = parseFloat(points[2]);\n let thisPoint = vec4(x, y, z, 1.0);\n\n if(x < left[0]){ //if x is further left\n left = thisPoint;\n }\n if(x > right[0]){ //if x is further right\n right = thisPoint;\n }\n if(y < bottom[1]){ //if y is lower\n bottom = thisPoint;\n }\n if(y > top[1]){ //if y is higher\n top = thisPoint;\n }\n if(z < minZ[2]){ //if Z is further\n minZ = thisPoint;\n }\n if(z > maxZ[2]){ //if Z is closer\n maxZ = thisPoint;\n }\n pointsArray.push(thisPoint);\n i++;\n }\n\n let divisor = Math.max(right[0]-left[0], top[1]-bottom[1], maxZ[2]-minZ[2]) / 2; //calculate largest dimension\n let shiftX = (-(right[0] - (right[0]-left[0])/2))/divisor; //X axis translation to center at origin\n let shiftY = (-(top[1] - (top[1]-bottom[1])/2))/divisor; //Y axis translation to center at origin\n let shiftZ = (-(maxZ[2] - (maxZ[2]-minZ[2])/2))/divisor; //Z axis translation to center at origin\n for(j = 0; j < numFaces; j++){ //for each face\n while(contents[i].replace(/\\s+/, \"\") === \"\"){ //ignore empty lines\n i++;\n }\n let verts = contents[i].split(/\\s+/);\n if(verts[0].replace(/\\s+/, \"\") === \"\"){ //if empty first element\n verts.shift();\n }\n let vertLen = parseInt(verts[0]); //parse # vertices\n verts.shift();\n\n for(let k = 0; k < vertLen; k++){ //for # of vertices\n let currVert = pointsArray[verts[k]];\n fileFaces.push(vec4(currVert[0]/divisor + shiftX, currVert[1]/divisor + shiftY, currVert[2]/divisor + shiftZ, 1.0));\n //shift vertex so whole object is centered on origin and [-1, 1], push to face\n }\n i++;\n }\n let rightBB = right[0]/divisor + shiftX;\n let topBB = top[1]/divisor + shiftY;\n let maxZBB = maxZ[2]/divisor + shiftZ;\n\n //back face\n fileBB = generateBB(rightBB, topBB, maxZBB);\n\n fileUploaded = true;\n if(shapeArray.length === 3){ //if another file is already loaded\n shapeArray.pop(); //get rid of it\n }\n shapeArray.push(fileFaces); //push this file to shape array\n fileFlatNormal = fNormals(shapeArray[2]); //calculate flat normals\n fileGNormal = gNormals(shapeArray[2]); //calculate gouraud normals\n generateLines(); //regenerate lines to account fo new bounding box\n };\n })(f);\n reader.readAsDataURL(f);\n}","function loadStructureHandler(text)\r\n\t{\r\n\t var content = text.split(\"\\n\");\r\n\t //console.log(content[1]);\r\n\t BuildStructure(name,content,callback, new ProgressDialog(\"Assimilating PDB file \"+name+\"...\"));\r\n\t}","function parseText(file) {\n console.log(file);\n var lines = file.split(\"\\n\");\n var params = lines[0].split(\" \");\n if (params.length < 3) {\n console.log(\"File format error\");\n return false;\n }\n listType = params[0];\n rowSize = parseInt(params[1], 10);\n memSize = parseInt(params[2], 10);\n for (var i = 1; i < lines.length; i++) {\n //parse each line\n if (lines[i].length <= 0) break;\n if (lines[i].charAt(0) == '#') console.log(lines[i]);\n else {\n var args = lines[i].split(\" \");\n var addr;\n if (args.length == 2) {\n //this is a free block\n var block;\n freebls.push({\n address: addr = parseInt(args[0], 16),\n size: parseInt(args[1], 10),\n type: FREE\n });\n if (addr < memhead) memhead = addr;\n } else if (args.length == 3) {\n usedbls.push({\n address: addr = parseInt(args[0], 16),\n size: parseInt(args[1], 10),\n rsize: parseInt(args[2], 10),\n type: USED\n });\n if (addr < memhead) memhead = addr;\n } else {\n console.log(\"Error parsing file, line \" + i + \"has incorrect ammount of arguments\");\n return false;\n }\n }\n }\n\n if (listType == EXPLICIT) {\n // add link\n for (var i = 0; i < freebls.length - 1; i++) {\n freebls[i].next = freebls[i + 1].address;\n }\n }\n\n function compare(a, b) {\n return a.address > b.address;\n }\n freebls.sort(compare);\n if (listType == EXPLICIT) {\n for (var i = 0; i < freebls.length - 1; i++) {\n var diff = freebls[i + 1].address - freebls[i].address;\n if (diff > freebls[i].size) {\n //there is a used block\n usedbls.push({\n address: freebls[i].address + freebls[i].size,\n size: diff - freebls[i].size,\n type: USED\n })\n }\n }\n var lastfree = freebls[freebls.length - 1];\n var lastusedhead = lastfree.address + lastfree.size;\n if (memSize > lastfree.address + lastfree.size - memhead) {\n usedbls.push({\n address: lastfree.address + lastfree.size,\n size: memSize + memhead - lastusedhead,\n type: USED\n });\n }\n }\n bls = freebls.concat(usedbls);\n bls.sort(compare);\n\n // for (var i = 0; i < freebls.length - 1; i++) {\n // console.log(\"\" + freebls[i].address + \" \" + freebls[i].size);\n // }\n\n initBoxes();\n\n return true;\n}","parseFile(file) {\r\n this._lines = [];\r\n this._currentLine = -1;\r\n this._resetStates();\r\n\r\n lineReader.eachLine(file, (line) => {\r\n this._lines.push(ParseUtil.clearCRLF(line));\r\n }).then(()=>{\r\n this._linesGenerator = this.lineReader();\r\n this._readNextLine();\r\n });\r\n }","function parseFile(path, cvt, cb) {\n if (cvt == null) cvt = adapter;\n fs.readFile(path, (err, data) => {\n if (err) return cb(err);\n xml2js.parseString(data, (err, data) => {\n if (err) return cb(err);\n if (! data) return cb(null, null);\n const key = Object.keys(data)[0];\n if (! key) return cb(null, null);\n cb(null, cvt(data[key], key));\n });\n });\n}","getDefinition(file, position) {\n // Overridden in XMLScope. Brs files use implementation in BrsFile\n return [];\n }","function parseLiveFile(e) {\n if (e.document.isUntitled) {\n return;\n }\n if (e.document.languageId !== 'go') {\n return;\n }\n if (!goLiveErrorsEnabled()) {\n return;\n }\n if (runner != null) {\n clearTimeout(runner);\n }\n runner = setTimeout(() => {\n processFile(e);\n runner = null;\n }, config_1.getGoConfig(e.document.uri)['liveErrors']['delay']);\n}","function parseFile(file) {\n\n if (window.File && window.FileReader && Window.FileList && window.Blob) {\n alert(\"File Reader APIs not up to date on current browser.\")\n return\n }\n \n //create file reader \n var reader = new FileReader()\n\n\n if(file.files && file.files[0]) {\n reader.onload = function (e) {\n parseInput(e.target.result)\n }\n\n reader.readAsText(file.files[0])\n }\n else {\n alert(\"Error reading file.\")\n }\n\n}","function parseFile(err, contents) {\r\n const output = parse(contents, {\r\n columns: true,\r\n skip_empty_lines: true\r\n });\r\n\r\n // Call build function. Interpret and construct Org Chart\r\n buildOutput(output);\r\n}","function BaseBodyParser() {\n\t}","handleTheFile(event) {\n event.preventDefault();\n if (this.inputFile.current.files[0] === undefined) { return; }\n\n // Confirm file extension and read the data as text\n console.log('Reading the file...');\n let fileName = this.inputFile.current.files[0].name;\n if (!fileName.endsWith('.asc')) {\n console.error('Error opening the file: Invalid file extension, .asc expected.');\n return;\n }\n let file = this.inputFile.current.files[0];\n let reader = new FileReader();\n reader.onload = (event) => {\n console.log('Done.');\n this.ParseTheData(event.target.result);\n }\n reader.onerror = () => {\n console.error('Error opening the file: Cannot read file.');\n return;\n }\n reader.readAsText(file);\n }","function metadataParser(file, callback, errback) {\n queue.push({file: file, callback: callback, errback: errback});\n if (!busy)\n processQueue();\n }","function parsed_done() {\n\n\tconsole.log(fileParsed);\n\n}","function parse(context, file) {\n var message\n\n if (stats(file).fatal) {\n return\n }\n\n if (context.treeIn) {\n debug('Not parsing already parsed document')\n\n try {\n context.tree = json(file.toString())\n } catch (error) {\n message = file.message(\n new Error('Cannot read file as JSON\\n' + error.message)\n )\n message.fatal = true\n }\n\n // Add the preferred extension to ensure the file, when serialized, is\n // correctly recognised.\n // Only add it if there is a path — not if the file is for example stdin.\n if (file.path) {\n file.extname = context.extensions[0]\n }\n\n file.contents = ''\n\n return\n }\n\n debug('Parsing `%s`', file.path)\n\n context.tree = context.processor.parse(file)\n\n debug('Parsed document')\n}","function parse (fileName, text) {\n const reader = Reader.create(fileName, text)\n const fragments = []\n\n // loop through lines, building fragments\n while (true) {\n if (reader.atEnd()) break\n\n // get the first line of the next fragment\n reader.skipEmptyLines()\n\n const line = reader.read()\n if (line == null) break\n\n // push the fragment line back for fragment handler to process\n reader.pushBack()\n\n const fragment = getFragment(line)\n if (fragment.read(reader) == null) break\n\n fragments.push(fragment)\n }\n\n return fragments\n}","parseFile(file) {\n\n var content = this.lire(file);\n\n var lines = content.split(/\\r?\\n/);\n\n //string that contains keys\n var header = lines[0];\n\n //array containing data separate with \";\"\n var dataLines = lines.slice(1);\n\n // data = dataLines.map(this.parser);\n\n var data = this.jsonifydata(header,dataLines);\n\n console.log(data);\n\n }","function parse$a(context, file) {\n var message;\n\n if (stats$5(file).fatal) {\n return\n }\n\n if (context.treeIn) {\n debug$8('Not parsing already parsed document');\n\n try {\n context.tree = json$1(file.toString());\n } catch (error) {\n message = file.message(\n new Error('Cannot read file as JSON\\n' + error.message)\n );\n message.fatal = true;\n }\n\n // Add the preferred extension to ensure the file, when serialized, is\n // correctly recognised.\n // Only add it if there is a path — not if the file is for example stdin.\n if (file.path) {\n file.extname = context.extensions[0];\n }\n\n file.contents = '';\n\n return\n }\n\n debug$8('Parsing `%s`', file.path);\n\n context.tree = context.processor.parse(file);\n\n debug$8('Parsed document');\n}","parseBitmap(buffer, parsed) {\r\n\r\n // file buffer\r\n this.buffer = buffer;\r\n\r\n // fileType\r\n this.type = buffer.toString('utf-8', 0, 2);\r\n // fileSize\r\n this.fileSize = buffer.readInt32LE(2);\r\n // Bytes Per Pixel\r\n this.bitsPerPixel = buffer.readInt16LE(28);\r\n // Height\r\n this.height = buffer.readInt32LE(22);\r\n // Width\r\n this.width = buffer.readInt32LE(18);\r\n // DIB Header size \r\n this.sizeOfTheDIBHeader = buffer.readInt32LE(14);\r\n // Start of color chart\r\n this.colorChart = (this.sizeOfTheDIBHeader + 14 + 12);\r\n // Start of pixels\r\n this.pixels = buffer.readInt32LE(10);\r\n\r\n parsed(this);\r\n }","async parse() {\n const buffer = await readFile(`${this.file}`);\n // Create a naked object to model the bitmap properties\n const parsedBitmap = {};\n\n // Identify the offsets by reading the bitmap docs\n const FILE_SIZE_OFFSET = 2;\n const WIDTH_OFFSET = 18;\n const HEIGHT_OFFSET = 22;\n const BYTES_PER_PIXEL_OFFSET = 28;\n const COLOR_PALLET_OFFSET = 46;\n const COLOR_TABLE_OFFSET = 54;\n const PIXEL_ARRAY_OFFSET = 310;\n\n //------------------------------------------------------\n // READING INFORMATION FROM THE BITMAP FILE\n //------------------------------------------------------\n\n parsedBitmap.type = buffer.toString('utf-8', 0, 2);\n parsedBitmap.fileSize = buffer.readInt32LE(FILE_SIZE_OFFSET);\n parsedBitmap.bytesPerPixel = buffer.readInt16LE(BYTES_PER_PIXEL_OFFSET);\n parsedBitmap.height = buffer.readInt32LE(HEIGHT_OFFSET);\n parsedBitmap.width = buffer.readInt32LE(WIDTH_OFFSET);\n parsedBitmap.colorPallet = buffer.readInt32LE(COLOR_PALLET_OFFSET);\n parsedBitmap.colorTable = buffer.readInt32LE(COLOR_TABLE_OFFSET);\n parsedBitmap.pixelArray = buffer.readInt32LE(PIXEL_ARRAY_OFFSET);\n\n const colorTable = buffer.slice(PIXEL_ARRAY_OFFSET);\n const tableOfColors = buffer.slice(COLOR_TABLE_OFFSET, PIXEL_ARRAY_OFFSET);\n\n // Bottom left boundary = 1146\n // Top right boundary = buffer.length\n // Color table = 121 to 1145 (1145 - 4 * 256)\n // const num = 6111 - 3 * 112;\n // const blockheight = 400;\n\n // console.log(parsedBitmap);\n return parsedBitmap;\n }","function parsedFile(lines) {\n let rounds = 0;\n let players = [];\n let root = {};\n\n lines.forEach((line) => {\n if (line.indexOf('InitGame') !== -1) {\n rounds = getInitGame(root, rounds);\n }\n\n if (line.indexOf('killed') !== -1) {\n kill(root[`game_${rounds}`], line);\n }\n\n if (line.indexOf('ClientUserinfoChanged') !== -1) {\n instancePlayers(root[`game_${rounds}`], line);\n }\n });\n return root;\n}","static parseBpmn(filenames) {\n if (typeof filenames === 'string') {\n filenames = [filenames];\n }\n return filenames.map(filename => {\n const xmlData = fs.readFileSync(filename).toString();\n if (parser.validate(xmlData)) {\n return parser.parse(xmlData, BpmnParser.parserOptions);\n }\n return {};\n });\n }","function parseFile(contents, fileName) {\n\t\ttry {\n\t\t\tif(typeof contents === 'string') {\n\t\t\t\tcontents = JSON.parse(contents);\n\t\t\t\tdataBase = contents;\n\t\t\t\tcheckData();\n\t\t\t\treturn;\n\t\t\t}\n\t\t} catch (e) { }\n\n\t\tif(contents instanceof Array) { // from slot set of \"FileContents\"\n\t\t\tdataBase = contents;\n\t\t\tcheckData();\n\t\t\treturn;\n\t\t}\n\n\t\tvar p = 0;\n\t\tvar lex = {\" \":0, \",\":0, \"\\t\":0, \"\\n\":0, \";\":0};\n\t\tvar best = \"\\n\";\n\t\tvar bestn = 0;\n\n\t\twhile (p < contents.length) {\n\t\t\tif(lex.hasOwnProperty(contents[p])) {\n\t\t\t\tlex[contents[p]] += 1;\n\n\t\t\t\tif(lex[contents[p]] > bestn) {\n\t\t\t\t\tbestn = lex[contents[p]];\n\t\t\t\t\tbest = contents[p];\n\t\t\t\t}\n\t\t\t}\n\t\t\tp++;\n\t\t}\n\n\t\tdataBase = [];\n\t\tp1 = 0;\n\t\tp2 = p1+1;\n\t\tvar firstRow = true;\n\n\t\twhile (p2 < contents.length) {\n\t\t\tif(contents[p2] == \"\\n\" || p2 == contents.length - 1) {\n\t\t\t\tif(p2 == contents.length - 1 && contents[p2] != \"\\n\") {\n\t\t\t\t\tp2++; // include last character too\n\t\t\t\t}\n\t\t\t\tvar thisRow = contents.substr(p1, p2 - p1);\n\t\t\t\tvar items = thisRow.split(best);\n\t\t\t\tvar name = items[0];\n\t\t\t\tvar vals = [];\n\t\t\t\tfor(var i = 1; i < items.length; i++) {\n\t\t\t\t\tvar val = parseFloat(items[i]);\n\n\t\t\t\t\tif(val !== null && val !== undefined && !isNaN(val)) {\n\t\t\t\t\t\tvals.push(val);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tvar data = [name, vals];\n\t\t\t\tif(vals.length > 0) {\n\t\t\t\t\tdataBase.push(data);\n\t\t\t\t}\n\n\t\t\t\tfirstRow = false;\n\n\t\t\t\twhile(contents[p2] == \"\\n\") {\n\t\t\t\t\tp2++;\n\t\t\t\t}\n\t\t\t\tp1 = p2;\n\t\t\t\tp2 = p1 + 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tp2++;\n\t\t\t}\n\t\t}\n\n\t\t$scope.set(\"FileContents\", dataBase);\n\t\t$scope.dataSetName = fileName;\n\t\tcheckData();\n\t}","function parse(doc) {\n var file = vfile(doc)\n var Parser\n\n freeze()\n Parser = processor.Parser\n assertParser('parse', Parser)\n\n if (newable(Parser)) {\n return new Parser(String(file), file).parse()\n }\n\n return Parser(String(file), file) // eslint-disable-line new-cap\n }","function parse(doc) {\n var file = vfile(doc)\n var Parser\n\n freeze()\n Parser = processor.Parser\n assertParser('parse', Parser)\n\n if (newable(Parser)) {\n return new Parser(String(file), file).parse()\n }\n\n return Parser(String(file), file) // eslint-disable-line new-cap\n }","function parse(doc) {\n var file = vfile(doc)\n var Parser\n\n freeze()\n Parser = processor.Parser\n assertParser('parse', Parser)\n\n if (newable(Parser)) {\n return new Parser(String(file), file).parse()\n }\n\n return Parser(String(file), file) // eslint-disable-line new-cap\n }","function parse(doc) {\n var file = vfile(doc)\n var Parser\n\n freeze()\n Parser = processor.Parser\n assertParser('parse', Parser)\n\n if (newable(Parser)) {\n return new Parser(String(file), file).parse()\n }\n\n return Parser(String(file), file) // eslint-disable-line new-cap\n }","function parse(doc) {\n var file = vfile(doc)\n var Parser\n\n freeze()\n Parser = processor.Parser\n assertParser('parse', Parser)\n\n if (newable(Parser)) {\n return new Parser(String(file), file).parse()\n }\n\n return Parser(String(file), file) // eslint-disable-line new-cap\n }","function parseFile(fileUpload) {\n\n //Add error handling here.\n var status = 'good';\n \n \n //TODO: Insert parsing code here\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n //TODO: Insert parsing code here\n let glFile = csvGenerator(),\n wideFile = csvGenerator(),\n longFile = csvGenerator()\n \n if (status === 'good') {\n return {\n GL: glFile,\n Workorders_Wide: wideFile,\n Workorders_Long: longFile\n };\n } else {\n return null;\n }\n \n}","function parse(doc) {\n var file = vfile(doc)\n var Parser\n\n freeze()\n Parser = processor.Parser\n assertParser('parse', Parser)\n\n if (newable(Parser, 'parse')) {\n return new Parser(String(file), file).parse()\n }\n\n return Parser(String(file), file) // eslint-disable-line new-cap\n }","function parse(doc) {\n var file = vfile(doc)\n var Parser\n\n freeze()\n Parser = processor.Parser\n assertParser('parse', Parser)\n\n if (newable(Parser, 'parse')) {\n return new Parser(String(file), file).parse()\n }\n\n return Parser(String(file), file) // eslint-disable-line new-cap\n }","function parse(doc) {\n var file = vfile(doc)\n var Parser\n\n freeze()\n Parser = processor.Parser\n assertParser('parse', Parser)\n\n if (newable(Parser, 'parse')) {\n return new Parser(String(file), file).parse()\n }\n\n return Parser(String(file), file) // eslint-disable-line new-cap\n }","function process(filename, source) {\n try {\n if (util.isString(source) && source.charAt(0) === \"{\")\n source = JSON.parse(source);\n if (!util.isString(source))\n self.setOptions(source.options).addJSON(source.nested);\n else {\n parse.filename = filename;\n var parsed = parse(source, self, options),\n resolved,\n i = 0;\n if (parsed.imports)\n for (; i < parsed.imports.length; ++i)\n if (resolved = self.resolvePath(filename, parsed.imports[i]))\n fetch(resolved);\n if (parsed.weakImports)\n for (i = 0; i < parsed.weakImports.length; ++i)\n if (resolved = self.resolvePath(filename, parsed.weakImports[i]))\n fetch(resolved, true);\n }\n } catch (err) {\n finish(err);\n }\n if (!sync && !queued)\n finish(null, self); // only once anyway\n }","function process(filename, source) {\n try {\n if (util.isString(source) && source.charAt(0) === \"{\")\n source = JSON.parse(source);\n if (!util.isString(source))\n self.setOptions(source.options).addJSON(source.nested);\n else {\n parse.filename = filename;\n var parsed = parse(source, self, options),\n resolved,\n i = 0;\n if (parsed.imports)\n for (; i < parsed.imports.length; ++i)\n if (resolved = self.resolvePath(filename, parsed.imports[i]))\n fetch(resolved);\n if (parsed.weakImports)\n for (i = 0; i < parsed.weakImports.length; ++i)\n if (resolved = self.resolvePath(filename, parsed.weakImports[i]))\n fetch(resolved, true);\n }\n } catch (err) {\n finish(err);\n }\n if (!sync && !queued)\n finish(null, self); // only once anyway\n }","_parseCollection()\n {\n var that = this;\n fs.readFile(this.option.path, 'utf8', function (err, data) {\n if (err) throw err;\n that.collection = JSON.parse(data);\n that._serveCollection();\n })\n }","function parseFile(req, res, next){\n var filePath = req.files.file.path;\n console.log(filePath);\n function onNewRecord(record){\n console.log(record)\n }\n\n function onError(error){\n console.log(error)\n }\n\n function done(linesRead){\n res.send(200, linesRead)\n }\n\n var columns = true; \n parseCSVFile(filePath, columns, onNewRecord, onError, done);\n\n}","function ReadPDBfile(file,callback)\r\n{\r\n\tvar self = this;\r\n\tvar name= PDButil.stripName(file.name);\r\n\t\r\n\t//Assigning Properties by reading the file\r\n\tvar pdbfileReader = new FileReader();\r\n\t\r\n\t//Reads the file\r\n\tpdbfileReader.readAsText(file);\r\n\t\r\n\t//When file is read, this function is called\r\n\tpdbfileReader.onload = loadStructureHandler;\r\n\tpdbfileReader.onerror = errorStructureHandler;\r\n\t\r\n\tfunction loadStructureHandler(event)\r\n\t{\r\n\t var content = event.target.result.split(\"\\n\");\r\n\t //console.log(content[1]);\r\n\t BuildStructure(name,content,callback, new ProgressDialog(\"Assimilating PDB file \"+name+\"...\"));\r\n\t};\r\n\r\n\tfunction errorStructureHandler(event)\r\n\t{\r\n\t console.log(\"Error while reading the file\");\r\n\t};\r\n \r\n}","function parse(doc) {\n var file = vfile(doc);\n var Parser;\n\n freeze();\n Parser = processor.Parser;\n assertParser('parse', Parser);\n\n if (newable(Parser, 'parse')) {\n return new Parser(String(file), file).parse()\n }\n\n return Parser(String(file), file) // eslint-disable-line new-cap\n }","function Parser(doc, file) {\n this.file = file;\n this.offset = {};\n this.options = xtend(this.options);\n this.setOptions({});\n\n this.inList = false;\n this.inBlock = false;\n this.inLink = false;\n this.atStart = true;\n\n this.toOffset = vfileLocation(file).toOffset;\n this.unescape = unescape(this, 'escape');\n this.decode = decode(this);\n}","function r(e){e||(e={}),this._file=i.getArg(e,\"file\",null),this._sourceRoot=i.getArg(e,\"sourceRoot\",null),this._sources=new a,this._names=new a,this._mappings=[],this._sourcesContents=null}","function parse(doc) {\n var file = vfile(doc);\n var Parser;\n\n freeze();\n Parser = processor.Parser;\n assertParser('parse', Parser);\n\n if (newable(Parser)) {\n return new Parser(String(file), file).parse();\n }\n\n return Parser(String(file), file); // eslint-disable-line new-cap\n }","function parseFile(fileContents) {\n return fileContents.split('\\n').map(s => validate(s.trim()));\n}","_parseMappings(aStr, aSourceRoot) {\n throw new Error('Subclasses must implement _parseMappings')\n }","function process(filename, source) {\n try {\n if (util.isString(source) && source.charAt(0) === \"{\")\n source = JSON.parse(source);\n if (!util.isString(source))\n self.setOptions(source.options).addJSON(source.nested);\n else {\n parse.filename = filename;\n var parsed = parse(source, self, options),\n resolved,\n i = 0;\n if (parsed.imports)\n for (; i < parsed.imports.length; ++i)\n if (resolved = getBundledFileName(parsed.imports[i]) || self.resolvePath(filename, parsed.imports[i]))\n fetch(resolved);\n if (parsed.weakImports)\n for (i = 0; i < parsed.weakImports.length; ++i)\n if (resolved = getBundledFileName(parsed.weakImports[i]) || self.resolvePath(filename, parsed.weakImports[i]))\n fetch(resolved, true);\n }\n } catch (err) {\n finish(err);\n }\n if (!sync && !queued)\n finish(null, self); // only once anyway\n }","function process(filename, source) {\n try {\n if (util.isString(source) && source.charAt(0) === \"{\")\n source = JSON.parse(source);\n if (!util.isString(source))\n self.setOptions(source.options).addJSON(source.nested);\n else {\n parse.filename = filename;\n var parsed = parse(source, self, options),\n resolved,\n i = 0;\n if (parsed.imports)\n for (; i < parsed.imports.length; ++i)\n if (resolved = getBundledFileName(parsed.imports[i]) || self.resolvePath(filename, parsed.imports[i]))\n fetch(resolved);\n if (parsed.weakImports)\n for (i = 0; i < parsed.weakImports.length; ++i)\n if (resolved = getBundledFileName(parsed.weakImports[i]) || self.resolvePath(filename, parsed.weakImports[i]))\n fetch(resolved, true);\n }\n } catch (err) {\n finish(err);\n }\n if (!sync && !queued)\n finish(null, self); // only once anyway\n }","function readspacemetadata() {\n // Read the file and send to the callback\n fs.readFile(metadatapath, handleFile);\n}","load(fname) {\n let s = fs.readFileSync(fname, \"utf8\");\n let memento = JSON.parse(s);\n this._results = memento.results;\n this._params = memento.params;\n this._combinations = memento.combinations;\n }","parseSignatureFileBuffer(signatureFileBuffer) {\n const fileHashSize = 48; // number of bytes\n let index = 0;\n while (index < signatureFileBuffer.length) {\n const typeDelimiter = signatureFileBuffer[index++];\n\n switch (typeDelimiter) {\n case 4:\n // hash\n this.hash = signatureFileBuffer.subarray(index, index + fileHashSize);\n index += fileHashSize;\n break;\n case 3:\n // signature\n const signatureLength = signatureFileBuffer.readInt32BE(index);\n index += 4;\n this.signature = signatureFileBuffer.subarray(index, index + signatureLength);\n index += signatureLength;\n break;\n default:\n throw new Error(`Unexpected type delimiter '${typeDelimiter}' in signature file at index '${index - 1}'`);\n }\n }\n }","function GeometryParser() {}","function parseFileXML( xmlNode ) {\n\n\t\tgbjson = XML2jsobj( xmlNode );\n\t\t//console.log( 'gbjson', gbjson );\n\n\t\tparseGbJson( gbjson );\n\n\t\treturn gbjson;\n\n\t}","function parseGCTFile(fileContents)\n {\n var data = {\n sampleNames: [],\n rowNames: [],\n rowDescriptions: [],\n matrix: [[]]\n };\n var lines = fileContents.split(/\\r\\n|\\r|\\n/); //fileContents.split(/\\r|\\n/);\n\n if(lines.length >= 4 && lines[0].indexOf(\"#1.2\") != -1)\n {\n //The samples\n var sampleLines = lines[2];\n var samples = sampleLines.split(/\\t/);\n samples.splice(0, 2);\n data.sampleNames = samples;\n\n //the data starts on line 4 for a gct file\n for(var r=3;r<lines.length;r++)\n {\n var rowData = lines[r].split(/\\t/);\n data.rowNames.push(rowData[0]);\n data.rowDescriptions.push(rowData[1]);\n data.matrix[r-3] = rowData.slice(2).map(Number);\n }\n }\n else\n {\n throw new Error(\"Error parsing data: Unexpected number of lines \" + lines.length + \".\");\n }\n\n return data;\n }","function processInput() {\n\n\tvar boundaryInfo = getCourseBoundaries(fileContents);\n\tvar boundaries = boundaryInfo.boundaries;\n\tvar oneSection = RegExp( sectionChunk, 'gim' );\n\tvar j = 0;\n\tfor (var i = 0; i < boundaryInfo.boundaries.length ; ++i) {\n\t\tvar courseSection = fileContents.substring(boundaries[i], boundaries[i+1]);\n\t\twhile(true) {\n\t\t\tvar result = oneSection.exec(courseSection);\n\t\t\tif (!result) break;\n\t\t\tvar sectionInfo = { \n\t\t\t\ttimes : result[4].trim().split('\\n'),\n\t\t\t\trooms : result[5].trim().split('\\n'),\n\t\t\t\tinstructors : result[6].trim().split('\\n'),\n\t\t\t\tdates\t\t\t\t: result[7].trim().split('\\n'),\n\t\t\t};\n\t\t\tsections[j] = {\n\t\t\t\tname : boundaryInfo.courses[i].name,\n\t\t\t\tdisc : boundaryInfo.courses[i].disc,\n\t\t\t\tnum : boundaryInfo.courses[i].num,\n\t\t\t\tCFID : result[1],\n\t\t\t\tsectionName : result[2],\n\t\t\t\tsectionType : result[3],\n\t\t\t\tisFull : ( result[8].trim()[0] === 'O' ? false : true ), // Is it open? TODO: Make case insensitive.\n\t\t\t\tdays : getSessions( sectionInfo ),\n\t\t\t};\n\t\t\t++j;\n\t\t}\n\t\toneSection.lastIndex = 0;\n\t}\n\tconsole.log( JSON.stringify(sections, null, 1) ); // DEBUG\n}","function TextParser() {}","function TextParser() {}","function n(e){e||(e={}),this._file=o.getArg(e,\"file\",null),this._sourceRoot=o.getArg(e,\"sourceRoot\",null),this._sources=new i,this._names=new i,this._mappings=[],this._sourcesContents=null}","function parseTag (context, fname, ctype, valtype, pathfrags, fileScope, defaultScope, docstr, next) {\n if (docstr instanceof Array) {\n for (var i=0,j=Math.max (1, docstr.length); i<j; i++) {\n var workingDocstr = docstr[i] || '';\n workingDocstr = workingDocstr.match (/^[\\r\\n]*([^]*)[\\r\\n]*$/)[1];\n parseTag (\n context,\n fname,\n ctype,\n valtype,\n pathfrags,\n fileScope,\n defaultScope,\n workingDocstr,\n next\n );\n }\n return;\n }\n var tagScope;\n if (fileScope.length)\n tagScope = fileScope.concat (pathfrags);\n // tagScope = concatPaths (fileScope, pathfrags);\n else if (defaultScope.length && (ctype != 'module' || !pathfrags.length))\n tagScope = defaultScope.concat (pathfrags);\n // tagScope = concatPaths (defaultScope, pathfrags);\n else\n tagScope = pathfrags.concat();\n // tagScope = concatPaths (pathfrags);\n\n if (ctype == 'module')\n fileScope.push.apply (fileScope, pathfrags);\n else if (ctype == 'submodule')\n ctype = 'module';\n // convert @constuctor to @spare\n else if (ctype == 'constructor') {\n ctype = 'spare';\n pathfrags.push ([ '~', 'constructor' ]);\n }\n\n // consume modifiers\n var modifiers = [];\n docstr = consumeModifiers (fname, fileScope, tagScope, next, docstr, modifiers);\n\n // begin searching for inner tags\n var innerMatch = docstr ? docstr.match (Patterns.innerTag) : undefined;\n if (!innerMatch) {\n // the entire comment is one component\n try {\n lastComponent = context.submit (\n tagScope.length ? tagScope : fileScope,\n {\n ctype: ctype,\n valtype: valtype,\n // doc: { value:docstr, context:cloneArr(fileScope) },\n doc: { value:docstr, context:fileScope.concat() },\n modifiers: modifiers\n }\n );\n context.logger.trace ({\n type: ctype,\n file: fname,\n path: tagScope.map (function(a){ return a[0]+a[1]; }).join('')\n }, 'read declaration');\n return;\n } catch (err) {\n context.logger.error (err, 'parsing error');\n return;\n }\n }\n\n var argscope = tagScope.concat();\n var inpathstr = innerMatch[3];\n var inpathfrags = [];\n var insigargs;\n var pathMatch;\n var linkScope = fileScope.concat();\n var lastComponent;\n do {\n if (\n ctype == 'callback'\n || ctype == 'argument'\n || ctype == 'kwarg'\n || ctype == 'args'\n || ctype == 'kwargs'\n || ctype == 'returns'\n || ctype == 'signature'\n )\n submissionPath = argscope.concat (inpathfrags);\n // submissionPath = concatPaths (argscope, inpathfrags);\n else if (ctype != 'load')\n submissionPath = tagScope.concat (inpathfrags);\n // submissionPath = concatPaths (tagScope, inpathfrags);\n\n // any chance this is just a @load declaration?\n if (ctype == 'load') {\n var lookupPath =\n inpathfrags[0][1]\n || docstr.slice (0, innerMatch.index).replace (/^\\s*/, '').replace (/\\s*$/, '')\n ;\n var filename = pathLib.resolve (pathLib.dirname (fname), lookupPath);\n var loadedDoc;\n if (Object.hasOwnProperty.call (loadedDocuments, filename))\n loadedDoc = loadedDocuments[filename];\n else try {\n context.latency.log ('parsing');\n loadedDoc = fs.readFileSync (filename).toString();\n context.latency.log ('file system');\n } catch (err) {\n context.logger.warn (\n { filename:filename },\n '@load Declaration failed'\n );\n }\n if (loadedDoc)\n context.submit (\n submissionPath,\n { doc: { value:loadedDoc } }\n );\n } else\n // submit the previous match\n try {\n var inlineDocStr = docstr.slice (0, innerMatch.index);\n if (inlineDocStr.match (/^[\\s\\n]*$/))\n inlineDocStr = '';\n if (\n ctype != 'returns'\n || valtype.length\n || inlineDocStr\n || modifiers.length\n || insigargs\n || submissionPath[submissionPath.length-1][1]\n )\n lastComponent = context.submit (\n submissionPath,\n {\n ctype: ctype,\n valtype: valtype,\n doc: { value:inlineDocStr, context:linkScope },\n modifiers: modifiers,\n sigargs: insigargs\n }\n );\n context.logger.trace ({\n type: ctype,\n file: fname,\n path: submissionPath.map (function(a){ return a[0]+a[1]; }).join('')\n }, 'read declaration');\n } catch (err) {\n context.logger.error (err, 'parsing error');\n return;\n }\n\n // prepare the next submission\n if (ctype == 'returns') {\n if (!inpathstr && argscope.length > tagScope.length)\n argscope.pop();\n } else if (ctype == 'callback')\n argscope = argscope.concat (inpathfrags);\n // argscope = concatPaths (argscope, inpathfrags);\n else if (\n ctype != 'argument'\n && ctype != 'kwarg'\n && ctype != 'args'\n && ctype != 'kwargs'\n && ctype != 'returns'\n && ctype != 'signature'\n )\n argscope = tagScope.concat (inpathfrags);\n // argscope = concatPaths (cloneArr (tagScope), inpathfrags);\n\n linkScope = fileScope.concat();\n // linkScope = cloneArr (fileScope);\n modifiers = [];\n ctype = innerMatch[1];\n valtype = innerMatch[2];\n inpathstr = innerMatch[3];\n docstr = innerMatch[4];\n\n if (ctype == 'signature') {\n insigargs = [];\n var sigargSplit = inpathstr.slice(1).slice(0, -1).split (Patterns.signatureArgument);\n inpathstr = '';\n for (var i=1,j=sigargSplit.length; i<j; i+=3) {\n var sigvaltype = parseType (sigargSplit[i], fileScope.length ? fileScope : defaultScope);\n var sigvalname = parsePath (sigargSplit[i+1], fileScope);\n if (sigvalname && !sigvalname[0][0])\n sigvalname[0][0] = '(';\n var sigargargpath = tagScope.concat (sigvalname);\n // var sigargargpath = concatPaths (cloneArr (tagScope), sigvalname);\n var sigvalnameStr;\n if (sigvalname && sigvalname.length)\n sigvalnameStr = sigvalname.slice(-1)[0][1];\n insigargs.push ({\n name: sigvalnameStr,\n valtype: sigvaltype,\n path: sigargargpath\n });\n }\n inpathfrags = [ [ ] ];\n } else\n inpathfrags = parsePath (inpathstr, fileScope);\n\n if (inpathfrags[0] && !inpathfrags[0][0])\n if (inpathfrags.length == 1)\n inpathfrags[0][0] = Patterns.delimitersInverse[ctype] || '.';\n else\n inpathfrags[0][0] = '.';\n\n // direct-to-type syntax\n if (!Patterns.innerCtypes.hasOwnProperty (ctype)) {\n valtype = ctype;\n ctype = Patterns.delimiters[inpathfrags[inpathfrags.length-1][0]];\n }\n\n // convert @constuctor to @spare\n if (ctype == 'constructor') {\n ctype = 'spare';\n inpathfrags[inpathfrags.length-1][0] = '~';\n inpathfrags[inpathfrags.length-1][1] = 'constructor';\n }\n\n valtype = parseType (valtype, fileScope.length ? fileScope : defaultScope);\n\n // consume modifiers\n docstr = consumeModifiers (fname, fileScope, tagScope, next, docstr, modifiers);\n\n // some tags affect the scope\n if (ctype == 'module') {\n fileScope.push.apply (fileScope, inpathfrags);\n // tagScope.push.apply (tagScope, inpathfrags);\n }\n if (ctype == 'submodule')\n ctype = 'module';\n\n } while (docstr && (innerMatch = docstr.match (Patterns.innerTag)));\n\n // submit the final match from this tag\n var submissionPath;\n if (\n ctype == 'callback'\n || ctype == 'argument'\n || ctype == 'kwarg'\n || ctype == 'args'\n || ctype == 'kwargs'\n || ctype == 'returns'\n || ctype == 'signature'\n )\n submissionPath = argscope.concat (inpathfrags);\n // submissionPath = concatPaths (argscope, inpathfrags);\n else if (ctype != 'load')\n submissionPath = tagScope.concat (inpathfrags);\n // submissionPath = concatPaths (cloneArr (tagScope), inpathfrags);\n\n // consume modifiers\n docstr = consumeModifiers (fname, fileScope, tagScope, next, docstr, modifiers);\n\n // any chance this is just a @load declaration?\n if (ctype == 'load') {\n var lookupPath =\n inpathfrags[0][1]\n || docstr.replace (/^\\s*/, '').replace (/\\s*$/, '')\n ;\n var filename = pathLib.resolve (pathLib.dirname (fname), lookupPath);\n var loadedDoc;\n if (Object.hasOwnProperty.call (loadedDocuments, filename))\n loadedDoc = loadedDocuments[filename];\n else try {\n context.latency.log ('parsing');\n loadedDoc = fs.readFileSync (filename).toString();\n context.latency.log ('file system');\n } catch (err) {\n context.logger.warn (\n { filename:filename },\n '@load Declaration failed'\n );\n }\n if (loadedDoc)\n lastComponent = context.submit (\n submissionPath,\n { doc: { value:loadedDoc } }\n );\n } else {\n if (\n ctype != 'returns'\n || valtype.length\n || inlineDocStr\n || modifiers.length\n || insigargs\n || submissionPath[submissionPath.length-1][1]\n )\n try {\n lastComponent = context.submit (\n submissionPath,\n {\n ctype: ctype,\n valtype: valtype,\n doc: { value:docstr, context:linkScope },\n modifiers: modifiers,\n sigargs: insigargs\n }\n );\n context.logger.trace ({\n type: ctype,\n file: fname,\n path: submissionPath.map (function(a){ return a[0]+a[1]; }).join('')\n }, 'read declaration');\n } catch (err) {\n context.logger.error (err, 'parsing error');\n return;\n }\n }\n}","function parseTopLevel() {\n parseBlockBody(TokenType.eof);\n state.scopes.push(new Scope(0, state.tokens.length, true));\n if (state.scopeDepth !== 0) {\n throw new Error(`Invalid scope depth at end of file: ${state.scopeDepth}`);\n }\n return new File(state.tokens, state.scopes);\n}","doParse(content: string): any {\n let lines = this.getLines(content);\n return this.parseContent(lines);\n }","function readFile (evt) {\r\n var files = evt.target.files;\r\n var file = files[0]; \r\n Papa.parse(file, {\r\n \tcomplete: function(results) {\r\n \t\tlog(results);\r\n \t}\r\n }, config);\r\n }","function parse(file: string): ParserReturn {\n if (file.match(/\\.tsx?$/)) {\n return TypeScriptParser.parse(file);\n } else {\n return babylonParser(file);\n }\n}","@memoize\n get parser() {\n return new TaskList({\n name: `Parsing ${this.type}: ${this.projectName}`,\n tasks: [\n new Task({\n name: `Loading ${this.type}`,\n run: (parentScope) => {\n this.resetCompiled()\n const scope = this.getScope(parentScope)\n this.setState(\"scope\", scope)\n return this.load()\n }\n }),\n TaskList.forEach({\n name: `Parsing imports`,\n list: () => this.activeImports,\n getTask: (file) =>\n new Task({\n name: `Parsing import: ${file.file}`,\n run: () => file.parse(this.scope)\n })\n })\n ]\n })\n }","parse() {\n while (this.shouldContinue()) {\n const c = this.buffer.charCodeAt(this.index - this.offset);\n switch (this.state) {\n case Tokenizer_State.Text: {\n this.stateText(c);\n break;\n }\n case Tokenizer_State.SpecialStartSequence: {\n this.stateSpecialStartSequence(c);\n break;\n }\n case Tokenizer_State.InSpecialTag: {\n this.stateInSpecialTag(c);\n break;\n }\n case Tokenizer_State.CDATASequence: {\n this.stateCDATASequence(c);\n break;\n }\n case Tokenizer_State.InAttributeValueDq: {\n this.stateInAttributeValueDoubleQuotes(c);\n break;\n }\n case Tokenizer_State.InAttributeName: {\n this.stateInAttributeName(c);\n break;\n }\n case Tokenizer_State.InCommentLike: {\n this.stateInCommentLike(c);\n break;\n }\n case Tokenizer_State.InSpecialComment: {\n this.stateInSpecialComment(c);\n break;\n }\n case Tokenizer_State.BeforeAttributeName: {\n this.stateBeforeAttributeName(c);\n break;\n }\n case Tokenizer_State.InTagName: {\n this.stateInTagName(c);\n break;\n }\n case Tokenizer_State.InClosingTagName: {\n this.stateInClosingTagName(c);\n break;\n }\n case Tokenizer_State.BeforeTagName: {\n this.stateBeforeTagName(c);\n break;\n }\n case Tokenizer_State.AfterAttributeName: {\n this.stateAfterAttributeName(c);\n break;\n }\n case Tokenizer_State.InAttributeValueSq: {\n this.stateInAttributeValueSingleQuotes(c);\n break;\n }\n case Tokenizer_State.BeforeAttributeValue: {\n this.stateBeforeAttributeValue(c);\n break;\n }\n case Tokenizer_State.BeforeClosingTagName: {\n this.stateBeforeClosingTagName(c);\n break;\n }\n case Tokenizer_State.AfterClosingTagName: {\n this.stateAfterClosingTagName(c);\n break;\n }\n case Tokenizer_State.BeforeSpecialS: {\n this.stateBeforeSpecialS(c);\n break;\n }\n case Tokenizer_State.InAttributeValueNq: {\n this.stateInAttributeValueNoQuotes(c);\n break;\n }\n case Tokenizer_State.InSelfClosingTag: {\n this.stateInSelfClosingTag(c);\n break;\n }\n case Tokenizer_State.InDeclaration: {\n this.stateInDeclaration(c);\n break;\n }\n case Tokenizer_State.BeforeDeclaration: {\n this.stateBeforeDeclaration(c);\n break;\n }\n case Tokenizer_State.BeforeComment: {\n this.stateBeforeComment(c);\n break;\n }\n case Tokenizer_State.InProcessingInstruction: {\n this.stateInProcessingInstruction(c);\n break;\n }\n case Tokenizer_State.InNamedEntity: {\n this.stateInNamedEntity(c);\n break;\n }\n case Tokenizer_State.BeforeEntity: {\n this.stateBeforeEntity(c);\n break;\n }\n case Tokenizer_State.InHexEntity: {\n this.stateInHexEntity(c);\n break;\n }\n case Tokenizer_State.InNumericEntity: {\n this.stateInNumericEntity(c);\n break;\n }\n default: {\n // `this._state === State.BeforeNumericEntity`\n this.stateBeforeNumericEntity(c);\n }\n }\n this.index++;\n }\n this.cleanup();\n }","function LevelParser(filename) {\n //Engine.Object.call(this);\n this.filename = filename;\n }","function parseWithLocation(content, filename, locationKeyName) {\r\n return _parse(content, filename, locationKeyName);\r\n}","function parseFile(fileToParse){\n var fs = require('fs');\n var decodedFile = {};\n\n var toDecode = fs.readFileSync(fileToParse);\n\n // pass the byte array into _parse for decoding\n decodedFile = _parse(toDecode).result;\n\n return decodedFile;\n}","function reqListener() {\n console.log('File loaded: ' + sourceLocation);\n cm.setValue(this.responseText);\n engineStartup();\n }","load() {\n this.completed = false;\n this.rendered = false;\n\n // Resets variables on load\n this.raw = [];\n this.header = [];\n this.selected = [];\n if (this.chart instanceof Chart) this.chart.destroy();\n\n let readRange = {};\n if (this.fileReadRange != null) readRange = this.getNumColsFromA1(this.fileReadRange);\n console.log(`Will read ${ readRange.numCols > 0 ? 'first ' + readRange.numCols : 'all'} columns and ${ readRange.numRows > 0 ? 'first ' + readRange.numRows : 'all'} rows.`);\n this.fileReadRange = readRange.col + (readRange.numRows > 0 ? readRange.numRows : '');\n \n const selectedFile = document.getElementById('myfile').files[0];\n console.log(selectedFile.name);\n this.fileName = selectedFile.name;\n Papa.parse(selectedFile, {\n skipEmptyLines: true,\n preview: readRange.numRows > 0 ? readRange.numRows : 0,\n complete: (results) => {\n console.log('Finished:', results.data);\n this.raw = results.data;\n this.limitColumns(readRange.numCols > 0 ? readRange.numCols : 0);\n this.header = Array.from(this.raw[0]); // problem: duplicated / null headers\n this.header.shift();\n this.refreshPreview();\n this.completed = true;\n console.log(this.completed);\n }\n });\n }","function parseData(e) {\r\n const file = e.target.files[0];\r\n\r\n Papa.parse(file, {\r\n dynamicTyping: true,\r\n complete: function(results) {\r\n $('header').hide();\r\n $('main').prepend(`<h1 class=\"tableTitle\">Christopher Duerkes</h1>`);\r\n createTable(results.data);\r\n addEventListeners();\r\n }\r\n });\r\n}","function parseRawGeometry(asset, cfg, geometryId, ok) {\n /*\n Geometry format\n\n bytes : info\n [0.. 3]: uint32; file type identifer (= 0x11)\n [4.. 7]: uint32; byte-length of padded asset id\n [8..11]: uint32; byte-length of padded morph keys JSON\n [12..15]: uint32; byte-length of positions array\n [16..19]: uint32; byte-length of normals array\n [20..23]: uint32; byte-length of indices array\n [24..27]: uint32; byte-length of uv array\n [28..43]: unit32[4]; unused, reserved for future use\n [ .. ]: text; asset id (tail-padded with empty spaces, e.g. 0x20)\n [ .. ]: text; morph key JSON (tail-padded with 0x20)\n [ .. ]: float32[]; positions array\n [ .. ]: float32[]; normals array\n [ .. ]: int32[]; indices array\n [ .. ]: float32[]; uv array\n */\n\n var index = new Uint32Array(asset, 0, 11);\n\n var assetIdSize = index[1];\n var keysSize = index[2];\n var positionsSize = index[3];\n var normalsSize = index[4];\n var indicesSize = index[5];\n var uvsSize = index[6];\n // var unused = index[7 ... 10];\n\n var assetIdStart = 11 * Uint32Array.BYTES_PER_ELEMENT;\n var keysStart = assetIdStart + assetIdSize;\n var positionsStart = keysStart + keysSize;\n var normalsStart = positionsStart + positionsSize;\n var indicesStart = normalsStart + normalsSize;\n var uvsStart = indicesStart + indicesSize;\n\n var numVertices = 0;\n\n if (positionsSize > 0) {\n cfg.geometry.positions = new Float32Array(asset, positionsStart, positionsSize / Float32Array.BYTES_PER_ELEMENT);\n cfg.boundary = getBoundary(cfg.geometry.positions);\n numVertices = cfg.geometry.positions.length / 3;\n }\n\n if (normalsSize > 0) {\n cfg.geometry.normals = new Float32Array(asset, normalsStart, normalsSize / Float32Array.BYTES_PER_ELEMENT);\n }\n\n if (uvsSize > 0) {\n cfg.geometry.uv = new Float32Array(asset, uvsStart, uvsSize / Float32Array.BYTES_PER_ELEMENT);\n }\n\n if (indicesSize > 0) {\n cfg.geometry.indices = new Uint32Array(asset, indicesStart, indicesSize / Uint32Array.BYTES_PER_ELEMENT);\n if (numVertices <= 256) {\n cfg.geometry.indices = new Uint8Array(cfg.geometry.indices);\n } else if (numVertices <= 65536) {\n cfg.geometry.indices = new Uint16Array(cfg.geometry.indices);\n }\n }\n\n ok(HumanAssetsGeometries.createGeometry(geometryId, cfg));\n }","function FontParserSVG(rawData) {\n\t this.rawData = rawData;\n\t this._domParser = new DOMParser();\n\t this._document = this._domParser.parseFromString(rawData, 'application/xml');\n\t this._parseFontProperties();\n\t this._parseFontKerning();\n\t }","parse() {\n return this.parseSection (this.pos);\n}","function _readFile(evt) {\n //Retrieve the uploaded File\n const file = evt.target.files[0],\n fileReader = new FileReader();\n\n //callback once file loaded, the loaded file is in text format\n fileReader.onload = function(content) {\n\n // Step 1: convert the textfile to obtain HTML DOM object to access the info section\n let toHTMLDOM = convertToHTMLDOM(content);\n\n // Step 2: create a map for the bio obtained via DOM acceess\n fetchVCardData(toHTMLDOM);\n\n // branch to reset the page, when a second file is uploaded\n if (properties.container.childNodes.length > 0) {\n resetPage();\n }\n\n //Step 3: create the network\n createNetwork();\n }\n fileReader.readAsText(file);\n }","function TextParser() { }","async load (filePath) {\n console.log(`Deserializing from ${filePath}`)\n this.data = this.formatStrategy.deserialize(\n await fs.readFile(filePath, 'utf-8')\n )\n }","*_parseLines(lines) {\n const reTag = /^:([0-9]{2}|NS)([A-Z])?:/;\n let tag = null;\n\n for (let i of lines) {\n\n // Detect new tag start\n const match = i.match(reTag);\n if (match || i.startsWith('-}') || i.startsWith('{')) {\n if (tag) {yield tag;} // Yield previous\n tag = match // Start new tag\n ? {\n id: match[1],\n subId: match[2] || '',\n data: [i.substr(match[0].length)]\n }\n : {\n id: 'MB',\n subId: '',\n data: [i.trim()],\n };\n } else { // Add a line to previous tag\n tag.data.push(i);\n }\n }\n\n if (tag) { yield tag; } // Yield last\n }"],"string":"[\n \"function parse(fileName) {\\n\\n var baseDir = path.dirname(fileName);\\n\\n var jsonData = parseFile(fileName);\\n if (!jsonData) {\\n return null;\\n }\\n\\n jsonData = replace(baseDir, jsonData, 'segment');\\n if (!jsonData) {\\n return null;\\n }\\n\\n\\n if (jsonData.hasOwnProperty('segment')) {\\n if (!Array.isArray(jsonData.segment)) {\\n console.error('segment must be array');\\n return null;\\n }\\n for (var i = 0; i < jsonData.segment.length; i++) {\\n\\n var segment = jsonData.segment[i];\\n segment = replace(baseDir, segment, 'host');\\n if (!segment) {\\n return null;\\n }\\n segment = replace(baseDir, segment, 'gateway');\\n if (!segment) {\\n return null;\\n }\\n jsonData.segment[i] = segment;\\n }\\n }\\n\\n jsonData = replace(baseDir, jsonData, 'event');\\n\\n //console.log(JSON.stringify(jsonData));\\n return jsonData;\\n}\",\n \"function BinaryParser() {}\",\n \"function BinaryParser() {}\",\n \"function BinaryParser() {}\",\n \"function BinaryParser() {}\",\n \"function BinaryParser() {}\",\n \"function parse(file) {\\n let names = [];\\n let parts = file.split(':');\\n parts[0].split('\\\\n').forEach(function(line) {\\n if (line !== '') {\\n names.push(line.split(',')[0]);\\n }\\n });\\n let n = -1;\\n parts[1].split('\\\\n').forEach(function(line) {\\n if (n >= 0) {\\n data[names[n]] = line;\\n }\\n n++;\\n });\\n}\",\n \"function parse( file ) {\\n\\t\\treturn __awaiter( this, void 0, void 0, function () {\\n\\t\\t\\treturn __generator( this, function ( _a ) {\\n\\t\\t\\t\\treturn [\\n\\t\\t\\t\\t\\t2,\\n\\t\\t\\t\\t\\t/*return*/\\n\\t\\t\\t\\t\\tnew Promise( function ( resolve, reject ) {\\n\\t\\t\\t\\t\\t\\tfs.readFile( file, 'utf8', function ( err, data ) {\\n\\t\\t\\t\\t\\t\\t\\tif ( err ) {\\n\\t\\t\\t\\t\\t\\t\\t\\treject( err );\\n\\t\\t\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tresolve( parseString( data ) );\\n\\t\\t\\t\\t\\t\\t} );\\n\\t\\t\\t\\t\\t} ),\\n\\t\\t\\t\\t];\\n\\t\\t\\t} );\\n\\t\\t} );\\n\\t}\",\n \"function BinaryParser() { }\",\n \"function parseFile(event) {\\n Papa.parse(event.target.files[0], {\\n complete: function (results) {\\n console.log(results.data)\\n setParse(results.data);\\n setIsReady(true)\\n }\\n })\\n }\",\n \"function parseRawTagData() {\\n\\n\\t// Pre-populate the `generators.all` store with\\n\\t// all of the generator names, so that they can\\n\\t// be referenced.\\n\\t_.each( rawTagData, function( gen, path ) {\\n\\t\\tlet name = getGeneratorNameFromPath( path );\\n\\t\\tgenerators.all[ name ] = null;\\n\\t});\\n\\n\\t// Iterate over each file and its Dox data\\n\\t_.each( rawTagData, function( gen, path ) {\\n\\n\\t\\t// Resolve a name for the generator\\n\\t\\tlet name = getGeneratorNameFromPath( path );\\n\\n\\t\\t// Initialize a generator info object\\n\\t\\tlet item = {\\n\\t\\t\\tname: name,\\n\\t\\t\\ttype: \\\"partial\\\",\\n\\t\\t\\tisDefault: false,\\n\\t\\t\\tdescription: gen.description,\\n\\t\\t\\tauthor: null,\\n\\t\\t\\tcreated: null,\\n\\t\\t\\tpaths: {\\n\\t\\t\\t\\tabs: path,\\n\\t\\t\\t\\trel: getRelativeGeneratorPath( path )\\n\\t\\t\\t},\\n\\t\\t\\tuses: {},\\n\\t\\t\\tcreates: {},\\n\\t\\t\\toperations: [],\\n\\t\\t\\tpromptsFor: {},\\n\\t\\t\\texample: null\\n\\t\\t};\\n\\n\\t\\t// Parse each tag object generated by Dox\\n\\t\\t_.each( gen.doxData, function( tag ) {\\n\\t\\t\\tparseOneTag( item, tag );\\n\\t\\t});\\n\\n\\t\\t// Persist the generator info object\\n\\t\\tgenerators.all[ name ] = item;\\n\\t\\tgenerators[ item.type ][ name ] = item;\\n\\n\\t});\\n\\n}\",\n \"function parse(file) {\\n return __awaiter(this, void 0, void 0, function () {\\n return __generator(this, function (_a) {\\n return [2\\n /*return*/\\n , new Promise(function (resolve, reject) {\\n fs.readFile(file, 'utf8', function (err, data) {\\n if (err) {\\n reject(err);\\n return;\\n }\\n\\n resolve(parseString(data));\\n });\\n })];\\n });\\n });\\n }\",\n \"parse() {\\n /**\\n * The first two bytes are a bitmask which states which features are present in the mapFile\\n * The second two bytes are.. something?\\n */\\n const featureFlags = this.take(2, \\\"featureFlags\\\").readUInt16LE(0);\\n this.take(2, \\\"unknown01\\\");\\n if (featureFlags & 0b000000000000001) {\\n this.robotStatus = this.take(0x2C, \\\"robot status\\\");\\n }\\n\\n\\n if (featureFlags & 0b000000000000010) {\\n this.mapHead = this.take(0x28, \\\"map head\\\");\\n this.parseImg();\\n }\\n if (featureFlags & 0b000000000000100) {\\n let head = asInts(this.take(12, \\\"history\\\"));\\n this.history = [];\\n for (let i = 0; i < head[2]; i++) {\\n // Convert from ±meters to mm. UI assumes center is at 20m\\n let position = this.readFloatPosition(this.buf, this.offset + 1);\\n // first byte may be angle or whether robot is in taxi mode/cleaning\\n //position.push(this.buf.readUInt8(this.offset)); //TODO\\n this.history.push(position[0], position[1]);\\n this.offset += 9;\\n }\\n }\\n if (featureFlags & 0b000000000001000) {\\n // TODO: Figure out charge station location from this.\\n let chargeStation = this.take(16, \\\"charge station\\\");\\n this.chargeStation = {\\n position: this.readFloatPosition(chargeStation, 4),\\n orientation: chargeStation.readFloatLE(12)\\n };\\n }\\n if (featureFlags & 0b000000000010000) {\\n let head = asInts(this.take(12, \\\"virtual wall\\\"));\\n\\n this.virtual_wall = [];\\n this.no_go_area = [];\\n\\n let wall_num = head[2];\\n\\n for (let i = 0; i < wall_num; i++) {\\n this.take(12, \\\"virtual wall prefix\\\");\\n let body = asFloat(this.take(32, \\\"Virtual walls coords\\\"));\\n\\n if (body[0] === body[2] && body[1] === body[3] && body[4] === body[6] && body[5] === body[7]) {\\n //is wall\\n let x1 = Math.round(ViomiMapParser.convertFloat(body[0]));\\n let y1 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[1]));\\n let x2 = Math.round(ViomiMapParser.convertFloat(body[4]));\\n let y2 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[5]));\\n\\n this.virtual_wall.push([x1, y1, x2, y2]);\\n } else {\\n //is zone\\n let x1 = Math.round(ViomiMapParser.convertFloat(body[0]));\\n let y1 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[1]));\\n let x2 = Math.round(ViomiMapParser.convertFloat(body[2]));\\n let y2 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[3]));\\n let x3 = Math.round(ViomiMapParser.convertFloat(body[4]));\\n let y3 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[5]));\\n let x4 = Math.round(ViomiMapParser.convertFloat(body[6]));\\n let y4 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[7]));\\n\\n this.no_go_area.push([x1, y1, x2, y2, x3, y3, x4, y4]);\\n }\\n\\n this.take(48, \\\"unknown48\\\");\\n }\\n }\\n if (featureFlags & 0b000000000100000) {\\n let head = asInts(this.take(12, \\\"area head\\\"));\\n let area_num = head[2];\\n\\n this.clean_area = [];\\n\\n for (let i = 0; i < area_num; i++) {\\n this.take(12, \\\"area prefix\\\");\\n let body = asFloat(this.take(32, \\\"area coords\\\"));\\n\\n let x1 = Math.round(ViomiMapParser.convertFloat(body[0]));\\n let y1 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[1]));\\n let x2 = Math.round(ViomiMapParser.convertFloat(body[2]));\\n let y2 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[3]));\\n let x3 = Math.round(ViomiMapParser.convertFloat(body[4]));\\n let y3 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[5]));\\n let x4 = Math.round(ViomiMapParser.convertFloat(body[6]));\\n let y4 = Math.round(ViomiMapParser.MAX_MAP_HEIGHT - ViomiMapParser.convertFloat(body[7]));\\n\\n this.clean_area.push([x1, y1, x2, y2, x3, y3, x4, y4]);\\n\\n this.take(48, \\\"unknown48\\\");\\n }\\n }\\n if (featureFlags & 0b000000001000000) {\\n let navigateTarget = this.take(20, \\\"navigate\\\");\\n this.navigateTarget = {position: this.readFloatPosition(navigateTarget, 8)};\\n }\\n if (featureFlags & 0b000000010000000) {\\n let realtimePose = this.take(21, \\\"realtime\\\");\\n this.realtimePose = {position: this.readFloatPosition(realtimePose, 9)};\\n }\\n\\n if (featureFlags & 0b000100000000000) {\\n //v6 example: 5b590f5f00000001\\n //v7 example: e35a185e00000001\\n this.take(8, \\\"unknown8\\\");\\n this.parseRooms();\\n // more stuff i don't understand\\n this.take(50, \\\"unknown50\\\");\\n this.take(5, \\\"unknown5\\\");\\n this.points = [];\\n try {\\n this.parsePose();\\n } catch (e) {\\n Logger.warn(\\\"Unable to parse Pose\\\", e); //TODO\\n }\\n }\\n this.take(this.buf.length - this.offset, \\\"trailing\\\");\\n\\n // TODO: one of them is just the room outline, not actual past navigation logic\\n return this.convertToValetudoMap({\\n image: this.img,\\n zones: this.rooms,\\n //TODO: at least according to all my sample files, this.points is never the path\\n //Why is this here?\\n //path: {points: this.points.length ? this.points : this.history},\\n path: {points: this.history},\\n goto_target: this.navigateTarget && this.navigateTarget.position,\\n robot: this.realtimePose && this.realtimePose.position,\\n charger: this.chargeStation && this.chargeStation.position,\\n virtual_wall: this.virtual_wall,\\n no_go_area: this.no_go_area,\\n clean_area: this.clean_area\\n });\\n }\",\n \"function parseFile(str) {\\n\\n\\t\\t// Verifying str type\\n\\t\\tif (typeof str !== 'string') {\\n\\t\\t\\talert('Sorry... we had a uhh... error parsing?');\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\t// RegEx is a blast -_-\\n\\t\\tlet newParsedArr = str.match(/['\\\"].*?['\\\"]/g).map(item => {\\n\\t\\t\\treturn item.replace(/['\\\"]/g, \\\"\\\");\\n\\t\\t});\\n\\t\\tformatPaths(newParsedArr);\\n\\t}\",\n \"load(file) {\\n this._loading = file;\\n\\n // Read file and split into lines\\n const map = {};\\n\\n const content = fs.readFileSync(file, 'ascii');\\n const lines = content.split(/[\\\\r\\\\n]+/);\\n\\n lines.forEach(line => {\\n // Clean up whitespace/comments, and split into fields\\n const fields = line.replace(/\\\\s*#.*|^\\\\s*|\\\\s*$/g, '').split(/\\\\s+/);\\n map[fields.shift()] = fields;\\n });\\n\\n this.define(map);\\n\\n this._loading = null;\\n }\",\n \"function parseHBX(completePath)\\n{\\n\\tnTodo++;\\n\\tlet fileName = path.parse(completePath).name\\n\\tvar ck = /DYNAMIC\\\\s+([_a-z0-9]+)/i;\\n\\tvar reader = readline.createInterface({input:fs.createReadStream(completePath,\\\"utf8\\\")});\\n\\treader.on(\\\"line\\\",l =>\\n\\t{\\n\\t\\tvar m = l.match(ck);\\n\\t\\tif(m && m[1])\\n\\t\\t{\\n\\t\\t\\tstdMethods.push([m[1],fileName]);\\n\\t\\t}\\n\\t});\\n\\treader.on(\\\"close\\\",() =>\\n\\t{\\n\\t\\tnTodo--;\\n\\t\\tif(nTodo==0)\\n\\t\\t\\tcreateDoc();\\n\\t})\\n}\",\n \"parseFlsFile(baseFile) {\\r\\n this.extension.logger.addLogMessage('Parse fls file.');\\r\\n const rootDir = path.dirname(baseFile);\\r\\n const outDir = this.getOutDir(baseFile);\\r\\n const flsFile = path.resolve(rootDir, path.join(outDir, path.basename(baseFile, '.tex') + '.fls'));\\r\\n if (!fs.existsSync(flsFile)) {\\r\\n this.extension.logger.addLogMessage(`Cannot find fls file: ${flsFile}`);\\r\\n return;\\r\\n }\\r\\n this.extension.logger.addLogMessage(`Fls file found: ${flsFile}`);\\r\\n const ioFiles = this.parseFlsContent(fs.readFileSync(flsFile).toString(), rootDir);\\r\\n ioFiles.input.forEach((inputFile) => {\\r\\n // Drop files that are also listed as OUTPUT or should be ignored\\r\\n if (ioFiles.output.includes(inputFile) ||\\r\\n this.isExcluded(inputFile) ||\\r\\n !fs.existsSync(inputFile)) {\\r\\n return;\\r\\n }\\r\\n // Drop the current rootFile often listed as INPUT and drop any file that is already in the texFileTree\\r\\n if (baseFile === inputFile || inputFile in this.cachedContent) {\\r\\n return;\\r\\n }\\r\\n if (path.extname(inputFile) === '.tex') {\\r\\n // Parse tex files as imported subfiles.\\r\\n this.cachedContent[baseFile].children.push({\\r\\n index: Number.MAX_VALUE,\\r\\n file: inputFile\\r\\n });\\r\\n this.parseFileAndSubs(inputFile);\\r\\n }\\r\\n else if (this.fileWatcher && !this.filesWatched.includes(inputFile)) {\\r\\n // Watch non-tex files.\\r\\n this.fileWatcher.add(inputFile);\\r\\n this.filesWatched.push(inputFile);\\r\\n }\\r\\n });\\r\\n ioFiles.output.forEach((outputFile) => {\\r\\n if (path.extname(outputFile) === '.aux' && fs.existsSync(outputFile)) {\\r\\n this.parseAuxFile(fs.readFileSync(outputFile).toString(), path.dirname(outputFile).replace(outDir, rootDir));\\r\\n }\\r\\n });\\r\\n }\",\n \"function parse() {\\n var self = this\\n var value = String(self.file)\\n var start = {line: 1, column: 1, offset: 0}\\n var content = xtend(start)\\n var node\\n\\n // Clean non-unix newlines: `\\\\r\\\\n` and `\\\\r` are all changed to `\\\\n`.\\n // This should not affect positional information.\\n value = value.replace(lineBreaksExpression, lineFeed)\\n\\n // BOM.\\n if (value.charCodeAt(0) === 0xfeff) {\\n value = value.slice(1)\\n\\n content.column++\\n content.offset++\\n }\\n\\n node = {\\n type: 'root',\\n children: self.tokenizeBlock(value, content),\\n position: {start: start, end: self.eof || xtend(start)}\\n }\\n\\n if (!self.options.position) {\\n removePosition(node, true)\\n }\\n\\n return node\\n}\",\n \"function parseAllGRIBs(inData) {\\n // create the object to keep all the data in\\n var weatherDB = new weatherDBObject();\\n\\n // loop through all the grib parts in the file\\n var gribCount = 1;\\n var starttime = +new Date();\\n while (inData.byteLength > 0) {\\n if (gribCount % 10 == 0) {\\n\\n var currentTime = +new Date();\\n starttime = currentTime;\\n }\\n dbg(2, \\\" Starting GRIB Block \\\" + gribCount);\\n gribCount++;\\n var sect0 = new DataView(inData, 0, 16);\\n // Make sure this is a grib file\\n // first 4 characters should be GRIB. Must be a meteorological file (byte 7 = 0) and version 2 (byte 8 = 2). Max length supported is 2^32 (top 32 if length =0)\\n\\n if (sect0.getUint8(0) == 0x47 && sect0.getUint8(1) == 0x52 && sect0.getUint8(2) == 0x49 && sect0.getUint8(3) == 0x42 && sect0.getUint8(6) == 0x0 && sect0.getUint8(7) == 0x2 && sect0.getUint32(8) == 0) {\\n\\n // get the length of the grub file\\n var griblength = sect0.getUint32(12);\\n\\n // trim off this grib\\n var grib = inData.slice(0, griblength);\\n inData = inData.slice(griblength);\\n // at this point grib contains one of the multiple gribs in the source file\\n // there is a separate grib for each parameter and pressure (alt)\\n parseGRIB(grib, weatherDB);\\n if (weatherDB.status < 0) {\\n // error found, return\\n return (weatherDB);\\n }\\n\\n } else {\\n // alert(\\\"ERROR: Not a grib file this parser understands\\\");\\n dbg(0, \\\"ERROR: Not a grib file this parser understands\\\");\\n weatherDB.statusMsg = \\\"ERROR: Not a grib file this parser understands\\\";\\n weatherDB.status = -1;\\n\\t\\t\\tthrow error;\\n return (weatherDB);\\n }\\n }\\n // just keep the unique, sorted values for lats, longs, pressures, & params.\\n weatherDB.lats = arrayUnique(weatherDB.lats);\\n weatherDB.lats.sort(function (a, b) {\\n return a - b\\n });\\n weatherDB.longs = arrayUnique(weatherDB.longs);\\n weatherDB.longs.sort(function (a, b) {\\n return a - b\\n });\\n weatherDB.pressures = arrayUnique(weatherDB.pressures);\\n weatherDB.pressures.sort(function (a, b) {\\n return a - b\\n });\\n weatherDB.params = arrayUnique(weatherDB.params);\\n weatherDB.params.sort();\\n weatherDB.status = 100; // say the data is valid\\n return weatherDB;\\n}\",\n \"parseFileAndSubs(file, onChange = false) {\\r\\n if (this.isExcluded(file)) {\\r\\n this.extension.logger.addLogMessage(`Ignoring ${file}`);\\r\\n return;\\r\\n }\\r\\n this.extension.logger.addLogMessage(`Parsing ${file}`);\\r\\n if (this.fileWatcher && !this.filesWatched.includes(file)) {\\r\\n // The file is first time considered by the extension.\\r\\n this.fileWatcher.add(file);\\r\\n this.filesWatched.push(file);\\r\\n }\\r\\n const content = this.getDirtyContent(file, onChange);\\r\\n this.cachedContent[file].children = [];\\r\\n this.cachedContent[file].bibs = [];\\r\\n this.cachedFullContent = undefined;\\r\\n this.parseInputFiles(content, file);\\r\\n this.parseBibFiles(content, file);\\r\\n // We need to parse the fls to discover file dependencies when defined by TeX macro\\r\\n // It happens a lot with subfiles, https://tex.stackexchange.com/questions/289450/path-of-figures-in-different-directories-with-subfile-latex\\r\\n this.parseFlsFile(file);\\r\\n }\",\n \"function readFile() {\\n\\t\\tlet reader = new FileReader();\\n\\t\\treader.addEventListener('loadend', () => {\\n\\t\\t\\tparseFile(reader.result);\\n\\t\\t});\\n\\t\\treader.readAsText(this.files[0]);\\n\\t}\",\n \"function parseFile(evt){\\n let files = evt.target.files; // FileList object\\n if(files.length === 0){ //if no files\\n return;\\n }\\n let f = files[0];\\n\\n let pointsArray = [];\\n fileFaces = [];\\n let reader = new FileReader();\\n reader.onload = (function(theFile) {\\n return function(e) {\\n let contents = atob(e.target.result.split(\\\"base64,\\\")[1]);\\n contents = contents.split(/\\\\n/); //split contents into lines\\n if(contents[0].replace(/\\\\s+/, \\\"\\\") === \\\"\\\"){ //if first line is blank\\n contents.shift(); //delete it\\n }\\n if(contents[0].replace(/\\\\s+/, \\\"\\\") !== \\\"ply\\\"){ //if first line does not contain \\\"ply\\\"\\n console.log(\\\"No Ply: \\\" + contents[0]); //do nothing with the file\\n return;\\n }\\n\\n let i = 1;\\n let numVerts = 0;\\n let numFaces = 0;\\n\\n while(contents[i].indexOf(\\\"end_header\\\") === -1){ //while we haven't hit the end of the header\\n if(contents[i].indexOf(\\\"element vertex\\\") !== -1){ //if this line indicates # vertices\\n let idx = contents[i].indexOf(\\\"element vertex\\\");\\n numVerts = parseInt(contents[i].substring(idx+14)); //parse # of vertices\\n } else if(contents[i].indexOf(\\\"element face\\\") !== -1){ //if this line indicates # of faces\\n let idx = contents[i].indexOf(\\\"element face\\\");\\n numFaces = parseInt(contents[i].substring(idx+12)); //parse # of faces\\n }\\n i++;\\n }\\n i++; //increment to line just after end_header\\n let left = vec4(Number.MAX_VALUE, 0.0, 0.0, 0.0);\\n let right = vec4(Number.MIN_VALUE, 0.0, 0.0, 0.0);\\n let top = vec4(0.0, Number.MIN_VALUE, 0.0, 0.0);\\n let bottom = vec4(0.0, Number.MAX_VALUE, 0.0, 0.0);\\n let minZ = vec4(0.0, 0.0, Number.MAX_VALUE, 0.0);\\n let maxZ = vec4(0.0, 0.0, Number.MIN_VALUE, 0.0); //initialize extents to easily-overridden values\\n\\n let j = 0;\\n for(j = 0; j < numVerts; j++){ //for each vertex\\n while(contents[i].replace(/\\\\s+/, \\\"\\\") === \\\"\\\"){ //ignore empty lines\\n i++;\\n }\\n let points = contents[i].split(/\\\\s+/); //split along spaces\\n if(points[0].replace(/\\\\s+/, \\\"\\\") === \\\"\\\"){ //ignore empty first element\\n points.shift();\\n }\\n let x = parseFloat(points[0]);\\n let y = parseFloat(points[1]);\\n let z = parseFloat(points[2]);\\n let thisPoint = vec4(x, y, z, 1.0);\\n\\n if(x < left[0]){ //if x is further left\\n left = thisPoint;\\n }\\n if(x > right[0]){ //if x is further right\\n right = thisPoint;\\n }\\n if(y < bottom[1]){ //if y is lower\\n bottom = thisPoint;\\n }\\n if(y > top[1]){ //if y is higher\\n top = thisPoint;\\n }\\n if(z < minZ[2]){ //if Z is further\\n minZ = thisPoint;\\n }\\n if(z > maxZ[2]){ //if Z is closer\\n maxZ = thisPoint;\\n }\\n pointsArray.push(thisPoint);\\n i++;\\n }\\n\\n let divisor = Math.max(right[0]-left[0], top[1]-bottom[1], maxZ[2]-minZ[2]) / 2; //calculate largest dimension\\n let shiftX = (-(right[0] - (right[0]-left[0])/2))/divisor; //X axis translation to center at origin\\n let shiftY = (-(top[1] - (top[1]-bottom[1])/2))/divisor; //Y axis translation to center at origin\\n let shiftZ = (-(maxZ[2] - (maxZ[2]-minZ[2])/2))/divisor; //Z axis translation to center at origin\\n for(j = 0; j < numFaces; j++){ //for each face\\n while(contents[i].replace(/\\\\s+/, \\\"\\\") === \\\"\\\"){ //ignore empty lines\\n i++;\\n }\\n let verts = contents[i].split(/\\\\s+/);\\n if(verts[0].replace(/\\\\s+/, \\\"\\\") === \\\"\\\"){ //if empty first element\\n verts.shift();\\n }\\n let vertLen = parseInt(verts[0]); //parse # vertices\\n verts.shift();\\n\\n for(let k = 0; k < vertLen; k++){ //for # of vertices\\n let currVert = pointsArray[verts[k]];\\n fileFaces.push(vec4(currVert[0]/divisor + shiftX, currVert[1]/divisor + shiftY, currVert[2]/divisor + shiftZ, 1.0));\\n //shift vertex so whole object is centered on origin and [-1, 1], push to face\\n }\\n i++;\\n }\\n let rightBB = right[0]/divisor + shiftX;\\n let topBB = top[1]/divisor + shiftY;\\n let maxZBB = maxZ[2]/divisor + shiftZ;\\n\\n //back face\\n fileBB = generateBB(rightBB, topBB, maxZBB);\\n\\n fileUploaded = true;\\n if(shapeArray.length === 3){ //if another file is already loaded\\n shapeArray.pop(); //get rid of it\\n }\\n shapeArray.push(fileFaces); //push this file to shape array\\n fileFlatNormal = fNormals(shapeArray[2]); //calculate flat normals\\n fileGNormal = gNormals(shapeArray[2]); //calculate gouraud normals\\n generateLines(); //regenerate lines to account fo new bounding box\\n };\\n })(f);\\n reader.readAsDataURL(f);\\n}\",\n \"function loadStructureHandler(text)\\r\\n\\t{\\r\\n\\t var content = text.split(\\\"\\\\n\\\");\\r\\n\\t //console.log(content[1]);\\r\\n\\t BuildStructure(name,content,callback, new ProgressDialog(\\\"Assimilating PDB file \\\"+name+\\\"...\\\"));\\r\\n\\t}\",\n \"function parseText(file) {\\n console.log(file);\\n var lines = file.split(\\\"\\\\n\\\");\\n var params = lines[0].split(\\\" \\\");\\n if (params.length < 3) {\\n console.log(\\\"File format error\\\");\\n return false;\\n }\\n listType = params[0];\\n rowSize = parseInt(params[1], 10);\\n memSize = parseInt(params[2], 10);\\n for (var i = 1; i < lines.length; i++) {\\n //parse each line\\n if (lines[i].length <= 0) break;\\n if (lines[i].charAt(0) == '#') console.log(lines[i]);\\n else {\\n var args = lines[i].split(\\\" \\\");\\n var addr;\\n if (args.length == 2) {\\n //this is a free block\\n var block;\\n freebls.push({\\n address: addr = parseInt(args[0], 16),\\n size: parseInt(args[1], 10),\\n type: FREE\\n });\\n if (addr < memhead) memhead = addr;\\n } else if (args.length == 3) {\\n usedbls.push({\\n address: addr = parseInt(args[0], 16),\\n size: parseInt(args[1], 10),\\n rsize: parseInt(args[2], 10),\\n type: USED\\n });\\n if (addr < memhead) memhead = addr;\\n } else {\\n console.log(\\\"Error parsing file, line \\\" + i + \\\"has incorrect ammount of arguments\\\");\\n return false;\\n }\\n }\\n }\\n\\n if (listType == EXPLICIT) {\\n // add link\\n for (var i = 0; i < freebls.length - 1; i++) {\\n freebls[i].next = freebls[i + 1].address;\\n }\\n }\\n\\n function compare(a, b) {\\n return a.address > b.address;\\n }\\n freebls.sort(compare);\\n if (listType == EXPLICIT) {\\n for (var i = 0; i < freebls.length - 1; i++) {\\n var diff = freebls[i + 1].address - freebls[i].address;\\n if (diff > freebls[i].size) {\\n //there is a used block\\n usedbls.push({\\n address: freebls[i].address + freebls[i].size,\\n size: diff - freebls[i].size,\\n type: USED\\n })\\n }\\n }\\n var lastfree = freebls[freebls.length - 1];\\n var lastusedhead = lastfree.address + lastfree.size;\\n if (memSize > lastfree.address + lastfree.size - memhead) {\\n usedbls.push({\\n address: lastfree.address + lastfree.size,\\n size: memSize + memhead - lastusedhead,\\n type: USED\\n });\\n }\\n }\\n bls = freebls.concat(usedbls);\\n bls.sort(compare);\\n\\n // for (var i = 0; i < freebls.length - 1; i++) {\\n // console.log(\\\"\\\" + freebls[i].address + \\\" \\\" + freebls[i].size);\\n // }\\n\\n initBoxes();\\n\\n return true;\\n}\",\n \"parseFile(file) {\\r\\n this._lines = [];\\r\\n this._currentLine = -1;\\r\\n this._resetStates();\\r\\n\\r\\n lineReader.eachLine(file, (line) => {\\r\\n this._lines.push(ParseUtil.clearCRLF(line));\\r\\n }).then(()=>{\\r\\n this._linesGenerator = this.lineReader();\\r\\n this._readNextLine();\\r\\n });\\r\\n }\",\n \"function parseFile(path, cvt, cb) {\\n if (cvt == null) cvt = adapter;\\n fs.readFile(path, (err, data) => {\\n if (err) return cb(err);\\n xml2js.parseString(data, (err, data) => {\\n if (err) return cb(err);\\n if (! data) return cb(null, null);\\n const key = Object.keys(data)[0];\\n if (! key) return cb(null, null);\\n cb(null, cvt(data[key], key));\\n });\\n });\\n}\",\n \"getDefinition(file, position) {\\n // Overridden in XMLScope. Brs files use implementation in BrsFile\\n return [];\\n }\",\n \"function parseLiveFile(e) {\\n if (e.document.isUntitled) {\\n return;\\n }\\n if (e.document.languageId !== 'go') {\\n return;\\n }\\n if (!goLiveErrorsEnabled()) {\\n return;\\n }\\n if (runner != null) {\\n clearTimeout(runner);\\n }\\n runner = setTimeout(() => {\\n processFile(e);\\n runner = null;\\n }, config_1.getGoConfig(e.document.uri)['liveErrors']['delay']);\\n}\",\n \"function parseFile(file) {\\n\\n if (window.File && window.FileReader && Window.FileList && window.Blob) {\\n alert(\\\"File Reader APIs not up to date on current browser.\\\")\\n return\\n }\\n \\n //create file reader \\n var reader = new FileReader()\\n\\n\\n if(file.files && file.files[0]) {\\n reader.onload = function (e) {\\n parseInput(e.target.result)\\n }\\n\\n reader.readAsText(file.files[0])\\n }\\n else {\\n alert(\\\"Error reading file.\\\")\\n }\\n\\n}\",\n \"function parseFile(err, contents) {\\r\\n const output = parse(contents, {\\r\\n columns: true,\\r\\n skip_empty_lines: true\\r\\n });\\r\\n\\r\\n // Call build function. Interpret and construct Org Chart\\r\\n buildOutput(output);\\r\\n}\",\n \"function BaseBodyParser() {\\n\\t}\",\n \"handleTheFile(event) {\\n event.preventDefault();\\n if (this.inputFile.current.files[0] === undefined) { return; }\\n\\n // Confirm file extension and read the data as text\\n console.log('Reading the file...');\\n let fileName = this.inputFile.current.files[0].name;\\n if (!fileName.endsWith('.asc')) {\\n console.error('Error opening the file: Invalid file extension, .asc expected.');\\n return;\\n }\\n let file = this.inputFile.current.files[0];\\n let reader = new FileReader();\\n reader.onload = (event) => {\\n console.log('Done.');\\n this.ParseTheData(event.target.result);\\n }\\n reader.onerror = () => {\\n console.error('Error opening the file: Cannot read file.');\\n return;\\n }\\n reader.readAsText(file);\\n }\",\n \"function metadataParser(file, callback, errback) {\\n queue.push({file: file, callback: callback, errback: errback});\\n if (!busy)\\n processQueue();\\n }\",\n \"function parsed_done() {\\n\\n\\tconsole.log(fileParsed);\\n\\n}\",\n \"function parse(context, file) {\\n var message\\n\\n if (stats(file).fatal) {\\n return\\n }\\n\\n if (context.treeIn) {\\n debug('Not parsing already parsed document')\\n\\n try {\\n context.tree = json(file.toString())\\n } catch (error) {\\n message = file.message(\\n new Error('Cannot read file as JSON\\\\n' + error.message)\\n )\\n message.fatal = true\\n }\\n\\n // Add the preferred extension to ensure the file, when serialized, is\\n // correctly recognised.\\n // Only add it if there is a path — not if the file is for example stdin.\\n if (file.path) {\\n file.extname = context.extensions[0]\\n }\\n\\n file.contents = ''\\n\\n return\\n }\\n\\n debug('Parsing `%s`', file.path)\\n\\n context.tree = context.processor.parse(file)\\n\\n debug('Parsed document')\\n}\",\n \"function parse (fileName, text) {\\n const reader = Reader.create(fileName, text)\\n const fragments = []\\n\\n // loop through lines, building fragments\\n while (true) {\\n if (reader.atEnd()) break\\n\\n // get the first line of the next fragment\\n reader.skipEmptyLines()\\n\\n const line = reader.read()\\n if (line == null) break\\n\\n // push the fragment line back for fragment handler to process\\n reader.pushBack()\\n\\n const fragment = getFragment(line)\\n if (fragment.read(reader) == null) break\\n\\n fragments.push(fragment)\\n }\\n\\n return fragments\\n}\",\n \"parseFile(file) {\\n\\n var content = this.lire(file);\\n\\n var lines = content.split(/\\\\r?\\\\n/);\\n\\n //string that contains keys\\n var header = lines[0];\\n\\n //array containing data separate with \\\";\\\"\\n var dataLines = lines.slice(1);\\n\\n // data = dataLines.map(this.parser);\\n\\n var data = this.jsonifydata(header,dataLines);\\n\\n console.log(data);\\n\\n }\",\n \"function parse$a(context, file) {\\n var message;\\n\\n if (stats$5(file).fatal) {\\n return\\n }\\n\\n if (context.treeIn) {\\n debug$8('Not parsing already parsed document');\\n\\n try {\\n context.tree = json$1(file.toString());\\n } catch (error) {\\n message = file.message(\\n new Error('Cannot read file as JSON\\\\n' + error.message)\\n );\\n message.fatal = true;\\n }\\n\\n // Add the preferred extension to ensure the file, when serialized, is\\n // correctly recognised.\\n // Only add it if there is a path — not if the file is for example stdin.\\n if (file.path) {\\n file.extname = context.extensions[0];\\n }\\n\\n file.contents = '';\\n\\n return\\n }\\n\\n debug$8('Parsing `%s`', file.path);\\n\\n context.tree = context.processor.parse(file);\\n\\n debug$8('Parsed document');\\n}\",\n \"parseBitmap(buffer, parsed) {\\r\\n\\r\\n // file buffer\\r\\n this.buffer = buffer;\\r\\n\\r\\n // fileType\\r\\n this.type = buffer.toString('utf-8', 0, 2);\\r\\n // fileSize\\r\\n this.fileSize = buffer.readInt32LE(2);\\r\\n // Bytes Per Pixel\\r\\n this.bitsPerPixel = buffer.readInt16LE(28);\\r\\n // Height\\r\\n this.height = buffer.readInt32LE(22);\\r\\n // Width\\r\\n this.width = buffer.readInt32LE(18);\\r\\n // DIB Header size \\r\\n this.sizeOfTheDIBHeader = buffer.readInt32LE(14);\\r\\n // Start of color chart\\r\\n this.colorChart = (this.sizeOfTheDIBHeader + 14 + 12);\\r\\n // Start of pixels\\r\\n this.pixels = buffer.readInt32LE(10);\\r\\n\\r\\n parsed(this);\\r\\n }\",\n \"async parse() {\\n const buffer = await readFile(`${this.file}`);\\n // Create a naked object to model the bitmap properties\\n const parsedBitmap = {};\\n\\n // Identify the offsets by reading the bitmap docs\\n const FILE_SIZE_OFFSET = 2;\\n const WIDTH_OFFSET = 18;\\n const HEIGHT_OFFSET = 22;\\n const BYTES_PER_PIXEL_OFFSET = 28;\\n const COLOR_PALLET_OFFSET = 46;\\n const COLOR_TABLE_OFFSET = 54;\\n const PIXEL_ARRAY_OFFSET = 310;\\n\\n //------------------------------------------------------\\n // READING INFORMATION FROM THE BITMAP FILE\\n //------------------------------------------------------\\n\\n parsedBitmap.type = buffer.toString('utf-8', 0, 2);\\n parsedBitmap.fileSize = buffer.readInt32LE(FILE_SIZE_OFFSET);\\n parsedBitmap.bytesPerPixel = buffer.readInt16LE(BYTES_PER_PIXEL_OFFSET);\\n parsedBitmap.height = buffer.readInt32LE(HEIGHT_OFFSET);\\n parsedBitmap.width = buffer.readInt32LE(WIDTH_OFFSET);\\n parsedBitmap.colorPallet = buffer.readInt32LE(COLOR_PALLET_OFFSET);\\n parsedBitmap.colorTable = buffer.readInt32LE(COLOR_TABLE_OFFSET);\\n parsedBitmap.pixelArray = buffer.readInt32LE(PIXEL_ARRAY_OFFSET);\\n\\n const colorTable = buffer.slice(PIXEL_ARRAY_OFFSET);\\n const tableOfColors = buffer.slice(COLOR_TABLE_OFFSET, PIXEL_ARRAY_OFFSET);\\n\\n // Bottom left boundary = 1146\\n // Top right boundary = buffer.length\\n // Color table = 121 to 1145 (1145 - 4 * 256)\\n // const num = 6111 - 3 * 112;\\n // const blockheight = 400;\\n\\n // console.log(parsedBitmap);\\n return parsedBitmap;\\n }\",\n \"function parsedFile(lines) {\\n let rounds = 0;\\n let players = [];\\n let root = {};\\n\\n lines.forEach((line) => {\\n if (line.indexOf('InitGame') !== -1) {\\n rounds = getInitGame(root, rounds);\\n }\\n\\n if (line.indexOf('killed') !== -1) {\\n kill(root[`game_${rounds}`], line);\\n }\\n\\n if (line.indexOf('ClientUserinfoChanged') !== -1) {\\n instancePlayers(root[`game_${rounds}`], line);\\n }\\n });\\n return root;\\n}\",\n \"static parseBpmn(filenames) {\\n if (typeof filenames === 'string') {\\n filenames = [filenames];\\n }\\n return filenames.map(filename => {\\n const xmlData = fs.readFileSync(filename).toString();\\n if (parser.validate(xmlData)) {\\n return parser.parse(xmlData, BpmnParser.parserOptions);\\n }\\n return {};\\n });\\n }\",\n \"function parseFile(contents, fileName) {\\n\\t\\ttry {\\n\\t\\t\\tif(typeof contents === 'string') {\\n\\t\\t\\t\\tcontents = JSON.parse(contents);\\n\\t\\t\\t\\tdataBase = contents;\\n\\t\\t\\t\\tcheckData();\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t} catch (e) { }\\n\\n\\t\\tif(contents instanceof Array) { // from slot set of \\\"FileContents\\\"\\n\\t\\t\\tdataBase = contents;\\n\\t\\t\\tcheckData();\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tvar p = 0;\\n\\t\\tvar lex = {\\\" \\\":0, \\\",\\\":0, \\\"\\\\t\\\":0, \\\"\\\\n\\\":0, \\\";\\\":0};\\n\\t\\tvar best = \\\"\\\\n\\\";\\n\\t\\tvar bestn = 0;\\n\\n\\t\\twhile (p < contents.length) {\\n\\t\\t\\tif(lex.hasOwnProperty(contents[p])) {\\n\\t\\t\\t\\tlex[contents[p]] += 1;\\n\\n\\t\\t\\t\\tif(lex[contents[p]] > bestn) {\\n\\t\\t\\t\\t\\tbestn = lex[contents[p]];\\n\\t\\t\\t\\t\\tbest = contents[p];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tp++;\\n\\t\\t}\\n\\n\\t\\tdataBase = [];\\n\\t\\tp1 = 0;\\n\\t\\tp2 = p1+1;\\n\\t\\tvar firstRow = true;\\n\\n\\t\\twhile (p2 < contents.length) {\\n\\t\\t\\tif(contents[p2] == \\\"\\\\n\\\" || p2 == contents.length - 1) {\\n\\t\\t\\t\\tif(p2 == contents.length - 1 && contents[p2] != \\\"\\\\n\\\") {\\n\\t\\t\\t\\t\\tp2++; // include last character too\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tvar thisRow = contents.substr(p1, p2 - p1);\\n\\t\\t\\t\\tvar items = thisRow.split(best);\\n\\t\\t\\t\\tvar name = items[0];\\n\\t\\t\\t\\tvar vals = [];\\n\\t\\t\\t\\tfor(var i = 1; i < items.length; i++) {\\n\\t\\t\\t\\t\\tvar val = parseFloat(items[i]);\\n\\n\\t\\t\\t\\t\\tif(val !== null && val !== undefined && !isNaN(val)) {\\n\\t\\t\\t\\t\\t\\tvals.push(val);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tvar data = [name, vals];\\n\\t\\t\\t\\tif(vals.length > 0) {\\n\\t\\t\\t\\t\\tdataBase.push(data);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tfirstRow = false;\\n\\n\\t\\t\\t\\twhile(contents[p2] == \\\"\\\\n\\\") {\\n\\t\\t\\t\\t\\tp2++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tp1 = p2;\\n\\t\\t\\t\\tp2 = p1 + 1;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tp2++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t$scope.set(\\\"FileContents\\\", dataBase);\\n\\t\\t$scope.dataSetName = fileName;\\n\\t\\tcheckData();\\n\\t}\",\n \"function parse(doc) {\\n var file = vfile(doc)\\n var Parser\\n\\n freeze()\\n Parser = processor.Parser\\n assertParser('parse', Parser)\\n\\n if (newable(Parser)) {\\n return new Parser(String(file), file).parse()\\n }\\n\\n return Parser(String(file), file) // eslint-disable-line new-cap\\n }\",\n \"function parse(doc) {\\n var file = vfile(doc)\\n var Parser\\n\\n freeze()\\n Parser = processor.Parser\\n assertParser('parse', Parser)\\n\\n if (newable(Parser)) {\\n return new Parser(String(file), file).parse()\\n }\\n\\n return Parser(String(file), file) // eslint-disable-line new-cap\\n }\",\n \"function parse(doc) {\\n var file = vfile(doc)\\n var Parser\\n\\n freeze()\\n Parser = processor.Parser\\n assertParser('parse', Parser)\\n\\n if (newable(Parser)) {\\n return new Parser(String(file), file).parse()\\n }\\n\\n return Parser(String(file), file) // eslint-disable-line new-cap\\n }\",\n \"function parse(doc) {\\n var file = vfile(doc)\\n var Parser\\n\\n freeze()\\n Parser = processor.Parser\\n assertParser('parse', Parser)\\n\\n if (newable(Parser)) {\\n return new Parser(String(file), file).parse()\\n }\\n\\n return Parser(String(file), file) // eslint-disable-line new-cap\\n }\",\n \"function parse(doc) {\\n var file = vfile(doc)\\n var Parser\\n\\n freeze()\\n Parser = processor.Parser\\n assertParser('parse', Parser)\\n\\n if (newable(Parser)) {\\n return new Parser(String(file), file).parse()\\n }\\n\\n return Parser(String(file), file) // eslint-disable-line new-cap\\n }\",\n \"function parseFile(fileUpload) {\\n\\n //Add error handling here.\\n var status = 'good';\\n \\n \\n //TODO: Insert parsing code here\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n //TODO: Insert parsing code here\\n let glFile = csvGenerator(),\\n wideFile = csvGenerator(),\\n longFile = csvGenerator()\\n \\n if (status === 'good') {\\n return {\\n GL: glFile,\\n Workorders_Wide: wideFile,\\n Workorders_Long: longFile\\n };\\n } else {\\n return null;\\n }\\n \\n}\",\n \"function parse(doc) {\\n var file = vfile(doc)\\n var Parser\\n\\n freeze()\\n Parser = processor.Parser\\n assertParser('parse', Parser)\\n\\n if (newable(Parser, 'parse')) {\\n return new Parser(String(file), file).parse()\\n }\\n\\n return Parser(String(file), file) // eslint-disable-line new-cap\\n }\",\n \"function parse(doc) {\\n var file = vfile(doc)\\n var Parser\\n\\n freeze()\\n Parser = processor.Parser\\n assertParser('parse', Parser)\\n\\n if (newable(Parser, 'parse')) {\\n return new Parser(String(file), file).parse()\\n }\\n\\n return Parser(String(file), file) // eslint-disable-line new-cap\\n }\",\n \"function parse(doc) {\\n var file = vfile(doc)\\n var Parser\\n\\n freeze()\\n Parser = processor.Parser\\n assertParser('parse', Parser)\\n\\n if (newable(Parser, 'parse')) {\\n return new Parser(String(file), file).parse()\\n }\\n\\n return Parser(String(file), file) // eslint-disable-line new-cap\\n }\",\n \"function process(filename, source) {\\n try {\\n if (util.isString(source) && source.charAt(0) === \\\"{\\\")\\n source = JSON.parse(source);\\n if (!util.isString(source))\\n self.setOptions(source.options).addJSON(source.nested);\\n else {\\n parse.filename = filename;\\n var parsed = parse(source, self, options),\\n resolved,\\n i = 0;\\n if (parsed.imports)\\n for (; i < parsed.imports.length; ++i)\\n if (resolved = self.resolvePath(filename, parsed.imports[i]))\\n fetch(resolved);\\n if (parsed.weakImports)\\n for (i = 0; i < parsed.weakImports.length; ++i)\\n if (resolved = self.resolvePath(filename, parsed.weakImports[i]))\\n fetch(resolved, true);\\n }\\n } catch (err) {\\n finish(err);\\n }\\n if (!sync && !queued)\\n finish(null, self); // only once anyway\\n }\",\n \"function process(filename, source) {\\n try {\\n if (util.isString(source) && source.charAt(0) === \\\"{\\\")\\n source = JSON.parse(source);\\n if (!util.isString(source))\\n self.setOptions(source.options).addJSON(source.nested);\\n else {\\n parse.filename = filename;\\n var parsed = parse(source, self, options),\\n resolved,\\n i = 0;\\n if (parsed.imports)\\n for (; i < parsed.imports.length; ++i)\\n if (resolved = self.resolvePath(filename, parsed.imports[i]))\\n fetch(resolved);\\n if (parsed.weakImports)\\n for (i = 0; i < parsed.weakImports.length; ++i)\\n if (resolved = self.resolvePath(filename, parsed.weakImports[i]))\\n fetch(resolved, true);\\n }\\n } catch (err) {\\n finish(err);\\n }\\n if (!sync && !queued)\\n finish(null, self); // only once anyway\\n }\",\n \"_parseCollection()\\n {\\n var that = this;\\n fs.readFile(this.option.path, 'utf8', function (err, data) {\\n if (err) throw err;\\n that.collection = JSON.parse(data);\\n that._serveCollection();\\n })\\n }\",\n \"function parseFile(req, res, next){\\n var filePath = req.files.file.path;\\n console.log(filePath);\\n function onNewRecord(record){\\n console.log(record)\\n }\\n\\n function onError(error){\\n console.log(error)\\n }\\n\\n function done(linesRead){\\n res.send(200, linesRead)\\n }\\n\\n var columns = true; \\n parseCSVFile(filePath, columns, onNewRecord, onError, done);\\n\\n}\",\n \"function ReadPDBfile(file,callback)\\r\\n{\\r\\n\\tvar self = this;\\r\\n\\tvar name= PDButil.stripName(file.name);\\r\\n\\t\\r\\n\\t//Assigning Properties by reading the file\\r\\n\\tvar pdbfileReader = new FileReader();\\r\\n\\t\\r\\n\\t//Reads the file\\r\\n\\tpdbfileReader.readAsText(file);\\r\\n\\t\\r\\n\\t//When file is read, this function is called\\r\\n\\tpdbfileReader.onload = loadStructureHandler;\\r\\n\\tpdbfileReader.onerror = errorStructureHandler;\\r\\n\\t\\r\\n\\tfunction loadStructureHandler(event)\\r\\n\\t{\\r\\n\\t var content = event.target.result.split(\\\"\\\\n\\\");\\r\\n\\t //console.log(content[1]);\\r\\n\\t BuildStructure(name,content,callback, new ProgressDialog(\\\"Assimilating PDB file \\\"+name+\\\"...\\\"));\\r\\n\\t};\\r\\n\\r\\n\\tfunction errorStructureHandler(event)\\r\\n\\t{\\r\\n\\t console.log(\\\"Error while reading the file\\\");\\r\\n\\t};\\r\\n \\r\\n}\",\n \"function parse(doc) {\\n var file = vfile(doc);\\n var Parser;\\n\\n freeze();\\n Parser = processor.Parser;\\n assertParser('parse', Parser);\\n\\n if (newable(Parser, 'parse')) {\\n return new Parser(String(file), file).parse()\\n }\\n\\n return Parser(String(file), file) // eslint-disable-line new-cap\\n }\",\n \"function Parser(doc, file) {\\n this.file = file;\\n this.offset = {};\\n this.options = xtend(this.options);\\n this.setOptions({});\\n\\n this.inList = false;\\n this.inBlock = false;\\n this.inLink = false;\\n this.atStart = true;\\n\\n this.toOffset = vfileLocation(file).toOffset;\\n this.unescape = unescape(this, 'escape');\\n this.decode = decode(this);\\n}\",\n \"function r(e){e||(e={}),this._file=i.getArg(e,\\\"file\\\",null),this._sourceRoot=i.getArg(e,\\\"sourceRoot\\\",null),this._sources=new a,this._names=new a,this._mappings=[],this._sourcesContents=null}\",\n \"function parse(doc) {\\n var file = vfile(doc);\\n var Parser;\\n\\n freeze();\\n Parser = processor.Parser;\\n assertParser('parse', Parser);\\n\\n if (newable(Parser)) {\\n return new Parser(String(file), file).parse();\\n }\\n\\n return Parser(String(file), file); // eslint-disable-line new-cap\\n }\",\n \"function parseFile(fileContents) {\\n return fileContents.split('\\\\n').map(s => validate(s.trim()));\\n}\",\n \"_parseMappings(aStr, aSourceRoot) {\\n throw new Error('Subclasses must implement _parseMappings')\\n }\",\n \"function process(filename, source) {\\n try {\\n if (util.isString(source) && source.charAt(0) === \\\"{\\\")\\n source = JSON.parse(source);\\n if (!util.isString(source))\\n self.setOptions(source.options).addJSON(source.nested);\\n else {\\n parse.filename = filename;\\n var parsed = parse(source, self, options),\\n resolved,\\n i = 0;\\n if (parsed.imports)\\n for (; i < parsed.imports.length; ++i)\\n if (resolved = getBundledFileName(parsed.imports[i]) || self.resolvePath(filename, parsed.imports[i]))\\n fetch(resolved);\\n if (parsed.weakImports)\\n for (i = 0; i < parsed.weakImports.length; ++i)\\n if (resolved = getBundledFileName(parsed.weakImports[i]) || self.resolvePath(filename, parsed.weakImports[i]))\\n fetch(resolved, true);\\n }\\n } catch (err) {\\n finish(err);\\n }\\n if (!sync && !queued)\\n finish(null, self); // only once anyway\\n }\",\n \"function process(filename, source) {\\n try {\\n if (util.isString(source) && source.charAt(0) === \\\"{\\\")\\n source = JSON.parse(source);\\n if (!util.isString(source))\\n self.setOptions(source.options).addJSON(source.nested);\\n else {\\n parse.filename = filename;\\n var parsed = parse(source, self, options),\\n resolved,\\n i = 0;\\n if (parsed.imports)\\n for (; i < parsed.imports.length; ++i)\\n if (resolved = getBundledFileName(parsed.imports[i]) || self.resolvePath(filename, parsed.imports[i]))\\n fetch(resolved);\\n if (parsed.weakImports)\\n for (i = 0; i < parsed.weakImports.length; ++i)\\n if (resolved = getBundledFileName(parsed.weakImports[i]) || self.resolvePath(filename, parsed.weakImports[i]))\\n fetch(resolved, true);\\n }\\n } catch (err) {\\n finish(err);\\n }\\n if (!sync && !queued)\\n finish(null, self); // only once anyway\\n }\",\n \"function readspacemetadata() {\\n // Read the file and send to the callback\\n fs.readFile(metadatapath, handleFile);\\n}\",\n \"load(fname) {\\n let s = fs.readFileSync(fname, \\\"utf8\\\");\\n let memento = JSON.parse(s);\\n this._results = memento.results;\\n this._params = memento.params;\\n this._combinations = memento.combinations;\\n }\",\n \"parseSignatureFileBuffer(signatureFileBuffer) {\\n const fileHashSize = 48; // number of bytes\\n let index = 0;\\n while (index < signatureFileBuffer.length) {\\n const typeDelimiter = signatureFileBuffer[index++];\\n\\n switch (typeDelimiter) {\\n case 4:\\n // hash\\n this.hash = signatureFileBuffer.subarray(index, index + fileHashSize);\\n index += fileHashSize;\\n break;\\n case 3:\\n // signature\\n const signatureLength = signatureFileBuffer.readInt32BE(index);\\n index += 4;\\n this.signature = signatureFileBuffer.subarray(index, index + signatureLength);\\n index += signatureLength;\\n break;\\n default:\\n throw new Error(`Unexpected type delimiter '${typeDelimiter}' in signature file at index '${index - 1}'`);\\n }\\n }\\n }\",\n \"function GeometryParser() {}\",\n \"function parseFileXML( xmlNode ) {\\n\\n\\t\\tgbjson = XML2jsobj( xmlNode );\\n\\t\\t//console.log( 'gbjson', gbjson );\\n\\n\\t\\tparseGbJson( gbjson );\\n\\n\\t\\treturn gbjson;\\n\\n\\t}\",\n \"function parseGCTFile(fileContents)\\n {\\n var data = {\\n sampleNames: [],\\n rowNames: [],\\n rowDescriptions: [],\\n matrix: [[]]\\n };\\n var lines = fileContents.split(/\\\\r\\\\n|\\\\r|\\\\n/); //fileContents.split(/\\\\r|\\\\n/);\\n\\n if(lines.length >= 4 && lines[0].indexOf(\\\"#1.2\\\") != -1)\\n {\\n //The samples\\n var sampleLines = lines[2];\\n var samples = sampleLines.split(/\\\\t/);\\n samples.splice(0, 2);\\n data.sampleNames = samples;\\n\\n //the data starts on line 4 for a gct file\\n for(var r=3;r<lines.length;r++)\\n {\\n var rowData = lines[r].split(/\\\\t/);\\n data.rowNames.push(rowData[0]);\\n data.rowDescriptions.push(rowData[1]);\\n data.matrix[r-3] = rowData.slice(2).map(Number);\\n }\\n }\\n else\\n {\\n throw new Error(\\\"Error parsing data: Unexpected number of lines \\\" + lines.length + \\\".\\\");\\n }\\n\\n return data;\\n }\",\n \"function processInput() {\\n\\n\\tvar boundaryInfo = getCourseBoundaries(fileContents);\\n\\tvar boundaries = boundaryInfo.boundaries;\\n\\tvar oneSection = RegExp( sectionChunk, 'gim' );\\n\\tvar j = 0;\\n\\tfor (var i = 0; i < boundaryInfo.boundaries.length ; ++i) {\\n\\t\\tvar courseSection = fileContents.substring(boundaries[i], boundaries[i+1]);\\n\\t\\twhile(true) {\\n\\t\\t\\tvar result = oneSection.exec(courseSection);\\n\\t\\t\\tif (!result) break;\\n\\t\\t\\tvar sectionInfo = { \\n\\t\\t\\t\\ttimes : result[4].trim().split('\\\\n'),\\n\\t\\t\\t\\trooms : result[5].trim().split('\\\\n'),\\n\\t\\t\\t\\tinstructors : result[6].trim().split('\\\\n'),\\n\\t\\t\\t\\tdates\\t\\t\\t\\t: result[7].trim().split('\\\\n'),\\n\\t\\t\\t};\\n\\t\\t\\tsections[j] = {\\n\\t\\t\\t\\tname : boundaryInfo.courses[i].name,\\n\\t\\t\\t\\tdisc : boundaryInfo.courses[i].disc,\\n\\t\\t\\t\\tnum : boundaryInfo.courses[i].num,\\n\\t\\t\\t\\tCFID : result[1],\\n\\t\\t\\t\\tsectionName : result[2],\\n\\t\\t\\t\\tsectionType : result[3],\\n\\t\\t\\t\\tisFull : ( result[8].trim()[0] === 'O' ? false : true ), // Is it open? TODO: Make case insensitive.\\n\\t\\t\\t\\tdays : getSessions( sectionInfo ),\\n\\t\\t\\t};\\n\\t\\t\\t++j;\\n\\t\\t}\\n\\t\\toneSection.lastIndex = 0;\\n\\t}\\n\\tconsole.log( JSON.stringify(sections, null, 1) ); // DEBUG\\n}\",\n \"function TextParser() {}\",\n \"function TextParser() {}\",\n \"function n(e){e||(e={}),this._file=o.getArg(e,\\\"file\\\",null),this._sourceRoot=o.getArg(e,\\\"sourceRoot\\\",null),this._sources=new i,this._names=new i,this._mappings=[],this._sourcesContents=null}\",\n \"function parseTag (context, fname, ctype, valtype, pathfrags, fileScope, defaultScope, docstr, next) {\\n if (docstr instanceof Array) {\\n for (var i=0,j=Math.max (1, docstr.length); i<j; i++) {\\n var workingDocstr = docstr[i] || '';\\n workingDocstr = workingDocstr.match (/^[\\\\r\\\\n]*([^]*)[\\\\r\\\\n]*$/)[1];\\n parseTag (\\n context,\\n fname,\\n ctype,\\n valtype,\\n pathfrags,\\n fileScope,\\n defaultScope,\\n workingDocstr,\\n next\\n );\\n }\\n return;\\n }\\n var tagScope;\\n if (fileScope.length)\\n tagScope = fileScope.concat (pathfrags);\\n // tagScope = concatPaths (fileScope, pathfrags);\\n else if (defaultScope.length && (ctype != 'module' || !pathfrags.length))\\n tagScope = defaultScope.concat (pathfrags);\\n // tagScope = concatPaths (defaultScope, pathfrags);\\n else\\n tagScope = pathfrags.concat();\\n // tagScope = concatPaths (pathfrags);\\n\\n if (ctype == 'module')\\n fileScope.push.apply (fileScope, pathfrags);\\n else if (ctype == 'submodule')\\n ctype = 'module';\\n // convert @constuctor to @spare\\n else if (ctype == 'constructor') {\\n ctype = 'spare';\\n pathfrags.push ([ '~', 'constructor' ]);\\n }\\n\\n // consume modifiers\\n var modifiers = [];\\n docstr = consumeModifiers (fname, fileScope, tagScope, next, docstr, modifiers);\\n\\n // begin searching for inner tags\\n var innerMatch = docstr ? docstr.match (Patterns.innerTag) : undefined;\\n if (!innerMatch) {\\n // the entire comment is one component\\n try {\\n lastComponent = context.submit (\\n tagScope.length ? tagScope : fileScope,\\n {\\n ctype: ctype,\\n valtype: valtype,\\n // doc: { value:docstr, context:cloneArr(fileScope) },\\n doc: { value:docstr, context:fileScope.concat() },\\n modifiers: modifiers\\n }\\n );\\n context.logger.trace ({\\n type: ctype,\\n file: fname,\\n path: tagScope.map (function(a){ return a[0]+a[1]; }).join('')\\n }, 'read declaration');\\n return;\\n } catch (err) {\\n context.logger.error (err, 'parsing error');\\n return;\\n }\\n }\\n\\n var argscope = tagScope.concat();\\n var inpathstr = innerMatch[3];\\n var inpathfrags = [];\\n var insigargs;\\n var pathMatch;\\n var linkScope = fileScope.concat();\\n var lastComponent;\\n do {\\n if (\\n ctype == 'callback'\\n || ctype == 'argument'\\n || ctype == 'kwarg'\\n || ctype == 'args'\\n || ctype == 'kwargs'\\n || ctype == 'returns'\\n || ctype == 'signature'\\n )\\n submissionPath = argscope.concat (inpathfrags);\\n // submissionPath = concatPaths (argscope, inpathfrags);\\n else if (ctype != 'load')\\n submissionPath = tagScope.concat (inpathfrags);\\n // submissionPath = concatPaths (tagScope, inpathfrags);\\n\\n // any chance this is just a @load declaration?\\n if (ctype == 'load') {\\n var lookupPath =\\n inpathfrags[0][1]\\n || docstr.slice (0, innerMatch.index).replace (/^\\\\s*/, '').replace (/\\\\s*$/, '')\\n ;\\n var filename = pathLib.resolve (pathLib.dirname (fname), lookupPath);\\n var loadedDoc;\\n if (Object.hasOwnProperty.call (loadedDocuments, filename))\\n loadedDoc = loadedDocuments[filename];\\n else try {\\n context.latency.log ('parsing');\\n loadedDoc = fs.readFileSync (filename).toString();\\n context.latency.log ('file system');\\n } catch (err) {\\n context.logger.warn (\\n { filename:filename },\\n '@load Declaration failed'\\n );\\n }\\n if (loadedDoc)\\n context.submit (\\n submissionPath,\\n { doc: { value:loadedDoc } }\\n );\\n } else\\n // submit the previous match\\n try {\\n var inlineDocStr = docstr.slice (0, innerMatch.index);\\n if (inlineDocStr.match (/^[\\\\s\\\\n]*$/))\\n inlineDocStr = '';\\n if (\\n ctype != 'returns'\\n || valtype.length\\n || inlineDocStr\\n || modifiers.length\\n || insigargs\\n || submissionPath[submissionPath.length-1][1]\\n )\\n lastComponent = context.submit (\\n submissionPath,\\n {\\n ctype: ctype,\\n valtype: valtype,\\n doc: { value:inlineDocStr, context:linkScope },\\n modifiers: modifiers,\\n sigargs: insigargs\\n }\\n );\\n context.logger.trace ({\\n type: ctype,\\n file: fname,\\n path: submissionPath.map (function(a){ return a[0]+a[1]; }).join('')\\n }, 'read declaration');\\n } catch (err) {\\n context.logger.error (err, 'parsing error');\\n return;\\n }\\n\\n // prepare the next submission\\n if (ctype == 'returns') {\\n if (!inpathstr && argscope.length > tagScope.length)\\n argscope.pop();\\n } else if (ctype == 'callback')\\n argscope = argscope.concat (inpathfrags);\\n // argscope = concatPaths (argscope, inpathfrags);\\n else if (\\n ctype != 'argument'\\n && ctype != 'kwarg'\\n && ctype != 'args'\\n && ctype != 'kwargs'\\n && ctype != 'returns'\\n && ctype != 'signature'\\n )\\n argscope = tagScope.concat (inpathfrags);\\n // argscope = concatPaths (cloneArr (tagScope), inpathfrags);\\n\\n linkScope = fileScope.concat();\\n // linkScope = cloneArr (fileScope);\\n modifiers = [];\\n ctype = innerMatch[1];\\n valtype = innerMatch[2];\\n inpathstr = innerMatch[3];\\n docstr = innerMatch[4];\\n\\n if (ctype == 'signature') {\\n insigargs = [];\\n var sigargSplit = inpathstr.slice(1).slice(0, -1).split (Patterns.signatureArgument);\\n inpathstr = '';\\n for (var i=1,j=sigargSplit.length; i<j; i+=3) {\\n var sigvaltype = parseType (sigargSplit[i], fileScope.length ? fileScope : defaultScope);\\n var sigvalname = parsePath (sigargSplit[i+1], fileScope);\\n if (sigvalname && !sigvalname[0][0])\\n sigvalname[0][0] = '(';\\n var sigargargpath = tagScope.concat (sigvalname);\\n // var sigargargpath = concatPaths (cloneArr (tagScope), sigvalname);\\n var sigvalnameStr;\\n if (sigvalname && sigvalname.length)\\n sigvalnameStr = sigvalname.slice(-1)[0][1];\\n insigargs.push ({\\n name: sigvalnameStr,\\n valtype: sigvaltype,\\n path: sigargargpath\\n });\\n }\\n inpathfrags = [ [ ] ];\\n } else\\n inpathfrags = parsePath (inpathstr, fileScope);\\n\\n if (inpathfrags[0] && !inpathfrags[0][0])\\n if (inpathfrags.length == 1)\\n inpathfrags[0][0] = Patterns.delimitersInverse[ctype] || '.';\\n else\\n inpathfrags[0][0] = '.';\\n\\n // direct-to-type syntax\\n if (!Patterns.innerCtypes.hasOwnProperty (ctype)) {\\n valtype = ctype;\\n ctype = Patterns.delimiters[inpathfrags[inpathfrags.length-1][0]];\\n }\\n\\n // convert @constuctor to @spare\\n if (ctype == 'constructor') {\\n ctype = 'spare';\\n inpathfrags[inpathfrags.length-1][0] = '~';\\n inpathfrags[inpathfrags.length-1][1] = 'constructor';\\n }\\n\\n valtype = parseType (valtype, fileScope.length ? fileScope : defaultScope);\\n\\n // consume modifiers\\n docstr = consumeModifiers (fname, fileScope, tagScope, next, docstr, modifiers);\\n\\n // some tags affect the scope\\n if (ctype == 'module') {\\n fileScope.push.apply (fileScope, inpathfrags);\\n // tagScope.push.apply (tagScope, inpathfrags);\\n }\\n if (ctype == 'submodule')\\n ctype = 'module';\\n\\n } while (docstr && (innerMatch = docstr.match (Patterns.innerTag)));\\n\\n // submit the final match from this tag\\n var submissionPath;\\n if (\\n ctype == 'callback'\\n || ctype == 'argument'\\n || ctype == 'kwarg'\\n || ctype == 'args'\\n || ctype == 'kwargs'\\n || ctype == 'returns'\\n || ctype == 'signature'\\n )\\n submissionPath = argscope.concat (inpathfrags);\\n // submissionPath = concatPaths (argscope, inpathfrags);\\n else if (ctype != 'load')\\n submissionPath = tagScope.concat (inpathfrags);\\n // submissionPath = concatPaths (cloneArr (tagScope), inpathfrags);\\n\\n // consume modifiers\\n docstr = consumeModifiers (fname, fileScope, tagScope, next, docstr, modifiers);\\n\\n // any chance this is just a @load declaration?\\n if (ctype == 'load') {\\n var lookupPath =\\n inpathfrags[0][1]\\n || docstr.replace (/^\\\\s*/, '').replace (/\\\\s*$/, '')\\n ;\\n var filename = pathLib.resolve (pathLib.dirname (fname), lookupPath);\\n var loadedDoc;\\n if (Object.hasOwnProperty.call (loadedDocuments, filename))\\n loadedDoc = loadedDocuments[filename];\\n else try {\\n context.latency.log ('parsing');\\n loadedDoc = fs.readFileSync (filename).toString();\\n context.latency.log ('file system');\\n } catch (err) {\\n context.logger.warn (\\n { filename:filename },\\n '@load Declaration failed'\\n );\\n }\\n if (loadedDoc)\\n lastComponent = context.submit (\\n submissionPath,\\n { doc: { value:loadedDoc } }\\n );\\n } else {\\n if (\\n ctype != 'returns'\\n || valtype.length\\n || inlineDocStr\\n || modifiers.length\\n || insigargs\\n || submissionPath[submissionPath.length-1][1]\\n )\\n try {\\n lastComponent = context.submit (\\n submissionPath,\\n {\\n ctype: ctype,\\n valtype: valtype,\\n doc: { value:docstr, context:linkScope },\\n modifiers: modifiers,\\n sigargs: insigargs\\n }\\n );\\n context.logger.trace ({\\n type: ctype,\\n file: fname,\\n path: submissionPath.map (function(a){ return a[0]+a[1]; }).join('')\\n }, 'read declaration');\\n } catch (err) {\\n context.logger.error (err, 'parsing error');\\n return;\\n }\\n }\\n}\",\n \"function parseTopLevel() {\\n parseBlockBody(TokenType.eof);\\n state.scopes.push(new Scope(0, state.tokens.length, true));\\n if (state.scopeDepth !== 0) {\\n throw new Error(`Invalid scope depth at end of file: ${state.scopeDepth}`);\\n }\\n return new File(state.tokens, state.scopes);\\n}\",\n \"doParse(content: string): any {\\n let lines = this.getLines(content);\\n return this.parseContent(lines);\\n }\",\n \"function readFile (evt) {\\r\\n var files = evt.target.files;\\r\\n var file = files[0]; \\r\\n Papa.parse(file, {\\r\\n \\tcomplete: function(results) {\\r\\n \\t\\tlog(results);\\r\\n \\t}\\r\\n }, config);\\r\\n }\",\n \"function parse(file: string): ParserReturn {\\n if (file.match(/\\\\.tsx?$/)) {\\n return TypeScriptParser.parse(file);\\n } else {\\n return babylonParser(file);\\n }\\n}\",\n \"@memoize\\n get parser() {\\n return new TaskList({\\n name: `Parsing ${this.type}: ${this.projectName}`,\\n tasks: [\\n new Task({\\n name: `Loading ${this.type}`,\\n run: (parentScope) => {\\n this.resetCompiled()\\n const scope = this.getScope(parentScope)\\n this.setState(\\\"scope\\\", scope)\\n return this.load()\\n }\\n }),\\n TaskList.forEach({\\n name: `Parsing imports`,\\n list: () => this.activeImports,\\n getTask: (file) =>\\n new Task({\\n name: `Parsing import: ${file.file}`,\\n run: () => file.parse(this.scope)\\n })\\n })\\n ]\\n })\\n }\",\n \"parse() {\\n while (this.shouldContinue()) {\\n const c = this.buffer.charCodeAt(this.index - this.offset);\\n switch (this.state) {\\n case Tokenizer_State.Text: {\\n this.stateText(c);\\n break;\\n }\\n case Tokenizer_State.SpecialStartSequence: {\\n this.stateSpecialStartSequence(c);\\n break;\\n }\\n case Tokenizer_State.InSpecialTag: {\\n this.stateInSpecialTag(c);\\n break;\\n }\\n case Tokenizer_State.CDATASequence: {\\n this.stateCDATASequence(c);\\n break;\\n }\\n case Tokenizer_State.InAttributeValueDq: {\\n this.stateInAttributeValueDoubleQuotes(c);\\n break;\\n }\\n case Tokenizer_State.InAttributeName: {\\n this.stateInAttributeName(c);\\n break;\\n }\\n case Tokenizer_State.InCommentLike: {\\n this.stateInCommentLike(c);\\n break;\\n }\\n case Tokenizer_State.InSpecialComment: {\\n this.stateInSpecialComment(c);\\n break;\\n }\\n case Tokenizer_State.BeforeAttributeName: {\\n this.stateBeforeAttributeName(c);\\n break;\\n }\\n case Tokenizer_State.InTagName: {\\n this.stateInTagName(c);\\n break;\\n }\\n case Tokenizer_State.InClosingTagName: {\\n this.stateInClosingTagName(c);\\n break;\\n }\\n case Tokenizer_State.BeforeTagName: {\\n this.stateBeforeTagName(c);\\n break;\\n }\\n case Tokenizer_State.AfterAttributeName: {\\n this.stateAfterAttributeName(c);\\n break;\\n }\\n case Tokenizer_State.InAttributeValueSq: {\\n this.stateInAttributeValueSingleQuotes(c);\\n break;\\n }\\n case Tokenizer_State.BeforeAttributeValue: {\\n this.stateBeforeAttributeValue(c);\\n break;\\n }\\n case Tokenizer_State.BeforeClosingTagName: {\\n this.stateBeforeClosingTagName(c);\\n break;\\n }\\n case Tokenizer_State.AfterClosingTagName: {\\n this.stateAfterClosingTagName(c);\\n break;\\n }\\n case Tokenizer_State.BeforeSpecialS: {\\n this.stateBeforeSpecialS(c);\\n break;\\n }\\n case Tokenizer_State.InAttributeValueNq: {\\n this.stateInAttributeValueNoQuotes(c);\\n break;\\n }\\n case Tokenizer_State.InSelfClosingTag: {\\n this.stateInSelfClosingTag(c);\\n break;\\n }\\n case Tokenizer_State.InDeclaration: {\\n this.stateInDeclaration(c);\\n break;\\n }\\n case Tokenizer_State.BeforeDeclaration: {\\n this.stateBeforeDeclaration(c);\\n break;\\n }\\n case Tokenizer_State.BeforeComment: {\\n this.stateBeforeComment(c);\\n break;\\n }\\n case Tokenizer_State.InProcessingInstruction: {\\n this.stateInProcessingInstruction(c);\\n break;\\n }\\n case Tokenizer_State.InNamedEntity: {\\n this.stateInNamedEntity(c);\\n break;\\n }\\n case Tokenizer_State.BeforeEntity: {\\n this.stateBeforeEntity(c);\\n break;\\n }\\n case Tokenizer_State.InHexEntity: {\\n this.stateInHexEntity(c);\\n break;\\n }\\n case Tokenizer_State.InNumericEntity: {\\n this.stateInNumericEntity(c);\\n break;\\n }\\n default: {\\n // `this._state === State.BeforeNumericEntity`\\n this.stateBeforeNumericEntity(c);\\n }\\n }\\n this.index++;\\n }\\n this.cleanup();\\n }\",\n \"function LevelParser(filename) {\\n //Engine.Object.call(this);\\n this.filename = filename;\\n }\",\n \"function parseWithLocation(content, filename, locationKeyName) {\\r\\n return _parse(content, filename, locationKeyName);\\r\\n}\",\n \"function parseFile(fileToParse){\\n var fs = require('fs');\\n var decodedFile = {};\\n\\n var toDecode = fs.readFileSync(fileToParse);\\n\\n // pass the byte array into _parse for decoding\\n decodedFile = _parse(toDecode).result;\\n\\n return decodedFile;\\n}\",\n \"function reqListener() {\\n console.log('File loaded: ' + sourceLocation);\\n cm.setValue(this.responseText);\\n engineStartup();\\n }\",\n \"load() {\\n this.completed = false;\\n this.rendered = false;\\n\\n // Resets variables on load\\n this.raw = [];\\n this.header = [];\\n this.selected = [];\\n if (this.chart instanceof Chart) this.chart.destroy();\\n\\n let readRange = {};\\n if (this.fileReadRange != null) readRange = this.getNumColsFromA1(this.fileReadRange);\\n console.log(`Will read ${ readRange.numCols > 0 ? 'first ' + readRange.numCols : 'all'} columns and ${ readRange.numRows > 0 ? 'first ' + readRange.numRows : 'all'} rows.`);\\n this.fileReadRange = readRange.col + (readRange.numRows > 0 ? readRange.numRows : '');\\n \\n const selectedFile = document.getElementById('myfile').files[0];\\n console.log(selectedFile.name);\\n this.fileName = selectedFile.name;\\n Papa.parse(selectedFile, {\\n skipEmptyLines: true,\\n preview: readRange.numRows > 0 ? readRange.numRows : 0,\\n complete: (results) => {\\n console.log('Finished:', results.data);\\n this.raw = results.data;\\n this.limitColumns(readRange.numCols > 0 ? readRange.numCols : 0);\\n this.header = Array.from(this.raw[0]); // problem: duplicated / null headers\\n this.header.shift();\\n this.refreshPreview();\\n this.completed = true;\\n console.log(this.completed);\\n }\\n });\\n }\",\n \"function parseData(e) {\\r\\n const file = e.target.files[0];\\r\\n\\r\\n Papa.parse(file, {\\r\\n dynamicTyping: true,\\r\\n complete: function(results) {\\r\\n $('header').hide();\\r\\n $('main').prepend(`<h1 class=\\\"tableTitle\\\">Christopher Duerkes</h1>`);\\r\\n createTable(results.data);\\r\\n addEventListeners();\\r\\n }\\r\\n });\\r\\n}\",\n \"function parseRawGeometry(asset, cfg, geometryId, ok) {\\n /*\\n Geometry format\\n\\n bytes : info\\n [0.. 3]: uint32; file type identifer (= 0x11)\\n [4.. 7]: uint32; byte-length of padded asset id\\n [8..11]: uint32; byte-length of padded morph keys JSON\\n [12..15]: uint32; byte-length of positions array\\n [16..19]: uint32; byte-length of normals array\\n [20..23]: uint32; byte-length of indices array\\n [24..27]: uint32; byte-length of uv array\\n [28..43]: unit32[4]; unused, reserved for future use\\n [ .. ]: text; asset id (tail-padded with empty spaces, e.g. 0x20)\\n [ .. ]: text; morph key JSON (tail-padded with 0x20)\\n [ .. ]: float32[]; positions array\\n [ .. ]: float32[]; normals array\\n [ .. ]: int32[]; indices array\\n [ .. ]: float32[]; uv array\\n */\\n\\n var index = new Uint32Array(asset, 0, 11);\\n\\n var assetIdSize = index[1];\\n var keysSize = index[2];\\n var positionsSize = index[3];\\n var normalsSize = index[4];\\n var indicesSize = index[5];\\n var uvsSize = index[6];\\n // var unused = index[7 ... 10];\\n\\n var assetIdStart = 11 * Uint32Array.BYTES_PER_ELEMENT;\\n var keysStart = assetIdStart + assetIdSize;\\n var positionsStart = keysStart + keysSize;\\n var normalsStart = positionsStart + positionsSize;\\n var indicesStart = normalsStart + normalsSize;\\n var uvsStart = indicesStart + indicesSize;\\n\\n var numVertices = 0;\\n\\n if (positionsSize > 0) {\\n cfg.geometry.positions = new Float32Array(asset, positionsStart, positionsSize / Float32Array.BYTES_PER_ELEMENT);\\n cfg.boundary = getBoundary(cfg.geometry.positions);\\n numVertices = cfg.geometry.positions.length / 3;\\n }\\n\\n if (normalsSize > 0) {\\n cfg.geometry.normals = new Float32Array(asset, normalsStart, normalsSize / Float32Array.BYTES_PER_ELEMENT);\\n }\\n\\n if (uvsSize > 0) {\\n cfg.geometry.uv = new Float32Array(asset, uvsStart, uvsSize / Float32Array.BYTES_PER_ELEMENT);\\n }\\n\\n if (indicesSize > 0) {\\n cfg.geometry.indices = new Uint32Array(asset, indicesStart, indicesSize / Uint32Array.BYTES_PER_ELEMENT);\\n if (numVertices <= 256) {\\n cfg.geometry.indices = new Uint8Array(cfg.geometry.indices);\\n } else if (numVertices <= 65536) {\\n cfg.geometry.indices = new Uint16Array(cfg.geometry.indices);\\n }\\n }\\n\\n ok(HumanAssetsGeometries.createGeometry(geometryId, cfg));\\n }\",\n \"function FontParserSVG(rawData) {\\n\\t this.rawData = rawData;\\n\\t this._domParser = new DOMParser();\\n\\t this._document = this._domParser.parseFromString(rawData, 'application/xml');\\n\\t this._parseFontProperties();\\n\\t this._parseFontKerning();\\n\\t }\",\n \"parse() {\\n return this.parseSection (this.pos);\\n}\",\n \"function _readFile(evt) {\\n //Retrieve the uploaded File\\n const file = evt.target.files[0],\\n fileReader = new FileReader();\\n\\n //callback once file loaded, the loaded file is in text format\\n fileReader.onload = function(content) {\\n\\n // Step 1: convert the textfile to obtain HTML DOM object to access the info section\\n let toHTMLDOM = convertToHTMLDOM(content);\\n\\n // Step 2: create a map for the bio obtained via DOM acceess\\n fetchVCardData(toHTMLDOM);\\n\\n // branch to reset the page, when a second file is uploaded\\n if (properties.container.childNodes.length > 0) {\\n resetPage();\\n }\\n\\n //Step 3: create the network\\n createNetwork();\\n }\\n fileReader.readAsText(file);\\n }\",\n \"function TextParser() { }\",\n \"async load (filePath) {\\n console.log(`Deserializing from ${filePath}`)\\n this.data = this.formatStrategy.deserialize(\\n await fs.readFile(filePath, 'utf-8')\\n )\\n }\",\n \"*_parseLines(lines) {\\n const reTag = /^:([0-9]{2}|NS)([A-Z])?:/;\\n let tag = null;\\n\\n for (let i of lines) {\\n\\n // Detect new tag start\\n const match = i.match(reTag);\\n if (match || i.startsWith('-}') || i.startsWith('{')) {\\n if (tag) {yield tag;} // Yield previous\\n tag = match // Start new tag\\n ? {\\n id: match[1],\\n subId: match[2] || '',\\n data: [i.substr(match[0].length)]\\n }\\n : {\\n id: 'MB',\\n subId: '',\\n data: [i.trim()],\\n };\\n } else { // Add a line to previous tag\\n tag.data.push(i);\\n }\\n }\\n\\n if (tag) { yield tag; } // Yield last\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5563817","0.54014236","0.54014236","0.54014236","0.54014236","0.54014236","0.53815776","0.53685594","0.5361048","0.53508544","0.526773","0.52418554","0.52402407","0.5168292","0.516796","0.51584196","0.51400054","0.51273656","0.51238674","0.51143503","0.5110669","0.5096612","0.5084995","0.50358194","0.50236064","0.50198877","0.5010868","0.49962887","0.49905312","0.49806875","0.49776477","0.49556607","0.4949758","0.49440938","0.49232057","0.49167985","0.48911986","0.48804656","0.4806407","0.48060504","0.48028654","0.47879165","0.47798657","0.47730207","0.47730207","0.47730207","0.47730207","0.47730207","0.4759532","0.47539398","0.47539398","0.47539398","0.47522107","0.47522107","0.4748619","0.47453746","0.47450182","0.47281173","0.47246864","0.4716924","0.47115806","0.4693119","0.46909425","0.46781224","0.46781224","0.4676019","0.466036","0.46537542","0.46407095","0.46240392","0.46184602","0.46179095","0.46087363","0.46087363","0.46063486","0.4599959","0.45875302","0.45760655","0.45754096","0.45672745","0.45610714","0.45517465","0.4551201","0.45446298","0.4541461","0.45370662","0.45302784","0.4524684","0.45233724","0.45225692","0.4520544","0.4519211","0.45152685","0.45083275","0.45062083"],"string":"[\n \"0.5563817\",\n \"0.54014236\",\n \"0.54014236\",\n \"0.54014236\",\n \"0.54014236\",\n \"0.54014236\",\n \"0.53815776\",\n \"0.53685594\",\n \"0.5361048\",\n \"0.53508544\",\n \"0.526773\",\n \"0.52418554\",\n \"0.52402407\",\n \"0.5168292\",\n \"0.516796\",\n \"0.51584196\",\n \"0.51400054\",\n \"0.51273656\",\n \"0.51238674\",\n \"0.51143503\",\n \"0.5110669\",\n \"0.5096612\",\n \"0.5084995\",\n \"0.50358194\",\n \"0.50236064\",\n \"0.50198877\",\n \"0.5010868\",\n \"0.49962887\",\n \"0.49905312\",\n \"0.49806875\",\n \"0.49776477\",\n \"0.49556607\",\n \"0.4949758\",\n \"0.49440938\",\n \"0.49232057\",\n \"0.49167985\",\n \"0.48911986\",\n \"0.48804656\",\n \"0.4806407\",\n \"0.48060504\",\n \"0.48028654\",\n \"0.47879165\",\n \"0.47798657\",\n \"0.47730207\",\n \"0.47730207\",\n \"0.47730207\",\n \"0.47730207\",\n \"0.47730207\",\n \"0.4759532\",\n \"0.47539398\",\n \"0.47539398\",\n \"0.47539398\",\n \"0.47522107\",\n \"0.47522107\",\n \"0.4748619\",\n \"0.47453746\",\n \"0.47450182\",\n \"0.47281173\",\n \"0.47246864\",\n \"0.4716924\",\n \"0.47115806\",\n \"0.4693119\",\n \"0.46909425\",\n \"0.46781224\",\n \"0.46781224\",\n \"0.4676019\",\n \"0.466036\",\n \"0.46537542\",\n \"0.46407095\",\n \"0.46240392\",\n \"0.46184602\",\n \"0.46179095\",\n \"0.46087363\",\n \"0.46087363\",\n \"0.46063486\",\n \"0.4599959\",\n \"0.45875302\",\n \"0.45760655\",\n \"0.45754096\",\n \"0.45672745\",\n \"0.45610714\",\n \"0.45517465\",\n \"0.4551201\",\n \"0.45446298\",\n \"0.4541461\",\n \"0.45370662\",\n \"0.45302784\",\n \"0.4524684\",\n \"0.45233724\",\n \"0.45225692\",\n \"0.4520544\",\n \"0.4519211\",\n \"0.45152685\",\n \"0.45083275\",\n \"0.45062083\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.4607834"},"document_rank":{"kind":"string","value":"78"}}},{"rowIdx":76399,"cells":{"query":{"kind":"string","value":"Visit a single node."},"document":{"kind":"string","value":"function one(node, index, parents) {\n var result = []\n var subresult\n\n if (!test || is(node, index, parents[parents.length - 1] || null)) {\n result = toResult(visitor(node, parents))\n\n if (result[0] === EXIT) {\n return result\n }\n }\n\n if (node.children && result[0] !== SKIP) {\n subresult = toResult(all(node.children, parents.concat(node)))\n return subresult[0] === EXIT ? subresult : result\n }\n\n return result\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["visitNode(node) { }","visit() {\n if(this.state) this.state = Node.VISITED;\n }","function node(){}","function one(node, index, parent) {\n var result;\n\n index = index || (parent ? 0 : null);\n\n if (!type || node.type === type) {\n result = visitor(node, index, parent || null);\n }\n\n if (node.children && result !== false) {\n return all(node.children, node);\n }\n\n return result;\n }","function visit(node, fn) {\n if (!node.visited) {\n define(node, 'visited', true);\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\n }\n return node;\n}","function visit(node, fn) {\n if (!node.visited) {\n define(node, 'visited', true);\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\n }\n\n return node;\n}","visit(node, context) {\n if (node instanceof AST) {\n node.visit(this, context);\n }\n else {\n node.visit(this);\n }\n }","visit(node, context) {\n if (node instanceof AST) {\n node.visit(this, context);\n }\n else {\n node.visit(this);\n }\n }","function visit(node, fn) {\n if (!node.visited) {\n _define(node, 'visited', true);\n\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\n }\n\n return node;\n}","function visit(node, fn) {\n if (!node.visited) {\n defineProperty$7(node, 'visited', true);\n return node.nodes ? mapVisit$1(node.nodes, fn) : fn(node);\n }\n return node;\n}","function traverseNodes(node, visitor) {\n traverse(node, null, visitor);\n}","function one(node) {\n if (node.type === type) {\n callback.call(context, node);\n }\n\n var children = node.children;\n var index = -1;\n var length = children ? children.length : 0;\n\n while (++index < length) {\n one(children[index]);\n }\n }","function visit(node, fn) {\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\n }","function visit(node, fn) {\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\n }","function visit(node, fn) {\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\n }","function visit(node, fn) {\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\n }","function one(node) {\n var result\n\n if (!type || node.type === type) {\n result = visitor(node, stack.concat())\n }\n\n if (node.children && result !== false) {\n return all(node.children, node)\n }\n\n return result\n }","function one(node) {\n var result\n\n if (!type || node.type === type) {\n result = visitor(node, stack.concat())\n }\n\n if (node.children && result !== false) {\n return all(node.children, node)\n }\n\n return result\n }","function one(node) {\n var result\n\n if (!type || node.type === type) {\n result = visitor(node, stack.concat())\n }\n\n if (node.children && result !== false) {\n return all(node.children, node)\n }\n\n return result\n }","function one(node) {\n var result\n\n if (!type || node.type === type) {\n result = visitor(node, stack.concat())\n }\n\n if (node.children && result !== false) {\n return all(node.children, node)\n }\n\n return result\n }","function one(node) {\n var result\n\n if (!type || node.type === type) {\n result = visitor(node, stack.concat())\n }\n\n if (node.children && result !== false) {\n return all(node.children, node)\n }\n\n return result\n }","function one(node) {\n var result\n\n if (!type || node.type === type) {\n result = visitor(node, stack.concat())\n }\n\n if (node.children && result !== false) {\n return all(node.children, node)\n }\n\n return result\n }","function node() {\n invoke(this);\n }","function visitedNode(url) {\n\tvar nodeIndex = getNodeIndex(url);\n\tvar node = dataHolder.nodes[nodeIndex];\n\tnode.visited = true;\n}","function Node() {}","get node() { return this._node; }","function Node(){}","visit(){\n this.visited = true ;\n }","function one(node, index, parents) {\n var result\n\n if (!test || is(test, node, index, parents[parents.length - 1] || null)) {\n result = visitor(node, parents)\n\n if (result === EXIT) {\n return result\n }\n }\n\n if (node.children && result !== SKIP) {\n return all(node.children, parents.concat(node)) === EXIT ? EXIT : result\n }\n\n return result\n }","function one(node, index, parents) {\n var result\n\n if (!test || is(test, node, index, parents[parents.length - 1] || null)) {\n result = visitor(node, parents)\n\n if (result === EXIT) {\n return result\n }\n }\n\n if (node.children && result !== SKIP) {\n return all(node.children, parents.concat(node)) === EXIT ? EXIT : result\n }\n\n return result\n }","trackNodeBy(index, node) {\n return node.id;\n }","function printNode (value) {\n console.log('Visisted vertex: ' + value)\n}","function xpath_single_node(context_node, xpath) {\n return document.evaluate( \n xpath + '[1]', \n context_node, null, XPathResult.FIRST_ORDERED_NODE_TYPE, null\n ).singleNodeValue;\n }","traverse() {\n this.root.visit(this.root);\n }","function acceptNode()\n {\n return NodeFilter.FILTER_ACCEPT;\n }","function RNode(){}","function RNode() {}","function RNode() {}","function RNode() {}","function selectNode() {\n if ((graphTypes[selected] == \"material\") || (graphTypes[selected] == \"process\")) {\n updateAttributes(this);\n } else if (graphTypes[selected] == \"link\") {\n addEdge(this);\n } else if (graphTypes[selected] == \"delete\") {\n deleteNode(this.id);\n }\n}","visit(node) {\n node.state = 1 /* IN_PROGRESS */;\n for (const edge of Object.values(node.dependencies)) {\n const target = this.nodes[edge.to];\n switch (target.state) {\n case 2 /* VISITED */: break; // Do nothing, since node was already visited\n case 1 /* IN_PROGRESS */:\n this.visitOpenNode(node, target, edge);\n break;\n case 0 /* NOT_VISITED */: this.visit(target);\n }\n }\n if (node.state !== 2 /* VISITED */) {\n node.state = 2 /* VISITED */;\n this.sortedNodeList.push(node.hash);\n }\n }","function highlightSingleNode(node) {\n d3.select('#type' + node.type + '-group' + node.id)\n .transition()\n .style('opacity', DEFAULT_NODE_EDGE_OPACITY);\n }","function Visitor(doc) {\n\tthis.stack = [];\n\tthis.parent = doc; //always a list item\n\tthis.node = doc.head();\n\tthis.index = 0;\n\tthis.point = 1;\n\tthis.retained = 0;\n\tthis.ops = []; //to get to the doc\n}","function VNode() {}","function TNode() {}","function TNode() {}","function TNode() {}","function TNode(){}","function visit(node) {\n // Only consider exported nodes\n if (!isNodeExported(node))\n return;\n if (node.kind === ts.SyntaxKind.EnumDeclaration) {\n var enNode = node;\n var symbol = checker.getSymbolAtLocation(enNode.name);\n if (!!symbol && generateDts) {\n visitEnumNode(enNode, symbol);\n }\n }\n else if (node.kind === ts.SyntaxKind.FunctionDeclaration) {\n var fnNode = node;\n var symbol = checker.getSymbolAtLocation(fnNode.name);\n if (!!symbol && generateDts) {\n visitFunctionNode(fnNode, symbol);\n }\n }\n else if (node.kind === ts.SyntaxKind.VariableStatement) {\n var vsNode = node;\n if (vsNode.declarationList.declarations.length > 0) {\n var varNode = vsNode.declarationList.declarations[0];\n var symbol = checker.getSymbolAtLocation(varNode.name);\n if (!!symbol && (generateDts || isSymbolHasComments(symbol))) {\n visitVariableNode(varNode, symbol);\n }\n }\n }\n else if (node.kind === ts.SyntaxKind.ClassDeclaration) {\n // This is a top level class, get its symbol\n var symbol = checker.getSymbolAtLocation(node.name);\n if (!symbol)\n return;\n if (generateDts || isSymbolHasComments(symbol)) {\n visitDocumentedNode(node, symbol);\n }\n }\n else if (node.kind === ts.SyntaxKind.InterfaceDeclaration) {\n // This is a top level class, get its symbol\n var name_1 = node.name;\n var symbol = checker.getSymbolAtLocation(name_1);\n if (generateDts || isSymbolHasComments(symbol) || isOptionsInterface(name_1.text)) {\n visitDocumentedNode(node, symbol);\n }\n }\n else if (node.kind === ts.SyntaxKind.ModuleDeclaration) {\n // This is a namespace, visit its children\n ts.forEachChild(node, visit);\n }\n else if (node.kind === ts.SyntaxKind.ExportDeclaration) {\n visitExportDeclarationNode(node);\n }\n }","function markIt(node, modeljsav) {\n node.addClass(\"visited\");\n modeljsav.umsg(\"Add node \" + node.value() + \" to the MST\");\n node.highlight();\n }","function highlightNode(nodeId) {\n var node = myDiagram.findNodeForKey(nodeId++);\n // console.log(node);\n if (node !== null) {\n // make sure the selected node is in the viewport\n myDiagram.scrollToRect(node.actualBounds);\n // move the large yellow node behind the selected node to highlight it\n highlighter.location = new go.Point(\n node.location.x + 40,\n node.location.y + 40\n );\n // console.log(node.location)\n // console.log(highlighter.location)\n }\n}","function NodeHandler() { }","function visit(node) {\r\n if (visited.has(node)) {\r\n return;\r\n }\r\n visited.add(node);\r\n var children = graph.get(node);\r\n if (children) {\r\n children.forEach(visit);\r\n }\r\n sorted.push(node);\r\n }","function get_node(id)\n {\n return indexbyid[id];\n }","function NodeDef() {}","function NodeDef() {}","function NodeDef() {}","function node(v) {\n\t\t\t\tif (!v.firstChild ||\n\t\t\t\t\tv.firstChild.nodeName === \"#text\") {\n\t\t\t\t\tv = v.textContent.match(/[^\\n]+/);\n\n\t\t\t\t\treturn v != null ? v[0] : \"\";\n\t\t\t\t}\n\n\t\t\t\treturn node(v.firstChild);\n\t\t\t}","function markIt(node, av) {\n var edge;\n step++;\n node.addedStep = step;\n node.addClass(\"visited\");\n if (av) {\n av.umsg(\"Visit node \" + node.value());\n }\n node.highlight();\n if (av) {\n av.step();\n if (node.prev) {\n av.umsg(\"Add edge (\" + node.prev.value() + \",\" + node.value() +\n \") to the DFS graph\");\n edge = node.edgeFrom(node.prev).css({\"stroke-width\": \"4\", \"stroke\": \"red\"});\n edge.added = true;\n av.step();\n }\n av.stepOption('grade', true);\n }\n }","function traverseNodes(node) {\n if (node.value) {\n cb(node.value);\n }\n if (node.left) {\n traverseNodes(node.left);\n }\n if (node.right) {\n traverseNodes(node.right);\n }\n }","function Node() {\r\n this.className = 'Node';\r\n this.id = null;\r\n this.serverId = null;\r\n this.name = null;\r\n this.date = null;\r\n this.duration = null;\r\n this.state = \"closed\";\r\n this.checked = false;\r\n this.traverseToken = null;\r\n // Means node has no children.\r\n this.leaf = false;\r\n // for editing node: information source\r\n this.source = null;\r\n // the flag is this node belongs to user\r\n this.belongsToUser = false;\r\n // this node is currently edited\r\n this.edited = false;\r\n // key which would be shared\r\n this.shareId = null;\r\n}","function Node() {\n}","function RNode() { }","function RNode() { }","function markIt(node, av) {\n var edge;\n step++;\n node.addedStep = step;\n node.addClass(\"visited\");\n if (av) {\n av.umsg(\"Visit node \" + node.value());\n }\n node.highlight();\n if (av) {\n av.step();\n if (node.prev) {\n av.umsg(\"Add edge (\" + node.prev.value() + \",\" + node.value() +\n \") to the DFS graph\");\n edge = node.edgeFrom(node.prev).css({\"stroke-width\": \"4\", \"stroke\": \"red\"});\n edge.added = true;\n av.step();\n }\n av.stepOption('grade', true);\n }\n }","link() {\n //the act of walking causes the nodes to be linked\n this.walk(() => { }, {\n walkMode: visitors_1.WalkMode.visitAllRecursive\n });\n }","function Node() {\n }","function VertexNode( point ) {\n\n\t\tthis.point = point;\n\t\tthis.prev = null;\n\t\tthis.next = null;\n\t\tthis.face = null; // the face that is able to see this vertex\n\n\t}","function NodeDef(){}","getNodeValue() {}","function visit() {\n if (this.isBlacklisted()) return false;\n if (this.opts.shouldSkip && this.opts.shouldSkip(this)) return false;\n\n this.call(\"enter\");\n\n if (this.shouldSkip) {\n return this.shouldStop;\n }\n\n var node = this.node;\n var opts = this.opts;\n\n if (node) {\n if (Array.isArray(node)) {\n // traverse over these replacement nodes we purposely don't call exitNode\n // as the original node has been destroyed\n for (var i = 0; i < node.length; i++) {\n _index2[\"default\"].node(node[i], opts, this.scope, this.state, this, this.skipKeys);\n }\n } else {\n _index2[\"default\"].node(node, opts, this.scope, this.state, this, this.skipKeys);\n this.call(\"exit\");\n }\n }\n\n return this.shouldStop;\n}","function node(val){\n\tthis.val = val;\n\tthis.next = null;\n}","function Node(){\n\t\tthis.setup();\n\t\tthis;\n\t}","function VertexNode( point ) {\n\n\t\t\tthis.point = point;\n\t\t\tthis.prev = null;\n\t\t\tthis.next = null;\n\t\t\tthis.face = null; // the face that is able to see this vertex\n\n\t\t}","function visit(node, visitor) {\n const visitor_ = initVisitor(visitor);\n if (identity.isDocument(node)) {\n const cd = visit_(null, node.contents, visitor_, Object.freeze([node]));\n if (cd === REMOVE)\n node.contents = null;\n }\n else\n visit_(null, node, visitor_, Object.freeze([]));\n}","function SelectNode(nodeId){\n var nodeObj = $(\"#\"+nodeId).val();\n $(\"#divTree\").jstree(\"select_node\", nodeObj, null, null); \n}","function node(x, y, parent_index, g, h, f)\n{\n\tthis.x = x;\n\tthis.y = y;\n\tthis.parent_index = parent_index;\n\tthis.g = g;\n\tthis.h = h;\n\tthis.f = f;\n}","function Node(value) {\n\n this.value = value;\n this.edges = [];\n this.searched = false;\n this.parent = null;\n\n\n }","function Node(data) {\n this.data = data;\n}","function highlightGraphNode( node, on )\n {\n //if( d3.event.shiftKey ) on = false; // for debugging\n\n // If we are to activate a movie, and there's already one active,\n // first switch that one off\n if( on && activeMovie !== undefined ) {\n \t highlightGraphNode( nodeArray[activeMovie], false );\n }\n\n // locate the SVG nodes: circle & label group\n circle = d3.select( '#c' + node.index );\n label = d3.select( '#l' + node.index );\n\n // activate/deactivate the node itself\n circle\n\t.classed( 'main', on );\n label\n\t.classed( 'on', on || currentZoom >= SHOW_THRESHOLD );\n label.selectAll('text')\n\t.classed( 'main', on );\n\n // activate all siblings\n Object(node.links).forEach( function(id) {\n\td3.select(\"#c\"+id).classed( 'sibling', on );\n\tlabel = d3.select('#l'+id);\n\tlabel.classed( 'on', on || currentZoom >= SHOW_THRESHOLD );\n\tlabel.selectAll('text.nlabel')\n\t .classed( 'sibling', on );\n } );\n\n // set the value for the current active movie\n activeMovie = on ? node.index : undefined;\n }","function NodeVisitor() {\n _classCallCheck(this, NodeVisitor);\n\n this[path] = [];\n }","function visit(node, visitor) {\n const visitor_ = initVisitor(visitor);\n if (isDocument(node)) {\n const cd = visit_(null, node.contents, visitor_, Object.freeze([node]));\n if (cd === REMOVE)\n node.contents = null;\n }\n else\n visit_(null, node, visitor_, Object.freeze([]));\n }","function visit() {\n\t if (this.isBlacklisted()) return false;\n\t if (this.opts.shouldSkip && this.opts.shouldSkip(this)) return false;\n\n\t this.call(\"enter\");\n\n\t if (this.shouldSkip) {\n\t return this.shouldStop;\n\t }\n\n\t var node = this.node;\n\t var opts = this.opts;\n\n\t if (node) {\n\t if (Array.isArray(node)) {\n\t // traverse over these replacement nodes we purposely don't call exitNode\n\t // as the original node has been destroyed\n\t for (var i = 0; i < node.length; i++) {\n\t _index2[\"default\"].node(node[i], opts, this.scope, this.state, this, this.skipKeys);\n\t }\n\t } else {\n\t _index2[\"default\"].node(node, opts, this.scope, this.state, this, this.skipKeys);\n\t this.call(\"exit\");\n\t }\n\t }\n\n\t return this.shouldStop;\n\t}","function visit() {\n\t if (this.isBlacklisted()) return false;\n\t if (this.opts.shouldSkip && this.opts.shouldSkip(this)) return false;\n\n\t this.call(\"enter\");\n\n\t if (this.shouldSkip) {\n\t return this.shouldStop;\n\t }\n\n\t var node = this.node;\n\t var opts = this.opts;\n\n\t if (node) {\n\t if (Array.isArray(node)) {\n\t // traverse over these replacement nodes we purposely don't call exitNode\n\t // as the original node has been destroyed\n\t for (var i = 0; i < node.length; i++) {\n\t _index2[\"default\"].node(node[i], opts, this.scope, this.state, this, this.skipKeys);\n\t }\n\t } else {\n\t _index2[\"default\"].node(node, opts, this.scope, this.state, this, this.skipKeys);\n\t this.call(\"exit\");\n\t }\n\t }\n\n\t return this.shouldStop;\n\t}","function Node(value){\n this.value =value;\n this.next = null;\n this.id = null;\n}","function selectSingleNode(xPath,params){\r\n\t\tparams=params||{}; params['type']=9;\r\n\t\treturn selectNodes(xPath,params).singleNodeValue;\r\n\t}","function selectSingleNode(xPath,params){\r\n\t\tparams=params||{}; params['type']=9;\r\n\t\treturn selectNodes(xPath,params).singleNodeValue;\r\n\t}","function selectSingleNode(xPath,params){\r\n\t\tparams=params||{}; params['type']=9;\r\n\t\treturn selectNodes(xPath,params).singleNodeValue;\r\n\t}","function NodeDef() { }","function NodeDef() { }","function Node (value) {\n this.value = value;\n this.next = null;\n}","function handleMouseClickNode(d) {\n var data = data_display.getNearLinksAndNodes(d, links);\n data_display.highlightElements(data, d, svg);\n data_display.getInfoForSelectedNode($element, d);\n exposeSiblingNodes(data.nodes);\n }","function printOne(v) {\n if (visited[v] == 0) {\n\n dfs(v);\n }\n }","getNode() {\n throw new Error(\"Must be implemented\");\n }","function Node(value) {\n this.value = value;\n this.next = null;\n}","function depthFirst(node, visited = new Set()) {\n if (visited.has(node.val)) return; //base case\n visited.add(node.val);\n console.log(node.val);\n node.neighbors.forEach((neighbor) => depthFirst(neighbor, visted));\n}","function doVisitFull(visit, node) {\n if(node.left) {\n var v = doVisitFull(visit, node.left)\n if(v) { return v }\n }\n var v = visit(node.key, node.value)\n if(v) { return v }\n if(node.right) {\n return doVisitFull(visit, node.right)\n }\n}","function doVisitFull(visit, node) {\n if(node.left) {\n var v = doVisitFull(visit, node.left)\n if(v) { return v }\n }\n var v = visit(node.key, node.value)\n if(v) { return v }\n if(node.right) {\n return doVisitFull(visit, node.right)\n }\n}","function doVisitFull(visit, node) {\n if(node.left) {\n var v = doVisitFull(visit, node.left)\n if(v) { return v }\n }\n var v = visit(node.key, node.value)\n if(v) { return v }\n if(node.right) {\n return doVisitFull(visit, node.right)\n }\n}","function doVisitFull(visit, node) {\n if(node.left) {\n var v = doVisitFull(visit, node.left)\n if(v) { return v }\n }\n var v = visit(node.key, node.value)\n if(v) { return v }\n if(node.right) {\n return doVisitFull(visit, node.right)\n }\n}","function doVisitFull(visit, node) {\n if(node.left) {\n var v = doVisitFull(visit, node.left)\n if(v) { return v }\n }\n var v = visit(node.key, node.value)\n if(v) { return v }\n if(node.right) {\n return doVisitFull(visit, node.right)\n }\n}"],"string":"[\n \"visitNode(node) { }\",\n \"visit() {\\n if(this.state) this.state = Node.VISITED;\\n }\",\n \"function node(){}\",\n \"function one(node, index, parent) {\\n var result;\\n\\n index = index || (parent ? 0 : null);\\n\\n if (!type || node.type === type) {\\n result = visitor(node, index, parent || null);\\n }\\n\\n if (node.children && result !== false) {\\n return all(node.children, node);\\n }\\n\\n return result;\\n }\",\n \"function visit(node, fn) {\\n if (!node.visited) {\\n define(node, 'visited', true);\\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\\n }\\n return node;\\n}\",\n \"function visit(node, fn) {\\n if (!node.visited) {\\n define(node, 'visited', true);\\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\\n }\\n\\n return node;\\n}\",\n \"visit(node, context) {\\n if (node instanceof AST) {\\n node.visit(this, context);\\n }\\n else {\\n node.visit(this);\\n }\\n }\",\n \"visit(node, context) {\\n if (node instanceof AST) {\\n node.visit(this, context);\\n }\\n else {\\n node.visit(this);\\n }\\n }\",\n \"function visit(node, fn) {\\n if (!node.visited) {\\n _define(node, 'visited', true);\\n\\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\\n }\\n\\n return node;\\n}\",\n \"function visit(node, fn) {\\n if (!node.visited) {\\n defineProperty$7(node, 'visited', true);\\n return node.nodes ? mapVisit$1(node.nodes, fn) : fn(node);\\n }\\n return node;\\n}\",\n \"function traverseNodes(node, visitor) {\\n traverse(node, null, visitor);\\n}\",\n \"function one(node) {\\n if (node.type === type) {\\n callback.call(context, node);\\n }\\n\\n var children = node.children;\\n var index = -1;\\n var length = children ? children.length : 0;\\n\\n while (++index < length) {\\n one(children[index]);\\n }\\n }\",\n \"function visit(node, fn) {\\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\\n }\",\n \"function visit(node, fn) {\\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\\n }\",\n \"function visit(node, fn) {\\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\\n }\",\n \"function visit(node, fn) {\\n return node.nodes ? mapVisit(node.nodes, fn) : fn(node);\\n }\",\n \"function one(node) {\\n var result\\n\\n if (!type || node.type === type) {\\n result = visitor(node, stack.concat())\\n }\\n\\n if (node.children && result !== false) {\\n return all(node.children, node)\\n }\\n\\n return result\\n }\",\n \"function one(node) {\\n var result\\n\\n if (!type || node.type === type) {\\n result = visitor(node, stack.concat())\\n }\\n\\n if (node.children && result !== false) {\\n return all(node.children, node)\\n }\\n\\n return result\\n }\",\n \"function one(node) {\\n var result\\n\\n if (!type || node.type === type) {\\n result = visitor(node, stack.concat())\\n }\\n\\n if (node.children && result !== false) {\\n return all(node.children, node)\\n }\\n\\n return result\\n }\",\n \"function one(node) {\\n var result\\n\\n if (!type || node.type === type) {\\n result = visitor(node, stack.concat())\\n }\\n\\n if (node.children && result !== false) {\\n return all(node.children, node)\\n }\\n\\n return result\\n }\",\n \"function one(node) {\\n var result\\n\\n if (!type || node.type === type) {\\n result = visitor(node, stack.concat())\\n }\\n\\n if (node.children && result !== false) {\\n return all(node.children, node)\\n }\\n\\n return result\\n }\",\n \"function one(node) {\\n var result\\n\\n if (!type || node.type === type) {\\n result = visitor(node, stack.concat())\\n }\\n\\n if (node.children && result !== false) {\\n return all(node.children, node)\\n }\\n\\n return result\\n }\",\n \"function node() {\\n invoke(this);\\n }\",\n \"function visitedNode(url) {\\n\\tvar nodeIndex = getNodeIndex(url);\\n\\tvar node = dataHolder.nodes[nodeIndex];\\n\\tnode.visited = true;\\n}\",\n \"function Node() {}\",\n \"get node() { return this._node; }\",\n \"function Node(){}\",\n \"visit(){\\n this.visited = true ;\\n }\",\n \"function one(node, index, parents) {\\n var result\\n\\n if (!test || is(test, node, index, parents[parents.length - 1] || null)) {\\n result = visitor(node, parents)\\n\\n if (result === EXIT) {\\n return result\\n }\\n }\\n\\n if (node.children && result !== SKIP) {\\n return all(node.children, parents.concat(node)) === EXIT ? EXIT : result\\n }\\n\\n return result\\n }\",\n \"function one(node, index, parents) {\\n var result\\n\\n if (!test || is(test, node, index, parents[parents.length - 1] || null)) {\\n result = visitor(node, parents)\\n\\n if (result === EXIT) {\\n return result\\n }\\n }\\n\\n if (node.children && result !== SKIP) {\\n return all(node.children, parents.concat(node)) === EXIT ? EXIT : result\\n }\\n\\n return result\\n }\",\n \"trackNodeBy(index, node) {\\n return node.id;\\n }\",\n \"function printNode (value) {\\n console.log('Visisted vertex: ' + value)\\n}\",\n \"function xpath_single_node(context_node, xpath) {\\n return document.evaluate( \\n xpath + '[1]', \\n context_node, null, XPathResult.FIRST_ORDERED_NODE_TYPE, null\\n ).singleNodeValue;\\n }\",\n \"traverse() {\\n this.root.visit(this.root);\\n }\",\n \"function acceptNode()\\n {\\n return NodeFilter.FILTER_ACCEPT;\\n }\",\n \"function RNode(){}\",\n \"function RNode() {}\",\n \"function RNode() {}\",\n \"function RNode() {}\",\n \"function selectNode() {\\n if ((graphTypes[selected] == \\\"material\\\") || (graphTypes[selected] == \\\"process\\\")) {\\n updateAttributes(this);\\n } else if (graphTypes[selected] == \\\"link\\\") {\\n addEdge(this);\\n } else if (graphTypes[selected] == \\\"delete\\\") {\\n deleteNode(this.id);\\n }\\n}\",\n \"visit(node) {\\n node.state = 1 /* IN_PROGRESS */;\\n for (const edge of Object.values(node.dependencies)) {\\n const target = this.nodes[edge.to];\\n switch (target.state) {\\n case 2 /* VISITED */: break; // Do nothing, since node was already visited\\n case 1 /* IN_PROGRESS */:\\n this.visitOpenNode(node, target, edge);\\n break;\\n case 0 /* NOT_VISITED */: this.visit(target);\\n }\\n }\\n if (node.state !== 2 /* VISITED */) {\\n node.state = 2 /* VISITED */;\\n this.sortedNodeList.push(node.hash);\\n }\\n }\",\n \"function highlightSingleNode(node) {\\n d3.select('#type' + node.type + '-group' + node.id)\\n .transition()\\n .style('opacity', DEFAULT_NODE_EDGE_OPACITY);\\n }\",\n \"function Visitor(doc) {\\n\\tthis.stack = [];\\n\\tthis.parent = doc; //always a list item\\n\\tthis.node = doc.head();\\n\\tthis.index = 0;\\n\\tthis.point = 1;\\n\\tthis.retained = 0;\\n\\tthis.ops = []; //to get to the doc\\n}\",\n \"function VNode() {}\",\n \"function TNode() {}\",\n \"function TNode() {}\",\n \"function TNode() {}\",\n \"function TNode(){}\",\n \"function visit(node) {\\n // Only consider exported nodes\\n if (!isNodeExported(node))\\n return;\\n if (node.kind === ts.SyntaxKind.EnumDeclaration) {\\n var enNode = node;\\n var symbol = checker.getSymbolAtLocation(enNode.name);\\n if (!!symbol && generateDts) {\\n visitEnumNode(enNode, symbol);\\n }\\n }\\n else if (node.kind === ts.SyntaxKind.FunctionDeclaration) {\\n var fnNode = node;\\n var symbol = checker.getSymbolAtLocation(fnNode.name);\\n if (!!symbol && generateDts) {\\n visitFunctionNode(fnNode, symbol);\\n }\\n }\\n else if (node.kind === ts.SyntaxKind.VariableStatement) {\\n var vsNode = node;\\n if (vsNode.declarationList.declarations.length > 0) {\\n var varNode = vsNode.declarationList.declarations[0];\\n var symbol = checker.getSymbolAtLocation(varNode.name);\\n if (!!symbol && (generateDts || isSymbolHasComments(symbol))) {\\n visitVariableNode(varNode, symbol);\\n }\\n }\\n }\\n else if (node.kind === ts.SyntaxKind.ClassDeclaration) {\\n // This is a top level class, get its symbol\\n var symbol = checker.getSymbolAtLocation(node.name);\\n if (!symbol)\\n return;\\n if (generateDts || isSymbolHasComments(symbol)) {\\n visitDocumentedNode(node, symbol);\\n }\\n }\\n else if (node.kind === ts.SyntaxKind.InterfaceDeclaration) {\\n // This is a top level class, get its symbol\\n var name_1 = node.name;\\n var symbol = checker.getSymbolAtLocation(name_1);\\n if (generateDts || isSymbolHasComments(symbol) || isOptionsInterface(name_1.text)) {\\n visitDocumentedNode(node, symbol);\\n }\\n }\\n else if (node.kind === ts.SyntaxKind.ModuleDeclaration) {\\n // This is a namespace, visit its children\\n ts.forEachChild(node, visit);\\n }\\n else if (node.kind === ts.SyntaxKind.ExportDeclaration) {\\n visitExportDeclarationNode(node);\\n }\\n }\",\n \"function markIt(node, modeljsav) {\\n node.addClass(\\\"visited\\\");\\n modeljsav.umsg(\\\"Add node \\\" + node.value() + \\\" to the MST\\\");\\n node.highlight();\\n }\",\n \"function highlightNode(nodeId) {\\n var node = myDiagram.findNodeForKey(nodeId++);\\n // console.log(node);\\n if (node !== null) {\\n // make sure the selected node is in the viewport\\n myDiagram.scrollToRect(node.actualBounds);\\n // move the large yellow node behind the selected node to highlight it\\n highlighter.location = new go.Point(\\n node.location.x + 40,\\n node.location.y + 40\\n );\\n // console.log(node.location)\\n // console.log(highlighter.location)\\n }\\n}\",\n \"function NodeHandler() { }\",\n \"function visit(node) {\\r\\n if (visited.has(node)) {\\r\\n return;\\r\\n }\\r\\n visited.add(node);\\r\\n var children = graph.get(node);\\r\\n if (children) {\\r\\n children.forEach(visit);\\r\\n }\\r\\n sorted.push(node);\\r\\n }\",\n \"function get_node(id)\\n {\\n return indexbyid[id];\\n }\",\n \"function NodeDef() {}\",\n \"function NodeDef() {}\",\n \"function NodeDef() {}\",\n \"function node(v) {\\n\\t\\t\\t\\tif (!v.firstChild ||\\n\\t\\t\\t\\t\\tv.firstChild.nodeName === \\\"#text\\\") {\\n\\t\\t\\t\\t\\tv = v.textContent.match(/[^\\\\n]+/);\\n\\n\\t\\t\\t\\t\\treturn v != null ? v[0] : \\\"\\\";\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\treturn node(v.firstChild);\\n\\t\\t\\t}\",\n \"function markIt(node, av) {\\n var edge;\\n step++;\\n node.addedStep = step;\\n node.addClass(\\\"visited\\\");\\n if (av) {\\n av.umsg(\\\"Visit node \\\" + node.value());\\n }\\n node.highlight();\\n if (av) {\\n av.step();\\n if (node.prev) {\\n av.umsg(\\\"Add edge (\\\" + node.prev.value() + \\\",\\\" + node.value() +\\n \\\") to the DFS graph\\\");\\n edge = node.edgeFrom(node.prev).css({\\\"stroke-width\\\": \\\"4\\\", \\\"stroke\\\": \\\"red\\\"});\\n edge.added = true;\\n av.step();\\n }\\n av.stepOption('grade', true);\\n }\\n }\",\n \"function traverseNodes(node) {\\n if (node.value) {\\n cb(node.value);\\n }\\n if (node.left) {\\n traverseNodes(node.left);\\n }\\n if (node.right) {\\n traverseNodes(node.right);\\n }\\n }\",\n \"function Node() {\\r\\n this.className = 'Node';\\r\\n this.id = null;\\r\\n this.serverId = null;\\r\\n this.name = null;\\r\\n this.date = null;\\r\\n this.duration = null;\\r\\n this.state = \\\"closed\\\";\\r\\n this.checked = false;\\r\\n this.traverseToken = null;\\r\\n // Means node has no children.\\r\\n this.leaf = false;\\r\\n // for editing node: information source\\r\\n this.source = null;\\r\\n // the flag is this node belongs to user\\r\\n this.belongsToUser = false;\\r\\n // this node is currently edited\\r\\n this.edited = false;\\r\\n // key which would be shared\\r\\n this.shareId = null;\\r\\n}\",\n \"function Node() {\\n}\",\n \"function RNode() { }\",\n \"function RNode() { }\",\n \"function markIt(node, av) {\\n var edge;\\n step++;\\n node.addedStep = step;\\n node.addClass(\\\"visited\\\");\\n if (av) {\\n av.umsg(\\\"Visit node \\\" + node.value());\\n }\\n node.highlight();\\n if (av) {\\n av.step();\\n if (node.prev) {\\n av.umsg(\\\"Add edge (\\\" + node.prev.value() + \\\",\\\" + node.value() +\\n \\\") to the DFS graph\\\");\\n edge = node.edgeFrom(node.prev).css({\\\"stroke-width\\\": \\\"4\\\", \\\"stroke\\\": \\\"red\\\"});\\n edge.added = true;\\n av.step();\\n }\\n av.stepOption('grade', true);\\n }\\n }\",\n \"link() {\\n //the act of walking causes the nodes to be linked\\n this.walk(() => { }, {\\n walkMode: visitors_1.WalkMode.visitAllRecursive\\n });\\n }\",\n \"function Node() {\\n }\",\n \"function VertexNode( point ) {\\n\\n\\t\\tthis.point = point;\\n\\t\\tthis.prev = null;\\n\\t\\tthis.next = null;\\n\\t\\tthis.face = null; // the face that is able to see this vertex\\n\\n\\t}\",\n \"function NodeDef(){}\",\n \"getNodeValue() {}\",\n \"function visit() {\\n if (this.isBlacklisted()) return false;\\n if (this.opts.shouldSkip && this.opts.shouldSkip(this)) return false;\\n\\n this.call(\\\"enter\\\");\\n\\n if (this.shouldSkip) {\\n return this.shouldStop;\\n }\\n\\n var node = this.node;\\n var opts = this.opts;\\n\\n if (node) {\\n if (Array.isArray(node)) {\\n // traverse over these replacement nodes we purposely don't call exitNode\\n // as the original node has been destroyed\\n for (var i = 0; i < node.length; i++) {\\n _index2[\\\"default\\\"].node(node[i], opts, this.scope, this.state, this, this.skipKeys);\\n }\\n } else {\\n _index2[\\\"default\\\"].node(node, opts, this.scope, this.state, this, this.skipKeys);\\n this.call(\\\"exit\\\");\\n }\\n }\\n\\n return this.shouldStop;\\n}\",\n \"function node(val){\\n\\tthis.val = val;\\n\\tthis.next = null;\\n}\",\n \"function Node(){\\n\\t\\tthis.setup();\\n\\t\\tthis;\\n\\t}\",\n \"function VertexNode( point ) {\\n\\n\\t\\t\\tthis.point = point;\\n\\t\\t\\tthis.prev = null;\\n\\t\\t\\tthis.next = null;\\n\\t\\t\\tthis.face = null; // the face that is able to see this vertex\\n\\n\\t\\t}\",\n \"function visit(node, visitor) {\\n const visitor_ = initVisitor(visitor);\\n if (identity.isDocument(node)) {\\n const cd = visit_(null, node.contents, visitor_, Object.freeze([node]));\\n if (cd === REMOVE)\\n node.contents = null;\\n }\\n else\\n visit_(null, node, visitor_, Object.freeze([]));\\n}\",\n \"function SelectNode(nodeId){\\n var nodeObj = $(\\\"#\\\"+nodeId).val();\\n $(\\\"#divTree\\\").jstree(\\\"select_node\\\", nodeObj, null, null); \\n}\",\n \"function node(x, y, parent_index, g, h, f)\\n{\\n\\tthis.x = x;\\n\\tthis.y = y;\\n\\tthis.parent_index = parent_index;\\n\\tthis.g = g;\\n\\tthis.h = h;\\n\\tthis.f = f;\\n}\",\n \"function Node(value) {\\n\\n this.value = value;\\n this.edges = [];\\n this.searched = false;\\n this.parent = null;\\n\\n\\n }\",\n \"function Node(data) {\\n this.data = data;\\n}\",\n \"function highlightGraphNode( node, on )\\n {\\n //if( d3.event.shiftKey ) on = false; // for debugging\\n\\n // If we are to activate a movie, and there's already one active,\\n // first switch that one off\\n if( on && activeMovie !== undefined ) {\\n \\t highlightGraphNode( nodeArray[activeMovie], false );\\n }\\n\\n // locate the SVG nodes: circle & label group\\n circle = d3.select( '#c' + node.index );\\n label = d3.select( '#l' + node.index );\\n\\n // activate/deactivate the node itself\\n circle\\n\\t.classed( 'main', on );\\n label\\n\\t.classed( 'on', on || currentZoom >= SHOW_THRESHOLD );\\n label.selectAll('text')\\n\\t.classed( 'main', on );\\n\\n // activate all siblings\\n Object(node.links).forEach( function(id) {\\n\\td3.select(\\\"#c\\\"+id).classed( 'sibling', on );\\n\\tlabel = d3.select('#l'+id);\\n\\tlabel.classed( 'on', on || currentZoom >= SHOW_THRESHOLD );\\n\\tlabel.selectAll('text.nlabel')\\n\\t .classed( 'sibling', on );\\n } );\\n\\n // set the value for the current active movie\\n activeMovie = on ? node.index : undefined;\\n }\",\n \"function NodeVisitor() {\\n _classCallCheck(this, NodeVisitor);\\n\\n this[path] = [];\\n }\",\n \"function visit(node, visitor) {\\n const visitor_ = initVisitor(visitor);\\n if (isDocument(node)) {\\n const cd = visit_(null, node.contents, visitor_, Object.freeze([node]));\\n if (cd === REMOVE)\\n node.contents = null;\\n }\\n else\\n visit_(null, node, visitor_, Object.freeze([]));\\n }\",\n \"function visit() {\\n\\t if (this.isBlacklisted()) return false;\\n\\t if (this.opts.shouldSkip && this.opts.shouldSkip(this)) return false;\\n\\n\\t this.call(\\\"enter\\\");\\n\\n\\t if (this.shouldSkip) {\\n\\t return this.shouldStop;\\n\\t }\\n\\n\\t var node = this.node;\\n\\t var opts = this.opts;\\n\\n\\t if (node) {\\n\\t if (Array.isArray(node)) {\\n\\t // traverse over these replacement nodes we purposely don't call exitNode\\n\\t // as the original node has been destroyed\\n\\t for (var i = 0; i < node.length; i++) {\\n\\t _index2[\\\"default\\\"].node(node[i], opts, this.scope, this.state, this, this.skipKeys);\\n\\t }\\n\\t } else {\\n\\t _index2[\\\"default\\\"].node(node, opts, this.scope, this.state, this, this.skipKeys);\\n\\t this.call(\\\"exit\\\");\\n\\t }\\n\\t }\\n\\n\\t return this.shouldStop;\\n\\t}\",\n \"function visit() {\\n\\t if (this.isBlacklisted()) return false;\\n\\t if (this.opts.shouldSkip && this.opts.shouldSkip(this)) return false;\\n\\n\\t this.call(\\\"enter\\\");\\n\\n\\t if (this.shouldSkip) {\\n\\t return this.shouldStop;\\n\\t }\\n\\n\\t var node = this.node;\\n\\t var opts = this.opts;\\n\\n\\t if (node) {\\n\\t if (Array.isArray(node)) {\\n\\t // traverse over these replacement nodes we purposely don't call exitNode\\n\\t // as the original node has been destroyed\\n\\t for (var i = 0; i < node.length; i++) {\\n\\t _index2[\\\"default\\\"].node(node[i], opts, this.scope, this.state, this, this.skipKeys);\\n\\t }\\n\\t } else {\\n\\t _index2[\\\"default\\\"].node(node, opts, this.scope, this.state, this, this.skipKeys);\\n\\t this.call(\\\"exit\\\");\\n\\t }\\n\\t }\\n\\n\\t return this.shouldStop;\\n\\t}\",\n \"function Node(value){\\n this.value =value;\\n this.next = null;\\n this.id = null;\\n}\",\n \"function selectSingleNode(xPath,params){\\r\\n\\t\\tparams=params||{}; params['type']=9;\\r\\n\\t\\treturn selectNodes(xPath,params).singleNodeValue;\\r\\n\\t}\",\n \"function selectSingleNode(xPath,params){\\r\\n\\t\\tparams=params||{}; params['type']=9;\\r\\n\\t\\treturn selectNodes(xPath,params).singleNodeValue;\\r\\n\\t}\",\n \"function selectSingleNode(xPath,params){\\r\\n\\t\\tparams=params||{}; params['type']=9;\\r\\n\\t\\treturn selectNodes(xPath,params).singleNodeValue;\\r\\n\\t}\",\n \"function NodeDef() { }\",\n \"function NodeDef() { }\",\n \"function Node (value) {\\n this.value = value;\\n this.next = null;\\n}\",\n \"function handleMouseClickNode(d) {\\n var data = data_display.getNearLinksAndNodes(d, links);\\n data_display.highlightElements(data, d, svg);\\n data_display.getInfoForSelectedNode($element, d);\\n exposeSiblingNodes(data.nodes);\\n }\",\n \"function printOne(v) {\\n if (visited[v] == 0) {\\n\\n dfs(v);\\n }\\n }\",\n \"getNode() {\\n throw new Error(\\\"Must be implemented\\\");\\n }\",\n \"function Node(value) {\\n this.value = value;\\n this.next = null;\\n}\",\n \"function depthFirst(node, visited = new Set()) {\\n if (visited.has(node.val)) return; //base case\\n visited.add(node.val);\\n console.log(node.val);\\n node.neighbors.forEach((neighbor) => depthFirst(neighbor, visted));\\n}\",\n \"function doVisitFull(visit, node) {\\n if(node.left) {\\n var v = doVisitFull(visit, node.left)\\n if(v) { return v }\\n }\\n var v = visit(node.key, node.value)\\n if(v) { return v }\\n if(node.right) {\\n return doVisitFull(visit, node.right)\\n }\\n}\",\n \"function doVisitFull(visit, node) {\\n if(node.left) {\\n var v = doVisitFull(visit, node.left)\\n if(v) { return v }\\n }\\n var v = visit(node.key, node.value)\\n if(v) { return v }\\n if(node.right) {\\n return doVisitFull(visit, node.right)\\n }\\n}\",\n \"function doVisitFull(visit, node) {\\n if(node.left) {\\n var v = doVisitFull(visit, node.left)\\n if(v) { return v }\\n }\\n var v = visit(node.key, node.value)\\n if(v) { return v }\\n if(node.right) {\\n return doVisitFull(visit, node.right)\\n }\\n}\",\n \"function doVisitFull(visit, node) {\\n if(node.left) {\\n var v = doVisitFull(visit, node.left)\\n if(v) { return v }\\n }\\n var v = visit(node.key, node.value)\\n if(v) { return v }\\n if(node.right) {\\n return doVisitFull(visit, node.right)\\n }\\n}\",\n \"function doVisitFull(visit, node) {\\n if(node.left) {\\n var v = doVisitFull(visit, node.left)\\n if(v) { return v }\\n }\\n var v = visit(node.key, node.value)\\n if(v) { return v }\\n if(node.right) {\\n return doVisitFull(visit, node.right)\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7661173","0.6445177","0.64438576","0.62799275","0.61086637","0.6075337","0.6050634","0.6050634","0.60447025","0.59705806","0.5951017","0.59241366","0.59029406","0.59029406","0.59029406","0.59029406","0.58092374","0.58092374","0.58092374","0.58092374","0.58092374","0.58092374","0.5638122","0.5634819","0.56231177","0.5618358","0.56083405","0.56052923","0.56012523","0.56012523","0.557841","0.54742527","0.54182273","0.5396234","0.5384098","0.53541404","0.53203416","0.53203416","0.53203416","0.52719855","0.52649283","0.5262126","0.5243119","0.5201253","0.5189972","0.5189972","0.5189972","0.5165522","0.5163557","0.5131042","0.5128941","0.51285887","0.5114775","0.5075901","0.50638694","0.50638694","0.50638694","0.5057978","0.5054426","0.50467837","0.50438815","0.5038807","0.5036836","0.5036836","0.50325066","0.5023742","0.5014729","0.5013049","0.5012683","0.50086606","0.49914277","0.49758056","0.49576145","0.49546307","0.4951027","0.49153227","0.49142677","0.49141124","0.4914059","0.4913577","0.49127087","0.49102014","0.4905613","0.4905613","0.4902319","0.48940614","0.48940614","0.48940614","0.48884943","0.48884943","0.48719746","0.48632544","0.48566177","0.4852583","0.48490554","0.48469722","0.48363703","0.48363703","0.48363703","0.48363703","0.48363703"],"string":"[\n \"0.7661173\",\n \"0.6445177\",\n \"0.64438576\",\n \"0.62799275\",\n \"0.61086637\",\n \"0.6075337\",\n \"0.6050634\",\n \"0.6050634\",\n \"0.60447025\",\n \"0.59705806\",\n \"0.5951017\",\n \"0.59241366\",\n \"0.59029406\",\n \"0.59029406\",\n \"0.59029406\",\n \"0.59029406\",\n \"0.58092374\",\n \"0.58092374\",\n \"0.58092374\",\n \"0.58092374\",\n \"0.58092374\",\n \"0.58092374\",\n \"0.5638122\",\n \"0.5634819\",\n \"0.56231177\",\n \"0.5618358\",\n \"0.56083405\",\n \"0.56052923\",\n \"0.56012523\",\n \"0.56012523\",\n \"0.557841\",\n \"0.54742527\",\n \"0.54182273\",\n \"0.5396234\",\n \"0.5384098\",\n \"0.53541404\",\n \"0.53203416\",\n \"0.53203416\",\n \"0.53203416\",\n \"0.52719855\",\n \"0.52649283\",\n \"0.5262126\",\n \"0.5243119\",\n \"0.5201253\",\n \"0.5189972\",\n \"0.5189972\",\n \"0.5189972\",\n \"0.5165522\",\n \"0.5163557\",\n \"0.5131042\",\n \"0.5128941\",\n \"0.51285887\",\n \"0.5114775\",\n \"0.5075901\",\n \"0.50638694\",\n \"0.50638694\",\n \"0.50638694\",\n \"0.5057978\",\n \"0.5054426\",\n \"0.50467837\",\n \"0.50438815\",\n \"0.5038807\",\n \"0.5036836\",\n \"0.5036836\",\n \"0.50325066\",\n \"0.5023742\",\n \"0.5014729\",\n \"0.5013049\",\n \"0.5012683\",\n \"0.50086606\",\n \"0.49914277\",\n \"0.49758056\",\n \"0.49576145\",\n \"0.49546307\",\n \"0.4951027\",\n \"0.49153227\",\n \"0.49142677\",\n \"0.49141124\",\n \"0.4914059\",\n \"0.4913577\",\n \"0.49127087\",\n \"0.49102014\",\n \"0.4905613\",\n \"0.4905613\",\n \"0.4902319\",\n \"0.48940614\",\n \"0.48940614\",\n \"0.48940614\",\n \"0.48884943\",\n \"0.48884943\",\n \"0.48719746\",\n \"0.48632544\",\n \"0.48566177\",\n \"0.4852583\",\n \"0.48490554\",\n \"0.48469722\",\n \"0.48363703\",\n \"0.48363703\",\n \"0.48363703\",\n \"0.48363703\",\n \"0.48363703\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":763,"numItemsPerPage":100,"numTotalItems":82052,"offset":76300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4NjAwOTcyMywianRpIjoiYjE1MTk1OTItMTM1Ni00NzY1LTgyNWYtODVkMWYyYzY5YmU0Iiwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1qYXZhc2NyaXB0LXYxIiwiZXhwIjoxNzg2MDEzMzIzLCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.zgzH0QLRMsj0oqulNvRqTF1k83QeK3tx6sCdnS_S7e9ha-9zwTl8eM8r07qL1dYp37zFuSQ8spodUF0M3st2Cg","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":82052,"numBytesParquet":1713312505}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
Search is not available for this dataset
query stringlengths 7 355k | document stringlengths 9 341k | metadata dict | negatives listlengths 0 101 | negative_scores listlengths 0 101 | document_score stringlengths 3 10 | document_rank stringclasses 102
values |
|---|---|---|---|---|---|---|
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function _default(dom, ecModel) {
var ariaModel = ecModel.getModel('aria');
if (!ariaModel.get('show')) {
return;
} else if (ariaModel.get('description')) {
dom.setAttribute('aria-label', ariaModel.get('description'));
return;
}
var seriesCnt = 0;
ecModel.eachSeries(function (seriesModel, idx)... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get Android() {}",
"function SBRecordsetPHP_analyzePlatformSpecific()\r\n{\r\n\r\n\r\n}",
"onChildAppStart () {\n\n }",
"private internal function m248() {}",
"private public function m246() {}",
"onMessageStart() { }",
"createStream () {\n\n }",
"_playbackCompatibility() {\n // Detect audio pla... | [
"0.5349978",
"0.48933455",
"0.48501366",
"0.48083982",
"0.4772584",
"0.474481",
"0.47349635",
"0.47027457",
"0.46929818",
"0.46929818",
"0.4673667",
"0.4644517",
"0.46389893",
"0.46253318",
"0.4618249",
"0.4582536",
"0.45813942",
"0.45742747",
"0.45687214",
"0.45623618",
"0.4... | 0.0 | -1 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function Scheduler(ecInstance, api, dataProcessorHandlers, visualHandlers) {
this.ecInstance = ecInstance;
this.api = api;
this.unfinished; // Fix current processors in case that in some rear cases that
// processors might be registered after echarts instance created.
// Register processors incrementally for ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get Android() {}",
"function SBRecordsetPHP_analyzePlatformSpecific()\r\n{\r\n\r\n\r\n}",
"onChildAppStart () {\n\n }",
"private internal function m248() {}",
"private public function m246() {}",
"onMessageStart() { }",
"createStream () {\n\n }",
"_playbackCompatibility() {\n // Detect audio pla... | [
"0.53485686",
"0.48948148",
"0.485071",
"0.48078835",
"0.4771538",
"0.4744391",
"0.47347194",
"0.47043997",
"0.46918696",
"0.46918696",
"0.46722504",
"0.4643159",
"0.46377665",
"0.46263066",
"0.4617044",
"0.45812133",
"0.45800942",
"0.4572664",
"0.4568672",
"0.4561345",
"0.45... | 0.0 | -1 |
Only some legacy stage handlers (usually in echarts extensions) are pure function. To ensure that they can work normally, they should work in block mode, that is, they should not be started util the previous tasks finished. So they cause the progressive rendering disabled. We try to detect the series type, to narrow do... | function detectSeriseType(legacyFunc) {
seriesType = null;
try {
// Assume there is no async when calling `eachSeriesByType`.
legacyFunc(ecModelMock, apiMock);
} catch (e) {}
return seriesType;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function _default(seriesType) {\n return {\n seriesType: seriesType,\n plan: createRenderPlanner(),\n reset: function (seriesModel) {\n var data = seriesModel.getData();\n var coordSys = seriesModel.coordinateSystem;\n var pipelineContext = seriesModel.pipelineContext;\n var isLargeRe... | [
"0.5554196",
"0.5554196",
"0.5554196",
"0.5554196",
"0.5554196",
"0.5554196",
"0.5188415",
"0.509293",
"0.5009413",
"0.49099848",
"0.4895842",
"0.47876376",
"0.4774481",
"0.47356772",
"0.46883628",
"0.46254632",
"0.46091437",
"0.4607717",
"0.45879784",
"0.45827132",
"0.456863... | 0.49045154 | 14 |
Mixin common methods to axis model, Inlcude methods `getFormattedLabels() => Array.` `getCategories() => Array.` `getMin(origin: boolean) => number` `getMax(origin: boolean) => number` `getNeedCrossZero() => boolean` `setRange(start: number, end: number)` `resetRange()` | function mixinAxisModelCommonMethods(Model) {
zrUtil.mixin(Model, axisModelCommonMixin);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function Axis(min, max) {\n this.Min = min;\n this.Max = max;\n }",
"function mixinAxisModelCommonMethods(Model) {\n\t mixin(Model, AxisModelCommonMixin);\n\t }",
"function _default() {\n\n\tfunction axisX(selection, x) {\n\t\tselection.attr(\"transform\", function (d) {\n\t\t\treturn... | [
"0.6456995",
"0.64222115",
"0.64139944",
"0.6311109",
"0.62709725",
"0.62081957",
"0.60227144",
"0.59888047",
"0.5952998",
"0.592759",
"0.59203583",
"0.58894354",
"0.5867283",
"0.5856101",
"0.580715",
"0.5805064",
"0.5797678",
"0.57902026",
"0.57778424",
"0.5771716",
"0.57472... | 0.6458842 | 5 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function decode(json) {
if (!json.UTF8Encoding) {
return json;
}
var encodeScale = json.UTF8Scale;
if (encodeScale == null) {
encodeScale = 1024;
}
var features = json.features;
for (var f = 0; f < features.length; f++) {
var feature = features[f];
var geometry = feature.geometry;
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getGeoJson() {\n return {\n \"type\": \"FeatureCollection\",\n \"features\": [\n {\n \"type\": \"Feature\",\n \"properties\": {},\n \"geometry\": {\n \"type\": \"LineString\",\n \"coordinates\": [\n [\n 13.25441561846926,\n ... | [
"0.6401467",
"0.6251229",
"0.6087593",
"0.5867118",
"0.5793363",
"0.5769249",
"0.57245433",
"0.5660727",
"0.5587197",
"0.5554582",
"0.5480767",
"0.5463705",
"0.54294145",
"0.53844434",
"0.53714746",
"0.5360499",
"0.5350253",
"0.5340355",
"0.5337533",
"0.5335312",
"0.53113735"... | 0.6084094 | 8 |
probably be fetched by multiple times. So we cache the result. axis is created each time during a ec process, so we do not need to clear cache. | function getListCache(axis, prop) {
// Because key can be funciton, and cache size always be small, we use array cache.
return inner(axis)[prop] || (inner(axis)[prop] = []);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function axis_old_camera(result)\n{\n console.log(\"axis_old_camera\")\n console.log(result);\n}",
"get axes() {\n if (this._axes === null) {\n let coll = new IgrAxisCollection();\n let inner = coll._innerColl;\n inner.addListener((sender, e) => {\n sw... | [
"0.55371356",
"0.5492951",
"0.53215224",
"0.52449566",
"0.52361447",
"0.5234773",
"0.51528275",
"0.51246065",
"0.5050779",
"0.50349826",
"0.49853832",
"0.4976081",
"0.4951008",
"0.49115002",
"0.490346",
"0.49022877",
"0.4896473",
"0.48926905",
"0.48906308",
"0.4885324",
"0.48... | 0.44935584 | 98 |
Calculate interval for category axis ticks and labels. To get precise result, at least one of `getRotate` and `isHorizontal` should be implemented in axis. | function calculateCategoryInterval(axis) {
var params = fetchAutoCategoryIntervalCalculationParams(axis);
var labelFormatter = makeLabelFormatter(axis);
var rotation = (params.axisRotate - params.labelRotate) / 180 * Math.PI;
var ordinalScale = axis.scale;
var ordinalExtent = ordinalScale.getExtent(); // Prov... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function calculateCategoryInterval(axis) {\n var params = fetchAutoCategoryIntervalCalculationParams(axis);\n var labelFormatter = makeLabelFormatter(axis);\n var rotation = (params.axisRotate - params.labelRotate) / 180 * Math.PI;\n var ordinalScale = axis.scale;\n var ordinalExtent = ordinalScale.getExtent(... | [
"0.7746507",
"0.7746507",
"0.7739931",
"0.7715091",
"0.77078474",
"0.6546765",
"0.64099866",
"0.64099866",
"0.64099866",
"0.64099866",
"0.62500155",
"0.5976774",
"0.58163536",
"0.5799666",
"0.57894534",
"0.57893443",
"0.56676996",
"0.55825084",
"0.5572562",
"0.555126",
"0.552... | 0.7746507 | 3 |
It is time consuming for large category data. | function makeLabelsByCustomizedCategoryInterval(axis, categoryInterval, onlyTick) {
var ordinalScale = axis.scale;
var labelFormatter = makeLabelFormatter(axis);
var result = [];
zrUtil.each(ordinalScale.getTicks(), function (tickValue) {
var rawLabel = ordinalScale.getLabel(tickValue);
if (categoryInt... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function disneyCategories(){\n //fetch get index for attractions\n \n byCategory()\n}",
"parseUniqueCategories(dataSet) {\n return dataSet.businesses.reduce((accum, business) => {\n business.categories.forEach((item) => {\n if (!(accum.findIndex(ele => ele.displayTitle === item[0]) + 1)) ... | [
"0.65933365",
"0.6431569",
"0.63838863",
"0.6295054",
"0.62482774",
"0.61676735",
"0.60887426",
"0.6032884",
"0.6030886",
"0.60207045",
"0.59903777",
"0.5935371",
"0.5903373",
"0.5855015",
"0.5827368",
"0.58258593",
"0.5816537",
"0.5806314",
"0.5792421",
"0.57911104",
"0.5784... | 0.0 | -1 |
Hover to change label and labelLine | function onEmphasis() {
polyline.ignore = polyline.hoverIgnore;
text.ignore = text.hoverIgnore;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function labelMouseOver(tag) {\n d3.selectAll('marker#' + tag)\n .select('path')\n .classed('hovered', true);\n\n d3.selectAll('.' + tag)\n .selectAll('path, text')\n .classed('hovered', true);\n }",
"mouseover() {\n this.label.value = \"Reset\";\n this.label.innerHTML = ... | [
"0.7160445",
"0.6749156",
"0.6671658",
"0.6635125",
"0.66347754",
"0.6629498",
"0.655893",
"0.6482963",
"0.6458986",
"0.64368105",
"0.6426821",
"0.63938105",
"0.63766766",
"0.63610965",
"0.6343155",
"0.63140905",
"0.6271357",
"0.6249969",
"0.6235974",
"0.62019086",
"0.6192681... | 0.0 | -1 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function _default(seriesType, actionInfos) {
zrUtil.each(actionInfos, function (actionInfo) {
actionInfo.update = 'updateView';
/**
* @payload
* @property {string} seriesName
* @property {string} name
*/
echarts.registerAction(actionInfo, function (payload, ecModel) {
var select... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get Android() {}",
"function SBRecordsetPHP_analyzePlatformSpecific()\r\n{\r\n\r\n\r\n}",
"onChildAppStart () {\n\n }",
"private internal function m248() {}",
"private public function m246() {}",
"onMessageStart() { }",
"createStream () {\n\n }",
"_playbackCompatibility() {\n // Detect audio pla... | [
"0.53485686",
"0.48948148",
"0.485071",
"0.48078835",
"0.4771538",
"0.4744391",
"0.47347194",
"0.47043997",
"0.46918696",
"0.46918696",
"0.46722504",
"0.4643159",
"0.46377665",
"0.46263066",
"0.4617044",
"0.45812133",
"0.45800942",
"0.4572664",
"0.4568672",
"0.4561345",
"0.45... | 0.0 | -1 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function _default(seriesType) {
return {
getTargetSeries: function (ecModel) {
// Pie and funnel may use diferrent scope
var paletteScope = {};
var seiresModelMap = createHashMap();
ecModel.eachSeriesByType(seriesType, function (seriesModel) {
seriesModel.__paletteScope = paletteSc... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function pickColor(d, data, colorIds) {\n var candidateId;\n for (var i=0; i<colorIds.length; i++) {\n candidateId = colorIds[i];\n if (isAvailableColor(d, data, candidateId)) {\n return candidateId;\n }\n }\n return -1; // no colors are available\n }",
"function randomColorFro... | [
"0.643499",
"0.642668",
"0.63656324",
"0.63511217",
"0.6295097",
"0.61797124",
"0.6169629",
"0.6081259",
"0.60623425",
"0.6044933",
"0.6036062",
"0.60214996",
"0.602073",
"0.60085523",
"0.60078835",
"0.5987677",
"0.5984509",
"0.5982623",
"0.5945424",
"0.5917955",
"0.59073406"... | 0.0 | -1 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function adjustSingleSide(list, cx, cy, r, dir, viewWidth, viewHeight) {
list.sort(function (a, b) {
return a.y - b.y;
});
function shiftDown(start, end, delta, dir) {
for (var j = start; j < end; j++) {
list[j].y += delta;
if (j > start && j + 1 < end && list[j + 1].y > list[j].y + list[j].... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get labelPosition() {\n return this.getLabelPosition();\n }",
"get labelPosition() {\n return this._labelPosition;\n }",
"svgLabelAlign(text, wrapBound, childNodes) {\n let bounds = new Size(wrapBound.width, childNodes.length * (text.fontSize * 1.2));\n let pos = { x: 0, y: 0 };\n ... | [
"0.6931916",
"0.665873",
"0.6405361",
"0.62561005",
"0.6243183",
"0.6194407",
"0.6140204",
"0.6122073",
"0.6120772",
"0.60901755",
"0.60614437",
"0.58918643",
"0.58845127",
"0.5879064",
"0.58707356",
"0.58377695",
"0.5821333",
"0.5810859",
"0.57923913",
"0.5784863",
"0.576521... | 0.0 | -1 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function _default(seriesType) {
return {
seriesType: seriesType,
reset: function (seriesModel, ecModel) {
var legendModels = ecModel.findComponents({
mainType: 'legend'
});
if (!legendModels || !legendModels.length) {
return;
}
var data = seriesModel.getData();
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"onChildAppStart () {\n\n }",
"get Android() {}",
"onMessageStart() { }",
"_playbackCompatibility() {\n // Detect audio playback capabilities.\n\n // Detect HTML5 Audio playback.\n // http://caniuse.com/#feat=audio\n this.canUseAudio = Boolean(new Audio());\n console.log('Native HTML5 Audio pl... | [
"0.47174537",
"0.4658246",
"0.45285463",
"0.45032862",
"0.44835344",
"0.44350168",
"0.4382653",
"0.43627265",
"0.43324777",
"0.4301593",
"0.42541128",
"0.42418656",
"0.4221815",
"0.42179117",
"0.41816333",
"0.41801563",
"0.41795337",
"0.417805",
"0.4176735",
"0.41745046",
"0.... | 0.0 | -1 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function TooltipRichContent(api) {
this._zr = api.getZr();
this._show = false;
/**
* @private
*/
this._hideTimeout;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"render() {\n return (\n <g className=\"chart-legend-group\"/>\n );\n }",
"function Group(options) {\n // parent can be position(global level) or another group\n\n\n this.children = [];\n this.points = [];\n this.circles = [];\n\n this.state = {\n inAir: false\n };\n\n this.dPos = [0... | [
"0.580015",
"0.5718398",
"0.5697423",
"0.5436387",
"0.5426001",
"0.5347102",
"0.53044784",
"0.5227024",
"0.52139956",
"0.5191827",
"0.5161938",
"0.5144934",
"0.51263905",
"0.5037152",
"0.50369686",
"0.5036872",
"0.50325257",
"0.50307554",
"0.5011569",
"0.49984258",
"0.4982125... | 0.0 | -1 |
If a block is tsv format | function isTSVFormat(block) {
// Simple method to find out if a block is tsv format
var firstLine = block.slice(0, block.indexOf('\n'));
if (firstLine.indexOf(ITEM_SPLITER) >= 0) {
return true;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isTSVFormat(block) {\n\t // Simple method to find out if a block is tsv format\n\t var firstLine = block.slice(0, block.indexOf('\\n'));\n\t\n\t if (firstLine.indexOf(ITEM_SPLITER) >= 0) {\n\t return true;\n\t }\n\t }",
"function isTSVFormat(block){ // Simple method to find... | [
"0.8859122",
"0.8845361",
"0.88139796",
"0.88139796",
"0.87741005",
"0.60407025",
"0.5190595",
"0.5138938",
"0.50869346",
"0.50047666",
"0.4966861",
"0.4956511",
"0.49283457",
"0.4926797",
"0.49011958",
"0.49008223",
"0.48291752",
"0.4825572",
"0.48156893",
"0.48068026",
"0.4... | 0.8741611 | 12 |
although it might be not accurate. | function getScales(xyMinMaxCurr, xyMinMaxOrigin) {
var sizeCurr = getSize(xyMinMaxCurr);
var sizeOrigin = getSize(xyMinMaxOrigin);
var scales = [sizeCurr[0] / sizeOrigin[0], sizeCurr[1] / sizeOrigin[1]];
isNaN(scales[0]) && (scales[0] = 1);
isNaN(scales[1]) && (scales[1] = 1);
return scales;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private internal function m248() {}",
"function returnsNonSmi(){ return 0.25; }",
"get newLength() {\n let result = 0;\n for (let i = 0; i < this.sections.length; i += 2) {\n let ins = this.sections[i + 1];\n result += ins < 0 ? this.sections[i] : ins;\n }\n re... | [
"0.58490884",
"0.5675055",
"0.5659532",
"0.56369245",
"0.55556214",
"0.5525809",
"0.55252767",
"0.5480208",
"0.5458002",
"0.54400927",
"0.5436296",
"0.5426854",
"0.54142547",
"0.5408865",
"0.5396282",
"0.5395298",
"0.5387921",
"0.53818756",
"0.5363293",
"0.5362013",
"0.535283... | 0.0 | -1 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function makeRectPanelClipPath(rect) {
rect = normalizeRect(rect);
return function (localPoints, transform) {
return graphicUtil.clipPointsByRect(localPoints, rect);
};
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get Android() {}",
"function SBRecordsetPHP_analyzePlatformSpecific()\r\n{\r\n\r\n\r\n}",
"onChildAppStart () {\n\n }",
"private internal function m248() {}",
"private public function m246() {}",
"onMessageStart() { }",
"createStream () {\n\n }",
"_playbackCompatibility() {\n // Detect audio pla... | [
"0.5349978",
"0.48933455",
"0.48501366",
"0.48083982",
"0.4772584",
"0.474481",
"0.47349635",
"0.47027457",
"0.46929818",
"0.46929818",
"0.4673667",
"0.4644517",
"0.46389893",
"0.46253318",
"0.4618249",
"0.4582536",
"0.45813942",
"0.45742747",
"0.45687214",
"0.45623618",
"0.4... | 0.0 | -1 |
Avoid that: mouse click on a elements that is over geo or graph, but roam is triggered. | function onIrrelevantElement(e, api, targetCoordSysModel) {
var model = api.getComponentByElement(e.topTarget); // If model is axisModel, it works only if it is injected with coordinateSystem.
var coordSys = model && model.coordinateSystem;
return model && model !== targetCoordSysModel && !IRRELEVANT_EXCLUDES[mo... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function setGridToNonClickable(grid){\n grid.style.pointerEvents=\"none\";\n}",
"function disableRightClick() {\n // stop zoom\n if (d3.event.button == 2) {\n console.log('No right click allowed');\n d3.event.stopImmediatePropagation();\n }\n }",
"function block_user_interaction(paper) {... | [
"0.61968404",
"0.6105043",
"0.60895973",
"0.59898186",
"0.5986817",
"0.5959793",
"0.5935528",
"0.5916358",
"0.5888169",
"0.58759063",
"0.58450454",
"0.5827085",
"0.5826638",
"0.5816487",
"0.5810856",
"0.57984626",
"0.57984626",
"0.5756743",
"0.57469094",
"0.5743923",
"0.57345... | 0.5562286 | 50 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function Cartesian2D(name) {
Cartesian.call(this, name);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get Android() {}",
"function SBRecordsetPHP_analyzePlatformSpecific()\r\n{\r\n\r\n\r\n}",
"onChildAppStart () {\n\n }",
"private internal function m248() {}",
"private public function m246() {}",
"onMessageStart() { }",
"createStream () {\n\n }",
"_playbackCompatibility() {\n // Detect audio pla... | [
"0.5349978",
"0.48933455",
"0.48501366",
"0.48083982",
"0.4772584",
"0.474481",
"0.47349635",
"0.47027457",
"0.46929818",
"0.46929818",
"0.4673667",
"0.4644517",
"0.46389893",
"0.46253318",
"0.4618249",
"0.4582536",
"0.45813942",
"0.45742747",
"0.45687214",
"0.45623618",
"0.4... | 0.0 | -1 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function dimAxisMapper(dim) {
return this._axes[dim];
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get Center() { return [this.x1 + (0.5 * this.x2 - this.x1), this.y1 + (0.5 * this.y2 - this.y1)]; }",
"get Center() { return [this.x1 + (0.5 * this.x2 - this.x1), this.y1 + (0.5 * this.y2 - this.y1)]; }",
"center() {\n let x_center = 0, y_center = 0;\n const coords = this.getCoords();\n for (let... | [
"0.589108",
"0.589108",
"0.57303226",
"0.5684142",
"0.56726396",
"0.561011",
"0.5600579",
"0.5583609",
"0.55618536",
"0.55525583",
"0.5520512",
"0.5502633",
"0.54673386",
"0.54541224",
"0.54532754",
"0.5447362",
"0.5438439",
"0.5435534",
"0.54311943",
"0.54281527",
"0.5427857... | 0.0 | -1 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function setLabel(normalStyle, hoverStyle, itemModel, color, seriesModel, dataIndex, labelPositionOutside) {
var labelModel = itemModel.getModel('label');
var hoverLabelModel = itemModel.getModel('emphasis.label');
graphic.setLabelStyle(normalStyle, hoverStyle, labelModel, hoverLabelModel, {
labelFetcher: ser... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get Android() {}",
"function SBRecordsetPHP_analyzePlatformSpecific()\r\n{\r\n\r\n\r\n}",
"onChildAppStart () {\n\n }",
"private internal function m248() {}",
"private public function m246() {}",
"onMessageStart() { }",
"createStream () {\n\n }",
"_playbackCompatibility() {\n // Detect audio pla... | [
"0.5349978",
"0.48933455",
"0.48501366",
"0.48083982",
"0.4772584",
"0.474481",
"0.47349635",
"0.47027457",
"0.46929818",
"0.46929818",
"0.4673667",
"0.4644517",
"0.46389893",
"0.46253318",
"0.4618249",
"0.4582536",
"0.45813942",
"0.45742747",
"0.45687214",
"0.45623618",
"0.4... | 0.0 | -1 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function isPointsSame(points1, points2) {
if (points1.length !== points2.length) {
return;
}
for (var i = 0; i < points1.length; i++) {
var p1 = points1[i];
var p2 = points2[i];
if (p1[0] !== p2[0] || p1[1] !== p2[1]) {
return;
}
}
return true;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"_radialCoordinates(angles, radius){\n\n return angles.map((angle) => {\n return Coordinate.polar({\n coords: [radius, angle - 90],\n isDegree: true\n });\n })\n\n }",
"static polar (len, angle) {\n return new Point (Math.cos(angle)*len, Math.sin(angle)*len);\n }",
"function ... | [
"0.5401542",
"0.5277288",
"0.52670497",
"0.5204954",
"0.5201989",
"0.51756907",
"0.5160999",
"0.5063061",
"0.5048604",
"0.50392836",
"0.5035456",
"0.49938932",
"0.49804178",
"0.4977963",
"0.49748492",
"0.49673912",
"0.49535117",
"0.4950302",
"0.49470907",
"0.4945801",
"0.4926... | 0.0 | -1 |
Draw smoothed line in nonmonotone, in may cause undesired curve in extreme situations. This should be used when points are nonmonotone neither in x or y dimension. | function drawNonMono(ctx, points, start, segLen, allLen, dir, smoothMin, smoothMax, smooth, smoothMonotone, connectNulls) {
var prevIdx = 0;
var idx = start;
for (var k = 0; k < segLen; k++) {
var p = points[idx];
if (idx >= allLen || idx < 0) {
break;
}
if (isPointNull(p)) {
if (co... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function drawSeriesLines(series){\n\t\t\tfunction plotLine(data, offset){\n\t\t\t\tif(data.length < 2) return;\n\t\n\t\t\t\tvar prevx = tHoz(data[0][0]),\n\t\t\t\t\tprevy = tVert(data[0][1]) + offset;\n\t\n\t\t\t\tctx.beginPath();\n\t\t\t\tctx.moveTo(prevx, prevy);\n\t\t\t\tfor(var i = 0; i < data.length - 1; ++i)... | [
"0.6029256",
"0.6015774",
"0.59806824",
"0.5928093",
"0.5922997",
"0.5870417",
"0.5858161",
"0.5855403",
"0.5854368",
"0.5852314",
"0.5850531",
"0.5846535",
"0.58302444",
"0.58302444",
"0.58302444",
"0.58270085",
"0.58270085",
"0.58270085",
"0.58270085",
"0.58270085",
"0.5827... | 0.6422131 | 5 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function _default(seriesType, defaultSymbolType, legendSymbol) {
// Encoding visual for all series include which is filtered for legend drawing
return {
seriesType: seriesType,
// For legend.
performRawSeries: true,
reset: function (seriesModel, ecModel, api) {
var data = seriesModel.getData()... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"onChildAppStart () {\n\n }",
"get Android() {}",
"onMessageStart() { }",
"_playbackCompatibility() {\n // Detect audio playback capabilities.\n\n // Detect HTML5 Audio playback.\n // http://caniuse.com/#feat=audio\n this.canUseAudio = Boolean(new Audio());\n console.log('Native HTML5 Audio pl... | [
"0.47163445",
"0.46584114",
"0.45273763",
"0.45036152",
"0.448429",
"0.44346538",
"0.43841133",
"0.4362977",
"0.4333602",
"0.43013042",
"0.42535996",
"0.42417178",
"0.42218232",
"0.42189214",
"0.41818306",
"0.41804415",
"0.4179575",
"0.41772082",
"0.41758674",
"0.41746357",
"... | 0.0 | -1 |
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file e... | function _default(seriesType) {
return {
seriesType: seriesType,
plan: createRenderPlanner(),
reset: function (seriesModel) {
var data = seriesModel.getData();
var coordSys = seriesModel.coordinateSystem;
var pipelineContext = seriesModel.pipelineContext;
var isLargeRender = pipeli... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function n$1(){return new Float32Array(4)}",
"function r(){const r=new Float32Array(4);return r[3]=1,r}",
"constructor()\n {\n this.m = new Float32Array(16);\n\n this.m[0] = this.m[5] = this.m[10] = this.m[15] = 1;\n }",
"setFloat32Buffers() {\n let tempArr = []\n for(let i = 0; i <... | [
"0.7301188",
"0.7209965",
"0.69897056",
"0.6968867",
"0.6805486",
"0.6755758",
"0.6741204",
"0.6690487",
"0.66401666",
"0.6595015",
"0.6564376",
"0.65474814",
"0.653853",
"0.6511759",
"0.64967626",
"0.64861786",
"0.64791584",
"0.64246136",
"0.64054227",
"0.63486075",
"0.63478... | 0.0 | -1 |
v8 likes predictible objects | function Item(fun, array) {
this.fun = fun;
this.array = array;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function compareLike(a,b){\n var al = a.idLikesProp.length;\n var bl = b.idLikesProp.length;\n if(al > bl) return -1;\n if(bl > al) return 1;\n return 0;\n}",
"function lookAround() {\n var objectDescription = \"\"\n tj.see().then(function(objects) {\n objects.forEach(function(each) {\n ... | [
"0.527866",
"0.52612406",
"0.51951283",
"0.518796",
"0.51302594",
"0.5044646",
"0.48934332",
"0.4857401",
"0.484017",
"0.48302925",
"0.482028",
"0.4812441",
"0.4808473",
"0.47852293",
"0.47828078",
"0.47574478",
"0.47493434",
"0.4739314",
"0.47239366",
"0.4703992",
"0.4703992... | 0.0 | -1 |
Copyright (c) 2013present, Facebook, Inc. All rights reserved. This source code is licensed under the BSDstyle license found in the LICENSE file in the root directory of this source tree. An additional grant of patent rights can be found in the PATENTS file in the same directory. | function makeEmptyFunction(arg) {
return function () {
return arg;
};
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"componentDidMount() {\n // if this is the first time the home screen is loading\n // we must initialize Facebook\n if (!window.FB) {\n window.fbAsyncInit = function() {\n window.FB.init({\n appId : '280945375708713',\n cookie : true, // enable cookies to allow the s... | [
"0.5606324",
"0.54053015",
"0.5362759",
"0.53557986",
"0.5333446",
"0.52908176",
"0.52908176",
"0.5233073",
"0.51926816",
"0.5186246",
"0.5185339",
"0.5152006",
"0.51346844",
"0.5113237",
"0.50953215",
"0.5080205",
"0.50634295",
"0.5059636",
"0.5039364",
"0.5006647",
"0.49587... | 0.0 | -1 |
inlined Object.is polyfill to avoid requiring consumers ship their own /eslintdisable noselfcompare | function is(x, y) {
// SameValue algorithm
if (x === y) {
// Steps 1-5, 7-10
// Steps 6.b-6.e: +0 != -0
return x !== 0 || 1 / x === 1 / y;
} else {
// Step 6.a: NaN == NaN
return x !== x && y !== y;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isObject$1(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }",
"function isObject$1(obj) {\n ... | [
"0.673139",
"0.6633761",
"0.6610435",
"0.65997535",
"0.65996826",
"0.6565089",
"0.6506278",
"0.6468222",
"0.6462761",
"0.64114064",
"0.63700455",
"0.6365079",
"0.6365079",
"0.6365079",
"0.6365079",
"0.6356776",
"0.63271695",
"0.6322019",
"0.63218695",
"0.62953717",
"0.6295371... | 0.0 | -1 |
Equivalent of `typeof` but with special handling for array and regexp. | function getPropType(propValue) {
var propType = typeof propValue;
if (Array.isArray(propValue)) {
return 'array';
}
if (propValue instanceof RegExp) {
// Old webkits (at least until Android 4.0) return 'function' rather than
// 'object' for typeof a RegExp. We'll normalize this here s... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function sc_typeof( x ) {\n return typeof x;\n}",
"static type(arg)\n {\n const types = [\n 'array', 'boolean', 'function', 'number',\n 'null', 'object', 'regexp', 'symbol', 'string',\n 'undefined'\n ]\n\n var type = Object.prototype.toString.call(arg),\... | [
"0.69097364",
"0.6775297",
"0.6607535",
"0.65383923",
"0.64938533",
"0.64889115",
"0.64889115",
"0.64495087",
"0.64495087",
"0.6429092",
"0.6428121",
"0.6404058",
"0.6404058",
"0.6395446",
"0.6395446",
"0.6395446",
"0.6395446",
"0.6395446",
"0.6395446",
"0.6395446",
"0.639544... | 0.0 | -1 |
This handles more types than `getPropType`. Only used for error messages. See `createPrimitiveTypeChecker`. | function getPreciseType(propValue) {
if (typeof propValue === 'undefined' || propValue === null) {
return '' + propValue;
}
var propType = getPropType(propValue);
if (propType === 'object') {
if (propValue instanceof Date) {
return 'date';
} else if (propValue instanceof RegExp... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getPropType(propValue) {\n\t\t var propType = typeof propValue;\n\t\t if (Array.isArray(propValue)) {\n\t\t return 'array';\n\t\t }\n\t\t if (propValue instanceof RegExp) {\n\t\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t\t // 'object' for type... | [
"0.68773127",
"0.6853938",
"0.6853938",
"0.6853938",
"0.6853938",
"0.6852637",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
"0.6847169",
... | 0.0 | -1 |
Returns a string that is postfixed to a warning about an invalid type. For example, "undefined" or "of type array" | function getPostfixForTypeWarning(value) {
var type = getPreciseType(value);
switch (type) {
case 'array':
case 'object':
return 'an ' + type;
case 'boolean':
case 'date':
case 'regexp':
return 'a ' + type;
default:
return type;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function _undefinedCoerce() {\n return '';\n}",
"function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case \"array\":\n case \"object\":\n return \"an \" + type;\n case \"boolean\":\n ... | [
"0.6599196",
"0.6566137",
"0.6560382",
"0.6560382",
"0.6560382",
"0.6560382",
"0.6523208",
"0.6522379",
"0.6506975",
"0.6506975",
"0.6506975",
"0.6506975",
"0.6506975",
"0.65022165",
"0.64905936",
"0.6478573",
"0.6478573",
"0.6478573",
"0.6478573",
"0.6478573",
"0.6478573",
... | 0.0 | -1 |
Returns class name of the object, if any. | function getClassName(propValue) {
if (!propValue.constructor || !propValue.constructor.name) {
return ANONYMOUS;
}
return propValue.constructor.name;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getClassName(obj) {\n var funcNameRegex = /function\\s+(.+?)\\s*\\(/;\n var results = funcNameRegex.exec(obj['constructor'].toString());\n return (results && results.length > 1) ? results[1] : '';\n }",
"getClassName() {\n return this.constructor\n .className;\n... | [
"0.7730571",
"0.74697196",
"0.74697196",
"0.74258965",
"0.7164231",
"0.71448183",
"0.7083163",
"0.7080694",
"0.6995368",
"0.6971116",
"0.6901662",
"0.6883398",
"0.67147285",
"0.66557264",
"0.6639163",
"0.6611592",
"0.6611592",
"0.6611592",
"0.6611592",
"0.6600893",
"0.6599787... | 0.0 | -1 |
Function to create the first processor. | function unified() {
var attachers = []
var transformers = trough()
var namespace = {}
var frozen = false
var freezeIndex = -1
/* Data management. */
processor.data = data
/* Lock. */
processor.freeze = freeze
/* Plug-ins. */
processor.attachers = attachers
processor.use = use
/* API. */
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function DeviceProcessor() {\n\tvar builder = new processor.Chain();\n\tbuilder.Add(save_flags);\n\tbuilder.Add(strip_syslog_priority);\n\tbuilder.Add(chain1);\n\tbuilder.Add(populate_fields);\n\tbuilder.Add(restore_flags);\n\tvar chain = builder.Build();\n\treturn {\n\t\tprocess: chain.Run,\n\t}\n}",
"function ... | [
"0.5809372",
"0.5809372",
"0.5809372",
"0.5585237",
"0.5585237",
"0.5574443",
"0.54788613",
"0.540701",
"0.5396681",
"0.5302397",
"0.5262711",
"0.51745176",
"0.51745176",
"0.51745176",
"0.51702476",
"0.50886375",
"0.50736797",
"0.50652015",
"0.5063161",
"0.50562364",
"0.50530... | 0.5477166 | 11 |
Create a new processor based on the processor in the current scope. | function processor() {
var destination = unified()
var length = attachers.length
var index = -1
while (++index < length) {
destination.use.apply(null, attachers[index])
}
destination.data(extend(true, {}, namespace))
return destination
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function unified() {\n var attachers = []\n var transformers = trough()\n var namespace = {}\n var freezeIndex = -1\n var frozen\n\n // Data management.\n processor.data = data\n\n // Lock.\n processor.freeze = freeze\n\n // Plugins.\n processor.attachers = attachers\n processor.use = use\n\n // API.\... | [
"0.6117301",
"0.6117301",
"0.60486126",
"0.5904408",
"0.5904408",
"0.5904408",
"0.5904408",
"0.5904408",
"0.58828163",
"0.5800185",
"0.5721235",
"0.56447303",
"0.5328679",
"0.52514666",
"0.52514666",
"0.52514666",
"0.5194525",
"0.51114035",
"0.51101834",
"0.51099145",
"0.5081... | 0.48947236 | 31 |
Data management. Getter / setter for processorspecific informtion. | function data(key, value) {
if (string(key)) {
/* Set `key`. */
if (arguments.length === 2) {
assertUnfrozen('data', frozen)
namespace[key] = value
return processor
}
/* Get `key`. */
return (own.call(namespace, key) && namespace[key]) || null
}
/* S... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get data() {\n\t\treturn this.__data;\n\t}",
"function processedSFData() {\n\t\tthis.moteid = idMote;\n\t\tthis.sensorType = sensorType;\n\t\tthis.lastTimestamp = lastTimeStamp;\n\t\tthis.lastValue = lastValue;\n\t\tthis.arrayValuesDay = valuesDay;\n\t\tthis.populationDay = populationDay;\n\t\tthis.arrayValuesWe... | [
"0.68809307",
"0.68432516",
"0.6731611",
"0.6641427",
"0.6595986",
"0.6528188",
"0.6495358",
"0.64899683",
"0.64805365",
"0.64805365",
"0.64805365",
"0.6422238",
"0.6342294",
"0.63204193",
"0.6317152",
"0.6309514",
"0.62412494",
"0.62303525",
"0.6220492",
"0.62105477",
"0.619... | 0.0 | -1 |
Plugin management. Pass it: an attacher and options, a preset, a list of presets, attachers, and arguments (list of attachers and options). | function use(value) {
var settings
assertUnfrozen('use', frozen)
if (value === null || value === undefined) {
/* Empty */
} else if (typeof value === 'function') {
addPlugin.apply(null, arguments)
} else if (typeof value === 'object') {
if ('length' in value) {
addList(va... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function registerPresets(newPresets) {\n Object.keys(newPresets).forEach(function (name) {\n return registerPreset(name, newPresets[name]);\n });\n } // All the plugins we should bundle",
"function handlePlugins$1(inputs, calendar) {\n calendar.addPluginInputs(inputs); // will ... | [
"0.55730325",
"0.55157",
"0.54918987",
"0.547899",
"0.547899",
"0.547899",
"0.544979",
"0.5436934",
"0.5427202",
"0.5412018",
"0.5412018",
"0.5381513",
"0.53796583",
"0.5375553",
"0.5360351",
"0.5357939",
"0.5339359",
"0.5329402",
"0.53237975",
"0.52955747",
"0.5291243",
"0... | 0.52915937 | 24 |
Parse a file (in string or VFile representation) into a Unist node using the `Parser` on the processor. | function parse(doc) {
var file = vfile(doc)
var Parser
freeze()
Parser = processor.Parser
assertParser('parse', Parser)
if (newable(Parser)) {
return new Parser(String(file), file).parse()
}
return Parser(String(file), file) // eslint-disable-line new-cap
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function Parser(doc, file) {\n this.file = file;\n this.offset = {};\n this.options = xtend(this.options);\n this.setOptions({});\n\n this.inList = false;\n this.inBlock = false;\n this.inLink = false;\n this.atStart = true;\n\n this.toOffset = vfileLocation(file).toOffset;\n this.unescape = unescape(thi... | [
"0.6036263",
"0.59983784",
"0.59361374",
"0.5816456",
"0.5761662",
"0.5761662",
"0.5761662",
"0.56939125",
"0.5656537",
"0.5630632",
"0.5630632",
"0.5630632",
"0.5630632",
"0.5630632",
"0.5630632",
"0.56050044",
"0.55566186",
"0.53403527",
"0.52543056",
"0.5195248",
"0.510845... | 0.5760103 | 11 |
Run transforms on a Unist node representation of a file (in string or VFile representation), async. | function run(node, file, cb) {
assertNode(node)
freeze()
if (!cb && typeof file === 'function') {
cb = file
file = null
}
if (!cb) {
return new Promise(executor)
}
executor(null, cb)
function executor(resolve, reject) {
transformers.run(node, vfile(file), done... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function run(node, file, cb) {\n assertNode(node)\n freeze()\n\n if (!cb && typeof file === 'function') {\n cb = file\n file = null\n }\n\n if (!cb) {\n return new Promise(executor)\n }\n\n executor(null, cb)\n\n function executor(resolve, reject) {\n transformers.run(no... | [
"0.65098184",
"0.65098184",
"0.64999324",
"0.62945503",
"0.57289356",
"0.5724962",
"0.5722019",
"0.56828",
"0.549961",
"0.549961",
"0.5451992",
"0.54037726",
"0.53396654",
"0.5319687",
"0.52944106",
"0.5294002",
"0.52616453",
"0.5174298",
"0.5174298",
"0.5174298",
"0.5174298"... | 0.648857 | 8 |
Run transforms on a Unist node representation of a file (in string or VFile representation), sync. | function runSync(node, file) {
var complete = false
var result
run(node, file, done)
assertDone('runSync', 'run', complete)
return result
function done(err, tree) {
complete = true
bail(err)
result = tree
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function run(node, file, cb) {\n assertNode(node)\n freeze()\n\n if (!cb && typeof file === 'function') {\n cb = file\n file = null\n }\n\n if (!cb) {\n return new Promise(executor)\n }\n\n executor(null, cb)\n\n function executor(resolve, reject) {\n transformers.run(no... | [
"0.6458939",
"0.6458939",
"0.6441855",
"0.6441855",
"0.6441855",
"0.6441855",
"0.6441855",
"0.6441855",
"0.64324313",
"0.6189576",
"0.6004485",
"0.6004485",
"0.5857711",
"0.5753894",
"0.5723392",
"0.56320477",
"0.5556542",
"0.5508055",
"0.5497592",
"0.5380607",
"0.5358036",
... | 0.5192558 | 29 |
Stringify a Unist node representation of a file (in string or VFile representation) into a string using the `Compiler` on the processor. | function stringify(node, doc) {
var file = vfile(doc)
var Compiler
freeze()
Compiler = processor.Compiler
assertCompiler('stringify', Compiler)
assertNode(node)
if (newable(Compiler)) {
return new Compiler(node, file).compile()
}
return Compiler(node, file) // eslint-disable... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function stringify(node, doc) {\n var file = vfile(doc)\n var Compiler\n\n freeze()\n Compiler = processor.Compiler\n assertCompiler('stringify', Compiler)\n assertNode(node)\n\n if (newable(Compiler, 'compile')) {\n return new Compiler(node, file).compile()\n }\n\n return Compiler(... | [
"0.5808315",
"0.5808315",
"0.5808315",
"0.58024615",
"0.57930595",
"0.57202554",
"0.55628264",
"0.51197964",
"0.4944126",
"0.4939946",
"0.49377835",
"0.48916206",
"0.48902163",
"0.47794235",
"0.4768549",
"0.4749499",
"0.47492388",
"0.4656568",
"0.46530744",
"0.4642199",
"0.46... | 0.5798683 | 8 |
Parse a file (in string or VFile representation) into a Unist node using the `Parser` on the processor, then run transforms on that node, and compile the resulting node using the `Compiler` on the processor, and store that result on the VFile. | function process(doc, cb) {
freeze()
assertParser('process', processor.Parser)
assertCompiler('process', processor.Compiler)
if (!cb) {
return new Promise(executor)
}
executor(null, cb)
function executor(resolve, reject) {
var file = vfile(doc)
pipeline.run(processor, {... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function run(node, file, cb) {\n assertNode(node)\n freeze()\n\n if (!cb && typeof file === 'function') {\n cb = file\n file = null\n }\n\n if (!cb) {\n return new Promise(executor)\n }\n\n executor(null, cb)\n\n function executor(resolve, reject) {\n transformers.run(no... | [
"0.57834154",
"0.57834154",
"0.5767879",
"0.5767879",
"0.5767879",
"0.5767879",
"0.5767879",
"0.5767879",
"0.57348526",
"0.5524738",
"0.5524738",
"0.55165803",
"0.55116695",
"0.54946184",
"0.54631734",
"0.54183316",
"0.5407739",
"0.5353386",
"0.53467375",
"0.5325736",
"0.5325... | 0.5542097 | 13 |
Process the given document (in string or VFile representation), sync. | function processSync(doc) {
var complete = false
var file
freeze()
assertParser('processSync', processor.Parser)
assertCompiler('processSync', processor.Compiler)
file = vfile(doc)
process(file, done)
assertDone('processSync', 'process', complete)
return file
function done(e... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function processSync(doc) {\n var file;\n var complete;\n\n freeze();\n assertParser('processSync', processor.Parser);\n assertCompiler('processSync', processor.Compiler);\n file = vfile(doc);\n\n process(file, done);\n\n assertDone('processSync', 'process', complete);\n\n return file\n\... | [
"0.7181027",
"0.71268046",
"0.70949113",
"0.70949113",
"0.65690374",
"0.6545865",
"0.65238076",
"0.65238076",
"0.65238076",
"0.65238076",
"0.65238076",
"0.65238076",
"0.6499528",
"0.6499528",
"0.58608776",
"0.53824717",
"0.537839",
"0.5259523",
"0.5124504",
"0.5109611",
"0.50... | 0.70455825 | 9 |
Check if `func` is a constructor. | function newable(value) {
return typeof value === 'function' && keys(value.prototype)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isConstructor(name, func) {\n return name[0] == name[0].toUpperCase();\n }",
"function isCtor(constr) {\n return constr && !!constr.CONSTRUCTOR___;\n }",
"function IsConstructor(o) {\n // Hacks for Safari 7 TypedArray XXXConstructor objects\n if (/Constructor/.test(Object.protot... | [
"0.78565264",
"0.77827024",
"0.7296092",
"0.72123635",
"0.7098049",
"0.708506",
"0.7060057",
"0.7031812",
"0.70308506",
"0.6960493",
"0.69367325",
"0.6911832",
"0.67534906",
"0.6687986",
"0.6606467",
"0.6507036",
"0.64318717",
"0.6380909",
"0.63796014",
"0.625006",
"0.6194024... | 0.0 | -1 |
Check if `value` is an object with keys. | function keys(value) {
var key
for (key in value) {
return true
}
return false
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isObject(value) {\n var type = typeof value;\n return !!value && (type == 'object');\n }",
"function isKey(value, object) {\n if (Array.isArray(value)) {\n return false;\n }\n const type = typeof value;\n if (\n type === \"number\" ||\n type === \"boolean\" ||\n value ==... | [
"0.71962214",
"0.7146194",
"0.71439165",
"0.71217006",
"0.7090814",
"0.70249754",
"0.7002017",
"0.69980055",
"0.6948843",
"0.6938903",
"0.6933717",
"0.6933717",
"0.6933717",
"0.6933717",
"0.6933717",
"0.6933717",
"0.6933717",
"0.6933717",
"0.6933717",
"0.6933717",
"0.6933717"... | 0.6882035 | 28 |
Assert a parser is available. | function assertParser(name, Parser) {
if (typeof Parser !== 'function') {
throw new Error('Cannot `' + name + '` without `Parser`')
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function assertParser(name, Parser) {\n if (!func(Parser)) {\n throw new Error('Cannot `' + name + '` without `Parser`');\n }\n}",
"async ensureParser() {\n if (!this.parser) {\n this.parser = await ASTParser.importASTParser();\n }\n }",
"function _checkParser() {\n eval(Proce... | [
"0.7156789",
"0.6624209",
"0.6299487",
"0.5044321",
"0.48598248",
"0.48455465",
"0.48403692",
"0.48403692",
"0.4722353",
"0.47192177",
"0.47176996",
"0.47054106",
"0.47054106",
"0.47054106",
"0.47054106",
"0.47034496",
"0.47034496",
"0.47034496",
"0.47034496",
"0.4699272",
"0... | 0.7231419 | 7 |
Assert a compiler is available. | function assertCompiler(name, Compiler) {
if (typeof Compiler !== 'function') {
throw new Error('Cannot `' + name + '` without `Compiler`')
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function assertCompiler(name, Compiler) {\n if (!func(Compiler)) {\n throw new Error('Cannot `' + name + '` without `Compiler`');\n }\n}",
"function startMyCompiler() {\n throw new Error('You have no compiler!');\n}",
"function _isSupported() {\n _state = 1;\n if (typeof chai !== \"undefi... | [
"0.7280039",
"0.6609343",
"0.5701623",
"0.55071414",
"0.5359753",
"0.5310645",
"0.5287135",
"0.5255695",
"0.5185235",
"0.51780653",
"0.51780653",
"0.510953",
"0.50870246",
"0.5071456",
"0.5061714",
"0.50458944",
"0.50141674",
"0.49524596",
"0.49390462",
"0.4907709",
"0.490542... | 0.7297869 | 7 |
Assert the processor is not frozen. | function assertUnfrozen(name, frozen) {
if (frozen) {
throw new Error(
[
'Cannot invoke `' + name + '` on a frozen processor.\nCreate a new ',
'processor first, by invoking it: use `processor()` instead of ',
'`processor`.'
].join('')
)
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function assertUnfrozen(name, frozen) {\n if (frozen) {\n throw new Error(\n 'Cannot invoke `' + name + '` on a frozen processor.\\n' +\n 'Create a new processor first, by invoking it: ' +\n 'use `processor()` instead of `processor`.'\n );\n }\n}",
"function assertUnfrozen(name, frozen) {\... | [
"0.76341915",
"0.7626436",
"0.7626436",
"0.7626436",
"0.7626436",
"0.62275994",
"0.6100189",
"0.59010684",
"0.5881789",
"0.57037205",
"0.57037205",
"0.57037205",
"0.57037205",
"0.57037205",
"0.57037205",
"0.5658851",
"0.5658851",
"0.5658851",
"0.5658851",
"0.5658851",
"0.5650... | 0.752398 | 9 |
Assert `node` is a Unist node. | function assertNode(node) {
if (!node || !string(node.type)) {
throw new Error('Expected node, got `' + node + '`')
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function assertNode(node) {\n if (!node || !string(node.type)) {\n throw new Error('Expected node, got `' + node + '`');\n }\n}",
"function assertNode(node) {\n if (!node || typeof node.type !== 'string') {\n throw new Error('Expected node, got `' + node + '`')\n }\n}",
"function assertNode(node) {\n... | [
"0.62222254",
"0.613726",
"0.613726",
"0.613726",
"0.613726",
"0.5832463",
"0.5832463",
"0.5619087",
"0.5619087",
"0.55799454",
"0.55799454",
"0.55799454",
"0.52485055",
"0.52275956",
"0.5198362",
"0.50964975",
"0.50964975",
"0.50964975",
"0.50964975",
"0.5045456",
"0.5045456... | 0.62290317 | 4 |
Assert that `complete` is `true`. | function assertDone(name, asyncName, complete) {
if (!complete) {
throw new Error(
'`' + name + '` finished async. Use `' + asyncName + '` instead'
)
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function assertDone(name, asyncName, complete) {\n if (!complete) {\n throw new Error('`' + name + '` finished async. Use `' + asyncName + '` instead');\n }\n}",
"isComplete() {\n return (this.title === this.titleComplete) &&\n (this.labo === this.laboComplete) &&\n (this.univ =... | [
"0.6449665",
"0.6286795",
"0.6109294",
"0.60894686",
"0.6087285",
"0.6086767",
"0.6079512",
"0.6040161",
"0.60169524",
"0.59774095",
"0.5938076",
"0.5891999",
"0.5833795",
"0.5753793",
"0.571018",
"0.5595507",
"0.55888605",
"0.5581676",
"0.5558898",
"0.5555131",
"0.55459714",... | 0.64526296 | 7 |
Create a message with `reason` at `position`. When an error is passed in as `reason`, copies the stack. | function message(reason, position, origin) {
var filePath = this.path;
var message = new VMessage(reason, position, origin);
if (filePath) {
message.name = filePath + ':' + message.name;
message.file = filePath;
}
message.fatal = false;
this.messages.push(message);
return message;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function message(reason, position, ruleId) {\n var filePath = this.path;\n var range = stringify(position) || '1:1';\n var location;\n var err;\n\n location = {\n start: {line: null, column: null},\n end: {line: null, column: null}\n };\n\n if (position && position.position) {\n position = position... | [
"0.6382411",
"0.58289903",
"0.5818149",
"0.5818149",
"0.5818149",
"0.5815182",
"0.57655555",
"0.56853163",
"0.568013",
"0.5445974",
"0.5391876",
"0.52233994",
"0.52169865",
"0.50570893",
"0.5056932",
"0.5056932",
"0.5033515",
"0.50259006",
"0.50055903",
"0.48889014",
"0.48580... | 0.56972057 | 11 |
Fail. Creates a vmessage, associates it with the file, and throws it. | function fail() {
var message = this.message.apply(this, arguments);
message.fatal = true;
throw message;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function fail(message) {\n throw new Error(message);\n }",
"function fail(message) {\r\n\t throw new Error(message);\r\n\t}",
"createFailureAtNode(node, message) {\n const sourceFile = node.getSourceFile();\n this.failures.push({\n filePath: this.fileSyst... | [
"0.6267297",
"0.6253337",
"0.6133076",
"0.6082893",
"0.59879756",
"0.59879756",
"0.5881531",
"0.5881531",
"0.5881531",
"0.5881531",
"0.5851264",
"0.5730261",
"0.571033",
"0.55709696",
"0.5532442",
"0.5510065",
"0.5510065",
"0.5510065",
"0.5510065",
"0.5510065",
"0.5498461",
... | 0.5795629 | 15 |
Info. Creates a vmessage, associates it with the file, and marks the fatality as null. | function info() {
var message = this.message.apply(this, arguments);
message.fatal = null;
return message;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function info() {\n var message = this.message.apply(this, arguments)\n\n message.fatal = null\n\n return message\n}",
"function info() {\n var message = this.message.apply(this, arguments)\n\n message.fatal = null\n\n return message\n}",
"function info() {\n var message = this.message.apply(this, argum... | [
"0.6556722",
"0.6556722",
"0.6556722",
"0.6556722",
"0.6526714",
"0.62738734",
"0.61954087",
"0.61925805",
"0.61925805",
"0.61925805",
"0.61925805",
"0.61925805",
"0.6155595",
"0.6155595",
"0.6155595",
"0.61103654",
"0.5857036",
"0.5676465",
"0.55974704",
"0.54965174",
"0.546... | 0.64661753 | 9 |
Construct a new file. | function VFile(options) {
var prop;
var index;
var length;
if (!options) {
options = {};
} else if (typeof options === 'string' || buffer(options)) {
options = {contents: options};
} else if ('message' in options && 'messages' in options) {
return options;
}
if (!(this instanceof VFile)) {... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function createFile() {\n var e = new emitter();\n\n fs.readFile('newdocument.txt', function (err) {\n if (err) throw err;\n e.emit('theProcess');\n });\n\n return e;\n}",
"function createNewFile() {\n file = {\n name: 'novo-arquivo.txt',\n content: '',\n saved: ... | [
"0.6731722",
"0.6548481",
"0.6368479",
"0.6176685",
"0.6128395",
"0.6071327",
"0.6071191",
"0.60540265",
"0.6018432",
"0.60004294",
"0.59618294",
"0.5958048",
"0.59438944",
"0.58876985",
"0.58862257",
"0.58563334",
"0.5832691",
"0.5804447",
"0.5785801",
"0.5777083",
"0.575371... | 0.0 | -1 |
Get the value of the file. | function toString(encoding) {
var value = this.contents || '';
return buffer(value) ? value.toString(encoding) : String(value);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getFile(){\n\n\t\treturn this.file;\n\t}",
"Get(filename)\n {\n return \"\";\n }",
"getText() {\r\n return this.clone(File, \"$value\", false).get(new TextParser(), { headers: { \"binaryStringResponseBody\": \"true\" } });\r\n }",
"get file () {\n return this._file\n }",
"functi... | [
"0.711178",
"0.68999565",
"0.6691765",
"0.66412055",
"0.6439003",
"0.64349145",
"0.6405714",
"0.637939",
"0.6368529",
"0.6368529",
"0.6324943",
"0.6303016",
"0.6242697",
"0.60756075",
"0.59203756",
"0.58928937",
"0.58921486",
"0.5867203",
"0.5867203",
"0.5792994",
"0.5783152"... | 0.0 | -1 |
Assert that `part` is not a path (i.e., does not contain `path.sep`). | function assertPart(part, name) {
if (part.indexOf(path.sep) !== -1) {
throw new Error('`' + name + '` cannot be a path: did not expect `' + path.sep + '`');
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function assertPart(part, name) {\n if (part.indexOf(path.sep) !== -1) {\n throw new Error(\n '`' + name + '` cannot be a path: did not expect `' + path.sep + '`'\n )\n }\n}",
"function assertPart(part, name) {\n if (part.indexOf(path.sep) !== -1) {\n throw new Error(\n '`' + name + '` cann... | [
"0.8634604",
"0.8608681",
"0.85808456",
"0.85808456",
"0.85808456",
"0.83588463",
"0.6666319",
"0.6666319",
"0.6666319",
"0.6666319",
"0.66645527",
"0.66645527",
"0.66645527",
"0.66645527",
"0.66645527",
"0.66645527",
"0.66645527",
"0.66143674",
"0.5684836",
"0.5683896",
"0.5... | 0.86381245 | 5 |
Assert that `part` is not empty. | function assertNonEmpty(part, name) {
if (!part) {
throw new Error('`' + name + '` cannot be empty');
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function assertNonEmpty(part, name) {\n if (!part) {\n throw new Error('`' + name + '` cannot be empty')\n }\n}",
"function assertNonEmpty(part, name) {\n if (!part) {\n throw new Error('`' + name + '` cannot be empty')\n }\n}",
"function assertNonEmpty(part, name) {\n if (!part) {\n throw new Er... | [
"0.8208551",
"0.8208551",
"0.8208551",
"0.8208551",
"0.8099163",
"0.6485353",
"0.6485353",
"0.6485353",
"0.6485353",
"0.6485353",
"0.6485353",
"0.6470561",
"0.64697224",
"0.64425254",
"0.64349556",
"0.64349556",
"0.64349556",
"0.6220875",
"0.60911965",
"0.57816833",
"0.577190... | 0.8207471 | 10 |
For Node v0.10 support. Remove this eventually. | function isSlowBuffer (obj) {
return typeof obj.readFloatLE === 'function' && typeof obj.slice === 'function' && isBuffer(obj.slice(0, 0))
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function _node_p(){\n\tvar ret = false;\n\tif( anchor.environment() == 'Node.js' ){ ret = true; }\n\treturn ret;\n }",
"function node_error(err) {\r\n node.error(err, err);\r\n }",
"private public function m246() {}",
"function NodeFsHandler() {}",
"function NodeFsHandler() {}",
"static reset(... | [
"0.58632374",
"0.5703871",
"0.56875104",
"0.55532336",
"0.55532336",
"0.5445521",
"0.54364026",
"0.53833115",
"0.5353622",
"0.53282815",
"0.5315332",
"0.5206867",
"0.5199046",
"0.5156871",
"0.51495963",
"0.512485",
"0.512485",
"0.512485",
"0.5111965",
"0.50998896",
"0.509248"... | 0.0 | -1 |
Run `fns`. Last argument must be a completion handler. | function run() {
var index = -1
var input = slice.call(arguments, 0, -1)
var done = arguments[arguments.length - 1]
if (typeof done !== 'function') {
throw new Error('Expected function as last argument, not ' + done)
}
next.apply(null, [null].concat(input))
// Run the next `fn`, if ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function runAll(whenFn, fns, resolveIdx) {\n //var deferred = when.defer();\n return whenFn(fns)\n .then(\n function(results) {\n return results[resolveIdx];\n },\n function(err) {\n return when.reject(err);\n }\n );\n}",
"function run() {\n var index = -1;\n var inp... | [
"0.68478644",
"0.66488874",
"0.65281355",
"0.65281355",
"0.6376086",
"0.617489",
"0.59881306",
"0.5942612",
"0.5926571",
"0.58897847",
"0.5781694",
"0.57793677",
"0.56860965",
"0.56757015",
"0.5613648",
"0.5584616",
"0.5568763",
"0.5517414",
"0.5515395",
"0.5452807",
"0.54372... | 0.65061486 | 9 |
Run the next `fn`, if any. | function next(err) {
var fn = fns[++index]
var params = slice.call(arguments, 0)
var values = params.slice(1)
var length = input.length
var pos = -1
if (err) {
done(err)
return
}
// Copy non-nully input into values.
while (++pos < length) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function run(fn) {\n if (fn)\n fn(next);\n else\n callback(null, results);\n }",
"function next(err, result) {\n if (err)\n return callback(err, results);\n results.push(result);\n if (fns.length)\n run(fns.shift());\n else\n callback(null, results);\n }",
"function... | [
"0.7895341",
"0.7258331",
"0.6687143",
"0.6568592",
"0.6472725",
"0.6472725",
"0.6464374",
"0.6464374",
"0.6464374",
"0.6464374",
"0.6464374",
"0.6464374",
"0.6400427",
"0.63742316",
"0.6338885",
"0.62767184",
"0.6203823",
"0.61728907",
"0.61713886",
"0.61713886",
"0.610243",... | 0.6133581 | 25 |
Add `fn` to the list. | function use(fn) {
if (typeof fn !== 'function') {
throw new Error('Expected `fn` to be a function, not ' + fn)
}
fns.push(fn)
return middleware
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function addWithFunction(list, item, hashFunction) {\n if (findWithFunction(list, hashFunction) === -1) {\n list.push(item);\n }\n }",
"custom(fn) {\r\n\t\treturn this.push('fn', [...arguments]);\r\n\t}",
"function addToQueue(fn) {\n if (working) {\n queue.push(fn);\n }... | [
"0.69391334",
"0.6699876",
"0.62224996",
"0.6204581",
"0.6065605",
"0.60541385",
"0.597551",
"0.5913218",
"0.5810012",
"0.5810012",
"0.5810012",
"0.5810012",
"0.5810012",
"0.5810012",
"0.5810012",
"0.57788336",
"0.5764707",
"0.5738819",
"0.5720906",
"0.57197505",
"0.56740576"... | 0.57356536 | 24 |
Wrap `fn`. Can be sync or async; return a promise, receive a completion handler, return new values and errors. | function wrap(fn, callback) {
var invoked
return wrapped
function wrapped() {
var params = slice.call(arguments, 0)
var callback = fn.length > params.length
var result
if (callback) {
params.push(done)
}
try {
result = fn.apply(null, params)
} catch (error) {
// W... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function wrap_sync (fn) {\n return function (params) {\n var val = fn(params)\n if (val && !isPromise(val)) throw val\n return val\n }\n}",
"async function thenify(fn) {\n return await new Promise(function(resolve, reject) {\n function callback(err, res) {\n if (err) return reject(err);\n ... | [
"0.75725514",
"0.69479746",
"0.6858928",
"0.6830772",
"0.6648563",
"0.6574583",
"0.65611124",
"0.6463919",
"0.6463919",
"0.6435289",
"0.63665336",
"0.6268416",
"0.6259378",
"0.62556964",
"0.62556964",
"0.62530184",
"0.6249934",
"0.6212102",
"0.6200447",
"0.6200375",
"0.618733... | 0.6304468 | 16 |
Invoke `next`, only once. | function done() {
if (!invoked) {
invoked = true
callback.apply(null, arguments)
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"next () {}",
"next() {}",
"next() {\n this._next();\n }",
"Next() {}",
"function next() {\n subject = context.stack.tail.head;\n index = 0;\n test( subject );\n }",
"async next() {\n this._executing = false;\n await this._execute();\n }",
"function _next() {\n... | [
"0.78337926",
"0.7766705",
"0.742107",
"0.7365195",
"0.6899227",
"0.6799684",
"0.6630355",
"0.6603183",
"0.65826726",
"0.6529928",
"0.6470122",
"0.6434803",
"0.6434803",
"0.6420854",
"0.6374825",
"0.6374825",
"0.6349096",
"0.63221407",
"0.631236",
"0.63065857",
"0.63003343",
... | 0.0 | -1 |
Invoke `done` with one value. Tracks if an error is passed, too. | function then(value) {
done(null, value)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function then(value) {\n done(null, value);\n }",
"function finish (err) {\n if (!calledDone) {\n calledDone = true;\n done(err);\n }\n }",
"function done() {}",
"function done ( error ) {\n if (error) {\n that.error = error\n }\n if ( cb ) cb( error )\n }",
"done() {}",... | [
"0.6572137",
"0.64892197",
"0.64739716",
"0.64194715",
"0.6381711",
"0.6374475",
"0.63663185",
"0.63663185",
"0.63663185",
"0.63663185",
"0.63663185",
"0.63663185",
"0.63663185",
"0.63663185",
"0.62876344",
"0.62755406",
"0.6242043",
"0.6175674",
"0.61732936",
"0.6048527",
"0... | 0.66370517 | 8 |
Create a custom constructor which can be modified without affecting the original class. | function unherit(Super) {
var result
var key
var value
inherits(Of, Super)
inherits(From, Of)
// Clone values.
result = Of.prototype
for (key in result) {
value = result[key]
if (value && typeof value === 'object') {
result[key] = 'concat' in value ? value.concat() : xtend(value)
}... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function temporaryConstructor() {}",
"function Constructor() {}",
"function Constructor() {}",
"function Constructor() {}",
"constructor() {\n copy(this, create());\n }",
"new() {\n let newInstance = Object.create(this);\n\n newInstance.init(...arguments);\n\n return newInstance;\n }"... | [
"0.7260429",
"0.7071604",
"0.7071604",
"0.7071604",
"0.7062483",
"0.7026925",
"0.6914832",
"0.68617076",
"0.67593026",
"0.67593026",
"0.6710411",
"0.6710411",
"0.6710411",
"0.6710411",
"0.6710411",
"0.6710411",
"0.6666424",
"0.663215",
"0.6617585",
"0.6609436",
"0.65504104",
... | 0.0 | -1 |
Constructor accepting a single argument, which itself is an `arguments` object. | function From(parameters) {
return Super.apply(this, parameters)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function C(arg) {\n this.args = arguments;\n}",
"constructor(args) {\n super(args);\n }",
"constructor(args) {\n super(args);\n }",
"constructor(args) {\n super();\n args = args || {}\n this.CONSTRUCTOR_ID = 0x99c1d49d;\n this.SUBCLASS_OF_ID = 0xeb9987b3;\n\n this.... | [
"0.6959179",
"0.643698",
"0.643698",
"0.6311878",
"0.62868017",
"0.62729627",
"0.6272085",
"0.6236955",
"0.6227004",
"0.6225904",
"0.62001526",
"0.6163254",
"0.6159827",
"0.61476386",
"0.6146458",
"0.6134848",
"0.6127441",
"0.61070144",
"0.6099203",
"0.6095188",
"0.6079402",
... | 0.0 | -1 |
Constructor accepting variadic arguments. | function Of() {
if (!(this instanceof Of)) {
return new From(arguments)
}
return Super.apply(this, arguments)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static create(...args /* :Array<*> */) {\n\t\treturn new this(...args)\n\t}",
"construct (target, args) {\n return new target(...args)\n }",
"constructor(args) {\n super();\n args = args || {}\n this.CONSTRUCTOR_ID = 0x09333afb;\n this.SUBCLASS_OF_ID = 0xf1163490;\n\n thi... | [
"0.7136816",
"0.6953033",
"0.692598",
"0.69021624",
"0.69021624",
"0.6878798",
"0.6776414",
"0.67102474",
"0.6695473",
"0.66910213",
"0.6659877",
"0.66535336",
"0.6645595",
"0.6640925",
"0.6639501",
"0.6638436",
"0.66289335",
"0.66243696",
"0.66028565",
"0.6594345",
"0.658970... | 0.0 | -1 |
Get all keys in `value`. | function keys(value) {
var result = [];
var key;
for (key in value) {
result.push(key);
}
return result;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function keys(value) {\n var result = []\n var key\n\n for (key in value) {\n result.push(key)\n }\n\n return result\n}",
"function keys(value) {\n var key\n for (key in value) {\n return true\n }\n return false\n}",
"function keys(value) {\n var key\n for (key in value) {\n return true\n ... | [
"0.836424",
"0.6576043",
"0.6576043",
"0.6576043",
"0.6576043",
"0.6576043",
"0.6545341",
"0.65157515",
"0.65157515",
"0.65157515",
"0.64387435",
"0.6329179",
"0.62270236",
"0.61529833",
"0.6023055",
"0.59515864",
"0.57830095",
"0.57830095",
"0.5691123",
"0.56526494",
"0.5624... | 0.8278659 | 7 |
Construct a state `toggler`: a function which inverses `property` in context based on its current value. The by `toggler` returned function restores that value. | function factory(key, state, ctx) {
return enter
function enter() {
var context = ctx || this
var current = context[key]
context[key] = !state
return exit
function exit() {
context[key] = current
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function toggleable_factory(prop = 'value', event = 'input') {\n return external_commonjs_vue_commonjs2_vue_root_Vue_default.a.extend({\n name: 'toggleable',\n model: {\n prop,\n event\n },\n props: {\n [prop]: {\n required: false\n }\n },\n\n data() {\n return {\... | [
"0.562566",
"0.562566",
"0.562566",
"0.561733",
"0.5212816",
"0.5125243",
"0.5085007",
"0.5065974",
"0.50450844",
"0.50281835",
"0.4977002",
"0.49746278",
"0.49360406",
"0.4935533",
"0.4931587",
"0.49147934",
"0.49135178",
"0.48936903",
"0.48864853",
"0.48856494",
"0.48709154... | 0.0 | -1 |
Factory to get the line and columnbased `position` for `offset` in the bound indices. | function offsetToPositionFactory(indices) {
return offsetToPosition
// Get the line and column-based `position` for `offset` in the bound indices.
function offsetToPosition(offset) {
var index = -1
var length = indices.length
if (offset < 0) {
return {}
}
while (++index < length) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function positionToOffsetFactory(indices) {\n return positionToOffset\n\n // Get the `offset` for a line and column-based `position` in the bound\n // indices.\n function positionToOffset(position) {\n var line = position && position.line\n var column = position && position.column\n\n if (!isNaN(line)... | [
"0.7075349",
"0.7075349",
"0.7075349",
"0.69795245",
"0.69795245",
"0.6974238",
"0.6974238",
"0.68666387",
"0.68666387",
"0.68666387",
"0.68666387",
"0.68666387",
"0.6756182",
"0.6611567",
"0.6542188",
"0.64920235",
"0.64521325",
"0.64521325",
"0.64428896",
"0.6439124",
"0.63... | 0.7002797 | 5 |
Get the line and columnbased `position` for `offset` in the bound indices. | function offsetToPosition(offset) {
var index = -1
var length = indices.length
if (offset < 0) {
return {}
}
while (++index < length) {
if (indices[index] > offset) {
return {
line: index + 1,
column: offset - (indices[index - 1] || 0) + 1,
offset:... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"getLineAndColumnFromChunk(offset) {\r\n\t\t\t\tvar column, columnCompensation, compensation, lastLine, lineCount, previousLinesCompensation, ref, string;\r\n\t\t\t\tcompensation = this.getLocationDataCompensation(this.chunkOffset, this.chunkOffset + offset);\r\n\t\t\t\tif (offset === 0) {\r\n\t\t\t\t\treturn [this... | [
"0.66774505",
"0.66699433",
"0.6659134",
"0.6659134",
"0.6652503",
"0.6436059",
"0.6436059",
"0.6436059",
"0.64176875",
"0.63346153",
"0.63327104",
"0.63327104",
"0.62733066",
"0.62733066",
"0.62733066",
"0.62727237",
"0.6262357",
"0.6262357",
"0.6245017",
"0.6240079",
"0.624... | 0.70611274 | 4 |
Factory to get the `offset` for a line and columnbased `position` in the bound indices. | function positionToOffsetFactory(indices) {
return positionToOffset
// Get the `offset` for a line and column-based `position` in the bound
// indices.
function positionToOffset(position) {
var line = position && position.line
var column = position && position.column
if (!isNaN(line) && !isNaN(col... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function positionToOffsetFactory(indices) {\n return positionToOffset\n\n /* Get the `offset` for a line and column-based\n * `position` in the bound indices. */\n function positionToOffset(position) {\n var line = position && position.line\n var column = position && position.column\n\n if (!isNaN(li... | [
"0.7169871",
"0.7169871",
"0.6971489",
"0.6589328",
"0.6589328",
"0.6589328",
"0.6576411",
"0.6576411",
"0.6491785",
"0.63492906",
"0.63492906",
"0.63492906",
"0.63492906",
"0.63492906",
"0.6348974",
"0.6269752",
"0.6182241",
"0.6182241",
"0.6182241",
"0.6182241",
"0.6182241"... | 0.727257 | 2 |
Get the `offset` for a line and columnbased `position` in the bound indices. | function positionToOffset(position) {
var line = position && position.line
var column = position && position.column
if (!isNaN(line) && !isNaN(column) && line - 1 in indices) {
return (indices[line - 2] || 0) + column - 1 || 0
}
return -1
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function positionToOffsetFactory(indices) {\n return positionToOffset\n\n // Get the `offset` for a line and column-based `position` in the bound\n // indices.\n function positionToOffset(position) {\n var line = position && position.line\n var column = position && position.column\n\n if (!isNaN(line)... | [
"0.6476816",
"0.6476816",
"0.6476816",
"0.6438751",
"0.6400837",
"0.6370719",
"0.6370719",
"0.63069415",
"0.61469966",
"0.60152006",
"0.59834266",
"0.59607756",
"0.59607756",
"0.59607756",
"0.59607756",
"0.59607756",
"0.59607756",
"0.59607756",
"0.59607756",
"0.59309113",
"0.... | 0.6808515 | 4 |
Get indices of linebreaks in `value`. | function indices(value) {
var result = []
var index = value.indexOf('\n')
while (index !== -1) {
result.push(index + 1)
index = value.indexOf('\n', index + 1)
}
result.push(value.length + 1)
return result
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function lineCount(value) {\n var count = 0;\n for (var _i = 0, value_1 = value; _i < value_1.length; _i++) {\n var char = value_1[_i];\n if (char === '\\n') {\n count++;\n }\n }\n return count;\n}",
"function computeLineStartsMap(text) {\n const result = [0];\n... | [
"0.65919644",
"0.57013166",
"0.5432263",
"0.5342233",
"0.519581",
"0.51696146",
"0.507851",
"0.5013093",
"0.49860644",
"0.4964226",
"0.4946536",
"0.49298257",
"0.49226657",
"0.48780623",
"0.48680732",
"0.48583052",
"0.48488826",
"0.48488826",
"0.4837607",
"0.48324108",
"0.483... | 0.80642945 | 5 |
Factory to deescape a value, based on a list at `key` in `ctx`. | function factory(ctx, key) {
return unescape;
/* De-escape a string using the expression at `key`
* in `ctx`. */
function unescape(value) {
var prev = 0;
var index = value.indexOf('\\');
var escape = ctx[key];
var queue = [];
var character;
while (index !== -1) {
queue.push(valu... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function factory(ctx, key) {\n return unescape\n\n // De-escape a string using the expression at `key` in `ctx`.\n function unescape(value) {\n var previous = 0\n var index = value.indexOf(backslash)\n var escape = ctx[key]\n var queue = []\n var character\n\n while (index !== -1) {\n que... | [
"0.7249111",
"0.536108",
"0.536108",
"0.536108",
"0.536108",
"0.536108",
"0.536108",
"0.5164798",
"0.50071645",
"0.4984438",
"0.4866233",
"0.47796676",
"0.4667144",
"0.46512026",
"0.46505952",
"0.46465138",
"0.46465138",
"0.46465138",
"0.46465138",
"0.46465138",
"0.46465138",... | 0.7325405 | 5 |
Deescape a string using the expression at `key` in `ctx`. | function unescape(value) {
var prev = 0;
var index = value.indexOf('\\');
var escape = ctx[key];
var queue = [];
var character;
while (index !== -1) {
queue.push(value.slice(prev, index));
prev = index + 1;
character = value.charAt(prev);
/* If the following character i... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function factory(ctx, key) {\n return unescape\n\n // De-escape a string using the expression at `key` in `ctx`.\n function unescape(value) {\n var previous = 0\n var index = value.indexOf(backslash)\n var escape = ctx[key]\n var queue = []\n var character\n\n while (index !== -1) {\n que... | [
"0.7559954",
"0.75268114",
"0.75268114",
"0.75268114",
"0.75268114",
"0.75268114",
"0.75268114",
"0.5831793",
"0.55863667",
"0.5573183",
"0.55350876",
"0.5105924",
"0.50917345",
"0.508984",
"0.50827724",
"0.50827724",
"0.50827724",
"0.50827724",
"0.50827724",
"0.50648695",
"0... | 0.5975752 | 11 |
Factory to create an entity decoder. | function factory(ctx) {
decoder.raw = decodeRaw;
return decoder;
/* Normalize `position` to add an `indent`. */
function normalize(position) {
var offsets = ctx.offset;
var line = position.line;
var result = [];
while (++line) {
if (!(line in offsets)) {
break;
}
re... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function factory(ctx) {\n decoder.raw = decodeRaw\n\n return decoder\n\n // Normalize `position` to add an `indent`.\n function normalize(position) {\n var offsets = ctx.offset\n var line = position.line\n var result = []\n\n while (++line) {\n if (!(line in offsets)) {\n break\n }... | [
"0.7219088",
"0.71356076",
"0.71356076",
"0.57152736",
"0.5621252",
"0.5413163",
"0.5362083",
"0.5326339",
"0.52831817",
"0.5236325",
"0.5236325",
"0.5236282",
"0.52257466",
"0.52257466",
"0.52257466",
"0.52257466",
"0.52257466",
"0.52257466",
"0.51879174",
"0.5145243",
"0.50... | 0.7159043 | 4 |
Normalize `position` to add an `indent`. | function normalize(position) {
var offsets = ctx.offset;
var line = position.line;
var result = [];
while (++line) {
if (!(line in offsets)) {
break;
}
result.push((offsets[line] || 0) + 1);
}
return {
start: position,
indent: result
};
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function normalize(position) {\n var offsets = ctx.offset\n var line = position.line\n var result = []\n\n while (++line) {\n if (!(line in offsets)) {\n break\n }\n\n result.push((offsets[line] || 0) + 1)\n }\n\n return {start: position, indent: result}\n }",
"function p... | [
"0.757144",
"0.63089496",
"0.6255081",
"0.6255081",
"0.6255081",
"0.6255081",
"0.6255081",
"0.57605976",
"0.5702812",
"0.5702812",
"0.5702812",
"0.5702812",
"0.5702812",
"0.56591326",
"0.56393504",
"0.55557984",
"0.54419565",
"0.5432311",
"0.5430044",
"0.53908414",
"0.5390841... | 0.75367886 | 6 |
Handle a warning. See for the warnings. | function handleWarning(reason, position, code) {
if (code === 3) {
return;
}
ctx.file.message(reason, position);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function onwarn(warning) {\n if (warning.code === 'THIS_IS_UNDEFINED') return;\n console.error(warning.message);\n}",
"function handleWarning(reason, position, code) {\n if (code !== 3) {\n ctx.file.message(reason, position)\n }\n }",
"issueWarning(args) {\n this.emit('warning', args);\n }",
... | [
"0.7490234",
"0.74281955",
"0.71471065",
"0.677067",
"0.677067",
"0.677067",
"0.677067",
"0.677067",
"0.66602415",
"0.6655821",
"0.6655821",
"0.6630893",
"0.6614084",
"0.6555695",
"0.65171844",
"0.6493037",
"0.6445884",
"0.64053947",
"0.64053947",
"0.64053947",
"0.64053947",
... | 0.752049 | 5 |
Decode `value` (at `position`) into textnodes. | function decoder(value, position, handler) {
entities(value, {
position: normalize(position),
warning: handleWarning,
text: handler,
reference: handler,
textContext: ctx,
referenceContext: ctx
});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function decoder(value, position, handler) {\n entities(value, {\n position: normalize(position),\n warning: handleWarning,\n text: handler,\n reference: handler,\n textContext: ctx,\n referenceContext: ctx\n })\n }",
"function decodeRaw(value, position, options) {\n retur... | [
"0.68267065",
"0.65928215",
"0.65928215",
"0.65928215",
"0.65928215",
"0.65701926",
"0.6540789",
"0.6540789",
"0.5573472",
"0.55310106",
"0.5367598",
"0.5367598",
"0.5343417",
"0.5194319",
"0.5164298",
"0.5152497",
"0.5152097",
"0.5152097",
"0.5152097",
"0.5152097",
"0.514959... | 0.6817116 | 6 |
Decode `value` (at `position`) into a string. | function decodeRaw(value, position, options) {
return entities(value, xtend(options, {
position: normalize(position),
warning: handleWarning
}));
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function decodeRaw(value, position) {\n return entities(value, {\n position: normalize(position),\n warning: handleWarning\n });\n }",
"function decodeRaw(value, position) {\n return entities(value, {\n position: normalize(position),\n warning: handleWarning\n });\n }",
"funct... | [
"0.69702625",
"0.69702625",
"0.6775656",
"0.6490716",
"0.6472848",
"0.6472848",
"0.6472848",
"0.6472848",
"0.6472848",
"0.6472848",
"0.6250978",
"0.6250978",
"0.6115299",
"0.6041289",
"0.5988353",
"0.5988353",
"0.5988353",
"0.5988353",
"0.59686035",
"0.59686035",
"0.59686035"... | 0.69098884 | 5 |
Check if the given character code, or the character code at the first character, is hexadecimal. | function hexadecimal(character) {
var code = typeof character === 'string' ? character.charCodeAt(0) : character
return (
(code >= 97 /* a */ && code <= 102) /* z */ ||
(code >= 65 /* A */ && code <= 70) /* Z */ ||
(code >= 48 /* A */ && code <= 57) /* Z */
)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isHexDigit(code) {\n return (\n isDigit(code) || // 0 .. 9\n (code >= 0x0041 && code <= 0x0046) || // A .. F\n (code >= 0x0061 && code <= 0x0066) // a .. f\n );\n}",
"function hexadecimal(character) {\n var code = typeof character === 'string' ? character.charCodeAt(0) : c... | [
"0.7581072",
"0.7504311",
"0.7498717",
"0.7426317",
"0.72044915",
"0.71264887",
"0.7067999",
"0.70529914",
"0.7017491",
"0.70108026",
"0.7009791",
"0.70016026",
"0.6995307",
"0.6942766",
"0.6934762",
"0.69318706",
"0.69261026",
"0.6873151",
"0.6783633",
"0.6783633",
"0.678363... | 0.7384884 | 9 |
Check if the given character code, or the character code at the first character, is alphanumerical. | function alphanumerical(character) {
return alphabetical(character) || decimal(character)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function is_alphanum(str) {\n let curr_char\n for (let i = 0; i < str.length; i ++) {\n curr_char = str.charCodeAt(i)\n if (!(curr_char == 95 || curr_char == 46) &&\n !(curr_char > 47 && curr_char < 58) &&\n !(curr_char > 64 && curr_char < 91) &&\n !(curr_char > 96 && curr_char < 123))... | [
"0.802424",
"0.7736312",
"0.7566067",
"0.75558513",
"0.75211525",
"0.7503225",
"0.749414",
"0.7483334",
"0.744038",
"0.74399394",
"0.74377126",
"0.7417362",
"0.74167305",
"0.73692375",
"0.73620534",
"0.73524463",
"0.734858",
"0.73418355",
"0.73360133",
"0.7333281",
"0.7321902... | 0.6999468 | 77 |
Check whether a node is mergeable with adjacent nodes. | function mergeable(node) {
var start;
var end;
if (node.type !== 'text' || !node.position) {
return true;
}
start = node.position.start;
end = node.position.end;
/* Only merge nodes which occupy the same size as their
* `value`. */
return start.line !== end.line ||
end.column - start.col... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function mergeable(node) {\n var start\n var end\n\n if (node.type !== 'text' || !node.position) {\n return true\n }\n\n start = node.position.start\n end = node.position.end\n\n // Only merge nodes which occupy the same size as their `value`.\n return (\n start.line !== end.line || end.column - star... | [
"0.71366274",
"0.6259624",
"0.6230327",
"0.62284565",
"0.61179906",
"0.60289866",
"0.5804878",
"0.57994366",
"0.57488364",
"0.5739582",
"0.56976324",
"0.56976324",
"0.56863534",
"0.56215096",
"0.56138355",
"0.55904573",
"0.55699676",
"0.55699676",
"0.5559757",
"0.5553477",
"0... | 0.7074309 | 6 |
Merge two text nodes: `node` into `prev`. | function mergeText(prev, node) {
prev.value += node.value;
return prev;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function mergeText(previous, node) {\n previous.value += node.value\n\n return previous\n}",
"function mergeBlockquote(prev, node) {\n if (this.options.commonmark) {\n return node;\n }\n\n prev.children = prev.children.concat(node.children);\n\n return prev;\n}",
"function mergeBlockquote(prev, node) ... | [
"0.7849193",
"0.6281823",
"0.6281823",
"0.6281823",
"0.6281823",
"0.6281823",
"0.6281823",
"0.62302065",
"0.616374",
"0.60946196",
"0.60043705",
"0.59923655",
"0.5973659",
"0.5908109",
"0.589838",
"0.56804395",
"0.56523275",
"0.5615626",
"0.5565107",
"0.5562803",
"0.55494356"... | 0.8098557 | 5 |
Merge two blockquotes: `node` into `prev`, unless in CommonMark mode. | function mergeBlockquote(prev, node) {
if (this.options.commonmark) {
return node;
}
prev.children = prev.children.concat(node.children);
return prev;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function mergeBlockquote(previous, node) {\n if (this.options.commonmark || this.options.gfm) {\n return node\n }\n\n previous.children = previous.children.concat(node.children)\n\n return previous\n}",
"function mergeText(prev, node) {\n prev.value += node.value;\n\n return prev;\n}",
"function merge... | [
"0.8367977",
"0.61360675",
"0.61360675",
"0.61360675",
"0.61360675",
"0.61360675",
"0.61360675",
"0.5930932",
"0.57893425",
"0.56482565",
"0.5554666",
"0.54335237",
"0.5431284",
"0.53100824",
"0.52976626",
"0.52637064",
"0.5200446",
"0.5166874",
"0.5166874",
"0.5166874",
"0.5... | 0.85240054 | 5 |
Construct a tokenizer. This creates both `tokenizeInline` and `tokenizeBlock`. | function factory(type) {
return tokenize;
/* Tokenizer for a bound `type`. */
function tokenize(value, location) {
var self = this;
var offset = self.offset;
var tokens = [];
var methods = self[type + 'Methods'];
var tokenizers = self[type + 'Tokenizers'];
var line = location.line;
va... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function tokenizer(input, options) {\n return Parser.tokenizer(input, options)\n }",
"function tokenizer(input, options) {\n return Parser.tokenizer(input, options)\n }",
"function tokenizer(input, options) {\n return Parser.tokenizer(input, options)\n }",
"function tokenizer(input, options) {\n ... | [
"0.6647831",
"0.6647831",
"0.6647831",
"0.6637244",
"0.6637244",
"0.6637244",
"0.65069973",
"0.65069973",
"0.65069973",
"0.65069973",
"0.65069973",
"0.65069973",
"0.65069973",
"0.63949126",
"0.62895286",
"0.61172473",
"0.608667",
"0.5903893",
"0.58503217",
"0.58113986",
"0.58... | 0.5797938 | 25 |
Tokenizer for a bound `type`. | function tokenize(value, location) {
var self = this;
var offset = self.offset;
var tokens = [];
var methods = self[type + 'Methods'];
var tokenizers = self[type + 'Tokenizers'];
var line = location.line;
var column = location.column;
var index;
var length;
var method;
var na... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function factory(type) {\n return tokenize;\n\n /* Tokenizer for a bound `type`. */\n function tokenize(value, location) {\n var self = this;\n var offset = self.offset;\n var tokens = [];\n var methods = self[type + 'Methods'];\n var tokenizers = self[type + 'Tokenizers'];\n var line = locati... | [
"0.64397955",
"0.64397955",
"0.64397955",
"0.64397955",
"0.64397955",
"0.63414675",
"0.6329742",
"0.6018946",
"0.5882375",
"0.57774585",
"0.57694155",
"0.57543147",
"0.5736293",
"0.5672879",
"0.5641096",
"0.56112975",
"0.5603829",
"0.5583456",
"0.5562897",
"0.55435354",
"0.55... | 0.0 | -1 |
Update line, column, and offset based on `value`. | function updatePosition(subvalue) {
var lastIndex = -1;
var index = subvalue.indexOf('\n');
while (index !== -1) {
line++;
lastIndex = index;
index = subvalue.indexOf('\n', index + 1);
}
if (lastIndex === -1) {
column += subvalue.length;
} else {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function updatePosition(subvalue) {\n var lastIndex = -1\n var index = subvalue.indexOf('\\n')\n\n while (index !== -1) {\n line++\n lastIndex = index\n index = subvalue.indexOf('\\n', index + 1)\n }\n\n if (lastIndex === -1) {\n column += subvalue.length\n ... | [
"0.7200468",
"0.6306508",
"0.6006134",
"0.5928402",
"0.58180755",
"0.5709779",
"0.57011133",
"0.56737566",
"0.56072223",
"0.5580895",
"0.55691946",
"0.55691946",
"0.55691946",
"0.55691946",
"0.55691946",
"0.55479944",
"0.55298024",
"0.5475479",
"0.54641885",
"0.5446471",
"0.5... | 0.7229146 | 3 |
Get offset. Called before the first character is eaten to retrieve the range's offsets. | function getOffset() {
var indentation = [];
var pos = line + 1;
/* Done. Called when the last character is
* eaten to retrieve the range’s offsets. */
return function () {
var last = line + 1;
while (pos < last) {
indentation.push((offset[pos] || 0) + 1);
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getStartOffSet() {\n var selObj = window.getSelection();\n var selRange = selObj.getRangeAt(0);\n return selRange['startOffset'];\n }",
"function getOffset() {\n\t\t\treturn offset;\n\t\t}",
"getOffset() {\r\n return this.builder.o... | [
"0.68109906",
"0.65578",
"0.63603795",
"0.6280547",
"0.6275719",
"0.62400013",
"0.6212487",
"0.607922",
"0.60775465",
"0.6075039",
"0.6062073",
"0.60516286",
"0.60412747",
"0.60324687",
"0.6024554",
"0.6019764",
"0.60101163",
"0.60079426",
"0.6006103",
"0.59962153",
"0.599526... | 0.7644563 | 3 |
Get the current position. | function now() {
var pos = {line: line, column: column};
pos.offset = self.toOffset(pos);
return pos;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getCurrentPosition() {\n return $._getCurrentPosition();\n}",
"function getPos() {\n\t\treturn _this.position;\n\t}",
"function getPosition() {\n return _character.getPosition();\n }",
"async getPosition() {\n return this._position;\n }",
"getPosition() {\n return this._las... | [
"0.8059421",
"0.7960642",
"0.788338",
"0.7707294",
"0.75241387",
"0.7512489",
"0.7508141",
"0.73519945",
"0.7219399",
"0.7159119",
"0.7157245",
"0.7149591",
"0.71272236",
"0.70371795",
"0.70171124",
"0.7005105",
"0.7005105",
"0.7004674",
"0.6965421",
"0.6886338",
"0.6807483",... | 0.668909 | 31 |
Store position information for a node. | function Position(start) {
this.start = start;
this.end = now();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"setNodePosition(Pos, node) {\n let currrentNode = this.nodes.find(n => n === node);\n currrentNode.x = Pos.x;\n currrentNode.y = Pos.y;\n }",
"savePosition() {\n this.savedX = this.x;\n this.savedY = this.y;\n }",
"function savePositions () {\n var updateTheseNodes = {... | [
"0.6429364",
"0.63434136",
"0.63226074",
"0.6272839",
"0.62623346",
"0.62435097",
"0.61585325",
"0.6147435",
"0.6058061",
"0.605646",
"0.59816897",
"0.5943724",
"0.5837633",
"0.581746",
"0.579113",
"0.57636505",
"0.57392776",
"0.5709215",
"0.5697817",
"0.5697627",
"0.5697627"... | 0.0 | -1 |
Mark position and patch `node.position`. | function position() {
var before = now();
return update;
/* Add the position to a node. */
function update(node, indent) {
var prev = node.position;
var start = prev ? prev.start : before;
var combined = [];
var n = prev && prev.end.line;
var l = before.... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function patch(node) {\n if (!node.position) {\n node.position = {}\n }\n}",
"setNodePosition(Pos, node) {\n let currrentNode = this.nodes.find(n => n === node);\n currrentNode.x = Pos.x;\n currrentNode.y = Pos.y;\n }",
"assignPosition(node, position) {\n // update the posit... | [
"0.7861916",
"0.6788894",
"0.6681636",
"0.6610156",
"0.6173554",
"0.6161047",
"0.6156374",
"0.6002291",
"0.5998681",
"0.59891766",
"0.59890425",
"0.59074354",
"0.5890844",
"0.58887213",
"0.5858468",
"0.58487445",
"0.58283585",
"0.5807958",
"0.578546",
"0.5776166",
"0.5738537"... | 0.612533 | 11 |
Add the position to a node. | function update(node, indent) {
var prev = node.position;
var start = prev ? prev.start : before;
var combined = [];
var n = prev && prev.end.line;
var l = before.line;
node.position = new Position(start);
/* If there was already a `position`, this
* no... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function add (node, parent) {\n parent.children.push(node)\n if (parser.position) {\n parent.position = {\n start: parent.children[0].position.start,\n end: node.position.end\n }\n }\n }",
"addPosition(pos) {\n this.positions += '=\"'+pos.line + ':' + pos.linePosition + '... | [
"0.65842587",
"0.6516607",
"0.6484519",
"0.6458811",
"0.63893163",
"0.62335664",
"0.6225618",
"0.61637735",
"0.61253077",
"0.60475916",
"0.60419756",
"0.5999882",
"0.59785116",
"0.5964825",
"0.5964825",
"0.5964825",
"0.5964825",
"0.5964825",
"0.59278154",
"0.59051055",
"0.590... | 0.0 | -1 |
Add `node` to `parent`s children or to `tokens`. Performs merges where possible. | function add(node, parent) {
var children = parent ? parent.children : tokens;
var prev = children[children.length - 1];
if (
prev &&
node.type === prev.type &&
node.type in MERGEABLE_NODES &&
mergeable(prev) &&
mergeable(node)
) {
node = MERGEABL... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function add(node, parent) {\n var children = parent ? parent.children : tokens\n var previous = children[children.length - 1]\n var fn\n\n if (\n previous &&\n node.type === previous.type &&\n (node.type === 'text' || node.type === 'blockquote') &&\n mergeable(previ... | [
"0.74623704",
"0.5998085",
"0.57359624",
"0.57040995",
"0.56888145",
"0.5535257",
"0.5535257",
"0.5535257",
"0.5535257",
"0.5535257",
"0.55218256",
"0.5493243",
"0.5486552",
"0.54409987",
"0.54202956",
"0.5411669",
"0.5390074",
"0.53790534",
"0.53790534",
"0.53790534",
"0.537... | 0.7812813 | 3 |
Remove `subvalue` from `value`. `subvalue` must be at the start of `value`. | function eat(subvalue) {
var indent = getOffset();
var pos = position();
var current = now();
validateEat(subvalue);
apply.reset = reset;
reset.test = test;
apply.test = test;
value = value.substring(subvalue.length);
updatePosition(subvalue);
indent = in... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function subInputValue(val, sub)\n{\n var dataArray = '';\n var data = \"\";\n if (val == sub) return 0;\n dataArray = val.toString().split(',');\n var index = $.inArray(sub, dataArray);\n dataArray.splice(index, 1);\n return dataArray.join();\n}",
"deleteVal(str) {\n\t\tvar sub... | [
"0.66989744",
"0.615324",
"0.6097065",
"0.6078783",
"0.59160215",
"0.5887385",
"0.5751531",
"0.5706532",
"0.5595195",
"0.5557081",
"0.5488317",
"0.54675454",
"0.5466561",
"0.5354575",
"0.5338592",
"0.53191656",
"0.53060836",
"0.53027904",
"0.5236537",
"0.5217721",
"0.52087337... | 0.51343733 | 30 |
Add the given arguments, add `position` to the returned node, and return the node. | function apply(node, parent) {
return pos(add(pos(node), parent), indent);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"assignPosition(node, position) {\n // update the position of the node\n node.position = position;\n \n // the base case\n if (node.children.length === 0)\n {\n leafNodeCounter = leafNodeCounter + 1;\n return node;\n }\n // recursive case... | [
"0.6184237",
"0.5976594",
"0.5897871",
"0.5891385",
"0.5836728",
"0.5836728",
"0.5836728",
"0.5836728",
"0.5836728",
"0.5836728",
"0.5797177",
"0.57895225",
"0.578314",
"0.5762615",
"0.573231",
"0.5724759",
"0.57198524",
"0.57198524",
"0.57198524",
"0.57198524",
"0.57198524",... | 0.0 | -1 |
Functions just like apply, but resets the content: the line and column are reversed, and the eaten value is readded. This is useful for nodes with a single type of content, such as lists and tables. See `apply` above for what parameters are expected. | function reset() {
var node = apply.apply(null, arguments);
line = current.line;
column = current.column;
value = subvalue + value;
return node;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function reset() {\n var node = apply.apply(null, arguments)\n\n line = current.line\n column = current.column\n value = subvalue + value\n\n return node\n }",
"_reset(line, column) {\n this.tagName = '';\n this.attributes = [];\n this.endTag = false;\n this.en... | [
"0.72795355",
"0.53835183",
"0.5181338",
"0.518",
"0.518",
"0.518",
"0.518",
"0.518",
"0.518",
"0.51663584",
"0.5156114",
"0.5098013",
"0.5072985",
"0.4976196",
"0.4880812",
"0.48687857",
"0.48530856",
"0.48391765",
"0.48253495",
"0.4817544",
"0.4776628",
"0.4767747",
"0.... | 0.71728957 | 4 |
Test the position, after eating, and reverse to a noteaten state. | function test() {
var result = pos({});
line = current.line;
column = current.column;
value = subvalue + value;
return result.position;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"backToPosition() {\n while (this.current_position != this.position) {\n this.closeDoors();\n if (this.current_position > this.position) {\n this.moveDown();\n console.log(this.current_position);\n } else if (this.current_position < this.position) {\n this.moveUp();\n }\n... | [
"0.5747144",
"0.55379176",
"0.55339026",
"0.54902875",
"0.54773253",
"0.54693604",
"0.5463387",
"0.5449033",
"0.54478693",
"0.53943497",
"0.5390149",
"0.5382457",
"0.5367056",
"0.5353433",
"0.53518414",
"0.53282654",
"0.53261423",
"0.5319799",
"0.5306259",
"0.5305748",
"0.528... | 0.49256462 | 97 |
Parse the bound file. | function parse() {
var self = this;
var value = String(self.file);
var start = {line: 1, column: 1, offset: 0};
var content = xtend(start);
var node;
/* Clean non-unix newlines: `\r\n` and `\r` are all
* changed to `\n`. This should not affect positional
* information. */
value = value.replace(EXP... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function parse(fileName) {\n\n var baseDir = path.dirname(fileName);\n\n var jsonData = parseFile(fileName);\n if (!jsonData) {\n return null;\n }\n\n jsonData = replace(baseDir, jsonData, 'segment');\n if (!jsonData) {\n return null;\n }\n\n\n if (jsonData.hasOwnProperty('seg... | [
"0.5563817",
"0.54014236",
"0.54014236",
"0.54014236",
"0.54014236",
"0.54014236",
"0.53815776",
"0.53685594",
"0.5361048",
"0.53508544",
"0.526773",
"0.52418554",
"0.52402407",
"0.5168292",
"0.516796",
"0.51584196",
"0.51400054",
"0.51273656",
"0.51238674",
"0.51143503",
"0.... | 0.4607834 | 78 |
Visit a single node. | function one(node, index, parents) {
var result = []
var subresult
if (!test || is(node, index, parents[parents.length - 1] || null)) {
result = toResult(visitor(node, parents))
if (result[0] === EXIT) {
return result
}
}
if (node.children && result[0] !== SKIP) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"visitNode(node) { }",
"visit() {\n if(this.state) this.state = Node.VISITED;\n }",
"function node(){}",
"function one(node, index, parent) {\n var result;\n\n index = index || (parent ? 0 : null);\n\n if (!type || node.type === type) {\n result = visitor(node, index, parent || null);\... | [
"0.7661173",
"0.6445177",
"0.64438576",
"0.62799275",
"0.61086637",
"0.6075337",
"0.6050634",
"0.6050634",
"0.60447025",
"0.59705806",
"0.5951017",
"0.59241366",
"0.59029406",
"0.59029406",
"0.59029406",
"0.59029406",
"0.58092374",
"0.58092374",
"0.58092374",
"0.58092374",
"0... | 0.0 | -1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.